Searched refs:as (Results 101 - 125 of 332) sorted by relevance

1234567891011>>

/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dtkdebug.tex51 in looking at the actual screen as you follow along.
71 as shown:
89 debugging session as debugging someone else's code, not all of which
125 incorrect solution as shown previously. The program uses
127 the countries as the program tries different colours for them.
143 menu as shown below, and a new window for the tracer tool should appear.
228 goal is not `current', i.e.\ the bindings shown are as they were when the
232 `Trace Log' view, which shows a log of the debugger ports much as a traditional Prolog debugger does.
313 The filter tool opens in a new window, as shown in
336 from the {\bf Goal template}, as i
[all...]
/barrelfish-2018-10-04/doc/015-disk-driver-arch/
H A Dfat.tex63 The FAT code uses a cache layer as a global block and cluster store,
64 simplifying the code and improving performance. The cache is implemented as a
73 seen as an \acs{lru} queue. Thus when \lstinline+fs_cache_put+ is called and
86 increments the reference count as if \lstinline+fs_cache_acquire+ had
104 exported as a service, creating a Barrelfish-internal system conceptually
H A Dxahcid.tex38 ahcid registers itself as a driver for the \ac{ahci} device class. Once the
55 ahcid registers itself as an interrupt handler for the \ac{ahci} \ac{hba}
67 triggered as a consequence of any commands issued in the command completion
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dbranch_and_bound.pl53 Then we can find a minimum-calorie solution as follows:
66 In this example, the item/3 predicate serves as a nondeterministic
68 which we have chosen as our cost variable. As can be seen from the
124 variable are important for efficiency, as they help the branch-and-bound
201 % we used to use the Goal directly as the Template, but that can
209 % impose Opt as a lower bound, because there could be
658 and bound method: as soon as a solution is found, it gets
679 If that fails, assume the upper sub-range as the remaining
711 This has a performance penalty, as th
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Dmultiuser-sec.tex68 The server should be started as background process, which is achieved
87 knowledge base as usual, by just specifying the database path name.
94 relations, as they are all shared. The temporary relations are private
104 A transaction context is established as follows:
108 which executes {\bf Goal} as a transaction. Any changes the execution of
114 the old state (i.e. as before the transaction started)
202 leads to the same deadlock as before. A lifelock is prevented in
214 A transaction is restarted up to 10 times. If it is chosen as victim
220 undone. Programs that are executed as transactions must therefore be
237 made to insert into \verb+s2+ and that this transaction is selected as
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/
H A Dtutorial.tex76 as well as those tasked with the maintenance of such programs.
104 The ECLiPSe documentation contains most of the information provided in this tutorial, but presents it in a very different way. Invariably, it describes all features of the system, many of which are only required for quite specific (if important) tasks like developing new constraint engines inside the system. It can be difficult to find which parts of the documentation contains important hints to solve a particular problem. On the other hand, it will be useful to look up each feature in the user manual and/or the reference manual as they occur in the tutorial.
109 The tutorial follows a top-down methodology for the design of an application. Chapter~\ref{highleveldesign} discusses general issues of modular design and self-documenting code for ECLiPSe programs. The next chapter on data structures compares different ways of representing data internally and externally, and presents a canonical multi-representation format which allows effective access to data in all parts of an application. Chapter~\ref{gettingittowork} shows how to convert a high level specification into an executable program early in the development stage. The bulk of the tutorial is contained in chapter~\ref{programmingconcepts}, where we present a number of different programming concepts which can be used as development templates to solve particular problems. This is followed by chapter~\ref{inputoutput} on input/output, a particularly important aspect of developing extensible programs. The last two chapters deal with debugging (chapter~\ref{ifitdoesntwork}) and testing (chapter~\ref{correctnessandperformance}).
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.
171 The critical issue in defining the queries lies in identifying which data are required and/or produced, without building an actual implementation of the system. Another issue is the format of the data, which should allow a simple and efficient implementation without extra overhead for data manipulation. It is most important to get this interface right from the start, as an
[all...]
/barrelfish-2018-10-04/usr/acpi/arch/x86/
H A Dacpi_interrupts_arch.c175 ACPI_STATUS as; local
188 as = AcpiGetTable("APIC", 1, (ACPI_TABLE_HEADER **)&ath);
190 if(ACPI_FAILURE(as)) {
267 BASE_PAGE_BITS, //as used elswhere in acpi.c
268 ((size_t)1) << BASE_PAGE_BITS, //as used elswhere in acpi.c
403 * There is no override for the timer interrupt, although it appears as IRQ2.
/barrelfish-2018-10-04/doc/004-virtual_memory/
H A DVirtualMemory.tex89 and as an optimization a single frame memory object.
128 The map invocation can create multi-page mappings in one system call, as long
129 as the mapping does not cross a page table boundary.
135 capability with a large enough Frame capability as the source capability.
160 so as to initialize the right type of pmap object.
162 A domain can only construct pagetables for an MMU of the same type as the one it is using.
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dic.tex73 integer overflow problems). In IC there is no limit as such, and
78 constraints ought to behave as expected until the values being
202 refer to the closest representable float value, as per the type
215 as part of their program may \emph{not} be safely represented as a
219 This may lead to unexpected results such as
292 leave choice points may not behave as expected.
308 as is.
364 Same as \verb|e^Expr|.
413 Any arithmetic or logical constraint that can be issued as
[all...]
/barrelfish-2018-10-04/doc/002-mackerel/
H A DMackerel.tex70 included as part of a \Mac specification itself, and used to generate
73 Typically, it takes as input a specification written in the
88 relevant functions for accessing the device, as described in
96 This backend should not be used for new code, as it is not portable
103 Mackerel compiler is as follows:
152 anything inbetween is ignored and treated as white space.
172 In addition, as a special case the string \texttt{1s} can be used to
194 \item[Special characters:] The following characters are used as operators,
215 available in the current device definition, as described below. The
216 syntax of an import declaration is as follow
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Opium/demo/
H A Dnqueens.pl23 Same bug as missing26, but in a simple \n \
H A Dporting.pl64 % tells the parser to read strings as lists of ascii
H A Dshow_queens.pl4 * whose positions are given as a list of integers
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Dembsumc.tex35 All these functions return (volatile) pwords, which can be used as input
131 the same as ec_get_string(), but returns also the string's length.
150 and if so, returns it as an C double.
238 called from {\eclipse} as external predicates.
247 as well as subsequent waking will only happen once control is
300 This function serves the same purpose as the {\eclipse} built-in external/2:
318 same as ec_post_goal(), but the goal is given in {\eclipse} syntax
325 same as ec_post_goal(), but the goal is given in EXDR format
364 predicate call. The term FromC is passed as inpu
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumsbugs.tex39 The {\eclipse} implementation tries to impose as few limits as possible.
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/objects/
H A Dobj_dat.pl183 * The implementation was written so as to conform with Netscapes SSL.
185 * This library is free for commercial and non-commercial use as long as
192 * Copyright remains Eric Young's, and as such any Copyright notices in
195 * as the author of the parts of the library used.
H A Dobjects.pl134 * The implementation was written so as to conform with Netscapes SSL.
136 * This library is free for commercial and non-commercial use as long as
143 * Copyright remains Eric Young's, and as such any Copyright notices in
146 * as the author of the parts of the library used.
/barrelfish-2018-10-04/lib/tommath/
H A Dtommath.tex89 When I tell people about my LibTom projects and that I release them as public domain they are often puzzled.
133 This text is for people who stop and wonder when first examining algorithms such as RSA for the first time and asks
169 When we think of long-hand arithmetic such as addition or multiplication we rarely consider the fact that we instinctively
171 reason that $7$ times $6$ is $42$. However, $42$ has two digits of precision as opposed to one digit we started with.
183 The most prevalent need for multiple precision arithmetic, often referred to as ``bignum'' math, is within the implementation
184 of public-key cryptography algorithms. Algorithms such as RSA \cite{RSAREF} and Diffie-Hellman \cite{DHREF} require
186 typical RSA modulus would be at least greater than $10^{309}$. However, modern programming languages such as ISO C \cite{ISOC} and
205 language\footnote{As per the ISO C standard. However, each compiler vendor is allowed to augment the precision as they
206 see fit.} can only represent values up to $10^{19}$ as shown in figure \ref{fig:ISOC}. On its own the C language is
213 primitives. Faster modular reduction and exponentiation algorithms such as Barret
[all...]
/barrelfish-2018-10-04/include/arch/x86_32/machine/
H A D_types.h43 #error this file needs sys/cdefs.h as a prerequisite
/barrelfish-2018-10-04/include/arch/x86_64/machine/
H A D_types.h43 #error this file needs sys/cdefs.h as a prerequisite
/barrelfish-2018-10-04/lib/cpuid/
H A Dcpuid_amd.c468 cpuid_amd_addrspace_t as = (cpuid_amd_addrspace_t)&reg.eax; local
470 ai->physical = cpuid_amd_addrspace_physical_extract(as);
471 ai->virtual = cpuid_amd_addrspace_linear_extract(as);
472 ai->guest_physical = cpuid_amd_addrspace_guest_extract(as);
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dic_make_overlap_bivs.pl147 This sets the bivalued variable as soon as the bounds on the task start times
167 is performed by the 'my_tent_call' predicate as the ECLiPSe built-in
168 tent_call propagates too early and sometimes fails as a result.
H A Dic_probe_support.pl102 identity to test for membership, rather than unification as used by member.
114 length as the VarList
117 Same as:
207 Variables occurring in both the InVars and the OutVars are treated as input.
H A Dmake_overlap_bivs.pl147 This sets the bivalued variable as soon as the bounds on the task start times
167 is performed by the 'my_tent_call' predicate as the ECLiPSe built-in
168 tent_call propagates too early and sometimes fails as a result.
H A Dprobe_support.pl101 identity to test for membership, rather than unification as used by member.
113 length as the VarList
116 Same as:
206 Variables occurring in both the InVars and the OutVars are treated as input.

Completed in 112 milliseconds

1234567891011>>