/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probe_support.pl | 86 iddiff returns a list of variables occurring in the first list 182 tentative values change, and the other to kill the first demon
|
H A D | make_overlap_bivs.pl | 38 task, if the second task is in progress at the start of the first task. 40 records the amount of resource in use at the time the first task starts.
|
H A D | probe_support.pl | 85 iddiff returns a list of variables occurring in the first list 181 tentative values change, and the other to kill the first demon
|
H A D | ic_probe_search.pl | 100 It first tries forcing the first 104 to force the second task to start after the first. 135 find_bottleneck first of all chooses the bottleneck tasks. These are
|
H A D | probe_search.pl | 101 It first tries forcing the first 105 to force the second task to start after the first. 136 find_bottleneck first of all chooses the bottleneck tasks. These are
|
/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | route_tree_radix.pl | 14 % make groups of numbers to be able to do a breadth-first search
|
H A D | multicast.pl | 26 % sanity check: Check first that we have all the necessary information
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | wm.c | 307 w->first = 1; 312 w->first = 0; 1961 /* first set up the b-layer */ 2079 int bproc_create(hostname,slave_no,lsession_key,first,argc,argv) 2083 int first; 2123 slave_argv[6] = first == 1 ? "-m" : "-c"; 2153 slave_argv[9] = first == 1 ? "-m" : "-c"; 2418 print_worker_command(worker_index,(new_worker->first? "-m" : "-c"), 2424 new_worker->first,argc,argv); 2547 print_worker_command(w->index,w->first [all...] |
H A D | lex.c | 374 Get_Ch_Class(cc, ctype); /* read first character */ 1712 int first; local 1713 Get_Ch(c) /* first after point */ 1721 first = c; 1724 if (first == '0' || first == '5')
|
/barrelfish-2018-10-04/lib/libc/isc/ |
H A D | eventlib_p.h | 163 evWait * first; member in struct:evWaitList
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | lips.pl | 66 list as the first and a variable as the second argument. This
|
H A D | heaps.pl | 11 % The work of producing them in the first place and of 48 want to do say a best-first search, and have no idea when you start 85 Key it is not defined which of them will come out first, and it 86 is possible for any of them to come out first depending on the
|
H A D | kernel_bips.pl | 362 % sorting the list first is not necessary, but likely to reduce 382 Result = [Elem|Res0], % replace first instance
|
H A D | linearize.pl | 36 % The first (constant) term is always present, Ci (i>=1) are nonzero. 89 The first (constant) term is always present, Ci (i>=1) are nonzero. 140 The first (constant) term is always present, Ci (i>=1) are nonzero. 303 %% expressions replaced by temporaries (as given in the first 408 % In a normalised monomial, the list is sorted, the first element is 448 In a <EM>normalised monomial</EM>, the list is sorted, the first element is 699 sort(0, >=, Xs, XsSorted), % constants first, then variables
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | extsuspend.tex | 280 Note also that the scan stops at the first variable being compared 293 and the first 10000 elements are ground, we spend most of our time 336 for \predspec{diff_pairs/2} which fails if its first 403 Now we can see that compound terms are processed up to the first 419 When a variable in the first pair is bound, the search proceeds 487 each suspension will include two additional variables, the first 491 The first variable of the first suspension is instantiated
|
H A D | umscompiler.tex | 392 the compiler first erases previous contents of this module, 459 The first two 638 %The predicate generates the object code by first compiling the program and 852 as its first argument, and is expected to return a replacement goal 884 then the first call to double will be replaced by \notation{Y~=~24} while the 931 \emph{Try the simple and straightforward solution first!} 984 The standard approach is to index only on the first argument.} 986 arguments so that the first one is the crucial argument 997 calls where the first argument is instantiated, like \notation{p(d,Y)}, will be 998 indexed on the first argumen [all...] |
H A D | umsintro.tex | 141 %when the user types the first characters of 162 %\index{depth-first iterative deepening} 165 %because they omit the occur check and use only the depth-first 168 %the occur check and for the depth-first iterative deepening search rule. 322 %called for the first time.
|
H A D | umsopsys.tex | 58 argument in string form. If the first argument of \predspec{argv/2} is the atom 128 The first figure (user cpu time) is the same as given by 191 characters inside the brackets unless the first one is a \verb:^:, 264 fork a new process and execute the command given as the first argument. 337 We first create the process with two pipes for the child's standard input
|
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/propia/ |
H A D | zebra.pl | 5 "Five men with different nationalities live in the first five houses 14 The Norwegian lives in the first house on the left.
|
/barrelfish-2018-10-04/doc/015-disk-driver-arch/ |
H A D | running.tex | 18 code is required. A first workaround is needed for finding the \ac{ahci} 79 first need to copy the map into a larger buffer. The memory map is then sorted
|
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/ |
H A D | TOUR.tcl | 126 -list {{first choice} {second} {another choice} {final choice}}]
|
/barrelfish-2018-10-04/usr/monitor/ |
H A D | inter.c | 185 struct intermon_binding *b, bool first) 202 if (first) { 219 struct intermon_binding *b, bool first) 234 capid, your_mon_id, b, first); 181 cap_receive_request_enqueue(struct monitor_binding *domain_binding, uintptr_t domain_id, errval_t msgerr, struct capref cap, uint32_t capid, uintptr_t your_mon_id, struct intermon_binding *b, bool first) argument 215 cap_receive_request_cont(struct monitor_binding *domain_binding, uintptr_t domain_id, errval_t msgerr, struct capref cap, uint32_t capid, uintptr_t your_mon_id, struct intermon_binding *b, bool first) argument
|
/barrelfish-2018-10-04/lib/libc/regex/ |
H A D | regcomp.c | 319 int first = 1; /* is this the first alternative? */ local 331 if (first) { 335 first = 0; 344 if (!first) { /* tail-end fixups */ 531 * This implementation is a bit of a kludge, in that a trailing $ is first 537 int end1, /* first terminating character */ 541 int first = 1; /* first subexpression? */ local 550 wasdollar = p_simp_re(p, first); [all...] |
/barrelfish-2018-10-04/lib/lua/src/ |
H A D | lparser.c | 44 short firstlabel; /* index of first label in this block */ 45 short firstgoto; /* index of first pending goto in this block */ 1063 return op; /* return first untreated operator */ 1363 varname = str_checkname(ls); /* first variable name */ 1476 luaK_fixline(ls->fs, line); /* definition `happens' in the first line */ 1500 int first, nret; /* registers with returned values */ local 1502 first = nret = 0; /* return no values */ 1511 first = fs->nactvar; 1516 first = luaK_exp2anyreg(fs, &e); 1519 first [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extchr.tex | 101 \chrs\ as formulas of first order logic 265 %Like clauses, \chrs\ can be read as formulas in first order logic. A 312 {\em adds} the body. A firing simpagation rule keeps the first head 319 \eclipse\ will first solve the built-in constraints, 356 for a firing simpagation rule, except that the first head is kept. If 460 \noindent{\bf Example, contd.:} The first lines of the minmax handler are 544 constraint is the only goal of the body or the first goal in the 703 \chrs\ can also be found by first considering 789 if-then-else can be used if their first arguments are either {\em 823 This happens if a user-defined constraint is called for the first tim [all...] |