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

1 2 3 4 5 6 7

  /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/common/openssl/crypto/bn/
bn_rand.c 229 /* random number r: 0 <= r < range */
230 static int bn_rand_range(int pseudo, BIGNUM *r, BIGNUM *range)
236 if (range->neg || BN_is_zero(range))
242 n = BN_num_bits(range); /* n > 0 */
244 /* BN_is_bit_set(range, n - 1) always holds */
248 else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3))
250 /* range = 100..._2,
251 * so 3*range (= 11..._2) is exactly one bit longer than range *
    [all...]
  /onnv/onnv-gate/usr/src/uts/common/io/
bofi.conf 48 # The 'bofi-range-check' property may be set to "panic", "warn" or "off".
54 bofi-range-check="panic";
  /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/lib/fm/topo/maps/SUNW,Sun-Fire-X4200-M2/
Sun-Fire-X4200-M2-disk-hc-topology.xmlgen 33 <range name='bay' min='0' max='3'>
64 <range name='disk' min='0' max='0'>
66 </range>
68 </range>
  /onnv/onnv-gate/usr/src/lib/fm/topo/maps/SUNW,Sun-Fire-X4200-Server/
Sun-Fire-X4200-Server-disk-hc-topology.xmlgen 33 <range name='bay' min='0' max='3'>
64 <range name='disk' min='0' max='0'>
66 </range>
68 </range>
  /onnv/onnv-gate/usr/src/lib/fm/topo/maps/SUNW,Sun-Fire-X4600-M2/
Sun-Fire-X4600-M2-disk-hc-topology.xmlgen 32 <range name='bay' min='0' max='3'>
63 <range name='disk' min='0' max='0'>
65 </range>
67 </range>
  /onnv/onnv-gate/usr/src/lib/fm/topo/maps/SUNW,Netra-X4200-M2/
Netra-X4200-M2-disk-hc-topology.xmlgen 32 <range name='bay' min='0' max='3'>
63 <range name='disk' min='0' max='0'>
65 </range>
67 </range>
  /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/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/common/tsol/
blabel.c 135 * be within a lower and upper bound (range).
138 * range = level range to compare against.
142 * Returns True if label is within the range,
149 blinrange(const m_label_t *label, const m_range_t *range)
151 return (BLDOMINATES((label), ((range)->lower_bound)) &&
152 BLDOMINATES(((range)->upper_bound), (label)));
160 _blinrange(const m_label_t *label, const brange_t *range)
162 return (BLINRANGE(label, range));
  /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/lib/libc/port/gen/
atexit.c 155 * of the array range to SIG_DFL.
158 _preexec_sig_unload(Lc_addr_range_t range[], uint_t count)
172 in_range(handler, range, count)) {
195 * the union of the ranges specified by the elements of the array range.
198 _preexec_atfork_unload(Lc_addr_range_t range[], uint_t count)
216 in_range(func, range, count)) ||
218 in_range(func, range, count)) ||
220 in_range(func, range, count))) {
256 * the union of the ranges specified by the elements of the array range.
261 _preexec_tsd_unload(Lc_addr_range_t range[], uint_t count
    [all...]
  /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/t/op/
pow.t 13 # 3**30 < 2**48, don't trust things outside that range on a Cray
65 my ($base, $max, $range) = @$pow;
69 within ($got, $expect, $range, "$base ** $n got[$got] expect[$expect]");
  /onnv/onnv-gate/usr/src/lib/libparted/common/lib/
regex.c 40 # define re_search(bufp, string, size, startpos, range, regs) \
41 __re_search (bufp, string, size, startpos, range, regs)
45 # define re_search_2(bufp, st1, s1, st2, s2, startpos, range, regs, stop) \
46 __re_search_2 (bufp, st1, s1, st2, s2, startpos, range, regs, stop)
  /onnv/onnv-gate/usr/src/lib/libparted/common/libparted/
unit.c 304 * is created in \p *range describing a 2 units large area centered on
305 * \p *sector. If the \p range as described here would be partially outside
314 PedGeometry** range)
316 return ped_unit_parse_custom (str, dev, default_unit, sector, range);
369 PedGeometry** range)
417 if (range)
418 *range = ped_geometry_new (dev, *sector, 1);
420 return !range || *range != NULL;
425 if (range)
    [all...]
  /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/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
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...]
  /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/lib/libcmd/common/
cut.c 126 register int range = 0; local
152 if(range)
154 --range;
155 if((n = (n==0?HUGE:n-range)) < 0)
156 error(ERROR_exit(1),"invalid range for c/f option");
157 *lp++ = range;
172 for(n=0,range= -2,dp=lp; *lp!=HUGE; lp+=2)
174 if(lp[0] <= range)
181 if((c = lp[0]+lp[1]-range)>0)
183 range += c
    [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...]
  /onnv/onnv-gate/usr/src/cmd/zinject/
zinject.h 58 int translate_record(err_type_t type, const char *object, const char *range,
  /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/libparted/common/include/parted/
unit.h 84 PedGeometry** range);
87 PedGeometry** range);
  /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...]

Completed in 601 milliseconds

1 2 3 4 5 6 7