| /external/chromium_org/v8/test/cctest/compiler/ |
| test-instruction.cc | 61 Node* node = graph.NewNode(common.Int32Constant(val));
67 Node* node = graph.NewNode(common.Float64Constant(val));
73 Node* node = graph.NewNode(common.Parameter(which));
78 Node* NewNode(BasicBlock* block) {
79 Node* node = graph.NewNode(common.Int32Constant(111));
|
| test-representation-change.cc | 32 Node* s = graph()->NewNode(common()->Start(num_parameters));
68 return graph()->NewNode(common()->Parameter(index), graph()->start());
|
| codegen-tester.h | 242 return m->NewNode(op(m->machine()), a, b);
|
| test-run-machops.cc | 79 m.Return(m.NewNode(ops[i], a, b));
752 m.NewNode(shops[n], m.Parameter(1),
844 m.NewNode(shops[n], m.Parameter(1), m.Parameter(2))),
1089 m.NewNode(shops[n], m.Parameter(1),
[all...] |
| /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/chromium_org/v8/src/compiler/ |
| js-generic-lowering.cc | 171 graph()->NewNode(common()->Call(desc_compare),
240 Node* test = graph()->NewNode(machine()->WordEqual(), node->InputAt(0),
337 0, graph()->NewNode(
354 0, graph()->NewNode(
|
| simplified-lowering.cc | 791 return graph()->NewNode(machine()->WordAnd(), node,
808 return graph()->NewNode(machine()->WordSar(), node, shift_amount);
815 return graph()->NewNode(machine()->WordShl(), node, shift_amount);
[all...] |
| machine-operator-reducer.cc | 25 return graph()->NewNode(common()->Float32Constant(value));
40 return graph()->NewNode(common()->Int64Constant(value));
|
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherGen.cpp | 114 void AddMatcher(Matcher *NewNode);
194 void MatcherGen::AddMatcher(Matcher *NewNode) {
196 CurPredicate->setNext(NewNode);
198 TheMatcher = NewNode;
199 CurPredicate = NewNode;
[all...] |
| /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/llvm/include/llvm/ADT/ |
| IntervalMap.h | [all...] |
| /external/llvm/include/llvm/Analysis/ |
| CallGraph.h | 264 void replaceCallEdge(CallSite CS, CallSite NewCS, CallGraphNode *NewNode);
|
| /external/llvm/lib/Transforms/Utils/ |
| CloneFunction.cpp | 173 MDNode *NewNode = MDNode::get(Node->getContext(), Operands);
174 Node->replaceAllUsesWith(NewNode);
|
| BasicBlockUtils.cpp | 295 DomTreeNode *NewNode = DT.addNewBlock(New, Old);
298 DT.changeImmediateDominator(*I, NewNode);
[all...] |
| CodeExtractor.cpp | 279 DomTreeNode *NewNode = DT->addNewBlock(New, *I);
283 DT->changeImmediateDominator(*I, NewNode);
|
| /external/llvm/lib/Analysis/ |
| RegionInfo.cpp | 319 RegionNode *NewNode = new RegionNode(const_cast<Region*>(this), BB);
320 BBNodeMap.insert(std::make_pair(BB, NewNode));
321 return NewNode;
|
| /external/llvm/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 246 SUnit *NewNode = newSUnit(N);
248 if (NewNode->NodeNum >= NumSUnits)
250 return NewNode;
257 SUnit *NewNode = Clone(N);
259 if (NewNode->NodeNum >= NumSUnits)
261 return NewNode;
[all...] |
| LegalizeDAG.cpp | [all...] |
| LegalizeTypes.h | 45 /// NewNode - This is a new node, not before seen, that was created in the
47 NewNode = -1,
[all...] |
| DAGCombiner.cpp | [all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExprEngine.cpp | [all...] |
| BugReporter.cpp | [all...] |
| /external/pdfium/core/include/fxcrt/ |
| fx_basic.h | 1184 CNode* NewNode(CNode* pPrev, CNode* pNext);
[all...] |
