Searched refs:FnTree (Results 1 – 2 of 2) sorted by relevance
185 ``FnTree`` – the set of all unique functions. It keeps items that couldn't be188 ``std::set<FunctionNode> FnTree;``195 ``FnTree`` already. Obviously such functions should be rechecked again. In this196 case we remove them from ``FnTree``, and mark them as to be rescanned, namely209 insert it into *FnTree*: check whether *FCur* is equal to one of functions210 in *FnTree*. If there *is* equal function in *FnTree* (call it *FExists*):212 to *FnTree*.672 Operation affects ``FnTree`` contents with next way: *F* will stay in673 ``FnTree``. *G* being equal to *F* will not be added to ``FnTree``. Calls of676 ``FnTree``, and analyzed again.[all …]
1118 FnTreeType FnTree; member in __anon7fe985500211::MergeFunctions1247 DEBUG(dbgs() << "size of FnTree: " << FnTree.size() << '\n'); in runOnModule()1250 FnTree.clear(); in runOnModule()1413 FnTree.insert(FunctionNode(NewFunction)); in insert()1450 FnTreeType::iterator found = FnTree.find(FunctionNode(F)); in remove()1452 if (found != FnTree.end() && found->getFunc() == F) { in remove()1454 FnTree.erase(found); in remove()