/external/libppp/src/ |
D | link.c | 97 struct mqueue *queue, *highest; in link_SequenceQueue() local 101 highest = LINK_HIGHQ(l); in link_SequenceQueue() 102 for (queue = l->Queue; queue < highest; queue++) in link_SequenceQueue() 104 m_enqueue(highest, m_dequeue(queue)); in link_SequenceQueue() 110 struct mqueue *queue, *highest; in link_DeleteQueue() local 112 highest = LINK_HIGHQ(l); in link_DeleteQueue() 113 for (queue = l->Queue; queue <= highest; queue++) in link_DeleteQueue() 153 struct mqueue *queue, *highest; in link_PendingLowPriorityData() local 168 highest = LINK_HIGHQ(l); in link_PendingLowPriorityData() 170 for (queue = l->Queue; queue < highest; queue++) { in link_PendingLowPriorityData()
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
D | IntArray.java | 142 int highest = m_ints[last]; in bitLength() local 146 if ((highest & 0xffff0000) != 0) in bitLength() 148 if ((highest & 0xff000000) != 0) in bitLength() 151 highest >>>= 24; in bitLength() 156 highest >>>= 16; in bitLength() 159 else if (highest > 0x000000ff) in bitLength() 162 highest >>>= 8; in bitLength() 165 while (highest != 1) in bitLength() 168 highest >>>= 1; in bitLength()
|
/external/llvm/test/CodeGen/SystemZ/ |
D | atomicrmw-nand-04.ll | 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.
|
D | atomicrmw-and-04.ll | 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.
|
D | insert-04.ll | 28 ; 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.
|
D | and-04.ll | 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.
|
D | asm-02.ll | 28 ; Check the highest range. 39 ; Check the next highest byte.
|
D | asm-01.ll | 28 ; Check the highest range. 39 ; Check the next highest byte.
|
D | insert-03.ll | 28 ; Check the highest useful IILL value. (We use OILL rather than IILL 62 ; Check the highest useful IILH value.
|
D | and-02.ll | 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.
|
D | fp-move-05.ll | 17 ; 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
|
D | fp-move-08.ll | 17 ; 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
|
D | insert-05.ll | 49 ; 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/chromium-trace/trace-viewer/src/ui/ |
D | value_bar.css | 30 .value-bar .highest-value-control { 69 .value-bar[orient='vertical'] .highest-value-control { 106 .value-bar[orient='horizontal'] .highest-value-control {
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
D | ContainerNode.h | 235 Node* highest = node; in highestAncestor() local 237 highest = node; in highestAncestor() 238 return highest; in highestAncestor()
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
D | toy.ml | 11 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
D | toy.ml | 13 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
/external/llvm/test/MC/PowerPC/ |
D | ppc64-fixups.s | 73 # CHECK: lis 3, target@highest # encoding: [0x3c,0x60,A,A] 74 # CHECK-NEXT: # fixup A - offset: 2, value: target@highest, kind: fixu… 76 lis 3, target@highest 230 # CHECK: addis 3, 2, target@tprel@highest # encoding: [0x3c,0x62,A,A] 231 # CHECK-NEXT: # fixup A - offset: 2, value: target@tprel@highest, kind… 233 addis 3, 2, target@tprel@highest 280 # CHECK: addis 3, 2, target@dtprel@highest # encoding: [0x3c,0x62,A,A] 281 # CHECK-NEXT: # fixup A - offset: 2, value: target@dtprel@highest, kin… 283 addis 3, 2, target@dtprel@highest
|
/external/sepolicy/ |
D | mls_macros | 19 # in increasing numeric order with s0 lowest, s(N-1) highest
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
D | toy.ml | 18 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
D | toy.ml | 18 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
D | toy.ml | 18 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
/external/eigen/unsupported/test/ |
D | mpreal_support.cpp | 19 std::cerr << "highest = " << NumTraits<mpreal>::highest() << "\n"; in test_mpreal_support()
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
D | toy.ml | 19 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
/external/chromium_org/sync/protocol/ |
D | favicon_image_specifics.proto | 29 // their scale. If multiple favicons are appropriate, the highest resolution
|