/barrelfish-2018-10-04/lib/timer/ |
H A D | timer.c | 58 * Did we already request the remaining time but not yet see a reply? 113 * \brief Handle a remaining time message from the timer driver. 140 .remaining = remaining_handler, 383 * \brief Insert pending timers given the remaining time on the top timer. 385 * This function is given the remaining time of the currently-running timer, 389 static void timer_insert_pending(uint64_t remaining) argument 392 if (timer_queue != NULL && timer_queue->expires > remaining) { 393 timer_queue->expires = remaining; 481 // add to pending insertion queue, send off request for the remaining time 551 * \brief Return remaining tim 585 uint64_t remaining = 0; local [all...] |
/barrelfish-2018-10-04/usr/drivers/solarflair/sfxge/common/ |
H A D | efx_bootcfg.c | 250 size_t remaining; local 294 for (offset = 0; offset < sector_length; offset += remaining) { 295 remaining = MIN(chunk_length, sector_length - offset); 301 MIN(remaining, used_bytes - offset)); 308 offset, (caddr_t)chunk, remaining)) != 0)
|
/barrelfish-2018-10-04/usr/drivers/lpc_timer/ |
H A D | main.c | 105 // update this client with whatever time it had remaining 139 // update remaining time of current (running) timeout 372 uint64_t remaining = 0; local 378 // If the client is in the queue, calculate remaining time of its timer 382 // update remaining time for element at head of queue (read HW) 387 remaining += t->expiry; 392 err = b->tx_vtbl.remaining(b, NOP_CONT, remaining);
|
/barrelfish-2018-10-04/lib/compiler-rt/builtins/ |
H A D | fp_add_impl.inc | 34 // +/-infinity + anything remaining = +/- infinity 38 // anything remaining + +/-infinity = +/-infinity
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | idb.pl | 29 % All remaining content of thif file has been moved to kernel.pl
|
H A D | branch_and_bound.pl | 677 <DD>after finding a solution, split the remaining cost range 679 If that fails, assume the upper sub-range as the remaining 937 <DD>after finding a solution, split the remaining cost range 939 If that fails, assume the upper sub-range as the remaining
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/util/ |
H A D | mkdef.pl | 1489 my %existing; my @remaining; 1490 @remaining=(); 1497 push @remaining, $sym; 1500 if(@remaining) { 1502 foreach $sym (@remaining) {
|
/barrelfish-2018-10-04/usr/acpi/ |
H A D | intel_vtd.c | 530 uint64_t mapped, remaining, vaddr, paddr; local 532 remaining = max_addr; 533 while (remaining > 0) { 537 remaining -= mapped;
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/ |
H A D | backwards-sec.tex | 44 few aspects remaining where minor changes in an application
|
H A D | intro-sec.tex | 157 The remaining differences are discussed in chapter \ref{backwards-compat}.
|
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/controller/ehci/ |
H A D | usb_ehci_xfer.c | 434 * we are in the precomputing phase, so update remaining 467 /* update the remaining length to process */ 625 * setup the remaining frames 806 uint16_t remaining = actual_length % xfer->max_packet_size; local 808 if (remaining > 0) {
|
/barrelfish-2018-10-04/lib/vfs/ |
H A D | vfs_fat.c | 722 // limited requested bytes to remaining file size 738 size_t remaining = bytes; local 747 size_t read_size = remaining; 788 remaining -= read_size; 793 } while (remaining);
|
/barrelfish-2018-10-04/lib/lwip2/src/api/ |
H A D | api_msg.c | 1447 u32_t remaining = msg->msg.r.len; local 1449 u16_t recved = (remaining > 0xffff) ? 0xffff : (u16_t)remaining; 1451 remaining -= recved; 1452 } while (remaining != 0);
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | frequency.pl | 83 % assigned yet in order to construct the domain of the remaining
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/sha/asm/ |
H A D | sha512-ppc.pl | 272 $PUSH $num,`$FRAME-$SIZE_T*25`($sp) ; save real remaining num 277 $POP $num,`$FRAME-$SIZE_T*25`($sp) ; restore real remaining num
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/ |
H A D | search.tex | 148 represent choices which partition the remaining search space into two 557 %The size of the (remaining) search space can be computed easily 559 %sizes of all the (remaining) variable's domains: 1419 a value to a variable, in which all the values in the remaining domain of the 1487 tentative values for remaining unlabelled variables as a variable is 1538 containing the variables remaining to be labelled (initially all the 1573 to strip attributes (domains etc) from any remaining variables in Vars.}: 1600 routine recursively tries to label the remaining unlabelled variables. If
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/rc4/asm/ |
H A D | rc4-ia64.pl | 140 # - We can't replace any of the remaining "add/zxt1" pairs with 721 /* Do the remaining bytes via the compact, modulo-scheduled loop */
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | constimpl.tex | 360 The remaining goals are ordered according to their {\bf priority}. 486 information has been incorporated into the remaining variable's domain. 488 wake up when the remaining variable gets instantiated as well, at which time
|
H A D | fdintro.tex | 442 First it tries to match the (remaining) demand with zero, 649 labelling the remaining variables. 659 The remaining variables are labelled using the first fail heuristic
|
H A D | search.tex | 127 represent choices which partition the remaining search space into two 574 %The size of the (remaining) search space can be computed easily 576 %sizes of all the (remaining) variable's domains: 832 leftmost child node, half of the remaining credit to the second child node 833 and so on. Any remaining credit after the last child node is lost.
|
H A D | icintro.tex | 947 First it tries to match the (remaining) demand with zero, 1100 labelling the remaining variables. 1108 The remaining variables are labelled by employing the first fail heuristic
|
H A D | repairtut.tex | 205 Instantiating the remaining variables to their tentative values, when 219 \item \verb0set_to_tent0 to set the remaining variables to their
|
H A D | prolog.tex | 630 remaining ones. This is called a {\em choice point}. 728 remaining choice-point, unifying clause 6 is unified with the goal, 997 the cut here is to prune away all the remaining solutions to \verb'prime(X,P)'
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | extmeta.tex | 279 For variable-variable bindings, typically the remaining attribute must 585 If it contains exactly one value, we can instantiate the remaining 588 the remaining admissible values.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | gc.tex | 15 the remaining alternative clauses don't happen to need them.}).
|