Searched refs:highest (Results 1 – 25 of 220) sorted by relevance
123456789
15 lui $5, %highest(func)25 # Test the calculation of %higher and %highest:27 # ((x + 0x800080008000) >> 48) & 0xffff (highest).36 lui $6, %highest($L2-$L1+0x300047FFF7FF7)44 lui $7, %highest($L2-$L1+0x300047FFF7FF8)50 # Check the case where both %higher and %highest are modified by adding +1.51 lui $8, %highest(0x37FFF7FFF8000)
21 ; Test a byte-granularity replicate with the highest useful value.45 ; Test a halfword-granularity replicate with the highest useful value.61 ; Test a word-granularity replicate with the highest in-range value.69 ; Test a word-granularity replicate with the next highest value.95 ; Test a word-granularity replicate with the highest useful negative value.112 ; Test a doubleword-granularity replicate with the highest in-range value.120 ; Test a doubleword-granularity replicate with the next highest value.146 ; Test a doubleword-granularity replicate with the highest useful negative
23 ; Test a byte-granularity replicate with the highest useful value.50 ; Test a halfword-granularity replicate with the highest useful value.68 ; Test a word-granularity replicate with the highest in-range value.77 ; Test a word-granularity replicate with the next highest value.106 ; Test a word-granularity replicate with the highest useful negative value.125 ; Test a doubleword-granularity replicate with the highest in-range value.134 ; Test a doubleword-granularity replicate with the next highest value.163 ; Test a doubleword-granularity replicate with the highest useful negative
27 ; Test a byte-granularity replicate with the highest useful value.60 ; Test a halfword-granularity replicate with the highest useful value.82 ; Test a word-granularity replicate with the highest in-range value.93 ; Test a word-granularity replicate with the next highest value.128 ; Test a word-granularity replicate with the highest useful negative value.151 ; Test a doubleword-granularity replicate with the highest in-range value.162 ; Test a doubleword-granularity replicate with the next highest value.197 ; Test a doubleword-granularity replicate with the highest useful negative
83 ; Check the highest NILL value outside the range of RISBG.101 ; Check the highest useful NILF value.110 ; Check the highest NILH value outside the range of RISBG.137 ; Check the highest NIHL value outside the range of RISBG.155 ; Check the highest NIHH value outside the range of RISBG.164 ; Check the highest useful NIHF value.
89 ; Check the highest NILL value outside the range of RISBG.107 ; Check the highest useful NILF value.116 ; Check the highest NILH value outside the range of RISBG.143 ; Check the highest NIHL value outside the range of RISBG.161 ; Check the highest NIHH value outside the range of RISBG.170 ; Check the highest useful NIHF value.
28 ; Check the highest useful IILL value. (We use OILL rather than IILL62 ; Check the highest useful IILH value.95 ; Check the highest useful IIHL value.128 ; Check the highest useful IIHH value.
86 ; Check the highest NIHH value outside the RISBG range (0xfffaffff_ffffffff).95 ; Check the highest useful NIHF value (0xfffefffe_ffffffff).113 ; Check the highest NIHL value outside the RISBG range (0xfffffffa_ffffffff).149 ; Check the highest NILH value outside the RISBG range (0xffffffff_fffaffff).176 ; Check the highest NILL value outside the RISBG range.
30 ; Test a v16i8 shift by the highest useful constant.65 ; Test a v8i16 shift by the highest useful constant.96 ; Test a v4i32 shift by the highest useful constant.127 ; Test a v2i64 shift by the highest useful constant.
29 ; Check the highest range.40 ; Check the next highest byte.
18 ; Test a v16i8 shift with the highest shift amount.94 ; Test a v8i16 shift with the highest useful shift amount.115 ; Test a v4i32 shift with the highest useful shift amount.135 ; Test a v4f32 shift with the highest useful shift amount.
28 ; Check the highest range.39 ; Check the next highest byte.
28 ; Check the highest useful IILL value. (We use OILL rather than IILL62 ; Check the highest useful IILH value.
50 ; Check the highest 16-bit constant that must be handled by NILF.68 ; Check the next highest value, which can use NILF.131 ; Check the highest useful NILF value.140 ; Check the next value up, which is the highest useful NILH value.
106 highest = 0109 if address_count[addr] > highest:110 highest = address_count[addr]115 if highest > (unique / 10):
48 int highest = LongArray.bitLengths[n]; in multiplyPositive()51 int scale = width - highest; in multiplyPositive()52 int lowBits = n ^ (1 << (highest - 1)); in multiplyPositive()
80 int highest = -1; in run_test() local102 assert(jobs[max_thread_idx].offsets[next[max_thread_idx]] > highest); in run_test()104 highest = jobs[max_thread_idx].offsets[next[max_thread_idx]]; in run_test()
79 int highest = -1; in validate_monotonic() local101 assert(blocks[max_thread_idx][next[max_thread_idx]] > highest); in validate_monotonic()103 highest = blocks[max_thread_idx][next[max_thread_idx]]; in validate_monotonic()
18 describing 0x........ byte just above highest guardpage byte21 describing 0x........ highest guardpage byte
26 if(tmp > NumTraits<Scalar>::highest()) in stable_norm_kernel()28 invScale = NumTraits<Scalar>::highest(); in stable_norm_kernel()31 else if(maxCoeff>NumTraits<Scalar>::highest()) // we got a INF in stable_norm_kernel()