Searched refs:lower (Results 1 - 25 of 91) sorted by relevance

1234

/barrelfish-master/tools/harness/
H A Dreprocess.py65 if t.name.lower() == testname.lower():
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/
H A Dilog.cc240 IlcInt lower = v.getNextLower(last); local
241 if (lower == last - 1) {
242 last = lower;
245 max = lower; last = lower;
/barrelfish-master/lib/libc/db/btree/
H A Dbt_split.c208 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {
220 h->lower += sizeof(indx_t);
349 r->lower = BTDATAOFF;
370 r->lower = BTDATAOFF + sizeof(indx_t);
385 l->lower = BTDATAOFF;
453 l->lower = r->lower = BTDATAOFF;
493 h->lower = BTDATAOFF + 2 * sizeof(indx_t);
569 h->lower = BTDATAOFF + 2 * sizeof(indx_t);
585 * l: page to put lower hal
[all...]
H A Dbt_conv.c78 M_16_SWAP(h->lower);
184 M_16_SWAP(h->lower);
H A Dbt_put.c201 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {
211 h->lower += sizeof(indx_t);
282 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t))
H A Dbt_debug.c179 (void)fprintf(stderr, " lower %3d upper %3d nextind %d\n",
180 h->lower, h->upper, top);
263 ifree += h->upper - h->lower;
268 lfree += h->upper - h->lower;
H A Dbtree.h78 indx_t lower; /* lower bound of free space on page */ member in struct:_page
87 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))
H A Dbt_overflow.c153 h->lower = h->upper = 0;
H A Dbt_open.c354 if (root->lower == 0 &&
378 root->lower = BTDATAOFF;
H A Dbt_delete.c411 pg->lower = BTDATAOFF;
433 pg->lower -= sizeof(indx_t);
498 h->lower -= sizeof(indx_t);
/barrelfish-master/tools/pyaquarium/
H A Dtrace_parser.py30 dct['_evname'] = name.lower()
31 clsname = "EventType"+camelize(name.lower())
43 self._name = events.get("name").lower()
89 key = elems[1].lower()
/barrelfish-master/lib/cxx/cxx/
H A Dregex.cpp207 {"lower", ctype_base::lower},
248 r |= ctype_base::alnum | ctype_base::upper | ctype_base::lower;
251 if (r & (ctype_base::lower | ctype_base::upper))
H A Dlocale.cpp765 const ctype_base::mask ctype_base::lower; member in class:ctype_base
1081 punct | print, lower | xdigit | print | alpha,
1082 lower | xdigit | print | alpha, lower | xdigit | print | alpha,
1083 lower | xdigit | print | alpha, lower | xdigit | print | alpha,
1084 lower | xdigit | print | alpha, lower | print | alpha,
1085 lower | print | alpha, lower | prin
[all...]
/barrelfish-master/usr/eclipseclp/ecrc_solvers/
H A Dconjunto.pl44 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
229 the domain of S. If it is a ground set, it should be equal to the lower
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.
344 upper bound and the lower bound and which has the greatest weight. If
375 Svar. If Svar is a set domain variable, its new lower o
[all...]
/barrelfish-master/lib/libc/db/recno/
H A Drec_delete.c184 h->lower -= sizeof(indx_t);
H A Drec_put.c253 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {
263 h->lower += sizeof(indx_t);
/barrelfish-master/tools/ds5/configdb/OS/Barrelfish/
H A Dprovider.py139 return regs[name.lower()
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dextconjunto.tex140 phase as soon as one domain lower bound $glb_s$ is not included in its
176 is added to the lower bound of the domain of {\em S}, otherwise the constraint is
189 lower bound of {\em S} domain, it fails.
196 inclusion and succeeds or fails. If the lower bound of the domain of {\em
383 \verb/max_weight(Sub, X),/ and by adding it to the lower bound of the set
526 element to its lower bound. In the \verb/subset-sum/ example the
594 the lower bound of the set domain is updated.
631 If {\em Svar} is a set domain variable, it returns the lower and upper
637 If {\em Svar} is a set domain variable, it returns the lower bound of
657 bound and the lower boun
[all...]
H A Dfdsets.tex59 set as their value. They are characterized by a lower bound (the set
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
114 Lwb and Upb are the current lower and upper bounds on Set
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Dchangeset.pl73 change its lower bound, therefore [1] was appended to the Changes list.
74 Then X2 #>= 5 raised the lower bound of X2 and (because X1 #> X2)
75 the lower bound of X1, therefore both variable indices [1,2] were
78 The priority of the monitor should be set up such that is is lower than
H A Deplex_relax.pl74 % parts; the "upper" part and the "lower" part. These are computed
77 % maintaining the upper and lower convex hulls of the points processed so
80 % above the lower one). These are always the most recent points to have
100 % lists of the points on the upper and lower hulls and lists of the
121 % lower priority than propagate_hull/6
156 update_hull_constraints(lower, Pool, X, Y, LHullPoints, NewLHullPoints,
339 % If (the lower bound of) this segment slopes downwards and
341 % the lower hull.
395 % If (the lower bound of) this segment slopes upwards and
397 % the lower hul
[all...]
/barrelfish-master/tools/harness/tests/
H A Dblk_tests.py260 operation = self.OP.lower()
/barrelfish-master/usr/drivers/enet/
H A Denet_module.c405 uint64_t lower = enet_palr_paddr1_rdf(st->d); local
407 // this is weird lower seems to be the upper part of the address ..
408 uint64_t mac = (lower << 16) | upper;
417 uint64_t lower = st->mac >> 16; local
420 enet_palr_paddr1_wrf(st->d, lower);
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dcolgen.tex188 fromto(Ids, [demand(Li)|IRest], IRest, [lower, upper]),
209 % master problem initial lower and upper bound constraints
212 lower),
240 fromto(Ids, [Id|IRest], IRest, [lower, upper]),
243 fromto(Soln, [Id-Var|SRest], SRest, [lower-1, upper-1])
/barrelfish-master/usr/eclipseclp/Contrib/
H A Dintervals.pl56 bound of I1 is less than the lower bound of I2. This ordering
60 bound of I1 is at least 2 less than the lower bound of I2.
268 I.e. the upper bound of I1 is at least 2 less than the lower bound of I2.
464 /* A1 greater than lower end of I. */
472 /* A1 overlaps lower end of I. */

Completed in 203 milliseconds

1234