Home
last modified time | relevance | path

Searched refs:mInsertions (Results 1 – 2 of 2) sorted by relevance

/external/angle/src/compiler/translator/tree_util/
DIntermTraverse.cpp282 mInsertions.push_back(insert); in insertStatementsInParentBlock()
301 mInsertions.emplace_back(parent, position, insertionsBefore, insertionsAfter); in insertStatementsInBlockAtPosition()
516 std::stable_sort(mInsertions.begin(), mInsertions.end(), CompareInsertion); in updateTree()
517 for (size_t ii = 0; ii < mInsertions.size(); ++ii) in updateTree()
521 const NodeInsertMultipleEntry &insertion = mInsertions[mInsertions.size() - ii - 1]; in updateTree()
576 mInsertions.clear(); in clearReplacementQueue()
DIntermTraverse.h301 std::vector<NodeInsertMultipleEntry> mInsertions; variable