/frameworks/compile/mclinker/unittests/ |
GCFactoryListTraitsTest.cpp | 93 Node* NewNode = m_NodeFactory.produce(11); 94 m_pNodeList.push_back(NewNode);
|
/external/pdfium/core/src/fxcrt/ |
fx_basic_list.cpp | 18 CNode* pNewNode = NewNode(m_pNodeTail, NULL); 29 CNode* pNewNode = NewNode(NULL, m_pNodeHead); 44 CNode* pNewNode = NewNode(pOldNode, pOldNode->pNext); 82 CFX_PtrList::CNode* CFX_PtrList::NewNode(CFX_PtrList::CNode* pPrev,
|
/external/v8/src/compiler/ |
graph.cc | 45 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs,
|
graph.h | 60 Node* NewNode(const Operator* op, int input_count, Node* const* inputs, 64 Node* NewNode(const Operator* op) { 65 return NewNode(op, 0, static_cast<Node* const*>(nullptr)); 67 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } 68 Node* NewNode(const Operator* op, Node* n1, Node* n2) { 70 return NewNode(op, arraysize(nodes), nodes); 72 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { 74 return NewNode(op, arraysize(nodes), nodes); 76 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) [all...] |
bytecode-graph-builder.h | 55 Node* NewNode(const Operator* op, bool incomplete = false) { 59 Node* NewNode(const Operator* op, Node* n1) { 64 Node* NewNode(const Operator* op, Node* n1, Node* n2) { 69 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { 74 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { 80 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } 81 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } 82 Node* NewMerge() { return NewNode(common()->Merge(1), true); } 83 Node* NewLoop() { return NewNode(common()->Loop(1), true); } 85 return NewNode(common()->Branch(hint), condition) [all...] |
ast-graph-builder.h | 45 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } 46 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } 47 Node* NewMerge() { return NewNode(common()->Merge(1), true); } 48 Node* NewLoop() { return NewNode(common()->Loop(1), true); } 50 return NewNode(common()->Branch(hint), condition); 177 Node* NewNode(const Operator* op, bool incomplete = false) { 181 Node* NewNode(const Operator* op, Node* n1) { 185 Node* NewNode(const Operator* op, Node* n1, Node* n2) { 190 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { 195 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) [all...] |
/external/clang/lib/Rewrite/ |
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;
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
LegalizeTypes.h | 45 /// NewNode - This is a new node, not before seen, that was created in the 47 NewNode = -1, [all...] |
ScheduleDAGRRList.cpp | 245 SUnit *NewNode = newSUnit(N); 247 if (NewNode->NodeNum >= NumSUnits) 249 return NewNode; 256 SUnit *NewNode = Clone(N); 258 if (NewNode->NodeNum >= NumSUnits) 260 return NewNode; [all...] |
DAGCombiner.cpp | [all...] |
/external/v8/test/cctest/compiler/ |
test-instruction.cc | 55 Node* node = graph.NewNode(common.Int32Constant(val)); 61 Node* node = graph.NewNode(common.Float64Constant(val)); 67 Node* node = graph.NewNode(common.Parameter(which)); 72 Node* NewNode(BasicBlock* block) { 73 Node* node = graph.NewNode(common.Int32Constant(111));
|
graph-builder-tester.h | 81 Node* start = graph()->NewNode(common()->Start(num_parameters + 3)); 88 graph()->NewNode(common()->Return(), value, effect_, graph()->start()); 94 Node* end = graph()->NewNode(common()->End(1), return_); 100 return kPointerSize == 8 ? NewNode(common()->Int64Constant(intptr_value)) 104 return NewNode(common()->Int32Constant(value)); 107 return NewNode(common()->HeapConstant(object)); 110 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a); } 113 return NewNode(simplified()->NumberEqual(), a, b); 116 return NewNode(simplified()->NumberLessThan(), a, b); 119 return NewNode(simplified()->NumberLessThanOrEqual(), a, b) [all...] |
/external/llvm/lib/Transforms/Utils/ |
BasicBlockUtils.cpp | 305 DomTreeNode *NewNode = DT->addNewBlock(New, Old); 308 DT->changeImmediateDominator(*I, NewNode); 731 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); 733 DT->changeImmediateDominator(Child, NewNode); [all...] |
CodeExtractor.cpp | 280 DomTreeNode *NewNode = DT->addNewBlock(New, *I); 284 DT->changeImmediateDominator(*I, NewNode);
|
LowerSwitch.cpp | 278 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); 284 NewUpperBound, Val, NewNode, OrigBlock, 287 UpperBound, Val, NewNode, OrigBlock, 290 F->getBasicBlockList().insert(++OrigBlock->getIterator(), NewNode); 291 NewNode->getInstList().push_back(Comp); 293 BranchInst::Create(LBranch, RBranch, Comp, NewNode); 294 return NewNode;
|
/external/llvm/include/llvm/Analysis/ |
RegionInfoImpl.h | 353 RegionNodeT *NewNode = new RegionNodeT(static_cast<RegionT *>(Deconst), BB); 354 BBNodeMap.insert(std::make_pair(BB, NewNode)); 355 return NewNode;
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
dxtmpl.h | 359 CNode *NewNode(CNode *,CNode *); 460 CDXList<TYPE,ARG_TYPE>::NewNode(CNode *pPrev,CNode *pNext) { 493 CNode *pNewNode = NewNode(NULL,m_pNodeHead); 504 CNode *pNewNode = NewNode(m_pNodeTail,NULL); 563 CNode *pNewNode = NewNode(pOldNode->pPrev,pOldNode); 582 CNode *pNewNode = NewNode(pOldNode,pOldNode->pNext);
|
/external/clang/lib/StaticAnalyzer/Core/ |
ExprEngine.cpp | [all...] |
/external/llvm/lib/Analysis/ |
CFLAliasAnalysis.cpp | 600 auto NewNode = Node(Index); 602 return NewNode; 819 auto NewNode = Graph.addNode(); 820 Iter->second = NewNode; [all...] |
/external/llvm/lib/Target/Hexagon/ |
HexagonCommonGEP.cpp | 951 GepNode *C = 0, *NewNode = 0; 959 NewNode = NewN; 966 if (!NewNode) 969 // Move over all uses that share the same user as U from Node to NewNode. 989 NewNode->Flags |= GepNode::Used; 990 DEBUG(dbgs() << "new node: " << NewNode << " " << *NewNode << '\n'); 992 Uses[NewNode] = NewUs; [all...] |
/external/llvm/lib/Target/X86/ |
X86ISelDAGToDAG.cpp | [all...] |
X86InstrInfo.cpp | [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
DataFlowSanitizer.cpp | [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
RetainCountChecker.cpp | [all...] |
/external/llvm/lib/Target/PowerPC/ |
PPCISelLowering.cpp | [all...] |