| /external/clang/lib/Rewrite/Core/ |
| D | RewriteRope.cpp | 308 RopePieceBTreeLeaf *NewNode = new RopePieceBTreeLeaf(); in insert() local
312 &NewNode->Pieces[0]); in insert()
317 NewNode->NumPieces = NumPieces = WidthFactor; in insert()
320 NewNode->FullRecomputeSizeLocally(); in insert()
324 NewNode->insertAfterLeafInOrder(this); in insert()
330 NewNode->insert(Offset - this->size(), R); in insert()
331 return NewNode; in insert()
541 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior(); in HandleChildPiece() local
544 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
548 NewNode->NumChildren = NumChildren = WidthFactor; in HandleChildPiece()
[all …]
|
| D | DeltaTree.cpp | 302 DeltaTreeNode *NewNode; in DoSplit() local
309 NewNode = New; in DoSplit()
312 NewNode = new DeltaTreeNode(); in DoSplit()
316 memcpy(&NewNode->Values[0], &Values[WidthFactor], in DoSplit()
320 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1; in DoSplit()
323 NewNode->RecomputeFullDeltaLocally(); in DoSplit()
327 InsertRes.RHS = NewNode; in DoSplit()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | LegalizeTypes.cpp | 77 if (I->getNodeId() == NewNode) in PerformExpensiveChecks()
91 assert(UI->getNodeId() == NewNode && in PerformExpensiveChecks()
102 assert(NewVal.getNode()->getNodeId() != NewNode && in PerformExpensiveChecks()
124 if ((I->getNodeId() == NewNode && Mapped > 1) || in PerformExpensiveChecks()
125 (I->getNodeId() != NewNode && Mapped != 0)) { in PerformExpensiveChecks()
172 assert(UI->getNodeId() == NewNode && "NewNode used by non-NewNode!"); in PerformExpensiveChecks()
318 N->setNodeId(NewNode); in run()
333 assert(N->getNodeId() == NewNode && "Unexpected node state!"); in run()
370 if (NodeId == NewNode) in run()
423 if (I->getNodeId() == NewNode) in run()
[all …]
|
| D | ScheduleDAGRRList.cpp | 244 SUnit *NewNode = newSUnit(N); in CreateNewSUnit() local
246 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
248 return NewNode; in CreateNewSUnit()
255 SUnit *NewNode = Clone(N); in CreateClone() local
257 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
259 return NewNode; in CreateClone()
|
| D | LegalizeDAG.cpp | 1274 SDNode *NewNode = Node; in LegalizeOp() local
1290 NewNode = DAG.UpdateNodeOperands(Node, Node->getOperand(0), in LegalizeOp()
1305 NewNode = DAG.UpdateNodeOperands(Node, Node->getOperand(0), in LegalizeOp()
1312 if (NewNode != Node) { in LegalizeOp()
1313 DAG.ReplaceAllUsesWith(Node, NewNode); in LegalizeOp()
1315 DAG.TransferDbgValues(SDValue(Node, i), SDValue(NewNode, i)); in LegalizeOp()
1317 Node = NewNode; in LegalizeOp()
|
| D | LegalizeTypes.h | 48 NewNode = -1, enumerator
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LowerSwitch.cpp | 146 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in switchConvert() local
148 F->getBasicBlockList().insert(++FI, NewNode); in switchConvert()
152 NewNode->getInstList().push_back(Comp); in switchConvert()
153 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in switchConvert()
154 return NewNode; in switchConvert()
|
| D | BasicBlockUtils.cpp | 292 DomTreeNode *NewNode = DT->addNewBlock(New,Old); in SplitBlock() local
295 DT->changeImmediateDominator(*I, NewNode); in SplitBlock()
|
| D | CodeExtractor.cpp | 278 DomTreeNode *NewNode = DT->addNewBlock(New, *I); in splitReturnBlocks() local
282 DT->changeImmediateDominator(*I, NewNode); in splitReturnBlocks()
|
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| D | skiplist.h | 115 Node* NewNode(const Key& key, int height);
181 SkipList<Key,Comparator>::NewNode(const Key& key, int height) {
325 head_(NewNode(0 /* any key will do */, kMaxHeight)),
360 x = NewNode(key, height);
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| D | pagemap.h | 231 Node* NewNode() { in NewNode() function
244 root_ = NewNode(); in TCMalloc_PageMap3()
277 Node* n = NewNode(); in Ensure()
|
| /external/llvm/lib/Analysis/IPA/ |
| D | CallGraph.cpp | 324 CallSite NewCS, CallGraphNode *NewNode){ in replaceCallEdge() argument
330 I->second = NewNode; in replaceCallEdge()
331 NewNode->AddRef(); in replaceCallEdge()
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| D | TCPageMap.h | 204 Node* NewNode() { in NewNode() function
217 root_ = NewNode(); in init()
243 Node* n = NewNode(); in Ensure()
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| D | pagemap.h | 434 Node* NewNode() { in NewNode() function
447 root_ = NewNode(); in TCMalloc_PageMap3()
480 Node* n = NewNode(); in Ensure()
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| D | ftccache.c | 509 goto NewNode; in FTC_Cache_Lookup()
529 goto NewNode; in FTC_Cache_Lookup()
556 NewNode: in FTC_Cache_Lookup()
|
| /external/freetype/src/cache/ |
| D | ftccache.c | 509 goto NewNode; in FTC_Cache_Lookup()
529 goto NewNode; in FTC_Cache_Lookup()
556 NewNode: in FTC_Cache_Lookup()
|
| /external/llvm/utils/TableGen/ |
| D | DAGISelMatcherGen.cpp | 109 void AddMatcher(Matcher *NewNode);
184 void MatcherGen::AddMatcher(Matcher *NewNode) { in AddMatcher() argument
186 CurPredicate->setNext(NewNode); in AddMatcher()
188 TheMatcher = NewNode; in AddMatcher()
189 CurPredicate = NewNode; in AddMatcher()
|
| /external/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 1993 unsigned NewNode = 0; in overflow() local
1996 NewNode = Nodes == 1 ? 1 : Nodes - 1; in overflow()
1997 CurSize[Nodes] = CurSize[NewNode]; in overflow()
1998 Node[Nodes] = Node[NewNode]; in overflow()
1999 CurSize[NewNode] = 0; in overflow()
2000 Node[NewNode] = this->map->template newNode<NodeT>(); in overflow()
2019 if (NewNode && Pos == NewNode) { in overflow()
|
| /external/llvm/lib/Analysis/ |
| D | RegionInfo.cpp | 323 RegionNode *NewNode = new RegionNode(const_cast<Region*>(this), BB); in getBBNode() local
324 BBNodeMap.insert(std::make_pair(BB, NewNode)); in getBBNode()
325 return NewNode; in getBBNode()
|
| /external/llvm/include/llvm/Analysis/ |
| D | CallGraph.h | 293 void replaceCallEdge(CallSite CS, CallSite NewCS, CallGraphNode *NewNode);
|
| /external/llvm/lib/Target/X86/ |
| D | X86ISelDAGToDAG.cpp | 2627 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST8ri, dl, MVT::i32, in Select() local
2632 SDValue(NewNode, 0)); in Select()
2664 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST8ri_NOREX, dl, in Select() local
2669 SDValue(NewNode, 0)); in Select()
2686 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST16ri, dl, MVT::i32, in Select() local
2691 SDValue(NewNode, 0)); in Select()
2708 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST32ri, dl, MVT::i32, in Select() local
2713 SDValue(NewNode, 0)); in Select()
|
| D | X86InstrInfo.cpp | 4446 SDNode *NewNode= DAG.getMachineNode(Opc, dl, VTs, BeforeOps); in unfoldMemoryOperand() local
4447 NewNodes.push_back(NewNode); in unfoldMemoryOperand()
4452 AddrOps.push_back(SDValue(NewNode, 0)); in unfoldMemoryOperand()
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | RetainCountChecker.cpp | 2955 ExplodedNode *NewNode; in checkSummary() local
2957 NewNode = C.getPredecessor(); in checkSummary()
2959 NewNode = C.addTransition(state); in checkSummary()
2963 if (NewNode) { in checkSummary()
2969 SummaryLog[NewNode] = &Summ; in checkSummary()
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | ExprEngine.cpp | 1191 ExplodedNode *NewNode = G.getNode(NewNodeLoc, NewNodeState, false, &IsNew); in replayWithoutInlining() local
1197 NewNode->addPredecessor(BeforeProcessingCall, G); in replayWithoutInlining()
1200 Engine.enqueueStmtNode(NewNode, CalleeSF->getCallSiteBlock(), in replayWithoutInlining()
|
| D | BugReporter.cpp | 2844 if (const ExplodedNode *NewNode = ForwardMap.lookup(Nodes[i])) { in TrimmedGraph() local
2845 ReportNodes.push_back(std::make_pair(NewNode, i)); in TrimmedGraph()
2846 RemainingNodes.insert(NewNode); in TrimmedGraph()
|