Searched refs:order (Results 26 - 50 of 313) sorted by relevance

1234567891011>>

/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/pragma/
H A Dtst.libdepfullyconnected.ksh71 @order = qw(libc libe liba libd libb);
87 exit 1 if @new != @order;
90 exit 1 if pop(@new) ne pop(@order);
/freebsd-11-stable/contrib/binutils/ld/
H A Dmri.c48 static struct section_name_struct *order; variable in typeref:struct:section_name_struct
132 if (order == NULL)
133 order = address;
141 for (olist = order; done == 0 && olist != NULL; olist = olist->next)
152 /* Add this onto end of order list. */
153 mri_add_to_list (&order, alist->name, alist->vma, 0, 0, 0);
165 if (order == NULL)
166 order = only_load;
170 for (ptr2 = order; ptr2; ptr2 = ptr2->next)
179 for (ptr = order; pt
[all...]
/freebsd-11-stable/usr.sbin/lastlogin/
H A Dlastlogin.c57 static int order = 1; variable
65 return (order * strcmp(((const struct utmpx *)u1)->ut_user,
76 return (t1 < t2 ? order : t1 > t2 ? -order : 0);
95 order = -1;
/freebsd-11-stable/sys/dev/drm/
H A Ddrm_hashtab.c44 int drm_ht_create(struct drm_open_hash *ht, unsigned int order) argument
46 ht->size = 1 << order;
47 ht->order = order;
65 hashed_key = hash32_buf(&key, sizeof(key), ht->order);
79 hashed_key = hash32_buf(&key, sizeof(key), ht->order);
98 hashed_key = hash32_buf(&key, sizeof(key), ht->order);
/freebsd-11-stable/sys/dev/drm2/
H A Ddrm_hashtab.c44 int drm_ht_create(struct drm_open_hash *ht, unsigned int order) argument
46 ht->size = 1 << order;
47 ht->order = order;
66 hashed_key = hash32_buf(&key, sizeof(key), ht->order);
80 hashed_key = hash32_buf(&key, sizeof(key), ht->order);
99 hashed_key = hash32_buf(&key, sizeof(key), ht->order);
H A Ddrm_bufs.c682 * reallocates the buffer list of the same size order to accommodate the new
694 int order; local
707 order = drm_order(request->size);
708 size = 1 << order;
712 page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
719 DRM_DEBUG("order: %d\n", order);
726 if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDE
854 int order; local
1064 int order; local
1220 int order; local
1507 int order; local
1698 int order; local
[all...]
/freebsd-11-stable/sys/dev/mlx5/mlx5_ib/
H A Dmlx5_ib_mem.c38 * @order: log2 of the number of compound pages
41 int *ncont, int *order)
61 if (order)
62 *order = ilog2(roundup_pow_of_two(*count));
102 if (order)
103 *order = ilog2(roundup_pow_of_two(i) >> m);
109 if (order)
110 *order = 0;
40 mlx5_ib_cont_pages(struct ib_umem *umem, u64 addr, int *count, int *shift, int *ncont, int *order) argument
/freebsd-11-stable/sys/net/
H A Dvnet.h304 enum sysinit_elem_order order; member in struct:vnet_sysinit
310 #define VNET_SYSINIT(ident, subsystem, order, func, arg) \
315 order, \
319 SYSINIT(vnet_init_ ## ident, subsystem, order, \
321 SYSUNINIT(vnet_init_ ## ident, subsystem, order, \
324 #define VNET_SYSUNINIT(ident, subsystem, order, func, arg) \
329 order, \
333 SYSINIT(vnet_uninit_ ## ident, subsystem, order, \
335 SYSUNINIT(vnet_uninit_ ## ident, subsystem, order, \
421 #define VNET_SYSINIT(ident, subsystem, order, fun
[all...]
/freebsd-11-stable/sys/sys/
H A Dmodule.h139 #define DECLARE_MODULE_WITH_MAXVER(name, data, sub, order, maxver) \
143 SYSINIT(name##module, sub, order, module_register_init, &data); \
146 #define DECLARE_MODULE(name, data, sub, order) \
147 DECLARE_MODULE_WITH_MAXVER(name, data, sub, order, MODULE_KERNEL_MAXVER)
156 #define DECLARE_MODULE_TIED(name, data, sub, order) \
157 DECLARE_MODULE_WITH_MAXVER(name, data, sub, order, __FreeBSD_version)
H A Dkernel.h73 * Startup occurs in ascending numeric order; the list entries are
74 * sorted prior to attempting startup to guarantee order. Items
75 * of the same level are arbitrated for order based on the 'order'
217 enum sysinit_elem_order order; /* init order within subsystem*/ member in struct:sysinit
234 #define C_SYSINIT(uniquifier, subsystem, order, func, ident) \
237 order, \
243 #define SYSINIT(uniquifier, subsystem, order, func, ident) \
244 C_SYSINIT(uniquifier, subsystem, order, \
[all...]
/freebsd-11-stable/sys/dev/syscons/dragon/
H A Ddragon_saver.c128 static int order, mul, out; local
150 order = ORDER;
153 if (order >= ORDER) {
171 order = 0;
178 ++order;
195 order = ORDER; /* force to terminate this curve */
/freebsd-11-stable/contrib/wpa/src/common/
H A Ddragonfly.c183 const struct crypto_bignum *order)
185 return crypto_bignum_rand(val, order) == 0 &&
191 int dragonfly_generate_scalar(const struct crypto_bignum *order, argument
201 if (dragonfly_get_rand_2_to_r_1(_rand, order) &&
202 dragonfly_get_rand_2_to_r_1(_mask, order) &&
204 crypto_bignum_mod(scalar, order, scalar) == 0 &&
182 dragonfly_get_rand_2_to_r_1(struct crypto_bignum *val, const struct crypto_bignum *order) argument
/freebsd-11-stable/cddl/usr.sbin/dtrace/tests/common/union/
H A DMakefile14 err.D_DECL_INCOMPLETE.order.d \
/freebsd-11-stable/sys/dev/fdt/
H A Dsimplebus.h60 device_t simplebus_add_device(device_t dev, phandle_t node, u_int order,
/freebsd-11-stable/sys/isa/
H A Disahint.c44 int order; local
52 order = ISA_ORDER_SENSITIVE;
54 order = ISA_ORDER_SPECULATIVE;
56 child = BUS_ADD_CHILD(parent, order, name, unit);
/freebsd-11-stable/sys/dev/liquidio/
H A Dlio_network.h182 int order; local
185 order = 0;
187 order++;
191 return (order);
/freebsd-11-stable/sys/compat/linuxkpi/common/include/linux/
H A Dbitmap.h176 bitmap_find_free_region(unsigned long *bitmap, int bits, int order) argument
181 for (pos = 0; (end = pos + (1 << order)) <= bits; pos = end) {
182 if (!linux_reg_op(bitmap, pos, order, REG_OP_ISFREE))
184 linux_reg_op(bitmap, pos, order, REG_OP_ALLOC);
191 bitmap_allocate_region(unsigned long *bitmap, int pos, int order) argument
193 if (!linux_reg_op(bitmap, pos, order, REG_OP_ISFREE))
195 linux_reg_op(bitmap, pos, order, REG_OP_ALLOC);
200 bitmap_release_region(unsigned long *bitmap, int pos, int order) argument
202 linux_reg_op(bitmap, pos, order, REG_OP_RELEASE);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/
H A Dtree_policy.hpp95 // entry with the __order order, or a const_iterator to the
96 // container object's end if order is at least the size of the
99 find_by_order(size_type order) const;
102 // with the __order order, or an iterator to the container
103 // object's end if order is at least the size of the container
106 find_by_order(size_type order);
108 // Returns the order of a key within a sequence. For exapmle, if
/freebsd-11-stable/crypto/heimdal/lib/gssapi/krb5/
H A Ddelete_sec_context.c71 if(ctx->order)
72 _gssapi_msg_order_destroy(&ctx->order);
/freebsd-11-stable/sys/dev/bhnd/nvram/
H A Dnvram_subr.c117 int order; local
123 * order (using the 'C' locale for collation rules)
134 order = strcmp(bhnd_nvram_vars[mid].name, varname);
135 if (order < 0) {
138 } else if (order > 0) {
141 } else if (order == 0) {
/freebsd-11-stable/usr.sbin/yppoll/
H A Dyppoll.c134 int order, c, r; local
158 &order, &master);
160 r = yp_order(domainname, inmap, &order);
169 torder = order;
170 printf("Map %s has order number %lld. %s", inmap,
171 (long long)order, ctime(&torder));
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/zfs/
H A Dzprop_common.c141 * A comparison function we can use to order indexes into property tables.
171 zprop_desc_t **order; local
178 order = kmem_alloc(size, KM_SLEEP);
180 if ((order = malloc(size)) == NULL)
185 order[j] = &prop_tbl[j];
188 qsort((void *)order, num_props, sizeof (zprop_desc_t *),
194 if ((order[i]->pd_visible || show_all) &&
195 (func(order[i]->pd_propnum, cb) != ZPROP_CONT)) {
196 prop = order[i]->pd_propnum;
202 kmem_free(order, siz
[all...]
/freebsd-11-stable/sys/dev/mlx4/mlx4_core/
H A Dmlx4_mr.c49 static u32 mlx4_buddy_alloc(struct mlx4_buddy *buddy, int order) argument
57 for (o = order; o <= buddy->max_order; ++o)
72 while (o > order) {
81 seg <<= order; local
86 static void mlx4_buddy_free(struct mlx4_buddy *buddy, u32 seg, int order) argument
88 seg >>= order; local
92 while (test_bit(seg ^ 1, buddy->bits[order])) {
93 clear_bit(seg ^ 1, buddy->bits[order]);
94 --buddy->num_free[order];
96 ++order;
156 __mlx4_alloc_mtt_range(struct mlx4_dev *dev, int order) argument
180 mlx4_alloc_mtt_range(struct mlx4_dev *dev, int order) argument
223 __mlx4_free_mtt_range(struct mlx4_dev *dev, u32 offset, int order) argument
237 mlx4_free_mtt_range(struct mlx4_dev *dev, u32 offset, int order) argument
[all...]
/freebsd-11-stable/crypto/openssl/crypto/ec/
H A Dec_key.c234 BIGNUM *priv_key = NULL, *order = NULL; local
247 if ((order = BN_new()) == NULL)
259 if (!EC_GROUP_get_order(eckey->group, order, ctx))
263 if (!BN_rand_range(priv_key, order))
283 if (order)
284 BN_free(order);
298 const BIGNUM *order = NULL; local
321 /* testing whether pub_key * order is the point at infinity */
322 order = &eckey->group->order;
[all...]
/freebsd-11-stable/crypto/openssl/crypto/
H A Dmem_dbg.c134 static unsigned long order = 0; /* number of memory requests */ variable
175 unsigned long order; member in struct:mem_st
242 * appropriate order (long-time lock first).
505 if (order == break_order_num) {
507 m->order = order;
509 m->order = order++;
512 m->order, (before_p & 128) ? '*' : '+', m->addr, m->num);
560 mp->order, m
[all...]

Completed in 322 milliseconds

1234567891011>>