Lines Matching full:foo
36 * We need to keep a list of struct foo in the parent struct bar, i.e. what
41 * struct foo *list_of_foos; -----> struct foo {}, struct foo {}, struct foo{}
54 * struct foo {
68 * struct foo *foo = malloc(...);
70 * xorg_list_add(&foo->entry, &bar.list_of_foos);
74 * xorg_list_del(&foo->entry);
75 * free(foo);
80 * Looping through the list requires a 'struct foo' as iterator and the
83 * struct foo *iterator;
92 * struct foo *iterator, *next;
147 * struct foo *newfoo = malloc(...);
168 * struct foo *newfoo = malloc(...);
197 * xorg_list_del(&foo->entry);
227 * struct foo* f;
228 * f = container_of(&foo->entry, struct foo, entry);
229 * assert(f == foo);
251 * struct foo *first;
252 * first = xorg_list_first_entry(&bar->list_of_foos, struct foo, list_of_foos);
266 * struct foo *first;
267 * first = xorg_list_last_entry(&bar->list_of_foos, struct foo, list_of_foos);
295 * struct foo *iterator;
335 * struct foo {
337 * struct foo *next;
348 * struct foo *list = malloc();
361 * struct foo *element = list;
377 * struct foo *iterator;
411 * struct foo *elem = malloc(...);
413 * nt_list_append(elem, list, struct foo, next);
435 * struct foo *elem = malloc(...);
437 * nt_list_insert(elem, list, struct foo, next);
459 * struct foo *elem = <assign to right element>
460 * nt_list_del(elem, list, struct foo, next);