36 #define elf_hash_add(name, node, key)					\  argument
38 	struct elf_hash_node *__node = node;				\
43 static inline void __elf_hash_del(struct elf_hash_node *node,  in __elf_hash_del()  argument
48 	if (node == *head) {  in __elf_hash_del()
49 		*head = node->next;  in __elf_hash_del()
54 		if (cur == node) {  in __elf_hash_del()
61 #define elf_hash_del(name, node, key) \  argument
62 	__elf_hash_del(node, &__elf_table_entry(name, key))
98 INTERVAL_TREE_DEFINE(struct symbol, node, unsigned long, __subtree_last,
113 static int symbol_hole_by_offset(const void *key, const struct rb_node *node)  in symbol_hole_by_offset()  argument
115 	const struct symbol *s = rb_entry(node, struct symbol, node);  in symbol_hole_by_offset()
234 		n = rb_next(&hole.sym->node);  in find_symbol_hole_containing()
242 	s = rb_entry(n, struct symbol, node);  in find_symbol_hole_containing()
420 	pnode = rb_prev(&sym->node);  in elf_add_symbol()
422 		entry = &rb_entry(pnode, struct symbol, node)->list;  in elf_add_symbol()