Lines Matching defs:entry
200 struct ptr_list *entry = head;
204 next = entry->next;
205 if (!entry->nr) {
207 if (next == entry) {
208 __free_ptrlist(entry);
212 prev = entry->prev;
215 __free_ptrlist(entry);
216 if (entry == head) {
219 entry = next;
223 entry = next;
224 } while (entry != head);
234 // The goal being to create space inside @head for a new entry.
253 // add an entry to a ptrlist
255 // @ptr: the entry to add to the list
256 // @return: the address where the new entry is stored.
290 // add a tagged entry to a ptrlist
292 // @ptr: the entry to add to the list
294 // @return: the address where the new entry is stored.
310 // test if some entry is already present in a ptrlist
312 // @entry: the entry to test
313 // @return: ``true`` if the entry is already present, ``false`` otherwise.
314 bool lookup_ptr_list_entry(const struct ptr_list *head, const void *entry)
324 if (list->list[i] == entry)
331 // delete an entry from a ptrlist
333 // @entry: the item to be deleted
334 // @count: the minimum number of times @entry should be deleted or 0.
335 int delete_ptr_list_entry(struct ptr_list **list, void *entry, int count)
340 if (ptr == entry) {
353 // replace an entry in a ptrlist
355 // @old_ptr: the entry to be replaced
356 // @new_ptr: the new entry
357 // @count: the minimum number of times @entry should be deleted or 0.
376 // remove the last entry of a ptrlist
402 // remove the last entry and repack the list
432 void *entry;
433 FOR_EACH_PTR(a, entry) {
434 add_ptr_list(b, entry);
435 } END_FOR_EACH_PTR(entry);