Searched refs:first (Results 76 - 100 of 314) sorted by relevance

1234567891011>>

/barrelfish-2018-10-04/doc/018-Practical-guide/
H A DPracticalGuide.tex40 % Include version history first
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/
H A Dsearch.tex62 constraints. Let us first recall what we are talking about.
160 Figure \ref{figtreesearch} shows a sample tree search, namely a depth-first
178 \caption{A tree search (depth-first)}
209 \item Find a first solution
237 which explores promising areas first.
240 In the following sections we will first investigate the considerable
254 depth-first, left-to-right search by backtracking. It allows to
257 search (e.g. breadth-first) have exponential memory requirements.
259 of {\eclipse}. Note that the main disadvantage of the depth-first
263 Sometimes depth-first searc
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Dembexdr.tex137 XDR_int ::= <4 bytes, msb first>
138 XDR_long ::= <8 bytes, msb first>
139 XDR_double ::= <8 bytes, ieee double, exponent first>
/barrelfish-2018-10-04/doc/015-disk-driver-arch/
H A Dfat.tex38 {\tt WRITE DMA} commands, we can only access the first 128GB of a disk (with
50 To generate 8.3 filenames in the first place, we have adapted various
96 device, and the optional {\tt startblock} specifies the offset the first sector
H A Dusage.tex6 The application first initializes the necessary bindings and \acs{rpc} client.
48 want to use. For simplicity, we use port $0$ which is the first device
83 The \acs{rpc} client can be constructed by first initializing the
H A Dlibahci.tex72 chunks of the memory belonging to the pool. A pointer to the first free chunk
74 pointers to the first and last free chunk are stored.
77 for a sufficiently free chunk (first-free policy), which is returned in its
98 stops at the first free chunk that meets the condition {\tt request\_size <=
195 \ahciinit is the first function a user of \libahci calls. \ahciinit initializes
201 On the first call to \ahciinit, the bind callback sets up the function table
H A Dflounder-ahci.tex6 The goal of the \acs{ahci} Flounder backend is twofold: first, it should allow
118 first initialize libahci, at which point the target device is specified with
201 To issue a command over \ac{ahci}, the \acs{ahci} backend must first set up a
H A Drelated.tex16 when \ac{ahci} was first implemented a few years ago, it was as simple as
/barrelfish-2018-10-04/doc/021-cpudriver/
H A Dcpudriver.tex105 We first describe the boot process for the initial BSP core, followed by
132 \fnname{arch\_init}, the first kernel C entry point.
184 port range to be reduced (with the lower limit in the first
314 for the first time.
323 On x86, the serial device (a PC16550 compatible controller) is initialized for the first time by the BSP core on boot-up.
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/
H A Dconsole.tcl406 ## This is the first stage of the evaluating commands in the console.
933 foreach {first last} [$c tag ranges $type] {
934 lappend output [$c get $first $last]
1319 if {[$w compare sel.first >= limit]} {$w delete sel.first sel.last}
1392 eval %W tag remove sel [%W tag nextrange prompt sel.first sel.last]
1394 %W mark set insert sel.first
1420 && [%W compare sel.first >= limit]} {
1421 %W delete sel.first sel.last
1429 && [%W compare sel.first >
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dextpropia.tex95 We first show the behaviour of the original goal:
191 $6>ST2+7$ (to satisfy the first clause defining \verb0noclash0)
202 We first define logical conjunction by its truth table:
252 We first define a predicate \verb0sum(Products,Comp1,Comp2,Profit)0
270 If \verb0sum0 is invoked with a list of variables as its first argument,
395 The first approximation we will introduce in this section
403 In the first example notice that no domain is produced for {\em X}.
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Dos_support.c199 /* On SUNOS 4.0 the first call to ctime() takes much longer than the
1158 /* return the first one we can get hold of */
1641 HANDLE thread_handle; /* must be first */
1650 DWORD new_first; /* first interval (ms) */
1776 double first, /* new initial interval (0: stop timer) */
1811 alarm_thread.new_first = (DWORD) (first*1000.0);
1812 if (alarm_thread.new_first==0 && first>0.0) alarm_thread.new_first = 1;
1911 pthread_t thread_handle; /* must be first */
1921 double volatile new_first; /* first interval (s) */
2046 double first, /* ne
1775 ec_set_alarm( double first, double interv, void (*callback)(long), long cb_arg, double *premain, double *old_interv) argument
2045 ec_set_alarm( double first, double interv, void (*callback)(long), long cb_arg, double *premain, double *old_interv) argument
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/rxspencer/
H A Dregcomp.c198 register int first = 1; /* is this the first alternative? */ local
210 if (first) {
214 first = 0;
223 if (!first) { /* tail-end fixups */
399 * This implementation is a bit of a kludge, in that a trailing $ is first
408 register int end1; /* first terminating character */
412 register int first = 1; /* first subexpression? */ local
421 wasdollar = p_simp_re(p, first);
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/asn1/
H A Dasn_mime.c316 /* Now write out the first part */
611 char state, part, first; local
616 first = 1;
622 first = 1;
630 if(first) {
631 first = 0;
764 /* Look for first non white space or quote */
782 /* Look for first non white space or quote */
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dlistut.pl159 % counting the first as element 0. (That is, throw away the first
175 first as element 0. (That is, throw away the first N elements
203 first as element 1.
/barrelfish-2018-10-04/lib/libc/db/test/btree.tests/
H A Dmain.c66 void first(DB *, char **);
93 "f", 0, 0, first, "first", "move cursor to first record",
376 first(db, argv) function
387 perror("first/seq");
/barrelfish-2018-10-04/lib/libc/nameser/
H A Dns_name.c523 int n, l, first = 1; local
578 (dstp - msg) < 0x4000 && first) {
581 first = 0;
821 /* Recurse to get rest of name done first. */
919 *\li dnptrs is the pointer to the first name on the list,
/barrelfish-2018-10-04/lib/lwip/src/core/ipv4/
H A Dip.c252 /* header length exceeds first pbuf length, or ip length exceeds total pbuf length? */
257 ") does not fit in first pbuf (len %" U16_F
308 'first' is used as a boolean to mark whether we started walking the list */
309 int first = 1; local
334 if (first) {
335 first = 0;
614 LWIP_ASSERT("check that first pbuf can hold struct ip_hdr",
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Dmultiuser-sec.tex70 The server must be started before the first user process tries to
71 open the database (otherwise the first user process would open it
173 the first phase of the transaction. The second phase consists
204 fairness of lock distribution (i.e. on a first-come first-served
350 is {\em not} legal Prolog. One must therefore first introduce a synonym
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ts/
H A Dts_rsp_verify.c152 /* Some sanity checks first. */
272 /* The signer certificate must be the first in cert_ids. */
322 /* Check the SHA-1 hash first. */
343 /* Check the issuer first. It must be a directory name. */
505 int first = 1; local
511 if (!first)
514 first = 0;
541 /* Determine length first. */
692 /* Check the subject name first. */
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/
H A Dtutorial.tex111 There are three appendices to the tutorial. The first one summarizes style rules that good ECLiPSe programs should satisfy. Most of the rules are explained inside the main tutorial text, they are presented here for easy reference. Appendix~\ref{layoutrules} gives some rules how ECLiPSe programs should be indented. The last section (appendix~\ref{corepredicates}) lists core ECLiPSe predicates which should cover most programming needs and which all ECLiPSe programmers should be familiar with.
120 We first review the overall application structure\index{application structure} found in systems developed at Parc Technologies (at least those using ECLiPSe for part of their development). We distinguish between two application types, one a full application with user-interface, database, reporting, etc, and the other a much smaller system, typically reading data from and to files and performing a single, batch type operation.
164 Examples of the first type (see figure~\ref{fullapplication}) are Parc Technologies applications (http://www.parc-technologies.com) like AirPlanner\index{AirPlanner} and RiskWise\index{RiskWise}\footnote{In the following we use a number of examples from the RiskWise application. It is a network analysis tool for IP networks, which uses a constraint solver to determine traffic pattern in the network. If this doesn't make any sense to you, relax. An understanding of the networking application domain is not required to follow this tutorial.}, where everything except the problem solver is developed in Java\index{Java} or related tools. The interface between the main application and the problem solver written in ECLiPSe is via a Java-ECLiPSe interface. In this interface, the main application poses queries for the ECLiPSe solver, passing data and arguments into ECLiPSe. The problem solver then runs the query and returns results as variable bindings in the given query. The Java side only knows about these queries, their data format and the expected results. The internals of the solver, how the queries are resolved, is completely hidden. This defines a nice interface between the application parts, as long as the queries are well defined and documented. Once that design is frozen, the developers for the different parts can continue development independently from each other, using stubs or dummy routines to simulate the other application parts.
169 For each required function of the interface, we should define a specific query\index{query}. The query consists of three parts. The first is the predicate name, which obviously should have a relation to the intended function. The second part consists of the input arguments\index{input arguments}, which are used to pass information from the outside to the problem solver. The structure of these arguments should be as simple as possible, easy to generate and to analyze. The third part consists of the output arguments\index{output arguments}, which are used to pass information from the problem solver back to the calling interface. When calling the query these arguments will be free variables, which are instantiated inside the solver to some result data structure.
262 \item[read input] In the first module, we read all data into data structures.
425 The first question is how the data \index{external data}will be fed to the application. We can distinguish five alternatives.
428 \item[arguments] In the first alternative, all data are passed in arguments to the query. Multiple items of the same type will usually be represented as lists, with structures to hold different attributes of the different objects. This form has the advantage that each query can be run with a completely new data set without changing the database or creating a new set of files. But debugging data in this form can be more difficult, as there is not direct way to look up some data item. This method also requires work on the Java side to build all the data structures before a call to the ECLiPSe solver. A similar effort is required to develop testing code written in ECLiPSe which exercises the interface.
504 \index{structure, nested}\index{nested structure}A very common data representation problem is how to access information about some structure from another structure, for example in RiskWise how to access the information about a router from an interface of the router. There are two main alternatives. The first is to insert the data of the first entity (router) directly in the representation of the second entity (interface) as an additional attribute, the second is to store a key which can be used to look up the entity. Although the first metho
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/
H A Dpropia.pl72 solution (or the first solution of Goal subsumes all the
274 % far. This msg depends upon the solver types. The first msg is
275 % simply the generalisation of the first solution. Normally the new
297 % extend first finds a solution to Goal, which instantiates Vars. The
304 % until there are no more solutions to Goal, and the first clause of
421 % would succeed immediately, committing to the first clause for 'p'.
/barrelfish-2018-10-04/lib/lua/src/
H A Dllex.c234 int first = ls->current; local
237 if (first == '0' && check_next(ls, "Xx")) /* hexadecimal? */
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumsprofile.tex45 %The first tool is the {\it profiler} which finds out how much time
178 %first of several matching clauses or a disjunction (choicepoint creation)
219 %will sort with procedures that exited most frequently first.
236 %succeed to pick up the right clause at the first try
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dic_make_overlap_bivs.pl38 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.

Completed in 200 milliseconds

1234567891011>>