reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
247 iterator begin() { return Slices.begin(); } 248 iterator end() { return Slices.end(); } 253 const_iterator begin() const { return Slices.begin(); } 254 const_iterator end() const { return Slices.end(); } 258 void erase(iterator Start, iterator Stop) { Slices.erase(Start, Stop); } 266 int OldSize = Slices.size(); 267 Slices.append(NewSlices.begin(), NewSlices.end()); 268 auto SliceI = Slices.begin() + OldSize; 269 llvm::sort(SliceI, Slices.end()); 270 std::inplace_merge(Slices.begin(), SliceI, Slices.end()); 270 std::inplace_merge(Slices.begin(), SliceI, Slices.end()); 706 AS.Slices.push_back(Slice(BeginOffset, EndOffset, U, IsSplittable)); 879 AS.Slices[MTPI->second].kill(); 901 MemTransferSliceMap.insert(std::make_pair(&II, AS.Slices.size())); 904 Slice &PrevP = AS.Slices[PrevIdx]; 922 assert(AS.Slices[PrevIdx].getUse()->getUser() == &II && 1067 Slices.erase( 1068 llvm::remove_if(Slices, [](const Slice &S) { return S.isDead(); }), 1069 Slices.end()); 1075 std::shuffle(Slices.begin(), Slices.end(), MT); 1075 std::shuffle(Slices.begin(), Slices.end(), MT); 1081 llvm::sort(Slices);