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

1234567

/haiku-fatelf/src/add-ons/accelerants/ati/
H A Dmach64_util.cpp43 Mach64_Divide(int numerator, int denominator, int shift, const int roundingKind) argument
48 // numerator shift
60 shift++;
63 while ((shift > 0) && !(denominator & 3)) {
65 shift--;
70 while (shift < 0) {
76 shift++;
86 return ((numerator / denominator) << shift) +
87 ((((numerator % denominator) << shift) + rounding) / denominator);
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dbitmap.h77 * @shift: bits to roll
79 static __inline__ u32 ntfs_rol32(u32 word, unsigned int shift) argument
81 return (word << shift) | (word >> (32 - shift));
88 * @shift: bits to roll
90 static __inline__ u32 ntfs_ror32(u32 word, unsigned int shift) argument
92 return (word >> shift) | (word << (32 - shift));
/haiku-fatelf/src/system/boot/platform/raspberrypi_arm/
H A Dgpio.cpp14 // Define the shift up for the 3 bits per pin in each GPFSEL port
82 int shift = kGPIOToShift[pin]; local
87 *gpio = (*gpio & ~(7 << shift));
89 *gpio = (*gpio & ~(7 << shift)) | (1 << shift);
91 *gpio = (*gpio & ~(7 << shift)) | (mode << shift);
/haiku-fatelf/headers/private/graphics/radeon/
H A Dutils.h30 static inline int ceilShiftDiv( int num, int shift )
32 return (num + (1 << shift) - 1) >> shift;
/haiku-fatelf/src/libs/ncurses/ncurses/tty/
H A Dhardscroll.c184 int start, end, shift; local
215 shift = OLDNUM(i) - i; /* shift > 0 */
220 == shift)
222 end = i - 1 + shift;
224 TR(TRACE_UPDATE | TRACE_MOVE, ("scroll [%d, %d] by %d", start, end, shift));
226 if (_nc_scrolln(shift, start, end, screen_lines - 1) == ERR) {
240 shift = OLDNUM(i) - i; /* shift < 0 */
244 while (i >= 0 && OLDNUM(i) != _NEWINDEX && OLDNUM(i) - i == shift)
[all...]
H A Dhashmap.c186 int start, end, shift; local
204 shift = OLDNUM(i) - i;
209 == shift)
223 if (shift < 0)
224 back_limit = back_ref_limit + (-shift);
226 if (newhash[i] == oldhash[i + shift]
227 || cost_effective(i + shift, i, shift < 0)) {
228 OLDNUM(i) = i + shift;
231 i, i + shift));
272 int start, shift, size; local
[all...]
/haiku-fatelf/src/bin/gdb/opcodes/
H A Dcgen-ibld.in88 int shift;
95 shift = (start + 1) - length;
97 shift = (word_length - (start + length));
98 x = (x & ~(mask << shift)) | ((value & mask) << shift);
208 int shift;
211 shift = (word_offset + start + 1) - length;
213 shift = total_length - (word_offset + start + length);
214 *buffer = (*buffer & ~(mask << shift)) | ((value & mask) << shift);
[all...]
H A Dip2k-ibld.c88 int shift;
95 shift = (start + 1) - length;
97 shift = (word_length - (start + length));
98 x = (x & ~(mask << shift)) | ((value & mask) << shift);
208 int shift;
211 shift = (word_offset + start + 1) - length;
213 shift = total_length - (word_offset + start + length);
214 *buffer = (*buffer & ~(mask << shift)) | ((value & mask) << shift);
87 int shift; local
207 int shift; local
304 int shift = insn_length - length; local
376 int shift; local
[all...]
/haiku-fatelf/src/apps/debugger/dwarf/
H A DDataReader.h128 int shift = 0; local
131 result |= uint64(byte & 0x7f) << shift;
134 shift += 7;
143 int shift = 0; local
146 result |= uint64(byte & 0x7f) << shift;
147 shift += 7;
151 if ((byte & 0x40) != 0 && shift < 64)
152 result |= -((uint64)1 << shift);
/haiku-fatelf/src/libs/print/libgutenprint/src/main/
H A Dbit-ops.c524 shift, local
532 for (shift = 0, temp0 = 0, temp1 = 0, temp2 = 0, temp3 = 0;
537 * Note - we can't use (tempin & N) >> (shift - M) since negative
544 temp0 |= (tempin & 192) >> shift;
546 temp1 |= ((tempin & 48) << 2) >> shift;
548 temp2 |= ((tempin & 12) << 4) >> shift;
550 temp3 |= ((tempin & 3) << 6) >> shift;
552 if (shift < 6)
553 shift += 2;
556 shift
657 shift, local
814 unsigned char tempin, shift; local
[all...]
/haiku-fatelf/src/add-ons/kernel/drivers/input/usb_hid/
H A DHIDReportItem.cpp60 // that we can always just byte-align, copy four bytes and then shift and
133 int8 shift;
136 shift = scaleToBits - fBitCount;
137 if (shift > 0) {
138 result |= source << shift;
139 scaleToBits = shift;
141 result |= source >> -shift;
143 } while (shift > 0);
/haiku-fatelf/src/add-ons/media/plugins/ffmpeg/
H A Dgen_lookup.cpp14 int shift = 15; variable
102 int Rmax = (Ymax + Cr_Rmax) >> shift;
103 int Rmin = (Ymin + Cr_Rmin) >> shift;
104 int Gmax = (Ymax + Cr_Gmax + Cb_Gmax) >> shift;
105 int Gmin = (Ymin + Cr_Gmin + Cb_Gmin) >> shift;
106 int Bmax = (Ymax + Cb_Bmax) >> shift;
107 int Bmin = (Ymin + Cb_Bmin) >> shift;
/haiku-fatelf/src/add-ons/translators/exr/openexr/ilmimf/
H A DImfB44Compressor.cpp52 // - a 6-bit shift value
56 // shifting the differences according to the stored shift value.
92 // t[0], followed by an "impossible" 6-bit shift value and
150 shiftAndRound (int x, int shift) argument
155 // y = x * pow (2, -shift),
164 int a = (1 << shift) - 1;
165 shift += 1;
166 int b = (x >> shift) & 1;
167 return (x + a + b) >> shift;
247 // Find a shift valu
253 int shift = -1; local
379 unsigned short shift = (b[ 2] >> 2); local
[all...]
/haiku-fatelf/src/libs/print/libgutenprint/test/
H A Dtestdither.c719 shift; local
745 for (count = IMAGE_WIDTH, byte = *kbuf++, shift = 6; count > 0; count --)
747 putc(255 - 255 * ((byte >> shift) & 3) / 3, fp);
749 if (shift > 0)
750 shift -= 2;
754 shift = 6;
774 shift; local
836 ybyte = *ybuf++, kbyte = *kbuf++, shift = 6;
840 k = 255 * ((kbyte >> shift) & 3) / 3;
841 r = 255 - 255 * ((cbyte >> shift)
892 shift; local
[all...]
/haiku-fatelf/src/bin/coreutils/lib/
H A Dstr-two-way.h52 needles, we also use a bad character shift table similar to the
60 /* Point at which computing a bad-byte shift table is likely to be
268 required, and any mismatch results in a maximal shift. */
340 size_t shift; local
345 shift to the next possible match location. */
346 shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])];
347 if (0 < shift)
349 if (memory && shift < period)
354 shift = needle_len - period;
357 j += shift;
391 size_t shift; local
[all...]
/haiku-fatelf/src/bin/network/wget/lib/
H A Dstr-two-way.h49 needles, we also use a bad character shift table similar to the
57 /* Point at which computing a bad-byte shift table is likely to be
265 required, and any mismatch results in a maximal shift. */
337 size_t shift; local
342 shift to the next possible match location. */
343 shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])];
344 if (0 < shift)
346 if (memory && shift < period)
351 shift = needle_len - period;
354 j += shift;
388 size_t shift; local
[all...]
/haiku-fatelf/src/add-ons/translators/webp/libwebp/dec/
H A Dbits.h63 const int shift = kVP8Log2Range[br->range_]; local
65 br->value_ <<= shift;
66 br->left_ += shift;
/haiku-fatelf/src/bin/
H A Dlistres.cpp59 int32 missed = 0, shift = 24; local
61 for (int32 i = 0; i < 4; i++, shift -= 8) {
62 value[i] = uint8(type >> shift);
/haiku-fatelf/src/bin/gdb/include/opcode/
H A Dmn10200.h66 int shift;
65 int shift; member in struct:mn10200_operand
H A Ds390.h93 int shift; member in struct:s390_operand
H A Dv850.h82 int shift;
88 i |= (op & ((1 << o->bits) - 1)) << o->shift;
107 op = o->bits == -1 ? ((i) & o->shift) : ((i) >> o->shift) & ((1 << o->bits) - 1);
81 int shift; member in struct:v850_operand
/haiku-fatelf/src/libs/pdflib/libs/png/
H A Dpngrtran.c1316 &(png_ptr->shift));
1417 png_uint_32 shift = 7 - (int)((row_width + 7) & 0x07); local
1420 *dp = (png_byte)((*sp >> shift) & 0x01);
1421 if (shift == 7)
1423 shift = 0;
1427 shift++;
1438 png_uint_32 shift = (int)((3 - ((row_width + 3) & 0x03)) << 1); local
1441 *dp = (png_byte)((*sp >> shift) & 0x03);
1442 if (shift == 6)
1444 shift
1458 png_uint_32 shift = (int)((1 - ((row_width + 1) & 0x01)) << 2); local
1498 int shift[4]; local
1555 *bp >>= shift[0]; local
1568 *bp++ >>= shift[i%channels]; local
1581 value >>= shift[i%channels]; local
2602 int shift; local
3464 int shift, value; local
3607 int shift, value; local
3966 int i, j, shift, num; local
[all...]
/haiku-fatelf/src/libs/x86emu/
H A Dops2.c491 u8 shift; local
506 shift = fetch_byte_imm();
507 DECODE_PRINTF2("%d\n", shift);
510 destval = shld_long(destval, *shiftreg, shift);
521 shift = fetch_byte_imm();
522 DECODE_PRINTF2("%d\n", shift);
525 destval = shld_word(destval, *shiftreg, shift);
538 shift = fetch_byte_imm();
539 DECODE_PRINTF2("%d\n", shift);
542 destval = shld_long(destval, *shiftreg, shift);
932 u8 shift; local
1889 u8 shift; local
1915 u8 shift; local
1943 u8 shift; local
1969 u8 shift; local
1997 u8 shift; local
2023 u8 shift; local
2052 u8 shift; local
2078 u8 shift; local
[all...]
/haiku-fatelf/src/libs/ncurses/test/
H A Dview.c70 static int shift = 0; variable
260 /* convert tabs so that shift will work properly */
381 shift += n;
386 shift -= n;
387 if (shift < 0) {
388 shift = 0;
486 sprintf(temp, "%s (%3dx%3d) col %d ", tag, LINES, COLS, shift);
510 if (len > shift) {
512 add_wchstr(s + shift);
514 addchstr(s + shift);
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/
H A DHTree.cpp255 uint32 shift = shifts[i % 4]; local
256 a = (a << shift) | (a >> (32 - shift));
269 uint32 shift = shifts[i / 2]; local
270 a = (a << shift) | (a >> (32 - shift));
283 uint32 shift = shifts[i * 2 % 4]; local
284 a = (a << shift) | (a >> (32 - shift));
289 shift
[all...]

Completed in 468 milliseconds

1234567