/barrelfish-2018-10-04/lib/compiler-rt/builtins/ |
H A D | int_util.h | 29 #define COMPILE_TIME_ASSERT1(expr, cnt) COMPILE_TIME_ASSERT2(expr, cnt) 30 #define COMPILE_TIME_ASSERT2(expr, cnt) \ 31 typedef char ct_assert_##cnt[(expr) ? 1 : -1] UNUSED
|
/barrelfish-2018-10-04/include/vm/ |
H A D | uma_dbg.c | 67 int cnt; local 75 cnt = size / sizeof(uma_junk); 77 for (p = mem; cnt > 0; cnt--, p++) 100 int cnt; local 108 cnt = size / sizeof(uma_junk); 110 for (p = mem; cnt > 0; cnt--, p++) 144 int cnt; local 154 cnt 175 int cnt; local [all...] |
/barrelfish-2018-10-04/lib/tommath/demo/ |
H A D | timing.c | 86 int n, cnt, ix, old_kara_m, old_kara_s; local 109 for (cnt = 8; cnt <= 128; cnt += 8) { 111 mp_rand(&a, cnt); 112 mp_rand(&b, cnt); 124 fprintf(log, "%d %9llu\n", cnt * DIGIT_BIT, tt); 130 for (cnt = 8; cnt <= 128; cnt [all...] |
H A D | demo.c | 58 int i, n, err, cnt, ix, old_kara_m, old_kara_s; local 212 mp_prime_is_prime(&a, 8, &cnt); 213 if (cnt != MP_YES) { 253 for (cnt = 3; cnt <= 128; ++cnt) { 256 mp_2expt(&a, cnt); 257 mp_sub_d(&a, 2, &a); /* a = 2**cnt - 2 */ 260 printf("\nTesting %4d bits", cnt); 269 mp_rand(&b, (cnt / DIGIT_BI [all...] |
/barrelfish-2018-10-04/lib/libc/stdlib/ |
H A D | getsubopt.c | 50 int cnt; local 91 for (cnt = 0; *tokens; ++tokens, ++cnt) 93 return(cnt);
|
H A D | heapsort.c | 163 size_t cnt, i, j, l; local 185 CREATE(l, nmemb, i, j, t, p, size, cnt, tmp); 193 COPY(k, base + nmemb * size, cnt, size, tmp1, tmp2); 194 COPY(base + nmemb * size, base + size, cnt, size, tmp1, tmp2); 196 SELECT(i, j, nmemb, t, p, size, k, cnt, tmp1, tmp2);
|
/barrelfish-2018-10-04/usr/bench/bomp_progress/ |
H A D | sync.c | 30 uint64_t cnt; member in struct:workcnt 72 workcnt[omp_get_thread_num()].cnt++; 87 printf("%lu ", workcnt[n].cnt); 97 if(exittime[iter].cnt == 0) { 98 exittime[iter].cnt = i + 3; 99 exittime[(iter + ITERATIONS - 2) % ITERATIONS].cnt = 0; 103 if(exittime[iter].cnt != 0 && exittime[iter].cnt == i) {
|
H A D | cpu_bound.c | 22 uint64_t cnt; member in struct:workcnt 53 workcnt[omp_get_thread_num()].cnt++; 63 printf("%lu ", workcnt[n].cnt);
|
/barrelfish-2018-10-04/lib/libc/gen/ |
H A D | getvfsbyname.c | 52 int cnt, i; local 63 cnt = buflen / sizeof(struct xvfsconf); 64 for (i = 0; i < cnt; i++) {
|
H A D | syslog.c | 135 int cnt; local 239 cnt = sizeof(tbuf) - tbuf_cookie.left; 242 if (tbuf[cnt - 1] == '\n') 243 cnt--; 251 v->iov_len = cnt - (stdp - tbuf); 280 if (send(LogFile, tbuf, cnt, 0) < 0) { 288 if (send(LogFile, tbuf, cnt, 0) >= 0) { 306 if (send(LogFile, tbuf, cnt, 0) >= 0) { 329 v->iov_len = cnt - (p - tbuf);
|
H A D | exec.c | 150 size_t cnt, lp, ln; local 216 for (cnt = 0; argv[cnt]; ++cnt) 218 memp = alloca((cnt + 2) * sizeof(char *)); 225 bcopy(argv + 1, memp + 2, cnt * sizeof(char *));
|
/barrelfish-2018-10-04/lib/x86emu/ |
H A D | prim_ops.c | 837 register unsigned int res, cnt, mask, cf; local 855 then shifted up cnt bits, and the high part is or'd 866 if ((cnt = s % 9) != 0) { 869 cf = (d >> (8 - cnt)) & 0x1; 875 res = (d << cnt) & 0xff; 883 mask = (1 << (cnt - 1)) - 1; 884 res |= (d >> (9 - cnt)) & mask; 889 res |= 1 << (cnt - 1); 893 /* OVERFLOW is set *IFF* cnt==1, then it is the 897 CONDITIONAL_SET_FLAG(cnt 910 register unsigned int res, cnt, mask, cf; local 934 register u32 res, cnt, mask, cf; local 958 u32 res, cnt; local 1042 u32 res, cnt; local 1074 u32 res, cnt; local 1107 register unsigned int res, cnt, mask; local 1156 register unsigned int res, cnt, mask; local 1181 register u32 res, cnt, mask; local 1206 register unsigned int res, cnt, mask; local 1252 register unsigned int res, cnt, mask; local 1275 register u32 res, cnt, mask; local 1298 unsigned int cnt, res, cf; local 1342 unsigned int cnt, res, cf; local 1382 unsigned int cnt, res, cf; local 1419 unsigned int cnt, res, cf; local 1456 unsigned int cnt, res, cf; local 1493 unsigned int cnt, res, cf; local 1529 unsigned int cnt, res, cf, mask, sf; local 1569 unsigned int cnt, res, cf, mask, sf; local 1609 u32 cnt, res, cf, mask, sf; local 1649 unsigned int cnt, res, cf; local 1686 unsigned int cnt, res, cf; local 1723 unsigned int cnt, res, cf; local 1760 unsigned int cnt, res, cf; local [all...] |
/barrelfish-2018-10-04/include/bfdmuxtools/ |
H A D | debug.h | 110 #define PDEBUG_RAW(arr,cnt) if ((DEBUG_LEVEL >= 4) && (!__DEBUG__OMIT)) { \ 114 printf("Address: %p, size: %u Bytes\n", arr, (unsigned) (cnt)); \ 116 for(__debug_i = 0; __debug_i < (cnt); __debug_i++) { \ 125 for(__debug_j = 0; __debug_j < (cnt); __debug_j++) { \
|
/barrelfish-2018-10-04/lib/cpuid/ |
H A D | cpuid_internal.h | 93 uint8_t cnt = 8; local 95 while ((cnt > 0) && ((mask & count) != mask)) { 97 cnt--; 99 return (cnt);
|
/barrelfish-2018-10-04/kernel/arch/x86/ |
H A D | timing.c | 133 uint16_t cnt = pit_timer0_read(); 134 if(cnt <= oldcnt) { 135 ticks += oldcnt - cnt; 137 ticks += oldcnt + (0xffff - cnt); 139 oldcnt = cnt; 172 uint16_t cnt = pit_timer0_read_lsb(); local 173 if (cnt <= oldcnt) { 174 ticks += oldcnt - cnt; 176 ticks += oldcnt + 256 - cnt; 178 oldcnt = cnt; 221 uint32_t cnt = apic_timer_get_count(); local [all...] |
/barrelfish-2018-10-04/lib/libc/db/recno/ |
H A D | rec_delete.c | 150 indx_t *ip, cnt, offset; local 179 for (cnt = &h->linp[idx] - (ip = &h->linp[0]); cnt--; ++ip) 182 for (cnt = &h->linp[NEXTINDEX(h)] - ip; --cnt; ++ip)
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/rc4/asm/ |
H A D | rc4-s390x.pl | 26 $cnt="%r1"; 47 srlg $cnt,$len,3 48 ltgr $cnt,$cnt 93 brct $cnt,.Loop8 135 $cnt="%r0"; 151 lhi $cnt,256 158 brct $cnt,.L1stloop 161 lr $cnt,$len 178 brct $cnt, [all...] |
/barrelfish-2018-10-04/lib/bfdmuxtools/ |
H A D | codegen.c | 135 cnt; local 147 cnt = 0; 150 cnt++; 152 cnt--; 154 if (cnt < 0) { 161 if (cnt == 0) { 176 cnt = 0; 179 cnt++; 181 cnt--; 183 if (cnt < [all...] |
/barrelfish-2018-10-04/lib/libc/sys/barrelfish/ |
H A D | posix_syscalls.c | 78 _DEFUN (_write_r, (ptr, fd, buf, cnt), 82 size_t cnt) 87 if ((ret = (_ssize_t)xwrite (fd, buf, cnt)) == -1 && errno != 0) 99 _DEFUN (_read_r, (ptr, fd, buf, cnt), 103 size_t cnt) 109 if ((ret = (_ssize_t)xread (fd, buf, cnt)) == -1 && errno != 0)
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | pretty.build | 36 my $cnt = ($i/$count)*30.0; 39 for (; $x < $cnt; $x++) { print "#"; }
|
H A D | booker.pl | 174 $cnt = @m; 176 for ($i = 2; $i < $cnt; $i++) { 242 $cnt = @m; 244 for ($i = 2; $i < $cnt; $i++) {
|
/barrelfish-2018-10-04/usr/bench/scheduling/ |
H A D | phases_scale.c | 23 uint64_t cnt; member in struct:workcnt 48 workcnt[disp_get_core_id()].cnt++; 117 workcnt[disp_get_core_id()].cnt++; 128 printf("workcnt %d: %lu\n", i, workcnt[i].cnt);
|
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/net/mlx4/ |
H A D | mlx4_en.h | 190 #define INC_PERF_COUNTER(cnt) (++(cnt)) 191 #define ADD_PERF_COUNTER(cnt, add) ((cnt) += (add)) 192 #define AVG_PERF_COUNTER(cnt, sample) \ 193 ((cnt) = ((cnt) * (AVG_SIZE - 1) + (sample) * AVG_FACTOR) / AVG_SIZE) 194 #define GET_PERF_COUNTER(cnt) (cnt) 195 #define GET_AVG_PERF_COUNTER(cnt) ((cn [all...] |
H A D | alloc.c | 107 uint32_t mlx4_bitmap_alloc_range(struct mlx4_bitmap *bitmap, int cnt, int align, argument 111 if (/*likely(*/cnt == 1 && align == 1 && !skip_mask/*)*/) 116 obj = find_aligned_range(bitmap->table, bitmap->last, bitmap->max, cnt, 121 obj = find_aligned_range(bitmap->table, 0, bitmap->max, cnt, align, 126 bitmap_set(bitmap->table, obj, cnt); 128 bitmap->last = (obj + cnt); 137 bitmap->avail -= cnt; 148 void mlx4_bitmap_free_range(struct mlx4_bitmap *bitmap, uint32_t obj, int cnt, argument 158 bitmap_clear(bitmap->table, obj, cnt); 159 bitmap->avail += cnt; [all...] |
/barrelfish-2018-10-04/usr/bench/udp_echo/ |
H A D | udp_openloop.c | 77 /* uint64_t *cnt = (uint64_t *)buf; */ 82 /* if(*cnt != i) { */ 83 /* printf("Packets reordered? %d != %" PRIu64 "\n", i, *cnt); */ 140 uint64_t *cnt = (uint64_t *)buf; local 145 for(*cnt = 0; *cnt < rounds; (*cnt)++) {
|