| /src/external/gpl3/binutils/dist/libiberty/ |
| insque.c | 6 @deftypefn Supplemental void insque (struct qelem *@var{elem}, @
8 @deftypefnx Supplemental void remque (struct qelem *@var{elem})
11 @code{insque} routine inserts @var{elem} in the queue immediately
12 after @var{pred}. The @code{remque} routine removes @var{elem} from
37 insque (struct qelem *elem, struct qelem *pred)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
47 remque (struct qelem *elem)
[all...] |
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| insque.c | 6 @deftypefn Supplemental void insque (struct qelem *@var{elem}, @
8 @deftypefnx Supplemental void remque (struct qelem *@var{elem})
11 @code{insque} routine inserts @var{elem} in the queue immediately
12 after @var{pred}. The @code{remque} routine removes @var{elem} from
37 insque (struct qelem *elem, struct qelem *pred)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
47 remque (struct qelem *elem)
[all...] |
| /src/external/gpl3/gcc/dist/libiberty/ |
| insque.c | 6 @deftypefn Supplemental void insque (struct qelem *@var{elem}, @
8 @deftypefnx Supplemental void remque (struct qelem *@var{elem})
11 @code{insque} routine inserts @var{elem} in the queue immediately
12 after @var{pred}. The @code{remque} routine removes @var{elem} from
37 insque (struct qelem *elem, struct qelem *pred)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
47 remque (struct qelem *elem)
[all...] |
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| insque.c | 6 @deftypefn Supplemental void insque (struct qelem *@var{elem}, @
8 @deftypefnx Supplemental void remque (struct qelem *@var{elem})
11 @code{insque} routine inserts @var{elem} in the queue immediately
12 after @var{pred}. The @code{remque} routine removes @var{elem} from
37 insque (struct qelem *elem, struct qelem *pred)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
47 remque (struct qelem *elem)
[all...] |
| /src/external/gpl3/gdb/dist/libiberty/ |
| insque.c | 6 @deftypefn Supplemental void insque (struct qelem *@var{elem}, @
8 @deftypefnx Supplemental void remque (struct qelem *@var{elem})
11 @code{insque} routine inserts @var{elem} in the queue immediately
12 after @var{pred}. The @code{remque} routine removes @var{elem} from
37 insque (struct qelem *elem, struct qelem *pred)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
47 remque (struct qelem *elem)
[all...] |
| /src/external/gpl3/gdb.old/dist/libiberty/ |
| insque.c | 6 @deftypefn Supplemental void insque (struct qelem *@var{elem}, @
8 @deftypefnx Supplemental void remque (struct qelem *@var{elem})
11 @code{insque} routine inserts @var{elem} in the queue immediately
12 after @var{pred}. The @code{remque} routine removes @var{elem} from
37 insque (struct qelem *elem, struct qelem *pred)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
47 remque (struct qelem *elem)
[all...] |
| /src/external/gpl2/lvm2/dist/lib/datastruct/ |
| list.c | 33 void dm_list_add(struct dm_list *head, struct dm_list *elem)
37 elem->n = head;
38 elem->p = head->p;
40 head->p->n = elem;
41 head->p = elem;
48 void dm_list_add_h(struct dm_list *head, struct dm_list *elem)
52 elem->n = head->n;
53 elem->p = head;
55 head->n->p = elem;
56 head->n = elem;
[all...] |
| /src/external/gpl2/lvm2/dist/libdm/datastruct/ |
| list.c | 34 void dm_list_add(struct dm_list *head, struct dm_list *elem)
38 elem->n = head;
39 elem->p = head->p;
41 head->p->n = elem;
42 head->p = elem;
49 void dm_list_add_h(struct dm_list *head, struct dm_list *elem)
53 elem->n = head->n;
54 elem->p = head;
56 head->n->p = elem;
57 head->n = elem;
[all...] |
| /src/external/gpl2/xcvs/dist/src/ |
| stack.c | 21 do_push (List *stack, void *elem, int isstring)
26 p->key = elem;
28 p->data = elem;
36 push (List *stack, void *elem)
38 do_push (stack, elem, 0);
44 push_string (List *stack, char *elem)
46 do_push (stack, elem, 1);
54 void *elem; local
60 elem = stack->list->prev->key;
65 elem = stack->list->prev->data
125 void *elem; local
[all...] |
| /src/external/cddl/osnet/dist/lib/libdtrace/common/ |
| dt_list.h | 41 #define dt_list_prev(elem) ((void *)(((dt_list_t *)(elem))->dl_prev))
42 #define dt_list_next(elem) ((void *)(((dt_list_t *)(elem))->dl_next))
|
| /src/external/bsd/tcpdump/dist/ |
| print-snmp.c | 426 const u_char *p, u_int len, struct be *elem)
431 elem->asnlen = 0;
432 elem->type = BE_ANY;
454 elem->form = form;
455 elem->class = class;
456 elem->id = id;
485 elem->id = id = (id << 7) | GET_U_1(p);
494 elem->asnlen = GET_U_1(p);
496 if (elem->asnlen & ASN_BIT8) {
497 uint32_t noct = elem->asnlen % ASN_BIT8
870 struct be elem; local
1224 struct be elem; local
1321 struct be elem; local
1397 struct be elem; local
1549 struct be elem; local
1605 struct be elem; local
1639 struct be elem; local
1739 struct be elem; local
1876 struct be elem; local
[all...] |
| /src/external/apache2/mDNSResponder/dist/mDNSShared/ |
| GenLinkedList.c | 38 void AddToTail( GenLinkedList *pList, void *elem)
42 ASSIGNLINK( pList->Tail, elem, pList->LinkOffset);
44 pList->Head = elem;
45 ASSIGNLINK( elem, NULL, pList->LinkOffset);
47 pList->Tail = elem;
51 void AddToHead( GenLinkedList *pList, void *elem)
54 ASSIGNLINK( elem, pList->Head, pList->LinkOffset);
56 pList->Tail = elem;
58 pList->Head = elem;
62 int RemoveFromList( GenLinkedList *pList, void *elem)
231 AssignOffsetLink( GetTailPtr( pList), elem, pList->LinkOffset); local
[all...] |
| GenLinkedList.h | 36 void AddToHead( GenLinkedList *pList, void *elem);
37 void AddToTail( GenLinkedList *pList, void *elem);
39 int RemoveFromList( GenLinkedList *pList, void *elem);
58 void DLLAddToHead( GenDoubleLinkedList *pList, void *elem);
60 void DLLRemoveFromList( GenDoubleLinkedList *pList, void *elem);
80 void *GetOffsetLink( GenLinkedOffsetList *pList, void *elem);
82 void OffsetAddToHead( GenLinkedOffsetList *pList, void *elem);
83 void OffsetAddToTail( GenLinkedOffsetList *pList, void *elem);
85 int OffsetRemoveFromList( GenLinkedOffsetList *pList, void *elem);
|
| /src/crypto/external/apache2/openssl/dist/include/internal/ |
| list.h | 75 ossl_list_##name##_init_elem(type *elem) \
77 memset(&elem->ossl_list_##name, 0, \
78 sizeof(elem->ossl_list_##name)); \
105 ossl_list_##name##_next(const type *elem) \
107 assert(elem->ossl_list_##name.next == NULL \
108 || elem->ossl_list_##name.next \
110 == elem); \
111 return elem->ossl_list_##name.next; \
114 ossl_list_##name##_prev(const type *elem) \
116 assert(elem->ossl_list_##name.prev == NULL
[all...] |
| /src/sys/arch/sparc64/sparc64/ |
| mdesc.c | 69 struct md_element *elem; local
74 elem = (struct md_element *)(mdesc + sizeof(struct md_header));
77 while (elem[idx].tag != 'E') {
78 str = name_blk + elem[idx].name_offset;
79 if (elem[idx].tag == 'v' && strcmp(str, name) == 0)
80 return (elem[idx].d.val);
91 struct md_element *elem; local
97 elem = (struct md_element *)(mdesc + sizeof(struct md_header));
101 while (elem[idx].tag != 'E') {
102 str = name_blk + elem[idx].name_offset
115 struct md_element *elem; local
141 struct md_element *elem; local
164 struct md_element *elem; local
193 struct md_element *elem; local
219 struct md_element *elem; local
230 struct md_element *elem; local
[all...] |
| /src/usr.sbin/tpctl/ |
| data.c | 94 struct tpctl_data_elem *elem; local
122 elem = alloc(sizeof(*elem));
123 elem->type = TPCTL_COMMENT;
124 elem->name = strdup_prune(buf);
125 TAILQ_INSERT_TAIL(&data->list, elem, link);
130 elem = alloc(sizeof(*elem));
131 elem->type = TPCTL_CALIBCOORDS;
138 free(elem);
259 struct tpctl_data_elem *elem; local
339 struct tpctl_data_elem *elem; local
361 struct tpctl_data_elem *elem; local
387 struct tpctl_data_elem *elem; local
[all...] |
| /src/crypto/external/apache2/openssl/dist/test/ |
| list_test.c | 37 TESTL elem[20]; local
38 const int nelem = OSSL_NELEM(elem);
48 ossl_list_fizz_init_elem(elem + i);
49 ossl_list_buzz_init_elem(elem + i);
50 elem[i].n = i;
52 ossl_list_fizz_insert_tail(&a, elem + i);
56 ossl_list_buzz_insert_head(&b, elem + i);
102 INTL elem[20]; local
107 for (i = 0; i < OSSL_NELEM(elem); i++) {
108 ossl_list_int_init_elem(elem + i)
[all...] |
| /src/lib/librefuse/ |
| refuse_signals.c | 191 struct refuse_obj_elem* elem; local
203 for (elem = fuse_head; elem != NULL; elem = elem->next)
204 fuse_exit(elem->fuse);
229 struct refuse_obj_elem* elem; local
257 for (elem = fuse_head; elem != NULL; elem = elem->next)
286 struct refuse_obj_elem* elem; local
[all...] |
| /src/external/mpl/dhcp/dist/keama/ |
| data.c | 439 struct element *elem; local
441 elem = (struct element *)malloc(sizeof(struct element));
442 assert(elem != NULL);
443 memset(elem, 0, sizeof(struct element));
444 TAILQ_INIT(&elem->comments);
446 return elem;
452 struct element *elem; local
454 elem = create();
455 elem->type = ELEMENT_INTEGER;
456 elem->value.int_value = i
464 struct element *elem; local
476 struct element *elem; local
488 struct element *elem; local
499 struct element *elem; local
511 struct element *elem; local
523 struct element *elem; local
653 struct element *elem; local
714 struct element *elem; local
737 struct element *elem; local
766 struct element *elem; local
799 struct element *elem; local
818 struct element *elem; local
836 struct element *elem; local
854 struct element *elem; local
977 struct element *elem; local
1021 struct element *elem; local
[all...] |
| json.c | 39 struct element *elem; local
43 elem = create();
44 stackPush(cfile, elem);
45 cfile->stack[0] = elem;
51 elem = createInt(atoll(val));
52 TAILQ_CONCAT(&elem->comments, &cfile->comments);
55 elem = createString(makeString(-1, val));
56 TAILQ_CONCAT(&elem->comments, &cfile->comments);
60 elem = createNull();
62 elem = createBool(ISC_TRUE)
[all...] |
| /src/sys/dev/raidframe/ |
| rf_fifo.c | 67 rf_FifoEnqueue(void *q_in, RF_DiskQueueData_t *elem, int priority)
73 elem->next = NULL;
77 q->hq_head = q->hq_tail = elem;
80 q->hq_tail->next = elem;
81 q->hq_tail = elem;
85 RF_ASSERT(elem->next == NULL);
89 elem->raidPtr->raidid);
94 q->lq_head = q->lq_tail = elem;
97 q->lq_tail->next = elem;
98 q->lq_tail = elem;
[all...] |
| /src/external/gpl3/gdb/dist/gdb/testsuite/lib/ |
| data-structures.exp | 67 # Push ELEM onto the stack given by OID.
68 proc push {oid elem} {
72 lappend data_($oid) $elem
84 set elem [lindex $data_($oid) end]
86 return $elem
141 set elem [lindex $data_($oid) 0]
143 return $elem
146 # "Unpush" ELEM back to the head of the queue given by QID.
147 proc unpush {oid elem} {
151 set data_($oid) [linsert $data_($oid) 0 $elem]
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/lib/ |
| data-structures.exp | 67 # Push ELEM onto the stack given by OID.
68 proc push {oid elem} {
72 lappend data_($oid) $elem
84 set elem [lindex $data_($oid) end]
86 return $elem
141 set elem [lindex $data_($oid) 0]
143 return $elem
146 # "Unpush" ELEM back to the head of the queue given by QID.
147 proc unpush {oid elem} {
151 set data_($oid) [linsert $data_($oid) 0 $elem]
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/include/urcu/ |
| rcuhlist.h | 33 void cds_hlist_del_rcu(struct cds_hlist_node *elem)
35 if (elem->next)
36 elem->next->prev = elem->prev;
37 CMM_STORE_SHARED(elem->prev->next, elem->next);
|
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| intrusive_list.h | 59 static intrusive_list_node<T> *as_node (T *elem)
60 { return elem; }
68 static intrusive_list_node<T> *as_node (T *elem)
69 { return &(elem->*MemberNode); }
88 /* Create an iterator pointing to ELEM. */
89 explicit intrusive_list_base_iterator (pointer elem)
90 : m_elem (elem)
111 static node_type *as_node (pointer elem)
112 { return AsNode::as_node (elem); }
311 void push_front (reference elem)
[all...] |
