| /external/clang/lib/Rewrite/Core/ |
| DeltaTree.cpp | 302 DeltaTreeNode *NewNode;
309 NewNode = New;
312 NewNode = new DeltaTreeNode();
315 // Move over the last 'WidthFactor-1' values from here to NewNode.
316 memcpy(&NewNode->Values[0], &Values[WidthFactor],
320 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1;
323 NewNode->RecomputeFullDeltaLocally();
327 InsertRes.RHS = NewNode;
|
| RewriteRope.cpp | 308 RopePieceBTreeLeaf *NewNode = new RopePieceBTreeLeaf();
310 // Move over the last 'WidthFactor' values from here to NewNode.
312 &NewNode->Pieces[0]);
317 NewNode->NumPieces = NumPieces = WidthFactor;
320 NewNode->FullRecomputeSizeLocally();
324 NewNode->insertAfterLeafInOrder(this);
330 NewNode->insert(Offset - this->size(), R);
331 return NewNode;
541 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior();
543 // Move over the last 'WidthFactor' values from here to NewNode
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| GCFactoryListTraitsTest.cpp | 95 Node *NewNode = m_NodeFactory.produce(11);
96 m_pNodeList.push_back(NewNode);
|
| /external/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 146 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock");
148 F->getBasicBlockList().insert(++FI, NewNode);
152 NewNode->getInstList().push_back(Comp);
153 BranchInst::Create(LBranch, RBranch, Comp, NewNode);
154 return NewNode;
|
| BasicBlockUtils.cpp | 292 DomTreeNode *NewNode = DT->addNewBlock(New,Old);
295 DT->changeImmediateDominator(*I, NewNode);
|
| CodeExtractor.cpp | 278 DomTreeNode *NewNode = DT->addNewBlock(New, *I);
282 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 | 244 SUnit *NewNode = newSUnit(N);
246 if (NewNode->NodeNum >= NumSUnits)
248 return NewNode;
255 SUnit *NewNode = Clone(N);
257 if (NewNode->NodeNum >= NumSUnits)
259 return NewNode;
[all...] |
| LegalizeDAG.cpp | [all...] |
| LegalizeTypes.h | 46 /// NewNode - This is a new node, not before seen, that was created in the
48 NewNode = -1,
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| 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/WebKit/Source/wtf/ |
| TCPageMap.h | 204 Node* NewNode() {
217 root_ = NewNode();
243 Node* n = NewNode();
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| pagemap.h | 231 Node* NewNode() {
244 root_ = NewNode();
277 Node* n = NewNode();
|
| /external/llvm/lib/Analysis/IPA/ |
| CallGraph.cpp | 324 CallSite NewCS, CallGraphNode *NewNode){
330 I->second = NewNode;
331 NewNode->AddRef();
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| pagemap.h | 434 Node* NewNode() {
447 root_ = NewNode();
480 Node* n = NewNode();
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| ftccache.c | 509 goto NewNode;
529 goto NewNode;
556 NewNode:
|
| /external/freetype/src/cache/ |
| ftccache.c | 509 goto NewNode;
529 goto NewNode;
556 NewNode:
|
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherGen.cpp | 109 void AddMatcher(Matcher *NewNode);
184 void MatcherGen::AddMatcher(Matcher *NewNode) {
186 CurPredicate->setNext(NewNode);
188 TheMatcher = NewNode;
189 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 | 323 RegionNode *NewNode = new RegionNode(const_cast<Region*>(this), BB);
324 BBNodeMap.insert(std::make_pair(BB, NewNode));
325 return NewNode;
|
| /external/llvm/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | [all...] |
| X86InstrInfo.cpp | [all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExprEngine.cpp | [all...] |
| BugReporter.cpp | [all...] |
