Home
last modified time | relevance | path

Searched refs:input_count (Results 1 - 25 of 79) sorted by relevance

1234

/third_party/node/deps/v8/src/compiler/
H A Dnode.cc58 Node* Node::NewImpl(Zone* zone, NodeId id, const Operator* op, int input_count, in NewImpl() argument
62 DCHECK_GE(input_count, 0); in NewImpl()
70 for (int i = 0; i < input_count; i++) { in NewImpl()
77 if (input_count > kMaxInlineCapacity) { in NewImpl()
80 has_extensible_inputs ? input_count + kMaxInlineCapacity : input_count; in NewImpl()
90 outline->count_ = input_count; in NewImpl()
98 int capacity = std::max(1, input_count); in NewImpl()
101 capacity = std::min(input_count + 3, max); in NewImpl()
110 node = new (node_buffer) Node(id, op, input_count, capacit in NewImpl()
131 New(Zone* zone, NodeId id, const Operator* op, int input_count, Node* const* inputs, bool has_extensible_inputs) New() argument
137 int const input_count = node->InputCount(); Clone() local
171 int const input_count = InputCount(); AppendInput() local
[all...]
H A Dcommon-operator.cc617 #define CACHED_END(input_count) \
618 EndOperator<input_count> kEnd##input_count##Operator;
657 #define CACHED_EFFECT_PHI(input_count) \
658 EffectPhiOperator<input_count> kEffectPhi##input_count##Operator;
684 #define CACHED_LOOP(input_count) \
685 LoopOperator<input_count> kLoop##input_count##Operator;
697 #define CACHED_MERGE(input_count) \
1341 InductionVariablePhi(int input_count) InductionVariablePhi() argument
[all...]
H A Dgraph.cc50 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs, in NewNode() argument
52 Node* node = NewNodeUnchecked(op, input_count, inputs, incomplete); in NewNode()
57 Node* Graph::NewNodeUnchecked(const Operator* op, int input_count, in NewNodeUnchecked() argument
60 Node::New(zone(), NextNodeId(), op, input_count, inputs, incomplete); in NewNodeUnchecked()
H A Djs-inlining-heuristic.cc415 Node** inputs, int input_count) { in TryReuseDispatch()
629 inputs[input_count - 3] = new_lazy_frame_state; in TryReuseDispatch()
630 inputs[input_count - 2] = effect_phi_effect; in TryReuseDispatch()
631 inputs[input_count - 1] = control; in TryReuseDispatch()
633 graph()->NewNode(node->op(), input_count, inputs); in TryReuseDispatch()
637 node->ReplaceInput(input_count - 1, jsgraph()->Dead()); in TryReuseDispatch()
652 int input_count) { in CreateOrReuseDispatch()
656 input_count)) { in CreateOrReuseDispatch()
695 inputs[input_count - 1] = if_successes[i]; in CreateOrReuseDispatch()
697 graph()->NewNode(node->op(), input_count, input in CreateOrReuseDispatch()
413 TryReuseDispatch(Node* node, Node* callee, Node** if_successes, Node** calls, Node** inputs, int input_count) TryReuseDispatch() argument
648 CreateOrReuseDispatch(Node* node, Node* callee, Candidate const& candidate, Node** if_successes, Node** calls, Node** inputs, int input_count) CreateOrReuseDispatch() argument
724 int const input_count = node->InputCount(); InlineCandidate() local
[all...]
H A Draw-machine-assembler.cc701 int input_count, Node* const* inputs) { in CallN()
704 DCHECK_EQ(input_count, call_descriptor->ParameterCount() + 1); in CallN()
705 return AddNode(common()->Call(call_descriptor), input_count, inputs); in CallN()
709 int input_count, in CallNWithFrameState()
713 DCHECK_EQ(input_count, call_descriptor->ParameterCount() + 2); in CallNWithFrameState()
714 return AddNode(common()->Call(call_descriptor), input_count, inputs); in CallNWithFrameState()
718 int input_count, Node* const* inputs) { in TailCallN()
720 DCHECK_EQ(input_count, call_descriptor->ParameterCount() + 1); in TailCallN()
722 MakeNode(common()->TailCall(call_descriptor), input_count, inputs); in TailCallN()
840 Node* RawMachineAssembler::Phi(MachineRepresentation rep, int input_count, in Phi() argument
700 CallN(CallDescriptor* call_descriptor, int input_count, Node* const* inputs) CallN() argument
708 CallNWithFrameState(CallDescriptor* call_descriptor, int input_count, Node* const* inputs) CallNWithFrameState() argument
717 TailCallN(CallDescriptor* call_descriptor, int input_count, Node* const* inputs) TailCallN() argument
855 AddNode(const Operator* op, int input_count, Node* const* inputs) AddNode() argument
864 MakeNode(const Operator* op, int input_count, Node* const* inputs) MakeNode() argument
[all...]
H A Descape-analysis-reducer.cc373 const Operator* op, int input_count, in Constructor()
380 if (input_count <= tmp_input_count) { in Constructor()
381 tmp_->TrimInputCount(input_count); in Constructor()
383 for (int i = 0; i < input_count; ++i) { in Constructor()
392 tmp_ = node_cache_->graph_->NewNode(op, input_count, inputs); in Constructor()
372 Constructor(NodeHashCache* cache, const Operator* op, int input_count, Node** inputs, Type type) Constructor() argument
H A Dgraph.h61 Node* NewNodeUnchecked(const Operator* op, int input_count,
65 Node* NewNode(const Operator* op, int input_count, Node* const* inputs,
H A Djs-inlining-heuristic.h84 Node** calls, Node** inputs, int input_count);
86 Node** calls, Node** inputs, int input_count);
H A Dbranch-elimination.cc103 int input_count = inputs.count(); in SimplifyBranchCondition() local
104 for (int i = 0; i != input_count; ++i) { in SimplifyBranchCondition()
126 input_count), in SimplifyBranchCondition()
127 input_count + 1, &phi_inputs.at(0)); in SimplifyBranchCondition()
H A Ddead-code-elimination.cc223 int input_count = node->op()->ValueInputCount(); in ReducePhi() local
224 for (int i = 0; i < input_count; ++i) { in ReducePhi()
242 int input_count = node->op()->EffectInputCount(); in ReduceEffectPhi() local
243 for (int i = 0; i < input_count; ++i) { in ReduceEffectPhi()
H A Dmemory-optimizer.cc418 int const input_count = node->InputCount() - 1; in EnqueueMerge() local
419 DCHECK_LT(0, input_count); in EnqueueMerge()
420 Node* const control = node->InputAt(input_count); in EnqueueMerge()
447 if (it->second.size() == static_cast<size_t>(input_count)) { in EnqueueMerge()
/third_party/node/deps/v8/src/compiler/backend/s390/
H A Dinstruction-selector-s390.cc174 size_t* input_count) { in GenerateMemoryOperandInputs()
177 inputs[(*input_count)++] = UseRegister(base); in GenerateMemoryOperandInputs()
179 inputs[(*input_count)++] = UseRegister(index); in GenerateMemoryOperandInputs()
181 inputs[(*input_count)++] = displacement_mode in GenerateMemoryOperandInputs()
192 inputs[(*input_count)++] = displacement_mode == kNegativeDisplacement in GenerateMemoryOperandInputs()
200 inputs[(*input_count)++] = UseRegister(index); in GenerateMemoryOperandInputs()
202 inputs[(*input_count)++] = displacement_mode == kNegativeDisplacement in GenerateMemoryOperandInputs()
214 Node* operand, InstructionOperand inputs[], size_t* input_count, in GetEffectiveAddressMemoryOperand()
229 input_count); in GetEffectiveAddressMemoryOperand()
231 inputs[(*input_count) in GetEffectiveAddressMemoryOperand()
170 GenerateMemoryOperandInputs(Node* index, Node* base, Node* displacement, DisplacementMode displacement_mode, InstructionOperand inputs[], size_t* input_count) GenerateMemoryOperandInputs() argument
213 GetEffectiveAddressMemoryOperand( Node* operand, InstructionOperand inputs[], size_t* input_count, OperandModes immediate_mode = OperandMode::kInt20Imm) GetEffectiveAddressMemoryOperand() argument
453 GenerateRightOperands(InstructionSelector* selector, Node* node, Node* right, InstructionCode* opcode, OperandModes* operand_mode, InstructionOperand* inputs, size_t* input_count, CanCombineWithLoad canCombineWithLoad) GenerateRightOperands() argument
498 GenerateBinOpOperands(InstructionSelector* selector, Node* node, Node* left, Node* right, InstructionCode* opcode, OperandModes* operand_mode, InstructionOperand* inputs, size_t* input_count, CanCombineWithLoad canCombineWithLoad) GenerateBinOpOperands() argument
584 size_t input_count = 0; VisitUnaryOp() local
618 DCHECK_GE(arraysize(inputs), input_count); VisitUnaryOp() local
635 size_t input_count = 0; VisitBinOp() local
675 DCHECK_GE(arraysize(inputs), input_count); VisitBinOp() local
703 size_t input_count = 0; VisitLoad() local
732 size_t input_count = 0; VisitGeneralStore() local
809 size_t input_count = 0; VisitGeneralStore() local
868 static constexpr int input_count = arraysize(inputs); VisitStackPointerGreaterThan() local
1618 size_t input_count = 0; VisitWordCompare() local
1717 size_t input_count = 0; VisitLoadAndTest() local
2176 size_t input_count = 0; VisitAtomicExchange() local
2232 size_t input_count = 0; VisitAtomicCompareExchange() local
2299 size_t input_count = 0; VisitAtomicBinop() local
2809 size_t input_count = 0; VisitLoadLane() local
2884 size_t input_count = 0; VisitStoreLane() local
[all...]
/third_party/node/deps/v8/src/compiler/backend/arm/
H A Dinstruction-selector-arm.cc270 size_t input_count = 0; in VisitBinop() local
284 inputs[input_count++] = input; in VisitBinop()
285 inputs[input_count++] = input; in VisitBinop()
287 &input_count, &inputs[1])) { in VisitBinop()
289 input_count++; in VisitBinop()
291 m.left().node(), &input_count, in VisitBinop()
295 input_count++; in VisitBinop()
298 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
299 inputs[input_count++] = g.UseRegister(m.right().node()); in VisitBinop()
304 DCHECK_NE(0u, input_count); in VisitBinop()
306 DCHECK_GE(arraysize(inputs), input_count); VisitBinop() local
392 size_t input_count = 2; EmitLoad() local
430 EmitStore(InstructionSelector* selector, InstructionCode opcode, size_t input_count, InstructionOperand* inputs, Node* index) EmitStore() argument
515 size_t input_count = 4; VisitStoreLane() local
534 size_t input_count = 4; VisitLoadLane() local
590 size_t input_count = 2; VisitLoadTransform() local
710 size_t input_count = 0; VisitStoreCommon() local
756 int input_count = 2; VisitStoreCommon() local
767 size_t input_count = 0; VisitStoreCommon() local
814 size_t input_count; VisitUnalignedLoad() local
858 size_t input_count = 0; VisitUnalignedStore() local
884 size_t input_count; VisitUnalignedStore() local
1110 static constexpr int input_count = arraysize(inputs); VisitStackPointerGreaterThan() local
1124 size_t input_count = 2; VisitShift() local
1134 DCHECK_GE(arraysize(inputs), input_count); VisitShift() local
1924 size_t input_count = 0; VisitWordCompare() local
1957 DCHECK_GE(arraysize(inputs), input_count); VisitWordCompare() local
2333 size_t input_count = 0; VisitWord32AtomicExchange() local
2368 size_t input_count = 0; VisitWord32AtomicCompareExchange() local
2406 size_t input_count = 0; VisitWord32AtomicBinaryOperation() local
2436 size_t input_count = 0; VisitWord32AtomicPairLoad() local
[all...]
/third_party/node/deps/v8/src/compiler/backend/x64/
H A Dinstruction-selector-x64.cc130 size_t* input_count, in GenerateMemoryOperandInputs()
143 inputs[(*input_count)++] = UseRegister(base, reg_kind); in GenerateMemoryOperandInputs()
146 inputs[(*input_count)++] = UseRegister(index, reg_kind); in GenerateMemoryOperandInputs()
148 inputs[(*input_count)++] = displacement_mode == kNegativeDisplacement in GenerateMemoryOperandInputs()
163 inputs[(*input_count)++] = displacement_mode == kNegativeDisplacement in GenerateMemoryOperandInputs()
173 inputs[(*input_count)++] = UseRegister(displacement, reg_kind); in GenerateMemoryOperandInputs()
176 inputs[(*input_count)++] = UseRegister(index, reg_kind); in GenerateMemoryOperandInputs()
177 inputs[(*input_count)++] = displacement_mode == kNegativeDisplacement in GenerateMemoryOperandInputs()
185 inputs[(*input_count)++] = UseRegister(index, reg_kind); in GenerateMemoryOperandInputs()
191 inputs[(*input_count) in GenerateMemoryOperandInputs()
127 GenerateMemoryOperandInputs( Node* index, int scale_exponent, Node* base, Node* displacement, DisplacementMode displacement_mode, InstructionOperand inputs[], size_t* input_count, RegisterUseKind reg_kind = RegisterUseKind::kUseRegister) GenerateMemoryOperandInputs() argument
198 GetEffectiveAddressMemoryOperand( Node* operand, InstructionOperand inputs[], size_t* input_count, RegisterUseKind reg_kind = RegisterUseKind::kUseRegister) GetEffectiveAddressMemoryOperand() argument
411 size_t input_count = 0; VisitLoadLane() local
499 size_t input_count = 0; VisitLoad() local
591 size_t input_count = 0; VisitStoreCommon() local
651 size_t input_count = 0; VisitProtectedStore() local
689 size_t input_count = 0; VisitStoreLane() local
713 size_t input_count = 0; VisitBinop() local
760 DCHECK_GE(arraysize(inputs), input_count); VisitBinop() local
849 size_t input_count = 0; VisitStackPointerGreaterThan() local
904 size_t input_count = 0; TryMergeTruncateInt64ToInt32IntoLoad() local
989 size_t input_count = 0; EmitLea() local
995 DCHECK_GE(arraysize(inputs), input_count); EmitLea() local
1114 size_t input_count = 0; TryMatchLoadWord64AndShiftRight() local
1548 size_t input_count = 0; VisitChangeInt32ToInt64() local
1668 size_t input_count = 0; VisitFloatBinop() local
1705 DCHECK_GE(arraysize(inputs), input_count); VisitFloatBinop() local
1984 size_t input_count = 0; EmitPrepareArguments() local
2033 size_t input_count = 0; VisitCompareWithMemoryOperand() local
3767 int input_count = 0; VisitI8x16Shuffle() local
[all...]
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-ir.h432 static Derived* New(Zone* zone, size_t input_count, Args&&... args) { in New() argument
434 Allocate<Derived>(zone, input_count, std::forward<Args>(args)...); in New()
464 constexpr bool has_inputs() const { return input_count() > 0; } in has_inputs()
465 constexpr uint16_t input_count() const { in input_count() function in v8::internal::maglev::NodeBase
477 return std::make_reverse_iterator(input_address(input_count() - 1)); in end()
524 reinterpret_cast<EagerDeoptInfo*>(input_address(input_count() - 1)) - in eager_deopt_info()
532 input_address(input_count() - 1)) - in eager_deopt_info()
539 return (reinterpret_cast<LazyDeoptInfo*>(input_address(input_count() - 1)) - in lazy_deopt_info()
547 input_address(input_count() - 1)) - in lazy_deopt_info()
555 DCHECK_LT(index, input_count()); in input_address()
592 Allocate(Zone* zone, size_t input_count, Args&&... args) Allocate() argument
840 constexpr uint16_t input_count() const { return kInputCount; } input_count() function in v8::internal::maglev::FixedInputNodeT
872 constexpr uint16_t input_count() const { return kInputCount; } input_count() function in v8::internal::maglev::FixedInputValueNodeT
1466 constexpr uint16_t input_count() const { return kInputCount; } input_count() function in v8::internal::maglev::UnconditionalControlNodeT
1510 constexpr uint16_t input_count() const { return kInputCount; } input_count() function in v8::internal::maglev::ConditionalControlNodeT
[all...]
H A Dmaglev-graph-verifier.h69 DCHECK_EQ(node->input_count(), 0); in Process()
84 DCHECK_EQ(node->input_count(), 1); in Process()
116 DCHECK_EQ(node->input_count(), 2); in Process()
128 for (int i = 0; i < node->input_count(); i++) { in Process()
/third_party/node/deps/v8/src/compiler/backend/ia32/
H A Dinstruction-selector-ia32.cc133 size_t* input_count, RegisterMode register_mode = kRegister) { in GenerateMemoryOperandInputs()
146 inputs[(*input_count)++] = UseRegisterWithMode(base, register_mode); in GenerateMemoryOperandInputs()
149 inputs[(*input_count)++] = UseRegisterWithMode(index, register_mode); in GenerateMemoryOperandInputs()
151 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
164 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
171 inputs[(*input_count)++] = UseRegisterWithMode(index, register_mode); in GenerateMemoryOperandInputs()
173 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
183 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
193 size_t* input_count, RegisterMode register_mode = kRegister) { in GenerateMemoryOperandInputs()
198 displacement_mode, inputs, input_count, in GenerateMemoryOperandInputs()
130 GenerateMemoryOperandInputs( Node* index, int scale, Node* base, int32_t displacement, DisplacementMode displacement_mode, InstructionOperand inputs[], size_t* input_count, RegisterMode register_mode = kRegister) GenerateMemoryOperandInputs() argument
190 GenerateMemoryOperandInputs( Node* index, int scale, Node* base, Node* displacement_node, DisplacementMode displacement_mode, InstructionOperand inputs[], size_t* input_count, RegisterMode register_mode = kRegister) GenerateMemoryOperandInputs() argument
202 GetEffectiveAddressMemoryOperand( Node* node, InstructionOperand inputs[], size_t* input_count, RegisterMode register_mode = kRegister) GetEffectiveAddressMemoryOperand() argument
512 size_t input_count = 0; VisitLoadLane() local
584 size_t input_count = 0; VisitLoadTransform() local
597 size_t input_count = 0; VisitLoad() local
735 size_t input_count = 0; VisitStoreCommon() local
781 size_t input_count = 0; VisitStoreLane() local
809 size_t input_count = 0; VisitBinop() local
851 DCHECK_GE(arraysize(inputs), input_count); VisitBinop() local
916 size_t input_count = 0; VisitStackPointerGreaterThan() local
927 static constexpr int input_count = arraysize(inputs); VisitStackPointerGreaterThan() local
981 size_t input_count = 0; EmitLea() local
987 DCHECK_GE(arraysize(inputs), input_count); EmitLea() local
1294 size_t input_count = 0; VisitInt32Add() local
1300 DCHECK_GE(arraysize(inputs), input_count); VisitInt32Add() local
1483 size_t input_count = 0; EmitPrepareArguments() local
1532 size_t input_count = 0; VisitCompareWithMemoryOperand() local
2153 size_t input_count = 0; VisitWord32AtomicPairLoad() local
3009 int input_count = 0; VisitI8x16Shuffle() local
[all...]
/third_party/mesa3d/src/imagination/vulkan/
H A Dpvr_pass.c64 for (uint32_t i = 0; i < subpass->input_count; i++) { in pvr_subpass_has_msaa_input_attachment()
104 if (subpass->input_count != 0) in pvr_is_subpass_initops_flush_needed()
452 subpass->input_count = desc->inputAttachmentCount; in pvr_CreateRenderPass2()
453 if (subpass->input_count > 0) { in pvr_CreateRenderPass2()
455 subpass_attachments += subpass->input_count; in pvr_CreateRenderPass2()
457 for (uint32_t j = 0; j < subpass->input_count; j++) { in pvr_CreateRenderPass2()
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-selector.cc210 size_t input_count = arraysize(inputs); in Emit() local
211 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
223 size_t input_count = arraysize(inputs); in Emit() local
224 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
234 size_t input_count = arraysize(inputs); in Emit() local
235 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
245 size_t input_count = arraysize(inputs); in Emit() local
246 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
257 size_t input_count = arraysize(inputs); in Emit() local
258 return Emit(opcode, output_count, &output, input_count, input in Emit()
262 Emit( InstructionCode opcode, size_t output_count, InstructionOperand* outputs, size_t input_count, InstructionOperand* inputs, size_t temp_count, InstructionOperand* temps) Emit() argument
626 int const input_count = input->op()->ValueInputCount(); AddOperandToStateValueDescriptor() local
823 EmitWithContinuation( InstructionCode opcode, size_t output_count, InstructionOperand* outputs, size_t input_count, InstructionOperand* inputs, FlagsContinuation* cont) EmitWithContinuation() argument
830 EmitWithContinuation( InstructionCode opcode, size_t output_count, InstructionOperand* outputs, size_t input_count, InstructionOperand* inputs, size_t temp_count, InstructionOperand* temps, FlagsContinuation* cont) EmitWithContinuation() argument
931 size_t input_count() const { return descriptor->InputCount(); } input_count() function
1105 size_t input_count = static_cast<size_t>(buffer->input_count()); InitializeCallBuffer() member
2478 size_t input_count = 2 + sw.value_range(); EmitTableSwitch() local
2496 size_t input_count = 2 + sw.case_count() * 2; EmitBinarySearchSwitch() local
2868 const int input_count = node->op()->ValueInputCount(); VisitPhi() local
3092 const int input_count = linkage()->GetIncomingDescriptor()->ReturnCount() == 0 VisitReturn() local
3258 int input_count = node->op()->ValueInputCount(); ZeroExtendsWord32ToWord64() local
[all...]
/third_party/node/deps/v8/src/compiler/backend/mips/
H A Dinstruction-selector-mips.cc183 size_t input_count = 0; in VisitBinop() local
187 if (TryMatchImmediate(selector, &opcode, m.right().node(), &input_count, in VisitBinop()
190 input_count++; in VisitBinop()
193 &input_count, &inputs[1])) { in VisitBinop()
196 input_count++; in VisitBinop()
198 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
199 inputs[input_count++] = g.UseOperand(m.right().node(), opcode); in VisitBinop()
211 DCHECK_NE(0u, input_count); in VisitBinop()
213 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop() local
216 selector->EmitWithContinuation(opcode, output_count, outputs, input_count, in VisitBinop()
416 size_t input_count = 0; VisitStore() local
1646 static constexpr int input_count = arraysize(inputs); VisitStackPointerGreaterThan() local
2009 size_t input_count = 0; VisitWord32AtomicExchange() local
2047 size_t input_count = 0; VisitWord32AtomicCompareExchange() local
2087 size_t input_count = 0; VisitWord32AtomicBinaryOperation() local
[all...]
/third_party/node/deps/v8/src/compiler/backend/ppc/
H A Dinstruction-selector-ppc.cc124 size_t input_count = 0; in VisitBinop() local
128 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
129 inputs[input_count++] = g.UseOperand(m.right().node(), operand_mode); in VisitBinop()
140 DCHECK_NE(0u, input_count); in VisitBinop()
142 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop() local
145 selector->EmitWithContinuation(opcode, output_count, outputs, input_count, in VisitBinop()
297 size_t input_count = 0; in VisitStoreCommon() local
298 inputs[input_count++] = g.UseUniqueRegister(base); in VisitStoreCommon()
306 inputs[input_count++] = g.UseImmediate(offset); in VisitStoreCommon()
309 inputs[input_count in VisitStoreCommon()
629 static constexpr int input_count = arraysize(inputs); VisitStackPointerGreaterThan() local
2003 size_t input_count = 0; VisitAtomicExchange() local
2061 size_t input_count = 0; VisitAtomicCompareExchange() local
2147 size_t input_count = 0; VisitAtomicBinaryOperation() local
[all...]
/third_party/node/deps/v8/src/compiler/backend/arm64/
H A Dinstruction-selector-arm64.cc464 size_t input_count = 0; in VisitBinop() local
477 inputs[input_count++] = g.UseRegister(left_node); in VisitBinop()
478 inputs[input_count++] = g.UseImmediate(right_node); in VisitBinop()
481 inputs[input_count++] = g.UseRegister(right_node); in VisitBinop()
482 inputs[input_count++] = g.UseImmediate(left_node); in VisitBinop()
486 input_count += 2; in VisitBinop()
491 input_count += 2; in VisitBinop()
495 inputs[input_count++] = g.UseRegisterOrImmediateZero(left_node); in VisitBinop()
496 inputs[input_count++] = g.UseRegister(m_shift.left().node()); in VisitBinop()
498 inputs[input_count in VisitBinop()
525 DCHECK_GE(arraysize(inputs), input_count); VisitBinop() local
594 size_t input_count = 0; EmitLoad() local
883 size_t input_count = 0; VisitStore() local
905 size_t input_count = 0; VisitStore() local
1268 static constexpr int input_count = arraysize(inputs); VisitStackPointerGreaterThan() local
[all...]
/third_party/node/deps/v8/src/compiler/backend/mips64/
H A Dinstruction-selector-mips64.cc295 size_t input_count = 0; in VisitBinop() local
299 if (TryMatchImmediate(selector, &opcode, m.right().node(), &input_count, in VisitBinop()
302 input_count++; in VisitBinop()
305 &input_count, &inputs[1])) { in VisitBinop()
308 input_count++; in VisitBinop()
310 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
311 inputs[input_count++] = g.UseOperand(m.right().node(), opcode); in VisitBinop()
316 DCHECK_NE(0u, input_count); in VisitBinop()
318 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop() local
321 selector->EmitWithContinuation(opcode, output_count, outputs, input_count, in VisitBinop()
539 size_t input_count = 0; VisitStore() local
2231 size_t input_count = 0; VisitWord32Compare() local
2295 size_t input_count = 0; VisitWord32Compare() local
2320 size_t input_count = 0; VisitWord32Compare() local
2345 size_t input_count = 0; VisitWord32Compare() local
2387 static constexpr int input_count = arraysize(inputs); VisitStackPointerGreaterThan() local
[all...]
/third_party/node/deps/v8/src/compiler/backend/loong64/
H A Dinstruction-selector-loong64.cc291 size_t input_count = 0; in VisitBinop() local
295 if (TryMatchImmediate(selector, &opcode, m.right().node(), &input_count, in VisitBinop()
298 input_count++; in VisitBinop()
301 &input_count, &inputs[1])) { in VisitBinop()
304 input_count++; in VisitBinop()
306 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
307 inputs[input_count++] = g.UseOperand(m.right().node(), opcode); in VisitBinop()
312 DCHECK_NE(0u, input_count); in VisitBinop()
314 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop() local
317 selector->EmitWithContinuation(opcode, output_count, outputs, input_count, in VisitBinop()
504 size_t input_count = 0; VisitStore() local
2039 size_t input_count = 0; VisitAtomicExchange() local
2064 size_t input_count = 0; VisitAtomicCompareExchange() local
2089 size_t input_count = 0; VisitAtomicBinop() local
2131 static constexpr int input_count = arraysize(inputs); VisitStackPointerGreaterThan() local
[all...]
/third_party/node/deps/v8/src/compiler/backend/riscv64/
H A Dinstruction-selector-riscv64.cc301 size_t input_count = 0; in VisitBinop() local
305 if (TryMatchImmediate(selector, &opcode, m.right().node(), &input_count, in VisitBinop()
308 input_count++; in VisitBinop()
311 &input_count, &inputs[1])) { in VisitBinop()
314 input_count++; in VisitBinop()
316 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
317 inputs[input_count++] = g.UseOperand(m.right().node(), opcode); in VisitBinop()
329 DCHECK_NE(0u, input_count); in VisitBinop()
331 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop() local
334 selector->EmitWithContinuation(opcode, output_count, outputs, input_count, in VisitBinop()
592 size_t input_count = 0; VisitStore() local
2154 size_t input_count = 0; VisitWord32Compare() local
2179 size_t input_count = 0; VisitWord32Compare() local
2204 size_t input_count = 0; VisitWord32Compare() local
2245 static constexpr int input_count = arraysize(inputs); VisitStackPointerGreaterThan() local
[all...]

Completed in 50 milliseconds

1234