/barrelfish-master/usr/eclipseclp/ecrc_solvers/ |
H A D | r.pl | 128 :- local struct(lin(dg, constr, rhs, pvar, dead, user)). 403 % wanted or needed, the dead flag should be set before doing 418 linear_unify(Val, lin with [dg:DG, rhs:Rhs, constr:Constr, dead:Dead]) :- 479 update(V, lin with [dead:Dead], []) :- 481 Dead = dead, 483 update(V, lin with [dead:Dead,pvar:Pvar], [mono(C1,V1)]) :- 493 Dead = dead,
|
/barrelfish-master/usr/eclipseclp/Kernel/src/ |
H A D | term_copy.c | 198 int dead; local 293 dead = SuspDead(arg_pw); 308 if (dead) 943 /* A dead suspension is ground, no need to copy it. */
|
/barrelfish-master/include/vm/ |
H A D | vm_fault.c | 288 boolean_t dead, growstack, is_first_object_locked, wired; local 438 * with us. Otherwise, if we see terminally dead 442 dead = fs.object->type == OBJT_DEAD; 444 if (dead)
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | umsstyle.tex | 90 \item The final code may not contain \Index{dead code} except in the
|
H A D | exthsusp.tex | 943 or executed (dead). 983 \defnotionni{dead}\index{dead suspension}\index{suspension!dead} 1002 'SUSP-_78-dead' & dead suspension with id _78 \\ 1006 'SUSP-123-dead' & dead suspension with id invocation number 123 \\
|
/barrelfish-master/usr/eclipseclp/documents/search/ |
H A D | search.tex | 1400 values. If a dead-end is reached, 1406 combination of values lead to a dead-end, and will not be tried again in 1516 choice-point. Thus, when a dead-end is reached in labelling values, a 1528 % hit dead-end and failed, try again from start after recording nogoods 1540 fail if the labelling hits a dead-end and fails. In this case, the second 1551 dead-end, so that it will not be removed by the backtracking. The problem is 1581 To remember the current labellings when a dead-end is reached, so that a
|
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/ |
H A D | kernel.tex | 946 runtime modification and garbage collection of dead clauses. 1942 \caption{The suspension descriptor (live and dead)} 1954 \item[X (dead-flag)] indicates that the goal is dead. 1967 When the suspension is dead, then the descriptor may be partially 1983 in these lists. however, dead suspensions are removed opportunistically 1984 when a lists is traversed for the purpose of scheduling, and dead
|
/barrelfish-master/lib/openssl-1.0.0d/ssl/ |
H A D | ssl_ciph.c | 216 int dead; member in struct:cipher_order_st
|
/barrelfish-master/usr/eclipseclp/lib_tcl/ |
H A D | tkinspect.tcl | 636 dead { 890 $tkinspectvalues(deadimage) {dead suspension}\
|
/barrelfish-master/usr/eclipseclp/icparc_solvers/ech/ |
H A D | ech.pl | 1944 performs some clean up (removal of dead suspensions) from SuspLIn. 2334 ; ordered_merge(L0, L11, L) % throw away dead suspension 2336 ; ordered_merge(L00, L1, L) % throw away dead suspension
|
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | tracer_tcl.pl | 667 ; Type = dead 729 (Susp == suspended ; Susp == scheduled ; Susp == dead), !,
|
H A D | suspend.pl | 185 true % dead suspension
|
/barrelfish-master/doc/006-routing/ |
H A D | Routing.tex | 177 Those additional channels are needed to ensure that the default monitor binding is not congested or even blocked by multi-hop messages. For example, suppose that a client's dispatcher receives a lot of multi-hop messages within a short period of time. The client reacts to this by allocating more memory. If multi-hop messages are sent over the default monitor binding, the message coming from the memory server will be blocked, therefore this will result in a dead lock. By creating new monitor bindings and not using the default monitor binding, we can prevent such a scenario.
|
/barrelfish-master/usr/eclipseclp/documents/applications/ |
H A D | tutorial.tex | 1953 \item The final code may not contain dead code\index{dead code} except in the file/module unsupported.ecl. This file should contain all program pieces which are kept for information/debugging, but which are not part of the deliverable.
|
/barrelfish-master/usr/eclipseclp/documents/intro_paper/ |
H A D | eclipse.tex | 2511 When such a dead-end is encountered, the weak commitment algorithm
|