mercurial-scm/hg: mercurial/revlog.py comparison

comparison mercurial/revlog.py @ 192:5d8553352d2e

Changes to network protocol -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Changes to network protocol Stream changes at the delta level rather than at whole delta groups this breaks the protocol - we now send a zero byte delta to indicate the end of a group rather than sending the entire group length up front Fix filename length asymmetry while we're breaking things Fix hidden O(n^2) bug in calculating changegroup list.append(e) is O(n), list + [element] is not Decompress chunks on read in revlog.group() Improve status messages report bytes transferred report nothing to do Deal with /dev/null path brokenness Remove untriggered patch assertion manifest hash: 3eedcfe878561f9eb4adedb04f6be618fb8ae8d8 -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.0 (GNU/Linux) iD8DBQFCmzlqywK+sNU5EO8RAn0KAJ4z4toWSSGjLoZO6FKWLx/3QbZufACglQgd S48bumc++DnuY1iPSNWKGAI= =lCjx -----END PGP SIGNATURE-----

author	mpm@selenic.com
date	Mon, 30 May 2005 08:03:54 -0800
parents	083c38bdfa64
children	0a37e9c8ad6c

comparison

equal deleted inserted replaced

-:d7e859cf2f1b
+:5d8553352d2e
 base = self.base(t)
 start = self.start(base)
 end = self.end(t)
 prev = self.revision(self.tip())
 d = self.diff(prev, text)
-if self.patches(prev, [d]) != text:
-raise AssertionError("diff failed")
 data = compress(d)
 dist = end - start + len(data)
 # full versions are inserted when the needed deltas
 # become comparable to the uncompressed text
 if self.index[i][3] in linkmap:
 revs.append(i)
 needed[i] = 1
 # if we don't have any revisions touched by these changesets, bail
-if not revs: return struct.pack(">l", 0)
+if not revs:
+yield struct.pack(">l", 0)
+return
 # add the parent of the first rev
 p = self.parents(self.node(revs[0]))[0]
 revs.insert(0, self.rev(p))
 # calculate spans to retrieve from datafile
 needed = needed.keys()
 needed.sort()
 spans = []
+oo = -1
+ol = 0
 for n in needed:
 if n < 0: continue
 o = self.start(n)
 l = self.length(n)
-spans.append((o, l, [(n, l)]))
+if oo + ol == o: # can we merge with the previous?
+nl = spans[-1][2]
-# merge spans
+nl.append((n, l))
-merge = [spans.pop(0)]
+ol += l
-while spans:
+spans[-1] = (oo, ol, nl)
-e = spans.pop(0)
-f = merge[-1]
-if e[0] == f[0] + f[1]:
-merge[-1] = (f[0], f[1] + e[1], f[2] + e[2])
 else:
-merge.append(e)
+oo = o
+ol = l
+spans.append((oo, ol, [(n, l)]))
 # read spans in, divide up chunks
 chunks = {}
-for span in merge:
+for span in spans:
 # we reopen the file for each span to make http happy for now
 f = self.opener(self.datafile)
 f.seek(span[0])
 data = f.read(span[1])
 # divide up the span
 pos = 0
 for r, l in span[2]:
-chunks[r] = data[pos: pos + l]
+chunks[r] = decompress(data[pos: pos + l])
 pos += l
 # helper to reconstruct intermediate versions
 def construct(text, base, rev):
-bins = [decompress(chunks[r]) for r in xrange(base + 1, rev + 1)]
+bins = [chunks[r] for r in xrange(base + 1, rev + 1)]
 return mdiff.patches(text, bins)
 # build deltas
 deltas = []
 for d in xrange(0, len(revs) - 1):
 a, b = revs[d], revs[d + 1]
 n = self.node(b)
+# do we need to construct a new delta?
 if a + 1 != b or self.base(b) == b:
 if a >= 0:
 base = self.base(a)
-ta = decompress(chunks[self.base(a)])
+ta = chunks[self.base(a)]
 ta = construct(ta, base, a)
 else:
 ta = ""
 base = self.base(b)
 if a > base:
 base = a
 tb = ta
 else:
-tb = decompress(chunks[self.base(b)])
+tb = chunks[self.base(b)]
 tb = construct(tb, base, b)
 d = self.diff(ta, tb)
 else:
-d = decompress(chunks[b])
+d = chunks[b]
 p = self.parents(n)
 meta = n + p[0] + p[1] + linkmap[self.linkrev(n)]
 l = struct.pack(">l", len(meta) + len(d) + 4)
-deltas.append(l + meta + d)
+yield l
+yield meta
-l = struct.pack(">l", sum(map(len, deltas)) + 4)
+yield d
-deltas.insert(0, l)
-return "".join(deltas)
+yield struct.pack(">l", 0)
-def addgroup(self, data, linkmapper, transaction):
+def addgroup(self, revs, linkmapper, transaction):
 # given a set of deltas, add them to the revision log. the
 # first delta is against its parent, which should be in our
 # log, the rest are against the previous delta.
-if not data: return self.tip()
-# retrieve the parent revision of the delta chain
-chain = data[24:44]
-if not chain in self.nodemap:
-raise "unknown base %s" % short(chain[:4])
 # track the base of the current delta log
 r = self.count()
 t = r - 1
+node = nullid
 base = prev = -1
 start = end = 0
 if r:
 start = self.start(self.base(t))
 transaction.add(self.indexfile, r * struct.calcsize(indexformat))
 dfh = self.opener(self.datafile, "a")
 ifh = self.opener(self.indexfile, "a")
 # loop through our set of deltas
-pos = 0
+chain = None
-while pos < len(data):
+for chunk in revs:
-l, node, p1, p2, cs = struct.unpack(">l20s20s20s20s",
+node, p1, p2, cs = struct.unpack("20s20s20s20s", chunk[:80])
-data[pos:pos+84])
 link = linkmapper(cs)
 if node in self.nodemap:
 raise "already have %s" % hex(node[:4])
-delta = data[pos + 84:pos + l]
+delta = chunk[80:]
-pos += l
+if not chain:
+# retrieve the parent revision of the delta chain
+chain = p1
+if not chain in self.nodemap:
+raise "unknown base %s" % short(chain[:4])
 # full versions are inserted when the needed deltas become
 # comparable to the uncompressed text or when the previous
 # version is not the one we have a delta against. We use
 # the size of the previous full rev as a proxy for the

Mercurial > public > mercurial-scm > hg

comparison mercurial/revlog.py @ 192:5d8553352d2e