CbC/CbC_gcc: gcc/profile-count.h comparison

comparison gcc/profile-count.h @ 132:d34655255c78

update gcc-8.2

author	mir3636
date	Thu, 25 Oct 2018 10:21:07 +0900
parents	84e7813d76e9
children	1830386684a0

comparison

equal deleted inserted replaced

-:e108057fa461
+:d34655255c78
 /* Profile counter container type.
-Copyright (C) 2017 Free Software Foundation, Inc.
+Copyright (C) 2017-2018 Free Software Foundation, Inc.
 Contributed by Jan Hubicka
 This file is part of GCC.
 GCC is free software; you can redistribute it and/or modify it under
 <http://www.gnu.org/licenses/>.  */
 #ifndef GCC_PROFILE_COUNT_H
 #define GCC_PROFILE_COUNT_H
+struct function;
+class profile_count;
 /* Quality of the profile count.  Because gengtype does not support enums
 inside of classes, this is in global namespace.  */
 enum profile_quality {
+/* Uninitialized value.  */
+profile_uninitialized,
+/* Profile is based on static branch prediction heuristics and may
+or may not match reality.  It is local to function and can not be compared
+inter-procedurally.  Never used by probabilities (they are always local).
+*/
+profile_guessed_local,
+/* Profile was read by feedback and was 0, we used local heuristics to guess
+better.  This is the case of functions not run in profile fedback.
+Never used by probabilities.  */
+profile_guessed_global0,
+/* Same as profile_guessed_global0 but global count is adjusted 0.  */
+profile_guessed_global0adjusted,
 /* Profile is based on static branch prediction heuristics.  It may or may
-not reflect the reality.  */
+not reflect the reality but it can be compared interprocedurally
-profile_guessed = 0,
+(for example, we inlined function w/o profile feedback into function
+with feedback and propagated from that).
+Never used by probablities.  */
+profile_guessed,
 /* Profile was determined by autofdo.  */
-profile_afdo = 1,
+profile_afdo,
 /* Profile was originally based on feedback but it was adjusted
 by code duplicating optimization.  It may not precisely reflect the
 particular code path.  */
-profile_adjusted = 2,
+profile_adjusted,
 /* Profile was read from profile feedback or determined by accurate static
 method.  */
-profile_precise = 3
+profile_precise
 };
+extern const char *profile_quality_as_string (enum profile_quality);
 /* The base value for branch probability notes and edge probabilities.  */
 #define REG_BR_PROB_BASE  10000
 #define RDIV(X,Y) (((X) + (Y) / 2) / (Y))
 these conversions will probably go away because they are lossy.
 */
 class GTY((user)) profile_probability
 {
-static const int n_bits = 30;
+static const int n_bits = 29;
 /* We can technically use ((uint32_t) 1 << (n_bits - 1)) - 2 but that
 will lead to harder multiplication sequences.  */
 static const uint32_t max_probability = (uint32_t) 1 << (n_bits - 2);
 static const uint32_t uninitialized_probability
 		 = ((uint32_t) 1 << (n_bits - 1)) - 1;
-uint32_t m_val : 30;
+uint32_t m_val : 29;
-enum profile_quality m_quality : 2;
+enum profile_quality m_quality : 3;
 friend class profile_count;
 public:
 /* Named probabilities.  */
 }
 static profile_probability very_unlikely ()
 {
 /* Be consistent with PROB_VERY_UNLIKELY in predict.h.  */
 profile_probability r
-	 = profile_probability::always ().apply_scale (1, 2000);
+	 = profile_probability::guessed_always ().apply_scale (1, 2000);
 r.m_val--;
 return r;
 }
 static profile_probability unlikely ()
 {
 /* Be consistent with PROB_VERY_LIKELY in predict.h.  */
 profile_probability r
-	 = profile_probability::always ().apply_scale (1, 5);
+	 = profile_probability::guessed_always ().apply_scale (1, 5);
 r.m_val--;
 return r;
 }
 static profile_probability even ()
 {
-return profile_probability::always ().apply_scale (1, 2);
+return profile_probability::guessed_always ().apply_scale (1, 2);
 }
 static profile_probability very_likely ()
 {
 return profile_probability::always () - very_unlikely ();
 }
 /* Conversion to and from RTL representation of profile probabilities.  */
 static profile_probability from_reg_br_prob_note (int v)
 {
 profile_probability ret;
-ret.m_val = ((unsigned int)v) / 4;
+ret.m_val = ((unsigned int)v) / 8;
-ret.m_quality = (enum profile_quality)(v & 3);
+ret.m_quality = (enum profile_quality)(v & 7);
 return ret;
 }
 int to_reg_br_prob_note () const
 {
 gcc_checking_assert (initialized_p ());
-int ret = m_val * 4 + m_quality;
+int ret = m_val * 8 + m_quality;
 gcc_checking_assert (profile_probability::from_reg_br_prob_note (ret)
 			   == *this);
 return ret;
 }
 	return profile_probability::never ();
 if (!initialized_p () || !other.initialized_p ())
 	return profile_probability::uninitialized ();
 profile_probability ret;
 ret.m_val = RDIV ((uint64_t)m_val * other.m_val, max_probability);
