HomeSort by relevance Sort by last modified time
    Searched defs:MakeNode (Results 1 - 6 of 6) sorted by null

  /development/testrunner/
make_tree.py 24 class MakeNode(object):
50 child = MakeNode(current_seg, self)
80 class MakeTree(MakeNode):
  /external/v8/test/cctest/compiler/
codegen-tester.h 449 Node* MakeNode(RawMachineAssemblerTester<int32_t>* m, Node* a, Node* b) {
graph-builder-tester.h 193 return MakeNode(op, 0, static_cast<Node**>(NULL));
196 Node* NewNode(const Operator* op, Node* n1) { return MakeNode(op, 1, &n1); }
200 return MakeNode(op, arraysize(buffer), buffer);
205 return MakeNode(op, arraysize(buffer), buffer);
210 return MakeNode(op, arraysize(buffer), buffer);
216 return MakeNode(op, arraysize(buffer), buffer);
222 return MakeNode(op, arraysize(nodes), nodes);
227 return MakeNode(op, value_input_count, value_inputs);
236 Node* MakeNode(const Operator* op, int value_input_count,
  /external/v8/src/compiler/
raw-machine-assembler.cc 83 Node* branch = MakeNode(common()->Branch(), 1, &condition);
117 Node* ret = MakeNode(common()->Return(), 1, &value);
125 Node* ret = MakeNode(common()->Return(2), 2, values);
133 Node* ret = MakeNode(common()->Return(3), 3, values);
264 Node* tail_call = MakeNode(common()->TailCall(desc), input_count, buffer);
284 Node* tail_call = MakeNode(common()->TailCall(desc), arraysize(nodes), nodes);
305 Node* tail_call = MakeNode(common()->TailCall(desc), arraysize(nodes), nodes);
328 Node* tail_call = MakeNode(common()->TailCall(desc), arraysize(nodes), nodes);
350 Node* tail_call = MakeNode(common()->TailCall(desc), arraysize(nodes), nodes);
372 Node* tail_call = MakeNode(common()->TailCall(desc), arraysize(nodes), nodes)
    [all...]
bytecode-graph-builder.cc     [all...]
ast-graph-builder.cc     [all...]

Completed in 85 milliseconds