Show More
@@ -241,7 +241,7 b' def _readtagcache(ui, repo):' | |||||
241 | # This is the most expensive part of finding tags, so performance |
|
241 | # This is the most expensive part of finding tags, so performance | |
242 | # depends primarily on the size of newheads. Worst case: no cache |
|
242 | # depends primarily on the size of newheads. Worst case: no cache | |
243 | # file, so newheads == repoheads. |
|
243 | # file, so newheads == repoheads. | |
244 | for head in newheads: |
|
244 | for head in reversed(newheads): | |
245 | cctx = repo[head] |
|
245 | cctx = repo[head] | |
246 | try: |
|
246 | try: | |
247 | fnode = cctx.filenode('.hgtags') |
|
247 | fnode = cctx.filenode('.hgtags') |
General Comments 0
You need to be logged in to leave comments.
Login now