-ret.m_quality = MIN (m_quality, other.m_quality);
+ret.m_quality = MIN (MIN (m_quality, other.m_quality), profile_adjusted);
 return ret;
 }
 profile_probability &operator*= (const profile_probability &other)
 {
 if (*this == profile_probability::never ()
 if (!initialized_p () || !other.initialized_p ())
 	return *this = profile_probability::uninitialized ();
 else
 	{
 	  m_val = RDIV ((uint64_t)m_val * other.m_val, max_probability);
-	  m_quality = MIN (m_quality, other.m_quality);
+	  m_quality = MIN (MIN (m_quality, other.m_quality), profile_adjusted);
 	}
 return *this;
 }
 profile_probability operator/ (const profile_probability &other) const
 {
 if (*this == profile_probability::never ())
 	return profile_probability::never ();
 if (!initialized_p () || !other.initialized_p ())
 	return profile_probability::uninitialized ();
 profile_probability ret;
+/* If we get probability above 1, mark it as unreliable and return 1. */
 if (m_val >= other.m_val)
-	ret.m_val = max_probability;
+	{
+	  ret.m_val = max_probability;
+ret.m_quality = MIN (MIN (m_quality, other.m_quality),
+			       profile_guessed);
+	  return ret;
+	}
 else if (!m_val)
 	ret.m_val = 0;
 else
 	{
 	  gcc_checking_assert (other.m_val);
 	  ret.m_val = MIN (RDIV ((uint64_t)m_val * max_probability,
 				 other.m_val),
 			   max_probability);
 	}
-ret.m_quality = MIN (m_quality, other.m_quality);
+ret.m_quality = MIN (MIN (m_quality, other.m_quality), profile_adjusted);
 return ret;
 }
 profile_probability &operator/= (const profile_probability &other)
 {
 if (*this == profile_probability::never ())
 	return *this = profile_probability::never ();
 if (!initialized_p () || !other.initialized_p ())
 	return *this = profile_probability::uninitialized ();
 else
 	{
+/* If we get probability above 1, mark it as unreliable
+	     and return 1. */
 	  if (m_val > other.m_val)
-	    m_val = max_probability;
+	    {
+	      m_val = max_probability;
+m_quality = MIN (MIN (m_quality, other.m_quality),
+			       profile_guessed);
+	      return *this;
+	    }
 	  else if (!m_val)
 	    ;
 	  else
 	    {
 	      gcc_checking_assert (other.m_val);
 	      m_val = MIN (RDIV ((uint64_t)m_val * max_probability,
 				 other.m_val),
 			   max_probability);
 	    }
-	  m_quality = MIN (m_quality, other.m_quality);
+	  m_quality = MIN (MIN (m_quality, other.m_quality), profile_adjusted);
 	}
 return *this;
+}
+/* Split *THIS (ORIG) probability into 2 probabilities, such that
+the returned one (FIRST) is *THIS * CPROB and *THIS is
+adjusted (SECOND) so that FIRST + FIRST.invert () * SECOND
+== ORIG.  This is useful e.g. when splitting a conditional
+branch like:
+if (cond)
+goto lab; // ORIG probability
+into
+if (cond1)
+goto lab; // FIRST = ORIG * CPROB probability
+if (cond2)
+goto lab; // SECOND probability
+such that the overall probability of jumping to lab remains
+the same.  CPROB gives the relative probability between the
+branches.  */
+profile_probability split (const profile_probability &cprob)
+{
+profile_probability ret = *this * cprob;
+/* The following is equivalent to:
+*this = cprob.invert () * *this / ret.invert ();  */
+*this = (*this - ret) / ret.invert ();
+return ret;
 }
 gcov_type apply (gcov_type val) const
 {
 if (*this == profile_probability::uninitialized ())
 /* Return THIS with quality dropped to AFDO.  */
 profile_probability afdo () const
 {
 profile_probability ret = *this;
 ret.m_quality = profile_afdo;
-return ret;
-}
-profile_probability combine_with_freq (int freq1, profile_probability other,
-					 int freq2) const
-{
-profile_probability ret;
-if (*this == profile_probability::uninitialized ()
-	  || other == profile_probability::uninitialized ())
-	return profile_probability::uninitialized ();
-gcc_checking_assert (freq1 >= 0 && freq2 >= 0);
-if (!freq1 && !freq2)
-	{
-	  ret.m_val = (m_val + other.m_val) / 2;
-	}
-else
-	ret.m_val = RDIV (m_val * (uint64_t) freq1
-			  + other.m_val * (uint64_t) freq2, freq1 + freq2);
-ret.m_quality = MIN (m_quality, other.m_quality);
 return ret;
 }
 /* Return *THIS * NUM / DEN.  */
 profile_probability apply_scale (int64_t num, int64_t den) const
 }
 /* Return false if profile_probability is bogus.  */
 bool verify () const
 {
+gcc_checking_assert (m_quality != profile_uninitialized);
 if (m_val == uninitialized_probability)
 	return m_quality == profile_guessed;
-else
+else if (m_quality < profile_guessed)
-	return m_val <= max_probability;
+	return false;
+return m_val <= max_probability;
 }
 /* Comparsions are three-state and conservative.  False is returned if
 the inequality can not be decided.  */
 bool operator< (const profile_probability &other) const
 /* Return true if THIS is known to differ significantly from OTHER.  */
 bool differs_from_p (profile_probability other) const;
 /* Return if difference is greater than 50%.  */
 bool differs_lot_from_p (profile_probability other) const;
+/* COUNT1 times event happens with *THIS probability, COUNT2 times OTHER
+happens with COUNT2 probablity. Return probablity that either *THIS or
+OTHER happens.  */
+profile_probability combine_with_count (profile_count count1,
+					  profile_probability other,
+					  profile_count count2) const;
 /* LTO streaming support.  */
 static profile_probability stream_in (struct lto_input_block *);
 void stream_out (struct output_block *);
 void stream_out (struct lto_output_stream *);
 };
