Lines Matching refs:Good
10 known-good revision. It will then binary search across this revision range by
928 last known good revision."""
1643 """Given known good and bad values, decide if the current_value passed
1763 # this directory directly won't give much good info.
1797 known good and bad revisions.
1800 good_rev: The last known good revision where the performance regression
1874 good_revision: Last known good revision.
1877 A tuple with the new bad and good revisions.
1919 good_revision: Number/tag of the known good revision.
1923 True if the revisions are in the proper order (good earlier than bad).
1942 """Given known good and bad revisions, run a binary search on all
1948 good_revision: Number/tag of the known good revision.
2015 # Check that they didn't accidentally swap good
2071 # Perform the performance tests on the good and bad revisions, to get
2091 'the \'good\' reference value. The bisect cannot continue without '
2092 'a working \'good\' revision to start from.\n\nError: %s' %
2102 # Can just mark the good and bad revisions explicitly here since we
2306 state_str = 'Good'
2502 # If the "good" valuse are supposed to be higher than the "bad"
2561 build_status = 'Good'
2705 'Must be later than good revision. May be either a git' +
