Home
last modified time | relevance | path

Searched refs:NewNode (Results 1 – 25 of 74) sorted by relevance

123

/external/v8/src/compiler/
Draw-machine-assembler.h62 return NewNode(common()->HeapConstant(unique)); in UndefinedConstant()
75 return NewNode(common()->Int32Constant(value)); in Int32Constant()
78 return NewNode(common()->Int64Constant(value)); in Int64Constant()
81 return NewNode(common()->NumberConstant(value)); in NumberConstant()
84 return NewNode(common()->Float64Constant(value)); in Float64Constant()
88 return NewNode(common()->HeapConstant(val)); in HeapConstant()
92 return NewNode(common()->Projection(index), a); in Projection()
100 return NewNode(machine()->Load(rep), base, index); in Load()
106 NewNode(machine()->Store(StoreRepresentation(rep, kNoWriteBarrier)), base, in Store()
111 return NewNode(machine()->WordAnd(), a, b); in WordAnd()
[all …]
Dchange-lowering.cc71 Node* effect = graph()->NewNode(common()->ValueEffect(1), value); in AllocateHeapNumberWithValue()
77 Node* heap_number = graph()->NewNode( in AllocateHeapNumberWithValue()
81 Node* store = graph()->NewNode( in AllocateHeapNumberWithValue()
84 return graph()->NewNode(common()->Finish(1), heap_number, store); in AllocateHeapNumberWithValue()
89 value = graph()->NewNode(machine()->WordSar(), value, SmiShiftBitsConstant()); in ChangeSmiToInt32()
91 value = graph()->NewNode(machine()->TruncateInt64ToInt32(), value); in ChangeSmiToInt32()
98 return graph()->NewNode(machine()->Load(kMachFloat64), value, in LoadHeapNumberValue()
100 graph()->NewNode(common()->ControlEffect(), control)); in LoadHeapNumberValue()
105 Node* branch = graph()->NewNode(common()->Branch(), val, control); in ChangeBitToBool()
107 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ChangeBitToBool()
[all …]
Dsimplified-operator-reducer-unittest.cc165 graph()->NewNode((simplified()->*unop.constructor)(), Parameter(0))); in TEST_P()
182 graph()->NewNode(simplified()->BooleanNot(), in TEST_F()
183 graph()->NewNode(simplified()->BooleanNot(), param0))); in TEST_F()
191 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant())); in TEST_F()
199 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant())); in TEST_F()
211 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
213 graph()->NewNode(simplified()->ChangeBoolToBit(), param0))); in TEST_F()
221 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(0))); in TEST_F()
229 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(1))); in TEST_F()
241 graph()->NewNode(simplified()->ChangeBoolToBit(), FalseConstant())); in TEST_F()
[all …]
Dmachine-operator-reducer-unittest.cc235 Reduce(graph()->NewNode((machine()->*unop.constructor)(), Parameter(0))); in TEST_P()
251 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
266 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
268 graph()->NewNode(machine()->ChangeInt32ToFloat64(), value))); in TEST_F()
276 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
291 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
293 graph()->NewNode(machine()->ChangeUint32ToFloat64(), value))); in TEST_F()
301 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
316 graph()->NewNode(machine()->ChangeInt32ToFloat64(), Int32Constant(x))); in TEST_F()
330 graph()->NewNode(machine()->ChangeInt32ToInt64(), Int32Constant(x))); in TEST_F()
[all …]
Dgraph.h28 Node* NewNode(const Operator* op, int input_count, Node** inputs);
31 Node* NewNode(const Operator* op) { in NewNode() function
32 return NewNode(op, 0, static_cast<Node**>(NULL)); in NewNode()
34 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } in NewNode() function
35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
37 return NewNode(op, arraysize(nodes), nodes); in NewNode()
39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
41 return NewNode(op, arraysize(nodes), nodes); in NewNode()
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
45 return NewNode(op, arraysize(nodes), nodes); in NewNode()
[all …]
Dvalue-numbering-reducer-unittest.cc39 Node* na = graph()->NewNode(&kOp0); in TEST_F()
40 Node* nb = graph()->NewNode(&kOp0); in TEST_F()
41 Node* n1 = graph()->NewNode(&kOp0, na); in TEST_F()
42 Node* n2 = graph()->NewNode(&kOp0, nb); in TEST_F()
49 Node* n0 = graph()->NewNode(&kOp0); in TEST_F()
50 Node* n1 = graph()->NewNode(&kOp1, n0); in TEST_F()
53 EXPECT_FALSE(Reduce(graph()->NewNode(&kOp1, n0)).Changed()); in TEST_F()
63 inputs[i] = graph()->NewNode(new (zone()) SimpleOperator( in TEST_F()
70 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); in TEST_F()
77 Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs); in TEST_F()
[all …]
Dast-graph-builder.cc35 Node* node = NewNode(op, graph()->start()); in GetFunctionClosure()
46 Node* node = NewNode(op, graph()->start()); in GetFunctionContext()
59 graph()->SetStart(graph()->NewNode(common()->Start(parameter_count))); in CreateGraph()
78 NewNode(javascript()->Runtime(Runtime::kTraceEnter, 0)); in CreateGraph()
90 Node* node = NewNode(javascript()->Runtime(Runtime::kStackGuard, 0)); in CreateGraph()
101 NewNode(javascript()->Runtime(Runtime::kTraceExit, 1), return_value); in CreateGraph()
105 Node* control = NewNode(common()->Return(), jsgraph()->UndefinedConstant()); in CreateGraph()
110 graph()->SetEnd(NewNode(common()->End())); in CreateGraph()
170 Node* receiver = builder->graph()->NewNode(common()->Parameter(0), in Environment()
177 Node* parameter = builder->graph()->NewNode(common()->Parameter(i + 1), in Environment()
[all …]
Dgraph-builder.h27 Node* NewNode(const Operator* op) { in NewNode() function
31 Node* NewNode(const Operator* op, Node* n1) { return MakeNode(op, 1, &n1); } in NewNode() function
33 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
38 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
48 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
54 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
60 Node* NewNode(const Operator* op, int value_input_count, in NewNode() function
95 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } in NewIfTrue()
96 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } in NewIfFalse()
[all …]
Djs-graph.cc15 return NewNode(common()->HeapConstant(unique)); in ImmovableHeapConstant()
19 Node* JSGraph::NewNode(const Operator* op) { in NewNode() function in v8::internal::compiler::JSGraph
20 Node* node = graph()->NewNode(op); in NewNode()
98 return NewNode(common()->HeapConstant(value)); in HeapConstant()
153 *loc = NewNode(common()->Int32Constant(value)); in Int32Constant()
162 *loc = NewNode(common()->NumberConstant(value)); in NumberConstant()
171 *loc = NewNode(common()->Float64Constant(value)); in Float64Constant()
180 *loc = NewNode(common()->ExternalConstant(reference)); in ExternalConstant()
Djs-builtin-reducer.cc103 Node* value = graph()->NewNode(machine()->Float64Sqrt(), r.left()); in ReduceMathSqrt()
127 Node* tag = graph()->NewNode(simplified()->NumberLessThan(), value, p); in ReduceMathMax()
129 Node* branch = graph()->NewNode(common()->Branch(), tag, control); in ReduceMathMax()
130 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceMathMax()
131 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceMathMax()
132 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceMathMax()
134 value = graph()->NewNode(common()->Phi(kMachNone, 2), p, value, merge); in ReduceMathMax()
147 Node* value = graph()->NewNode(machine()->Int32Mul(), r.left(), r.right()); in ReduceMathImul()
Draw-machine-assembler.cc28 Node* s = graph->NewNode(common_.Start(param_count)); in RawMachineAssembler()
34 NewNode(common()->Parameter(static_cast<int>(i)), graph->start()); in RawMachineAssembler()
72 Node* branch = NewNode(common()->Branch(), condition); in Branch()
91 Node* call = graph()->NewNode(common()->Call(desc), stub_code, function, in CallFunctionStub0()
101 Node* call = graph()->NewNode(common()->Call(descriptor), function, receiver, in CallJS0()
115 Node* ref = NewNode( in CallRuntime1()
119 Node* call = graph()->NewNode(common()->Call(descriptor), centry, arg0, ref, in CallRuntime1()
156 Node* node = graph()->NewNode(op, input_count, inputs); in MakeNode()
Dinstruction-selector-unittest.cc188 Node* finish = m.NewNode(m.common()->Finish(1), param, m.graph()->start()); in TARGET_TEST_F()
274 m2.Return(m2.NewNode(m2.machine()->Load(kMachInt32), p2, m2.Int32Constant(0), in TARGET_TEST_F()
275 m2.NewNode(m2.common()->ValueEffect(1), p2))); in TARGET_TEST_F()
301 Node* parameters = m.NewNode(m.common()->StateValues(1), m.Int32Constant(1)); in TARGET_TEST_F()
302 Node* locals = m.NewNode(m.common()->StateValues(0)); in TARGET_TEST_F()
303 Node* stack = m.NewNode(m.common()->StateValues(0)); in TARGET_TEST_F()
306 Node* state_node = m.NewNode( in TARGET_TEST_F()
341 Node* parameters = m.NewNode(m.common()->StateValues(1), m.Int32Constant(43)); in TARGET_TEST_F()
342 Node* locals = m.NewNode(m.common()->StateValues(1), m.Int32Constant(44)); in TARGET_TEST_F()
343 Node* stack = m.NewNode(m.common()->StateValues(1), m.Int32Constant(45)); in TARGET_TEST_F()
[all …]
Djs-typed-lowering.cc72 node_->ReplaceInput(1, graph()->NewNode(machine()->Word32And(), rnum, in ConvertInputsForShift()
103 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_); in ChangeToPureOperator()
150 Node* n = graph()->NewNode(javascript()->ToString(), node, context(), in ConvertToString()
160 Node* n = graph()->NewNode(javascript()->ToNumber(), node, context(), in ConvertToNumber()
214 Node* n = graph()->NewNode(op, node); in ConvertToI32()
451 graph()->NewNode(simplified()->BooleanToNumber(), input)); in ReduceJSToNumberInput()
518 Node* cmp = graph()->NewNode(simplified()->NumberEqual(), input, in ReduceJSToBooleanInput()
520 Node* inv = graph()->NewNode(simplified()->BooleanNot(), cmp); in ReduceJSToBooleanInput()
546 Node* elements = graph()->NewNode( in ReduceJSLoadProperty()
550 elements = graph()->NewNode( in ReduceJSLoadProperty()
[all …]
Dchange-lowering-unittest.cc72 return graph()->NewNode(common()->Parameter(index), graph()->start()); in Parameter()
127 Node* node = graph()->NewNode(simplified()->ChangeBitToBool(), val); in TARGET_TEST_P()
144 Node* node = graph()->NewNode(simplified()->ChangeBoolToBit(), val); in TARGET_TEST_P()
154 Node* node = graph()->NewNode(simplified()->ChangeFloat64ToTagged(), val); in TARGET_TEST_P()
173 graph()->NewNode(simplified()->StringAdd(), Parameter(0), Parameter(1)); in TARGET_TEST_P()
198 Node* node = graph()->NewNode(simplified()->ChangeInt32ToTagged(), val); in TARGET_TEST_F()
228 Node* node = graph()->NewNode(simplified()->ChangeTaggedToFloat64(), val); in TARGET_TEST_F()
257 Node* node = graph()->NewNode(simplified()->ChangeTaggedToInt32(), val); in TARGET_TEST_F()
283 Node* node = graph()->NewNode(simplified()->ChangeTaggedToUint32(), val); in TARGET_TEST_F()
309 Node* node = graph()->NewNode(simplified()->ChangeUint32ToTagged(), val); in TARGET_TEST_F()
[all …]
/external/v8/test/cctest/compiler/
Dtest-node.cc22 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
23 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
30 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
31 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
39 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
40 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
48 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
49 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
59 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
[all …]
Dsimplified-graph-builder.h42 return kPointerSize == 8 ? NewNode(common()->Int64Constant(intptr_value)) in PointerConstant()
46 return NewNode(common()->Int32Constant(value)); in Int32Constant()
50 return NewNode(common()->HeapConstant(val)); in HeapConstant()
53 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a); } in BooleanNot()
56 return NewNode(simplified()->NumberEqual(), a, b); in NumberEqual()
59 return NewNode(simplified()->NumberLessThan(), a, b); in NumberLessThan()
62 return NewNode(simplified()->NumberLessThanOrEqual(), a, b); in NumberLessThanOrEqual()
65 return NewNode(simplified()->NumberAdd(), a, b); in NumberAdd()
68 return NewNode(simplified()->NumberSubtract(), a, b); in NumberSubtract()
71 return NewNode(simplified()->NumberMultiply(), a, b); in NumberMultiply()
[all …]
Dtest-scheduler.cc624 graph.SetStart(graph.NewNode(builder.Start(0))); in TEST()
625 graph.SetEnd(graph.NewNode(builder.End(), graph.start())); in TEST()
635 graph.SetStart(graph.NewNode(builder.Start(0))); in TEST()
637 Node* p1 = graph.NewNode(builder.Parameter(0), graph.start()); in TEST()
638 Node* ret = graph.NewNode(builder.Return(), p1, graph.start(), graph.start()); in TEST()
640 graph.SetEnd(graph.NewNode(builder.End(), ret)); in TEST()
651 graph.SetStart(graph.NewNode(builder.Start(3))); in TEST()
653 Node* p1 = graph.NewNode(builder.Parameter(0), graph.start()); in TEST()
654 Node* p2 = graph.NewNode(builder.Parameter(1), graph.start()); in TEST()
655 Node* p3 = graph.NewNode(builder.Parameter(2), graph.start()); in TEST()
[all …]
Dtest-graph-reducer.cc66 return Replace(graph_->NewNode(&OPB0)); in Reduce()
69 return Replace(graph_->NewNode(&OPB1, node->InputAt(0))); in Reduce()
73 graph_->NewNode(&OPB2, node->InputAt(0), node->InputAt(1))); in Reduce()
112 return Replace(graph_->NewNode(&OPB1, node)); in Reduce()
128 return Replace(graph_->NewNode(&OPC1, graph_->NewNode(&OPC1, node))); in Reduce()
201 Node* n1 = graph.NewNode(&OPA0); in TEST()
202 Node* end = graph.NewNode(&OPA1, n1); in TEST()
217 Node* n1 = graph.NewNode(&OPA0); in TEST()
218 Node* n2 = graph.NewNode(&OPA1, n1); in TEST()
219 Node* n3 = graph.NewNode(&OPA1, n1); in TEST()
[all …]
Dtest-node-algorithm.cc58 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); in TEST()
59 Node* n3 = graph.NewNode(&dummy_operator, n2); in TEST()
60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3); in TEST()
61 Node* n5 = graph.NewNode(&dummy_operator, n4, n2); in TEST()
78 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); in TEST()
79 Node* n3 = graph.NewNode(&dummy_operator, n2); in TEST()
80 Node* n4 = graph.NewNode(&dummy_operator, n2, n3); in TEST()
81 Node* n5 = graph.NewNode(&dummy_operator, n4, n2); in TEST()
97 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); in TEST()
98 Node* n3 = graph.NewNode(&dummy_operator, graph.start()); in TEST()
[all …]
Dtest-schedule.cc34 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
35 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
47 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
81 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
82 Node* b = graph.NewNode(common.Branch(), n0); in TEST()
105 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
119 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
136 Node* start = graph.NewNode(common.Start(0)); in TEST()
138 Node* param0 = graph.NewNode(common.Parameter(0), graph.start()); in TEST()
139 Node* param1 = graph.NewNode(common.Parameter(1), graph.start()); in TEST()
[all …]
Dtest-js-context-specialization.cc52 Node* start = t.NewNode(t.common()->Start(0)); in TEST()
67 Node* param_context = t.NewNode(t.common()->Parameter(0), start); in TEST()
72 Node* load = t.NewNode(t.javascript()->LoadContext(0, 0, false), in TEST()
80 Node* load = t.NewNode(t.javascript()->LoadContext(0, 0, false), in TEST()
88 Node* load = t.NewNode( in TEST()
105 Node* load = t.NewNode(t.javascript()->LoadContext(0, slot, true), in TEST()
124 Node* start = t.NewNode(t.common()->Start(0)); in TEST()
139 Node* param_context = t.NewNode(t.common()->Parameter(0), start); in TEST()
144 Node* load = t.NewNode(t.javascript()->StoreContext(0, 0), const_context, in TEST()
152 Node* load = t.NewNode(t.javascript()->StoreContext(0, 0), param_context, in TEST()
[all …]
Dtest-codegen-deopt.cc134 Node* deopt_fun_node = m.NewNode(common.HeapConstant(deopt_fun_constant)); in BuildGraphAndSchedule()
140 m.NewNode(common.HeapConstant(caller_context_constant)); in BuildGraphAndSchedule()
143 Node* parameters = m.NewNode(common.StateValues(1), m.UndefinedConstant()); in BuildGraphAndSchedule()
144 Node* locals = m.NewNode(common.StateValues(0)); in BuildGraphAndSchedule()
145 Node* stack = m.NewNode(common.StateValues(0)); in BuildGraphAndSchedule()
147 Node* state_node = m.NewNode( in BuildGraphAndSchedule()
154 Node* context_node = m.NewNode(common.HeapConstant(context_constant)); in BuildGraphAndSchedule()
249 Node* this_fun_node = m.NewNode(common.HeapConstant(this_fun_constant)); in BuildGraphAndSchedule()
254 Node* context_node = m.NewNode(common.HeapConstant(context_constant)); in BuildGraphAndSchedule()
257 Node* parameters = m.NewNode(common.StateValues(1), m.UndefinedConstant()); in BuildGraphAndSchedule()
[all …]
Dtest-simplified-lowering.cc654 start = graph()->NewNode(common()->Start(2)); in TestingGraph()
657 graph()->NewNode(common()->Return(), jsgraph.Constant(0), start, start); in TestingGraph()
658 end = graph()->NewNode(common()->End(), ret); in TestingGraph()
660 p0 = graph()->NewNode(common()->Parameter(0), start); in TestingGraph()
661 p1 = graph()->NewNode(common()->Parameter(1), start); in TestingGraph()
662 p2 = graph()->NewNode(common()->Parameter(2), start); in TestingGraph()
669 Node* node = Return(graph()->NewNode(op, p0, p1)); in CheckLoweringBinop()
676 Node* node = graph()->NewNode(op, p0, p1); in CheckLoweringTruncatedBinop()
677 Return(graph()->NewNode(trunc, node)); in CheckLoweringTruncatedBinop()
699 return graph()->NewNode(machine()->Int32Add(), jsgraph.Int32Constant(1), in ExampleWithOutput()
[all …]
Dsimplified-graph-builder.cc27 Node* start = graph()->NewNode(common()->Start(num_parameters)); in Begin()
35 graph()->NewNode(common()->Return(), value, effect_, graph()->start()); in Return()
41 Node* end = graph()->NewNode(common()->End(), return_); in End()
61 result = graph()->NewNode(op, value_input_count, value_inputs); in MakeNode()
75 result = graph()->NewNode(op, input_count_with_deps, buffer); in MakeNode()
/external/clang/lib/Rewrite/
DRewriteRope.cpp308 RopePieceBTreeLeaf *NewNode = new RopePieceBTreeLeaf(); in insert() local
312 &NewNode->Pieces[0]); in insert()
317 NewNode->NumPieces = NumPieces = WidthFactor; in insert()
320 NewNode->FullRecomputeSizeLocally(); in insert()
324 NewNode->insertAfterLeafInOrder(this); in insert()
330 NewNode->insert(Offset - this->size(), R); in insert()
331 return NewNode; in insert()
541 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior(); in HandleChildPiece() local
544 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
548 NewNode->NumChildren = NumChildren = WidthFactor; in HandleChildPiece()
[all …]

123