equal
deleted
inserted
replaced
906 # use linkrev to find the first changeset where self appeared |
906 # use linkrev to find the first changeset where self appeared |
907 base = self |
907 base = self |
908 introrev = self.introrev() |
908 introrev = self.introrev() |
909 if self.rev() != introrev: |
909 if self.rev() != introrev: |
910 base = self.filectx(self.filenode(), changeid=introrev) |
910 base = self.filectx(self.filenode(), changeid=introrev) |
|
911 if getattr(base, '_ancestrycontext', None) is None: |
911 ac = self._repo.changelog.ancestors([introrev], inclusive=True) |
912 ac = self._repo.changelog.ancestors([introrev], inclusive=True) |
912 base._ancestrycontext = ac |
913 base._ancestrycontext = ac |
913 |
914 |
914 # This algorithm would prefer to be recursive, but Python is a |
915 # This algorithm would prefer to be recursive, but Python is a |
915 # bit recursion-hostile. Instead we do an iterative |
916 # bit recursion-hostile. Instead we do an iterative |