https://gcc.gnu.org/bugzilla/show_bug.cgi?id=111498
--- Comment #6 from Jan Hubicka <hubicka at ucw dot cz> --- > It creeps up slowly. Whatever it exactly means. Confirmed from the graph. It tests that Kirhoff laws are met on basic block entry. So sum of counts of incoming edges should match count of BB. The number reported is sum of all disprepancies (so bigger differences counts more) with profile feedback.
