Lines Matching defs:head
56 // empty list, the new list head becomes that which is pointed to by
57 // the former head's |next| pointer. If the list is doubly linked, the
58 // new head |previous| pointer gets changed from pointing to the former
59 // head to NULL.
71 // |*head|. |head| will be modified to point to the new head.
73 // to the last node in the range. |n| must be <= FL_Size(|*head|)
74 // If |n| > 0, |head| must not be NULL.
75 void FL_PopRange(void **head, int n, void **start, void **end) {
82 *start = *head; // Remember the first node in the range.
83 void *tmp = *head;
88 *head = FL_Next(*end);
91 if (*head ) { // Fixup popped list.
92 FL_SetPrevious(*head, NULL);
97 // is |end| into the linked list at |*head|. |*head| is updated to
98 // point be the new head of the list. |head| must not be NULL.
99 void FL_PushRange(void **head, void *start, void *end) {
109 if (*head) {
110 FL_EqualityCheck(FL_Previous_No_Check(*head), (void*)NULL,
112 FL_SetNext(end, *head);
113 FL_SetPrevious(*head, end);
115 *head = start;
118 // Calculates the size of the list that begins at |head|.
119 size_t FL_Size(void *head){
121 if (head) {
122 FL_EqualityCheck(FL_Previous_No_Check(head), (void*)NULL,
125 while (head) {
127 head = FL_Next(head);