Searched defs:order (Results 1 - 25 of 69) sorted by relevance

123

/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/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/lib/libdscfg/common/
H A Dcfg_lockd.h47 int32_t order; member in struct:lock_msg
/illumos-gate/usr/src/cmd/ypcmd/
H A Dypserv_map.c63 * The retrieves the order number of a named map from the order number datum
67 ypget_map_order(char *map, char *domain, uint_t *order) argument
90 * follow the order number characters, nor whether
96 *order = (unsigned long) atol(toconvert);
/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-priv.h176 mp_int order; member in struct:ECGroupStr
/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) {
H A Dacctprc.c155 void print_node(const void *node, VISIT order, int level) { argument
157 if (order == postorder || order == leaf) {
/illumos-gate/usr/src/lib/libslp/clib/
H A DSLPFindSrvTypes.c260 static void collect_types(void *node, VISIT order, int level, void *cookie) { argument
263 if (order == endorder || order == leaf) {
H A Dslp_da_cache.c205 static void free_cache_entry(void *node, VISIT order) { argument
206 if (order == endorder || order == leaf) {
/illumos-gate/usr/src/uts/common/io/sfxge/
H A Dsfxge_intr.c489 unsigned int order = 1; local
491 while ((1ul << order) <= n) ++order;
492 return (1ul << (order - 1));
/illumos-gate/usr/src/boot/lib/libz/
H A Dinfback.c269 static const unsigned short order[19] = /* permutation of code lengths */ local
380 state->lens[order[state->have++]] = (unsigned short)BITS(3);
384 state->lens[order[state->have++]] = 0;
H A Dinflate.c560 PULLBYTE() directly in order to pull just enough bytes to decode the next
587 during that inflate() call in order to return the proper return code.
625 static const unsigned short order[19] = /* permutation of code lengths */ local
918 state->lens[order[state->have++]] = (unsigned short)BITS(3);
922 state->lens[order[state->have++]] = 0;
1346 found in order so far, in 0..3. On return *have is updated to the new
/illumos-gate/usr/src/lib/fm/topo/modules/i86pc/chip/
H A Dchip_label.c166 * order: "reverse" or "forward" - sets the direction of the correlation
176 char *fmtstr, *order, buf[BUFSZ]; local
200 if ((ret = nvlist_lookup_string(args, "order", &order)) != 0) {
201 topo_mod_dprintf(mod, "Failed to lookup 'order' arg (%s)\n",
207 topo_mod_free(mod, order, BUFSZ);
214 if (strcasecmp(order, "forward") == 0)
218 else if (strcasecmp(order, "reverse") == 0)
224 topo_mod_dprintf(mod, "Invalid value for order arg\n");
225 topo_mod_free(mod, order, BUFS
262 char *fmtstr, *order, buf[BUFSZ]; local
[all...]
/illumos-gate/usr/src/lib/libctf/common/
H A Dctf_lib.c155 * In order to mmap a section from the ELF file, we must round down sh_offset
255 uchar_t order = ELFDATA2MSB; local
257 uchar_t order = ELFDATA2LSB;
265 if (hdr.e32.e_ident[EI_DATA] != order)
/illumos-gate/usr/src/lib/libproc/common/
H A Dproc_arg.c82 uchar_t order = ELFDATA2MSB; local
84 uchar_t order = ELFDATA2LSB;
103 ehdr.e_ident[EI_DATA] != order)
/illumos-gate/usr/src/lib/libcmd/common/
H A Dcksum.c38 " \batt\b method is a true sum, all others are order dependent.]"
420 * order child entries
424 order(FTSENT* const* f1, FTSENT* const* f2) function
496 state.sort = order;
/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/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/cmd/audio/utilities/
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/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/uts/common/zmod/
H A Dinflate.c516 PULLBYTE() directly in order to pull just enough bytes to decode the next
543 during that inflate() call in order to return the proper return code.
581 static const unsigned short order[19] = /* permutation of code lengths */ local
877 state->lens[order[state->have++]] = (unsigned short)BITS(3);
881 state->lens[order[state->have++]] = 0;
1258 found in order so far, in 0..3. On return *have is updated to the new
/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...]

Completed in 1053 milliseconds

123