Searched refs:b1 (Results 1 - 25 of 78) sorted by relevance

1234

/haiku-fatelf/headers/private/drivers/
H A Dlendian_bitfield.h13 #define LBITFIELD8_2(b1,b2) uint8 b2,b1
14 #define LBITFIELD8_3(b1,b2,b3) uint8 b3,b2,b1
15 #define LBITFIELD8_4(b1,b2,b3,b4) uint8 b4,b3,b2,b1
16 #define LBITFIELD8_5(b1,b2,b3,b4,b5) uint8 b5,b4,b3,b2,b1
17 #define LBITFIELD8_6(b1,b2,b3,b4,b5,b6) uint8 b6,b5,b4,b3,b2,b1
[all...]
/haiku-fatelf/headers/private/graphics/common/
H A Dbendian_bitfield.h8 #define BBITFIELD8_2(b1,b2) uint8 b2,b1
9 #define BBITFIELD8_3(b1,b2,b3) uint8 b3,b2,b1
10 #define BBITFIELD8_4(b1,b2,b3,b4) uint8 b4,b3,b2,b1
11 #define BBITFIELD8_5(b1,b2,b3,b4,b5) uint8 b5,b4,b3,b2,b1
12 #define BBITFIELD8_6(b1,b2,b3,b4,b5,b6) uint8 b6,b5,b4,b3,b2,b1
[all...]
H A Dlendian_bitfield.h8 #define LBITFIELD8_2(b1,b2) uint8 b2,b1
9 #define LBITFIELD8_3(b1,b2,b3) uint8 b3,b2,b1
10 #define LBITFIELD8_4(b1,b2,b3,b4) uint8 b4,b3,b2,b1
11 #define LBITFIELD8_5(b1,b2,b3,b4,b5) uint8 b5,b4,b3,b2,b1
12 #define LBITFIELD8_6(b1,b2,b3,b4,b5,b6) uint8 b6,b5,b4,b3,b2,b1
[all...]
/haiku-fatelf/src/system/libroot/posix/glibc/string/
H A Dswab.c30 const char b0 = from[--n], b1 = from[--n]; local
32 to[n + 1] = b1;
/haiku-fatelf/src/bin/network/tcpdump/libpcap/
H A Dgencode.c458 * Merge the lists in b0 and b1, using the 'sense' field to indicate
462 merge(b0, b1)
463 struct block *b0, *b1;
472 *p = b1;
503 gen_and(b0, b1)
504 struct block *b0, *b1;
506 backpatch(b0, b1->head);
508 b1->sense = !b1->sense;
509 merge(b1, b
1453 struct block *b0, *b1; local
1636 struct block *b0, *b1; local
1915 struct block *b0, *b1, *b2; local
2509 struct block *b0, *b1; local
2552 struct block *b0, *b1; local
2603 register struct block *b0, *b1; local
2637 struct block *b0, *b1; local
2679 register struct block *b0, *b1; local
2713 register struct block *b0, *b1, *b2; local
3009 register struct block *b0, *b1; local
3058 struct block *b0, *b1, *b2, *tmp; local
3133 struct block *b0, *b1; local
3166 struct block *b0, *b1; local
3414 struct block *b0, *b1, *tmp; local
3486 struct block *b1; local
3775 struct block *b0, *b1, *tmp; local
3818 struct block *b0, *b1, *tmp; local
3866 struct block *b0, *b1, *tmp; local
3907 struct block *b0, *b1, *tmp; local
3941 struct block *b1, *b2; local
3968 struct block *b0, *b1, *tmp; local
4011 struct block *b0, *b1, *tmp; local
4044 struct block *b1, *b2; local
4071 struct block *b0, *b1, *tmp; local
4112 struct block *b0, *b1, *tmp; local
4515 struct block *b0, *b1; local
5832 struct block *b0, *b1, *b2; local
5917 register struct block *b0, *b1, *b2; local
6324 register struct block *b0, *b1; local
6358 struct block *b0, *b1; local
6432 struct block *b0,*b1; local
6628 struct block *b0, *b1; local
6810 struct block *b1; local
6852 struct block *b0, *b1; local
[all...]
/haiku-fatelf/src/bin/coreutils/lib/
H A Dmemcmp.c121 op_t b0, b1; local
135 b1 = ((op_t *) srcp2)[0];
148 b1 = ((op_t *) srcp2)[0];
161 if (a1 != b1)
162 return CMP_LT_OR_GT (a1, b1);
166 b1 = ((op_t *) srcp2)[1];
173 if (a1 != b1)
174 return CMP_LT_OR_GT (a1, b1);
178 b1 = ((op_t *) srcp2)[3];
191 if (a1 != b1)
206 op_t b0, b1, b2, b3; local
[all...]
/haiku-fatelf/src/bin/findutils/gnulib/lib/
H A Dmemcmp.c119 op_t b0, b1; local
133 b1 = ((op_t *) srcp2)[0];
146 b1 = ((op_t *) srcp2)[0];
159 if (a1 != b1)
160 return CMP_LT_OR_GT (a1, b1);
164 b1 = ((op_t *) srcp2)[1];
171 if (a1 != b1)
172 return CMP_LT_OR_GT (a1, b1);
176 b1 = ((op_t *) srcp2)[3];
189 if (a1 != b1)
204 op_t b0, b1, b2, b3; local
[all...]
/haiku-fatelf/src/libs/mapm/
H A Dmapm_cpi.c112 M_APM tmp1, tmp2, a0, b0, c0, a1, b1, sum, pow_2; local
121 b1 = M_get_stack_var();
138 m_apm_sqrt(b1, dplaces, tmp1);
160 m_apm_copy(b0, b1);
166 m_apm_add(tmp1, a1, b1);
/haiku-fatelf/src/libs/pdflib/libs/tiff/
H A Dtif_fax3.h375 * Update the value of b1 using the array
379 if (pa != thisrun) while (b1 <= a0 && b1 < lastx) { \
380 b1 += pb[0] + pb[1]; \
394 b1 += *pb++; \
395 RunLength += b1 - a0; \
396 a0 = b1; \
397 b1 += *pb++; \
471 SETVAL(b1 - a0); \
472 b1
[all...]
H A Dtif_predict.c295 int r1, g1, b1; local
302 b1 = cp[5]; cp[5] = b1-b2; b2 = b1;
306 int r1, g1, b1, a1; local
314 b1 = cp[6]; cp[6] = b1-b2; b2 = b1;
/haiku-fatelf/src/libs/tiff/
H A Dtif_fax3.h375 * Update the value of b1 using the array
379 if (pa != thisrun) while (b1 <= a0 && b1 < lastx) { \
380 b1 += pb[0] + pb[1]; \
394 b1 += *pb++; \
395 RunLength += b1 - a0; \
396 a0 = b1; \
397 b1 += *pb++; \
471 SETVALUE(b1 - a0); \
472 b1
[all...]
/haiku-fatelf/headers/os/bluetooth/
H A DbdaddrUtils.h62 int b0, b1, b2, b3, b4, b5; local
66 &b5, &b4, &b3, &b2, &b1, &b0);
69 return ((bdaddr_t) {{b0, b1, b2, b3, b4, b5}});
/haiku-fatelf/src/tests/libs/alm/
H A DTableDemo.cpp34 BButton* b1 = new BButton("A1"); local
35 layout->AddView(b1, r1, c1);
36 b1->SetExplicitAlignment(BAlignment(B_ALIGN_LEFT, B_ALIGN_TOP));
/haiku-fatelf/src/system/libroot/posix/glibc/arch/generic/
H A Dbranred.c58 double r[6],s,t,sum,b,bb,sum1,sum2,b1,bb1,b2,bb2,x1,x2,t1,t2; local
90 b1=b;
126 b=b1+b2;
127 bb = (ABS(b1)>ABS(b2))? (b1-b)+b2 : (b2-b)+b1;
/haiku-fatelf/src/servers/app/drawing/Painter/drawing_modes/
H A DDrawingModeCopySUBPIX.h17 #define BLEND_COPY_SUBPIX(d, r2, g2, b2, a1, a2, a3, r1, g1, b1) \
19 BLEND_FROM_SUBPIX(d, r1, g1, b1, r2, g2, b2, a1, a2, a3); \
H A DDrawingMode.h56 #define BLEND_FROM(d, r1, g1, b1, r2, g2, b2, a) \
58 d[0] = (((((b2) - (b1)) * (a)) + ((b1) << 8)) >> 8); \
64 #define BLEND_FROM_SUBPIX(d, r1, g1, b1, r2, g2, b2, a1, a2, a3) \
66 d[0] = (((((b2) - (b1)) * (a1)) + ((b1) << 8)) >> 8); \
/haiku-fatelf/src/add-ons/kernel/file_systems/reiserfs/
H A Dhashes.cpp36 uint32 b0, b1; \
39 b1 = h1; \
44 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); \
45 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d); \
49 h1 += b1; \
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/reiserfs/
H A Dhashes.cpp36 uint32 b0, b1; \
39 b1 = h1; \
44 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); \
45 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d); \
49 h1 += b1; \
/haiku-fatelf/src/add-ons/kernel/debugger/qrencode/
H A Dqrencode_inner.h46 int b1; member in struct:__anon1468
H A Dqrspec.c239 int b1, b2; local
242 b1 = eccTable[version][level][0];
248 spec[0] = b1;
249 spec[1] = data / b1;
250 spec[2] = ecc / b1;
253 spec[0] = b1;
254 spec[1] = data / (b1 + b2);
255 spec[2] = ecc / (b1 + b2);
/haiku-fatelf/src/add-ons/input_server/methods/canna/lib/
H A Dkigo.c185 int i, b1, b2; local
193 b1 = (((unsigned long)*yyy & 0x7f) >> 4);
195 *gptr++ = b1 + ((b1 > 0x09) ? ('a' - 10) : '0');
237 int i, b1, b2, lnko, cn; local
243 b1 = headkouho / BYTE2; /* JIS��������������������(��������)������������ (����-1) */
249 printf("kigoinfo = bangomax %d, b1 %d, b2 %d\n", kc->nIkouho, b1, b2);
270 b1<BYTE1 && lnko<kc->nIkouho && (headkouho+lnko)<KIGOSU ; b1
[all...]
/haiku-fatelf/src/add-ons/translators/wonderbrush/support/
H A Dlab_convert.cpp193 replace_luminance(uint8& r1, uint8& g1, uint8& b1, uint8 r2, uint8 g2, uint8 b2) argument
196 rgb2lab(r1, g1, b1, CIEL1, CIEa1, CIEb1);
199 lab2rgb(CIEL2, CIEa1, CIEb1, r1, g1, b1);
/haiku-fatelf/src/kits/network/libbind/isc/
H A Dtree.c420 int b1, b2; local
438 b1 = p1->bal;
439 if (b1 >= 0) {
443 if (b1 == 0) {
444 MSG("b1 == 0")
449 MSG("b1 != 0")
480 int b1, b2; local
497 b1 = p1->bal;
498 if (b1 <= 0) {
502 if (b1
[all...]
/haiku-fatelf/src/kits/bluetooth/
H A DDiscoveryListener.cpp87 bdaddr_t b1 = fRemoteDevicesList.ItemAt(index) local
90 if (bdaddrUtils::Compare(inquiryInfo->bdaddr, b1)) {
/haiku-fatelf/src/add-ons/media/plugins/musepack/mpc/
H A Didtag.cpp449 int b1, b2; //, b3, b4;
456 if ( *s != '\0' ) b1 = *s++;
457 else b1 = '\0';
461 if ( ((b1 >= '0' && b1 <= '9') || (b1 >= 'A' && b1 <= 'F')) &&
464 if ( b1 <= '9' ) v1 = b1 - '0';
465 else v1 = b1
[all...]

Completed in 169 milliseconds

1234