This is an archive of the discontinued Mercurial Phabricator instance.

Diff	ID	Description	Created	Lint	Unit
Base		Base
Diff 1	20973		Apr 2 2020, 4:31 PM	★	★
Diff 2	21052		Apr 14 2020, 11:29 AM	★	★
Diff 3	21083	rHG0415a566742a602310157484bb9961a698881fc7	Apr 2 2020, 3:57 PM	★	★

Commit	Parents	Author	Summary	Date
c6a8890e8bfa	649d966adb92	Augie Fackler		Apr 2 2020, 3:57 PM

Status	Author	Revision
Closed	durin42	D8375 manifest: leave a TODO where we may have more work for sha1 portability
Abandoned	durin42	D8424 manifest: fix missing `el` on an `elif` spotted by yuya
Closed	durin42	D8374 fuzz: tell manifest fuzzer about longer node hashes
Closed	durin42	D8373 manifest: add test for long hashes
Closed	durin42	D8372 manifest: remove a final 40-byte assumption from pure-python parser
Closed	durin42	D8371 manifest: fix yet another 20-byte-hash assumption
Closed	durin42	D8370 manifest: fix another pure-parsing 20-byte assumption
Closed	durin42	D8369 manifest: teach treemanifest about long hashes
Closed	durin42	D8368 manifest: start removing 40-byte hash restrictions from C code
Closed	durin42	D8367 manifest: remove a 20-byte-hash assumption from pure manifest parsing

Diff 20973

	offset += end_cut - cur			offset += end_cut - cur
	l.append(self.data[last_cut:end_cut])			l.append(self.data[last_cut:end_cut])
	else:			else:
	while i < len(self.positions) and self.positions[i] < 0:			while i < len(self.positions) and self.positions[i] < 0:
	cur = self.positions[i]			cur = self.positions[i]
	t = self.extradata[-cur - 1]			t = self.extradata[-cur - 1]
	l.append(self._pack(t))			l.append(self._pack(t))
	self.positions[i] = offset			self.positions[i] = offset
	if len(t[1]) > 20:			hlen = 20
	self.extrainfo[i] = ord(t[1][21])			if len(t[1]) > 25:
				hlen = 32
				if len(t[1]) > hlen:
				self.extrainfo[i] = ord(t[1][hlen + 1])
	offset += len(l[-1])			offset += len(l[-1])
	i += 1			i += 1
	self.data = b''.join(l)			self.data = b''.join(l)
	self.hasremovals = False			self.hasremovals = False
	self.extradata = []			self.extradata = []

	def _pack(self, d):			def _pack(self, d):
	n = d[1]			n = d[1]