/external/chromium_org/v8/test/cctest/compiler/ |
test-changes-lowering.cc | 107 Node* change = this->graph()->NewNode(op, p0); 108 Node* ret = this->graph()->NewNode(this->common()->Return(), change, 110 Node* end = this->graph()->NewNode(this->common()->End(), ret); 120 Node* change = this->graph()->NewNode(op, p0); 121 Node* store = this->graph()->NewNode( 124 Node* ret = this->graph()->NewNode( 126 Node* end = this->graph()->NewNode(this->common()->End(), ret); 136 this->graph()->NewNode(load_op, this->PointerConstant(location), 138 Node* change = this->graph()->NewNode(op, load); 139 Node* ret = this->graph()->NewNode(this->common()->Return(), change [all...] |
test-phi-reducer.cc | 21 self(graph.NewNode(common.Start(num_parameters))), 22 dead(graph.NewNode(common.Dead())) { 44 return graph.NewNode(common.Int32Constant(val)); 48 return graph.NewNode(common.Float64Constant(val)); 52 return graph.NewNode(common.Parameter(index), graph.start()); 56 return SetSelfReferences(graph.NewNode(common.Phi(kMachAnyTagged, 1), a)); 61 graph.NewNode(common.Phi(kMachAnyTagged, 2), a, b)); 66 graph.NewNode(common.Phi(kMachAnyTagged, 3), a, b, c)); 71 graph.NewNode(common.Phi(kMachAnyTagged, 4), a, b, c, d)); 76 graph.NewNode(common.Phi(kMachAnyTagged, 1), a, control)) [all...] |
test-simplified-lowering.cc | 654 start = graph()->NewNode(common()->Start(2)); 657 graph()->NewNode(common()->Return(), jsgraph.Constant(0), start, start); 658 end = graph()->NewNode(common()->End(), ret); 660 p0 = graph()->NewNode(common()->Parameter(0), start); 661 p1 = graph()->NewNode(common()->Parameter(1), start); 662 p2 = graph()->NewNode(common()->Parameter(2), start); 669 Node* node = Return(graph()->NewNode(op, p0, p1)); 676 Node* node = graph()->NewNode(op, p0, p1); 677 Return(graph()->NewNode(trunc, node)); 699 return graph()->NewNode(machine()->Int32Add(), jsgraph.Int32Constant(1) [all...] |
graph-builder-tester.cc | 28 parameters_[i] = builder->NewNode(common->Parameter(i), graph_->start());
|
test-machine-operator-reducer.cc | 62 Node* s = graph.NewNode(common.Start(num_parameters)); 79 return graph.NewNode(NewConstantOperator<T>(&common, value)); 99 Node* n = graph.NewNode(binop, a, b); 111 Node* n = graph.NewNode(binop, a, b); 123 Node* n = graph.NewNode(binop, left, right); 138 Node* n = graph.NewNode(binop, left, right); 153 Node* n = graph.NewNode(binop, left, right); 170 Node* n = graph.NewNode(binop, k, p); 178 Node* n = graph.NewNode(binop, p, k); 194 Node* n = graph.NewNode(binop, k, p) [all...] |
test-node-cache.cc | 40 Node* node = graph.NewNode(common.Int32Constant(k)); 60 nodes[i] = graph.NewNode(common.Int32Constant(v)); 101 nodes[i] = graph.NewNode(common.Int32Constant(i)); 146 nodes[i] = graph.NewNode(common.Int32Constant(k));
|
test-js-typed-lowering.cc | 30 Node* s = graph.NewNode(common.Start(num_parameters)); 46 Node* n = graph.NewNode(common.Parameter(index), graph.start()); 54 return graph.NewNode(common.HeapConstant(unique)); 59 return graph.NewNode(common.HeapConstant(unique)); 63 Node* parameters = graph.NewNode(common.StateValues(0)); 64 Node* locals = graph.NewNode(common.StateValues(0)); 65 Node* stack = graph.NewNode(common.StateValues(0)); 68 graph.NewNode(common.FrameState(JS_FRAME, BailoutId(0), kIgnoreOutput), 86 context_node = graph.NewNode(common.Parameter(-1), graph.start()); 113 return graph.NewNode(op, left, right, context(), start(), control()) [all...] |
graph-builder-tester.h | 31 return graph()->NewNode(op, value_input_count, value_inputs);
|
/external/chromium_org/v8/src/compiler/ |
js-builtin-reducer-unittest.cc | 32 Node* n = graph()->NewNode(common()->Parameter(index), graph()->start()); 72 Node* call = graph()->NewNode(javascript()->Call(3, NO_CALL_FUNCTION_FLAGS), 90 Node* call = graph()->NewNode(javascript()->Call(2, NO_CALL_FUNCTION_FLAGS), 105 Node* call = graph()->NewNode(javascript()->Call(3, NO_CALL_FUNCTION_FLAGS), 124 graph()->NewNode(javascript()->Call(4, NO_CALL_FUNCTION_FLAGS), fun, 160 graph()->NewNode(javascript()->Call(4, NO_CALL_FUNCTION_FLAGS), fun,
|
change-lowering-unittest.cc | 72 return graph()->NewNode(common()->Parameter(index), graph()->start()); 127 Node* node = graph()->NewNode(simplified()->ChangeBitToBool(), val); 144 Node* node = graph()->NewNode(simplified()->ChangeBoolToBit(), val); 154 Node* node = graph()->NewNode(simplified()->ChangeFloat64ToTagged(), val); 173 graph()->NewNode(simplified()->StringAdd(), Parameter(0), Parameter(1)); 198 Node* node = graph()->NewNode(simplified()->ChangeInt32ToTagged(), val); 228 Node* node = graph()->NewNode(simplified()->ChangeTaggedToFloat64(), val); 257 Node* node = graph()->NewNode(simplified()->ChangeTaggedToInt32(), val); 283 Node* node = graph()->NewNode(simplified()->ChangeTaggedToUint32(), val); 309 Node* node = graph()->NewNode(simplified()->ChangeUint32ToTagged(), val) [all...] |
js-typed-lowering.cc | 72 node_->ReplaceInput(1, graph()->NewNode(machine()->Word32And(), rnum, 103 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_); 150 Node* n = graph()->NewNode(javascript()->ToString(), node, context(), 160 Node* n = graph()->NewNode(javascript()->ToNumber(), node, context(), 214 Node* n = graph()->NewNode(op, node); 451 graph()->NewNode(simplified()->BooleanToNumber(), input)); 518 Node* cmp = graph()->NewNode(simplified()->NumberEqual(), input, 520 Node* inv = graph()->NewNode(simplified()->BooleanNot(), cmp); 546 Node* elements = graph()->NewNode( 550 elements = graph()->NewNode( [all...] |
js-inlining.cc | 153 graph->NewNode(op_phi, static_cast<int>(values.size()), &values.front()); 154 Node* ephi = graph->NewNode(op_ephi, static_cast<int>(effects.size()), 157 graph->NewNode(jsgraph->common()->Return(), phi, ephi, final_merge); 183 target_graph_->NewNode(original->op(), static_cast<int>(inputs.size()), 219 sentinel = target_graph_->NewNode(&sentinel_op_); 241 Node* context = jsgraph->graph()->NewNode( 355 Node* node0 = jsgraph_->graph()->NewNode(op0); 363 Node* params_node = jsgraph_->graph()->NewNode( 365 return jsgraph_->graph()->NewNode(op, params_node, node0, node0,
|
instruction-selector-unittest.cc | 188 Node* finish = m.NewNode(m.common()->Finish(1), param, m.graph()->start()); 274 m2.Return(m2.NewNode(m2.machine()->Load(kMachInt32), p2, m2.Int32Constant(0), 275 m2.NewNode(m2.common()->ValueEffect(1), p2))); 301 Node* parameters = m.NewNode(m.common()->StateValues(1), m.Int32Constant(1)); 302 Node* locals = m.NewNode(m.common()->StateValues(0)); 303 Node* stack = m.NewNode(m.common()->StateValues(0)); 306 Node* state_node = m.NewNode( 341 Node* parameters = m.NewNode(m.common()->StateValues(1), m.Int32Constant(43)); 342 Node* locals = m.NewNode(m.common()->StateValues(1), m.Int32Constant(44)); 343 Node* stack = m.NewNode(m.common()->StateValues(1), m.Int32Constant(45)) [all...] |
representation-change.h | 111 return jsgraph()->graph()->NewNode(op, node); 147 return jsgraph()->graph()->NewNode(op, node); 189 return jsgraph()->graph()->NewNode(op, node); 221 return jsgraph()->graph()->NewNode(op, node);
|
js-graph.h | 111 Node* NewNode(const Operator* op);
|
graph-unittest.cc | 35 graph()->SetStart(graph()->NewNode(common()->Start(num_parameters))); 43 return graph()->NewNode(common()->Parameter(index), graph()->start()); 48 return graph()->NewNode(common()->Float32Constant(value)); 53 return graph()->NewNode(common()->Float64Constant(value)); 58 return graph()->NewNode(common()->Int32Constant(value)); 63 return graph()->NewNode(common()->Int64Constant(value)); 68 return graph()->NewNode(common()->NumberConstant(value)); 73 return graph()->NewNode(common()->HeapConstant(value));
|
/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/CodeGen/SelectionDAG/ |
LegalizeTypes.cpp | 43 // Note that it is possible to have nodes marked NewNode in the DAG. This can 48 // into a different node, leaving the original node as a NewNode in the DAG. 58 // The conclusion is that though there may be nodes marked NewNode in the DAG, 59 // all uses of such nodes are also marked NewNode: the result is a fungus of 64 // by nodes marked NewNode (see above). 66 // The final node obtained by mapping by ReplacedValues is not marked NewNode. 71 // also map nodes marked NewNode if the deallocated memory was reallocated as 78 // Remember nodes marked NewNode - they are subject to extra checking below. 79 if (I->getNodeId() == NewNode) 89 // Check that remapped values are only used by nodes marked NewNode [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/tcmalloc/vendor/src/ |
pagemap.h | 231 Node* NewNode() { 244 root_ = NewNode(); 277 Node* n = NewNode();
|
/external/llvm/lib/Analysis/IPA/ |
CallGraph.cpp | 226 CallSite NewCS, CallGraphNode *NewNode){ 232 I->second = NewNode; 233 NewNode->AddRef();
|
/external/llvm/lib/Transforms/Utils/ |
LowerSwitch.cpp | 211 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); 213 F->getBasicBlockList().insert(++FI, NewNode); 217 NewNode->getInstList().push_back(Comp); 218 BranchInst::Create(LBranch, RBranch, Comp, NewNode); 219 return NewNode;
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
pagemap.h | 434 Node* NewNode() { 447 root_ = NewNode(); 480 Node* n = NewNode();
|