Searched refs:In (Results 1 - 25 of 214) sorted by relevance

123456789

/barrelfish-master/lib/acpica/source/components/resources/
H A Drsxface.c46 * and the following Disclaimer and Export Compliance provision. In addition,
58 * documentation and/or other materials provided with distribution. In
102 * any other agency or department of the United States Government. In the
128 #define ACPI_COPY_FIELD(Out, In, Field) ((Out)->Field = (In)->Field)
129 #define ACPI_COPY_ADDRESS(Out, In) \
130 ACPI_COPY_FIELD(Out, In, ResourceType); \
131 ACPI_COPY_FIELD(Out, In, ProducerConsumer); \
132 ACPI_COPY_FIELD(Out, In, Decode); \
133 ACPI_COPY_FIELD(Out, In, MinAddressFixe
[all...]
/barrelfish-master/lib/acpica/source/components/utilities/
H A Dutmisc.c46 * and the following Disclaimer and Export Compliance provision. In addition,
58 * documentation and/or other materials provided with distribution. In
102 * any other agency or department of the United States Government. In the
219 } In; local
225 In.Value = Value;
227 Out.Bytes[0] = In.Bytes[3];
228 Out.Bytes[1] = In.Bytes[2];
229 Out.Bytes[2] = In.Bytes[1];
230 Out.Bytes[3] = In.Bytes[0];
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dforall.pl55 fromto(First,In,Out,Last)
56 iterate starting with In=First until Out=Last.
57 In and Out are local variables in Goal.
105 (foreach(X,[1,2,3]), fromto(0,In,Out,Sum) do Out is In+X).
108 (foreach(X,[1,2,3]), fromto([],In,Out, Rev) do Out=[X|In]).
109 (foreach(X,[1,2,3]), fromto([],In,[X|In],Rev) do true).
130 (foreach(X,[5,3,8,1,4,6]), fromto(List,Out,In,[]) d
[all...]
H A Dfromonto.pl122 get_stream(input, In),
125 set_stream(input, In),
130 get_stream(input, In),
133 set_stream(input, In),
139 get_stream(input, In),
142 set_stream(input, In),
H A Dapply_macros.pl130 t_maplist(maplist(Pred, In, Out), NewGoal, Module) :-
135 append(VarArgs, [In, Out], NewGoalArgs), % make new goal
174 t_mapstream(mapstream(Pred, In, Out), NewGoal, Module) :-
179 append(VarArgs, [In, Out], NewGoalArgs), % make new goal
198 t_selectlist(selectlist(Pred, In, Out), NewGoal, Module) :-
203 append(VarArgs, [In, Out], NewGoalArgs), % make new goal
258 t_mapargs(mapargs(Pred, In, Out), NewGoal, Module) :-
263 append(VarArgs, [In, Out], NewGoalArgs), % make new goal
479 maplist_body(Pred, [In|ListIn], [Out|ListOut], Module) :-
480 call(Pred, In, Ou
[all...]
H A Dfd_chip.pl91 % Built-In Predicates for CHIP compatibility
213 % Copy list In until a tail matching Until is reached.
215 copy_until(In, Until, Out, Out0) :-
216 ( In == Until ->
219 In = [X|In1],
H A Dpar_util.pl71 :- comment(par_maplist/3, [template:"par_maplist(+Pred, +In, ?Out)",
75 does not cope with aliasing between the In and the Out list, since
141 par_maplist_body(Pred, In, Out, Module) :-
142 findall(Sol, map_elements(Pred, In, Sol, Module), Out0),
146 map_elements(Pred, In, I-Xout, Module) :-
150 InArr =.. [in|In],
H A Dsystools.pl344 open(File, read, In),
345 read_string(In, "", 12, _Header),
347 read_dump_stream(In).
349 read_dump_stream(In) :-
350 ( at_eof(In) ->
353 read_dumped_term(In, Term),
356 read_dump_stream(In)
359 read_dumped_term(In, Term) :-
360 read_integer(In, Length),
361 read_string(In, "", Lengt
[all...]
/barrelfish-master/usr/skb/programs/
H A Dobjects3.pl300 format_slots([], In, Out) :-
301 append_strings(In, "", Out).
302 format_slots([S], In, Out) :-
303 format_slot(S, In, Out).
304 format_slots([S|Rest], In, Out) :-
305 format_slot(S, In, Out2),
309 format_slot(val(Attr, X), In, Out) :-
311 append_strings(In, StrAttr, Out1),
315 format_slot_val(Val, In, Out) :-
318 append_strings(In, StrVa
[all...]
H A Ddecoding_net4_tests.pl35 translate_region(S, In, region(["OUT"], block(400, 1400))),
36 writeln(In).
48 translate_region(S, In, region(["OUT"], block(400, 1500))),
49 writeln(In).
64 decodes_region(S, In, region(["OUT"], block(400, 1500))),
65 writeln(In).
73 resolves_region(S, In, region(["OUT"], block(400, 1500))),
74 writeln(In).
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Dvbs_router.pl81 make_rvars(Nodes_in_out,[],Vars,Out,[],In,UVars),
84 set_up_rcons(Start,Dest,Nodes,Out,In,UVars),
140 make_rvars([],BVars,BVars,[],In,In,[]).
141 make_rvars([I-_-Out|Rest],AcBVars,BVars,OutVars,AcIn,In,[I-UI|UVars]):-
146 make_rvars(Rest,NAcBVars,BVars,ROut,NAcIn,In,UVars).
148 make_vars(_,[],[],In,In).
149 make_vars(I,[J|Rest],[(I,J)-Bij|RVars],CIn,In):-
155 make_vars(I,Rest,RVars,NCIn,In)
[all...]
H A Drepair.pl413 bindings to its variables or their tentative values. In such a case, the
762 % In the case that Untenable is a variable, no global assignment
1026 fromto(Cst, In, Out, TentSum),
1031 Out is In + T * C,
1044 term_variables(Expr, In),
1045 tent_call(In, Out, Out is Expr, Module).
1050 args: ["In":"List of variables (subset of variables in Goal)",
1055 summary: "Eagerly call Goal whenever tentative values of variables in In changes.",
1059 with tentative values. Goal is a general goal, and In and Out are
1061 A copy of Goal is called, with the In
[all...]
/barrelfish-master/tools/fof/
H A DIntroLanguage.tex20 (Section~\ref{sec:semantics_core}). In
22 interpreter under one general function. In
H A DIntroduction.tex15 some Haskell data-types. In this case, our combinators manipulate an
23 with Filet-o-Fish. Hamlet is a Domain-Specific Language. In Hamlet's
/barrelfish-master/doc/019-device-drivers/
H A DDeviceDriver.tex84 given driver module. In practice, any number of instances can be created
167 In a first step, we will look at the necessary bits and pieces to write a new
173 \pathname{usr/drivers/omap44xx/fdif/}. In order to get an idea of what the
181 a list of C source files that are compiled and linked for this driver. In our
210 needs in order to run. In this example, we add driverkit, a helper library for
246 files in your build directory in \pathname{<arch>/include/dev/omap}. In our
272 level interface to do just that. In the function \fnname{enable\_irq\_mode},
287 device registers, interrupt registrations and your actual driver code. In the
294 clients. In Barrelfish, the typical way is to export a message passing
325 or I/O ports. In thi
[all...]
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsparutil.tex56 \item[par_maplist(+Pred, +In, ?Out)]
60 backwards and it does not cope with aliasing between the {\it In} and
H A Dumsporting.tex138 In contrast, a dynamic predicate may be modified by compiling or
150 In the worst case, when (almost) all procedures have to be dynamic,
158 In the following we summarise the main aspects that have to be considered
163 In general, it is almost always possible to add to your program
191 In {\eclipse}, some built-ins raise events in cases where they just fail
211 whenever the event is raised. In this case:
/barrelfish-master/usr/eclipseclp/Contrib/
H A Dproject.pl22 % well be used for building a list of pairs from a pair of lists. In
29 % (In fact this operation is msort/2 and should be available somewhere.)
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Deplex.tex65 applications. In particular, Linear Programming (LP)
100 In addition, the eplex library allows for the user to write programs that
284 function given as the argument, enclosed by either \verb'min(...)' or \verb'max(...)'. In this case, we are minimising.
296 In this case, there is an optimal solution of 710.0:
338 In line \verb'f', \verb'eplex_var_get/3' is used to obtain the solution
362 In general, a problem variable is not restricted to taking integer
414 In this example, the new constraint in line \verb'g' is imposed after the
415 solver setup. In fact it can be imposed anytime before
440 In line \verb'h', we added the \verb'integers/1' constraint. This imposes
444 variables in the list. \Note{In fac
[all...]
H A Dmodelling.tex69 In this chapter we will focus on the first issue, {\bf Problem Modelling},
86 %In \eclipse{}, we model problems using a high-level logic-based language.
275 In ECLiPSe, lists and arrays are just special structures!
282 In CLP, the declarative model is at the same time the constraint setup code.
310 In the example, we can introduce a boolean variable \verb.B{0,1}. which represents
407 In this formulation, the problem has 12 solutions, but it turns out they
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/
H A Dfd_ilog.pl275 % Copy list In until a tail matching Until is reached.
277 copy_until(In, Until, Out, Out0) :-
278 ( In == Until ->
281 In = [X|In1],
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dextpropia.tex73 before selecting an ordinary Prolog goal and evaluating it. In this
90 In this section we shall use \verb0Goal infers most0, which infers as
122 In case there remains information not yet extracted, the constraint
151 In this example there are no ``delayed'' constraints since all valuations for
159 In scheduling
199 In this example the result of constraint propagation is reflected not
272 the call to \verb0product0. In short, for each variable in the input
403 In the first example notice that no domain is produced for {\em X}.
413 In the second example, by contrast, \verb0infers unique0 yields the same
516 In thi
[all...]
/barrelfish-master/usr/eclipseclp/documents/intro_paper/
H A Declipse.tex79 In \ECL the same constraint can be treated concurrently by several
142 In the next section we shall explore
150 In the following two sections we shall examine the \ECL facilities for
152 In \cite{consprog} we
198 In this case the new choice is typically compared with the previous
229 In \ECL each decision is modelled by a variable, and each choice
275 a logical form of loops. In the example, it is equvalent to
340 In other words there are constructs which cannot be mapped onto any
394 In mathematical programming the model is essentially flat, which not
431 In thi
[all...]
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex69 In this tutorial we provide a methodology for developing large scale
116 In this chapter we discuss some high-level design decisions which should be
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.
233 \item[prepare data]In this module we read the data and prepare the data structures that are required for the problem solver. These data structures should group information that belongs together in one record, and must allow fast access to the data, so that the following application parts can access it easily.
262 \item[read input] In the first module, we read all data into data structures.
284 In our example, the module exports a single predicate {\it prepare\_data/12}\index{prepare\_data/12}.
312 In our example, a single library called ``hash'' is loaded.
332 A program that is not documented is not usable. It is very hard to deduce the intention of a program piece just from the implementation, but even a few sentences of explanation can simplify this task dramatically. On the other hand, it is imperative that the documentation and the implementation are consistent. In ECLiPSe we use in-line {\it comment} \index{comment directive}directives to integrate the documentation with the program code. This makes it much easier to keep the documentation up to date than with a separate description file.
402 If a system contains many modules, it can be helpful to provide a query which automatically generates the documentation for all files. In RiskWis
[all...]
/barrelfish-master/doc/003-hake/
H A DHake.tex217 \item[addModules]: additional libraries to link against. In contrast to
328 In the source for hake itself,``path'' usually refers to this path,
385 Makefile. In theory, there should be no need for developers to use
411 data RuleToken = In TreeRef String String -- Input to the computation
440 [ In BuildTree arch o | o <- objs ]
453 of the rule, whereas the object files are referred to by \texttt{In}
478 \item[In] tokens are file references which are dependent inputs for a
479 Make rule. In other words, they refer to files which will appear
482 head. \textbf{In} file references can be in any architecture.
484 \item[Dep] tokens are file references to implicit dependencies. In
[all...]

Completed in 190 milliseconds

123456789