Searched refs:order (Results 1 - 25 of 130) sorted by relevance

123456

/illumos-gate/usr/src/cmd/audio/utilities/
H A DFir.cc93 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
[all...]
H A DResample.cc62 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, // filte
61 sinc_coef(int fold, int order, double *coef) argument
99 poly_conv(double *coef, int order, int inc_coef, double *data, int length) argument
[all...]
/illumos-gate/usr/src/lib/libc/i386/gen/
H A Dbyteorder.s44 / reverses the byte order of 'long hl'
48 bswap %eax / reverses the byte order of %eax
54 bswap %eax / reverses the byte order of %eax
61 / reverses the byte order in hs.
65 bswap %eax / reverses the byte order of %eax
72 bswap %eax / reverses the byte order of %eax
83 bswap %eax / reverses the byte order of %eax
94 bswap %eax / reverses the byte order of %eax
105 bswap %eax / reverses the byte order of %eax
112 bswap %eax / reverses the byte order o
[all...]
/illumos-gate/usr/src/cmd/fs.d/
H A Dfssnapsup.c84 * 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,
208 fssnap_display_info(ulong_t snapnum, int *order, int labels) argument
[all...]
/illumos-gate/usr/src/lib/libnsl/yp/
H A Dyp_order.c58 yp_order(char *domain, char *map, unsigned long *order) argument
73 (order == NULL))
84 order);
107 struct timeval timeout, unsigned long *order)
134 *order = (unsigned long)resp.ordernum;
106 doorder(char *domain, char *map, struct dom_binding *pdomb, struct timeval timeout, unsigned long *order) argument
/illumos-gate/usr/src/common/crypto/ecc/
H A Decl.c78 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,
101 ECGroup_consGFp(const mp_int *irr, const mp_int *curvea, const mp_int *curveb, const mp_int *genx, const mp_int *geny, const mp_int *order, int cofactor) argument
142 ECGroup_consGFp_mont(const mp_int *irr, const mp_int *curvea, const mp_int *curveb, const mp_int *genx, const mp_int *geny, const mp_int *order, int cofactor) argument
186 ECGroup_consGF2m(const mp_int *irr, const unsigned int irr_arr[5], const mp_int *curvea, const mp_int *curveb, const mp_int *genx, const mp_int *geny, const mp_int *order, int cofactor) argument
232 mp_int irr, curvea, curveb, genx, geny, order; local
[all...]
H A Decl_curve.c119 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, strle
[all...]
/illumos-gate/usr/src/lib/udapl/udapl_tavor/amd64/
H A Damd64.il32 / Device registers are in Big Endian byte order, so use bswap* instructions.
/illumos-gate/usr/src/lib/udapl/udapl_tavor/i386/
H A Di386.il32 / Device registers are in Big Endian byte order, so use bswap instructions.
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/
H A Dsvc-sockfilter38 order=`svcprop -p socket-filter/order_hint $SMF_FMRI 2>/dev/null`
41 /sbin/soconfig -F $filter_name $mod_name $type $order $socktups
/illumos-gate/usr/src/test/util-tests/tests/libnvpair_json/
H A Djson_07_nested_arrays.ksh45 {"order":["a","b","c","d"]}\
91 add_string_array "order" "a" "b" "c" "d";
/illumos-gate/usr/src/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);
/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DLogLinearDistribution.java24 * action. Aggregated values are aggregated logarithmicly by order of
26 * llquantize()} action, but linearly within each order of magnitude bounded
126 int order, bucket = 0;
136 for (order = 0; order < low; order++)
148 while (order <= high) {
158 order++;
/illumos-gate/usr/src/boot/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)
/illumos-gate/usr/src/lib/libdscfg/common/
H A Dcfg_lockd.h47 int32_t order; member in struct:lock_msg
/illumos-gate/usr/src/cmd/audio/include/
H A DFir.h41 * 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
[all...]
/illumos-gate/usr/src/cmd/avs/dscfglockd/
H A Ddscfglockd.c89 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) argument
260 (order == the_lock.remote_daemon->order));
307 message_buf.order = order;
356 daemon_alive(daemonaddr_t *daemon, int32_t order) argument
365 ldp->order
812 remote_unlock(int32_t order, daemonaddr_t *d) argument
[all...]
/illumos-gate/usr/src/uts/common/io/drm/
H A Ddrm_bufs.c50 * Compute order. Can be made faster.
55 int order = 0; local
59 order ++;
61 if (size & ~(1 << order))
62 ++order;
64 return (order);
404 int order; local
415 order = drm_order(request->size);
416 size = 1 << order;
420 page_order = order
512 int order; local
597 int order, ret; local
633 int order, ret; local
[all...]
/illumos-gate/usr/src/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...]
/illumos-gate/usr/src/cmd/lvm/metassist/layout/
H A Dlayout_concat.c82 * 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_STRATEGIE
[all...]
/illumos-gate/usr/src/cmd/sgs/error/common/
H A Derrorfilter.c135 int order; local
141 if ((order = strcmp(key, names_ignored[halfway])) == 0)
143 if (order < 0) /* key is less than probe, throw away above */
H A Derrormain.c95 * -E: show the errors in sorted order; intended for
98 * -S: show the errors in unsorted order
289 int order; local
307 order = strcmp(ep1->error_text[0], ep2->error_text[0]);
308 if (order == 0) {
311 return (order);
/illumos-gate/usr/src/cmd/acct/
H A Dacctprc2.c34 * sorts in uid/name order, writes tacct.h records to output
129 void print_node(const void *node, VISIT order, int level) { argument
130 if (order == postorder || order == leaf) {
/illumos-gate/usr/src/cmd/sgs/rtld/i386/
H A DMakefile59 MAPFILE-ORDER = ../common/mapfile-order-devpro
60 $(__GNUC)MAPFILE-ORDER = ../common/mapfile-order-gcc
/illumos-gate/usr/src/cmd/tnf/prex/
H A Dlist.c95 static void printattrs(const void *node, VISIT order, int level);
96 static void printvals(const void *node, VISIT order, int level);
449 VISIT order,
454 if (order == postorder || order == leaf) {
468 VISIT order,
473 if (order == postorder || order == leaf)
448 printattrs(const void *node, VISIT order, int level) argument
467 printvals(const void *node, VISIT order, int level) argument

Completed in 94 milliseconds

123456