Searched refs:time (Results 201 - 225 of 381) sorted by relevance

1234567891011>>

/barrelfish-2018-10-04/tools/harness/machines/
H A Duw.py10 import sys, os, signal, time, getpass, subprocess, socket, pty namespace
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Dknowbase-sec.tex229 using tuple-at-a-time operations.
302 be a variable at the time of calling, and will get instantiated to
492 time
514 time
643 flight(munich,paris,friday,Time) :- time(munich,paris,weekday,Time).
666 and time @> 16:00.
668 X isdr [from, time] :^: flight
/barrelfish-2018-10-04/doc/003-hake/
H A DHake.tex70 architectures at the same time.
165 binaries), and building Barrelfish libraries. Here's how, at time of
311 at build time.
385 constructed. This is purely a convenience: any time that one can
409 | PreDep TreeRef String String -- One-time dependency
547 For every target architecture (at time of writing, only
569 the configuration variables (at time of writing) used for Barrelfish.
701 configured. At time of writing, supported architectures include
737 reduce in size over time. Here are a few:
/barrelfish-2018-10-04/lib/lwip2/src/apps/lwiperf/
H A Dlwiperf.c87 u32_t amount; /* pos. value: bytes?; neg. values: time (unit is 10ms: 1/100 second) */
262 /* this session is time-limited */
265 u32_t time = (u32_t)-(s32_t)lwip_htonl(conn->settings.amount); local
266 u32_t time_ms = time * 10;
268 /* time specified by the client is over -> close the connection */
284 /* transmit the settings a first time */
289 /* transmit the settings a second time */
329 /* @todo: check 'len' (e.g. to time ACK of all data)? for now, we just send more... */
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Dembtclmulti.tex44 time.
102 passed one more time to the multitasking peers, this time invoking the end
133 The Tcl command {\bf update} is therefore called each time the peer
/barrelfish-2018-10-04/usr/eclipseclp/documents/intro_paper/
H A Declipse.tex120 day, also roads are busier at certain times of day so the journey time
121 may vary with the time of day, and anyway the poor salesmen need some
122 time to rest - they can't
194 decision variables one-at-a-time. Each choice reduces the set of
254 At the same time, we also hope that any readers who have suffered from
404 single resource cannot be done at the same time.
574 A task might have an {\em identifier}, a {\em start time},
575 {\em end time} and a {\em duration}.
586 [eclipse 2]: local struct( time(hour, minute) ).
593 [eclipse 4]: T1=task with [id:a3,start:S3,end:(time wit
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dextpropia.tex161 same machine not to be performed at the same time.
163 If one task starting at time {\em ST1} has duration {\em D1} and another
164 task starting at time {\em ST2} has duration {\em D2}, the above
516 In this case the Propia constraint wakes up each time a variable in
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumserrors.tex181 - (file name, code size, compile time)
184 ('string', code size, compile time) with a string stream
187 (file name, code size, compile time) with a stream associated to a file
428 %possible with size and time indication
H A Dumsintro.tex219 %is interrupted and the signal is handled immediately in real time.
220 %This feature can be used to write real-time applications,
322 %called for the first time.
332 %The other is a true timing profiler which measures the time spent in
H A Dumscompiler.tex678 be computed at run-time, e.g., writing \verb'2^34' instead of
841 preprocessed and transformed at compile time. The directive
848 arranges for \predspec{mytranspred/2} to be invoked at compile time for each
869 not nonground(X), % if X already known at compile time:
870 Result is 2*X. % do calculation at compile time!
953 Some programs spend a lot of time in the garbage collection,
967 A program may spend its time in a predicate because the predicate
968 itself is very time consuming, or because it was frequently executed.
1001 However, the decision is still based on only one argument at a time:
1066 If the compiler can decide about the clause selection at compile time,
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bio/
H A Dbss_dgram.c216 /* Get current time */
219 /* Calculate time left until timer expires */
823 t->tv_sec = (long)tb.time;
828 t->tv_sec = (long)tb.time;
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/des/
H A Ddes.c77 #include <time.h>
363 extern unsigned long time();
/barrelfish-2018-10-04/lib/acpica/source/compiler/
H A Dasltree.c119 #include <time.h>
811 * have a full parse tree at this time and cannot find the parent control
859 /* Get a copy of the current time */
861 CurrentTime = time (NULL);
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ts/
H A Dts_asn1.c140 ASN1_SIMPLE(TS_TST_INFO, time, ASN1_GENERALIZEDTIME),
/barrelfish-2018-10-04/lib/tzcode/zic/
H A Dzdump.c13 ** This code has been made independent of the rest of the time
23 #include <time.h> /* for struct tm */
311 (void) time(&now);
/barrelfish-2018-10-04/doc/015-disk-driver-arch/
H A Dfuture.tex20 \section{Handling multiple AHCI controllers at the same time}
/barrelfish-2018-10-04/doc/023-coreboot/
H A Dcoreboot.tex79 ``corectrl'' is generated at build time and can be used to do target core
115 time-slices evenly among different KCBs and switches KCBs after a given amount
116 of time has passed. Currently, the CPU driver uses round-robin scheduling for
219 retrieved at a different point in time.
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/core/
H A Daddr.c193 static void set_timeout(unsigned long time) argument
197 delay = time - jiffies;
/barrelfish-2018-10-04/tools/harness/tests/
H A Dwebserver.py10 import re, socket, httplib, traceback, os, subprocess, datetime, glob, time namespace
31 # sleep time between runs (seconds)
295 time.sleep(HTTPERF_SLEEPTIME)
/barrelfish-2018-10-04/lib/libc/gen/
H A Dsem.c72 #include <time.h>
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/
H A Dtutorial.tex88 At the same time we provide a number of programming concepts, standard templates that can be used for many ECLiPSe programming tasks. A knowledge of these concepts helps the programmer not only to understand existing code more rapidly, but also should lead to standard solutions whenever a new problem has to be solved.
174 The API \index{API}(application programmer's interface) definition should be finished and signed-off by the designers of the main application and of the problem solver before any code is written\footnote{This doesn't mean that the interface can't evolve over time, but at each time point there should be a current, valid definition of the API accepted by all concerned.}. The syntax of each query (predicate) should be defined completely, stating the argument structure and types for both input and outputs. A mode declaration should be used to indicate input and output arguments.
182 \item[consistent] The data should be consistent overall, so that different records can be used without verifying their correctness every time. This can increase processing speed dramatically, and simplifies the code inside the application.
239 It may not be immediately obvious, but it is very important to clearly separate the different phases. For example, it sometimes may seem faster to generate some variables together with the constraints that are set up between them, as this will save at least one scan of the data structure. But at the same time it makes it much more difficult to disable this constraint or to rearrange the constraints in a different order.
430 \item[data files] The second alternative is to use data files in a fixed format. The ECLiPSe program then has to read these files and build the internal data structures at the same time. Depending on the format, this may require parsing the input format with definite clause grammars (DCG) \index{DCG}\index{definite clause grammar}(see section \ref{howtousedcgs}), adding to the development effort\footnote{ECLiPSEe 5.4 contains a freeware XML (http://www.xml.org) parser which handles most of the detail of parsing XML files. This makes the use of XML as a data exchange format for ECLiPSe are very exiting new possibility. The parser is described in the ``Third Party Library'' section of the reference manual.}. But as the files can be read and written easily, it is quite simple to create test data sets and to analyze problems by hand. The design for the fixed format may require some extra effort if we want to use the full character set for atoms and strings. A proper quoting mechanism may be required in order to distinguish say a comma separator from a comma contained inside a data field.
442 Which of these methods should be used? This depends on the application. Passing data as arguments clearly is the cleanest way, but requires significant work on the interface and on code for testing. Using data files in fixed formats is simple if the format is defined correctly, but its use of the file system can cause problems when multiple queries should be run concurrently on the same machine. Using Prolog terms in data files has the same disadvantage, but is very simple to use if different ECLiPSe systems exchange data. EXDR files are the safest form to store data, but also the least intuitive. Using queues instead of files avoids problems with multiple instances running at the same time, but require some form of logging to allow debugging. Using facts is a valid alternative if most of the data do not change from one query to the next, but requires extra work to reclaim memory after each change. The following table tries to summarize the advantages and disadvantages of each method.
548 Experience has shown that the testing\index{testing} and tuning\index{tuning} of an application are by far the most time consuming activities in the development of a LSCO system. It is very important that we prepare test data sets as early as possible, together with some test routines which exercise our API queries with these tests.
754 We can use multiple {\it foreacharg} keywords to scan multiple vectors at the same time, but we cannot use {\it foreacharg} to create terms\index{create terms} (we do not know the functor of the term). If we want to create a new term, we have to generate it with the right functor and arity before the {\it do} loop. The following code segment performs vector addition\index{vector addition} $\vec{C} = \vec{A}+ \vec{B}$.
870 time
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/apps/
H A Ddhparam.c116 #include <time.h>
332 BIO_printf(bio_err,"This is going to take a long time\n");
H A Ddsaparam.c70 #include <time.h>
301 BIO_printf(bio_err,"This could take some time\n");
323 BIO_printf(bio_err,"DSA key generation time-stopped\n");
H A Drsa.c64 #include <time.h>
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/
H A Dbn_prime.c113 #include <time.h>

Completed in 286 milliseconds

1234567891011>>