Lines Matching defs:iterator
103 BasicBlock::iterator InsertPt) const {
209 typedef SmallVectorImpl<Slice>::iterator iterator;
210 typedef iterator_range<iterator> range;
211 iterator begin() { return Slices.begin(); }
212 iterator end() { return Slices.end(); }
221 void erase(iterator Start, iterator Stop) { Slices.erase(Start, Stop); }
236 // Forward declare the iterator and range accessor for walking the
322 typedef AllocaSlices::iterator iterator;
329 iterator SI, SJ;
335 /// the given iterator.
336 Partition(iterator SI) : SI(SI), SJ(SI) {}
370 iterator begin() const { return SI; }
371 iterator end() const { return SJ; }
382 /// \brief An iterator over partitions of the alloca's slices.
384 /// This iterator implements the core algorithm for partitioning the alloca's
385 /// slices. It is a forward iterator as we don't support backtracking for
389 /// It is templated on the slice iterator type to use so that it can operate
401 AllocaSlices::iterator SE;
407 /// \brief Sets the partition to be empty at given iterator, and sets the
408 /// end iterator.
409 partition_iterator(AllocaSlices::iterator SI, AllocaSlices::iterator SE)
417 /// \brief Advance the iterator to the next partition.
419 /// Requires that the iterator not be at the end of the slices.
453 // now have an end iterator.
547 // The observed positions of partitions is marked by the P.SI iterator and
549 // P.SI == SE, as the end iterator will additionally have an empty split
573 /// This accesses an iterator range over the partitions of the alloca's
809 SmallDenseMap<Instruction *, unsigned>::iterator MTPI =
832 SmallDenseMap<Instruction *, unsigned>::iterator MTPI;
1148 for (BasicBlock::iterator BBI(PN); &*BBI != LI; ++BBI)
2429 IRB.SetInsertPoint(&*std::next(BasicBlock::iterator(&LI)));
3899 for (SmallPtrSetImpl<PHINode *>::iterator I = PHIUsers.begin(),
3908 for (SmallPtrSetImpl<SelectInst *>::iterator I = SelectUsers.begin(),
4204 for (BasicBlock::iterator I = EntryBB.begin(), E = std::prev(EntryBB.end());
