Searched refs:shift (Results 1 - 25 of 68) sorted by relevance

123

/barrelfish-master/lib/libc/quad/
H A Dashldi3.c43 * Shift a (signed) quad value left (arithmetic shift left).
44 * This is the same as logical shift left!
47 __ashldi3(a, shift)
49 qshift_t shift;
54 if (shift >= LONG_BITS) {
55 aa.ul[H] = shift >= QUAD_BITS ? 0 :
56 aa.ul[L] << (shift - LONG_BITS);
58 } else if (shift > 0) {
59 aa.ul[H] = (aa.ul[H] << shift) |
60 (aa.ul[L] >> (LONG_BITS - shift));
[all...]
H A Dlshldi3.c43 * Shift an (unsigned) quad value left (logical shift left).
44 * This is the same as arithmetic shift left!
47 __lshldi3(a, shift)
49 qshift_t shift;
54 if (shift >= LONG_BITS) {
55 aa.ul[H] = shift >= QUAD_BITS ? 0 :
56 aa.ul[L] << (shift - LONG_BITS);
58 } else if (shift > 0) {
59 aa.ul[H] = (aa.ul[H] << shift) |
60 (aa.ul[L] >> (LONG_BITS - shift));
[all...]
H A Dlshrdi3.c43 * Shift an (unsigned) quad value right (logical shift right).
46 __lshrdi3(a, shift)
48 qshift_t shift;
53 if (shift >= LONG_BITS) {
54 aa.ul[L] = shift >= QUAD_BITS ? 0 :
55 aa.ul[H] >> (shift - LONG_BITS);
57 } else if (shift > 0) {
58 aa.ul[L] = (aa.ul[L] >> shift) |
59 (aa.ul[H] << (LONG_BITS - shift));
60 aa.ul[H] >>= shift;
[all...]
H A Dashrdi3.c43 * Shift a (signed) quad value right (arithmetic shift right).
46 __ashrdi3(a, shift)
48 qshift_t shift;
53 if (shift >= LONG_BITS) {
57 * Smear bits rightward using the machine's right-shift
60 * LONG_BITS is undefined, so we shift (LONG_BITS-1),
64 aa.ul[L] = shift >= QUAD_BITS ? s :
65 aa.sl[H] >> (shift - LONG_BITS);
67 } else if (shift > 0) {
68 aa.ul[L] = (aa.ul[L] >> shift) |
[all...]
/barrelfish-master/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/
H A DDPair.java55 * utility to shift left and right value together
56 * @param shift
58 protected void shift(double shift) { argument
59 x += shift;
60 y += shift;
H A DExtent.java96 added.shift(move);
101 * shift an extent to the right by move units
105 private void shift(double move) { method in class:Extent
108 li.next().shift(move);
/barrelfish-master/lib/compiler-rt/builtins/arm/
H A Dclzsi2.S39 #define BLOCK(shift) \
40 lsrs r2, r0, shift; \
42 addeq r1, shift \
H A Dclzdi2.S59 #define BLOCK(shift) \
60 lsrs r2, r0, shift; \
62 addeq r1, shift \
H A Dudivsi3.S69 // The code before JMP computes the correct shift I, so that
75 // block(shift) implements the test-and-update-quotient core.
76 // It assumes (r0 << shift) can be computed without overflow and
77 // that (r0 << shift) < 2 * r1. The quotient is stored in r3.
198 #define block(shift) \
199 lsls r2, r1, IMM shift; \
201 blo LOCAL_LABEL(block_skip_##shift); \
203 LOCAL_LABEL(block_skip_##shift) :; \
213 #define block(shift) \
214 cmp r0, r1, lsl IMM shift; \
[all...]
/barrelfish-master/lib/libc/stdlib/
H A Da64l.c27 long shift; local
31 shift = 0;
42 value |= digit << shift;
43 shift += 6;
/barrelfish-master/lib/compiler-rt/builtins/
H A Dfloatunsisf.c32 // Shift a into the significand field, rounding if it is a right-shift
34 const int shift = significandBits - exponent; local
35 result = (rep_t)a << shift ^ implicitBit;
37 const int shift = exponent - significandBits; local
38 result = (rep_t)a >> shift ^ implicitBit;
39 rep_t round = (rep_t)a << (typeWidth - shift);
H A Dfloatsisf.c39 // Shift a into the significand field, rounding if it is a right-shift
41 const int shift = significandBits - exponent; local
42 result = (rep_t)a << shift ^ implicitBit;
44 const int shift = exponent - significandBits; local
45 result = (rep_t)a >> shift ^ implicitBit;
46 rep_t round = (rep_t)a << (typeWidth - shift);
H A Dfloatunsitf.c32 const int shift = significandBits - exponent; local
33 result = (rep_t)a << shift ^ implicitBit;
H A Dfloatunditf.c32 const int shift = significandBits - exponent; local
33 result = (rep_t)a << shift ^ implicitBit;
H A Dfloatunsidf.c33 const int shift = significandBits - exponent; local
34 result = (rep_t)a << shift ^ implicitBit;
H A Dfloatditf.c39 // Shift a into the significand field, rounding if it is a right-shift
40 const int shift = significandBits - exponent; local
41 result = (rep_t)aAbs << shift ^ implicitBit;
H A Dfloatsidf.c42 const int shift = significandBits - exponent; local
43 result = (rep_t)(unsigned int)a << shift ^ implicitBit;
H A Dfloatsitf.c40 const int shift = significandBits - exponent; local
41 result = (rep_t)aAbs << shift ^ implicitBit;
H A Dfp_fixint_impl.inc34 // If 0 <= exponent < significandBits, right shift to get the result.
35 // Otherwise, shift left.
H A Dfp_fixuint_impl.inc32 // If 0 <= exponent < significandBits, right shift to get the result.
33 // Otherwise, shift left.
/barrelfish-master/lib/msun/src/
H A Ds_rintl.c43 shift[2] = { variable
79 x += shift[sign];
80 x -= shift[sign];
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/core/
H A Dpacker.c74 int shift; local
79 shift = 32 - desc[i].offset_bits - desc[i].size_bits;
82 desc[i].struct_size_bytes, structure) << shift;
86 mask = cpu_to_be32(((1ull << desc[i].size_bits) - 1) << shift);
90 int shift; local
95 shift = 64 - desc[i].offset_bits - desc[i].size_bits;
98 desc[i].struct_size_bytes, structure) << shift;
102 mask = cpu_to_be64((~0ull >> (64 - desc[i].size_bits)) << shift);
162 int shift; local
167 shift
174 int shift; local
[all...]
/barrelfish-master/lib/tommath/
H A Dbn_mp_div_2d.c18 /* shift right by a certain bit count (store quotient in c, optional remainder in d) */
26 /* if the shift count is <= 0 then we do no work */
53 /* shift by as many digits in the bit count */
58 /* shift any bit count < DIGIT_BIT */
61 register mp_digit *tmpc, mask, shift; local
66 /* shift for lsb */
67 shift = DIGIT_BIT - D;
78 /* shift the current word and mix in the carry bits from the previous word */
79 *tmpc = (*tmpc >> D) | (r << shift);
H A Dbn_mp_mul_2d.c18 /* shift left by a certain bit count */
37 /* shift by as many digits in the bit count */
44 /* shift any bit count < DIGIT_BIT */
47 register mp_digit *tmpc, shift, mask, r, rr; local
53 /* shift for msbs */
54 shift = DIGIT_BIT - d;
63 rr = (*tmpc >> shift) & mask;
65 /* shift the current word and OR in the carry */
/barrelfish-master/usr/gups/
H A Dcommon.c140 size_t shift = 0; local
144 shift = 30;
149 shift = 20;
154 shift = 10;
162 return (bytes << shift);

Completed in 226 milliseconds

123