HomeSort by relevance Sort by last modified time
    Searched full:shifts (Results 1 - 25 of 202) sorted by null

1 2 3 4 5 6 7 8 9

  /external/icu4c/i18n/
csr2022.cpp 38 int32_t shifts = 0; local
72 shifts += 1;
92 // Include shifts in this computation, so that KR does not get penalized
93 // for having only a single Escape sequence, but many shifts.
94 if (hits+shifts < 5) {
95 quality -= (5-(hits+shifts))*10;
  /dalvik/vm/mterp/x86/
OP_SHL_LONG.S 6 * 6 bits of the shift distance. x86 shifts automatically mask off
OP_SHR_LONG.S 6 * 6 bits of the shift distance. x86 shifts automatically mask off
OP_USHR_LONG.S 6 * 6 bits of the shift distance. x86 shifts automatically mask off
  /external/openssl/crypto/des/
Imakefile 20 PERL= des.pl testdes.pl doIP doPC1 doPC2 PC1 PC2 shifts.pl
  /external/webkit/SunSpider/tests/sunspider-0.9/
bitops-3bit-bits-in-byte.js 13 lir4,0xE994; 9 instructions, no memory access, minimal register dependence, 6 shifts, 2 adds, 1 inline assign
  /external/webkit/SunSpider/tests/sunspider-0.9.1/
bitops-3bit-bits-in-byte.js 13 lir4,0xE994; 9 instructions, no memory access, minimal register dependence, 6 shifts, 2 adds, 1 inline assign
  /external/webkit/WebCore/platform/graphics/wince/
WinceGraphicsExtras.h 28 // is consistent when transformation shifts.
  /external/bison/src/
state.h 49 The two types of actions are shifts/gotos (push the look-ahead token
153 /* Iterate over each transition over a token (shifts). */
163 /* Return the state such SHIFTS contain a shift/goto to it on SYM.
165 struct state *transitions_to (transitions *shifts, symbol_number sym);
state.c 34 | Shifts and Gotos. |
39 | Create a new array of NUM shifts/gotos. |
54 | Return the state such that SHIFTS contain a shift/goto |
59 transitions_to (transitions *shifts, symbol_number sym)
64 assert (j < shifts->num);
65 if (TRANSITION_SYMBOL (shifts, j) == sym)
66 return shifts->states[j];
LR0.c 363 /* Find the itemsets of the states that shifts can reach. */
368 /* Create the shifts structures for the shifts to those states,
  /external/dropbear/libtommath/
bn_mp_montgomery_calc_normalization.c 19 * shifts with subtractions when the result is greater than b.
  /external/apache-http/src/org/apache/commons/codec/binary/
BinaryCodec.java 170 // get length/8 times bytes with 3 bit shifts to the right of the length
197 // get length/8 times bytes with 3 bit shifts to the right of the length
226 // get 8 times the bytes with 3 bit shifts to the left of the length
256 // get 8 times the bytes with 3 bit shifts to the left of the length
  /external/srec/srec/include/
fronttyp.h 45 /* scaling in terms of shifts */
pre_desc.h 154 int imel_shift; /* Imelda scale factor (in shifts) */
157 int inv_shift; /* inverse Imelda scale factor (in shifts) */
  /cts/tools/dasm/src/java_cup/
shift_action.java 5 * The action simply stores the state that it shifts to and responds
18 * @param shft_to the state that this action shifts to.
  /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/
memblock.cpp 164 /// Shifts the data in the linked block from \p start to \p start + \p n.
174 /// Shifts the data in the linked block from \p start + \p n to \p start.
memlink.h 82 /// Shifts the data in the linked block from \p start to \p start + \p n.
92 /// Shifts the data in the linked block from \p start + \p n to \p start.
  /external/opencore/fileformats/mp4/composer/src/
expandablebaseclass.cpp 56 // Setting the limits on the number of shifts and byte renderes needed
  /external/v8/test/cctest/
test-utils.cc 52 // There are also documented right shifts in assembler.cc of
  /external/jpeg/
jfdctfst.c 54 * This compromises accuracy slightly, but it lets us save a few shifts.
59 * Again to save a few shifts, the intermediate results between pass 1 and
  /external/qemu/tcg/
tcg-opc.h 70 /* shifts/rotates */
136 /* shifts/rotates */
  /bionic/libc/arch-arm/bionic/
memcpy.S 336 /* compute shifts needed to align src to dest */
376 /* Use immediate mode for the shifts, because there is an extra cycle
377 * for register shifts, which could account for up to 50% of
  /dalvik/libcore/math/src/main/java/java/math/
BitLevel.java 151 // * Abstractly shifts left an array of integers in little endian (i.e. shift
272 * Shifts right an array of integers. Total shift distance in bits is
  /external/qemu/fpu/
softfloat-macros.h 34 | Shifts `a' right by the number of bits given in `count'. If any nonzero
60 | Shifts `a' right by the number of bits given in `count'. If any nonzero
86 | Shifts the 128-bit value formed by concatenating `a0' and `a1' right by 64
132 | Shifts the 128-bit value formed by concatenating `a0' and `a1' right by the
164 | Shifts the 128-bit value formed by concatenating `a0' and `a1' right by the
207 | Shifts the 192-bit value formed by concatenating `a0', `a1', and `a2' right
277 | Shifts the 128-bit value formed by concatenating `a0' and `a1' left by the
295 | Shifts the 192-bit value formed by concatenating `a0', `a1', and `a2' left

Completed in 165 milliseconds

1 2 3 4 5 6 7 8 9