HomeSort by: relevance | last modified time | path
    Searched defs:hi1 (Results 1 - 9 of 9) sorted by relevancy

  /src/external/gpl3/gcc.old/dist/libgcc/config/tilepro/
softmpy.S 32 #define hi1 r3 /* high 32 bits of n1 */ define
62 mulll_uu result1_b, lo0, hi1
66 mulhlsa_uu result1_a, lo0, hi1
82 mulhlsa_uu result1_a, hi1, lo0
  /src/external/gpl3/gdb/dist/gdb/
exec.c 766 ULONGEST lo1, hi1, lo2, hi2;
769 hi1 = memaddr + len;
775 int length = std::min (hi1, hi2) - start;
764 ULONGEST lo1, hi1, lo2, hi2; local
tracepoint.c 3889 ULONGEST lo1, hi1, lo2, hi2; variable
3892 hi1 = memaddr + len;
3898 int length = std::min (hi1, hi2) - start;
ada-lang.c 9093 LONGEST lo1, hi1, lo2, hi2;
9097 if (!get_array_bounds (t1, &lo1, &hi1)
9104 if (lo1 > hi1)
9105 hi1 = lo1 - 1;
9109 return (hi1 - lo1 == hi2 - lo2);
9079 LONGEST lo1, hi1, lo2, hi2; local
  /src/external/gpl3/gdb.old/dist/gdb/
exec.c 753 ULONGEST lo1, hi1, lo2, hi2;
756 hi1 = memaddr + len;
762 int length = std::min (hi1, hi2) - start;
751 ULONGEST lo1, hi1, lo2, hi2; local
tracepoint.c 3885 ULONGEST lo1, hi1, lo2, hi2; variable
3888 hi1 = memaddr + len;
3894 int length = std::min (hi1, hi2) - start;
ada-lang.c 9128 LONGEST lo1, hi1, lo2, hi2;
9132 if (!get_array_bounds (t1, &lo1, &hi1)
9139 if (lo1 > hi1)
9140 hi1 = lo1 - 1;
9144 return (hi1 - lo1 == hi2 - lo2);
9114 LONGEST lo1, hi1, lo2, hi2; local
  /src/external/cddl/osnet/dist/lib/libdtrace/common/
dt_consume.c 191 * (hi1 << 32 + lo1) * (hi2 << 32 + lo2) =
192 * hi1 * hi2 << 64 +
193 * hi1 * lo2 << 32 +
200 uint64_t hi1, hi2, lo1, lo2; local
203 hi1 = factor1 >> 32;
210 product[1] = hi1 * hi2;
212 tmp[0] = hi1 * lo2;
  /src/external/cddl/osnet/dist/uts/common/dtrace/
dtrace.c 1509 * (hi1 << 32 + lo1) * (hi2 << 32 + lo2) =
1510 * hi1 * hi2 << 64 +
1511 * hi1 * lo2 << 32 +
1518 uint64_t hi1, hi2, lo1, lo2; local
1521 hi1 = factor1 >> 32;
1528 product[1] = hi1 * hi2;
1530 tmp[0] = hi1 * lo2;

Completed in 75 milliseconds