Lines Matching refs:ptr
14 #define CHECK_TYPE(head,ptr) (void)(&(ptr) == &(head)->list[0])
59 #define add_ptr_list(list, ptr) ({ \
61 CHECK_TYPE(*(list),ptr); \
62 (__typeof__(&(ptr))) __add_ptr_list(head, ptr); \
64 #define add_ptr_list_tag(list, ptr, tag) ({ \
66 CHECK_TYPE(*(list),ptr); \
67 (__typeof__(&(ptr))) __add_ptr_list_tag(head, ptr, tag);\
71 PTRLIST_TYPE(*(l)) ptr; \
72 ptr = delete_ptr_list_last((struct ptr_list**)(l)); \
73 ptr; \
95 #define PREPARE_PTR_LIST(head, ptr) \
96 DO_PREPARE(head, ptr, __head##ptr, __list##ptr, __nr##ptr, PTR_ENTRY_UNTAG)
98 #define NEXT_PTR_LIST(ptr) \
99 DO_NEXT(ptr, __head##ptr, __list##ptr, __nr##ptr, PTR_ENTRY_UNTAG)
101 #define RESET_PTR_LIST(ptr) \
102 DO_RESET(ptr, __head##ptr, __list##ptr, __nr##ptr, PTR_ENTRY_UNTAG)
104 #define FINISH_PTR_LIST(ptr) \
105 DO_FINISH(ptr, __head##ptr, __list##ptr, __nr##ptr)
107 #define RECURSE_PTR_REVERSE(ptr, new) \
108 DO_REVERSE(ptr, __head##ptr, __list##ptr, __nr##ptr, __rname##new, \
112 #define FOR_EACH_PTR(head, ptr) \
113 DO_FOR_EACH(head, ptr, __head##ptr, __list##ptr, __nr##ptr, __name##ptr, PTR_ENTRY_NOTAG)
115 #define FOR_EACH_PTR_TAG(head, ptr) \
116 DO_FOR_EACH(head, ptr, __head##ptr, __list##ptr, __nr##ptr, __name##ptr, PTR_ENTRY_UNTAG)
118 #define END_FOR_EACH_PTR(ptr) \
119 DO_END_FOR_EACH(ptr, __head##ptr, __list##ptr, __nr##ptr, __name##ptr)
121 #define FOR_EACH_PTR_REVERSE(head, ptr) \
122 DO_FOR_EACH_REVERSE(head, ptr, __head##ptr, __list##ptr, __nr##ptr, __rname##ptr, PTR_ENTRY_NOTAG)
124 #define FOR_EACH_PTR_REVERSE_TAG(head, ptr) \
125 DO_FOR_EACH_REVERSE(head, ptr, __head##ptr, __list##ptr, __nr##ptr, __rname##ptr, PTR_ENTRY_UNTAG)
127 #define END_FOR_EACH_PTR_REVERSE(ptr) \
128 DO_END_FOR_EACH_REVERSE(ptr, __head##ptr, __list##ptr, __nr##ptr, __rname##ptr)
130 #define THIS_ADDRESS(ptr) \
131 DO_THIS_ADDRESS(ptr, __head##ptr, __list##ptr, __nr##ptr)
133 #define INSERT_CURRENT(new, ptr) \
134 DO_INSERT_CURRENT(new, __head##ptr, __list##ptr, __nr##ptr)
136 #define DELETE_CURRENT_PTR(ptr) \
137 DO_DELETE_CURRENT(__head##ptr, __list##ptr, __nr##ptr)
139 #define REPLACE_CURRENT_PTR(ptr, new_ptr) \
140 do { *THIS_ADDRESS(ptr) = (new_ptr); } while (0)
145 #define MARK_CURRENT_DELETED(ptr) \
146 DO_MARK_CURRENT_DELETED(ptr, __list##ptr)
151 #define CURRENT_TAG(ptr) (3 & (unsigned long)*THIS_ADDRESS(ptr))
152 #define TAG_CURRENT(ptr,val) update_tag(THIS_ADDRESS(ptr),val)
155 #define FOR_EACH_PTR_NOTAG(list, ptr) FOR_EACH_PTR(list, ptr)
156 #define END_FOR_EACH_PTR_NOTAG(ptr) END_FOR_EACH_PTR(ptr)
165 #define PTR_NEXT(ptr, __head, __list, __nr, PTR_ENTRY) \
168 ptr = PTR_ENTRY(__list,__nr); \
172 ptr = NULL; \
176 #define DO_PREPARE(head, ptr, __head, __list, __nr, PTR_ENTRY) \
181 ptr = NULL; \
183 PTR_NEXT(ptr, __head, __list, __nr, PTR_ENTRY); \
186 #define DO_NEXT(ptr, __head, __list, __nr, PTR_ENTRY) \
187 if (ptr) { \
188 PTR_NEXT(ptr, __head, __list, __nr, PTR_ENTRY); \
191 #define DO_RESET(ptr, __head, __list, __nr, PTR_ENTRY) \
196 PTR_NEXT(ptr, __head, __list, __nr, PTR_ENTRY); \
199 #define DO_FINISH(ptr, __head, __list, __nr) \
203 #define DO_FOR_EACH(head, ptr, __head, __list, __nr, __name, PTR_ENTRY) do { \
212 ptr = PTR_ENTRY(__list,__nr); \
213 if (__list->rm && !ptr) \
216 #define DO_END_FOR_EACH(ptr, __head, __list, __nr, __name) \
222 #define DO_FOR_EACH_REVERSE(head, ptr, __head, __list, __nr, __name, PTR_ENTRY) do { \
233 ptr = PTR_ENTRY(__list,__nr); \
234 if (__list->rm && !ptr) \
238 #define DO_END_FOR_EACH_REVERSE(ptr, __head, __list, __nr, __name) \
244 #define DO_REVERSE(ptr, __head, __list, __nr, __name, new, __newhead, \
250 new = ptr; \
259 #define DO_THIS_ADDRESS(ptr, __head, __list, __nr) \
296 #define DO_MARK_CURRENT_DELETED(ptr, __list) do { \
297 REPLACE_CURRENT_PTR(ptr, NULL); \
304 unsigned long *ptr = p;
305 *ptr = tag | (~3UL & *ptr);
308 static inline void *tag_ptr(void *ptr, unsigned long tag)
310 return (void *)(tag | (unsigned long)ptr);