i18n-ja: synchronized with 9a391d720cf9

i18n-pt_BR: synchronized with 448bb32b8ee6

filectx: use _descendantrev in parents() This lets us be lazy about linkrev adjustments when tracing history.

filectx: if we have a _descendantrev, use it to adjust linkrev This lets us use _adjustlinkrev lazily.

copies: use linkrev for file tracing limit This lets us lazily evaluate _adjustlinkrev.

filectx: use linkrev to sort ancestors We're going to make rev() lazily do _adjustlinkrevs, and we don't want that to happen when we're quickly tracing through file ancestry without caring about revs (as we do when finding copies). This takes us back to pre-linkrev-correction behavior, but shouldn't regress us relative to the last stable release.

_adjustlinkrev: reuse ancestors set during rename detection (issue4514) The new linkrev adjustement mechanism makes rename detection very slow, because each file rewalks the ancestor dag. To mitigate the issue in Mercurial 3.3, we introduce a simplistic way to share the ancestors computation for the linkrev validation phase. We can reuse the ancestors in that case because we do not care about sub-branching in the ancestors graph. The cached set will be use to check if the linkrev is valid in the search context. This is the vast majority of the ancestors usage during copies search since the uncached one will only be used when linkrev is invalid, which is hopefully rare.