HomeSort by relevance Sort by last modified time
    Searched refs:order (Results 1 - 25 of 267) sorted by null

1 2 3 4 5 6 7 8 91011

  /onnv/onnv-gate/usr/src/stand/lib/crypto/
README 28 In order to determine which object files aren't used in building the
  /onnv/onnv-gate/usr/src/cmd/audio/utilities/
Fir.cc 93 if (size >= order)
94 memcpy(state, data + size - order, order * sizeof (double));
96 int old = order - size;
99 memcpy(state + order - size, data, size * sizeof (double));
117 for (int i = 0; i < order; i++)
127 Fir(int order_in): order(order_in) // construct Fir object
129 state = new double[order];
131 coef = new double[order + 1];
132 delay = (order + 1) >> 1; // assuming symmetric FI
    [all...]
Resample.cc 62 int order, // LP FIR filter order
69 int half = order >> 1;
70 if (order & 1) { // order is odd, center = half + 0.5
76 } else { // order is even, center = half
83 for (; i <= order; i++) // symmetric FIR
84 coef[i] = coef[order - i];
93 * convolution of coef[order + 1] and data[length] up-sampled by a factor
100 int order, // filter orde
    [all...]
  /onnv/onnv-gate/usr/src/lib/libc/i386/gen/
byteorder.s 41 / reverses the byte order of 'long hl'
45 bswap %eax / reverses the byte order of %eax
51 bswap %eax / reverses the byte order of %eax
58 / reverses the byte order in hs.
62 bswap %eax / reverses the byte order of %eax
69 bswap %eax / reverses the byte order of %eax
  /onnv/onnv-gate/usr/src/common/openssl/crypto/ecdsa/
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=NULL local
330 BIGNUM *order, *u1, *u2, *m, *X; local
    [all...]
ecs_lib.c 207 BIGNUM *order=NULL; local
213 if ((order = BN_new()) == NULL) return 0;
214 if (!EC_GROUP_get_order(group,order,NULL))
216 BN_clear_free(order);
219 i=BN_num_bits(order);
229 BN_clear_free(order);
  /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/
newgetopt.pl 14 # Values for $order. See GNU getopt.c for details.
24 $order = $REQUIRE_ORDER;
32 $order = $PERMUTE;
57 $Getopt::Long::order = $newgetopt::order
58 if defined $newgetopt::order;
  /onnv/onnv-gate/usr/src/common/openssl/crypto/ec/
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;
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 BIGNUM *order = NULL; local
310 if ((order = BN_new()) == NULL)
321 /* testing whether pub_key * order is the point at infinity */
322 if (!EC_GROUP_get_order(eckey->group, order, ctx)
    [all...]
  /onnv/onnv-gate/usr/src/cmd/fs.d/
fssnapsup.c 84 * options determine what data should be displayed and in what order. An
96 * Based on these parameters, an order list is created that tells
97 * fssnap_display_info() what info to display and in what order.
106 int *order, orderlen = MAX_INFO_DESCRIPTORS+1; local
139 order = (int *)malloc(orderlen * sizeof (int));
140 if (order == NULL) {
142 gettext("cannot allocate order list.\n"));
151 order[i++] = getsubopt(&suboptions, infosubopts, &v);
153 order = (int *)realloc(order,
    [all...]
  /onnv/onnv-gate/usr/src/lib/libnsl/yp/
yp_order.c 58 yp_order(char *domain, char *map, unsigned long *order)
73 (order == NULL))
84 order);
107 struct timeval timeout, unsigned long *order)
134 *order = (unsigned long)resp.ordernum;
  /onnv/onnv-gate/usr/src/lib/libntfs/common/include/ntfs/
support.h 72 * Round up and down @num to 2 in power of @order.
74 #define ROUND_UP(num,order) (((num) + ((1 << (order)) - 1)) & \
75 ~((1 << (order)) - 1))
76 #define ROUND_DOWN(num,order) ((num) & ~((1 << (order)) - 1))
  /onnv/onnv-gate/usr/src/common/crypto/ecc/
ecl.c 78 MP_DIGITS(&group->order) = 0;
89 MP_CHECKOK(mp_init(&group->order, kmflag));
103 const mp_int *geny, const mp_int *order, int cofactor)
121 MP_CHECKOK(mp_copy(order, &group->order));
144 const mp_int *geny, const mp_int *order, int cofactor)
164 MP_CHECKOK(mp_copy(order, &group->order));
189 const mp_int *order, int cofactor)
207 MP_CHECKOK(mp_copy(order, &group->order))
232 mp_int irr, curvea, curveb, genx, geny, order; local
    [all...]
