• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /barrelfish-2018-10-04/lib/devif/backends/net/mlx4/include/linux/

Lines Matching defs:list

13  *    notice unmodified, this list of conditions, and the following
16 * notice, this list of conditions and the following disclaimer in the
82 static inline void INIT_LIST_HEAD(struct list_head *list) {
84 list->next = list->prev = list;
151 list_move(struct list_head *list, struct list_head *head)
154 list_del(list);
155 list_add(list, head);
166 _list_splice(const struct list_head *list, struct list_head *prev,
172 if (list_empty(list))
174 first = list->next;
175 last = list->prev;
183 list_splice(const struct list_head *list, struct list_head *head)
186 _list_splice(list, head, head->next);
190 list_splice_tail(struct list_head *list, struct list_head *head)
193 _list_splice(list, head->prev, head);
197 list_splice_init(struct list_head *list, struct list_head *head)
200 _list_splice(list, head, head->next);
201 INIT_LIST_HEAD(list);
205 list_splice_tail_init(struct list_head *list, struct list_head *head)
208 _list_splice(list, head->prev, head);
209 INIT_LIST_HEAD(list);
295 * list_is_singular - tests whether a list has just one entry.
296 * @head: the list to test.
303 static inline void __list_cut_position(struct list_head *list,
307 list->next = head->next;
308 list->next->prev = list;
309 list->prev = entry;
310 entry->next = list;
316 * list_cut_position - cut a list into two
317 * @list: a new list to add all removed entries
318 * @head: a list with entries
320 * and if so we won't cut the list
323 * including @entry, from @head to @list. You should
324 * pass on @entry an element you know is on @head. @list
325 * should be an empty list or a list you do not care about
329 static inline void list_cut_position(struct list_head *list,
338 INIT_LIST_HEAD(list);
340 __list_cut_position(list, head, entry);
344 * list_is_last - tests whether @list is the last entry in list @head
345 * @list: the entry to test
346 * @head: the head of the list
348 static inline int list_is_last(const struct list_head *list,
351 return list->next == head;