contrib/bmake/lst.c

42 	ListNode *ln = bmake_malloc(sizeof *ln);
44 	ln->prev = prev;
45 	ln->next = next;
46 	ln->datum = datum;
48 	return ln;
54 	ListNode *ln, *next;
56 	for (ln = list->first; ln != NULL; ln = next) {
57 		next = ln->next;
58 		free(ln);
65 	ListNode *ln, *next;
67 	for (ln = list->first; ln != NULL; ln = next) {
68 		next = ln->next;
69 		free(ln->datum);
70 		free(ln);
76 Lst_InsertBefore(List *list, ListNode *ln, void *datum)
82 	newNode = LstNodeNew(ln->prev, ln, datum);
84 	if (ln->prev != NULL)
85 		ln->prev->next = newNode;
86 	ln->prev = newNode;
88 	if (ln == list->first)
96 	ListNode *ln;
100 	ln = LstNodeNew(NULL, list->first, datum);
103 		list->first = ln;
104 		list->last = ln;
106 		list->first->prev = ln;
107 		list->first = ln;
115 	ListNode *ln;
119 	ln = LstNodeNew(list->last, NULL, datum);
122 		list->first = ln;
123 		list->last = ln;
125 		list->last->next = ln;
126 		list->last = ln;
135 Lst_Remove(List *list, ListNode *ln)
138 	if (ln->next != NULL)
139 		ln->next->prev = ln->prev;
140 	if (ln->prev != NULL)
141 		ln->prev->next = ln->next;
144 	if (list->first == ln)
145 		list->first = ln->next;
146 	if (list->last == ln)
147 		list->last = ln->prev;
149 	free(ln);
154 LstNode_Set(ListNode *ln, void *datum)
158 	ln->datum = datum;
166 LstNode_SetNull(ListNode *ln)
168 	ln->datum = NULL;
179 	ListNode *ln;
183 	for (ln = list->first; ln != NULL; ln = ln->next)
184 		if (ln->datum == datum)
185 			return ln;
216 	ListNode *ln;
218 	for (ln = src->last; ln != NULL; ln = ln->prev)
219 		Lst_Prepend(dst, ln->datum);
226 	ListNode *ln;
228 	for (ln = src->first; ln != NULL; ln = ln->next)
229 		Lst_Append(dst, ln->datum);