/external/clang/lib/Rewrite/ |
RewriteRope.cpp | 311 RopePieceBTreeLeaf *NewNode = new RopePieceBTreeLeaf(); 313 // Move over the last 'WidthFactor' values from here to NewNode. 315 &NewNode->Pieces[0]); 320 NewNode->NumPieces = NumPieces = WidthFactor; 323 NewNode->FullRecomputeSizeLocally(); 327 NewNode->insertAfterLeafInOrder(this); 333 NewNode->insert(Offset - this->size(), R); 334 return NewNode; 540 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior(); 542 // Move over the last 'WidthFactor' values from here to NewNode [all...] |
DeltaTree.cpp | 305 DeltaTreeNode *NewNode; 312 NewNode = New; 315 NewNode = new DeltaTreeNode(); 318 // Move over the last 'WidthFactor-1' values from here to NewNode. 319 memcpy(&NewNode->Values[0], &Values[WidthFactor], 323 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1; 326 NewNode->RecomputeFullDeltaLocally(); 330 InsertRes.RHS = NewNode;
|
/external/llvm/lib/Transforms/Utils/ |
LowerSwitch.cpp | 158 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); 160 F->getBasicBlockList().insert(++FI, NewNode); 164 NewNode->getInstList().push_back(Comp); 165 BranchInst::Create(LBranch, RBranch, Comp, NewNode); 166 return NewNode;
|
BasicBlockUtils.cpp | 308 DomTreeNode *NewNode = DT->addNewBlock(New,Old); 311 DT->changeImmediateDominator(*I, NewNode);
|
CodeExtractor.cpp | 197 DomTreeNode *NewNode = DT->addNewBlock(New, *I); 201 DT->changeImmediateDominator(*I, NewNode);
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
LegalizeTypes.cpp | 41 // Note that it is possible to have nodes marked NewNode in the DAG. This can 46 // into a different node, leaving the original node as a NewNode in the DAG. 56 // The conclusion is that though there may be nodes marked NewNode in the DAG, 57 // all uses of such nodes are also marked NewNode: the result is a fungus of 62 // by nodes marked NewNode (see above). 64 // The final node obtained by mapping by ReplacedValues is not marked NewNode. 69 // also map nodes marked NewNode if the deallocated memory was reallocated as 76 // Remember nodes marked NewNode - they are subject to extra checking below. 77 if (I->getNodeId() == NewNode) 87 // Check that remapped values are only used by nodes marked NewNode [all...] |
ScheduleDAGRRList.cpp | 253 SUnit *NewNode = NewSUnit(N); 255 if (NewNode->NodeNum >= NumSUnits) 257 return NewNode; 264 SUnit *NewNode = Clone(N); 266 if (NewNode->NodeNum >= NumSUnits) 268 return NewNode; [all...] |
LegalizeTypes.h | 46 /// NewNode - This is a new node, not before seen, that was created in the 48 NewNode = -1, [all...] |
/external/llvm/lib/Analysis/IPA/ |
CallGraph.cpp | 326 CallSite NewCS, CallGraphNode *NewNode){ 332 I->second = NewNode; 333 NewNode->AddRef();
|
/external/webkit/Source/JavaScriptCore/wtf/ |
TCPageMap.h | 213 Node* NewNode() { 226 root_ = NewNode(); 252 Node* n = NewNode();
|
/external/llvm/utils/TableGen/ |
DAGISelMatcherGen.cpp | 108 void AddMatcher(Matcher *NewNode); 188 void MatcherGen::AddMatcher(Matcher *NewNode) { 190 CurPredicate->setNext(NewNode); 192 TheMatcher = NewNode; 193 CurPredicate = NewNode; [all...] |
/external/llvm/include/llvm/ADT/ |
IntervalMap.h | [all...] |
/external/llvm/include/llvm/Analysis/ |
CallGraph.h | 293 void replaceCallEdge(CallSite CS, CallSite NewCS, CallGraphNode *NewNode);
|
/external/llvm/lib/Analysis/ |
RegionInfo.cpp | 309 RegionNode *NewNode = new RegionNode(const_cast<Region*>(this), BB); 310 BBNodeMap.insert(std::make_pair(BB, NewNode)); 311 return NewNode;
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
RetainCountChecker.cpp | [all...] |
/external/llvm/lib/Target/X86/ |
X86InstrInfo.cpp | [all...] |
/external/llvm/lib/Target/PowerPC/ |
PPCISelLowering.cpp | [all...] |