| Alphare |
| hg-reviewers |
Tevlogv2 will not use inlined revlog. As a result we can drop the associated
code.
| No Linters Available |
| No Unit Test Coverage |
| Path | Packages | |||
|---|---|---|---|---|
| M | mercurial/pure/parsers.py (34 lines) |
| Commit | Parents | Author | Summary | Date |
|---|---|---|---|---|
| d6a4d994a7a8 | fabee1f7e59d | Pierre-Yves David | May 3 2021, 11:18 PM |
| def _calculate_index(self, i): | def _calculate_index(self, i): | ||||
| return self._offsets[i] | return self._offsets[i] | ||||
| def parse_index2(data, inline, revlogv2=False): | def parse_index2(data, inline, revlogv2=False): | ||||
| if not inline: | if not inline: | ||||
| cls = IndexObject2 if revlogv2 else IndexObject | cls = IndexObject2 if revlogv2 else IndexObject | ||||
| return cls(data), None | return cls(data), None | ||||
| cls = InlinedIndexObject2 if revlogv2 else InlinedIndexObject | cls = InlinedIndexObject | ||||
| return cls(data, inline), (0, data) | return cls(data, inline), (0, data) | ||||
| class Index2Mixin(object): | class IndexObject2(IndexObject): | ||||
| index_format = revlog_constants.INDEX_ENTRY_V2 | index_format = revlog_constants.INDEX_ENTRY_V2 | ||||
| def replace_sidedata_info( | def replace_sidedata_info( | ||||
| self, | self, | ||||
| rev, | rev, | ||||
| sidedata_offset, | sidedata_offset, | ||||
| sidedata_length, | sidedata_length, | ||||
| offset_flags, | offset_flags, | ||||
| def pack_header(self, header): | def pack_header(self, header): | ||||
| """pack header information as binary""" | """pack header information as binary""" | ||||
| msg = 'version header should go in the docket, not the index: %d' | msg = 'version header should go in the docket, not the index: %d' | ||||
| msg %= header | msg %= header | ||||
| raise error.ProgrammingError(msg) | raise error.ProgrammingError(msg) | ||||
| class IndexObject2(Index2Mixin, IndexObject): | |||||
| pass | |||||
| class InlinedIndexObject2(Index2Mixin, InlinedIndexObject): | |||||
| def _inline_scan(self, lgt): | |||||
| sidedata_length_pos = 72 | |||||
| off = 0 | |||||
| if lgt is not None: | |||||
| self._offsets = [0] * lgt | |||||
| count = 0 | |||||
| while off <= len(self._data) - self.entry_size: | |||||
| start = off + self.big_int_size | |||||
| (data_size,) = struct.unpack( | |||||
| b'>i', | |||||
| self._data[start : start + self.int_size], | |||||
| ) | |||||
| start = off + sidedata_length_pos | |||||
| (side_data_size,) = struct.unpack( | |||||
| b'>i', self._data[start : start + self.int_size] | |||||
| ) | |||||
| if lgt is not None: | |||||
| self._offsets[count] = off | |||||
| count += 1 | |||||
| off += self.entry_size + data_size + side_data_size | |||||
| if off != len(self._data): | |||||
| raise ValueError(b"corrupted data") | |||||
| return count | |||||
| def parse_index_devel_nodemap(data, inline): | def parse_index_devel_nodemap(data, inline): | ||||
| """like parse_index2, but alway return a PersistentNodeMapIndexObject""" | """like parse_index2, but alway return a PersistentNodeMapIndexObject""" | ||||
| return PersistentNodeMapIndexObject(data), None | return PersistentNodeMapIndexObject(data), None | ||||
| def parse_dirstate(dmap, copymap, st): | def parse_dirstate(dmap, copymap, st): | ||||
| parents = [st[:20], st[20:40]] | parents = [st[:20], st[20:40]] | ||||
| # dereference fields so they will be local in loop | # dereference fields so they will be local in loop | ||||