| /src/external/gpl3/gdb/dist/gnulib/import/ |
| getdtablesize.c | 75 The number N can also be obtained as the upper bound for
81 unsigned int bound; local
82 for (bound = 0x10000; _setmaxstdio_nothrow (bound) < 0; bound = bound / 2)
85 dtablesize = bound;
|
| /src/external/gpl3/gdb.old/dist/gnulib/import/ |
| getdtablesize.c | 75 The number N can also be obtained as the upper bound for
81 unsigned int bound; local
82 for (bound = 0x10000; _setmaxstdio_nothrow (bound) < 0; bound = bound / 2)
85 dtablesize = bound;
|
| /src/usr.sbin/mrouted/ |
| cfparse.y | 65 struct addrmask bound;
95 %type <addrmask> bound boundary addrmask
208 boundlist[numbounds++].bound = $3;
317 | BOUNDARY bound {
362 bound : boundary { $$ = $1; } label
367 $$ = boundlist[i].bound;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-loop.h | 54 widest_int max; /* The upper bound on the number of iterations of
60 Otherwise, the loop exits if CONTROL CMP BOUND is false, where CMP is one
64 tree bound; member in class:tree_niter_desc
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-loop.h | 54 widest_int max; /* The upper bound on the number of iterations of
58 CONTROL CMP BOUND is false, where CMP is one of NE_EXPR,
63 tree bound; member in class:tree_niter_desc
|
| /src/external/mit/isl/dist/ |
| isl_options.c | 39 static struct isl_arg_choice bound[] = { variable in typeref:struct:isl_arg_choice
122 ISL_ARG_CHOICE(struct isl_options, bound, 0, "bound", bound,
136 "coalesce-bounded-wrapping", 1, "bound wrapping during coalescing")
198 "ast-build-atomic-upper-bound", 1, "generate atomic upper bounds")
231 ISL_CTX_SET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, bound)
232 ISL_CTX_GET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, bound)
|
| bound.c | 59 isl_pw_qpolynomial_fold *bound; member in struct:verify_point_bound
70 isl_val *bound = NULL; local
103 bound = isl_pw_qpolynomial_fold_eval(
104 isl_pw_qpolynomial_fold_copy(vpb->bound),
123 ok = isl_val_eq(opt, bound);
125 ok = isl_val_le(opt, bound);
127 ok = isl_val_le(bound, opt);
142 p = isl_printer_print_val(p, bound);
163 isl_val_free(bound);
180 __isl_take isl_pw_qpolynomial_fold *bound, int exact
[all...] |
| isl_bound.c | 40 /* Add the bound "pwf", which is not known to be tight,
41 * to the output of "bound".
43 isl_stat isl_bound_add(struct isl_bound *bound,
46 bound->pwf = isl_pw_qpolynomial_fold_fold(bound->pwf, pwf);
47 return isl_stat_non_null(bound->pwf);
50 /* Add the bound "pwf", which is known to be tight,
51 * to the output of "bound".
53 isl_stat isl_bound_add_tight(struct isl_bound *bound,
56 bound->pwf_tight = isl_pw_qpolynomial_fold_fold(bound->pwf_tight, pwf)
88 struct isl_bound *bound = (struct isl_bound *)user; local
122 struct isl_bound *bound = (struct isl_bound *)user; local
196 struct isl_bound *bound = (struct isl_bound *)user; local
251 struct isl_bound *bound = (struct isl_bound *)user; local
262 struct isl_bound *bound = (struct isl_bound *)user; local
275 struct isl_bound *bound = (struct isl_bound *)user; local
302 struct isl_bound bound; local
[all...] |
| /src/sys/compat/common/ |
| if_43.c | 234 int bound = curlwp_bind(); local
238 curlwp_bindx(bound);
276 curlwp_bindx(bound);
285 curlwp_bindx(bound);
|
| uipc_syscalls_40.c | 45 int bound; local
66 bound = curlwp_bind();
156 curlwp_bindx(bound);
166 curlwp_bindx(bound);
|
| /src/sys/external/bsd/drm2/ttm/ |
| ttm_agp_backend.c | 52 bool bound; member in struct:ttm_agp
108 KASSERT(!ttm_agp->bound);
124 ttm_agp->bound = true;
143 if (!ttm_agp->bound)
150 ttm_agp->bound = false;
161 if (ttm_agp->bound)
|
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_legacy.h | 148 unsigned long bound; member in struct:drm_agp_mem
|
| /src/tests/lib/libc/regex/ |
| split.c | 227 int bound; local
229 bound = (nf > nfp) ? nfp : nf;
231 for (fn = 0; fn < bound; fn++)
|
| /src/sys/arch/alpha/alpha/ |
| mcclock.c | 129 int bound = curlwp_bind(); local
133 curlwp_bindx(bound);
135 curlwp_bindx(bound);
|
| /src/sys/rump/net/lib/libvirtif/ |
| if_virt.c | 384 int bound; local
388 bound = curlwp_bind();
390 curlwp_bindx(bound);
|
| /src/external/public-domain/xz/dist/src/liblzma/rangecoder/ |
| range_encoder.h | 177 const uint32_t bound = prob * (rc->range local
179 rc->low += bound;
180 rc->range -= bound;
|
| /src/sys/compat/linux32/common/ |
| linux32_socket.c | 427 int bound; local
444 bound = curlwp_bind();
489 curlwp_bindx(bound);
500 curlwp_bindx(bound);
|
| /src/sys/external/bsd/drm2/dist/drm/i915/selftests/ |
| i915_gem_evict.c | 53 unsigned long unbound, bound, count; local
80 bound = 0;
86 bound++;
90 GEM_BUG_ON(bound + unbound != count);
98 if (bound != count) {
99 pr_err("%s: Found %lu objects bound, expected %lu!\n",
100 __func__, bound, count);
|
| /src/sys/kern/ |
| subr_xcall.c | 58 * within a bound kthread. No queueing is provided, and the
265 int s, bound; local
270 bound = curlwp_bind();
275 curlwp_bindx(bound);
324 int s, bound; local
331 bound = curlwp_bind();
336 curlwp_bindx(bound);
|
| /src/sys/net/ |
| pfil.c | 411 int s, bound; local
425 bound = curlwp_bind();
430 curlwp_bindx(bound);
444 curlwp_bindx(bound);
457 int s, bound; local
461 bound = curlwp_bind();
472 curlwp_bindx(bound);
|
| rtsock.c | 283 int bound; local
307 bound = curlwp_bind();
391 curlwp_bindx(bound);
397 curlwp_bindx(bound);
|
| /src/sys/netinet6/ |
| in6_ifattach.c | 639 int bound = curlwp_bind(); local
647 curlwp_bindx(bound);
|
| mld6.c | 557 int bound; local
568 bound = curlwp_bind();
571 curlwp_bindx(bound);
583 curlwp_bindx(bound);
592 curlwp_bindx(bound);
1004 int bound, s; local
1011 bound = curlwp_bind();
1014 curlwp_bindx(bound);
1030 curlwp_bindx(bound);
1073 curlwp_bindx(bound);
[all...] |
| /src/external/bsd/openldap/dist/libraries/libldap/ |
| test.c | 287 int bound, all, scope, attrsonly; local
371 bound = 0;
426 bound = 1;
447 bound = 1;
|
| /src/external/gpl3/gdb/dist/sim/ppc/ |
| corefile.c | 35 unsigned_word bound; member in struct:_core_mapping
148 new_mapping->bound = addr + (nr_bytes - 1);
190 && next_mapping->bound < addr))) {
193 /* assert: next_mapping->bound >= all bounds before next_mapping */
290 && (addr + (nr_bytes - 1)) <= mapping->bound)
330 if (raddr + nr_bytes - 1> mapping->bound)
331 nr_bytes = mapping->bound - raddr + 1;
371 if (raddr + nr_bytes - 1 > mapping->bound)
372 nr_bytes = mapping->bound - raddr + 1;
|
