Lines Matching refs:summary
1 /* Callgraph summary data structure.
40 m_allocator ("function summary" PASS_MEM_STAT)
124 /* Symbol table the summary is registered to. */
127 /* Insertion function defined by a summary. */
129 /* Removal function defined by a summary. */
131 /* Duplication function defined by a summary. */
134 /* Internal summary insertion hook pointer. */
136 /* Internal summary removal hook pointer. */
138 /* Internal summary duplication hook pointer. */
142 /* Return true when the summary uses GGC memory for allocation. */
168 /* Function summary is a helper class that is used to associate a data structure
170 create a temporary pass-related structures. The summary class registers
172 A user of a summary class can ovewrite virtual methods than are triggered by
173 the summary if such hook is triggered. Apart from a callgraph node, the user
176 The function summary class can work both with a heap-allocated memory and
197 /* Getter for summary callgraph node pointer. If a summary for a node
209 /* Getter for summary callgraph node pointer. */
216 /* Remove node from summary. */
229 /* Return true if a summary for the given NODE already exists. */
246 /* Indication if we use ggc summary. */
250 /* Indication if we use ggc summary. */
258 /* Main summary store, where summary ID is used as key. */
292 function_summary *summary = (function_summary <T *> *) (data);
293 summary->insert (node, summary->get_create (node));
301 function_summary *summary = (function_summary <T *> *) (data);
302 summary->remove (node);
310 function_summary *summary = (function_summary <T *> *) (data);
311 T *v = summary->get (node);
314 summary->duplicate (node, node2, v, summary->get_create (node2));
319 gt_ggc_mx(function_summary<T *>* const &summary)
321 gcc_checking_assert (summary->m_ggc);
322 gt_ggc_mx (&summary->m_map);
363 /* Function vector summary is a fast implementation of function_summary that
387 /* Getter for summary callgraph node pointer. If a summary for a node
405 /* Getter for summary callgraph node pointer. */
422 /* Return true if a summary for the given NODE already exists. */
444 /* Summary is stored in the vector. */
482 fast_function_summary *summary = (fast_function_summary <T *, V> *) (data);
483 summary->insert (node, summary->get_create (node));
491 fast_function_summary *summary = (fast_function_summary <T *, V> *) (data);
493 if (summary->exists (node))
494 summary->remove (node);
503 fast_function_summary *summary = (fast_function_summary <T *, V> *) (data);
504 T *v = summary->get (node);
508 T *duplicate = summary->get_create (node2);
509 summary->duplicate (node, node2, v, duplicate);
541 gt_ggc_mx (fast_function_summary<T *, va_gc>* const &summary)
543 ggc_test_and_set_mark (summary->m_vector);
544 gt_ggc_mx (summary->m_vector);
574 m_allocator ("call summary" PASS_MEM_STAT)
631 /* Symbol table the summary is registered to. */
634 /* Removal function defined by a summary. */
636 /* Duplication function defined by a summary. */
639 /* Internal summary removal hook pointer. */
641 /* Internal summary duplication hook pointer. */
643 /* Initialize summary for an edge that is cloned. */
647 /* Return true when the summary uses GGC memory for allocation. */
696 /* Getter for summary callgraph edge pointer.
697 If a summary for an edge does not exist, it will be created. */
708 /* Getter for summary callgraph edge pointer. */
715 /* Remove edge from summary. */
728 /* Return true if a summary for the given EDGE already exists. */
742 /* Indication if we use ggc summary. */
746 /* Indication if we use ggc summary. */
754 /* Main summary store, where summary ID is used as key. */
778 call_summary *summary = (call_summary <T *> *) (data);
779 summary->remove (edge);
787 call_summary *summary = (call_summary <T *> *) (data);
790 if (summary->m_initialize_when_cloning)
791 edge1_summary = summary->get_create (edge1);
793 edge1_summary = summary->get (edge1);
796 summary->duplicate (edge1, edge2, edge1_summary,
797 summary->get_create (edge2));
802 gt_ggc_mx(call_summary<T *>* const &summary)
804 gcc_checking_assert (summary->m_ggc);
805 gt_ggc_mx (&summary->m_map);
832 /* Call vector summary is a fast implementation of call_summary that
861 /* Getter for summary callgraph edge pointer.
862 If a summary for an edge does not exist, it will be created. */
878 /* Getter for summary callgraph edge pointer. */
884 /* Remove edge from summary. */
896 /* Return true if a summary for the given EDGE already exists. */
915 /* Summary is stored in the vector. */
940 fast_call_summary *summary = (fast_call_summary <T *, V> *) (data);
941 summary->remove (edge);
949 fast_call_summary *summary = (fast_call_summary <T *, V> *) (data);
952 if (summary->m_initialize_when_cloning)
953 edge1_summary = summary->get_create (edge1);
955 edge1_summary = summary->get (edge1);
959 T *duplicate = summary->get_create (edge2);
960 summary->duplicate (edge1, edge2, edge1_summary, duplicate);
973 gt_ggc_mx (fast_call_summary<T *, va_heap>* const &summary ATTRIBUTE_UNUSED)
979 gt_pch_nx (fast_call_summary<T *, va_heap>* const &summary ATTRIBUTE_UNUSED)
985 gt_pch_nx (fast_call_summary<T *, va_heap>* const& summary ATTRIBUTE_UNUSED,
993 gt_ggc_mx (fast_call_summary<T *, va_gc>* const &summary)
995 ggc_test_and_set_mark (summary->m_vector);
996 gt_ggc_mx (&summary->m_vector);
Indexes created Sat Feb 28 05:31:39 UTC 2026