Home
last modified time | relevance | path

Searched refs:InputAt (Results 1 - 25 of 93) sorted by relevance

1234

/third_party/node/deps/v8/src/compiler/
H A Dsimplified-operator-reducer.cc52 HeapObjectMatcher m(node->InputAt(0)); in Reduce()
55 if (m.IsBooleanNot()) return Replace(m.InputAt(0)); in Reduce()
59 Int32Matcher m(node->InputAt(0)); in Reduce()
62 if (m.IsChangeTaggedToBit()) return Replace(m.InputAt(0)); in Reduce()
66 HeapObjectMatcher m(node->InputAt(0)); in Reduce()
72 if (m.IsChangeBitToTagged()) return Replace(m.InputAt(0)); in Reduce()
76 Float64Matcher m(node->InputAt(0)); in Reduce()
78 if (m.IsChangeTaggedToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
83 Int32Matcher m(node->InputAt(0)); in Reduce()
86 return Replace(m.InputAt( in Reduce()
[all...]
H A Ddecompression-optimizer.cc72 MaybeMarkAndQueueForRevisit(node->InputAt(0), in MarkNodeInputs()
77 MaybeMarkAndQueueForRevisit(node->InputAt(0), in MarkNodeInputs()
89 MaybeMarkAndQueueForRevisit(node->InputAt(0), in MarkNodeInputs()
91 MaybeMarkAndQueueForRevisit(node->InputAt(1), in MarkNodeInputs()
100 MaybeMarkAndQueueForRevisit(node->InputAt(0), in MarkNodeInputs()
102 MaybeMarkAndQueueForRevisit(node->InputAt(1), in MarkNodeInputs()
111 MaybeMarkAndQueueForRevisit(node->InputAt(2), in MarkNodeInputs()
125 MaybeMarkAndQueueForRevisit(node->InputAt(i), in MarkNodeInputs()
133 MaybeMarkAndQueueForRevisit(node->InputAt(i), curr_state); in MarkNodeInputs()
141 MaybeMarkAndQueueForRevisit(node->InputAt( in MarkNodeInputs()
[all...]
H A Dint64-lowering.cc62 Node* input = top.node->InputAt(top.input_index++); in LowerGraph()
129 Node* value = node->InputAt(2); in LowerWord64AtomicBinop()
168 Node* base = node->InputAt(0); in LowerLoadOperator()
169 Node* index = node->InputAt(1); in LowerLoadOperator()
175 Node* effect_high = node->InputAt(2); in LowerLoadOperator()
176 Node* control_high = node->InputAt(3); in LowerLoadOperator()
201 Node* base = node->InputAt(0); in LowerStoreOperator()
202 Node* index = node->InputAt(1); in LowerStoreOperator()
206 Node* value = node->InputAt(2); in LowerStoreOperator()
212 Node* effect_high = node->InputAt( in LowerStoreOperator()
[all...]
H A Dcommon-operator-reducer.cc94 Node* const cond = node->InputAt(0); in ReduceBranch()
102 DecideCondition(cond->InputAt(1)) == Decision::kFalse && in ReduceBranch()
103 DecideCondition(cond->InputAt(2)) == Decision::kTrue)) { in ReduceBranch()
119 node->ReplaceInput(0, cond->InputAt(0)); in ReduceBranch()
127 Node* const control = node->InputAt(1); in ReduceBranch()
157 NodeProperties::ReplaceValueInput(node, condition->InputAt(0), 0); in ReduceDeoptimizeConditional()
193 Node* if_true = node->InputAt(0); in ReduceMerge()
194 Node* if_false = node->InputAt(1); in ReduceMerge()
198 if_true->InputAt(0) == if_false->InputAt( in ReduceMerge()
[all...]
H A Dtype-narrowing-reducer.cc29 Type left_type = NodeProperties::GetType(node->InputAt(0)); in Reduce()
30 Type right_type = NodeProperties::GetType(node->InputAt(1)); in Reduce()
44 node->op(), NodeProperties::GetType(node->InputAt(0))); in Reduce()
50 new_type = op_typer_.Name(NodeProperties::GetType(node->InputAt(0)), \ in Reduce()
51 NodeProperties::GetType(node->InputAt(1))); \ in Reduce()
60 new_type = op_typer_.Name(NodeProperties::GetType(node->InputAt(0))); \ in Reduce()
H A Dloop-peeling.cc139 copier.Insert(node, node->InputAt(kAssumedLoopEntryIndex)); in Peel()
157 inputs.push_back(copier.map(loop_node->InputAt(i))); in Peel()
167 inputs.push_back(copier.map(node->InputAt(1 + i))); in Peel()
184 node->ReplaceInput(0, copier.map(node->InputAt(1))); in Peel()
186 new_entry = copier.map(loop_node->InputAt(1)); in Peel()
197 exit->ReplaceInput(1, copier.map(exit->InputAt(0))); in Peel()
202 exit->InsertInput(graph_->zone(), 1, copier.map(exit->InputAt(0))); in Peel()
208 exit->InsertInput(graph_->zone(), 1, copier.map(exit->InputAt(0))); in Peel()
247 NodeProperties::ReplaceUses(marker, marker->InputAt(0)); in EliminateLoopExit()
H A Dloop-unrolling.cc60 Node* stack_check = node->InputAt(0); in UnrollLoop()
102 if (node->InputAt(1) == loop_node) { in UnrollLoop()
169 COPY(loop_node, unrolling_count - 1)->InputAt(input_index); in UnrollLoop()
174 COPY(loop_node, copy_index - 1)->InputAt(input_index)); in UnrollLoop()
177 ->ReplaceInput(input_index, loop_node->InputAt(input_index)); in UnrollLoop()
198 COPY(use, unrolling_count - 1)->InputAt(input_index); in UnrollLoop()
203 COPY(use, copy_index - 1)->InputAt(input_index)); in UnrollLoop()
205 COPY(use, 0)->ReplaceInput(input_index, use->InputAt(input_index)); in UnrollLoop()
H A Dloop-variable-optimizer.cc141 VariableLimits merged = limits_.Get(node->InputAt(0)); in VisitMerge()
143 merged.ResetToCommonAncestor(limits_.Get(node->InputAt(i))); in VisitMerge()
155 Node* branch = node->InputAt(0); in VisitIf()
156 Node* cond = branch->InputAt(0); in VisitIf()
185 Node* left = node->InputAt(0); in AddCmpToLimits()
186 Node* right = node->InputAt(1); in AddCmpToLimits()
227 Node* initial = phi->InputAt(0); in TryGetInductionVariable()
228 Node* arith = phi->InputAt(1); in TryGetInductionVariable()
245 Node* input = arith->InputAt(0); in TryGetInductionVariable()
249 input = input->InputAt( in TryGetInductionVariable()
[all...]
H A Dnode-matchers.cc38 Node* input0 = merge->InputAt(0); in DiamondMatcher()
40 Node* input1 = merge->InputAt(1); in DiamondMatcher()
42 Node* branch = input0->InputAt(0); in DiamondMatcher()
43 if (branch != input1->InputAt(0)) return; in DiamondMatcher()
H A Deffect-control-linearizer.cc395 Node* input = node->InputAt(i); in UpdateEffectPhi()
447 edge.UpdateTo(node->InputAt(0)); in RemoveRenameNode()
576 inputs[index] = phi->InputAt(index); in TryCloneBranch()
1402 Node* value = node->InputAt(0); in LowerChangeFloat64ToTagged()
1457 Node* value = node->InputAt(0); in LowerChangeFloat64ToTaggedPointer()
1462 Node* value = node->InputAt(0); in LowerChangeBitToTagged()
1481 Node* value = node->InputAt(0); in LowerChangeInt31ToTaggedSigned()
1486 Node* value = node->InputAt(0); in LowerChangeInt32ToTagged()
1510 Node* value = node->InputAt(0); in LowerChangeInt64ToTagged()
1535 Node* value = node->InputAt( in LowerChangeUint32ToTagged()
[all...]
H A Dsimplified-lowering.cc381 Type type = FeedbackTypeOf(node->InputAt(0)); in TypePhi()
383 type = op_typer_.Merge(type, FeedbackTypeOf(node->InputAt(i))); in TypePhi()
389 return op_typer_.Merge(FeedbackTypeOf(node->InputAt(1)), in TypeSelect()
390 FeedbackTypeOf(node->InputAt(2))); in TypeSelect()
401 if (GetInfo(node->InputAt(i))->feedback_type().IsInvalid()) { in UpdateFeedbackType()
414 if (node->InputCount() > 0) input0_type = FeedbackTypeOf(node->InputAt(0)); in UpdateFeedbackType()
416 if (node->InputCount() > 1) input1_type = FeedbackTypeOf(node->InputAt(1)); in UpdateFeedbackType()
489 FeedbackTypeOf(node->InputAt(0))); in UpdateFeedbackType()
494 FeedbackTypeOf(node->InputAt(0))); in UpdateFeedbackType()
598 Node* input = node->InputAt(curren in GenerateTraversal()
[all...]
H A Dwasm-loop-peeling.cc56 DCHECK_EQ(node->InputAt(1), loop_node); in PeelWasmLoop()
60 graph->NewNode(common->Merge(2), node, copier.map(node)->InputAt(0)); in PeelWasmLoop()
75 copier.map(use)->InputAt(0), merge_node); in PeelWasmLoop()
93 use_edge.from()->ReplaceUses(use_edge.from()->InputAt(0)); in PeelWasmLoop()
95 use_edge.UpdateTo(loop_node->InputAt(0)); in PeelWasmLoop()
H A Dnode-matchers.h40 Node* InputAt(int index) const { return node()->InputAt(index); } in InputAt() function
273 : NodeMatcher(node), object_(InputAt(0)), index_(InputAt(1)) {} in LoadMatcher()
292 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
296 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
436 return this->left().node()->InputAt(0); in IndexInput()
758 if (from->InputAt( in OwnedByAddressingOperand()
[all...]
/third_party/rust/crates/regex/src/
H A Dinput.rs13 pub struct InputAt { structure names
20 impl InputAt { impls
69 fn at(&self, i: usize) -> InputAt; in at()
74 fn next_char(&self, at: InputAt) -> Char; in next_char()
79 fn previous_char(&self, at: InputAt) -> Char; in previous_char()
83 fn is_empty_match(&self, at: InputAt, empty: &InstEmptyLook) -> bool; in is_empty_match()
89 at: InputAt, in prefix_at()
90 ) -> Option<InputAt>; in prefix_at()
105 fn at(&self, i: usize) -> InputAt { in at()
109 fn next_char(&self, at: InputAt)
[all...]
/third_party/node/deps/v8/src/compiler/backend/ia32/
H A Dinstruction-selector-ia32.cc229 UseRegisterWithMode(node->InputAt(0), register_mode); in GetEffectiveAddressMemoryOperand()
231 UseRegisterWithMode(node->InputAt(1), register_mode); in GetEffectiveAddressMemoryOperand()
292 Node* input = node->InputAt(0); in VisitRO()
303 selector->Emit(opcode, g.DefineAsRegister(node), g.Use(node->InputAt(0)), in VisitROWithTemp()
312 g.UseUniqueRegister(node->InputAt(0)), arraysize(temps), in VisitROWithTempSimd()
320 g.UseRegister(node->InputAt(0))); in VisitRR()
326 InstructionOperand operand0 = g.UseRegister(node->InputAt(0)); in VisitRROFloat()
327 InstructionOperand operand1 = g.Use(node->InputAt(1)); in VisitRROFloat()
355 InstructionOperand operand0 = g.UseRegister(node->InputAt(0)); in VisitRRSimd()
374 InstructionOperand operand0 = g.UseRegister(node->InputAt( in VisitRROSimd()
[all...]
/third_party/node/deps/v8/src/compiler/backend/x64/
H A Dinstruction-selector-x64.cc231 inputs[(*input_count)++] = UseRegister(operand->InputAt(0), reg_kind); in GetEffectiveAddressMemoryOperand()
232 inputs[(*input_count)++] = UseRegister(operand->InputAt(1), reg_kind); in GetEffectiveAddressMemoryOperand()
387 Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), rdx)); in VisitAbortCSADcheck()
413 inputs[input_count++] = g.UseRegister(node->InputAt(2)); in VisitLoadLane()
523 Node* base = node->InputAt(0); in VisitAtomicExchange()
524 Node* index = node->InputAt(1); in VisitAtomicExchange()
525 Node* value = node->InputAt(2); in VisitAtomicExchange()
540 Node* base = node->InputAt(0); in VisitStoreCommon()
541 Node* index = node->InputAt(1); in VisitStoreCommon()
542 Node* value = node->InputAt( in VisitStoreCommon()
[all...]
/third_party/node/deps/v8/src/compiler/backend/mips/
H A Dinstruction-selector-mips.cc112 g.UseRegister(node->InputAt(0)), in VisitRRR()
113 g.UseRegister(node->InputAt(1))); in VisitRRR()
120 g.UseUniqueRegister(node->InputAt(0)), in VisitUniqueRRR()
121 g.UseUniqueRegister(node->InputAt(1))); in VisitUniqueRRR()
127 opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)), in VisitRRRR()
128 g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(2))); in VisitRRRR()
135 g.UseRegister(node->InputAt(0))); in VisitRR()
143 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm)); in VisitRRI()
151 g.UseRegister(node->InputAt( in VisitRRIR()
[all...]
/third_party/node/deps/v8/src/compiler/backend/riscv64/
H A Dinstruction-selector-riscv64.cc132 g.UseRegister(node->InputAt(0))); in VisitRR()
140 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm)); in VisitRRI()
146 if (g.IsIntegerConstant(node->InputAt(1))) { in VisitSimdShift()
148 g.UseRegister(node->InputAt(0)), in VisitSimdShift()
149 g.UseImmediate(node->InputAt(1))); in VisitSimdShift()
152 g.UseRegister(node->InputAt(0)), in VisitSimdShift()
153 g.UseRegister(node->InputAt(1))); in VisitSimdShift()
162 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm), in VisitRRIR()
163 g.UseRegister(node->InputAt(1))); in VisitRRIR()
170 g.UseRegister(node->InputAt( in VisitRRR()
[all...]
/third_party/node/deps/v8/src/compiler/backend/ppc/
H A Dinstruction-selector-ppc.cc79 g.UseRegister(node->InputAt(0))); in VisitRR()
86 g.UseRegister(node->InputAt(0)), in VisitRRR()
87 g.UseRegister(node->InputAt(1))); in VisitRRR()
94 g.UseRegister(node->InputAt(0)), in VisitRRO()
95 g.UseOperand(node->InputAt(1), operand_mode)); in VisitRRO()
102 InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; in VisitTryTruncateDouble()
170 Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), r4)); in VisitAbortCSADcheck()
176 Node* base = node->InputAt(0); in VisitLoadCommon()
177 Node* offset = node->InputAt(1); in VisitLoadCommon()
273 Node* base = node->InputAt( in VisitStoreCommon()
[all...]
/third_party/node/deps/v8/src/compiler/backend/arm/
H A Dinstruction-selector-arm.cc87 g.UseRegister(node->InputAt(0))); in VisitRR()
94 g.UseRegister(node->InputAt(0)), in VisitRRR()
95 g.UseRegister(node->InputAt(1))); in VisitRRR()
101 Int32Matcher m(node->InputAt(1)); in VisitSimdShiftRRR()
107 g.UseRegister(node->InputAt(0)), in VisitSimdShiftRRR()
108 g.UseImmediate(node->InputAt(1))); in VisitSimdShiftRRR()
125 Node* in0 = node->InputAt(0); in VisitRRRShuffle()
126 Node* in1 = node->InputAt(1); in VisitRRRShuffle()
133 g.UseRegister(node->InputAt(0)), in VisitRRRShuffle()
134 g.UseRegister(node->InputAt( in VisitRRRShuffle()
[all...]
/third_party/node/deps/v8/src/compiler/backend/mips64/
H A Dinstruction-selector-mips64.cc126 g.UseRegister(node->InputAt(0))); in VisitRR()
134 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm)); in VisitRRI()
140 if (g.IsIntegerConstant(node->InputAt(1))) { in VisitSimdShift()
142 g.UseRegister(node->InputAt(0)), in VisitSimdShift()
143 g.UseImmediate(node->InputAt(1))); in VisitSimdShift()
146 g.UseRegister(node->InputAt(0)), in VisitSimdShift()
147 g.UseRegister(node->InputAt(1))); in VisitSimdShift()
156 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm), in VisitRRIR()
157 g.UseRegister(node->InputAt(1))); in VisitRRIR()
164 g.UseRegister(node->InputAt( in VisitRRR()
[all...]
/third_party/node/deps/v8/src/compiler/backend/arm64/
H A Dinstruction-selector-arm64.cc150 g.UseRegister(node->InputAt(0))); in VisitRR()
157 g.UseRegister(node->InputAt(0))); in VisitRR()
163 g.UseRegister(node->InputAt(0)), in VisitRRR()
164 g.UseRegister(node->InputAt(1))); in VisitRRR()
171 g.UseRegister(node->InputAt(0)), in VisitRRR()
172 g.UseRegister(node->InputAt(1))); in VisitRRR()
178 if (g.IsIntegerConstant(node->InputAt(1))) { in VisitSimdShiftRRR()
179 if (g.GetIntegerConstantValue(node->InputAt(1)) % width == 0) { in VisitSimdShiftRRR()
183 g.UseRegister(node->InputAt(0)), in VisitSimdShiftRRR()
184 g.UseImmediate(node->InputAt( in VisitSimdShiftRRR()
[all...]
/third_party/node/deps/v8/src/compiler/backend/
H A Dcode-generator-impl.h30 return ToRegister(instr_->InputAt(index)); in InputRegister()
34 return ToFloatRegister(instr_->InputAt(index)); in InputFloatRegister()
38 return ToDoubleRegister(instr_->InputAt(index)); in InputDoubleRegister()
42 return ToSimd128Register(instr_->InputAt(index)); in InputSimd128Register()
45 double InputDouble(size_t index) { return ToDouble(instr_->InputAt(index)); } in InputDouble()
47 float InputFloat32(size_t index) { return ToFloat32(instr_->InputAt(index)); } in InputFloat32()
50 return ToConstant(instr_->InputAt(index)).ToInt32(); in InputInt32()
58 return ToConstant(instr_->InputAt(index)).ToInt64(); in InputInt64()
90 return ToExternalReference(instr_->InputAt(index)); in InputExternalReference()
94 return ToCode(instr_->InputAt(inde in InputCode()
[all...]
/third_party/node/deps/v8/src/compiler/backend/loong64/
H A Dinstruction-selector-loong64.cc126 g.UseRegister(node->InputAt(0))); in VisitRR()
134 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm)); in VisitRRI()
140 if (g.IsIntegerConstant(node->InputAt(1))) { in VisitSimdShift()
142 g.UseRegister(node->InputAt(0)), in VisitSimdShift()
143 g.UseImmediate(node->InputAt(1))); in VisitSimdShift()
146 g.UseRegister(node->InputAt(0)), in VisitSimdShift()
147 g.UseRegister(node->InputAt(1))); in VisitSimdShift()
156 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm), in VisitRRIR()
157 g.UseRegister(node->InputAt(1))); in VisitRRIR()
164 g.UseRegister(node->InputAt( in VisitRRR()
[all...]
/third_party/node/deps/v8/src/compiler/backend/s390/
H A Dinstruction-selector-s390.cc231 inputs[(*input_count)++] = UseRegister(operand->InputAt(0)); in GetEffectiveAddressMemoryOperand()
232 inputs[(*input_count)++] = UseRegister(operand->InputAt(1)); in GetEffectiveAddressMemoryOperand()
390 // Node* const value = node->InputAt(0); in ProduceWord32Result()
438 InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; in VisitTryTruncateDouble()
587 Node* input = node->InputAt(0); in VisitUnaryOp()
695 Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), r3)); in VisitAbortCSADcheck()
725 Node* base = node->InputAt(0); in VisitGeneralStore()
726 Node* offset = node->InputAt(1); in VisitGeneralStore()
727 Node* value = node->InputAt(2); in VisitGeneralStore()
773 value = value->InputAt( in VisitGeneralStore()
[all...]

Completed in 57 milliseconds

1234