ecl_curve.c 119 if (params->order != NULL) {
121 ret->order = kmem_alloc(strlen(params->order) + 1, kmflag);
122 bcopy(params->order, ret->order, strlen(params->order) + 1);
124 CHECK(ret->order = strdup(params->order));
193 if (params->order != NULL)
195 kmem_free(params->order, strlen(params->order) + 1)
    [all...]
  /onnv/onnv-gate/usr/src/lib/udapl/udapl_tavor/amd64/
amd64.il 32 / Device registers are in Big Endian byte order, so use bswap* instructions.
  /onnv/onnv-gate/usr/src/lib/udapl/udapl_tavor/i386/
i386.il 32 / Device registers are in Big Endian byte order, so use bswap instructions.
  /onnv/onnv-gate/usr/src/cmd/dtrace/test/tst/common/pragma/
tst.libdepfullyconnected.ksh 71 @order = qw(libc libe liba libd libb);
87 exit 1 if @new != @order;
90 exit 1 if pop(@new) ne pop(@order);
  /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/ext/B/B/
Terse.pm 12 my ($order, $subref) = @_;
14 if ($order eq "exec") {
24 my $order = @args ? shift(@args) : "";
25 $order = "-exec" if $order eq "exec";
26 unshift @args, $order if $order ne "";
  /onnv/onnv-gate/usr/src/cmd/audio/include/
Fir.h 41 * coef[1] * state[order - 1] +
42 * coef[2] * state[order - 2] +
44 * coef[order] * state[0]
50 * state[order - 2] = state[order - 1]
51 * state[order - 1] = input
55 int order; // filter order, # taps = order + 1 member in class:Fir
56 double *coef; // (order + 1) filter coeffs
    [all...]
  /onnv/onnv-gate/usr/src/lib/libdscfg/common/
cfg_lockd.h 47 int32_t order; member in struct:lock_msg
  /onnv/onnv-gate/usr/src/cmd/avs/dscfglockd/
dscfglockd.c 89 int32_t order; /* who gets priority? */ member in struct:lock_req
98 int32_t order; variable
140 int32_t order; member in struct:lockdaemon
257 addr_is_holder(int32_t order)
260 (order == the_lock.remote_daemon->order));
307 message_buf.order = order;
356 daemon_alive(daemonaddr_t *daemon, int32_t order)
365 ldp->order = order
    [all...]
  /onnv/onnv-gate/usr/src/uts/common/io/warlock/
isp.wlcmd 19 ### Give warlock the lock order we use to prevent deadlocks.
21 assert order \
  /onnv/onnv-gate/usr/src/uts/common/io/drm/
drm_bufs.c 49 * Compute order. Can be made faster.
54 int order = 0; local
58 order ++;
60 if (size & ~(1 << order))
61 ++order;
63 return (order);
403 int order; local
414 order = drm_order(request->size);
415 size = 1 << order;
419 page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0
511 int order; local
596 int order, ret; local
632 int order, ret; local
    [all...]
  /onnv/onnv-gate/usr/src/cmd/lvm/metassist/layout/
layout_concat.c 82 * Several different layout strategies are tried in order
119 * these enums define the # of strategies and the preference order
164 similar_hba_strategy_order_t order; local
166 for (order = CONCAT_WITHIN_SIMILAR_HBA;
167 (order < N_SIMILAR_HBA_STRATEGIES) &&
169 order++) {
174 switch (order) {
230 any_hba_strategy_order_t order; local
232 for (order = CONCAT_ACROSS_ANY_HBAS;
233 (order < N_ANY_HBA_STRATEGIES) &
    [all...]
  /onnv/onnv-gate/usr/src/common/zfs/
zprop_common.c 136 * A comparison function we can use to order indexes into property tables.
166 zprop_desc_t **order; local
173 order = kmem_alloc(size, KM_SLEEP);
175 if ((order = malloc(size)) == NULL)
180 order[j] = &prop_tbl[j];
183 qsort((void *)order, num_props, sizeof (zprop_desc_t *),
189 if ((order[i]->pd_visible || show_all) &&
190 (func(order[i]->pd_propnum, cb) != ZPROP_CONT)) {
191 prop = order[i]->pd_propnum;
197 kmem_free(order, size)
    [all...]

Completed in 1500 milliseconds

1 2 3 4 5 6 7 8 91011