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

/external/llvm/include/llvm/Analysis/
H A DLoopInfo.h247 /// the OldChild entry in our children list with NewChild, and updates the
248 /// parent pointer of OldChild to be null and the NewChild to be this loop.
250 void replaceChildLoopWith(LoopT *OldChild, LoopT *NewChild);
255 void addChildLoop(LoopT *NewChild) { argument
256 assert(NewChild->ParentLoop == 0 && "NewChild already has a parent!");
257 NewChild->ParentLoop = static_cast<LoopT *>(this);
258 SubLoops.push_back(NewChild);
H A DLoopInfoImpl.h218 /// the OldChild entry in our children list with NewChild, and updates the
219 /// parent pointer of OldChild to be null and the NewChild to be this loop.
223 replaceChildLoopWith(LoopT *OldChild, LoopT *NewChild) { argument
225 assert(NewChild->ParentLoop == 0 && "NewChild already has a parent!");
229 *I = NewChild;
231 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.cpp1164 TreePatternNode *NewChild = ArgMap[Child->getName()]; local
1165 assert(NewChild && "Couldn't find formal argument!");
1167 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
1169 setChild(i, NewChild);
1189 TreePatternNode *NewChild = Child->InlinePatternFragments(TP); local
1192 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
1195 setChild(i, NewChild);

Completed in 284 milliseconds