HomeSort by: relevance | last modified time | path
    Searched defs:order (Results 1 - 25 of 341) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/crypto/external/bsd/openssl.old/dist/crypto/ec/
ec_check.c 16 const BIGNUM *order; local
48 /* check the order of the generator */
51 order = EC_GROUP_get0_order(group);
52 if (order == NULL)
54 if (BN_is_zero(order)) {
59 if (!EC_POINT_mul(group, point, order, NULL, NULL, ctx))
  /src/sys/external/bsd/drm2/dist/drm/lib/
drm_random.c 20 void drm_random_reorder(unsigned int *order, unsigned int count,
28 swap(order[i], order[j]);
35 unsigned int *order, i; local
37 order = kmalloc_array(count, sizeof(*order), GFP_KERNEL);
38 if (!order)
39 return order;
42 order[i] = i;
44 drm_random_reorder(order, count, state)
    [all...]
  /src/crypto/external/apache2/openssl/dist/crypto/sm2/
sm2_key.c 27 const BIGNUM *priv_key = NULL, *order = NULL; local
32 || (order = EC_GROUP_get0_order(group)) == NULL) {
38 max = BN_dup(order);
  /src/crypto/external/bsd/openssl/dist/crypto/sm2/
sm2_key.c 27 const BIGNUM *priv_key = NULL, *order = NULL; local
32 || (order = EC_GROUP_get0_order(group)) == NULL ) {
38 max = BN_dup(order);
  /src/external/lgpl2/userspace-rcu/dist/src/
rculfhash-mm-order.c 7 * Order based memory management for Lock-Free RCU Hash Table
14 void cds_lfht_alloc_bucket_table(struct cds_lfht *ht, unsigned long order)
16 if (order == 0) {
20 } else if (order > ht->min_alloc_buckets_order) {
21 ht->tbl_order[order] = ht->alloc->calloc(ht->alloc->state,
22 1UL << (order -1), sizeof(struct cds_lfht_node));
23 urcu_posix_assert(ht->tbl_order[order]);
25 /* Nothing to do for 0 < order && order <= ht->min_alloc_buckets_order */
29 * cds_lfht_free_bucket_table() should be called with decreasing order
46 unsigned long order; local
    [all...]
  /src/external/lgpl3/gmp/dist/mpn/generic/
bsqrtinv.c 58 mp_size_t bn, order[GMP_LIMB_BITS + 1]; local
80 order[d++] = bnb;
84 bnb = order[i];
brootinv.c 84 mp_size_t order[GMP_LIMB_BITS + 1]; local
127 order[d++] = bn;
129 order[d] = 2;
137 bn = order[d];
  /src/sys/external/bsd/drm/dist/bsd-core/
drm_hashtab.h 49 unsigned int order; member in struct:drm_open_hash
53 extern int drm_ht_create(struct drm_open_hash *ht, unsigned int order);
  /src/external/bsd/wpa/dist/src/crypto/
dh_groups.h 18 const u8 *order; member in struct:dh_group
  /src/sys/external/bsd/drm2/dist/drm/i915/selftests/
i915_random.c 75 void i915_random_reorder(unsigned int *order, unsigned int count,
78 i915_prandom_shuffle(order, sizeof(*order), count, state);
83 unsigned int *order, i; local
85 order = kmalloc_array(count, sizeof(*order),
87 if (!order)
88 return order;
91 order[i] = i;
93 i915_random_reorder(order, count, state)
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/therm/
nouveau_nvkm_subdev_therm_gk104.c 39 const struct gk104_clkgate_engine_info *order = therm->clkgate_order; local
43 for (i = 0; order[i].engine != NVKM_SUBDEV_NR; i++) {
44 if (!nvkm_device_subdev(dev, order[i].engine))
47 nvkm_mask(dev, 0x20200 + order[i].offset, 0xff00, 0x4500);
55 for (i = 0; order[i].engine != NVKM_SUBDEV_NR; i++) {
56 if (!nvkm_device_subdev(dev, order[i].engine))
59 nvkm_mask(dev, 0x20200 + order[i].offset, 0x00ff, 0x0045);
68 const struct gk104_clkgate_engine_info *order = therm->clkgate_order; local
72 for (i = 0; order[i].engine != NVKM_SUBDEV_NR; i++) {
73 if (!nvkm_device_subdev(dev, order[i].engine)
    [all...]
  /src/sys/external/bsd/drm2/dist/include/drm/
drm_hashtab.h 53 u8 order; member in struct:drm_open_hash
56 int drm_ht_create(struct drm_open_hash *ht, unsigned int order);
  /src/crypto/external/bsd/heimdal/dist/lib/roken/
tsearch-test.c 21 int order; member in struct:node
48 list_node(const void *ptr, VISIT order, int level)
52 if (order == postorder || order == leaf) {
54 if (p->order != walkorder) {
56 p->order);
85 warnx("erroneous list: found %d\n", p->order);
94 warnx("erroneous list: missing %d\n", t->order);
107 warnx("erroneous list: missing %d\n", t->order);
120 warnx("erroneous list: found %d\n", p->order);
    [all...]
  /src/external/lgpl3/gmp/dist/mini-gmp/tests/
t-import.c 50 int endian, order; local
60 for (order = -1; order <= 1; order += 2)
63 order, size, endian, size*count * 8);
64 mpz_import (res, in_count, order, size, endian, 0, input);
68 "in_count %lu, out_count %lu, endian = %d, order = %d\n",
69 (unsigned long) in_count, (unsigned long) out_count, endian, order);
77 mpz_export (output+1, &out_count, order, size, endian, 0, a);
84 "in_count %lu, out_count %lu, endian = %d, order = %d\n"
    [all...]
  /src/external/lgpl3/gmp/dist/tests/mpz/
t-import.c 33 int order; member in struct:__anon23376
143 mpz_import (got, data[i].count, data[i].order,
150 printf (" count=%lu order=%d size=%lu endian=%d nail=%u align=%lu\n",
151 (unsigned long) data[i].count, data[i].order,
t-export.c 33 int order; member in struct:__anon23371
151 ret = mpz_export (got_data, &got_count, data[i].order,
174 printf (" order=%d size=%lu endian=%d nail=%u\n",
175 data[i].order,
  /src/external/mit/isl/dist/
isl_tarjan.h 6 * index represents the order in which nodes are visited.
23 * order contains the elements of the components separated by -1
24 * op represents the current position in order
32 int *order; member in struct:isl_tarjan_graph
  /src/external/mpl/bind/dist/lib/dns/rdata/generic/
naptr_35.h 24 uint16_t order; member in struct:dns_rdata_naptr
  /src/external/mpl/dhcp/bind/dist/lib/dns/rdata/generic/
naptr_35.h 25 uint16_t order; member in struct:dns_rdata_naptr
  /src/games/hunt/huntd/
makemaze.c 122 int order[4]; local
130 order[0] = MNORTH;
133 order[i] = order[j];
134 order[j] = 0x1 << i;
137 switch (order[i]) {
  /src/usr.bin/error/
filter.c 143 int order; local
149 if ( (order = strcmp(key, names_ignored[halfway])) == 0)
151 if (order < 0) /* key is less than probe, throw away above */
  /src/usr.sbin/yppoll/
yppoll.c 93 int order; local
130 &order, &master, tcp);
132 r = yp_order(domainname, inmap, &order);
141 (void)printf("Map %s has order number %d. %s", inmap, order,
142 ctime((void *)&order));
  /src/external/mpl/bind/dist/lib/dns/
order.c 1 /* $NetBSD: order.c,v 1.10 2025/01/26 16:25:24 christos Exp $ */
28 #include <dns/order.h>
49 #define DNS_ORDER_VALID(order) ISC_MAGIC_VALID(order, DNS_ORDER_MAGIC)
53 dns_order_t *order; local
57 order = isc_mem_get(mctx, sizeof(*order));
59 ISC_LIST_INIT(order->ents);
62 isc_refcount_init(&order->references, 1);
64 order->mctx = NULL
138 dns_order_t *order; local
    [all...]
  /src/external/mpl/dhcp/bind/dist/lib/dns/
order.c 1 /* $NetBSD: order.c,v 1.1 2024/02/18 20:57:33 christos Exp $ */
28 #include <dns/order.h>
49 #define DNS_ORDER_VALID(order) ISC_MAGIC_VALID(order, DNS_ORDER_MAGIC)
53 dns_order_t *order; local
57 order = isc_mem_get(mctx, sizeof(*order));
59 ISC_LIST_INIT(order->ents);
62 isc_refcount_init(&order->references, 1);
64 order->mctx = NULL
138 dns_order_t *order; local
    [all...]
  /src/sys/arch/xen/x86/
xen_bus_dma.c 67 int order = -1; local
71 order++;
73 return order;
80 int order, i; local
93 order = uimax(get_order(size), get_order(alignment));
94 npages = (1 << order);
129 res.extent_order = order;
136 "failed: %d (order %d mem_flags %d)\n",
137 error, order, res.mem_flags);

Completed in 42 milliseconds

1 2 3 4 5 6 7 8 91011>>