Searched refs:first (Results 26 - 50 of 314) sorted by relevance

1234567891011>>

/barrelfish-2018-10-04/usr/eclipseclp/Pds/src/
H A Damsg.c352 amsg_buffer_scratch_t * first; /* first message buffer */ member in struct:aport
368 amsg_buffer_scratch_t * first; /* first message buffer */ member in struct:aport
394 port->first = (amsg_buffer_scratch_t *) 0;
677 (p)->first = (m); \
686 (p)->first = (m); \
702 *(m) = (p)->first; \
703 if ((p)->first == (p)->last) \
706 (p)->first
738 port_t * first; member in struct:__anon1688
[all...]
H A Dbmsg.msg.c911 bmsg_buffer_t *buffer; /* first buffer */
1143 bmsg_buffer_t * first; /* first message buffer */ member in struct:__anon1707
1149 bmsg_buffer_t * first; /* first message buffer */ member in struct:__anon1708
1178 #define MQ_First(q,b) (*(b) = (q)->first)
1187 (q)->first = (b); \
1196 (q)->first = (b); \
1210 *(b) = (q)->first; \
1211 if ((q)->first
1700 emb_sock_t * first; member in struct:__anon1709
1805 identifier_t * first; member in struct:__anon1710
2175 port_t * first; /* first bport */ member in struct:__anon1711
[all...]
H A Damsg.msg.c362 amsg_buffer_scratch_t * first; /* first message buffer */ member in struct:aport
379 amsg_buffer_scratch_t * first; /* first message buffer */ member in struct:aport
406 port->first = (amsg_buffer_scratch_t *) 0;
697 (p)->first = (m); \
707 (p)->first = (m); \
724 *(m) = (p)->first; \
725 if ((p)->first == (p)->last) \
728 (p)->first
762 port_t * first; member in struct:__anon1694
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Dmem.h101 (Temp) = (Temp)->first; \
108 *first; /* first segment */ member in struct:temp_header
147 ((uword *)(((Buf).read_block = (Buf).write_block->first) + 1))
178 struct buffer_block_header *first; member in struct:buffer_block_header
H A Dbip_strings.c404 * in string1 where string2 first occurs.
895 #define S_FIRST 2 /* just after first data char */
929 char *first, *last; local
940 first = last+1;
953 Push_Buffer(last-first+2);
954 while (first <= last)
955 *ss++ = *first++;
957 first = last + 1;
963 first = s;
1238 uint8 first local
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Opium/demo/
H A Dpuzzle.pl40 (first(Friends, MC3), % Clue 3
64 first([X|Xs], X).
H A Dcollect.pl15 In the first clause the first argument in the head should be L-L. \n \
/barrelfish-2018-10-04/usr/tests/cxx/
H A Dcxx11.cpp53 std::cout << kvp.first << std::endl;
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Ddfid.pl37 * Bounded depth-first search rule for Sepia.
40 * 1) Depth-first iterative deepening.
46 * breadth-first search. It is slightly slower than breadth
47 * first search, but it uses much less memory.
58 * 2) Depth-first search with limited depth. This is a special case
H A Dsuspend.pl873 This constraint suspends until its first two arguments are ground.
877 Note: as opposed to ::/2, the first argument cannot be a list.
911 This constraint suspends until its first two arguments are ground.
915 Note: as opposed to #::/2, the first argument cannot be a list.
942 This constraint suspends until its first two arguments are ground.
946 Note: as opposed to $::/2, the first argument cannot be a list.
1261 This constraint suspends until its first two arguments are ground.
1276 This constraint suspends until its first two arguments are ground.
1291 This constraint suspends until its first two arguments are ground.
1306 This constraint suspends until its first tw
[all...]
H A Dqueues.pl11 % The work of producing them in the first place and of
34 head_queue/2, % look at first element of queue
35 serve_queue/3, % remove first element of queue
167 summary:"unifies Head with the first element of the queue",
170 unifies Head with the first element of the queue. The tricky part
183 summary:"removes the first element of the queue for service",
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/asn1/
H A Da_object.c88 int i,first,len=0,c, use_bn; local
105 first= c-'0';
161 if ((first < 2) && (l >= 40))
168 if (!BN_add_word(bl, first * 40))
172 l+=(long)first*40;
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/
H A Dusb_xfer.c45 xfer->xfer_id, queue, &queue->head.first,
94 xfer->xfer_id, queue, &queue->head.first,
201 /* get the first transfer of the queue */
202 struct usb_xfer *next_xfer = q->head.first;
212 q->head.last_next = &(q->head.first);
213 q->head.first = NULL;
221 xfer->xfer_id, q, &q->head.first, q->head.last_next,
230 (&q->head)->last_next = &q->head.first;
231 (&q->head)->first = NULL;
235 if (!(ep->transfers.current || ep->transfers.head.first)) {
[all...]
/barrelfish-2018-10-04/include/vm/
H A Dvm_reserv.c169 vm_page_t pages; /* first page of a superpage */
402 * alignment of the first physical page in the set. If the given value
415 vm_pindex_t first, leftcap, rightcap; local
433 * Assuming that the first page is allocated from a reservation, the
470 * Could at least one reservation fit between the first index to the
471 * left that can be used ("leftcap") and the first index to the right
474 first = pindex - VM_RESERV_INDEX(object, pindex);
480 if (leftcap > first)
491 if (first + maxpages > rightcap) {
508 if (first
611 vm_pindex_t first, leftcap, rightcap; local
[all...]
/barrelfish-2018-10-04/doc/style/
H A Dbftn-template.tex25 % Include version history first
/barrelfish-2018-10-04/usr/skb/testapps/
H A Dcryptotest.c104 static unsigned char *aes_decrypt_in_place(EVP_CIPHER_CTX *e, unsigned char *cipher, unsigned char *plain, int *len, bool first, bool final) argument
108 if (first) {
/barrelfish-2018-10-04/usr/drivers/e10k/
H A De10k_queue.h115 size_t len, void* opaque, int first, int last, size_t totallen,
130 if (first) {
152 size_t len, void* opaque, int first, int last, size_t totallen)
154 return e10k_queue_add_txbuf_ctx(q, phys, len, opaque, first, last, totallen,
323 // returned them to the caller, so they will be returned first
326 // Look for first buffer in chain
366 // TODO: with multi-part packets, we want these flags on the first packet
114 e10k_queue_add_txbuf_ctx(e10k_queue_t* q, uint64_t phys, size_t len, void* opaque, int first, int last, size_t totallen, uint8_t ctx, bool ixsm, bool txsm) argument
151 e10k_queue_add_txbuf(e10k_queue_t* q, uint64_t phys, size_t len, void* opaque, int first, int last, size_t totallen) argument
/barrelfish-2018-10-04/lib/bulk_transfer/backends/net/
H A De10k_queue.h114 size_t len, void* opaque, int first, int last, size_t totallen,
127 if (first) {
148 size_t len, void* opaque, int first, int last, size_t totallen)
150 return e10k_queue_add_txbuf_ctx(q, phys, len, opaque, first, last, totallen,
343 // Look for first segment not returned yet
113 e10k_queue_add_txbuf_ctx(e10k_queue_t* q, uint64_t phys, size_t len, void* opaque, int first, int last, size_t totallen, uint8_t ctx, bool ixsm, bool txsm) argument
147 e10k_queue_add_txbuf(e10k_queue_t* q, uint64_t phys, size_t len, void* opaque, int first, int last, size_t totallen) argument
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/rand/
H A Drand_unix.c142 static int first=1; local
156 if (first) {
157 first = 0;
320 didn't use select() in the first place,
/barrelfish-2018-10-04/lib/zlib/
H A Dcrc32.c16 protection on the static variables used to control the first-use generation
18 first call get_crc_table() to initialize the tables before allowing more than
100 The first table is simply the CRC of all possible eight bit values. This is
112 static volatile int first = 1; /* flag to limit concurrent making */ local
118 if (first) {
119 first = 0;
136 and then the byte reversal of those as well as the first table */
150 else { /* not first */
398 /* apply len2 zeros to crc1 (first square will put the operator for one
/barrelfish-2018-10-04/usr/bench/net_latency/elb/
H A Dbenchmark.c242 static bool first = true; local
272 if (first) {
274 first = false;
/barrelfish-2018-10-04/usr/bench/rcce/bt/
H A Dx_solve.c11 extern void x_backsubstitute(int first, int last, int c);
12 extern void x_solve_cell(int first, int last, int c);
21 // Performs line solves in X direction by first factoring
30 int c, cprev, stage, first, last, error; local
40 // set first/last-cell flags
42 first = (stage == 1);
51 x_solve_cell(first,last,c);
54 // printf("passed \"set first/last-cell flags\"...\n");fflush(0);
61 first = (stage == 1);
69 x_backsubstitute(first,las
211 x_backsubstitute(int first, int last, int c) argument
266 x_solve_cell(int first, int last, int c) argument
[all...]
H A Dy_solve.c9 extern void y_backsubstitute(int first, int last, int c);
10 extern void y_solve_cell(int first, int last, int c);
18 // Performs line solves in Y direction by first factoring
27 int c, cprev, stage, first, last, error; local
38 first = (stage == 1);
45 y_solve_cell(first,last,c);
53 first = (stage == 1);
61 y_backsubstitute(first,last,c);
194 void y_backsubstitute(int first, int last, int c) { argument
248 void y_solve_cell(int first,in argument
[all...]
H A Dz_solve.c9 extern void z_backsubstitute(int first, int last, int c);
10 extern void z_solve_cell(int first, int last, int c);
18 // Performs line solves in Z direction by first factoring
27 int c, cprev, stage, first, last, error; local
38 first = (stage == 1);
45 z_solve_cell(first,last,c);
53 first = (stage == 1);
61 z_backsubstitute(first,last,c);
232 void z_backsubstitute(int first, int last, int c) { argument
286 void z_solve_cell(int first,in argument
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dsearch.tex32 constraints. Let us first recall what we are talking about.
139 Figure \ref{figtreesearch} shows a sample tree search, namely a depth-first
157 \caption{A tree search (depth-first)}
189 \item Find a first solution
231 which explores promising areas first.
234 In the following sections we will first investigate the considerable
250 depth-first, left-to-right search by backtracking. It allows
253 search (e.g. breadth-first) have exponential memory requirements.
255 of {\eclipse}. Note that the main disadvantage of the depth-first
259 \index{depth-first searc
[all...]

Completed in 308 milliseconds

1234567891011>>