b 47 common/gcc-millicode/adddi3.c __adddi3(long long a, long long b)
b 52 common/gcc-millicode/adddi3.c bb.ll = b;
b 44 common/gcc-millicode/anddi3.c __anddi3(long long a, long long b)
b 49 common/gcc-millicode/anddi3.c bb.ll = b;
b 46 common/gcc-millicode/cmpdi2.c __cmpdi2(long long a, long long b)
b 51 common/gcc-millicode/cmpdi2.c bb.ll = b;
b 45 common/gcc-millicode/divdi3.c __divdi3(long long a, long long b)
b 51 common/gcc-millicode/divdi3.c ub = b;
b 55 common/gcc-millicode/divdi3.c if (b < 0)
b 44 common/gcc-millicode/iordi3.c __iordi3(long long a, long long b)
b 49 common/gcc-millicode/iordi3.c bb.ll = b;
b 46 common/gcc-millicode/moddi3.c __moddi3(long long a, long long b)
b 52 common/gcc-millicode/moddi3.c ub = b;
b 56 common/gcc-millicode/moddi3.c if (b < 0)
b 100 common/gcc-millicode/muldi3.c __muldi3(long long a, long long b)
b 119 common/gcc-millicode/muldi3.c if (b >= 0)
b 120 common/gcc-millicode/muldi3.c v.ll = b;
b 122 common/gcc-millicode/muldi3.c v.ll = -b, negall ^= 1;
b 48 common/gcc-millicode/qdivrem.c #define COMBINE(a, b) (((unsigned int)(a) << HALF_BITS) | (b))
b 46 common/gcc-millicode/subdi3.c __subdi3(long long a, long long b)
b 51 common/gcc-millicode/subdi3.c bb.ll = b;
b 45 common/gcc-millicode/ucmpdi2.c __ucmpdi2(unsigned long long a, unsigned long long b)
b 50 common/gcc-millicode/ucmpdi2.c bb.ull = b;
b 44 common/gcc-millicode/udivdi3.c __udivdi3(unsigned long long a, unsigned long long b)
b 47 common/gcc-millicode/udivdi3.c return __qdivrem(a, b, NULL);
b 44 common/gcc-millicode/umoddi3.c __umoddi3(unsigned long long a, unsigned long long b)
b 48 common/gcc-millicode/umoddi3.c (void)__qdivrem(a, b, &r);
b 44 common/gcc-millicode/xordi3.c __xordi3(long long a, long long b)
b 49 common/gcc-millicode/xordi3.c bb.ll = b;
b 48 common/libc/string/strcmp.c strcmp(const char *a, const char *b)
b 66 common/libc/string/strcmp.c for (i=0; a[i]!=0 && a[i]==b[i]; i++) {
b 83 common/libc/string/strcmp.c if ((unsigned char)a[i] > (unsigned char)b[i]) {
b 86 common/libc/string/strcmp.c else if (a[i] == b[i]) {
b 49 kern/include/cdefs.h #define __PF(a,b) __attribute__((__format__(__printf__, a, b)))
b 51 kern/include/cdefs.h #define __PF(a,b)
b 54 kern/include/kern/sfs.h #define SFS_ROUNDUP(a,b) ((((a)+(b)-1)/(b))*b)
b 192 kern/include/lib.h #define DIVROUNDUP(a,b) (((a)+(b)-1)/(b))
b 193 kern/include/lib.h #define ROUNDUP(a,b) (DIVROUNDUP(a,b)*b)
b 59 kern/lib/bitmap.c struct bitmap *b;
b 63 kern/lib/bitmap.c b = kmalloc(sizeof(struct bitmap));
b 64 kern/lib/bitmap.c if (b == NULL) {
b 67 kern/lib/bitmap.c b->v = kmalloc(words*sizeof(WORD_TYPE));
b 68 kern/lib/bitmap.c if (b->v == NULL) {
b 69 kern/lib/bitmap.c kfree(b);
b 73 kern/lib/bitmap.c bzero(b->v, words*sizeof(WORD_TYPE));
b 74 kern/lib/bitmap.c b->nbits = nbits;
b 85 kern/lib/bitmap.c b->v[ix] |= ((WORD_TYPE)1 << j);
b 89 kern/lib/bitmap.c return b;
b 93 kern/lib/bitmap.c bitmap_getdata(struct bitmap *b)
b 95 kern/lib/bitmap.c return b->v;
b 99 kern/lib/bitmap.c bitmap_alloc(struct bitmap *b, unsigned *index)
b 102 kern/lib/bitmap.c unsigned maxix = DIVROUNDUP(b->nbits, BITS_PER_WORD);
b 106 kern/lib/bitmap.c if (b->v[ix]!=WORD_ALLBITS) {
b 110 kern/lib/bitmap.c if ((b->v[ix] & mask)==0) {
b 111 kern/lib/bitmap.c b->v[ix] |= mask;
b 113 kern/lib/bitmap.c KASSERT(*index < b->nbits);
b 135 kern/lib/bitmap.c bitmap_mark(struct bitmap *b, unsigned index)
b 140 kern/lib/bitmap.c KASSERT(index < b->nbits);
b 143 kern/lib/bitmap.c KASSERT((b->v[ix] & mask)==0);
b 144 kern/lib/bitmap.c b->v[ix] |= mask;
b 148 kern/lib/bitmap.c bitmap_unmark(struct bitmap *b, unsigned index)
b 153 kern/lib/bitmap.c KASSERT(index < b->nbits);
b 156 kern/lib/bitmap.c KASSERT((b->v[ix] & mask)!=0);
b 157 kern/lib/bitmap.c b->v[ix] &= ~mask;
b 162 kern/lib/bitmap.c bitmap_isset(struct bitmap *b, unsigned index)
b 168 kern/lib/bitmap.c return (b->v[ix] & mask);
b 172 kern/lib/bitmap.c bitmap_destroy(struct bitmap *b)
b 174 kern/lib/bitmap.c kfree(b->v);
b 175 kern/lib/bitmap.c kfree(b);
b 40 kern/test/bitmaptest.c struct bitmap *b;
b 54 kern/test/bitmaptest.c b = bitmap_create(TESTSIZE);
b 55 kern/test/bitmaptest.c KASSERT(b != NULL);
b 58 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i)==0);
b 63 kern/test/bitmaptest.c bitmap_mark(b, i);
b 68 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i));
b 71 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i)==0);
b 77 kern/test/bitmaptest.c bitmap_unmark(b, i);
b 80 kern/test/bitmaptest.c bitmap_mark(b, i);
b 85 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i)==0);
b 88 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i));
b 92 kern/test/bitmaptest.c while (bitmap_alloc(b, &x)==0) {
b 94 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, x));
b 100 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i));
b 308 kern/vfs/vfslist.c samestring(const char *a, const char *b)
b 310 kern/vfs/vfslist.c if (a==NULL || b==NULL) {
b 313 kern/vfs/vfslist.c return !strcmp(a, b);
b 323 kern/vfs/vfslist.c samestring3(const char *a, const char *b, const char *c, const char *d)
b 325 kern/vfs/vfslist.c return samestring(a,b) || samestring(a,c) || samestring(a,d);
b 41 user/lib/libc/string/memcmp.c const unsigned char *b = bv;
b 45 user/lib/libc/string/memcmp.c if (a[i] != b[i]) {
b 46 user/lib/libc/string/memcmp.c return (int)(a[i] - b[i]);
b 869 user/sbin/sfsck/sfsck.c const int *b = (const int *)bb;
b 871 user/sbin/sfsck/sfsck.c const struct sfs_dir *bd = &global_sortdirs[*b];
b 67 user/testbin/dirconc/dirconc.c const char *a, *b, *c;
b 74 user/testbin/dirconc/dirconc.c b = names[random()%NNAMES];
b 76 user/testbin/dirconc/dirconc.c snprintf(buf, len, "%s/%s", a, b);
b 80 user/testbin/dirconc/dirconc.c snprintf(buf, len, "%s/%s/%s", a, b, c);
b 596 user/testbin/psort/psort.c binname(int a, int b)
b 599 user/testbin/psort/psort.c snprintf(rv, sizeof(rv), "bin-%d-%d", a, b);
b 92 user/testbin/rmtest/rmtest.c same(const char *a, const char *b, int len)
b 95 user/testbin/rmtest/rmtest.c if (*a++ != *b++) return 0;
b 68 user/testbin/tictac/tictac.c bool Strcmp(const char *a, const char *b);
b 386 user/testbin/tictac/tictac.c Strcmp(const char *a, const char *b)
b 389 user/testbin/tictac/tictac.c return(b == NULL);
b 390 user/testbin/tictac/tictac.c if (b == NULL)
b 393 user/testbin/tictac/tictac.c while (*a && *b)
b 394 user/testbin/tictac/tictac.c if (*a++ != *b++)
b 397 user/testbin/tictac/tictac.c return(*a == *b);
b 6 user/uw-testbin/lib/testutils.h #define TEST_EQUAL(a, b, s) \
b 7 user/uw-testbin/lib/testutils.h test_equal(a, b, s, __FILE__, __FUNCTION__, __LINE__)
b 9 user/uw-testbin/lib/testutils.h #define TEST_EQUAL_ONE_OF(a, b, c, s) \
b 10 user/uw-testbin/lib/testutils.h test_equal_one_of(a, b, c, s, __FILE__, __FUNCTION__, __LINE__)
b 12 user/uw-testbin/lib/testutils.h #define TEST_NOT_EQUAL(a, b, s) \
b 13 user/uw-testbin/lib/testutils.h test_not_equal(a, b, s, __FILE__, __FUNCTION__, __LINE__)
b 32 user/uw-testbin/vm-mix2/vm-mix2.c #define MIN(a,b) ((a < b) ? a : b)