| /external/v8/src/compiler/ |
| diamond.h | 29 branch = graph->NewNode(common->Branch(hint), cond, graph->start());
30 if_true = graph->NewNode(common->IfTrue(), branch);
31 if_false = graph->NewNode(common->IfFalse(), branch);
32 merge = graph->NewNode(common->Merge(2), if_true, if_false);
53 return graph->NewNode(common->Phi(rep, 2), tv, fv, merge);
57 return graph->NewNode(common->EffectPhi(2), tv, fv, merge);
|
| int64-lowering.cc | 35 placeholder_(graph->NewNode(common->Parameter(-2, "placeholder"),
151 index_high = graph()->NewNode(machine()->Int32Add(), index,
152 graph()->NewNode(common()->Int32Constant(4)));
154 index_low = graph()->NewNode(machine()->Int32Add(), index,
155 graph()->NewNode(common()->Int32Constant(4)));
164 Node* low_node = graph()->NewNode(
166 Node* high_node = graph()->NewNode(
200 high_node = graph()->NewNode(load_op, base, index_high, effect_high,
206 high_node = graph()->NewNode(load_op, base, index_high);
255 high_node = graph()->NewNode(store_op, base, index_high
[all...] |
| machine-graph.cc | 17 *loc = graph()->NewNode(common()->Int32Constant(value));
25 *loc = graph()->NewNode(common()->Int64Constant(value));
40 *loc = graph()->NewNode(common()->RelocatableInt32Constant(value, rmode));
50 *loc = graph()->NewNode(common()->RelocatableInt64Constant(value, rmode));
65 *loc = graph()->NewNode(common()->Float32Constant(value));
73 *loc = graph()->NewNode(common()->Float64Constant(value));
81 *loc = graph()->NewNode(common()->PointerConstant(value));
89 *loc = graph()->NewNode(common()->ExternalConstant(reference));
|
| js-call-reducer.cc | 50 graph()->NewNode(simplified()->SpeculativeToNumber(
53 Node* value = graph()->NewNode(op, input);
76 graph()->NewNode(simplified()->SpeculativeToNumber(
80 graph()->NewNode(simplified()->SpeculativeToNumber(
83 Node* value = graph()->NewNode(op, left, right);
107 graph()->NewNode(simplified()->SpeculativeToNumber(
111 graph()->NewNode(simplified()->SpeculativeToNumber(
114 left = graph()->NewNode(simplified()->NumberToUint32(), left);
115 right = graph()->NewNode(simplified()->NumberToUint32(), right);
116 Node* value = graph()->NewNode(simplified()->NumberImul(), left, right)
[all...] |
| wasm-compiler.cc | 73 SetEffect(graph()->NewNode( \
79 SetEffect(graph()->NewNode( \
98 g->SetEnd(g->NewNode(mcgraph->common()->End(1), node));
137 Node* start = graph()->NewNode(mcgraph()->common()->Start(params));
143 return graph()->NewNode(mcgraph()->common()->Parameter(index),
148 return graph()->NewNode(mcgraph()->common()->Loop(1), entry);
153 graph()->NewNode(mcgraph()->common()->Terminate(), effect, control);
169 *if_success = graph()->NewNode(mcgraph()->common()->IfSuccess(), node);
171 graph()->NewNode(mcgraph()->common()->IfException(), node, node);
193 return graph()->NewNode(mcgraph()->common()->Merge(count), count, controls)
[all...] |
| graph-assembler.cc | 30 return graph()->NewNode(common()->Int32Constant(value));
59 return graph()->NewNode(machine()->LoadFramePointer());
69 return graph()->NewNode(machine()->Name(), input); \
76 return graph()->NewNode(machine()->Name(), left, right); \
83 return graph()->NewNode(machine()->Name(), left, right, current_control_); \
90 return graph()->NewNode(machine()->Float64RoundDown().op(), value);
95 return graph()->NewNode(machine()->Float64RoundTruncate().op(), value);
99 return graph()->NewNode(common()->Projection(index), value, current_control_);
104 graph()->NewNode(simplified()->AllocateRaw(Type::Any(), pretenure),
110 graph()->NewNode(simplified()->LoadField(access), object
[all...] |
| basic-block-instrumentor.cc | 68 Node* zero = graph->NewNode(common.Int32Constant(0));
69 Node* one = graph->NewNode(common.Int32Constant(1));
79 Node* base = graph->NewNode(
81 Node* load = graph->NewNode(machine.Load(MachineType::Uint32()), base, zero,
83 Node* inc = graph->NewNode(machine.Int32Add(), load, one);
85 graph->NewNode(machine.Store(StoreRepresentation(
|
| js-native-context-specialization.cc | 294 Node* value = graph()->NewNode(simplified()->ToBoolean(), node);
465 graph()->NewNode(javascript()->CreatePromise(), context, effect);
466 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value,
516 graph()->NewNode(javascript()->FulfillPromise(), promise, resolution,
599 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), receiver,
601 effect = graph()->NewNode(
656 value = effect = graph()->NewNode(
676 graph()->NewNode(simplified()->ReferenceEqual(), value,
678 effect = graph()->NewNode(
701 value = effect = graph()->NewNode(simplified()->CheckHeapObject()
[all...] |
| graph.h | 64 Node* NewNode(const Operator* op, int input_count, Node* const* inputs,
69 Node* NewNode(const Operator* op, Nodes*... nodes) {
71 return NewNode(op, nodes_arr.size(), nodes_arr.data());
|
| js-typed-lowering.cc | 119 Node* left_input = graph()->NewNode(simplified()->CheckReceiver(), left(),
133 Node* right_input = graph()->NewNode(simplified()->CheckReceiver(),
145 Node* left_input = graph()->NewNode(simplified()->CheckSymbol(), left(),
151 Node* right_input = graph()->NewNode(simplified()->CheckSymbol(), right(),
164 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), left(),
171 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), right(),
183 Node* left_input = graph()->NewNode(
190 graph()->NewNode(simplified()->CheckInternalizedString(), right(),
382 return graph()->NewNode(simplified()->PlainPrimitiveToNumber(), node);
390 node = graph()->NewNode(simplified()->NumberToInt32(), node)
[all...] |
| bytecode-graph-builder.cc | 161 Node* parameter = builder->graph()->NewNode(op, graph()->start());
177 context_ = builder->graph()->NewNode(op, graph()->start());
184 Node* new_target_node = builder->graph()->NewNode(op, graph()->start());
271 builder()->NewNode(common()->Projection(i), node);
384 Node* terminate = builder()->graph()->NewNode(
393 SetContext(graph()->NewNode(
400 values()->at(i) = graph()->NewNode(common()->OsrValue(idx), start);
427 Node* loop_exit = graph()->NewNode(common()->LoopExit(), control, loop);
431 Node* effect_rename = graph()->NewNode(common()->LoopExitEffect(),
444 graph()->NewNode(common()->LoopExitValue(), values_[i], loop_exit)
[all...] |
| js-inlining.cc | 156 Node* on_success = graph()->NewNode(common()->IfSuccess(), subcall);
160 graph()->NewNode(common()->IfException(), subcall, subcall);
167 graph()->NewNode(common()->Merge(subcall_count), subcall_count,
172 Node* value_output = graph()->NewNode(
176 graph()->NewNode(common()->EffectPhi(subcall_count),
214 Node* control_output = graph()->NewNode(common()->Merge(input_count),
218 Node* value_output = graph()->NewNode(
222 graph()->NewNode(common()->EffectPhi(input_count),
245 Node* node0 = graph()->NewNode(op0);
252 Node* params_node = graph()->NewNode(
[all...] |
| bytecode-graph-builder.h | 72 Node* NewNode(const Operator* op, bool incomplete = false) {
76 Node* NewNode(const Operator* op, Node* n1) {
81 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
86 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
91 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
96 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
103 Node* NewIfTrue() { return NewNode(common()->IfTrue()); }
104 Node* NewIfFalse() { return NewNode(common()->IfFalse()); }
105 Node* NewIfValue(int32_t value) { return NewNode(common()->IfValue(value)); }
106 Node* NewIfDefault() { return NewNode(common()->IfDefault());
[all...] |
| allocation-builder.h | 31 effect_ = graph()->NewNode(
34 graph()->NewNode(simplified()->Allocate(type, pretenure),
41 effect_ = graph()->NewNode(simplified()->StoreField(access), allocation_,
47 effect_ = graph()->NewNode(simplified()->StoreElement(access), allocation_,
92 return graph()->NewNode(common()->FinishRegion(), allocation_, effect_);
|
| simplified-lowering.cc | [all...] |
| property-access-builder.cc | 59 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), *receiver,
72 graph()->NewNode(simplified()->CheckNumber(VectorSlotPair()), *receiver,
124 receiver = *effect = graph()->NewNode(simplified()->CheckHeapObject(),
154 *effect = graph()->NewNode(simplified()->CheckMaps(flags, maps), receiver,
165 graph()->NewNode(simplified()->ReferenceEqual(), receiver, expected);
167 graph()->NewNode(simplified()->CheckIf(DeoptimizeReason::kWrongValue),
236 storage = *effect = graph()->NewNode(
258 storage = *effect = graph()->NewNode(
274 Node* value = *effect = graph()->NewNode(
|
| simd-scalar-lowering.cc | 35 placeholder_(graph()->NewNode(common()->Parameter(-2, "placeholder"),
350 new_indices[laneIndex] = graph()->NewNode(
352 graph()->NewNode(
388 rep_nodes[i] = graph()->NewNode(load_op, base, indices[i], effect_input,
395 rep_nodes[i] = graph()->NewNode(load_op, base, indices[i]);
456 graph()->NewNode(store_op, base, indices[i], rep_inputs[i],
464 graph()->NewNode(store_op, base, indices[i], rep_inputs[i]);
483 rep_node[i] = graph()->NewNode(op, rep_left[i], rep_right[i]);
487 rep_node[i] = graph()->NewNode(op, rep_left[i * 2], rep_left[i * 2 + 1]);
489 graph()->NewNode(op, rep_right[i * 2], rep_right[i * 2 + 1])
[all...] |
| representation-change.cc | 219 return jsgraph()->graph()->NewNode(
341 return jsgraph()->graph()->NewNode(
420 return jsgraph()->graph()->NewNode(
475 return jsgraph()->graph()->NewNode(op, node);
498 return jsgraph()->graph()->NewNode(
504 node = jsgraph()->graph()->NewNode(op, node);
513 node = jsgraph()->graph()->NewNode(op, node);
524 node = jsgraph()->graph()->NewNode(op, node);
534 return jsgraph()->graph()->NewNode(op, node);
559 return jsgraph()->graph()->NewNode(
[all...] |
| js-inlining-heuristic.cc | 527 effect = graph()->NewNode(checkpoint->op(), new_checkpoint_state, effect,
540 graph()->NewNode(node->op(), input_count, inputs);
577 graph()->NewNode(simplified()->ReferenceEqual(), callee, target);
579 graph()->NewNode(common()->Branch(), check, fallthrough_control);
580 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
581 if_successes[i] = graph()->NewNode(common()->IfTrue(), branch);
598 graph()->NewNode(node->op(), input_count, inputs);
641 if_successes[i] = graph()->NewNode(common()->IfSuccess(), calls[i]);
643 graph()->NewNode(common()->IfException(), calls[i], calls[i]);
648 graph()->NewNode(common()->Merge(num_calls), num_calls, if_exceptions)
[all...] |
| graph-assembler.h | 305 label->control_ = graph()->NewNode(common()->Loop(2), current_control_,
307 label->effect_ = graph()->NewNode(common()->EffectPhi(2), current_effect_,
309 Node* terminate = graph()->NewNode(common()->Terminate(), label->effect_,
313 label->bindings_[i] = graph()->NewNode(
338 label->control_ = graph()->NewNode(common()->Merge(2), label->control_,
340 label->effect_ = graph()->NewNode(common()->EffectPhi(2), label->effect_,
343 label->bindings_[i] = graph()->NewNode(
402 graph()->NewNode(common()->Branch(hint), condition, current_control_);
404 current_control_ = graph()->NewNode(common()->IfTrue(), branch);
407 current_control_ = graph()->NewNode(common()->IfFalse(), branch)
[all...] |
| /device/linaro/bootloader/edk2/ArmPkg/Library/UncachedMemoryAllocationLib/ |
| UncachedMemoryAllocationLib.c | 89 FREE_PAGE_NODE *NewNode;
101 NewNode = NULL;
117 if (NewNode == NULL) {
119 NewNode = Node;
120 } else if (NewNode->Pages > Node->Pages) {
122 NewNode = Node;
129 if (NewNode != NULL) {
130 NewNode->Allocated = TRUE;
131 NewNode->Allocation = (VOID*)(UINTN)NewNode->Base;
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| graphcycles.h | 61 // must have been allocated by NewNode() and not yet deallocated
63 int32 NewNode();
68 // NewNode().
|
| /device/linaro/bootloader/edk2/ArmVirtPkg/FdtClientDxe/ |
| FdtClientDxe.c | 275 INT32 NewNode;
280 NewNode = fdt_path_offset (mDeviceTreeBase, "/chosen");
281 if (NewNode < 0) {
282 NewNode = fdt_add_subnode (mDeviceTreeBase, 0, "/chosen");
285 if (NewNode < 0) {
289 *Node = NewNode;
|
| /external/clang/lib/Rewrite/ |
| 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;
543 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior();
545 // Move over the last 'WidthFactor' values from here to NewNode
[all...] |
