Searched refs:mPath (Results 1 – 3 of 3) sorted by relevance
105 mMaxDepth = std::max(mMaxDepth, static_cast<int>(mPath.size())); in incrementDepth()106 mPath.push_back(current); in incrementDepth()111 void decrementDepth() { mPath.pop_back(); } in decrementDepth()113 int getCurrentTraversalDepth() const { return static_cast<int>(mPath.size()) - 1; } in getCurrentTraversalDepth()140 return mPath.size() <= 1 ? nullptr : mPath[mPath.size() - 2u]; in getParentNode()146 if (mPath.size() > n + 1u) in getAncestorNode()148 return mPath[mPath.size() - n - 2u]; in getAncestorNode()173 ASSERT(!mPath.empty()); in getRootNode()174 return mPath.front(); in getRootNode()330 TVector<TIntermNode *> mPath; variable
274 if (mPath.back() == parentBlock.node) in insertStatementsInParentBlock()598 queueReplacementWithParent(getParentNode(), mPath.back(), replacement, originalStatus); in queueReplacement()
719 mPath.push_back(current); in incrementDepth()725 mPath.pop_back(); in decrementDepth()730 return mPath.size() == 0 ? nullptr : mPath.back(); in getParentNode()742 TVector<TIntermNode *> mPath; variable