| /external/chromium_org/v8/src/compiler/ |
| graph.h | 28 Node* NewNode(const Operator* op, int input_count, Node** inputs);
31 Node* NewNode(const Operator* op) {
32 return NewNode(op, 0, static_cast<Node**>(NULL));
34 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); }
35 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
37 return NewNode(op, arraysize(nodes), nodes);
39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
41 return NewNode(op, arraysize(nodes), nodes);
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4)
[all...] |
| raw-machine-assembler.h | 62 return NewNode(common()->HeapConstant(unique));
75 return NewNode(common()->Int32Constant(value));
78 return NewNode(common()->Int64Constant(value));
81 return NewNode(common()->NumberConstant(value));
84 return NewNode(common()->Float64Constant(value));
88 return NewNode(common()->HeapConstant(val));
92 return NewNode(common()->Projection(index), a);
100 return NewNode(machine()->Load(rep), base, index);
106 NewNode(machine()->Store(StoreRepresentation(rep, kNoWriteBarrier)), base,
111 return NewNode(machine()->WordAnd(), a, b)
[all...] |
| change-lowering.cc | 71 Node* effect = graph()->NewNode(common()->ValueEffect(1), value);
77 Node* heap_number = graph()->NewNode(
81 Node* store = graph()->NewNode(
84 return graph()->NewNode(common()->Finish(1), heap_number, store);
89 value = graph()->NewNode(machine()->WordSar(), value, SmiShiftBitsConstant());
91 value = graph()->NewNode(machine()->TruncateInt64ToInt32(), value);
98 return graph()->NewNode(machine()->Load(kMachFloat64), value,
100 graph()->NewNode(common()->ControlEffect(), control));
105 Node* branch = graph()->NewNode(common()->Branch(), val, control);
107 Node* if_true = graph()->NewNode(common()->IfTrue(), branch)
[all...] |
| value-numbering-reducer-unittest.cc | 39 Node* na = graph()->NewNode(&kOp0);
40 Node* nb = graph()->NewNode(&kOp0);
41 Node* n1 = graph()->NewNode(&kOp0, na);
42 Node* n2 = graph()->NewNode(&kOp0, nb);
49 Node* n0 = graph()->NewNode(&kOp0);
50 Node* n1 = graph()->NewNode(&kOp1, n0);
53 EXPECT_FALSE(Reduce(graph()->NewNode(&kOp1, n0)).Changed());
63 inputs[i] = graph()->NewNode(new (zone()) SimpleOperator(
70 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs);
77 Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs)
[all...] |
| simplified-operator-reducer-unittest.cc | 165 graph()->NewNode((simplified()->*unop.constructor)(), Parameter(0)));
182 graph()->NewNode(simplified()->BooleanNot(),
183 graph()->NewNode(simplified()->BooleanNot(), param0)));
191 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant()));
199 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant()));
211 Reduction reduction = Reduce(graph()->NewNode(
213 graph()->NewNode(simplified()->ChangeBoolToBit(), param0)));
221 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(0)));
229 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(1)));
241 graph()->NewNode(simplified()->ChangeBoolToBit(), FalseConstant()))
[all...] |
| graph-builder.h | 27 Node* NewNode(const Operator* op) {
31 Node* NewNode(const Operator* op, Node* n1) { return MakeNode(op, 1, &n1); }
33 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
38 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
48 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
54 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
60 Node* NewNode(const Operator* op, int value_input_count,
95 Node* NewIfTrue() { return NewNode(common()->IfTrue()); }
96 Node* NewIfFalse() { return NewNode(common()->IfFalse());
[all...] |
| js-graph.cc | 15 return NewNode(common()->HeapConstant(unique));
19 Node* JSGraph::NewNode(const Operator* op) {
20 Node* node = graph()->NewNode(op);
98 return NewNode(common()->HeapConstant(value));
153 *loc = NewNode(common()->Int32Constant(value));
162 *loc = NewNode(common()->NumberConstant(value));
171 *loc = NewNode(common()->Float64Constant(value));
180 *loc = NewNode(common()->ExternalConstant(reference));
|
| machine-operator-reducer-unittest.cc | 235 Reduce(graph()->NewNode((machine()->*unop.constructor)(), Parameter(0)));
251 Reduction reduction = Reduce(graph()->NewNode(
266 Reduction reduction = Reduce(graph()->NewNode(
268 graph()->NewNode(machine()->ChangeInt32ToFloat64(), value)));
276 Reduction reduction = Reduce(graph()->NewNode(
291 Reduction reduction = Reduce(graph()->NewNode(
293 graph()->NewNode(machine()->ChangeUint32ToFloat64(), value)));
301 Reduction reduction = Reduce(graph()->NewNode(
316 graph()->NewNode(machine()->ChangeInt32ToFloat64(), Int32Constant(x)));
330 graph()->NewNode(machine()->ChangeInt32ToInt64(), Int32Constant(x)))
[all...] |
| ast-graph-builder.cc | 35 Node* node = NewNode(op, graph()->start());
46 Node* node = NewNode(op, graph()->start());
59 graph()->SetStart(graph()->NewNode(common()->Start(parameter_count)));
78 NewNode(javascript()->Runtime(Runtime::kTraceEnter, 0));
90 Node* node = NewNode(javascript()->Runtime(Runtime::kStackGuard, 0));
101 NewNode(javascript()->Runtime(Runtime::kTraceExit, 1), return_value);
105 Node* control = NewNode(common()->Return(), jsgraph()->UndefinedConstant());
110 graph()->SetEnd(NewNode(common()->End()));
170 Node* receiver = builder->graph()->NewNode(common()->Parameter(0),
177 Node* parameter = builder->graph()->NewNode(common()->Parameter(i + 1)
[all...] |
| graph.cc | 24 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs) {
|
| js-builtin-reducer.cc | 103 Node* value = graph()->NewNode(machine()->Float64Sqrt(), r.left());
127 Node* tag = graph()->NewNode(simplified()->NumberLessThan(), value, p);
129 Node* branch = graph()->NewNode(common()->Branch(), tag, control);
130 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
131 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
132 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
134 value = graph()->NewNode(common()->Phi(kMachNone, 2), p, value, merge);
147 Node* value = graph()->NewNode(machine()->Int32Mul(), r.left(), r.right());
|
| raw-machine-assembler.cc | 28 Node* s = graph->NewNode(common_.Start(param_count));
34 NewNode(common()->Parameter(static_cast<int>(i)), graph->start());
72 Node* branch = NewNode(common()->Branch(), condition);
91 Node* call = graph()->NewNode(common()->Call(desc), stub_code, function,
101 Node* call = graph()->NewNode(common()->Call(descriptor), function, receiver,
115 Node* ref = NewNode(
119 Node* call = graph()->NewNode(common()->Call(descriptor), centry, arg0, ref,
156 Node* node = graph()->NewNode(op, input_count, inputs);
|
| graph-reducer-unittest.cc | 79 Node* node0 = graph()->NewNode(&OP0);
80 Node* node1 = graph()->NewNode(&OP1, node0);
81 Node* node2 = graph()->NewNode(&OP1, node0);
92 Node* node0 = graph()->NewNode(&OP0);
102 Node* node0 = graph()->NewNode(&OP0);
|
| graph-builder.cc | 46 result = graph()->NewNode(op, value_input_count, value_inputs);
71 result = graph()->NewNode(op, input_count_with_deps, buffer);
127 control_dependency_ = graph()->NewNode(common()->Merge(1), other_control);
169 return graph()->NewNode(phi_op, count + 1, buffer);
180 return graph()->NewNode(phi_op, count + 1, buffer);
199 control = graph()->NewNode(op, control, other);
241 Node* dead_node = graph()->NewNode(common_->Dead());
|
| /external/chromium_org/v8/test/cctest/compiler/ |
| simplified-graph-builder.h | 42 return kPointerSize == 8 ? NewNode(common()->Int64Constant(intptr_value))
46 return NewNode(common()->Int32Constant(value));
50 return NewNode(common()->HeapConstant(val));
53 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a); }
56 return NewNode(simplified()->NumberEqual(), a, b);
59 return NewNode(simplified()->NumberLessThan(), a, b);
62 return NewNode(simplified()->NumberLessThanOrEqual(), a, b);
65 return NewNode(simplified()->NumberAdd(), a, b);
68 return NewNode(simplified()->NumberSubtract(), a, b);
71 return NewNode(simplified()->NumberMultiply(), a, b)
[all...] |
| test-node.cc | 22 Node* n1 = graph.NewNode(&dummy_operator);
23 Node* n2 = graph.NewNode(&dummy_operator);
30 Node* n1 = graph.NewNode(&dummy_operator);
31 Node* n2 = graph.NewNode(&dummy_operator);
39 Node* n0 = graph.NewNode(&dummy_operator);
40 Node* n2 = graph.NewNode(&dummy_operator, n0);
48 Node* n0 = graph.NewNode(&dummy_operator);
49 Node* n1 = graph.NewNode(&dummy_operator);
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
59 Node* n0 = graph.NewNode(&dummy_operator)
[all...] |
| test-node-algorithm.cc | 58 Node* n2 = graph.NewNode(&dummy_operator, graph.start());
59 Node* n3 = graph.NewNode(&dummy_operator, n2);
60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
61 Node* n5 = graph.NewNode(&dummy_operator, n4, n2);
78 Node* n2 = graph.NewNode(&dummy_operator, graph.start());
79 Node* n3 = graph.NewNode(&dummy_operator, n2);
80 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
81 Node* n5 = graph.NewNode(&dummy_operator, n4, n2);
97 Node* n2 = graph.NewNode(&dummy_operator, graph.start());
98 Node* n3 = graph.NewNode(&dummy_operator, graph.start())
[all...] |
| graph-tester.h | 28 start_node_(NewNode(builder_.Start(num_parameters))) {
|
| simplified-graph-builder.cc | 27 Node* start = graph()->NewNode(common()->Start(num_parameters));
35 graph()->NewNode(common()->Return(), value, effect_, graph()->start());
41 Node* end = graph()->NewNode(common()->End(), return_);
61 result = graph()->NewNode(op, value_input_count, value_inputs);
75 result = graph()->NewNode(op, input_count_with_deps, buffer);
|
| test-graph-reducer.cc | 66 return Replace(graph_->NewNode(&OPB0));
69 return Replace(graph_->NewNode(&OPB1, node->InputAt(0)));
73 graph_->NewNode(&OPB2, node->InputAt(0), node->InputAt(1)));
112 return Replace(graph_->NewNode(&OPB1, node));
128 return Replace(graph_->NewNode(&OPC1, graph_->NewNode(&OPC1, node)));
201 Node* n1 = graph.NewNode(&OPA0);
202 Node* end = graph.NewNode(&OPA1, n1);
217 Node* n1 = graph.NewNode(&OPA0);
218 Node* n2 = graph.NewNode(&OPA1, n1)
[all...] |
| test-scheduler.cc | 624 graph.SetStart(graph.NewNode(builder.Start(0)));
625 graph.SetEnd(graph.NewNode(builder.End(), graph.start()));
635 graph.SetStart(graph.NewNode(builder.Start(0)));
637 Node* p1 = graph.NewNode(builder.Parameter(0), graph.start());
638 Node* ret = graph.NewNode(builder.Return(), p1, graph.start(), graph.start());
640 graph.SetEnd(graph.NewNode(builder.End(), ret));
651 graph.SetStart(graph.NewNode(builder.Start(3)));
653 Node* p1 = graph.NewNode(builder.Parameter(0), graph.start());
654 Node* p2 = graph.NewNode(builder.Parameter(1), graph.start());
655 Node* p3 = graph.NewNode(builder.Parameter(2), graph.start())
[all...] |
| test-schedule.cc | 34 Node* n0 = graph.NewNode(&dummy_operator);
35 Node* n1 = graph.NewNode(&dummy_operator);
47 Node* n2 = graph.NewNode(&dummy_operator);
81 Node* n0 = graph.NewNode(&dummy_operator);
82 Node* b = graph.NewNode(common.Branch(), n0);
105 Node* n0 = graph.NewNode(&dummy_operator);
119 Node* n0 = graph.NewNode(&dummy_operator);
136 Node* start = graph.NewNode(common.Start(0));
138 Node* param0 = graph.NewNode(common.Parameter(0), graph.start());
139 Node* param1 = graph.NewNode(common.Parameter(1), graph.start())
[all...] |
| test-js-context-specialization.cc | 52 Node* start = t.NewNode(t.common()->Start(0));
67 Node* param_context = t.NewNode(t.common()->Parameter(0), start);
72 Node* load = t.NewNode(t.javascript()->LoadContext(0, 0, false),
80 Node* load = t.NewNode(t.javascript()->LoadContext(0, 0, false),
88 Node* load = t.NewNode(
105 Node* load = t.NewNode(t.javascript()->LoadContext(0, slot, true),
124 Node* start = t.NewNode(t.common()->Start(0));
139 Node* param_context = t.NewNode(t.common()->Parameter(0), start);
144 Node* load = t.NewNode(t.javascript()->StoreContext(0, 0), const_context,
152 Node* load = t.NewNode(t.javascript()->StoreContext(0, 0), param_context
[all...] |
| test-codegen-deopt.cc | 134 Node* deopt_fun_node = m.NewNode(common.HeapConstant(deopt_fun_constant));
140 m.NewNode(common.HeapConstant(caller_context_constant));
143 Node* parameters = m.NewNode(common.StateValues(1), m.UndefinedConstant());
144 Node* locals = m.NewNode(common.StateValues(0));
145 Node* stack = m.NewNode(common.StateValues(0));
147 Node* state_node = m.NewNode(
154 Node* context_node = m.NewNode(common.HeapConstant(context_constant));
249 Node* this_fun_node = m.NewNode(common.HeapConstant(this_fun_constant));
254 Node* context_node = m.NewNode(common.HeapConstant(context_constant));
257 Node* parameters = m.NewNode(common.StateValues(1), m.UndefinedConstant())
[all...] |
| /external/pdfium/core/src/fxcrt/ |
| fx_basic_list.cpp | 21 CNode* pNewNode = NewNode(m_pNodeTail, NULL);
33 CNode* pNewNode = NewNode(NULL, m_pNodeHead);
49 CNode* pNewNode = NewNode(pOldNode, pOldNode->pNext);
91 CFX_PtrList::NewNode(CFX_PtrList::CNode* pPrev, CFX_PtrList::CNode* pNext)
|
