/freebsd-10.0-release/crypto/openssl/apps/ |
H A D | CA.pl | 175 my ($infile, $outfile, $bound) = @_; 180 $flag = 1 if (/^-----BEGIN.*$bound/) ; 182 if (/^-----END.*$bound/) {
|
H A D | CA.pl.in | 175 my ($infile, $outfile, $bound) = @_; 180 $flag = 1 if (/^-----BEGIN.*$bound/) ; 182 if (/^-----END.*$bound/) {
|
H A D | CA.sh | 35 bound=$3 40 echo $line|grep "^-----END.*$bound" 2>/dev/null 1>/dev/null 49 echo $line|grep "^-----BEGIN.*$bound" 2>/dev/null 1>/dev/null
|
/freebsd-10.0-release/contrib/gcc/ |
H A D | tree-ssa-loop-niter.c | 141 tree s, c, d, bits, assumption, tmp, bound; local 144 niter->bound = final; 176 bound = build_low_bits_mask (niter_type, 197 tmp = fold_build2 (MULT_EXPR, niter_type, c, inverse (s, bound)); 198 niter->niter = fold_build2 (BIT_AND_EXPR, niter_type, tmp, bound); 218 tree assumption = boolean_true_node, bound, noloop; local 233 bound = fold_build2 (MINUS_EXPR, type, 236 iv1->base, bound); 252 bound = fold_build2 (PLUS_EXPR, type, 255 iv0->base, bound); 286 tree bound, d, assumption, diff; local 354 tree assumption = boolean_true_node, bound, diff; local 1683 record_estimate(struct loop *loop, tree bound, tree additional, tree at_stmt) argument 1713 struct nb_iter_bound *bound; local 1948 tree bound = niter_bound->bound; local 2004 struct nb_iter_bound *bound; local 2087 struct nb_iter_bound *bound, *next; local [all...] |
H A D | tree-ssa-phiopt.c | 715 tree lhs, rhs, op0, op1, bound; local 741 r' = MAX_EXPR (smaller, bound) 749 bound = op1; 751 bound = op0; 757 bound, larger))) 766 r' = MIN_EXPR (larger, bound) 774 bound = op1; 776 bound = op0; 782 bound, smaller))) 800 r' = MIN_EXPR (smaller, bound) [all...] |
H A D | tree-ssa-loop-manip.c | 665 || contains_abnormal_ssa_name_p (niter->bound)) 695 tree bound = desc->bound; local 749 bound, 753 bound, 757 bound = fold_build2 (MINUS_EXPR, type, bound, delta); 758 assum = fold_build2 (cmp, boolean_type_node, base, bound); 778 bound = force_gimple_operand (unshare_expr (bound), [all...] |
H A D | loop-iv.c | 1992 rtx op0, op1, delta, step, bound, may_xform, tmp, tmp0, tmp1; local 2201 do it if we first check that upper bound is greater or equal to 2202 lower bound, their difference is constant c modulo step and that 2233 bound = simplify_gen_binary (PLUS, comp_mode, mmin, step); 2234 bound = simplify_gen_binary (MINUS, comp_mode, bound, delta); 2235 bound = lowpart_subreg (mode, bound, comp_mode); 2238 bound, tmp); 2241 bound, tm [all...] |
H A D | cfgloop.h | 46 /* The structure describing a bound on number of iterations of a loop. */ 50 tree bound; /* The constant expression whose value is an upper member in struct:nb_iter_bound 51 bound on the number of executions of ... */ 55 /* The next bound in a list. */ 118 /* Upper bound on number of iterations of a loop. */ 326 /* Upper bound on the number of iterations. */
|
/freebsd-10.0-release/contrib/xz/src/liblzma/rangecoder/ |
H A D | range_encoder.h | 177 const uint32_t bound = prob * (rc->range local 179 rc->low += bound; 180 rc->range -= bound;
|
/freebsd-10.0-release/sys/dev/drm2/ |
H A D | drm_agpsupport.c | 196 entry->bound = 0; 249 if (entry == NULL || !entry->bound) 257 entry->bound = 0; 289 if (entry == NULL || entry->bound) 298 entry->bound = dev->agp->base + (page << PAGE_SHIFT); 337 if (entry->bound)
|
/freebsd-10.0-release/crypto/openssl/crypto/asn1/ |
H A D | asn_mime.c | 103 static int mime_bound_check(char *line, int linelen, char *bound, int blen); 104 static int multi_split(BIO *bio, char *bound, STACK_OF(BIO) **ret); 283 char bound[33], c; local 299 RAND_pseudo_bytes((unsigned char *)bound, 32); 301 c = bound[i] & 0xf; 304 bound[i] = c; 306 bound[32] = 0; 313 bound, mime_eol, mime_eol); 317 BIO_printf(bio, "------%s%s", bound, mime_eol); 320 BIO_printf(bio, "%s------%s%s", mime_eol, bound, mime_eo 608 multi_split(BIO *bio, char *bound, STACK_OF(BIO) **ret) argument 923 mime_bound_check(char *line, int linelen, char *bound, int blen) argument [all...] |
/freebsd-10.0-release/sys/dev/drm/ |
H A D | drm_agpsupport.c | 231 entry->bound = 0; 284 if (entry == NULL || !entry->bound) 292 entry->bound = 0; 324 if (entry == NULL || entry->bound) 333 entry->bound = dev->agp->base + (page << PAGE_SHIFT); 372 if (entry->bound)
|
/freebsd-10.0-release/lib/libc/regex/grot/ |
H A D | split.c | 203 int bound; local 205 bound = (nf > nfp) ? nfp : nf; 207 for (fn = 0; fn < bound; fn++)
|
/freebsd-10.0-release/lib/libipsec/ |
H A D | ipsec_dump_policy.c | 176 ipsec_dump_ipsecrequest(buf, len, xisr, bound) 180 size_t bound; /* boundary */ 185 if (xisr->sadb_x_ipsecrequest_len > bound) {
|
/freebsd-10.0-release/sys/rpc/ |
H A D | rpc_generic.c | 705 int error, bound; local 713 bound = (((struct sockaddr_in *) sa)->sin_port != 0); 717 bound = (((struct sockaddr_in6 *) sa)->sin6_port != 0); 722 bound = (((struct sockaddr_un *) sa)->sun_path[0] != '\0'); 725 bound = FALSE; 731 return bound;
|
/freebsd-10.0-release/contrib/gdb/gdb/ |
H A D | ada-typeprint.c | 183 /* Print the number or discriminant bound at BOUNDS+*N on STREAM, and 184 set *N past the bound and its delimiter, if any. */ 200 char *bound = bounds + *n; 203 pend = strstr (bound, "__"); 205 *n += bound_len = strlen (bound); 208 bound_len = pend - bound; 211 fprintf_filtered (stream, "%.*s", bound_len, bound); 216 the value (if found) of the bound indicated by SUFFIX ("___L" or 199 char *bound = bounds + *n; local
|
H A D | valarith.c | 184 struct value *bound; 214 bound = value_from_longest (builtin_type_int, (LONGEST) lowerbound); 215 idx = value_sub (idx, bound); 183 struct value *bound; local
|
/freebsd-10.0-release/sys/dev/siba/ |
H A D | siba.c | 340 size_t i, bound; local 343 bound = sizeof(siba_devids) / sizeof(struct siba_devid); 345 for (i = 0; i < bound; i++, sd++) { 352 if (i == bound)
|
/freebsd-10.0-release/sys/sys/ |
H A D | rman.h | 144 u_long end, u_long count, u_long bound,
|
/freebsd-10.0-release/usr.sbin/rpcbind/ |
H A D | rpcbind.c | 254 int status; /* bound checking ? */ 258 int bound; local 347 bound = 0; 430 bound = 1; 474 if (!bound) 623 /* decide if bound checking works for this transport */ 665 * Create the list of addresses that we're bound to. Normally, this 692 * Match the sa against the list of addresses we've bound to. If 693 * we've not specifically bound to anything, we match everything.
|
/freebsd-10.0-release/contrib/gperf/src/ |
H A D | search.cc | 184 /* Computes the upper bound on the indices passed to asso_values[], 497 /* Computes the upper bound on the indices passed to asso_values[]. */ 850 /* Given the bound for _asso_values[c], we have a bound for the possible 948 /* Exclusive upper bound for the _asso_values[c] of this step. 1346 for (bound = 0,1,...) 1348 iter[ii] := bound 1349 iter[0..ii-1] := values <= bound 1350 iter[ii+1..k-1] := values < bound 1356 unsigned int bound local [all...] |
/freebsd-10.0-release/sys/contrib/xz-embedded/linux/lib/xz/ |
H A D | xz_dec_lzma2.c | 499 uint32_t bound; local 503 bound = (rc->range >> RC_BIT_MODEL_TOTAL_BITS) * *prob; 504 if (rc->code < bound) { 505 rc->range = bound; 509 rc->range -= bound; 510 rc->code -= bound;
|
/freebsd-10.0-release/sys/kern/ |
H A D | kern_ktrace.c | 243 int bound; local 246 bound = newsize - oldsize; 247 if (bound == 0) 249 if (bound < 0) { 252 while (bound++ < 0) { 263 while (bound-- > 0) {
|
/freebsd-10.0-release/crypto/heimdal/lib/roken/ |
H A D | socket_wrapper.c | 219 int bound; member in struct:socket_info 1327 child_si->bound = 1; 1464 si->bound = 1; 1489 if (si->bound == 0) { 1547 si->bound = 1; 1682 if (si->bound == 0) { 1850 si_newd->bound = si_oldd->bound;
|
/freebsd-10.0-release/sys/dev/ctau/ |
H A D | ctddk.c | 306 unsigned long bound; local 315 bound = ((c->tdphys[0] + 0xffff) & ~(0xffffUL)); 316 if (bound < c->tdphys[0] + 2*NBUF*sizeof(ct_desc_t)) { 318 (bound - c->tdphys[0])); 319 c->tdphys[0] = bound;
|