Searched refs:time (Results 326 - 350 of 381) sorted by relevance

<<111213141516

/barrelfish-2018-10-04/lib/openssl-1.0.0d/ssl/
H A Dssl_locl.h146 #include <time.h>
362 * over time, since the export control rules are no static technical issue.
H A Ds3_clnt.c186 unsigned long Time=(unsigned long)time(NULL);
630 Time=(unsigned long)time(NULL); /* Time */
/barrelfish-2018-10-04/include/lwip2/netif/ppp/
H A Dchap_ms.c86 #include <sys/time.h>
/barrelfish-2018-10-04/usr/replay/
H A Dmaster.c18 #include <sys/time.h>
/barrelfish-2018-10-04/lib/tommath/
H A Dbn.tex155 LibTomMath can configured at build time in three phases we shall call ``depends'', ``tweaks'' and ``trims''.
289 Essentially the only time you wouldn't use LibTomMath is when blazing speed is the primary concern. However,
455 from the heap at the same time.
1272 tuning takes a very long time as the cutoff points are likely to be very high.
1517 much faster than both Barrett and Montgomery reductions as they have a much lower asymtotic running time.
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Dembjava.tex844 message along a queue every time an element of the search state
862 listener at any one time.
892 TermProducer}, each time its {\tt dataRequest} method is invoked, sends
941 that time, it will handle the event. Otherwise, the event handling
1210 \item Only one such engine can exist in a Java virtual machine at any one time.
1276 virtual machine at any one time.
1359 connection. By the time it connects, the Java program must have the
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/
H A Dkernel.tex1322 Their addresses are used as the time stamps.
1467 at the time the untrail function is called. If the undo function
1469 sure at trail time that the data that is referenced by the trail
1483 (during GC) that the item has been modified at trailing time, so
1524 This is done so that the next time an assignment is attempted, the
1568 at the same time, for example. The variety of {\eclipse}'s constraint\index{constraint}
1713 at compile time, this stack can be built from temporaries (every
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dsearch.tex474 disappointment: the time increases dramatically!
869 Another form of incomplete tree search is simply to use time-outs.
898 means it follows the heuristic exactly). Each time LDS fails to find
H A Dreal.tex516 \texttt{ordered_sum/2}. How does the run time compare with the original?
H A Dicintro.tex389 run time, then one must wrap it in \texttt{eval/1}:}
753 an index is equal to a value. Every time the index or the value is updated,
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/
H A Dsearch.tex470 disappointment: the time increases dramatically!
757 Another form of incomplete tree search is simply to use time-outs.
800 means it follows the heuristic exactly). Each time LDS fails to find
1637 at the same time. The operator will fail when \verb'[A,B,C]' becomes ground
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dexthsusp.tex110 At any time, the system attempts to solve the most urgent subgoal first.
892 \item and it might at the same time have other waking conditions left
1048 this will only have an effect at the time the suspension gets
1585 Therefore, \about{N} is not yet instantiated at the time of the arithmetic test
H A Dumssocket.tex287 % Parse the up/down time and if the machine is down, return 0
/barrelfish-2018-10-04/usr/eclipseclp/documents/visualisation/
H A Dannotate.tex156 time when the viewable is existent.
/barrelfish-2018-10-04/doc/009-notifications/
H A DNotify.tex233 the currently running DCB, and ideally the time at which it will next
/barrelfish-2018-10-04/doc/015-disk-driver-arch/
H A Dlibahci.tex86 is grown. This is done in steps of 8 megabytes at a time. Growing the pool
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Demu_par.c54 #include <sys/time.h>
/barrelfish-2018-10-04/usr/eclipseclp/Pds/src/
H A Dnsrv_server.c33 #include <sys/time.h>
254 ** a later time, i.e. when the port is unblocked.
821 fprintf(stderr, "nsrv: CPU time limit exceeded !\n");
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dextconjunto.tex479 sets are labeled one after the other. Each time one set is labeled,
546 information retrieval,time tabling problems, location problems,
/barrelfish-2018-10-04/lib/openssl-1.0.0d/apps/
H A Dreq.c67 #include <time.h>
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/asn1/
H A Dasn1.h62 #include <time.h>
/barrelfish-2018-10-04/include/vm/
H A Dvm_pageout.c96 #include <sys/time.h>
736 * time for a vnode lock.
767 * of time.
1340 * of time because it cannot reclaim memory. This function computes
1535 * to bound the amount of time that a thread might wait.
1550 * CPU time.
/barrelfish-2018-10-04/lib/zlib/
H A Dinflate.c36 * - Add compile time option, POSTINC, to use post-increments instead (Intel?)
199 first time it's called, and returns those tables the first time and
201 exchange for a little execution time. However, BUILDFIXED should not be
655 state->head->time = hold;
1275 /* if first time, start search in bit buffer */
/barrelfish-2018-10-04/include/openssl/
H A Dasn1.h62 #include <time.h>
/barrelfish-2018-10-04/doc/002-mackerel/
H A DMackerel.tex228 parse this at the same time as the main file, along with this file's
434 associated index and data registers) from the legacy PC real-time
684 same time, with the same name.
1950 \item[Checks.hs] Compile-time checks.
1955 \item[Poly.hs] Polynomial arithmetic for compile-time expression

Completed in 198 milliseconds

<<111213141516