Home
last modified time | relevance | path

Searched refs:highest (Results 1 – 25 of 129) sorted by relevance

123456

/external/llvm/test/MC/Mips/
Dhigher-highest-addressing.s15 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)
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
DWNafL2RMultiplier.java48 int highest = LongArray.bitLengths[n]; in multiplyPositive()
51 int scale = width - highest; in multiplyPositive()
52 int lowBits = n ^ (1 << (highest - 1)); in multiplyPositive()
/external/llvm/test/CodeGen/SystemZ/
Datomicrmw-and-04.ll83 ; 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.
Datomicrmw-nand-04.ll89 ; 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.
Dinsert-04.ll28 ; Check the highest useful IILL value. (We use OILL rather than IILL
62 ; Check the highest useful IILH value.
95 ; Check the highest useful IIHL value.
128 ; Check the highest useful IIHH value.
Dand-04.ll86 ; 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.
Dasm-02.ll28 ; Check the highest range.
39 ; Check the next highest byte.
Dasm-01.ll28 ; Check the highest range.
39 ; Check the next highest byte.
Dinsert-03.ll28 ; Check the highest useful IILL value. (We use OILL rather than IILL
62 ; Check the highest useful IILH value.
Dand-02.ll50 ; 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.
Dfp-move-05.ll17 ; Check the highest aligned offset that allows LD for both halves.
56 ; Check the highest aligned offset that allows LDY for both halves.
84 ; Check the highest aligned negative offset, which needs a combination of
Dfp-move-08.ll17 ; Check the highest aligned offset that allows STD for both halves.
56 ; Check the highest aligned offset that allows STDY for both halves.
84 ; Check the highest aligned negative offset, which needs a combination of
Dinsert-05.ll49 ; Check the highest useful IILF value (-0x8001).
71 ; Check the highest useful LHI value. (We use OILF for -1 instead, although
154 ; Check the highest useful IIHF value (0xfffffffe).
/external/valgrind/memcheck/tests/
Ddescr_belowsp.stderr.exp18 describing 0x........ byte just above highest guardpage byte
21 describing 0x........ highest guardpage byte
/external/elfutils/src/libdwfl/
Ddwfl_module_getdwarf.c435 GElf_Addr highest; in find_prelink_address_sync() local
448 if (sh_end > highest) in find_prelink_address_sync()
449 highest = sh_end; in find_prelink_address_sync()
453 highest = 0; in find_prelink_address_sync()
464 if (highest > mod->main.vaddr) in find_prelink_address_sync()
466 mod->main.address_sync = highest; in find_prelink_address_sync()
468 highest = 0; in find_prelink_address_sync()
478 if (highest > file->vaddr) in find_prelink_address_sync()
479 file->address_sync = highest; in find_prelink_address_sync()
Dsegment.c156 int highest = -1; in reify_segments() local
221 if (resized && idx - 1 >= highest) in reify_segments()
226 highest = idx - 1; in reify_segments()
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/
Dtoy.ml11 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/
Dtoy.ml13 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
/external/eigen/Eigen/src/Core/
DStableNorm.h27 if(tmp > NumTraits<Scalar>::highest()) in stable_norm_kernel()
29 invScale = NumTraits<Scalar>::highest(); in stable_norm_kernel()
/external/llvm/test/MC/PowerPC/
Dppc64-fixups.s115 # CHECK-BE: lis 3, target@highest # encoding: [0x3c,0x60,A,A]
116 # CHECK-LE: lis 3, target@highest # encoding: [A,A,0x60,0x3c]
117 # CHECK-BE-NEXT: # fixup A - offset: 2, value: target@highest, kind: f…
118 # CHECK-LE-NEXT: # fixup A - offset: 0, value: target@highest, kind: f…
121 lis 3, target@highest
365 # CHECK-BE: addis 3, 2, target@tprel@highest # encoding: [0x3c,0x62,A,A]
366 # CHECK-LE: addis 3, 2, target@tprel@highest # encoding: [A,A,0x62,0x3c]
367 # CHECK-BE-NEXT: # fixup A - offset: 2, value: target@tprel@highest, k…
368 # CHECK-LE-NEXT: # fixup A - offset: 0, value: target@tprel@highest, k…
371 addis 3, 2, target@tprel@highest
[all …]
/external/sepolicy/
Dmls_macros19 # in increasing numeric order with s0 lowest, s(N-1) highest
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
Dtoy.ml18 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
Dtoy.ml18 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
Dtoy.ml18 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
/external/eigen/unsupported/test/
Dmpreal_support.cpp18 std::cerr << "highest = " << NumTraits<mpreal>::highest() << "\n"; in test_mpreal_support()

123456