-/* Main data type to hold profile counters in GCC.  In most cases profile
+/* Main data type to hold profile counters in GCC. Profile counts originate
-counts originate from profile feedback. They are 64bit integers
+either from profile feedback, static profile estimation or both.  We do not
-representing number of executions during the train run.
+perform whole program profile propagation and thus profile estimation
+counters are often local to function, while counters from profile feedback
+(or special cases of profile estimation) can be used inter-procedurally.
+There are 3 basic types
+1) local counters which are result of intra-procedural static profile
+estimation.
+2) ipa counters which are result of profile feedback or special case
+of static profile estimation (such as in function main).
+3) counters which counts as 0 inter-procedurally (beause given function
+was never run in train feedback) but they hold local static profile
+estimate.
+Counters of type 1 and 3 can not be mixed with counters of different type
+within operation (because whole function should use one type of counter)
+with exception that global zero mix in most operations where outcome is
+well defined.
+To take local counter and use it inter-procedurally use ipa member function
+which strips information irelevant at the inter-procedural level.
+Counters are 61bit integers representing number of executions during the
+train run or normalized frequency within the function.
 As the profile is maintained during the compilation, many adjustments are
 made.  Not all transformations can be made precisely, most importantly
 when code is being duplicated.  It also may happen that part of CFG has
 profile counts known while other do not - for example when LTO optimizing
 partly profiled program or when profile was lost due to COMDAT merging.
 main () function
 profile_count::uninitialized ()  for unknown execution count.
 */
