Lines Matching full:in_lo
206 Register in_lo = locations->InAt(0).AsRegisterPairLow<Register>();
209 __ Mtc1(in_lo, out);
317 Register in_lo = locations->InAt(0).AsRegisterPairLow<Register>();
324 __ Rotr(TMP, in_lo, 16);
330 // in_lo/in_hi. Be very careful not to write to out_lo/out_hi
331 // until we're completely done reading from in_lo/in_hi.
332 // __ Rotr(TMP, in_lo, 16);
333 __ Sll(TMP, in_lo, 16);
334 __ Srl(AT, in_lo, 16);
340 // from in_lo/in_hi so it's okay to
448 Register in_lo = locations->InAt(0).AsRegisterPairLow<Register>();
453 __ ClzR6(TMP, in_lo);
457 __ ClzR2(TMP, in_lo);
495 Register in_lo;
501 in_lo = locations->InAt(0).AsRegisterPairLow<Register>();
503 // If in_lo is zero then count the number of trailing zeroes in in_hi;
504 // otherwise count the number of trailing zeroes in in_lo.
505 // out = in_lo ? in_lo : in_hi;
507 __ Seleqz(out, in_hi, in_lo);
508 __ Selnez(TMP, in_lo, in_lo);
511 __ Movz(out, in_hi, in_lo);
512 __ Movn(out, in_lo, in_lo);
518 // Give in_lo a dummy value to keep the compiler from complaining.
521 in_lo = in;
547 // If in_lo is zero, then we counted the number of trailing zeroes in in_hi so we must add the
548 // number of trailing zeroes in in_lo (32) to get the correct final count
551 __ Seleqz(TMP, TMP, in_lo);
553 __ Movn(TMP, ZERO, in_lo);
635 // for in_lo, and again for in_hi), but saves a few instructions
666 Register in_lo = locations->InAt(0).AsRegisterPairLow<Register>();
673 __ Srl(tmp_lo, in_lo, 1);
679 __ Subu(tmp_lo, in_lo, tmp_lo);
779 Register in_lo = locations->InAt(0).AsRegisterPairLow<Register>();
789 __ Xor(TMP, in_lo, AT);
2329 Register in_lo = locations->InAt(0).AsRegisterPairLow<Register>();
2343 __ ClzR6(TMP, in_lo);
2345 __ ClzR2(TMP, in_lo);
2348 __ And(out_lo, out_lo, in_lo);
2394 Register in_lo = locations->InAt(0).AsRegisterPairLow<Register>();
2399 __ Subu(TMP, ZERO, in_lo);
2400 __ And(out_lo, TMP, in_lo);
