a 47 common/gcc-millicode/adddi3.c __adddi3(long long a, long long b)
a 51 common/gcc-millicode/adddi3.c aa.ll = a;
a 44 common/gcc-millicode/anddi3.c __anddi3(long long a, long long b)
a 48 common/gcc-millicode/anddi3.c aa.ll = a;
a 45 common/gcc-millicode/ashldi3.c __ashldi3(long long a, unsigned int shift)
a 50 common/gcc-millicode/ashldi3.c return(a);
a 51 common/gcc-millicode/ashldi3.c aa.ll = a;
a 44 common/gcc-millicode/ashrdi3.c __ashrdi3(long long a, unsigned int shift)
a 49 common/gcc-millicode/ashrdi3.c return(a);
a 50 common/gcc-millicode/ashrdi3.c aa.ll = a;
a 46 common/gcc-millicode/cmpdi2.c __cmpdi2(long long a, long long b)
a 50 common/gcc-millicode/cmpdi2.c aa.ll = a;
a 45 common/gcc-millicode/divdi3.c __divdi3(long long a, long long b)
a 50 common/gcc-millicode/divdi3.c ua = a;
a 53 common/gcc-millicode/divdi3.c if (a < 0)
a 44 common/gcc-millicode/iordi3.c __iordi3(long long a, long long b)
a 48 common/gcc-millicode/iordi3.c aa.ll = a;
a 45 common/gcc-millicode/lshldi3.c __lshldi3(long long a, unsigned int shift)
a 50 common/gcc-millicode/lshldi3.c return(a);
a 51 common/gcc-millicode/lshldi3.c aa.ll = a;
a 44 common/gcc-millicode/lshrdi3.c __lshrdi3(long long a, unsigned int shift)
a 49 common/gcc-millicode/lshrdi3.c return(a);
a 50 common/gcc-millicode/lshrdi3.c aa.ll = a;
a 46 common/gcc-millicode/moddi3.c __moddi3(long long a, long long b)
a 51 common/gcc-millicode/moddi3.c ua = a;
a 54 common/gcc-millicode/moddi3.c if (a < 0)
a 100 common/gcc-millicode/muldi3.c __muldi3(long long a, long long b)
a 115 common/gcc-millicode/muldi3.c if (a >= 0)
a 116 common/gcc-millicode/muldi3.c u.ll = a, negall = 0;
a 118 common/gcc-millicode/muldi3.c u.ll = -a, negall = 1;
a 44 common/gcc-millicode/negdi2.c __negdi2(long long a)
a 48 common/gcc-millicode/negdi2.c aa.ll = a;
a 45 common/gcc-millicode/notdi2.c __one_cmpldi2(long long a)
a 49 common/gcc-millicode/notdi2.c aa.ll = a;
a 48 common/gcc-millicode/qdivrem.c #define COMBINE(a, b) (((unsigned int)(a) << HALF_BITS) | (b))
a 46 common/gcc-millicode/subdi3.c __subdi3(long long a, long long b)
a 50 common/gcc-millicode/subdi3.c aa.ll = a;
a 45 common/gcc-millicode/ucmpdi2.c __ucmpdi2(unsigned long long a, unsigned long long b)
a 49 common/gcc-millicode/ucmpdi2.c aa.ull = a;
a 44 common/gcc-millicode/udivdi3.c __udivdi3(unsigned long long a, unsigned long long b)
a 47 common/gcc-millicode/udivdi3.c return __qdivrem(a, b, NULL);
a 44 common/gcc-millicode/umoddi3.c __umoddi3(unsigned long long a, unsigned long long b)
a 48 common/gcc-millicode/umoddi3.c (void)__qdivrem(a, b, &r);
a 44 common/gcc-millicode/xordi3.c __xordi3(long long a, long long b)
a 48 common/gcc-millicode/xordi3.c aa.ll = a;
a 48 common/libc/string/strcmp.c strcmp(const char *a, const char *b)
a 66 common/libc/string/strcmp.c for (i=0; a[i]!=0 && a[i]==b[i]; i++) {
a 83 common/libc/string/strcmp.c if ((unsigned char)a[i] > (unsigned char)b[i]) {
a 86 common/libc/string/strcmp.c else if (a[i] == b[i]) {
a 90 kern/include/array.h array_num(const struct array *a)
a 92 kern/include/array.h return a->num;
a 96 kern/include/array.h array_get(const struct array *a, unsigned index)
a 98 kern/include/array.h ARRAYASSERT(index < a->num);
a 99 kern/include/array.h return a->v[index];
a 103 kern/include/array.h array_set(const struct array *a, unsigned index, void *val)
a 105 kern/include/array.h ARRAYASSERT(index < a->num);
a 106 kern/include/array.h a->v[index] = val;
a 110 kern/include/array.h array_add(struct array *a, void *val, unsigned *index_ret)
a 115 kern/include/array.h index = a->num;
a 116 kern/include/array.h ret = array_setsize(a, index+1);
a 120 kern/include/array.h a->v[index] = val;
a 172 kern/include/array.h void ARRAY##_destroy(struct ARRAY *a); \
a 173 kern/include/array.h void ARRAY##_init(struct ARRAY *a); \
a 174 kern/include/array.h void ARRAY##_cleanup(struct ARRAY *a); \
a 175 kern/include/array.h unsigned ARRAY##_num(const struct ARRAY *a); \
a 176 kern/include/array.h T *ARRAY##_get(const struct ARRAY *a, unsigned index); \
a 177 kern/include/array.h void ARRAY##_set(struct ARRAY *a, unsigned index, T *val); \
a 178 kern/include/array.h int ARRAY##_setsize(struct ARRAY *a, unsigned num); \
a 179 kern/include/array.h int ARRAY##_add(struct ARRAY *a, T *val, unsigned *index_ret); \
a 180 kern/include/array.h void ARRAY##_remove(struct ARRAY *a, unsigned index)
a 186 kern/include/array.h struct ARRAY *a = kmalloc(sizeof(*a)); \
a 187 kern/include/array.h if (a == NULL) { \
a 190 kern/include/array.h array_init(&a->arr); \
a 191 kern/include/array.h return a; \
a 195 kern/include/array.h ARRAY##_destroy(struct ARRAY *a) \
a 197 kern/include/array.h array_cleanup(&a->arr); \
a 198 kern/include/array.h kfree(a); \
a 202 kern/include/array.h ARRAY##_init(struct ARRAY *a) \
a 204 kern/include/array.h array_init(&a->arr); \
a 208 kern/include/array.h ARRAY##_cleanup(struct ARRAY *a) \
a 210 kern/include/array.h array_cleanup(&a->arr); \
a 214 kern/include/array.h ARRAY##_num(const struct ARRAY *a) \
a 216 kern/include/array.h return array_num(&a->arr); \
a 220 kern/include/array.h ARRAY##_get(const struct ARRAY *a, unsigned index) \
a 222 kern/include/array.h return (T *)array_get(&a->arr, index); \
a 226 kern/include/array.h ARRAY##_set(struct ARRAY *a, unsigned index, T *val) \
a 228 kern/include/array.h array_set(&a->arr, index, (void *)val); \
a 232 kern/include/array.h ARRAY##_setsize(struct ARRAY *a, unsigned num) \
a 234 kern/include/array.h return array_setsize(&a->arr, num); \
a 238 kern/include/array.h ARRAY##_add(struct ARRAY *a, T *val, unsigned *index_ret) \
a 240 kern/include/array.h return array_add(&a->arr, (void *)val, index_ret); \
a 244 kern/include/array.h ARRAY##_remove(struct ARRAY *a, unsigned index) \
a 246 kern/include/array.h return array_remove(&a->arr, index); \
a 49 kern/include/cdefs.h #define __PF(a,b) __attribute__((__format__(__printf__, a, b)))
a 51 kern/include/cdefs.h #define __PF(a,b)
a 54 kern/include/kern/sfs.h #define SFS_ROUNDUP(a,b) ((((a)+(b)-1)/(b))*b)
a 192 kern/include/lib.h #define DIVROUNDUP(a,b) (((a)+(b)-1)/(b))
a 193 kern/include/lib.h #define ROUNDUP(a,b) (DIVROUNDUP(a,b)*b)
a 40 kern/lib/array.c struct array *a;
a 42 kern/lib/array.c a = kmalloc(sizeof(*a));
a 43 kern/lib/array.c if (a != NULL) {
a 44 kern/lib/array.c array_init(a);
a 46 kern/lib/array.c return a;
a 50 kern/lib/array.c array_destroy(struct array *a)
a 52 kern/lib/array.c array_cleanup(a);
a 53 kern/lib/array.c kfree(a);
a 57 kern/lib/array.c array_init(struct array *a)
a 59 kern/lib/array.c a->num = a->max = 0;
a 60 kern/lib/array.c a->v = NULL;
a 64 kern/lib/array.c array_cleanup(struct array *a)
a 71 kern/lib/array.c ARRAYASSERT(a->num == 0);
a 72 kern/lib/array.c kfree(a->v);
a 74 kern/lib/array.c a->v = NULL;
a 79 kern/lib/array.c array_setsize(struct array *a, unsigned num)
a 84 kern/lib/array.c if (num > a->max) {
a 86 kern/lib/array.c newmax = a->max;
a 98 kern/lib/array.c newptr = kmalloc(newmax*sizeof(*a->v));
a 102 kern/lib/array.c memcpy(newptr, a->v, a->num*sizeof(*a->v));
a 103 kern/lib/array.c kfree(a->v);
a 104 kern/lib/array.c a->v = newptr;
a 105 kern/lib/array.c a->max = newmax;
a 107 kern/lib/array.c a->num = num;
a 113 kern/lib/array.c array_remove(struct array *a, unsigned index)
a 117 kern/lib/array.c ARRAYASSERT(a->num <= a->max);
a 118 kern/lib/array.c ARRAYASSERT(index < a->num);
a 120 kern/lib/array.c num_to_move = a->num - (index + 1);
a 121 kern/lib/array.c memmove(a->v + index, a->v + index+1, num_to_move*sizeof(void *));
a 122 kern/lib/array.c a->num--;
a 445 kern/startup/menu.c cmd_opsmenu(int n, char **a)
a 448 kern/startup/menu.c (void)a;
a 482 kern/startup/menu.c cmd_testmenu(int n, char **a)
a 485 kern/startup/menu.c (void)a;
a 513 kern/startup/menu.c cmd_mainmenu(int n, char **a)
a 516 kern/startup/menu.c (void)a;
a 39 kern/test/arraytest.c testa(struct array *a)
a 48 kern/test/arraytest.c n = array_num(a);
a 52 kern/test/arraytest.c r = array_add(a, &testarray[i], NULL);
a 54 kern/test/arraytest.c n = array_num(a);
a 57 kern/test/arraytest.c n = array_num(a);
a 61 kern/test/arraytest.c p = array_get(a, i);
a 64 kern/test/arraytest.c n = array_num(a);
a 69 kern/test/arraytest.c p = array_get(a, i);
a 72 kern/test/arraytest.c n = array_num(a);
a 76 kern/test/arraytest.c array_set(a, i, &testarray[TESTSIZE-i-1]);
a 80 kern/test/arraytest.c p = array_get(a, i);
a 84 kern/test/arraytest.c r = array_setsize(a, TESTSIZE/2);
a 88 kern/test/arraytest.c p = array_get(a, i);
a 92 kern/test/arraytest.c array_remove(a, 1);
a 95 kern/test/arraytest.c p = array_get(a, i);
a 98 kern/test/arraytest.c p = array_get(a, 0);
a 101 kern/test/arraytest.c array_setsize(a, 2);
a 102 kern/test/arraytest.c p = array_get(a, 0);
a 104 kern/test/arraytest.c p = array_get(a, 1);
a 107 kern/test/arraytest.c array_set(a, 1, NULL);
a 108 kern/test/arraytest.c array_setsize(a, 2);
a 109 kern/test/arraytest.c p = array_get(a, 0);
a 111 kern/test/arraytest.c p = array_get(a, 1);
a 114 kern/test/arraytest.c array_setsize(a, TESTSIZE*10);
a 115 kern/test/arraytest.c p = array_get(a, 0);
a 117 kern/test/arraytest.c p = array_get(a, 1);
a 124 kern/test/arraytest.c struct array *a;
a 130 kern/test/arraytest.c a = array_create();
a 131 kern/test/arraytest.c KASSERT(a != NULL);
a 133 kern/test/arraytest.c testa(a);
a 135 kern/test/arraytest.c array_setsize(a, 0);
a 137 kern/test/arraytest.c testa(a);
a 139 kern/test/arraytest.c array_setsize(a, 0);
a 140 kern/test/arraytest.c array_destroy(a);
a 308 kern/vfs/vfslist.c samestring(const char *a, const char *b)
a 310 kern/vfs/vfslist.c if (a==NULL || b==NULL) {
a 313 kern/vfs/vfslist.c return !strcmp(a, b);
a 323 kern/vfs/vfslist.c samestring3(const char *a, const char *b, const char *c, const char *d)
a 325 kern/vfs/vfslist.c return samestring(a,b) || samestring(a,c) || samestring(a,d);
a 40 user/lib/libc/string/memcmp.c const unsigned char *a = av;
a 45 user/lib/libc/string/memcmp.c if (a[i] != b[i]) {
a 46 user/lib/libc/string/memcmp.c return (int)(a[i] - b[i]);
a 868 user/sbin/sfsck/sfsck.c const int *a = (const int *)aa;
a 870 user/sbin/sfsck/sfsck.c const struct sfs_dir *ad = &global_sortdirs[*a];
a 173 user/testbin/crash/crash.c volatile int a;
a 175 user/testbin/crash/crash.c a = x/z;
a 184 user/testbin/crash/crash.c volatile int a;
a 186 user/testbin/crash/crash.c a = x%z;
a 67 user/testbin/dirconc/dirconc.c const char *a, *b, *c;
a 69 user/testbin/dirconc/dirconc.c a = names[random()%NNAMES];
a 71 user/testbin/dirconc/dirconc.c snprintf(buf, len, "%s", a);
a 76 user/testbin/dirconc/dirconc.c snprintf(buf, len, "%s/%s", a, b);
a 80 user/testbin/dirconc/dirconc.c snprintf(buf, len, "%s/%s/%s", a, b, c);
a 596 user/testbin/psort/psort.c binname(int a, int b)
a 599 user/testbin/psort/psort.c snprintf(rv, sizeof(rv), "bin-%d-%d", a, b);
a 605 user/testbin/psort/psort.c mergedname(int a)
a 608 user/testbin/psort/psort.c snprintf(rv, sizeof(rv), "merged-%d", a);
a 904 user/testbin/psort/psort.c validname(int a)
a 907 user/testbin/psort/psort.c snprintf(rv, sizeof(rv), "valid-%d", a);
a 92 user/testbin/rmtest/rmtest.c same(const char *a, const char *b, int len)
a 95 user/testbin/rmtest/rmtest.c if (*a++ != *b++) return 0;
a 68 user/testbin/tictac/tictac.c bool Strcmp(const char *a, const char *b);
a 386 user/testbin/tictac/tictac.c Strcmp(const char *a, const char *b)
a 388 user/testbin/tictac/tictac.c if (a == NULL)
a 393 user/testbin/tictac/tictac.c while (*a && *b)
a 394 user/testbin/tictac/tictac.c if (*a++ != *b++)
a 397 user/testbin/tictac/tictac.c return(*a == *b);
a 6 user/uw-testbin/lib/testutils.h #define TEST_EQUAL(a, b, s) \
a 7 user/uw-testbin/lib/testutils.h test_equal(a, b, s, __FILE__, __FUNCTION__, __LINE__)
a 9 user/uw-testbin/lib/testutils.h #define TEST_EQUAL_ONE_OF(a, b, c, s) \
a 10 user/uw-testbin/lib/testutils.h test_equal_one_of(a, b, c, s, __FILE__, __FUNCTION__, __LINE__)
a 12 user/uw-testbin/lib/testutils.h #define TEST_NOT_EQUAL(a, b, s) \
a 13 user/uw-testbin/lib/testutils.h test_not_equal(a, b, s, __FILE__, __FUNCTION__, __LINE__)
a 15 user/uw-testbin/lib/testutils.h #define TEST_NEGATIVE(a, s) \
a 16 user/uw-testbin/lib/testutils.h test_negative(a, s, __FILE__, __FUNCTION__, __LINE__)
a 18 user/uw-testbin/lib/testutils.h #define TEST_POSITIVE(a, s) \
a 19 user/uw-testbin/lib/testutils.h test_positive(a, s, __FILE__, __FUNCTION__, __LINE__)
a 32 user/uw-testbin/vm-mix2/vm-mix2.c #define MIN(a,b) ((a < b) ? a : b)