212       : mIterator{aIterator},  in Initializer()
236   ContentIteratorBase& mIterator;  member in mozilla::ContentIteratorBase::Initializer
258   mIterator.mClosestCommonInclusiveAncestor =  in Run()
261   if (NS_WARN_IF(!mIterator.mClosestCommonInclusiveAncestor)) {  in Run()
273     mIterator.SetEmpty();  in Run()
278     mIterator.mFirst = mStart.Container()->AsContent();  in Run()
279     mIterator.mLast = mIterator.mFirst;  in Run()
280     mIterator.mCurNode = mIterator.mFirst;  in Run()
285   mIterator.mFirst = DetermineFirstNode();  in Run()
291     mIterator.mLast = lastNode.unwrap();  in Run()
295   if (!mIterator.mFirst || !mIterator.mLast) {  in Run()
296     mIterator.mFirst = nullptr;  in Run()
297     mIterator.mLast = nullptr;  in Run()
300   mIterator.mCurNode = mIterator.mFirst;  in Run()
301   mIterator.mIsDone = !mIterator.mCurNode;  in Run()
318     if (mIterator.mOrder == Order::Pre) {  in DetermineFirstNode()
343                 result, mIterator.mOrder == Order::Pre, mStart, mEnd))) {  in DetermineFirstNode()
360   if (mIterator.mOrder == Order::Pre) {  in DetermineFirstNode()
370   if (result && !NodeIsInTraversalRange(result, mIterator.mOrder == Order::Pre,  in DetermineFirstNode()
384     if (mIterator.mOrder == Order::Pre) {  in DetermineLastNode()
400         nsINode* const result = mIterator.PrevNode(mEnd.Container());  in DetermineLastNode()
402         if (result && result != mIterator.mFirst &&  in DetermineLastNode()
404                 result, mIterator.mOrder == Order::Pre,  in DetermineLastNode()
405                 RawRangeBoundary(mIterator.mFirst, 0u), mEnd))) {  in DetermineLastNode()
425       if (!NodeIsInTraversalRange(result, mIterator.mOrder == Order::Pre,  in DetermineLastNode()
442   if (mIterator.mOrder == Order::Pre) {  in DetermineLastNode()
447             result, mIterator.mOrder == Order::Pre, mStart, mEnd))) {  in DetermineLastNode()