Searched refs:NewChild (Results 1 - 4 of 4) sorted by relevance

/external/llvm/include/llvm/Analysis/
H A DLoopInfo.h259 /// the OldChild entry in our children list with NewChild, and updates the
260 /// parent pointer of OldChild to be null and the NewChild to be this loop.
262 void replaceChildLoopWith(LoopT *OldChild, LoopT *NewChild);
267 void addChildLoop(LoopT *NewChild) { argument
268 assert(!NewChild->ParentLoop && "NewChild already has a parent!");
269 NewChild->ParentLoop = static_cast<LoopT *>(this);
270 SubLoops.push_back(NewChild);
H A DLoopInfoImpl.h206 /// the OldChild entry in our children list with NewChild, and updates the
207 /// parent pointer of OldChild to be null and the NewChild to be this loop.
211 replaceChildLoopWith(LoopT *OldChild, LoopT *NewChild) { argument
213 assert(!NewChild->ParentLoop && "NewChild already has a parent!");
217 *I = NewChild;
219 NewChild->ParentLoop = static_cast<LoopT *>(this);
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
H A DAntlr.Runtime.Tree.Tests.pas411 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
[all...]
/external/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.cpp1249 TreePatternNode *NewChild = ArgMap[Child->getName()]; local
1250 assert(NewChild && "Couldn't find formal argument!");
1252 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
1254 setChild(i, NewChild);
1278 TreePatternNode *NewChild = Child->InlinePatternFragments(TP); local
1281 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
1284 setChild(i, NewChild);

Completed in 321 milliseconds