/barrelfish-2018-10-04/lib/compiler-rt/builtins/ |
H A D | atomic_flag_clear_explicit.c | 24 memory_order order) { 25 __c11_atomic_store(&(object)->_Value, 0, order); 23 atomic_flag_clear_explicit(volatile atomic_flag *object, memory_order order) argument
|
H A D | atomic_flag_test_and_set_explicit.c | 24 memory_order order) { 25 return __c11_atomic_exchange(&(object)->_Value, 1, order); 23 atomic_flag_test_and_set_explicit(volatile atomic_flag *object, memory_order order) argument
|
H A D | atomic_signal_fence.c | 23 void atomic_signal_fence(memory_order order) { argument 24 __c11_atomic_signal_fence(order);
|
H A D | atomic_thread_fence.c | 23 void atomic_thread_fence(memory_order order) { argument 24 __c11_atomic_thread_fence(order);
|
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/include/linux/ |
H A D | mm.h | 58 int order; local 61 order = 0; 63 order++; 66 return (order);
|
H A D | bitops.h | 84 int order; local 86 order = fls(count) - 1; 88 order++; 89 return order; 449 static int __reg_op(unsigned long *bitmap, int pos, int order, int reg_op) { argument 462 nbits_reg = 1 << order; 501 * @order: region size (log base 2 of number of bits) to find 505 * a power (@order) of two, aligned to that power of two, which 512 int order) { 513 int pos, end; /*scans bitmap by regions of size order*/ 511 bitmap_find_free_region(unsigned long *bitmap, int bits, int order) argument [all...] |
H A D | gfp.h | 107 __free_pages(struct page *m, unsigned int order) 113 size = PAGE_SIZE << order; 117 static inline void free_pages(uintptr_t addr, unsigned int order) 121 __free_pages(virt_to_page((void *)addr), order); 126 * order specifies a power of two bucket of pages and the results 182 alloc_pages(unsigned int order) { argument 189 size = BASE_PAGE_SIZE << order; 223 static inline uintptr_t __get_free_pages(gfp_t gfp_mask, unsigned int order) 227 page = alloc_pages(gfp_mask, order); 233 #define alloc_pages_node(node, mask, order) alloc_page [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ecdsa/ |
H A D | ecs_ossl.c | 93 BIGNUM *k = NULL, *r = NULL, *order = NULL, *X = NULL; local 117 order = BN_new(); 119 if (!k || !r || !order || !X) 129 if (!EC_GROUP_get_order(group, order, ctx)) 139 if (!BN_rand_range(k, order)) 171 if (!BN_nnmod(r, X, order, ctx)) 180 if (!BN_mod_inverse(k, k, order, ctx)) 202 if (order != NULL) 203 BN_free(order); 216 BIGNUM *kinv=NULL, *s, *m=NULL,*tmp=NULL,*order local 348 BIGNUM *order, *u1, *u2, *m, *X; local [all...] |
H A D | ecs_lib.c | 205 BIGNUM *order=NULL; local 215 if ((order = BN_new()) == NULL) return 0; 216 if (!EC_GROUP_get_order(group,order,NULL)) 218 BN_clear_free(order); 221 i=BN_num_bits(order); 231 BN_clear_free(order);
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ec/ |
H A D | ec_check.c | 62 BIGNUM *order; local 76 if ((order = BN_CTX_get(ctx)) == NULL) goto err; 97 /* check the order of the generator */ 99 if (!EC_GROUP_get_order(group, order, ctx)) goto err; 100 if (BN_is_zero(order)) 106 if (!EC_POINT_mul(group, point, order, NULL, NULL, ctx)) goto err;
|
H A D | ec_key.c | 237 BIGNUM *priv_key = NULL, *order = NULL; local 246 if ((order = BN_new()) == NULL) goto err; 258 if (!EC_GROUP_get_order(eckey->group, order, ctx)) 262 if (!BN_rand_range(priv_key, order)) 284 if (order) 285 BN_free(order); 299 const BIGNUM *order = NULL; local 325 /* testing whether pub_key * order is the point at infinity */ 326 order = &eckey->group->order; [all...] |
H A D | eck_prn.c | 155 *order=NULL, *cofactor=NULL; local 204 (b = BN_new()) == NULL || (order = BN_new()) == NULL || 233 if (!EC_GROUP_get_order(x, order, NULL) || 256 if (buf_len < (i = (size_t)BN_num_bytes(order))) 325 if ((order != NULL) && !ASN1_bn_print(bp, "Order: ", order, 344 if (order) 345 BN_free(order);
|
H A D | ec_ameth.c | 373 BIGNUM *order = BN_new(); local 377 if (!order) 383 if (!EC_GROUP_get_order(group, order, NULL)) 389 ret = BN_num_bits(order); 390 BN_free(order); 433 BIGNUM *pub_key=NULL, *order=NULL; local 492 if ((order = BN_new()) == NULL) 494 if (!EC_GROUP_get_order(group, order, NULL)) 497 BN_num_bits(order)) <= 0) goto err; 513 if (order) [all...] |
/barrelfish-2018-10-04/include/vm/ |
H A D | vm_phys.c | 168 int order); 176 int order); 474 vm_freelist_add(struct vm_freelist *fl, vm_page_t m, int order, int tail) argument 477 m->order = order; 479 TAILQ_INSERT_TAIL(&fl[order].pl, m, plinks.q); 481 TAILQ_INSERT_HEAD(&fl[order].pl, m, plinks.q); 482 fl[order].lcnt++; 486 vm_freelist_rem(struct vm_freelist *fl, vm_page_t m, int order) argument 489 TAILQ_REMOVE(&fl[order] 715 vm_phys_split_pages(vm_page_t m, int oind, struct vm_freelist *fl, int order) argument 765 vm_phys_alloc_pages(int pool, int order) argument 799 vm_phys_alloc_freelist_pages(int freelist, int pool, int order) argument 827 vm_phys_alloc_domain_pages(int domain, int flind, int pool, int order) argument 1089 vm_phys_free_pages(vm_page_t m, int order) argument 1137 int order; local 1223 vm_phys_set_pool(int pool, vm_page_t m, int order) argument 1245 int order; local 1368 int oind, order, pind; local [all...] |
H A D | vm_phys.h | 76 vm_page_t vm_phys_alloc_freelist_pages(int freelist, int pool, int order); 77 vm_page_t vm_phys_alloc_pages(int pool, int order); 84 void vm_phys_free_pages(vm_page_t m, int order); 89 void vm_phys_set_pool(int pool, vm_page_t m, int order);
|
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/net/mlx4/ |
H A D | mr.c | 63 static u32 mlx4_buddy_alloc(struct mlx4_buddy *buddy, int order) { argument 70 for (o = order; o <= buddy->max_order; ++o) 84 while (o > order) { 93 seg <<= order; local 98 static void mlx4_buddy_free(struct mlx4_buddy *buddy, u32 seg, int order) { argument 99 seg >>= order; local 103 while (test_bit(seg ^ 1, buddy->bits[order])) { 104 clear_bit(seg ^ 1, buddy->bits[order]); 105 --buddy->num_free[order]; 107 ++order; 158 __mlx4_alloc_mtt_range(struct mlx4_priv *priv, int order) argument 181 mlx4_alloc_mtt_range(struct mlx4_priv *priv, int order) argument [all...] |
H A D | alloc.c | 316 struct mlx4_db *db, int order) { 320 for (o = order; o <= 1; ++o) { 333 if (o > order) 334 set_bit(i ^ 1, pgdir->bits[order]); 340 db->order = order; 345 int mlx4_db_alloc(struct mlx4_dev *dev, struct mlx4_db *db, int order) { argument 353 if (!mlx4_alloc_db_from_pgdir(pgdir, db, order)) 365 assert(!mlx4_alloc_db_from_pgdir(pgdir, db, order)); 382 o = db->order; 315 mlx4_alloc_db_from_pgdir(struct mlx4_db_pgdir *pgdir, struct mlx4_db *db, int order) argument [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/engines/ccgost/ |
H A D | gost2001.c | 31 * Also fils DSA->q field with copy of EC_GROUP order field to make 98 BIGNUM *order = NULL; local 113 order=BN_CTX_get(ctx); 114 EC_GROUP_get_order(group,order,ctx); 117 BN_mod(e,md,order,ctx); 135 if (!BN_rand_range(k,order)) 158 BN_nnmod(r,X,order,ctx); 161 /* s = (r*priv_key+k*e) mod order */ 163 BN_mod_mul(tmp,priv_key,r,order,ctx); 165 BN_mod_mul(tmp2,k,e,order,ct 189 BIGNUM *order; local 323 BIGNUM *order = BN_new(),*d=BN_new(); local [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/ |
H A D | megalist.tcl | 103 order {} \ 139 if {[lsearch $data(order) $v] == -1} { 154 foreach name $data(order) { 158 foreach name $data(order) { 168 foreach name $data(order) { 176 foreach name $data(order) { 191 if {[string match {} $data(order)]} { 215 foreach name $data(order) { 227 set config(-order) increasing 229 if {[string compare increasing $config(-order)]} { [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | dummy_bigrat.c | 67 ec_array_to_big(const void *p, int count, int order, int size, int endian, unsigned nails, pword *result) argument
|
H A D | emu_util.c | 371 tag_desc[i].order = 0; 378 tag_desc[TIVL].order = o++; /* this determines the type order in @> etc */ 379 tag_desc[TDBL].order = o++; 380 tag_desc[TRAT].order = o++; 381 tag_desc[TINT].order = 382 tag_desc[TBIG].order = o++; 383 tag_desc[TSTRG].order = o++; 384 tag_desc[TNIL].order = 385 tag_desc[TDICT].order [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ |
H A D | mem_dbg.c | 136 static unsigned long order = 0; /* number of memory requests */ variable 179 unsigned long order; member in struct:mem_st 248 * appropriate order (long-time lock first). 525 if (order == break_order_num) 528 m->order=order; 530 m->order=order++; 533 m->order, 589 mp->order, m [all...] |
/barrelfish-2018-10-04/include/mdb/ |
H A D | mdb_tree.h | 147 MDB_TRAVERSAL_ORDER_ASCENDING, ///< Traverse the tree in ascending order 148 MDB_TRAVERSAL_ORDER_DESCENDING ///< Traverse the tree in descending order 152 * Traverse the mdb tree using some order with a call-back function and 154 * @param order The order to traverse the tree in. 158 errval_t mdb_traverse(enum mdb_tree_traversal_order order, mdb_tree_traversal_fn cb, void *data); 161 * Traverse an mdb sub tree using some order with a call-back function and 164 * @param order The order to traverse the tree in. 168 errval_t mdb_traverse_subtree(struct cte *cte, enum mdb_tree_traversal_order order, mdb_tree_traversal_f [all...] |
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mthca/ |
H A D | mthca_mr.c | 43 int order; member in struct:mthca_mtt 84 static u32 mthca_buddy_alloc(struct mthca_buddy *buddy, int order) argument 92 for (o = order; o <= buddy->max_order; ++o) 107 while (o > order) { 116 seg <<= order; local 121 static void mthca_buddy_free(struct mthca_buddy *buddy, u32 seg, int order) argument 123 seg >>= order; local 127 while (test_bit(seg ^ 1, buddy->bits[order])) { 128 clear_bit(seg ^ 1, buddy->bits[order]); 129 --buddy->num_free[order]; 190 mthca_alloc_mtt_range(struct mthca_dev *dev, int order, struct mthca_buddy *buddy) argument [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/objects/ |
H A D | objects.pl | 16 { die "$ARGV[1]:$o:There's already an object with NID ",$mynum," on line ",$order{$mynum},"\n"; } 18 { die "$ARGV[1]:$o:There's already an object with name ",$Cname," on line ",$order{$nid{$Cname}},"\n"; } 21 $order{$mynum} = $o; 50 $order{$Cname} = $o; 76 { die "objects.txt:$o:There's already an object with long name ",$ln{$module.$Cname}," on line ",$order{$module.$Cname},"\n"; } 83 { die "objects.txt:$o:There's already an object with short name ",$sn{$module.$Cname}," on line ",$order{$module.$Cname},"\n"; } 92 { die "objects.txt:$o:There's already an object with long name ",$ln{$module.$Cname}," on line ",$order{$module.$Cname},"\n"; } 98 $order{$Cname} = $o;
|