/barrelfish-2018-10-04/lib/openssl-1.0.0d/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.bak | 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
|
/barrelfish-2018-10-04/lib/int_route/msix_ctrl/ |
H A D | client.c | 11 int bound; member in struct:msix_ctrl_state 52 st->bound = true; 74 st->bound = false; 98 while(!st->bound) event_dispatch(get_default_waitset());
|
/barrelfish-2018-10-04/tools/usbboot/ |
H A D | misc.c | 19 u32 wait_on_value(u32 read_bit_mask, u32 match_value, u32 read_addr, u32 bound) argument 27 if (i == bound)
|
/barrelfish-2018-10-04/usr/block_server/ |
H A D | local_server.h | 39 uint32_t bound; member in struct:block_local_service
|
H A D | network_common.h | 99 uint32_t bound; member in struct:block_net_service
|
H A D | network_server.c | 120 c->bound++; 122 if (c->bound != 2) { 125 /* both channels are bound we can send a reply back */ 329 c->bound++; 331 BS_NET_DEBUG_BULK(" > Channel Connected. #conn=%i", c->bound); 333 if (c->bound != 2) { 408 c->bound = 0;
|
/barrelfish-2018-10-04/lib/dma/ |
H A D | dma_mgr_client.c | 30 uint8_t bound; member in struct:dma_mgr_bind_st 51 bindst->bound = 0x1; 59 bindst->bound = 0x1; 74 .bound = 0x0 84 while (st.bound == 0x0) {
|
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/ |
H A D | conjunto.pl | 44 constraints are delayed. They are activated each time a lower bound of 147 lower bound of one set variable involved is modified. 223 summary:"S is a set domain variable and Glb is the lower bound of its domain. 227 desc:html(" Glb is the ground set corresponding to the lower bound of the domain of 228 S. If Glb is a free variable, it is instanciated to the lower bound of 230 bound of the domain of S, otherwise it fails. 236 fail_if:" Fails if S is not a set domain variable or if Glb is a ground set not\n equal to the lower bound of S domain.\n\n", 310 summary:"S is a set domain variable and Lub is the lower bound of its domain. 314 desc:html(" Lub is the ground set corresponding to the upper bound of the domain of 315 S. If Lub is a free variable, it is instanciated to the upper bound o [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extconjunto.tex | 140 phase as soon as one domain lower bound $glb_s$ is not included in its 141 associated upper bound $lub_s$. Once a solved form has been reached 176 is added to the lower bound of the domain of {\em S}, otherwise the constraint is 177 delayed. If {\em E} is ground and does not belong to the upper bound 185 it is removed from the upper bound of {\em S}, otherwise the 187 bound of the domain of {\em S}, it is removed from the upper bound and 189 lower bound of {\em S} domain, it fails. 196 inclusion and succeeds or fails. If the lower bound of the domain of {\em 197 S} is not included in the upper bound o [all...] |
H A D | fdsets.tex | 59 set as their value. They are characterized by a lower bound (the set 60 of elements that are definitely in the set) and an upper bound (the 66 If the lower bound is the empty set (like in this case) this can be written as 70 If the lower bound is the empty set and the upper bound is a set of 99 \item the lower bound of the set
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/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 604 multi_split(BIO *bio, char *bound, STACK_OF(BIO) **ret) argument 912 mime_bound_check(char *line, int linelen, char *bound, int blen) argument [all...] |
/barrelfish-2018-10-04/lib/net/ |
H A D | net_filter.c | 43 filt->bound = true; 74 while(st->bound == false) { 183 assert(st->bound); 254 assert(st->bound);
|
/barrelfish-2018-10-04/usr/drivers/e1000/ |
H A D | e1000n_devq.h | 45 bool bound; member in struct:e1000_queue
|
/barrelfish-2018-10-04/include/net/ |
H A D | net_filter.h | 60 volatile bool bound; member in struct:net_filter_state
|
/barrelfish-2018-10-04/tools/usbboot/include/aboot/ |
H A D | aboot.h | 56 u32 wait_on_value(u32 read_bit_mask, u32 match_value, u32 read_addr, u32 bound);
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | branch_and_bound.pl | 31 :- comment(summary, "Generic branch-and-bound optimization"). 35 :- comment(index, ["branch-and-bound","dichotomic search","optimization"]). 37 This is a solver-independent library implementing branch-and-bound 118 must be invoked WITHIN bb_min/3. The branch-and-bound procedure 124 variable are important for efficiency, as they help the branch-and-bound 141 this uncertainty is too large, the branch-and-bound procedure may 209 % impose Opt as a lower bound, because there could be 213 % only if bound can't be imposed, instantiate instead 348 % found, the new cost bound gets imposed dynamically for the rest 350 % a demon that imposes the current global bound o [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | xml.pl | 38 * accepted than can be generated. Specifically, in-bound (Chars -> Document)
48 * Out-bound (Document -> Chars) parsing _does_ require that Document defines
56 * At this release, the Controls applying to in-bound (Chars -> Document)
77 * For out-bound (Document -> Chars) parsing, the only available option is:
|
H A D | random.pl | 57 % of List. What good this may be I'm not sure, and there's bound
|
/barrelfish-2018-10-04/lib/libc/regex/grot/ |
H A D | split.c | 199 int bound; local 201 bound = (nf > nfp) ? nfp : nf; 203 for (fn = 0; fn < bound; fn++)
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/rxspencer/ |
H A D | split.c | 200 register int bound; local 202 bound = (nf > nfp) ? nfp : nf; 204 for (fn = 0; fn < bound; fn++)
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | ic.c | 100 ** lo, % float: lower bound 101 ** hi, % float: upper bound 219 ** | RHS upper bound (double) | 223 ** | RHS lower bound (double) | 320 #define SHORT_LWB 1 /* set everything to their lower bound */ 321 #define SHORT_UPB 2 /* set everything to their upper bound */ 461 #define Constant_To_Lower_Bound(vc, tc, bound) \ 464 bound = Dbl(vc); \ 468 bound = IvlLwb(ivl.ptr); \ 471 #define Constant_To_Upper_Bound(vc, tc, bound) \ 905 ic_lwb(var_info *vi, double bound) argument 1023 double bound; local 1040 ic_upb(var_info *vi, double bound) argument 1158 double bound; local [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | extmeta.tex | 146 If \about{Var} is a free variable, it will be bound to a new attributed variable 151 it will be bound to \about{Attr}, otherwise the effect of this predicate 271 been bound to \about{Term}. 278 the bound term is in a domain described by the attribute. 285 bound 289 the attributed variable is bound (like a standard variable) to the other term 311 During the execution of the handler, the attributed variable may be bound 358 a free variable or if it was already bound to an attributed variable by a 394 to retrieve information about the lower and upper bound of a numeric 406 and upper bound o [all...] |