Searched refs:handle (Results 251 - 275 of 288) sorted by relevance

<<1112

/barrelfish-master/doc/015-disk-driver-arch/
H A Dlibahci.tex46 \begin{lstlisting}[caption={DMA region handle},label=code:reghandle]
/barrelfish-master/doc/023-coreboot/
H A Dcoreboot.tex76 device and hot-plug management infrastructure to handle new cores and select
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex102 The book ``The Craft of Prolog'' by Richard O'Keefe is an invaluable source for writing efficient Prolog programs. Many of the techniques and tricks presented are also applicable to writing efficient ECLiPSe programs. The underlying maxim ``elegance is not optional'' summarizes the spirit of declarative programming. As the book is based on a standard Edinburgh style Prolog, it does not handle issues of module structure and in-line documentation, nor other ECLiPSe specific features.
507 A natural way to represent a collection of items of the same type is to use lists\index{list}. They are very convenient to handle an arbitrary number of items by iterating on successive heads of the list, until the empty list is reached. Unfortunately, finding a particular item in a list is a very expensive operation, as we have to scan the list sequentially.
543 \index{argument checking}It is a good idea, at least for the top-level queries, to verify all parameters systematically. In the specification, we have defined various constraints that the input data must satisfy. Most of these constraints can be translated without too much work into checks that verify the constraints. A separate module for error checking can handle this work and leave the application core to rely on the correctness of the data.
1065 This implementation of minimum fails if the input list has no elements. This means that somewhere else in the program we have to handle the case where the input list is empty. This seems to be the most clear definition of minimum, an empty list does not have a smallest element.
1094 The predicate fails if the input list is empty. We must handle that case somewhere else in the program.
1650 Generating data in Prolog format is easy if the receiver of the data is another ECLiPSe program, but may be inconvienient if the receiver is written in another language. In that case a tabular format\index{tabular format} that can be read with routines like {\it scanf}\index{scanf} is easier to handle. The following program segment shows how this is done. For each item in a list we extract the relevant arguments, and write them to the output file separated by white space.
1778 \item Calling a user-defined predicate \index{user defined predicate}with the wrong calling pattern. If none of the rules of a predicate matches the calling pattern, then the predicate will fail. Of course, quite often this is intentional (tests for some condition for example). It becomes a problem if the calling predicate does not handle the failure properly. We should know for each predicate that we define if it can fail and make sure that any calling predicate handles that situation.
1867 \item A more complex test can be used to exercise all (or nearly all) of the program code. The test data must contain enough variation to force all alternative parts in the program. This can be achieved either by accumulating large number of tests or by designing particular tests to handle special cases.
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dpropiachr.tex260 %but can only handle goals with a finite set of ground answers.
493 Propia can also handle recursively defined predicates, like
H A Dhybrid.tex134 For this example we handle the first constraint using {\tt ic},
136 and we handle the second pair of linear constraints using {\tt eplex}.
H A Dconstimpl.tex616 let it have a handle to itself (its `suspension') in one of its arguments.
/barrelfish-master/lib/nfs/
H A Dnfs_xdr.c242 if (!xdr_nfs_fh3 (xdrs, &objp->post_op_fh3_u.handle))
/barrelfish-master/include/vm/
H A Dvm_pageout.c771 vp = object->handle;
H A Dvm_map.c1348 * with the previous entry when object is NULL. Here, we handle the
2661 * In case of failure, handle entries
3173 if ((src_object->handle == NULL) &&
3385 KASSERT(((struct vnode *)object->handle)->
3957 * A handle (out_entry) is returned for use in
4041 * If we want to write the page, we may as well handle that
4217 * (according to the handle returned by that lookup).
/barrelfish-master/usr/eclipseclp/Contrib/
H A Ddistfix.pl438 % From here down is new stuff to handle distfix operators.
/barrelfish-master/usr/eclipseclp/ecrc_solvers/
H A Dpropia.pl165 % Check the syntax, and handle any errors.
/barrelfish-master/usr/eclipseclp/lib_tcl/
H A Dtkinspect.tcl39 ## routine to handle the movement around (left, right, down) these special
545 handle {
884 $tkinspectvalues(handleimage) handle\
1004 ;# let Prolog handle the appearance of special path positions
/barrelfish-master/doc/017-arm/
H A DARM.tex254 The Barrelfish ARMv7 CPU drivers can handle up to 1GB RAM,
668 CPU models. The difference between the two lies in the way they handle
/barrelfish-master/usr/eclipseclp/documents/intro_paper/
H A Declipse.tex391 Mathematical programming cannot handle disjunction directly.
545 an external solver, written in \verb0C0 to handle linear constraints,
1032 explicit which constraint library is to handle the constraint, for
1471 the package can handle problems involving ten of thousands of linear
1682 more {\em 0/1} variables it is necessary to introduce to handle each
1703 A major issue in defining complex constraints is how to handle
/barrelfish-master/lib/tommath/
H A Dtommath.tex119 contribute to educate others facing the problem of having to handle big number mathematical calculations.
264 discuss how to handle sign or handle the dividend's decreasing magnitude in the main loop (\textit{step \#3}).
1351 logic to handle it.
1491 This function sets four bits of the number at a time to handle all practical \textbf{DIGIT\_BIT} sizes. The weird
1705 The first two steps will handle sorting the inputs such that $min$ and $max$ hold the digit counts of the two
2317 Essentially the loop is a generic version of algorithm mp\_mul\_2 designed to handle any shift count in the range $1 \le x < lg(\beta)$. The $mask$
2334 If the shift count $b$ is larger than $lg(\beta)$ then a call to mp\_lshd() is used to handle all of the multiples
2455 & weight values such as $3$, $5$ and $9$. Extend it to handle all values \\
2458 $\left [ 2 \right ] $ & Modify the preceding algorithm to handle value
[all...]
/barrelfish-master/doc/006-routing/
H A DRouting.tex275 It must be noted that the routing table set-up dispatcher can only generate the routing tables for the cores of a single system. It cannot handle set-ups like an Intel single chip cloud computer connected to a x86 machine over a PCIe-based channel.
279 It is possible that one dispatcher on a multi-hop channel is sending at a faster rate than the receiving dispatcher can handle incoming messages and process them. Because we want to provide a reliable messaging service, we cannot just drop messages in such a case, but have to buffer them and deliver them eventually. To limit the space needed to buffer undelivered messages, we decided to implement a flow control mechanism within the multi-hop interconnect driver. The flow control mechanism allows the receiving dispatcher to control the transmission speed, so that it is not overwhelmed with messages.
511 While the sender waits for the callback, it has to handle the unsent message.
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Ddb.pl49 :- op(950, yfx, 'ondb'), % db handle specification
H A Dtracer_tcl.pl669 refine_type(handle, H, _, Type) :-
726 get_functorarity(handle, S, F, A) ?- !,
/barrelfish-master/lib/openssl-1.0.0d/crypto/bn/asm/
H A Dppc64-mont.pl870 subfe $ovf,$i,$ovf ; handle upmost overflow bit
/barrelfish-master/usr/eclipseclp/Eplex/
H A Deplex.c272 /* argument indices in Prolog-level prob-handle */
273 #define HANDLE_CPH 1 /* C-level handle */
274 #define HANDLE_STAMP 2 /* timestamp for prob-handle */
355 * Problem handle
534 pword handle; local
535 handle.val.all = vlp.all;
536 handle.tag.all = tlp.all;
537 return ec_free_handle(handle, &lp_handle_tid);
670 * All functions that do not use a problem handle must make sure that
1067 {/* Return the cplex descriptor in argument HANDLE_CPH of the handle structur
[all...]
/barrelfish-master/doc/000-overview/
H A DOverview.tex358 page tables and allocating physical memory itself, it can handle page
437 In addition, stubs can also handle other areas of complexity resulting
/barrelfish-master/doc/008-tracing/
H A DTracing.tex463 \item Being able to handle large trace log data.
538 handle the new Event. Such EventHandlers can either be UI elements, such as an
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dkernel.tex260 The handle type is intended to store references to non-{\eclipse} data.
1099 res(Na,Ne) & handle events if any \\
1610 In order to handle cuts inside the metacalled goal, the value of the B
2029 handling), or event handles\index{handle!event} (anonymous events). Their corresponding
H A Druntime.tex98 too many standard Prolog assumptions, we handle things as follows:
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsmodules.tex645 All predicates which handle modular items must be tools

Completed in 471 milliseconds

<<1112