/barrelfish-2018-10-04/lib/compiler-rt/builtins/ |
H A D | negvdi2.c | 24 const di_int MIN = (di_int)1 << ((int)(sizeof(di_int) * CHAR_BIT)-1); local 25 if (a == MIN)
|
H A D | negvsi2.c | 24 const si_int MIN = (si_int)1 << ((int)(sizeof(si_int) * CHAR_BIT)-1); local 25 if (a == MIN)
|
H A D | negvti2.c | 26 const ti_int MIN = (ti_int)1 << ((int)(sizeof(ti_int) * CHAR_BIT)-1); local 27 if (a == MIN)
|
H A D | mulodi4.c | 25 const di_int MIN = (di_int)1 << (N-1); local 26 const di_int MAX = ~MIN; 29 if (a == MIN) 35 if (b == MIN) 54 if (abs_a > MIN / -abs_b)
|
H A D | mulosi4.c | 25 const si_int MIN = (si_int)1 << (N-1); local 26 const si_int MAX = ~MIN; 29 if (a == MIN) 35 if (b == MIN) 54 if (abs_a > MIN / -abs_b)
|
H A D | muloti4.c | 27 const ti_int MIN = (ti_int)1 << (N-1); local 28 const ti_int MAX = ~MIN; 31 if (a == MIN) 37 if (b == MIN) 56 if (abs_a > MIN / -abs_b)
|
H A D | mulvdi3.c | 25 const di_int MIN = (di_int)1 << (N-1); local 26 const di_int MAX = ~MIN; 27 if (a == MIN) 33 if (b == MIN) 52 if (abs_a > MIN / -abs_b)
|
H A D | mulvsi3.c | 25 const si_int MIN = (si_int)1 << (N-1); local 26 const si_int MAX = ~MIN; 27 if (a == MIN) 33 if (b == MIN) 52 if (abs_a > MIN / -abs_b)
|
H A D | mulvti3.c | 27 const ti_int MIN = (ti_int)1 << (N-1); local 28 const ti_int MAX = ~MIN; 29 if (a == MIN) 35 if (b == MIN) 54 if (abs_a > MIN / -abs_b)
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn_mp_mul.c | 26 if (MIN (a->used, b->used) >= TOOM_MUL_CUTOFF) { 32 if (MIN (a->used, b->used) >= KARATSUBA_MUL_CUTOFF) { 47 MIN(a->used, b->used) <=
|
H A D | bn_mp_get_int.c | 29 i = MIN(a->used,(int)((sizeof(unsigned long)*CHAR_BIT+DIGIT_BIT-1)/DIGIT_BIT))-1;
|
H A D | bn_fast_s_mp_mul_digs.c | 48 pa = MIN(digs, a->used + b->used); 58 ty = MIN(b->used-1, ix); 68 iy = MIN(a->used-tx, ty+1);
|
H A D | bn_fast_s_mp_sqr.c | 53 ty = MIN(a->used-1, ix); 63 iy = MIN(a->used-tx, ty+1); 69 iy = MIN(iy, (ty-tx+1)>>1);
|
H A D | bn_fast_s_mp_mul_high_digs.c | 49 ty = MIN(b->used-1, ix); 59 iy = MIN(a->used-tx, ty+1);
|
H A D | bn_s_mp_mul_digs.c | 32 MIN (a->used, b->used) < 49 pb = MIN (b->used, digs - ix);
|
H A D | bn_s_mp_mul_high_digs.c | 33 && MIN (a->used, b->used) < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
|
/barrelfish-2018-10-04/kernel/ |
H A D | timer.c | 28 #define MIN(x,y) ((x<y) ? (x) : (y)) macro 32 systime_t timer = MIN(next_sched_timer, next_wakeup_timer);
|
/barrelfish-2018-10-04/usr/mem_serv_dist/ |
H A D | mem_serv.h | 18 #ifndef MIN 19 #define MIN(a,b) ((a)<=(b)?(a):(b)) macro
|
/barrelfish-2018-10-04/lib/libc/gen/ |
H A D | getloadavg.c | 63 nelem = MIN(nelem, sizeof(loadinfo.ldavg) / sizeof(fixpt_t));
|
H A D | utxdb.c | 42 MIN(sizeof (fu)->fu_ ## field, sizeof (ut)->ut_ ## field)); \ 46 MIN(sizeof (fu)->fu_id, sizeof (ut)->ut_id)); \ 107 MIN(sizeof (ut)->ut_ ## field - 1, sizeof (fu)->fu_ ## field)); \ 111 MIN(sizeof (ut)->ut_id, sizeof (fu)->fu_id)); \
|
/barrelfish-2018-10-04/lib/rcce/ |
H A D | RCCE_reduce.c | 31 #ifndef MIN 32 #define MIN(x,y) ( (x) < (y) ? (x) : (y) ) macro 112 case RCCE_MIN_INT: for (i=0; i<num; i++) iout[i] = MIN(iout[i],iin[i]); break; 117 case RCCE_MIN_LONG: for (i=0; i<num; i++) lout[i] = MIN(lout[i],lin[i]); break; 122 case RCCE_MIN_FLOAT: for (i=0; i<num; i++) fout[i] = MIN(fout[i],fin[i]); break; 127 case RCCE_MIN_DOUBLE: for (i=0; i<num; i++) dout[i] = MIN(dout[i],din[i]); break;
|
/barrelfish-2018-10-04/lib/libc/stdio/ |
H A D | fvwrite.c | 67 #define MIN(a, b) ((a) < (b) ? (a) : (b)) macro 87 w = _swrite(fp, p, MIN(len, BUFSIZ)); 128 COPY(w); /* copy MIN(fp->_w,len), */ 161 * that the amount to write is MIN(len,nldist). 172 s = MIN(len, nldist);
|
/barrelfish-2018-10-04/usr/bench/udp_echo/ |
H A D | udp_openloop.c | 39 #ifndef MIN 40 #define MIN(a,b) ((a) < (b) ? (a) : (b)) macro 176 min = MIN(min, r);
|
/barrelfish-2018-10-04/include/ |
H A D | arranet_debug.h | 22 #define MIN(a,b) ((a) < (b) ? (a) : (b)) macro
|
/barrelfish-2018-10-04/lib/libc/db/btree/ |
H A D | bt_overflow.c | 110 nb = MIN(sz, plen); 155 nb = MIN(sz, plen);
|