Searched refs:up (Results 1 - 25 of 199) sorted by relevance

12345678

/barrelfish-2018-10-04/lib/libc/sys/barrelfish/
H A Doldsys_morecore.c45 Header *up; local
50 up = (Header *)sys_morecore_alloc(nb, &nb);
51 if (up == NULL) {
55 up->s.size = nb / sizeof(Header);
58 __free_locked((void *)(up + 1));
65 * Tries to free up pages at the end of the segment, so to shorten the
/barrelfish-2018-10-04/lib/openssl-1.0.0d/engines/
H A De_cswift.c280 /* Ensure the cswift error handling is set up */
493 * up. */
532 sw_param.up.exp.modulus.nbytes = BN_bn2bin(m,
534 sw_param.up.exp.modulus.value = (unsigned char *)modulus->d;
535 sw_param.up.exp.exponent.nbytes = BN_bn2bin(p,
537 sw_param.up.exp.exponent.value = (unsigned char *)exponent->d;
622 sw_param.up.crt.p.value = NULL;
623 sw_param.up.crt.q.value = NULL;
624 sw_param.up.crt.dmp1.value = NULL;
625 sw_param.up
[all...]
/barrelfish-2018-10-04/lib/barrelfish/
H A Dheap.c148 union heap_header *up; local
153 up = (union heap_header*)pages_alloc(nb / BASE_PAGE_SIZE);
154 up->s.size = nb / sizeof(union heap_header);
157 heap_free(heap, (void *)(up + 1));
158 return up;
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/include/linux/
H A Dsemaphore.h47 #define up(_sem) sema_post(&(_sem)->sema) macro
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Drounding_control.h89 ** This should be called once at program start-up. It computes the
489 # define up(x) (result_inexact ? Up(x) : x) macro
493 # define up(x) (result_inexact ? Up(x) : x) macro
499 # define up(x) Up(x) macro
503 # define up(x) Up(x) macro
509 # define up(x) (x) macro
H A Dintervals.c34 ceiling(E) round up to integral value
375 ** modes we probably need to do the calculations twice: once rounding up and
667 *upb = up(exp(xu));
703 *lwb = down(ls); *upb = up(us);
710 *lwb = -1.0; *upb = up(max(ls, us));
715 *lwb = down(us); *upb = up(ls);
747 res = roundup ? up(Pow(x,(double)n)) : down(Pow(x,(double)n));
934 upb = up(sqrt(xu));
957 upb = up(log(xu));
964 upb = up(ata
[all...]
H A Dmem.c554 _stack_init(struct stack_header *down, struct stack_header *up, uword words_needed) argument
565 stack->up = up;
592 if (stack->up)
593 *pstack = stack = stack->up; /* go to the next segment */
596 *pstack = stack = stack->up = _stack_init(stack, stack->up, words_needed);
638 while (stack->up)
639 stack = stack->up;
1126 s += (map_alignment - offset); /* round up */
[all...]
/barrelfish-2018-10-04/lib/gdtoa/
H A Dgethex.c48 int big, esign, havedig, irv, j, k, n, n0, nbits, up, zret; local
311 up = 0;
318 up = 1;
321 up = 1 - sign;
324 up = sign;
326 if (up) {
/barrelfish-2018-10-04/lib/lwip/src/core/ipv4/
H A Dinet.c45 #define in_range(c, lo, up) ((u8_t)c >= lo && (u8_t)c <= up)
92 * Collect number up to ``.''.
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/des/times/
H A Dusparc.cc5 I believe the difference is tied up in optimisation that the compiler
/barrelfish-2018-10-04/include/lwip2/netif/ppp/
H A Dfsm.h109 void (*up) /* Called when fsm reaches PPP_FSM_OPENED state */ member in struct:fsm_callbacks
/barrelfish-2018-10-04/lib/lwip2/src/core/ipv4/
H A Dip4_addr.c117 #define in_range(c, lo, up) ((u8_t)c >= lo && (u8_t)c <= up)
166 * Collect number up to ``.''.
/barrelfish-2018-10-04/lib/lwip2/src/core/ipv6/
H A Dip6_addr.c54 #define in_range(c, lo, up) ((u8_t)c >= lo && (u8_t)c <= up)
/barrelfish-2018-10-04/lib/arranet/
H A Dip_addr.c115 #define in_range(c, lo, up) ((u8_t)c >= lo && (u8_t)c <= up)
164 * Collect number up to ``.''.
/barrelfish-2018-10-04/doc/021-cpudriver/
H A Dcpudriver.tex111 load the initial kernel on the BSP core. In our current set-up we use GRUB as
114 On start-up, GRUB will search the supplied kernel module (on x86-64 this is the
119 \pathname{boot.S} in elver will set-up an preliminary GDT, an IA32-e page-table,
123 this point, we have set-up a 1 GiB identity mapping of the physical address
127 ELF64 images (or setting up long-mode). If we use a bootloader that supports
194 The GDT table is loaded by the \fnname{gdt\_reset} function during start-up and statically defined.
213 The initial (Interrupt Descriptor Table) IDT is set-up by
297 Segment registers are initialized by the \fnname{gdt\_reset} function during start-up and each of them points to a GDT entry (index of the GDT table slot for each segment is given in brackets).
323 On x86, the serial device (a PC16550 compatible controller) is initialized for the first time by the BSP core on boot-up.
/barrelfish-2018-10-04/lib/lua/src/
H A Dldo.c144 GCObject *up; local
146 for (up = L->openupval; up != NULL; up = up->gch.next)
147 gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack;
655 UpVal *up = luaF_newupval(L); local
656 cl->l.upvals[i] = up;
657 luaC_objbarrier(L, cl, up);
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Ddfid.pl41 * The whole proof tree is expanded up to a given depth.
52 * depth StartDepth, up to the depth MaxDepth,
59 * of the above, where search is performed only up to a certain
/barrelfish-2018-10-04/lib/nfs/
H A Dxdr.c111 xdr_u_int(XDR *xdrs, u_int *up) argument
118 l = (uint32_t) *up;
125 *up = (u_int) l;
/barrelfish-2018-10-04/lib/openssl-1.0.0d/engines/vendor_defns/
H A Dcswift.h54 /* up yet */
212 } up; member in struct:_SW_PARAM
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dic_make_overlap_bivs.pl36 In principle a bivalued variable is set up between each pair of tasks.
95 set_up_biv sets up a Bivalued Variable between the two tasks, if necessary.
98 is set up, (since the value would be zero). If the tasks do
164 This sets up the propagation from start time and duration tentative
H A Dmake_overlap_bivs.pl36 In principle a bivalued variable is set up between each pair of tasks.
95 set_up_biv sets up a Bivalued Variable between the two tasks, if necessary.
98 is set up, (since the value would be zero). If the tasks do
164 This sets up the propagation from start time and duration tentative
/barrelfish-2018-10-04/doc/006-routing/
H A DRouting.tex61 \item On the \emph{Intel Single Chip Cloud Computer} (SCC), the set of memory a core can access is determined by the setup of its Look Up Tables (LUTs). It is possible that these tables are set-up in such a manner that
130 A multi-hop channel can only be set up between two dispatchers running on different cores. It always leads through the two monitors running on each dispatcher's core. Between those two monitors the multi-hop channel can lead through an arbitrary number of additional monitors. We call all the monitors that lie on a multi-hop channel \emph{nodes}. All the nodes of a multi-hop channel must be connected by means of other ICD-links (such as LMP or UMP ICD-links).
132 Once a multi-hop channel is set up, it can be used to exchange messages between the two dispatchers. The multi-hop channel transports messages by passing them to the underlying interconnect driver on each link between the nodes of the multi-hop channel.
136 \item A mechanism to set up new multi-hop channels between dispatchers addressed by end-point identifiers
157 Messaging in Barrelfish is connection-oriented: messages are passed via an explicit binding object, which encapsulates one half of a connection, and such a binding must be established in advance. Therefore, we have decided to support only connection-oriented multi-hop messaging (for now). The multi-hop interconnect driver is designed in such a way that channel set-up is collapsed into the binding phase.
161 Each monitor maintains a forwarding table. For each multi-hop channel, entries are created in the forwarding tables at all the nodes of that channel. Messages that are sent over the channel are forwarded at each node according to its forwarding table. Those entries in the forwarding tables can be seen as per-channel created \emph{hard} state: It is explicitly created at channel set-up and deleted at channel tear-down. Additionally to the entries in the forwarding table, per-channel created state includes bindings to the neighbouring nodes on the multi-hop channel.
163 In addition to the forwarding table, each node maintains a routing table. The routing table is used for channel set-up: If a node receives a channel set-up request, it determines where to forward the request with the help of its routing table.
170 \caption{Basic set-up}\label{fig:multihop-chan}
175 A multi-hop channel is multiplexed over the available ICD links. However, for each multi-hop channel, there will be two additional ICD links: Two additional LMP channels will be created between the client's dispatcher and the monitor running on its core and between the service's dispatcher and the monitor on its core. LMP channels are rather cheap - they do not require polling and require only a small amount of memory. Therefore, this does not compromise our goal of optimizing resource usage. Figure~\ref{fig:multihop-chan} shows an example set-up o
[all...]
/barrelfish-2018-10-04/lib/libc/xdr/
H A Dxdr.c130 xdr_u_int(XDR *xdrs, u_int *up) argument
137 l = (u_long) *up;
144 *up = (u_int) l;
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dtrees.pl15 and put_label work is worth noting: they build up a pattern which
18 build up a path to the root. They still cost O(lg N) time rather
20 with no duplications. put_label simultaneously builds up a pattern
/barrelfish-2018-10-04/lib/lwip2/src/netif/ppp/
H A Dfsm.c89 * fsm_lowerup - The lower layer is up.
158 * fsm_open - Link is allowed to come up.
440 if (f->callbacks->up)
441 (*f->callbacks->up)(f); /* Inform upper layers */
495 if (f->callbacks->up)
496 (*f->callbacks->up)(f); /* Inform upper layers */
729 * Make up the request packet

Completed in 258 milliseconds

12345678