Searched refs:last (Results 1 - 25 of 189) sorted by relevance

12345678

/barrelfish-master/usr/drivers/usb/usb_manager/controller/ehci/
H A Dusb_ehci_queue.c60 * \param last the last element of the list
63 usb_ehci_sitd_t *last)
68 sitd->next = last->next;
69 sitd->prev = last;
70 last->next = sitd;
75 sitd->sitd_next = last->sitd_next;
76 last->sitd_next = sitd->sitd_self;
85 * \param last the last elemen
62 usb_ehci_enq_fs_td(usb_ehci_sitd_t *sitd, usb_ehci_sitd_t *last) argument
87 usb_ehci_deq_fs_td(usb_ehci_sitd_t *sitd, usb_ehci_sitd_t *last) argument
113 usb_ehci_enq_hs_td(usb_ehci_itd_t *std, usb_ehci_itd_t *last) argument
138 usb_ehci_deq_hs_td(usb_ehci_itd_t *std, usb_ehci_itd_t *last) argument
163 usb_ehci_enq_qh(usb_ehci_qh_t *qh, usb_ehci_qh_t *last) argument
192 usb_ehci_deq_qh(usb_ehci_qh_t *qh, usb_ehci_qh_t *last) argument
[all...]
H A Dusb_ehci_queue.h20 usb_ehci_sitd_t *usb_ehci_enq_fs_td(usb_ehci_sitd_t *std, usb_ehci_sitd_t *last);
21 usb_ehci_sitd_t *usb_ehci_deq_fs_td(usb_ehci_sitd_t *std, usb_ehci_sitd_t *last);
23 usb_ehci_itd_t *usb_ehci_enq_hs_td(usb_ehci_itd_t *std, usb_ehci_itd_t *last);
24 usb_ehci_itd_t *usb_ehci_deq_hs_td(usb_ehci_itd_t *std, usb_ehci_itd_t *last);
26 usb_ehci_qh_t *usb_ehci_enq_qh(usb_ehci_qh_t *qh, usb_ehci_qh_t *last);
27 usb_ehci_qh_t *usb_ehci_deq_qh(usb_ehci_qh_t *qh, usb_ehci_qh_t *last);
/barrelfish-master/usr/drivers/usb/usb_manager/controller/ohci/
H A Dusb_ohci_queue.c22 usb_ohci_ed_t *usb_ohci_remove_qh(usb_ohci_ed_t *ed, usb_ohci_ed_t *last) argument
33 if (last == ed) {
34 last = ed->prev;
43 return last;
46 usb_ohci_ed_t *usb_ohci_append_qh(usb_ohci_ed_t *ed, usb_ohci_ed_t *last) argument
50 return last;
53 ed->next = last->next;
54 ed->ed_nextED = last->ed_nextED;
57 ed->prev = last;
61 last
[all...]
H A Dusb_ohci_queue.h17 usb_ohci_ed_t *usb_ohci_remove_qh(usb_ohci_ed_t *ed, usb_ohci_ed_t *last);
18 usb_ohci_ed_t *usb_ohci_append_qh(usb_ohci_ed_t *ed, usb_ohci_ed_t *last);
/barrelfish-master/lib/libc/string/
H A Dwcsrchr.c35 const wchar_t *last; local
37 last = NULL;
40 last = s;
46 return ((wchar_t *)last);
H A Dmemmem.c41 register char *cur, *last; local
57 /* the last position where its possible to find "s" in "l" */
58 last = (char *)cl + l_len - s_len;
60 for (cur = (char *)cl; cur <= last; cur++)
H A Dwcstok.c42 wchar_t ** __restrict last)
48 if (s == NULL && (s = *last) == NULL)
62 *last = NULL;
80 *last = s;
41 wcstok(wchar_t * __restrict s, const wchar_t * __restrict delim, wchar_t ** __restrict last) argument
H A Dstrtok.c52 __strtok_r(char *s, const char *delim, char **last) argument
57 if (s == NULL && (s = *last) == NULL)
71 *last = NULL;
89 *last = s;
100 static char *last; local
102 return (__strtok_r(s, delim, &last));
/barrelfish-master/include/arch/arm/
H A Dstdarg.h47 #define va_start(ap, last) \
48 __builtin_va_start((ap), (last))
67 #define va_start(ap, last) \
68 ((ap) = (va_list)__builtin_next_arg(last))
70 #define va_start(ap, last) \
71 ((ap) = (va_list)&(last) + __va_size(last))
/barrelfish-master/kernel/arch/x86/
H A Dmisc.c38 uint64_t last, elapsed; local
42 last = arch_get_cycle_count();
46 elapsed += (now - last);
47 last = now;
/barrelfish-master/include/arch/aarch64/
H A Dstdarg.h47 #define va_start(ap, last) \
48 __builtin_va_start((ap), (last))
/barrelfish-master/include/arch/x86_64/
H A Dstdarg.h44 #define va_start(ap, last) \
45 __builtin_va_start((ap), (last))
65 #define va_start(ap, last) \
66 ((ap) = (va_list)&(last) + __va_size(last))
/barrelfish-master/lib/openssl-1.0.0d/apps/
H A Dapp_rand.c168 int last; local
174 last=0;
176 if (*p == '\0') last=1;
187 if (last) break;
/barrelfish-master/usr/gups/
H A Dbench.sh17 sudo last
/barrelfish-master/usr/eclipseclp/icparc_solvers/rxspencer/
H A Ddebug.c25 register int last; local
30 fprintf(d, ", first %ld last %ld", (long)g->firststate,
67 last = -1;
70 if (last < 0) {
72 last = c;
75 if (last >= 0) {
76 if (last != c-1)
79 last = -1;
101 register int last; local
149 last
[all...]
/barrelfish-master/lib/libc/stdlib/
H A Dmerge.c74 #define ICOPY_LIST(src, dst, last) \
77 while(src < last)
83 #define CCOPY_LIST(src, dst, last) \
86 while (src < last)
122 u_char *list2, *list1, *p2, *p, *last, **p1; local
145 last = list2 + nmemb * size;
147 while (*EVAL(list2) != last) {
150 for (tp2 = p2 = list2; p2 != last; p1 = EVAL(l2)) {
154 if (p2 != last)
240 last
279 u_char *f1, *f2, *s, *l2, *last, *p2; local
[all...]
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/
H A Dilog.cc207 make_interval(IlcInt last, IlcInt max, EC_word l, EC_functor dotdot) argument
209 if (last == max) { // Single number
211 } else if (last == max - 1) { // 2-value interval
214 return list(term(dotdot, EC_word(last), EC_word(max)), l);
237 IlcInt last = max; local
239 while (v.getNextLower(last) != last) {
240 IlcInt lower = v.getNextLower(last);
241 if (lower == last - 1) {
242 last
[all...]
/barrelfish-master/usr/bench/bomp_progress/
H A Dcpu_bound.c50 uint64_t last = glast; local
55 if(rdtsc() >= last + PERIOD) {
H A Dsync.c39 uint64_t last; local
41 /* uint64_t last = rdtsc(); */
42 /* while(rdtsc() < last + PERIOD) { */
65 last = rdtsc();
75 if(rdtsc() >= last + PERIOD) {
90 last += PERIOD;
/barrelfish-master/lib/tenaciousd/
H A Dqueue.c38 uint64_t last; member in struct:queue_header
132 queue->last = header->end;
148 queue->last = queue->end;
159 header->last = header->end;
172 queue->last = header->last;
194 header->last = queue->last;
230 element->prev = queue->last;
231 queue->last
248 uint64_t last = queue->last; local
[all...]
/barrelfish-master/lib/acpica/tests/aslts/bin/
H A DDo142 1) msg="Compare the last multi-result against the previous one:";;
143 2) msg="Compare the last multi-result against the specified one:";;
151 # Compare the last multi-result against the previous one
155 local x previous last DIR0 DIR1
158 last=`echo "$x" | awk -F: '{ print $2}'`
161 if [ -n "$previous" -a -n "$last" ]; then
164 DIR1="$1/$last"
167 echo " the last multi-result : $last"
173 elif [ -n "$last" ]; the
[all...]
/barrelfish-master/lib/libc/db/btree/
H A Dbt_overflow.c61 * A single DBT is written to each chain, so a lot of space on the last page
134 PAGE *h, *last; local
145 for (last = NULL, p = dbt->data, sz = dbt->size;;
146 p = (char *)p + plen, last = h) {
158 if (last) {
159 last->nextpg = h->pgno;
160 mpool_put(t->bt_mp, last, MPOOL_DIRTY);
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/net/mlx4/
H A Dalloc.c52 obj = find_next_zero_bit(bitmap->table, bitmap->max, bitmap->last);
61 bitmap->last = (obj + 1);
62 if (bitmap->last == bitmap->max)
63 bitmap->last = 0;
116 obj = find_aligned_range(bitmap->table, bitmap->last, bitmap->max, cnt,
127 if (obj == bitmap->last) {
128 bitmap->last = (obj + cnt);
129 if (bitmap->last >= bitmap->max)
130 bitmap->last = 0;
154 bitmap->last
[all...]
/barrelfish-master/usr/skb/octopus/
H A Dbitfield.h18 int32_t bitfield_union(struct bitfield** fields, size_t field_count, int32_t last);
/barrelfish-master/lib/zlib/
H A Dinfback.c257 code last; /* parent table entry */ local
271 state->last = 0;
280 /* Inflate until end of block marked as last */
285 if (state->last) {
291 state->last = BITS(1);
296 state->last ? " (last)" : ""));
302 state->last ? " (last)" : ""));
307 state->last
[all...]

Completed in 210 milliseconds

12345678