Home | History | Annotate | Download | only in gcc

Lines Matching defs:path_out_count

876   profile_count path_out_count = path_in_count;
904       if (cur_count < path_out_count)
905 	path_out_count = cur_count;
910   /* We computed path_out_count above assuming that this path targeted
921      So ensure that this path's path_out_count is at least the
925       && has_joiner && path_out_count < elast->count () - nonpath_count)
927       path_out_count = elast->count () - nonpath_count;
931       if (path_out_count > min_path_count)
932 	path_out_count = min_path_count;
936   *path_out_count_ptr = path_out_count;
944    and the duplicate edge EDUP will have a count of PATH_OUT_COUNT.  */
947 		profile_count path_out_count)
955       /* Edup's count is reduced by path_out_count.  We need to redistribute
961 	 = path_out_count.probability_in (path_in_count);
994   profile_count final_count = epath->count () - path_out_count;
1003      that the duplicated path will have path_out_count flowing
1046   profile_count path_out_count = profile_count::zero ();
1052      non-joiner case the path_in_count and path_out_count should be the
1055 					 &path_in_count, &path_out_count);
1126 	     And we know that the duplicated path will have path_out_count
1129 	  update_profile (epath, e2, path_in_count, path_out_count);
1142 	     flowing along the duplicated threaded path is path_out_count.
1149 			  path_out_count, path_out_count);
1159 	     path_out_count.
1166 	   update_profile (epath, NULL, path_out_count, path_out_count);