/barrelfish-2018-10-04/doc/023-coreboot/ |
H A D | coreboot.tex | 73 run as processes, but closely resemble device drivers and could equally run as 81 different operations as described below. 117 having multiple KCBs on one core but other models are possible as well. 158 before, it is brought online as follows: 181 \item \texttt{type}: A number that corresponds to that cores architecture as 253 \item Optional: Update meta-data in SKB to mark core as stopped. 260 the KCB stop to execute is generally a bad idea as there may be messages waiting 267 Update is implemented as a sequence of executing the \texttt{stop} and 268 \texttt{start} command. It takes the same arguments and flags as describe [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | globalstate.tex | 40 In a non-parallel \eclipse\ this is the same as the shared heap\footnote{ 87 address as the creator (during attach). 110 as follows: 152 alloc_size(size). Size should be the same as on allocation, 166 block remembers its own size, so it does not have to be passed as an
|
H A D | debugger.tex | 108 Inline disjunctions are traced as a NEXT port of the predicate that 150 % notrace(Goal): this should be the same mechanism as used to stop the 166 An empty debugger stack is interpreted as having all bits set. 228 the pre-filter registers as follows: 306 %This is fragile as it relies on F/L flags being always correct and 327 enter an event handler, same mechanism as for event within builtin.
|
H A D | kernel.tex | 100 into the virtual space as the stacks grow, and unmapped as they 181 represented as {\em bignums}. 222 downward-compatible with C strings\index{strings}. As long as the strings are only 237 in the global stack buffer. The number's sign is stored as the BIGSIGN\index{BIGSIGN} (=MISC) 241 word-sized integers are stored as small (TINT) integers, and bignums are 263 (struct t_ext_type) as specified in the Embedding Manual. The second one 296 This holds as of version 5.2. Previously, only the simple variable had 317 The HIDE_ATTR\index{HIDE_ATTR} (=MISC) bit in TMETA tags is used as a marking bit to 444 descriptors, implemented as [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | solverinter.tex | 102 the external solver does not consider this as an integrality constraint 126 are declaratively the same as the corresponding '\$' constraints. 128 can only be used as tests (when all variables are instantiated), 129 not as active constraints. 167 such as \verb'>=' (the standard arithmetic test), the default behaviour
|
H A D | repair.tex | 59 available in {\eclipse}, such as the domains and constraints of the FD library. 114 as the variable's repair-attribute), while on the other hand 167 tenable. Since no single value has been selected as a tentative value, 183 the same tentative value as the original, you will need to call 221 as a ground check, and work on any instantiation pattern. Typically, 249 {\bf Constraint} to be activated as a goal as soon as it goes into 343 %propagated, 'Constraint' can be a goal that only work as a ground test. 373 assignment of its variables. The result is delivered as (a [all...] |
H A D | obsman.tex | 140 integer as well as atomic (i.e.\ atoms, strings, floats, etc.) 159 treat atomic and other ground terms as variables with singleton domains. 172 An integer interval is written as 252 {\it Domain} can be a closed integer interval denoted as {\it Min .. Max}, 258 is not accepted as a compound domain element. 295 of {\it different} constraints attached to {\it DVar}, as goals 342 as soon as a partial solution is found that is worse than a previously 382 Moreover, as soo [all...] |
H A D | eplexdiff.tex | 47 avoided as the external solver bounds for variables are only updated if 100 A variable never becomes ground as a result of an eplex instance bound 104 same as posting a bounds constraint. Unlike the non-standalone eplex, the 121 variable should be treated as an integer by the external solver in the 161 \biptxtref{lp_demon_setup/5}{../bips/lib/eplex/eplex_demon_setup-5.html}. Instead, the priority can be specified as an option, if 174 this somewhat easier as the variables would have the same names.
|
/barrelfish-2018-10-04/doc/015-disk-driver-arch/ |
H A D | flounder-ahci.tex | 94 all be used as sources of information. The question is therefore how best to 95 handle this information, as demonstrated in the following examples: 106 parameter. In either case, the size might also be specified as a 134 Because \acs{ahci} Flounder bindings use the generic binding as a base, the 146 filled. The address of this struct is sent as the command tag for
|
/barrelfish-2018-10-04/doc/019-device-drivers/ |
H A D | DeviceDriver.tex | 114 The driver module is written as a library. A template module can be found in 119 but rather as a module (\fnname{addModules = ["drivermodule"]}). This makes sure 132 A driver implementation can register itself as a module using the 148 messages which basically act as wrappers for the driver functions described in 160 Legacy drivers live within a 9single) domain and the structure, as well as the control 163 written as described in the previous chapter. Unfortunately, most of our current 169 driver as a walk-through from the Barrelfish code base -- the FDIF driver, a 183 in the current directory and return this as a list of files for 274 \fnname{inthandler\_setup\_arm} (Listing~\ref{lst:irqregister}). It takes as [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | repairtut.tex | 54 Finally there are techniques such as conflict minimisation which seek 57 These techniques can be treated as optimisation algorithms, whose 59 However they can also be treated as repair problems, which 222 The code is as follows: 254 it to another value. This would be implemented as follows: 294 Suppose the requirement is to complete the schedule as early as 306 chosen as its tentative value, at each node of the search tree. 366 This algorithm can be combined with other solvers, such as {\tt ic}, 461 This technique is known as maintenanc [all...] |
H A D | umsusing.tex | 92 % funny pathname because this chapter gets included from tutorial as well 107 Save your program as a plain text file, and you can then compile the 180 print the solution found as before, print \texttt{More}, and enable 223 state as it executes. A full example is given in 301 (which contains the same information as the HTML Reference Manual). 345 files to edit them, or compile them individually, as well as adding 361 This tool displays the current delayed goals, as well as allowing a 367 and data terms are displayed as [all...] |
H A D | search.tex | 130 completely (with as little as O(N) memory requirements). 187 The {\em branch-and-bound} technique works as follows: 226 to as {\em pruning}\index{pruning}. 260 Sometimes depth-first search and heuristic search are treated as antonyms. 287 In {\eclipse}, this can be written as a disjunction 293 integer values from 0 to 3 (assume it has been declared as \verb'X2::0..3'), 438 {\em ic} library. It is defined as follows: 446 from left to right as they occur in the list, and they are 461 Using delete/5, we can redefine our labeling-routine as follow [all...] |
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn.tex | 87 release as well. This textbook is meant to compliment the project by providing a more solid walkthrough of the development 91 public domain everyone is entitled to do with them as they see fit. 95 LibTomMath is meant to be very ``GCC friendly'' as it comes with a makefile well suited for GCC. However, the library will 100 To build as a static library for GCC issue the following 115 To build as a shared library for GCC issue the following 119 This requires the ``libtool'' package (common on most Linux/BSD systems). It will build LibTomMath as both shared 120 and static then install (by default) into /usr/lib as well as install the header files in /usr/include. The shared 150 This will output a row of numbers that are increasing. Each column is a different test (such as addition, multiplication, etc) 176 This is to help resolve as man [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | test_util.pl | 85 Use this library as follows: Write a file with test patterns, using 96 print a message for every test pattern that does not behave as expected. 109 Here the extra last argument serves as a name for the test (or a short 127 the output to test_csv_log as follows: 134 This can be extremely useful, as useful information as the name of the 245 of skipped tests gets reported at the end. Skipped tests count as
|
H A D | sepia.pl | 209 % abolish/2 - same functionality as abolish/1 259 % interrupt/1 - about the same as kill/2 272 % predicate_property/1 - same as pred/1
|
H A D | bsi.pl | 189 % redefined as : open(file(F),M,S) :- open(F,M,S) 197 % the following predicates have the stream as first argument 198 % in bsi, and as last argument in sepia
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | tidy.pl | 46 A plus (times) bag is stored as +(Tree, Hole, Num) {*(Tree, Hole, Num)}. 47 For example, a+b+c+3 would be stored as 74 emerges as a <tidy expr>, rather than a <baggy expr>. Hence some 76 up as "(1+x) + -1" rather than as "x". There appears to be no easy 77 way around this problem, though keeping the base as a <baggy expr> 95 tidy_withvars/2, % same as tidy_expr
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsusing.tex | 83 % funny pathname because this chapter gets included from tutorial as well 100 Save your program as a plain text file, and you can then compile the 156 found as before, print \notation{More}, and enable the \guitext{more} button. 191 program's state as it executes. 196 perform on that goal, such as inspecting it, or setting a spy point on the 266 You can select files to edit them, or compile them individually, as well as 282 This tool displays the current delayed goals, as well as allowing a spy 294 Goals and data terms are displayed as [all...] |
H A D | umsarrays.tex | 88 and the stored data can be retrieved as a list with 122 individually, or the whole shelf can be retrieved as a term. 132 Data is stored in the slots (or the shelf as a whole) with 170 ground keys. Modifications of a store, as well as the entries within it, 172 looking up information under a key, or retrieving the store contents as 238 solution term as the key to distinguish the different counters: 318 an incremental count across failures as in the example: 412 Thus if the value of \notation{matrix(3, 2)} had been set as above, the goal 433 It takes as valu [all...] |
/barrelfish-2018-10-04/lib/lwip/src/core/ |
H A D | memp.c | 72 * and at the end of each element, initialize them as 0xcd and check 278 #error "Overflow checking is not supported at the moment, as it screws up "\ 288 const size_t *as = a, *bs = b; local 289 if (memp_sizes[*bs] < memp_sizes[*as]) { 291 } else if (memp_sizes[*bs] == memp_sizes[*as]) { 310 * completly trivial as we try to align the pool elements to their size. 470 // This should be same as pbuf_pool_inuse_13,
|
/barrelfish-2018-10-04/usr/eclipseclp/Opium/ |
H A D | opium.pl | 100 * returns the name of a sepia variable as atom 273 * get opium as toplevel module 304 * This is duplicated in the opium_slave.pl as for the development
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/asm/ |
H A D | ppc64-mont.pl | 14 # performance was observed to be less than impressive, essentially as 15 # fast as 1.8GHz PPC970, or 2.6 times(!) slower than one would hope. 20 # Unfortunately the resulting performance improvement is not as 28 # key lengths. As it's obviously inappropriate as "best all-round" 33 # *everything* said so far applies to 64-bit builds! As far as 32-bit 66 # same as above, but 64-bit mnemonics... 246 ; transfer bp[0] to FPU as 4x16-bit values 255 ; transfer (ap[0]*bp[0])*n0 to FPU as 4x16-bit values 264 lwz $t0,4($ap) ; load a[j] as 32-bit word pair 266 lwz $t2,12($ap) ; load a[j+1] as 3 [all...] |
/barrelfish-2018-10-04/usr/acpi/ |
H A D | acpi_parse_madt.c | 139 BASE_PAGE_BITS, //as used elswhere in acpi.c 140 ((size_t)1) << BASE_PAGE_BITS, //as used elswhere in acpi.c 382 ACPI_STATUS as; local 387 as = AcpiGetTable("APIC", 1, (ACPI_TABLE_HEADER **)&ath); 389 if(ACPI_FAILURE(as)) {
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/ |
H A D | embtcl.tex | 44 {\eclipse} is ran as a separate program. The facilities provided by the 64 The {\eclipse} interface is provided as a Tcl-package called {\bf eclipse}, 65 and can be loaded as follows: 173 goal as a Tcl data structure, otherwise "fail" or "throw" respectively. 226 from Tcl, which appears as an {\eclipse} queue in {\eclipse}, and a channel 234 queues should be viewed as communication channels: data is written to the 255 specified as r (equivalent to fromec) or w (equivalent to 256 toec). These can be somewhat confusing as read/write status depends 420 Similarly, a from-{\eclipse} queue could be created as follows: 477 name as a [all...] |