+class sreal;
 class GTY(()) profile_count
 {
+public:
 /* Use 62bit to hold basic block counters.  Should be at least
 64bit.  Although a counter cannot be negative, we use a signed
 type to hold various extra stages.  */
-static const int n_bits = 62;
+static const int n_bits = 61;
+private:
 static const uint64_t max_count = ((uint64_t) 1 << n_bits) - 2;
 static const uint64_t uninitialized_count = ((uint64_t) 1 << n_bits) - 1;
 uint64_t m_val : n_bits;
-enum profile_quality m_quality : 2;
+enum profile_quality m_quality : 3;
+/* Return true if both values can meaningfully appear in single function
+body.  We have either all counters in function local or global, otherwise
+operations between them are not really defined well.  */
+bool compatible_p (const profile_count other) const
+{
+if (!initialized_p () || !other.initialized_p ())
+	return true;
+if (*this == profile_count::zero ()
+	  || other == profile_count::zero ())
+	return true;
+return ipa_p () == other.ipa_p ();
+}
 public:
 /* Used for counters which are expected to be never executed.  */
 static profile_count zero ()
 {
 return from_gcov_type (0);
+}
+static profile_count adjusted_zero ()
+{
+profile_count c;
+c.m_val = 0;
+c.m_quality = profile_adjusted;
+return c;
 }
 static profile_count guessed_zero ()
 {
 profile_count c;
 c.m_val = 0;
 initialization did not happen yet or because profile is unknown.  */
 static profile_count uninitialized ()
 {
 profile_count c;
 c.m_val = uninitialized_count;
-c.m_quality = profile_guessed;
+c.m_quality = profile_guessed_local;
 return c;
-}
-/* The profiling runtime uses gcov_type, which is usually 64bit integer.
-Conversions back and forth are used to read the coverage and get it
-into internal representation.  */
-static profile_count from_gcov_type (gcov_type v)
-{
-profile_count ret;
-gcc_checking_assert (v >= 0 && (uint64_t) v <= max_count);
-ret.m_val = v;
-ret.m_quality = profile_precise;
-return ret;
 }
 /* Conversion to gcov_type is lossy.  */
 gcov_type to_gcov_type () const
 {
 /* Return true if value can be trusted.  */
 bool reliable_p () const
 {
 return m_quality >= profile_adjusted;
 }
+/* Return true if vlaue can be operated inter-procedurally.  */
+bool ipa_p () const
+{
+return !initialized_p () || m_quality >= profile_guessed_global0;
+}
+/* Return true if quality of profile is precise.  */
+bool precise_p () const
+{
+return m_quality == profile_precise;
+}
+/* Get the quality of the count.  */
+enum profile_quality quality () const { return m_quality; }
 /* When merging basic blocks, the two different profile counts are unified.
 Return true if this can be done without losing info about profile.
 The only case we care about here is when first BB contains something
 that makes it terminate in a way not visible in CFG.  */
 	return other;
 if (!initialized_p () || !other.initialized_p ())
 	return profile_count::uninitialized ();
 profile_count ret;
+gcc_checking_assert (compatible_p (other));
 ret.m_val = m_val + other.m_val;
 ret.m_quality = MIN (m_quality, other.m_quality);
 return ret;
 }
 profile_count &operator+= (const profile_count &other)
 	}
 if (!initialized_p () || !other.initialized_p ())
 	return *this = profile_count::uninitialized ();
 else
 	{
+gcc_checking_assert (compatible_p (other));
 	  m_val += other.m_val;
 	  m_quality = MIN (m_quality, other.m_quality);
 	}
 return *this;
 }
 {
 if (*this == profile_count::zero () || other == profile_count::zero ())
 	return *this;
 if (!initialized_p () || !other.initialized_p ())
 	return profile_count::uninitialized ();
+gcc_checking_assert (compatible_p (other));
 profile_count ret;
 ret.m_val = m_val >= other.m_val ? m_val - other.m_val : 0;
 ret.m_quality = MIN (m_quality, other.m_quality);
 return ret;
 }
 	return *this;
 if (!initialized_p () || !other.initialized_p ())
 	return *this = profile_count::uninitialized ();
 else
 	{
+gcc_checking_assert (compatible_p (other));
 	  m_val = m_val >= other.m_val ? m_val - other.m_val: 0;
 	  m_quality = MIN (m_quality, other.m_quality);
 	}
 return *this;
 }
 /* Return false if profile_count is bogus.  */
 bool verify () const
 {
-return m_val != uninitialized_count || m_quality == profile_guessed;
+gcc_checking_assert (m_quality != profile_uninitialized);
+return m_val != uninitialized_count || m_quality == profile_guessed_local;
 }
 /* Comparsions are three-state and conservative.  False is returned if
 the inequality can not be decided.  */
 bool operator< (const profile_count &other) const
 {
-return initialized_p () && other.initialized_p () && m_val < other.m_val;
+if (!initialized_p () || !other.initialized_p ())
+	return false;
+if (*this == profile_count::zero ())
+	return !(other == profile_count::zero ());
+if (other == profile_count::zero ())
+	return false;
+gcc_checking_assert (compatible_p (other));
+return m_val < other.m_val;
 }
 bool operator> (const profile_count &other) const
 {
+if (!initialized_p () || !other.initialized_p ())
+	return false;
+if (*this  == profile_count::zero ())
+	return false;
+if (other == profile_count::zero ())
+	return !(*this == profile_count::zero ());
+gcc_checking_assert (compatible_p (other));
 return initialized_p () && other.initialized_p () && m_val > other.m_val;
 }
 bool operator< (const gcov_type other) const
 {
+gcc_checking_assert (ipa_p ());
 gcc_checking_assert (other >= 0);
 return initialized_p () && m_val < (uint64_t) other;
 }
 bool operator> (const gcov_type other) const
 {
+gcc_checking_assert (ipa_p ());
 gcc_checking_assert (other >= 0);
 return initialized_p () && m_val > (uint64_t) other;
 }
 bool operator<= (const profile_count &other) const
 {
-return initialized_p () && other.initialized_p () && m_val <= other.m_val;
+if (!initialized_p () || !other.initialized_p ())
+	return false;
+if (*this == profile_count::zero ())
+	return true;
+if (other == profile_count::zero ())
+	return (*this == profile_count::zero ());
+gcc_checking_assert (compatible_p (other));
+return m_val <= other.m_val;
 }
 bool operator>= (const profile_count &other) const
 {
-return initialized_p () && other.initialized_p () && m_val >= other.m_val;
+if (!initialized_p () || !other.initialized_p ())
+	return false;
+if (other == profile_count::zero ())
+	return true;
+if (*this == profile_count::zero ())
+	return !(other == profile_count::zero ());
+gcc_checking_assert (compatible_p (other));
+return m_val >= other.m_val;
 }
 bool operator<= (const gcov_type other) const
 {
+gcc_checking_assert (ipa_p ());
 gcc_checking_assert (other >= 0);
 return initialized_p () && m_val <= (uint64_t) other;
 }
 bool operator>= (const gcov_type other) const
 {
+gcc_checking_assert (ipa_p ());
 gcc_checking_assert (other >= 0);
 return initialized_p () && m_val >= (uint64_t) other;
+}
+/* Return true when value is not zero and can be used for scaling.
+This is different from *this > 0 because that requires counter to
+be IPA.  */
+bool nonzero_p () const
+{
+return initialized_p () && m_val != 0;
+}
+/* Make counter forcingly nonzero.  */
+profile_count force_nonzero () const
+{
+if (!initialized_p ())
+	return *this;
+profile_count ret = *this;
+if (ret.m_val == 0)
+	{
+	  ret.m_val = 1;
+ret.m_quality = MIN (m_quality, profile_adjusted);
+	}
+return ret;
+}
+profile_count max (profile_count other) const
+{
+if (!initialized_p ())
+	return other;
+if (!other.initialized_p ())
+	return *this;
+if (*this == profile_count::zero ())
+	return other;
+if (other == profile_count::zero ())
+	return *this;
+gcc_checking_assert (compatible_p (other));
+if (m_val < other.m_val || (m_val == other.m_val
+				  && m_quality < other.m_quality))
+	return other;
+return *this;
 }
 /* PROB is a probability in scale 0...REG_BR_PROB_BASE.  Scale counter
 accordingly.  */
 profile_count apply_probability (int prob) const
 ret.m_quality = MIN (m_quality, profile_adjusted);
 return ret;
 }
 profile_count apply_scale (profile_count num, profile_count den) const
 {
-if (m_val == 0)
+if (*this == profile_count::zero ())
 	return *this;
-if (num.m_val == 0)
+if (num == profile_count::zero ())
 	return num;
 if (!initialized_p () || !num.initialized_p () || !den.initialized_p ())
 	return profile_count::uninitialized ();
-gcc_checking_assert (den > 0);
 if (num == den)
 	return *this;
+gcc_checking_assert (den.m_val);
 profile_count ret;
 uint64_t val;
 safe_scale_64bit (m_val, num.m_val, den.m_val, &val);
 ret.m_val = MIN (val, max_count);
-ret.m_quality = MIN (m_quality, profile_adjusted);
+ret.m_quality = MIN (MIN (MIN (m_quality, profile_adjusted),
+			        num.m_quality), den.m_quality);
+if (num.ipa_p () && !ret.ipa_p ())
+	ret.m_quality = MIN (num.m_quality, profile_guessed);
+return ret;
+}
+/* Return THIS with quality dropped to GUESSED_LOCAL.  */
+profile_count guessed_local () const
+{
+profile_count ret = *this;
+if (!initialized_p ())
+	return *this;
+ret.m_quality = profile_guessed_local;
+return ret;
+}
+/* We know that profile is globally 0 but keep local profile if present.  */
+profile_count global0 () const
+{
+profile_count ret = *this;
+if (!initialized_p ())
+	return *this;
+ret.m_quality = profile_guessed_global0;
+return ret;
+}
+/* We know that profile is globally adjusted 0 but keep local profile
+if present.  */
+profile_count global0adjusted () const
+{
+profile_count ret = *this;
+if (!initialized_p ())
+	return *this;
+ret.m_quality = profile_guessed_global0adjusted;
 return ret;
 }
 /* Return THIS with quality dropped to GUESSED.  */
 profile_count guessed () const
 {
 profile_count ret = *this;
-ret.m_quality = profile_guessed;
+ret.m_quality = MIN (ret.m_quality, profile_guessed);
 return ret;
+}
+/* Return variant of profile counte which is always safe to compare
+acorss functions.  */
+profile_count ipa () const
+{
+if (m_quality > profile_guessed_global0adjusted)
+	return *this;
+if (m_quality == profile_guessed_global0)
+	return profile_count::zero ();
+if (m_quality == profile_guessed_global0adjusted)
+	return profile_count::adjusted_zero ();
+return profile_count::uninitialized ();
 }
 /* Return THIS with quality dropped to AFDO.  */
 profile_count afdo () const
 {
 /* Return probability of event with counter THIS within event with counter
 OVERALL.  */
 profile_probability probability_in (const profile_count overall) const
 {
-if (!m_val)
+if (*this == profile_count::zero ()
+	  && !(overall == profile_count::zero ()))
 	return profile_probability::never ();
 if (!initialized_p () || !overall.initialized_p ()
 	  || !overall.m_val)
 	return profile_probability::uninitialized ();
-profile_probability ret;
+if (*this == overall && m_quality == profile_precise)
-if (overall < m_val)
+	return profile_probability::always ();
-	ret.m_val = profile_probability::max_probability;
+profile_probability ret;
+gcc_checking_assert (compatible_p (overall));
+if (overall.m_val < m_val)
+	{
+	  ret.m_val = profile_probability::max_probability;
+	  ret.m_quality = profile_guessed;
+	  return ret;
+	}
 else
 	ret.m_val = RDIV (m_val * profile_probability::max_probability,
 			  overall.m_val);
-ret.m_quality = MIN (m_quality, overall.m_quality);
+ret.m_quality = MIN (MAX (MIN (m_quality, overall.m_quality),
-return ret;
+				profile_guessed), profile_adjusted);
-}
+return ret;
+}
+int to_frequency (struct function *fun) const;
+int to_cgraph_frequency (profile_count entry_bb_count) const;
+sreal to_sreal_scale (profile_count in, bool *known = NULL) const;
 /* Output THIS to F.  */
 void dump (FILE *f) const;
 /* Print THIS to stderr.  */
 void debug () const;
 /* Return true if THIS is known to differ significantly from OTHER.  */
 bool differs_from_p (profile_count other) const;
+/* We want to scale profile across function boundary from NUM to DEN.
+Take care of the side case when NUM and DEN are zeros of incompatible
+kinds.  */
+static void adjust_for_ipa_scaling (profile_count *num, profile_count *den);
+/* THIS is a count of bb which is known to be executed IPA times.
+Combine this information into bb counter.  This means returning IPA
+if it is nonzero, not changing anything if IPA is uninitialized
+and if IPA is zero, turning THIS into corresponding local profile with
+global0.  */
+profile_count combine_with_ipa_count (profile_count ipa);
+/* The profiling runtime uses gcov_type, which is usually 64bit integer.
+Conversions back and forth are used to read the coverage and get it
+into internal representation.  */
+static profile_count from_gcov_type (gcov_type v);
 /* LTO streaming support.  */
 static profile_count stream_in (struct lto_input_block *);
 void stream_out (struct output_block *);
 void stream_out (struct lto_output_stream *);

Mercurial > hg > CbC > CbC_gcc

comparison gcc/profile-count.h @ 132:d34655255c78