Lines Matching refs:input_count
235 size_t input_count = 0; in VisitBinop() local
240 &input_count, &inputs[1])) { in VisitBinop()
242 input_count++; in VisitBinop()
244 m.left().node(), &input_count, in VisitBinop()
248 input_count++; in VisitBinop()
251 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
252 inputs[input_count++] = g.UseRegister(m.right().node()); in VisitBinop()
256 inputs[input_count++] = g.Label(cont->true_block()); in VisitBinop()
257 inputs[input_count++] = g.Label(cont->false_block()); in VisitBinop()
265 DCHECK_NE(0, input_count); in VisitBinop()
267 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop()
272 outputs, input_count, inputs); in VisitBinop()
479 size_t input_count = 2; in VisitShift() local
486 inputs[input_count++] = g.Label(cont->true_block()); in VisitShift()
487 inputs[input_count++] = g.Label(cont->false_block()); in VisitShift()
495 DCHECK_NE(0, input_count); in VisitShift()
497 DCHECK_GE(arraysize(inputs), input_count); in VisitShift()
502 outputs, input_count, inputs); in VisitShift()
852 size_t input_count = 0; in VisitWordCompare() local
857 &input_count, &inputs[1])) { in VisitWordCompare()
859 input_count++; in VisitWordCompare()
861 &input_count, &inputs[1])) { in VisitWordCompare()
864 input_count++; in VisitWordCompare()
867 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitWordCompare()
868 inputs[input_count++] = g.UseRegister(m.right().node()); in VisitWordCompare()
872 inputs[input_count++] = g.Label(cont->true_block()); in VisitWordCompare()
873 inputs[input_count++] = g.Label(cont->false_block()); in VisitWordCompare()
879 DCHECK_NE(0, input_count); in VisitWordCompare()
880 DCHECK_GE(arraysize(inputs), input_count); in VisitWordCompare()
884 outputs, input_count, inputs); in VisitWordCompare()