HomeSort by relevance Sort by last modified time
    Searched defs:range (Results 1 - 25 of 84) sorted by null

1 2 3 4

  /onnv/onnv-gate/usr/src/lib/libbsm/common/
getdevicerange.c 38 * be used. If label range is not specified for the device in
49 blrange_t *range; local
52 if ((range = malloc(sizeof (blrange_t))) == NULL)
54 if ((range->lower_bound = blabel_alloc()) == NULL) {
55 free(range);
58 if ((range->upper_bound = blabel_alloc()) == NULL) {
59 blabel_free(range->lower_bound);
60 free(range);
66 * return its label range.
80 bsllow(range->lower_bound)
    [all...]
  /onnv/onnv-gate/usr/src/lib/pam_modules/tsol_acct/
tsol_acct.c 42 * Validates that the user's label range contains
64 m_range_t *range; local
103 if ((range = getuserrange(user)) == NULL) {
111 free_labels(range, NULL);
117 free_labels(range, plabel);
120 if (!blinrange(plabel, range)) {
121 free_labels(range, plabel);
125 free_labels(range, plabel);
  /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sbin/snoop/
snoop_zip.c 45 uint16_t range; local
152 range = get_short(&p[4]);
181 "Network number = %d-%d", net, range);
204 range = get_short(&p[4]);
  /onnv/onnv-gate/usr/src/cmd/mdb/common/modules/genunix/
dist.c 36 * Divides the given range (inclusive at both endpoints) evenly into the given
38 * the range. The returned buckets will be automatically freed when the dcmd
182 * Print one distribution bucket whose range is from distarray[i] inclusive to
183 * distarray[i + 1] exclusive by totalling counts in that index range. The
185 * Each bucket is labeled by its range in the form "first-last" (omit "-last" if
186 * the range is a single value) where first and last are integers, and last is
187 * one less than the first value of the next bucket range. The bucket label is
196 int b; /* bucket range index */
203 char range[40]; local
221 (void) mdb_snprintf(range, sizeof (range), "%d", bb)
    [all...]
  /onnv/onnv-gate/usr/src/cmd/ipf/tools/
ippool_y.y 83 %type <ipp> ipftree range addrlist
216 | range next addrlist { $1->ipn_next = $3; $$ = $1; }
217 | range next { $$ = $1; }
218 | range
285 range: addrmask { $$ = calloc(1, sizeof(*$$)); label
ipnat_y.y 107 %type <num> hexnumber compare range proto
647 | portspec range portspec { $$.pc = $2; $$.p1 = $1; $$.p2 = $3; }
769 range: label
811 { "range", IPNY_RANGE },
  /onnv/onnv-gate/usr/src/cmd/man/src/util/nsgmls.src/lib/
WinInetStorage.cxx 25 static UnivCharsetDesc::Range range = { 0, 128, 0 }; variable
26 static CharsetInfo iso646Charset(UnivCharsetDesc(&range, 1));
  /onnv/onnv-gate/usr/src/cmd/mms/mm/common/
mm_mmp_cp.c 629 int range = 0; /* all slots */ local
649 /* slot range */
660 range = 1;
804 if (range) { /* build lm scan cmd */
  /onnv/onnv-gate/usr/src/common/lzma/
LzmaDec.h 52 UInt32 range, code; member in struct:__anon1969
  /onnv/onnv-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
LogDistribution.java 37 * consecutive ranges, each twice as large as the previous range. Each
38 * range, known as a bucket, begins at two to the power of <i>n</i> and
46 * falls into its range. Buckets are typically identified by their
48 * negative ranges: -1, -2, -4, -8, etc. The range of an entire {@code
97 * expected range (bounded by consecutive powers of two)
107 * Gets a two element array: the first elelemt is the range minimum
108 * (inclusive), the second element is the range maximum (inclusive).
117 long[] range = new long[] {min, max}; local
118 return range;
149 * frequencies at the zero bucket (the bucket whose range has
    [all...]
Distribution.java 37 * range known as a bucket and counts toward the frequency of that
39 * bucket's range always one less than the minimum of the next bucket's
40 * range. By convention each bucket is identified by the minimum of its
41 * range.
66 * values falling into that bucket's range; each element must be a
70 * does not have the expected range as defined by checkBucketRange()
92 * does not have the expected range as defined by checkBucketRange()
139 * Gets a two element array: the first elelemt is the range minimum
140 * (inclusive), the second element is the range maximum (inclusive).
168 long[] range; // two element array: { min, max local
195 long[] range = getBucketRange(i, bucketCount, base, constant); local
202 long[] range = getBucketRange(i, bucketCount); local
    [all...]
LinearDistribution.java 38 * Each range, known as a bucket, begins at the {@code lquantize()}
103 * @param frequencies list of frequencies in each bucket range
107 * one, or if any bucket does not have the expected range
124 * Gets a two element array: the first elelemt is the range minimum
125 * (inclusive), the second element is the range maximum (inclusive).
148 long[] range = new long[] {min, max}; local
149 return range;
163 * bucket's range.
205 // minimum of the last bucket range, but that's how it's
228 * range has a minimum of zero
    [all...]
  /onnv/onnv-gate/usr/src/lib/libxcurses/h/
collate.h 82 m_collel_t *cindex, /* index to range table map */
83 *range; /* Range table */ member in struct:_m_cinfo
  /onnv/onnv-gate/usr/src/lib/libtsol/common/
misc.c 415 * getuserrange - get label range for user
431 m_range_t *range; local
438 if ((range = malloc(sizeof (m_range_t))) == NULL) {
441 if ((range->lower_bound = m_label_alloc(MAC_LABEL)) == NULL) {
442 free(range);
445 def_min = range->lower_bound;
446 if ((range->upper_bound = m_label_alloc(USER_CLEAR)) == NULL) {
447 m_label_free(range->lower_bound);
448 free(range);
451 def_clr = range->upper_bound
    [all...]
  /onnv/onnv-gate/usr/src/lib/libshell/common/bltins/
hist.c 50 int range[2], incr, index2, indx= -1; local
89 range[++indx] = flag;
139 range[++flag] = (int)strtol(arg, (char**)0, 10);
141 range[flag] += (hist_max(hp)-1);
148 if((range[++flag] = location.hist_command) < 0)
154 /* set default starting range */
163 range[0] = flag;
167 if(range[0]<index2)
168 range[0] = index2;
170 /* set default termination range */
    [all...]
  /onnv/onnv-gate/usr/src/uts/common/io/ixgbe/
ixgbe_gld.c 741 mac_propval_range_t range; local
837 range.mpr_count = 1;
838 range.mpr_type = MAC_PROPVAL_UINT32;
839 range.range_uint32[0].mpur_min = DEFAULT_MTU;
840 range.range_uint32[0].mpur_max = ixgbe->capab->max_mtu;
841 bcopy(&range, pr_val, sizeof (range));
  /onnv/onnv-gate/usr/src/cmd/avs/sdbc/
sd_stats.c 115 static char *range; variable
159 "[-d delay_time] [-l logfile] [-r range]");
181 range = malloc(100);
184 !rate_prev || !cs_cur || !cs_prev || !cs_persec || !range) {
189 *range = '\0';
221 range = realloc((char *)range,
222 (strlen(range) + strlen(optarg) + 1)
226 (void) strcat(range, ",");
227 (void) strcat(range, optarg)
    [all...]
  /onnv/onnv-gate/usr/src/cmd/diff/
diffh.c 44 #define RANGE 30
48 char *text[2][RANGE];
63 static void range(long a, int b);
86 if (nt >= RANGE)
184 for (i = j = 1; i < RANGE && j < RANGE; i++, j++) {
250 range(a, b);
252 range(c, d);
257 range(long a, int b) function
  /onnv/onnv-gate/usr/src/cmd/diff3/
diff3prog.c 55 struct range {int from, to; }; struct
57 * from is first in range of changed lines
62 struct diff {struct range old, new; };
111 static void change(int i, struct range *rold, int dup);
112 static void prange(struct range *rold);
113 static void keep(int i, struct range *rnew);
115 static int duplicate(struct range *r1, struct range *r2);
394 * the range of ines rold.from thru rold.to in file i
399 change(int i, struct range *rold, int dup
    [all...]
  /onnv/onnv-gate/usr/src/cmd/fmli/sys/
genfind.c 70 static int range(char *s, int origin, int *mindays, int *maxdays);
156 if (range(argv[i], origin, &min_days, &max_days) < 0) {
287 range(char *s, int origin, int *mindays, int *maxdays) function
  /onnv/onnv-gate/usr/src/cmd/lp/cmd/lpsched/
validate.c 328 /* Check printer label range */
601 * where the request is outside the printer label range.
1000 m_range_t *range; local
1012 if ((range = getdevicerange(printer)) == NULL) {
1017 /* blinrange returns true (1) if in range, false (0) if not */
1018 in_range = blinrange(sl, range);
1021 m_label_free(range->lower_bound);
1022 m_label_free(range->upper_bound);
1023 free(range);
  /onnv/onnv-gate/usr/src/lib/libc/amd64/unwind/
eh_frame.c 87 uint64_t range = 0; local
146 range = _Unw_get_val(&data, reloc, SIZE, 1, 1, code_enc);
147 if ((ctx->pc < func) || (ctx->pc > (func+range)))
150 ctx->range = range;
365 * Invariant -- if there is a containing range,
376 /* Return fde if tpc is in this range. */
unwind_context.h 51 uint64_t range; member in struct:_Unwind_Context
  /onnv/onnv-gate/usr/src/lib/libproc/common/
proc_arg.c 146 * Check to see if the user has supplied an lwp range. First,
308 proc_lwp_get_range(char *range, id_t *low, id_t *high)
310 if (*range == '-')
313 *low = (id_t)strtol(range, &range, 10);
315 if (*range == '\0' || *range == ',') {
319 if (*range != '-') {
322 range++;
324 if (*range == '\0'
362 char *range = (char *)set; local
396 char *range = (char *)set; local
    [all...]
  /onnv/onnv-gate/usr/src/uts/i86pc/io/acpi/acpidev/
acpidev_resource.c 483 acpidev_ranges_t range; local
485 range.child_hi = high;
486 range.child_mid = addrp->Minimum >> 32;
487 range.child_low = addrp->Minimum & 0xFFFFFFFF;
490 range.parent_hi = ACPIDEV_REG_TYPE_IO;
492 range.parent_hi = high;
495 range.parent_mid = paddr >> 32;
496 range.parent_low = paddr & 0xFFFFFFFF;
497 range.size_hi = addrp->AddressLength >> 32;
498 range.size_low = addrp->AddressLength & 0xFFFFFFFF
551 acpidev_ranges_t range; local
637 acpidev_ranges_t range; local
    [all...]

Completed in 1200 milliseconds

1 2 3 4