HomeSort by: relevance | last modified time | path
    Searched refs:l_last (Results 1 - 4 of 4) sorted by relevancy

  /src/external/gpl3/binutils/dist/include/
doubly-linked-list.h 340 l_out and l_last should be ideally encapsulated into a list structure
344 LTYPE##_merge_sort_out_append_ (LTYPE **l_out, LTYPE **l_last, \
347 if (*l_last == NULL) \
349 *l_last = n; \
355 (*l_last)->next = n; \
356 n->prev = *l_last; \
357 *l_last = n; \
376 LTYPE *l_out = NULL, *l_last = NULL; \
383 l_l = LTYPE##_merge_sort_out_append_ (&l_out, &l_last, l_l); \
385 l_r = LTYPE##_merge_sort_out_append_ (&l_out, &l_last, l_r);
    [all...]
  /src/external/gpl3/binutils.old/dist/include/
doubly-linked-list.h 340 l_out and l_last should be ideally encapsulated into a list structure
344 LTYPE##_merge_sort_out_append_ (LTYPE **l_out, LTYPE **l_last, \
347 if (*l_last == NULL) \
349 *l_last = n; \
355 (*l_last)->next = n; \
356 n->prev = *l_last; \
357 *l_last = n; \
376 LTYPE *l_out = NULL, *l_last = NULL; \
383 l_l = LTYPE##_merge_sort_out_append_ (&l_out, &l_last, l_l); \
385 l_r = LTYPE##_merge_sort_out_append_ (&l_out, &l_last, l_r);
    [all...]
  /src/external/gpl3/gdb/dist/include/
doubly-linked-list.h 340 l_out and l_last should be ideally encapsulated into a list structure
344 LTYPE##_merge_sort_out_append_ (LTYPE **l_out, LTYPE **l_last, \
347 if (*l_last == NULL) \
349 *l_last = n; \
355 (*l_last)->next = n; \
356 n->prev = *l_last; \
357 *l_last = n; \
376 LTYPE *l_out = NULL, *l_last = NULL; \
383 l_l = LTYPE##_merge_sort_out_append_ (&l_out, &l_last, l_l); \
385 l_r = LTYPE##_merge_sort_out_append_ (&l_out, &l_last, l_r);
    [all...]
  /src/sys/kern/
kern_sleepq.c 202 lwp_t *l2, *l_last = NULL; local
206 l_last = l2;
215 if (l_last != NULL) {
216 LIST_INSERT_AFTER(l_last, l, l_sleepchain);

Completed in 24 milliseconds