/barrelfish-2018-10-04/lib/libc/db/mpool/ |
H A D | mpool.c | 66 MPOOL *mp; local 83 if ((mp = (MPOOL *)calloc(1, sizeof(MPOOL))) == NULL) 85 TAILQ_INIT(&mp->lqh); 87 TAILQ_INIT(&mp->hqh[entry]); 88 mp->maxcache = maxcache; 89 mp->npages = sb.st_size / pagesize; 90 mp->pagesize = pagesize; 91 mp->fd = fd; 92 return (mp); 100 mpool_filter(MPOOL *mp, voi argument 113 mpool_new(MPOOL *mp, pgno_t *pgnoaddr, u_int flags) argument 147 mpool_delete(MPOOL *mp, void *page) argument 178 mpool_get(MPOOL *mp, pgno_t pgno, u_int flags) argument 273 mpool_put(MPOOL *mp, void *page, u_int flags) argument 299 mpool_close(MPOOL *mp) argument 320 mpool_sync(MPOOL *mp) argument 339 mpool_bkt(MPOOL *mp) argument 394 mpool_write(MPOOL *mp, BKT *bp) argument 428 mpool_look(MPOOL *mp, pgno_t pgno) argument 454 mpool_stat(MPOOL *mp) argument [all...] |
H A D | mpool-compat.c | 37 __mpool_new__44bsd(MPOOL *mp, pgno_t *pgnoaddr) argument 40 return (mpool_new(mp, pgnoaddr, MPOOL_PAGE_NEXT));
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn_mp_clear_multi.c | 19 void mp_clear_multi(mp_int *mp, ...) argument 21 mp_int* next_mp = mp; 23 va_start(args, mp);
|
H A D | bn_mp_init_multi.c | 19 int mp_init_multi(mp_int *mp, ...) argument 23 mp_int* cur_arg = mp; 26 va_start(args, mp); /* init args to next argument from caller */ 38 cur_arg = mp; 39 va_start(clean_args, mp);
|
H A D | bn_mp_exptmod_fast.c | 35 mp_digit buf, mp; local 89 if ((err = mp_montgomery_setup (P, &mp)) != MP_OKAY) { 116 mp_dr_setup(P, &mp); 125 if ((err = mp_reduce_2k_setup(P, &mp)) != MP_OKAY) { 178 if ((err = redux (&M[1 << (winsize - 1)], P, mp)) != MP_OKAY) { 188 if ((err = redux (&M[x], P, mp)) != MP_OKAY) { 231 if ((err = redux (&res, P, mp)) != MP_OKAY) { 248 if ((err = redux (&res, P, mp)) != MP_OKAY) { 257 if ((err = redux (&res, P, mp)) != MP_OKAY) { 275 if ((err = redux (&res, P, mp)) ! [all...] |
H A D | bn.tex | 188 & functional mp\_div() function \\ 325 \index{mp\_error\_to\_string} 334 The basic ``multiple precision integer'' type is known as the ``mp\_int'' within LibTomMath. This data type is used to 338 \index{mp\_int} 346 Where ``mp\_digit'' is a data type that represents individual digits of the integer. By default, an mp\_digit is the 347 ISO C ``unsigned long'' data type and each digit is $28-$bits long. The mp\_digit type can be configured to suit other 350 All LTM functions that use the mp\_int type will expect a pointer to mp\_int structure. You must allocate memory to 352 done to use an mp\_in [all...] |
H A D | tommath.h | 203 int mp_init_multi(mp_int *mp, ...); 206 void mp_clear_multi(mp_int *mp, ...); 406 int mp_montgomery_setup(mp_int *a, mp_digit *mp); 414 int mp_montgomery_reduce(mp_int *a, mp_int *m, mp_digit mp); 423 int mp_dr_reduce(mp_int *a, mp_int *b, mp_digit mp); 539 #define mp_read_raw(mp, str, len) mp_read_signed_bin((mp), (str), (len)) 540 #define mp_raw_size(mp) mp_signed_bin_size(mp) 541 #define mp_toraw(mp, st [all...] |
H A D | tommath.tex | 290 \index{mp\_int} 291 The term ``mp\_int'' shall refer to a composite structure which contains the digits of the integer it represents, as well 293 \ref{sec:MPINT}. For the purposes of this text a ``multiple precision integer'' and an ``mp\_int'' are assumed to be 294 synonymous. When an algorithm is specified to accept an mp\_int variable it is assumed the various auxliary data members 303 mp\_ints as inputs do not concern themselves with the housekeeping operations required such as memory management. These 314 \index{mp\_digit} \index{mp\_word} 315 Within the source code that will be presented for each algorithm, the data type \textbf{mp\_digit} will represent 316 a single precision integer type, while, the data type \textbf{mp\_word} will represent a double precision integer type. In 317 several algorithms (notably the Comba routines) temporary results will be stored in arrays of double precision mp\_word [all...] |
H A D | dep.pl | 67 while ($line =~ m/(fast_)*(s_)*mp\_[a-z_0-9]*/) {
|
/barrelfish-2018-10-04/lib/tommath/mtest/ |
H A D | mpi.h | 90 mp_err mp_init(mp_int *mp); 91 mp_err mp_init_array(mp_int mp[], int count); 92 mp_err mp_init_size(mp_int *mp, mp_size prec); 93 mp_err mp_init_copy(mp_int *mp, mp_int *from); 96 void mp_clear(mp_int *mp); 97 void mp_clear_array(mp_int mp[], int count); 98 void mp_zero(mp_int *mp); 99 void mp_set(mp_int *mp, mp_digit d); 100 mp_err mp_set_int(mp_int *mp, long z); 182 void mp_print(mp_int *mp, FIL [all...] |
H A D | mpi.c | 160 mp_err s_mp_grow(mp_int *mp, mp_size min); /* increase allocated size */ 161 mp_err s_mp_pad(mp_int *mp, mp_size min); /* left pad with zeroes */ 163 void s_mp_clamp(mp_int *mp); /* clip leading zeroes */ 167 mp_err s_mp_lshd(mp_int *mp, mp_size p); /* left-shift by p digits */ 168 void s_mp_rshd(mp_int *mp, mp_size p); /* right-shift by p digits */ 169 void s_mp_div_2d(mp_int *mp, mp_digit d); /* divide by 2^d in place */ 170 void s_mp_mod_2d(mp_int *mp, mp_digit d); /* modulo 2^d in place */ 171 mp_err s_mp_mul_2d(mp_int *mp, mp_digit d); /* multiply by 2^d in place*/ 172 void s_mp_div_2(mp_int *mp); /* divide by 2 in place */ 173 mp_err s_mp_mul_2(mp_int *mp); /* multipl 236 mp_init(mp_int *mp) argument 246 mp_init_array(mp_int mp[], int count) argument 280 mp_init_size(mp_int *mp, mp_size prec) argument 307 mp_init_copy(mp_int *mp, mp_int *from) argument 422 mp_clear(mp_int *mp) argument 444 mp_clear_array(mp_int mp[], int count) argument 463 mp_zero(mp_int *mp) argument 478 mp_set(mp_int *mp, mp_digit d) argument 492 mp_set_int(mp_int *mp, long z) argument 2234 mp_print(mp_int *mp, FILE *ofp) argument 2264 mp_read_signed_bin(mp_int *mp, unsigned char *str, int len) argument 2286 mp_signed_bin_size(mp_int *mp) argument 2298 mp_to_signed_bin(mp_int *mp, unsigned char *str) argument 2319 mp_read_unsigned_bin(mp_int *mp, unsigned char *str, int len) argument 2344 mp_unsigned_bin_size(mp_int *mp) argument 2371 mp_to_unsigned_bin(mp_int *mp, unsigned char *str) argument 2427 mp_count_bits(mp_int *mp) argument 2459 mp_read_radix(mp_int *mp, unsigned char *str, int radix) argument 2507 mp_radix_size(mp_int *mp, int radix) argument 2544 mp_toradix(mp_int *mp, unsigned char *str, int radix) argument 2654 s_mp_grow(mp_int *mp, mp_size min) argument 2684 s_mp_pad(mp_int *mp, mp_size min) argument 2773 s_mp_clamp(mp_int *mp) argument 2815 s_mp_lshd(mp_int *mp, mp_size p) argument 2853 s_mp_rshd(mp_int *mp, mp_size p) argument 2889 s_mp_div_2(mp_int *mp) argument 2899 s_mp_mul_2(mp_int *mp) argument 2938 s_mp_mod_2d(mp_int *mp, mp_digit d) argument 2968 s_mp_mul_2d(mp_int *mp, mp_digit d) argument 3021 s_mp_div_2d(mp_int *mp, mp_digit d) argument 3088 s_mp_add_d(mp_int *mp, mp_digit d) argument 3123 s_mp_sub_d(mp_int *mp, mp_digit d) argument 3212 s_mp_div_d(mp_int *mp, mp_digit d, mp_digit *r) argument [all...] |
/barrelfish-2018-10-04/usr/drivers/solarflair/sfxge/common/ |
H A D | bf_support.c | 11 void mtx_lock(struct mtx *mp) argument 13 if(mp->state == 1) { 17 mp->state = 1; // lock it 20 void mtx_unlock(struct mtx *mp) argument 22 if(mp->state == 0) { 26 mp->state = 0; // lock it
|
H A D | bf_support.h | 45 void mtx_lock(struct mtx *mp); 46 void mtx_unlock(struct mtx *mp);
|
/barrelfish-2018-10-04/lib/tommath/etc/ |
H A D | mont.c | 7 mp_digit mp; local 29 mp_montgomery_setup(&modulus, &mp); 35 mp_montgomery_reduce(&pp, &modulus, mp);
|
/barrelfish-2018-10-04/include/sys/ |
H A D | mount.h | 199 struct vnode *__mnt_vnode_next_all(struct vnode **mvp, struct mount *mp); 200 struct vnode *__mnt_vnode_first_all(struct vnode **mvp, struct mount *mp); 201 void __mnt_vnode_markerfree_all(struct vnode **mvp, struct mount *mp); 203 #define MNT_VNODE_FOREACH_ALL(vp, mp, mvp) \ 204 for (vp = __mnt_vnode_first_all(&(mvp), (mp)); \ 205 (vp) != NULL; vp = __mnt_vnode_next_all(&(mvp), (mp))) 207 #define MNT_VNODE_FOREACH_ALL_ABORT(mp, mvp) \ 209 MNT_ILOCK(mp); \ 210 __mnt_vnode_markerfree_all(&(mvp), (mp)); \ 211 /* MNT_IUNLOCK(mp); 375 MNT_SHARED_WRITES(struct mount *mp) argument 382 MNT_EXTENDED_SHARED(struct mount *mp) argument [all...] |
/barrelfish-2018-10-04/lib/libc/gen/ |
H A D | getcap.c | 787 char *bp, *mp; local 807 mp = mem; 821 *mp++ = '\177'; 824 *mp++ = *bp++ & 037; 837 *mp++ = n; 841 *mp++ = '\b'; 844 *mp++ = '\t'; 847 *mp++ = '\n'; 850 *mp++ = '\f'; 853 *mp 914 char *bp, *mp; local [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ |
H A D | mem_dbg.c | 571 MEM m,*mp; local 584 mp=lh_MEM_delete(mh,&m); 585 if (mp != NULL) 589 mp->order, mp->addr, mp->num); 591 if (mp->app_info != NULL) 592 app_info_free(mp->app_info); 593 OPENSSL_free(mp); 608 MEM m,*mp; local [all...] |
/barrelfish-2018-10-04/lib/vfs/ |
H A D | vfs.c | 95 char *mp = strdup(mountpoint); local 96 assert(mp != NULL); 97 vfs_path_normalise(mp); 100 if (mp[0] != VFS_PATH_SEP || strncmp(mp, "/../", 4) == 0) { 101 free(mp); 109 if (strcmp(mp, VFS_PATH_SEP_STR) != 0) { 110 free(mp); 114 struct vfs_mount *parent = find_mount(mp, NULL); 116 if (strcmp(parent->mountpoint, mp) [all...] |
/barrelfish-2018-10-04/lib/lua/src/ |
H A D | ltable.c | 406 Node *mp; local 410 mp = mainposition(t, key); 411 if (!ttisnil(gval(mp)) || isdummy(mp)) { /* main position is taken? */ 420 othern = mainposition(t, gkey(mp)); 421 if (othern != mp) { /* is colliding node out of its main position? */ 423 while (gnext(othern) != mp) othern = gnext(othern); /* find previous */ 424 gnext(othern) = n; /* redo the chain with `n' in place of `mp' */ 425 *n = *mp; /* copy colliding node into free pos. (mp [all...] |
/barrelfish-2018-10-04/include/vm/ |
H A D | vm_fault.c | 1221 vm_page_t *mp; local 1245 for (mp = ma, va = addr; va < end; mp++, va += PAGE_SIZE) { 1246 *mp = pmap_extract_and_hold(map->pmap, va, prot); 1247 if (*mp == NULL) 1250 (*mp)->dirty != VM_PAGE_BITS_ALL) { 1260 vm_page_dirty(*mp); 1270 for (mp = ma, va = addr; va < end; mp++, va += PAGE_SIZE) 1271 if (*mp [all...] |
H A D | vm_pageout.c | 745 struct mount *mp; local 755 mp = NULL; 773 vn_start_write(vp, &mp, V_NOWAIT) != 0) { 774 mp = NULL; 778 KASSERT(mp != NULL, 832 if (mp != NULL) { 836 vn_finished_write(mp);
|
H A D | vnode_pager.c | 1340 struct mount *mp; local 1368 mp = NULL; 1369 vn_start_write(vp, &mp, V_WAIT); 1381 if (mp != NULL) 1382 vn_finished_write(mp);
|
/barrelfish-2018-10-04/lib/libc/net/ |
H A D | name6.c | 591 u_char *ap, *sp, *mp, **pp; local 605 mp = (u_char *)&statp->_u._ext.ext->sort_list[j].mask; 608 mp = (u_char *)&statp->sort_list[j].mask; 611 if ((ap[n] & mp[n]) != sp[n]) 787 u_char *mp, *ep, *k, *p, m; local 811 mp = (u_char *)&pol->addrmask.sin6_addr; 812 ep = mp + 16; /* XXX: scope field? */ 815 for (; mp < ep && *mp; mp [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/engines/ |
H A D | e_chil.c | 267 #define BN2MPI(mp, bn) \ 268 {mp.size = bn->top * sizeof(BN_ULONG); mp.buf = (unsigned char *)bn->d;} 269 #define MPI2BN(bn, mp) \ 270 {mp.size = bn->dmax * sizeof(BN_ULONG); mp.buf = (unsigned char *)bn->d;}
|
/barrelfish-2018-10-04/lib/tommath/pre_gen/ |
H A D | mpi.c | 1204 void mp_clear_multi(mp_int *mp, ...) argument 1206 mp_int* next_mp = mp; 1208 va_start(args, mp); 2657 mp_digit buf, mp; local 2711 if ((err = mp_montgomery_setup (P, &mp)) != MP_OKAY) { 2738 mp_dr_setup(P, &mp); 2747 if ((err = mp_reduce_2k_setup(P, &mp)) != MP_OKAY) { 2800 if ((err = redux (&M[1 << (winsize - 1)], P, mp)) != MP_OKAY) { 2810 if ((err = redux (&M[x], P, mp)) != MP_OKAY) { 2853 if ((err = redux (&res, P, mp)) ! 3484 mp_init_multi(mp_int *mp, ...) argument [all...] |