Lines Matching refs:member
25 #define aos_offsetof(type, member) ((size_t)&(((type *)0)->member)) argument
34 #define aos_container_of(ptr, type, member) \ argument
35 ((type *)((char *)(ptr) - aos_offsetof(type, member)))
66 #define dlist_entry(addr, type, member) \ argument
67 ((type *)((long)addr - aos_offsetof(type, member)))
152 #define dlist_first_entry(ptr, type, member) dlist_entry((ptr)->next, type, member) argument
180 #define dlist_for_each_entry(queue, node, type, member) \ argument
181 for (node = aos_container_of((queue)->next, type, member); \
182 &node->member != (queue); \
183 node = aos_container_of(node->member.next, type, member))
194 #define dlist_for_each_entry_safe(queue, n, node, type, member) \ argument
195 for (node = aos_container_of((queue)->next, type, member), \
197 &node->member != (queue); \
198 node = aos_container_of(n, type, member), n = n ? n->next : NULL)
206 #define aos_list_entry(ptr, type, member) aos_container_of(ptr, type, member) argument
216 #define dlist_for_each_entry_reverse(pos, head, member, type) \ argument
217 for (pos = aos_list_entry((head)->prev, type, member); \
218 &pos->member != (head); \
219 pos = aos_list_entry(pos->member.prev, type, member))
334 #define slist_for_each_entry(queue, node, type, member) \ argument
335 for (node = aos_container_of((queue)->next, type, member); \
336 (uintptr_t)node + aos_offsetof(type, member) != 0; \
337 node = aos_container_of(node->member.next, type, member))
348 #define slist_for_each_entry_safe(queue, tmp, node, type, member) \ argument
349 for (node = aos_container_of((queue)->next, type, member), \
351 (uintptr_t)node + aos_offsetof(type, member) != 0; \
352 node = aos_container_of(tmp, type, member), tmp = tmp ? tmp->next : tmp)
375 #define slist_entry(addr, type, member) \ argument
376 (addr ? (type *)((long)addr - aos_offsetof(type, member)) : (type *)addr)
385 #define slist_first_entry(ptr, type, member) slist_entry((ptr)->next, type, member) argument