/netbsd-current/external/gpl2/lvm2/dist/lib/datastruct/ |
H A D | list.c | 22 * The list head's next and previous pointers point back to itself. 24 void dm_list_init(struct dm_list *head) argument 26 head->n = head->p = head; 30 * Insert an element before 'head'. 31 * If 'head' is the list head, this adds an element to the end of the list. 33 void dm_list_add(struct dm_list *head, struct dm_list *elem) argument 35 assert(head 48 dm_list_add_h(struct dm_list *head, struct dm_list *elem) argument 73 dm_list_move(struct dm_list *head, struct dm_list *elem) argument 82 dm_list_empty(const struct dm_list *head) argument 90 dm_list_start(const struct dm_list *head, const struct dm_list *elem) argument 98 dm_list_end(const struct dm_list *head, const struct dm_list *elem) argument 106 dm_list_first(const struct dm_list *head) argument 114 dm_list_last(const struct dm_list *head) argument 122 dm_list_prev(const struct dm_list *head, const struct dm_list *elem) argument 130 dm_list_next(const struct dm_list *head, const struct dm_list *elem) argument 138 dm_list_size(const struct dm_list *head) argument [all...] |
H A D | list.h | 24 * A list consists of a list head plus elements. 26 * The list head's pointers point to the first and the last element. 35 * The list head's next and previous pointers point back to itself. 38 void dm_list_init(struct dm_list *head); 41 * Insert an element before 'head'. 42 * If 'head' is the list head, this adds an element to the end of the list. 44 void dm_list_add(struct dm_list *head, struct dm_list *elem); 47 * Insert an element after 'head'. 48 * If 'head' i [all...] |
/netbsd-current/external/gpl2/lvm2/dist/libdm/datastruct/ |
H A D | list.c | 23 * The list head's next and previous pointers point back to itself. 25 void dm_list_init(struct dm_list *head) argument 27 head->n = head->p = head; 31 * Insert an element before 'head'. 32 * If 'head' is the list head, this adds an element to the end of the list. 34 void dm_list_add(struct dm_list *head, struct dm_list *elem) argument 36 assert(head 49 dm_list_add_h(struct dm_list *head, struct dm_list *elem) argument 74 dm_list_move(struct dm_list *head, struct dm_list *elem) argument 83 dm_list_empty(const struct dm_list *head) argument 91 dm_list_start(const struct dm_list *head, const struct dm_list *elem) argument 99 dm_list_end(const struct dm_list *head, const struct dm_list *elem) argument 107 dm_list_first(const struct dm_list *head) argument 115 dm_list_last(const struct dm_list *head) argument 123 dm_list_prev(const struct dm_list *head, const struct dm_list *elem) argument 131 dm_list_next(const struct dm_list *head, const struct dm_list *elem) argument 139 dm_list_size(const struct dm_list *head) argument [all...] |
H A D | list.h | 24 * A list consists of a list head plus elements. 26 * The list head's pointers point to the first and the last element. 35 * The list head's next and previous pointers point back to itself. 38 void dm_list_init(struct dm_list *head); 41 * Insert an element before 'head'. 42 * If 'head' is the list head, this adds an element to the end of the list. 44 void dm_list_add(struct dm_list *head, struct dm_list *elem); 47 * Insert an element after 'head'. 48 * If 'head' i [all...] |
/netbsd-current/libexec/httpd/ |
H A D | netbsd_queue.h | 55 #define SIMPLEQ_INIT(head) do { \ 56 (head)->sqh_first = NULL; \ 57 (head)->sqh_last = &(head)->sqh_first; \ 60 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ 62 *(head)->sqh_last = (elm); \ 63 (head)->sqh_last = &(elm)->field.sqe_next; \ 66 #define SIMPLEQ_FOREACH(var, head, field) \ 67 for ((var) = ((head)->sqh_first); \ 71 #define SIMPLEQ_FOREACH_SAFE(var, head, fiel [all...] |
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/ |
H A D | mechqueue.h | 47 #define HEIM_SLIST_HEAD_INITIALIZER(head) \ 58 #define HEIM_SLIST_INIT(head) do { \ 59 (head)->slh_first = NULL; \ 67 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \ 68 (elm)->field.sle_next = (head)->slh_first; \ 69 (head)->slh_first = (elm); \ 72 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \ 73 (head)->slh_first = (head)->slh_first->field.sle_next; \ 76 #define HEIM_SLIST_REMOVE(head, el [all...] |
/netbsd-current/sys/external/bsd/drm2/dist/drm/nouveau/dispnv50/ |
H A D | nouveau_dispnv50_curs907a.c | 30 curs907a_new(struct nouveau_drm *drm, int head, s32 oclass, argument 33 return curs507a_new_(&curs507a, drm, head, oclass, 34 0x00000001 << (head * 4), pwndw);
|
H A D | nouveau_dispnv50_ovly917e.c | 42 ovly917e_new(struct nouveau_drm *drm, int head, s32 oclass, argument 45 return ovly507e_new_(&ovly907e, ovly917e_format, drm, head, oclass, 46 0x00000004 << (head * 4), pwndw);
|
/netbsd-current/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/disp/ |
H A D | nouveau_nvkm_engine_disp_head.c | 29 #include "head.h" 39 struct nvkm_head *head; local 40 list_for_each_entry(head, &disp->head, head) { 41 if (head->id == id) 42 return head; 49 struct nvkm_head *head, void *data, u32 size) 56 nvif_ioctl(object, "head scanoutpos size %d\n", size); 58 nvif_ioctl(object, "head scanoutpo 48 nvkm_head_mthd_scanoutpos(struct nvkm_object *object, struct nvkm_head *head, void *data, u32 size) argument 88 struct nvkm_head *head = *phead; local 101 struct nvkm_head *head; local [all...] |
/netbsd-current/external/bsd/ntp/dist/sntp/libevent/ |
H A D | ht-internal.h | 43 #define HT_EMPTY(head) \ 44 ((head)->hth_n_entries == 0) 46 /* How many elements in 'head'? */ 47 #define HT_SIZE(head) \ 48 ((head)->hth_n_entries) 51 #define HT_MEM_USAGE(head) \ 52 (sizeof(*head) + (head)->hth_table_length * sizeof(void*)) 54 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (el [all...] |
/netbsd-current/external/bsd/libevent/dist/ |
H A D | ht-internal.h | 42 #define HT_EMPTY(head) \ 43 ((head)->hth_n_entries == 0) 45 /* How many elements in 'head'? */ 46 #define HT_SIZE(head) \ 47 ((head)->hth_n_entries) 50 #define HT_MEM_USAGE(head) \ 51 (sizeof(*head) + (head)->hth_table_length * sizeof(void*)) 53 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (el [all...] |
/netbsd-current/sys/dev/dm/ |
H A D | dm_table.c | 67 dm_table_busy(dm_table_head_t *head, uint8_t table_id) argument 71 mutex_enter(&head->table_mtx); 74 id = head->cur_active_table; 76 id = 1 - head->cur_active_table; 78 head->io_cnt++; 80 mutex_exit(&head->table_mtx); 88 dm_table_unbusy(dm_table_head_t *head) argument 91 KASSERT(head->io_cnt != 0); 93 mutex_enter(&head->table_mtx); 95 if (--head 105 dm_table_get_entry(dm_table_head_t *head, uint8_t table_id) argument 117 dm_table_release(dm_table_head_t *head, uint8_t table_id) argument 127 dm_table_switch_tables(dm_table_head_t *head) argument 147 dm_table_destroy(dm_table_head_t *head, uint8_t table_id) argument 185 dm_table_size_impl(dm_table_head_t *head, int table) argument 215 dm_table_size(dm_table_head_t *head) argument 225 dm_inactive_table_size(dm_table_head_t *head) argument 235 dm_table_disksize(dm_table_head_t *head, uint64_t *numsecp, unsigned int *secsizep) argument 281 dm_table_get_target_count(dm_table_head_t *head, uint8_t table_id) argument 306 dm_table_head_init(dm_table_head_t *head) argument 324 dm_table_head_destroy(dm_table_head_t *head) argument 340 dm_table_head_t *head; local [all...] |
/netbsd-current/external/bsd/openldap/dist/include/ |
H A D | ldap_queue.h | 69 * added to the list after an existing element or at the head of the list. 70 * Elements being removed from the head of the list should use the explicit 77 * head of the list and the other to the tail of the list. The elements are 80 * to the list after an existing element, at the head of the list, or at the 81 * end of the list. Elements being removed from the head of the tail queue 91 * or after an existing element or at the head of the list. A list 94 * A tail queue is headed by a pair of pointers, one to the head of the 98 * after an existing element, at the head of the list, or at the end of 101 * A circle queue is headed by a pair of pointers, one to the head of the 105 * an existing element, at the head o [all...] |
/netbsd-current/sys/external/bsd/drm/dist/bsd-core/ |
H A D | drm_linux_list.h | 43 INIT_LIST_HEAD(struct list_head *head) { argument 44 (head)->next = head; 45 (head)->prev = head; 49 list_empty(struct list_head *head) { argument 50 return (head)->next == head; 54 list_add(struct list_head *new, struct list_head *head) { argument 55 (head) 62 list_add_tail(struct list_head *entry, struct list_head *head) argument [all...] |
/netbsd-current/usr.bin/head/ |
H A D | Makefile | 4 PROG= head
|
/netbsd-current/external/bsd/ntp/dist/sntp/libevent/compat/sys/ |
H A D | queue.h | 48 * added to the list after an existing element or at the head of the list. 49 * Elements being removed from the head of the list should use the explicit 59 * or after an existing element or at the head of the list. A list 62 * A simple queue is headed by a pair of pointers, one the head of the 65 * head of the list. New elements can be added to the list before or after 66 * an existing element, at the head of the list, or at the end of the 69 * A tail queue is headed by a pair of pointers, one to the head of the 73 * after an existing element, at the head of the list, or at the end of 76 * A circle queue is headed by a pair of pointers, one to the head of the 80 * an existing element, at the head o [all...] |
/netbsd-current/crypto/dist/ipsec-tools/src/include-glibc/sys/ |
H A D | queue.h | 50 * added to the list after an existing element or at the head of the list. 51 * Elements being removed from the head of the list should use the explicit 58 * head of the list and the other to the tail of the list. The elements are 61 * to the list after an existing element, at the head of the list, or at the 62 * end of the list. Elements being removed from the head of the tail queue 72 * or after an existing element or at the head of the list. A list 75 * A tail queue is headed by a pair of pointers, one to the head of the 79 * after an existing element, at the head of the list, or at the end of 114 #define SLIST_HEAD_INITIALIZER(head) \ 125 #define SLIST_EMPTY(head) ((hea 427 *head = (struct quehead *)b; local [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/utils/ |
H A D | findsym.pl | 26 my $head = 0; 30 if (!$head) { print "$lib:\n"; $head = 1; }
|
/netbsd-current/sys/altq/ |
H A D | altq_afmap.c | 85 struct afm_head *head; local 87 head = malloc(sizeof(struct afm_head), M_DEVBUF, M_WAITOK|M_ZERO); 88 if (head == NULL) 92 LIST_INIT(&head->afh_head); 94 head->afh_ifp = ifp; 97 LIST_INSERT_HEAD(&afhead_chain, head, afh_chain); 105 struct afm_head *head; local 107 for (head = afhead_chain.lh_first; head != NULL; 108 head 125 struct afm_head *head; local 140 struct afm_head *head; local 185 struct afm_head *head; local 203 struct afm_head *head; local 221 afm_match4(struct afm_head *head, struct flowinfo_in *fp) argument 250 afm_match6(struct afm_head *head, struct flowinfo_in6 *fp) argument 291 struct afm_head *head; local 331 struct afm_head *head; local [all...] |
/netbsd-current/sys/sys/ |
H A D | queue.h | 45 * head of the list. Elements being removed from the head of the list 55 * or after an existing element or at the head of the list. A list 58 * A simple queue is headed by a pair of pointers, one the head of the 61 * head of the list. New elements can be added to the list after 62 * an existing element, at the head of the list, or at the end of the 65 * A tail queue is headed by a pair of pointers, one to the head of the 69 * after an existing element, at the head of the list, or at the end of 107 #define SLIST_HEAD_INITIALIZER(head) \ 118 #define SLIST_FIRST(head) ((hea [all...] |
/netbsd-current/external/bsd/pcc/dist/pcc/cc/driver/ |
H A D | strlist.h | 62 #define STRLIST_FIRST(head) ((head)->first) 64 #define STRLIST_FOREACH(var, head) \ 65 for ((var) = STRLIST_FIRST(head); \ 68 #define STRLIST_FOREACH_MUTABLE(var, head, var2) \ 69 for ((var) = STRLIST_FIRST(head); \ 72 #define STRLIST_EMPTY(head) (STRLIST_FIRST(head) == NULL)
|
/netbsd-current/tests/usr.bin/nbperf/ |
H A D | h_nbperf.sh | 30 head -n $4 $1 | nbperf -m hash.map -o hash.c -a $2 2> /dev/null 32 head -n $4 $1 | ./testprog | $3
|
/netbsd-current/external/bsd/ntp/dist/include/ |
H A D | ntp_keyacc.h | 16 extern KeyAccT* keyacc_new_push(KeyAccT *head, const sockaddr_u *addr, 18 extern KeyAccT* keyacc_pop_free(KeyAccT *head); 19 extern KeyAccT* keyacc_all_free(KeyAccT *head); 20 extern int keyacc_contains(const KeyAccT *head, const sockaddr_u *addr,
|
/netbsd-current/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/fifo/ |
H A D | cgrp.h | 9 struct list_head head; member in struct:nvkm_fifo_cgrp
|
/netbsd-current/lib/libpthread/ |
H A D | pthread_queue.h | 64 #define PTQ_INIT(head) do { \ 65 (head)->ptqh_first = NULL; \ 66 (head)->ptqh_last = &(head)->ptqh_first; \ 69 #define PTQ_INSERT_HEAD(head, elm, field) do { \ 70 if (((elm)->field.ptqe_next = (head)->ptqh_first) != NULL) \ 71 (head)->ptqh_first->field.ptqe_prev = \ 74 (head)->ptqh_last = &(elm)->field.ptqe_next; \ 75 (head)->ptqh_first = (elm); \ 76 (elm)->field.ptqe_prev = &(head) [all...] |