HomeSort by relevance Sort by last modified time
    Searched refs:NewChild (Results 1 - 4 of 4) sorted by null

  /external/llvm/include/llvm/Analysis/
LoopInfo.h 242 /// the OldChild entry in our children list with NewChild, and updates the
243 /// parent pointer of OldChild to be null and the NewChild to be this loop.
245 void replaceChildLoopWith(LoopT *OldChild, LoopT *NewChild);
250 void addChildLoop(LoopT *NewChild) {
251 assert(NewChild->ParentLoop == 0 && "NewChild already has a parent!");
252 NewChild->ParentLoop = static_cast<LoopT *>(this);
253 SubLoops.push_back(NewChild);
LoopInfoImpl.h 219 /// the OldChild entry in our children list with NewChild, and updates the
220 /// parent pointer of OldChild to be null and the NewChild to be this loop.
224 replaceChildLoopWith(LoopT *OldChild, LoopT *NewChild) {
226 assert(NewChild->ParentLoop == 0 && "NewChild already has a parent!");
230 *I = NewChild;
232 NewChild->ParentLoop = static_cast<LoopT *>(this);
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
Antlr.Runtime.Tree.Tests.pas 411 T, NewChild: ICommonTree;
417 NewChild := TCommonTree.Create(TCommonToken.Create(99, 'x'));
418 T.ReplaceChildren(0, 2, NewChild);
443 T, NewChild: ICommonTree;
449 NewChild := TCommonTree.Create(TCommonToken.Create(99, 'x'));
450 T.ReplaceChildren(0, 0, NewChild);
457 T, NewChild: ICommonTree;
463 NewChild := TCommonTree.Create(TCommonToken.Create(99, 'x'));
464 T.ReplaceChildren(2, 2, NewChild);
471 T, NewChild: ICommonTree
    [all...]
  /external/llvm/utils/TableGen/
CodeGenDAGPatterns.cpp     [all...]

Completed in 3635 milliseconds