Searched refs:next_needed (Results 1 – 8 of 8) sorted by relevance
327 next = node->next_needed; in cgraph_varpool_remove_unreferenced_decls()368 cgraph_nodes_queue = cgraph_nodes_queue->next_needed; in cgraph_assemble_pending_functions()369 n->next_needed = NULL; in cgraph_assemble_pending_functions()386 n->next_needed = NULL; in cgraph_assemble_pending_functions()444 for (n = cgraph_nodes_queue; n; n = n->next_needed) in cgraph_reset_node()912 node->next_needed = NULL; in cgraph_varpool_assemble_pending_decls()937 node->next_needed = 0; in cgraph_varpool_output_debug_info()1123 node->next_needed = NULL; in cgraph_finalize_compilation_unit()1182 node->next_needed = NULL; in cgraph_finalize_compilation_unit()1336 node->next_needed = NULL; in cgraph_expand_all_functions()[all …]
129 struct cgraph_node *next_needed; member208 struct cgraph_varpool_node *next_needed; member
625 node->next_needed = cgraph_nodes_queue; in cgraph_mark_reachable_node()816 for (node = cgraph_varpool_nodes; node; node = node->next_needed) in dump_varpool()903 cgraph_varpool_last_needed_node->next_needed = node; in cgraph_varpool_enqueue_needed_node()905 node->next_needed = NULL; in cgraph_varpool_enqueue_needed_node()1214 n->next_needed = cgraph_expand_queue; in cgraph_add_new_function()
906 for (vnode = cgraph_varpool_nodes_queue; vnode; vnode = vnode->next_needed) in static_execute()
1685 for (vnode = cgraph_varpool_nodes_queue; vnode; vnode = vnode->next_needed) in type_escape_execute()
16199 Use next_needed field instead of aux to maintain the queue.16200 * cgraph.h (cgraph_node): Add next_needed.16201 (cgraph_varpool_node): Add next_needed; remove aux.16202 * cgraphunit.c (cgraph_finalize_compilation_unit): Use next_needed.
4190 (cgraph_assemble_function): Kill next_needed to avoid GGC corruption.4193 (cgraph_finalize_compilation_unit): Clear next_needed.
46213 * cgraphunit.c (cgraph_finalize_compilation_unit): Clear next_needed