contrib/gcc/ipa-inline.c

416 /* Recompute heap nodes for each of caller edge.  */
419 update_caller_keys (fibheap_t heap, struct cgraph_node *node,
441 	    fibheap_delete_node (heap, edge->aux);
461 	    if (fibheap_replace_key (heap, n, badness))
463 	    fibheap_delete_node (heap, edge->aux);
465 	edge->aux = fibheap_insert (heap, badness, edge);
469 /* Recompute heap nodes for each of caller edges of each of callees.  */
472 update_callee_keys (fibheap_t heap, struct cgraph_node *node,
480       update_caller_keys (heap, e->callee, updated_nodes);
482       update_callee_keys (heap, e->callee, updated_nodes);
490 			fibheap_t heap)
500         fibheap_insert (heap,
507       lookup_recursive_calls (node, e->callee, heap);
578   fibheap_t heap;
594   heap = fibheap_new ();
595   lookup_recursive_calls (node, node, heap);
596   if (fibheap_empty (heap))
598       fibheap_delete (heap);
615   while (!fibheap_empty (heap)
619       struct cgraph_edge *curr = fibheap_extract_min (heap);
665       lookup_recursive_calls (node, curr->callee, heap);
668   if (!fibheap_empty (heap) && dump_file)
671   fibheap_delete (heap);
710    All inline candidates are put into prioritized heap based on estimated
722   fibheap_t heap = fibheap_new ();
728   /* Put all inline candidates into the heap.  */
749 	    edge->aux = fibheap_insert (heap, cgraph_edge_badness (edge), edge);
752   while (overall_insns <= max_insns && (edge = fibheap_extract_min (heap)))
840           update_callee_keys (heap, where, updated_nodes);
855 	  update_callee_keys (heap, callee, updated_nodes);
867       update_caller_keys (heap, where, updated_nodes);
880   while ((edge = fibheap_extract_min (heap)) != NULL)
889   fibheap_delete (heap);