equal
deleted
inserted
replaced
182 start = max(end - blocksize, 0) |
182 start = max(end - blocksize, 0) |
183 self.dataf.seek(start) |
183 self.dataf.seek(start) |
184 data = self.dataf.read(end - start) |
184 data = self.dataf.read(end - start) |
185 findend = end - start |
185 findend = end - start |
186 while True: |
186 while True: |
187 # we're searching backwards, so weh have to make sure |
187 # we're searching backwards, so we have to make sure |
188 # we don't find a changeset where this node is a parent |
188 # we don't find a changeset where this node is a parent |
189 off = data.rfind(node, 0, findend) |
189 off = data.find(node, 0, findend) |
190 findend = off |
190 findend = off |
191 if off >= 0: |
191 if off >= 0: |
192 i = off / self.s |
192 i = off / self.s |
193 off = i * self.s |
193 off = i * self.s |
194 n = data[off + ngshaoffset:off + ngshaoffset + 20] |
194 n = data[off + ngshaoffset:off + ngshaoffset + 20] |