##// END OF EJS Templates
hg pull: more query fixes...
mpm@selenic.com -
r328:dac675ef default
parent child Browse files
Show More
@@ -1,1350 +1,1353 b''
1 1 # hg.py - repository classes for mercurial
2 2 #
3 3 # Copyright 2005 Matt Mackall <mpm@selenic.com>
4 4 #
5 5 # This software may be used and distributed according to the terms
6 6 # of the GNU General Public License, incorporated herein by reference.
7 7
8 8 import sys, struct, os
9 9 from revlog import *
10 10 from demandload import *
11 11 demandload(globals(), "re lock urllib urllib2 transaction time socket")
12 12 demandload(globals(), "tempfile byterange difflib")
13 13
14 14 def is_exec(f):
15 15 return (os.stat(f).st_mode & 0100 != 0)
16 16
17 17 def set_exec(f, mode):
18 18 s = os.stat(f).st_mode
19 19 if (s & 0100 != 0) == mode:
20 20 return
21 21 if mode:
22 22 # Turn on +x for every +r bit when making a file executable
23 23 # and obey umask.
24 24 umask = os.umask(0)
25 25 os.umask(umask)
26 26 os.chmod(f, s | (s & 0444) >> 2 & ~umask)
27 27 else:
28 28 os.chmod(f, s & 0666)
29 29
30 30 class filelog(revlog):
31 31 def __init__(self, opener, path):
32 32 revlog.__init__(self, opener,
33 33 os.path.join("data", path + ".i"),
34 34 os.path.join("data", path + ".d"))
35 35
36 36 def read(self, node):
37 37 return self.revision(node)
38 38 def add(self, text, transaction, link, p1=None, p2=None):
39 39 return self.addrevision(text, transaction, link, p1, p2)
40 40
41 41 def annotate(self, node):
42 42
43 43 def decorate(text, rev):
44 44 return [(rev, l) for l in text.splitlines(1)]
45 45
46 46 def strip(annotation):
47 47 return [e[1] for e in annotation]
48 48
49 49 def pair(parent, child):
50 50 new = []
51 51 sm = difflib.SequenceMatcher(None, strip(parent), strip(child))
52 52 for o, m, n, s, t in sm.get_opcodes():
53 53 if o == 'equal':
54 54 new += parent[m:n]
55 55 else:
56 56 new += child[s:t]
57 57 return new
58 58
59 59 # find all ancestors
60 60 needed = {node:1}
61 61 visit = [node]
62 62 while visit:
63 63 n = visit.pop(0)
64 64 for p in self.parents(n):
65 65 if p not in needed:
66 66 needed[p] = 1
67 67 visit.append(p)
68 68 else:
69 69 # count how many times we'll use this
70 70 needed[p] += 1
71 71
72 72 # sort by revision which is a topological order
73 73 visit = needed.keys()
74 74 visit = [ (self.rev(n), n) for n in visit ]
75 75 visit.sort()
76 76 visit = [ p[1] for p in visit ]
77 77 hist = {}
78 78
79 79 for n in visit:
80 80 curr = decorate(self.read(n), self.linkrev(n))
81 81 for p in self.parents(n):
82 82 if p != nullid:
83 83 curr = pair(hist[p], curr)
84 84 # trim the history of unneeded revs
85 85 needed[p] -= 1
86 86 if not needed[p]:
87 87 del hist[p]
88 88 hist[n] = curr
89 89
90 90 return hist[n]
91 91
92 92 class manifest(revlog):
93 93 def __init__(self, opener):
94 94 self.mapcache = None
95 95 self.listcache = None
96 96 self.addlist = None
97 97 revlog.__init__(self, opener, "00manifest.i", "00manifest.d")
98 98
99 99 def read(self, node):
100 100 if node == nullid: return {} # don't upset local cache
101 101 if self.mapcache and self.mapcache[0] == node:
102 102 return self.mapcache[1].copy()
103 103 text = self.revision(node)
104 104 map = {}
105 105 flag = {}
106 106 self.listcache = (text, text.splitlines(1))
107 107 for l in self.listcache[1]:
108 108 (f, n) = l.split('\0')
109 109 map[f] = bin(n[:40])
110 110 flag[f] = (n[40:-1] == "x")
111 111 self.mapcache = (node, map, flag)
112 112 return map
113 113
114 114 def readflags(self, node):
115 115 if node == nullid: return {} # don't upset local cache
116 116 if self.mapcache or self.mapcache[0] != node:
117 117 self.read(node)
118 118 return self.mapcache[2]
119 119
120 120 def diff(self, a, b):
121 121 # this is sneaky, as we're not actually using a and b
122 122 if self.listcache and self.addlist and self.listcache[0] == a:
123 123 d = mdiff.diff(self.listcache[1], self.addlist, 1)
124 124 if mdiff.patch(a, d) != b:
125 125 sys.stderr.write("*** sortdiff failed, falling back ***\n")
126 126 return mdiff.textdiff(a, b)
127 127 return d
128 128 else:
129 129 return mdiff.textdiff(a, b)
130 130
131 131 def add(self, map, flags, transaction, link, p1=None, p2=None):
132 132 files = map.keys()
133 133 files.sort()
134 134
135 135 self.addlist = ["%s\000%s%s\n" %
136 136 (f, hex(map[f]), flags[f] and "x" or '')
137 137 for f in files]
138 138 text = "".join(self.addlist)
139 139
140 140 n = self.addrevision(text, transaction, link, p1, p2)
141 141 self.mapcache = (n, map, flags)
142 142 self.listcache = (text, self.addlist)
143 143 self.addlist = None
144 144
145 145 return n
146 146
147 147 class changelog(revlog):
148 148 def __init__(self, opener):
149 149 revlog.__init__(self, opener, "00changelog.i", "00changelog.d")
150 150
151 151 def extract(self, text):
152 152 if not text:
153 153 return (nullid, "", "0", [], "")
154 154 last = text.index("\n\n")
155 155 desc = text[last + 2:]
156 156 l = text[:last].splitlines()
157 157 manifest = bin(l[0])
158 158 user = l[1]
159 159 date = l[2]
160 160 files = l[3:]
161 161 return (manifest, user, date, files, desc)
162 162
163 163 def read(self, node):
164 164 return self.extract(self.revision(node))
165 165
166 166 def add(self, manifest, list, desc, transaction, p1=None, p2=None,
167 167 user=None, date=None):
168 168 user = (user or
169 169 os.environ.get("HGUSER") or
170 170 os.environ.get("EMAIL") or
171 171 os.environ.get("LOGNAME", "unknown") + '@' + socket.getfqdn())
172 172 date = date or "%d %d" % (time.time(), time.timezone)
173 173 list.sort()
174 174 l = [hex(manifest), user, date] + list + ["", desc]
175 175 text = "\n".join(l)
176 176 return self.addrevision(text, transaction, self.count(), p1, p2)
177 177
178 178 class dirstate:
179 179 def __init__(self, opener, ui, root):
180 180 self.opener = opener
181 181 self.root = root
182 182 self.dirty = 0
183 183 self.ui = ui
184 184 self.map = None
185 185 self.pl = None
186 186
187 187 def __del__(self):
188 188 if self.dirty:
189 189 self.write()
190 190
191 191 def __getitem__(self, key):
192 192 try:
193 193 return self.map[key]
194 194 except TypeError:
195 195 self.read()
196 196 return self[key]
197 197
198 198 def __contains__(self, key):
199 199 if not self.map: self.read()
200 200 return key in self.map
201 201
202 202 def parents(self):
203 203 if not self.pl:
204 204 self.read()
205 205 return self.pl
206 206
207 207 def setparents(self, p1, p2 = nullid):
208 208 self.dirty = 1
209 209 self.pl = p1, p2
210 210
211 211 def state(self, key):
212 212 try:
213 213 return self[key][0]
214 214 except KeyError:
215 215 return "?"
216 216
217 217 def read(self):
218 218 if self.map is not None: return self.map
219 219
220 220 self.map = {}
221 221 self.pl = [nullid, nullid]
222 222 try:
223 223 st = self.opener("dirstate").read()
224 224 if not st: return
225 225 except: return
226 226
227 227 self.pl = [st[:20], st[20: 40]]
228 228
229 229 pos = 40
230 230 while pos < len(st):
231 231 e = struct.unpack(">cllll", st[pos:pos+17])
232 232 l = e[4]
233 233 pos += 17
234 234 f = st[pos:pos + l]
235 235 self.map[f] = e[:4]
236 236 pos += l
237 237
238 238 def update(self, files, state):
239 239 ''' current states:
240 240 n normal
241 241 m needs merging
242 242 r marked for removal
243 243 a marked for addition'''
244 244
245 245 if not files: return
246 246 self.read()
247 247 self.dirty = 1
248 248 for f in files:
249 249 if state == "r":
250 250 self.map[f] = ('r', 0, 0, 0)
251 251 else:
252 252 s = os.stat(os.path.join(self.root, f))
253 253 self.map[f] = (state, s.st_mode, s.st_size, s.st_mtime)
254 254
255 255 def forget(self, files):
256 256 if not files: return
257 257 self.read()
258 258 self.dirty = 1
259 259 for f in files:
260 260 try:
261 261 del self.map[f]
262 262 except KeyError:
263 263 self.ui.warn("not in dirstate: %s!\n" % f)
264 264 pass
265 265
266 266 def clear(self):
267 267 self.map = {}
268 268 self.dirty = 1
269 269
270 270 def write(self):
271 271 st = self.opener("dirstate", "w")
272 272 st.write("".join(self.pl))
273 273 for f, e in self.map.items():
274 274 e = struct.pack(">cllll", e[0], e[1], e[2], e[3], len(f))
275 275 st.write(e + f)
276 276 self.dirty = 0
277 277
278 278 def copy(self):
279 279 self.read()
280 280 return self.map.copy()
281 281
282 282 # used to avoid circular references so destructors work
283 283 def opener(base):
284 284 p = base
285 285 def o(path, mode="r"):
286 286 if p[:7] == "http://":
287 287 f = os.path.join(p, urllib.quote(path))
288 288 return httprangereader(f)
289 289
290 290 f = os.path.join(p, path)
291 291
292 292 mode += "b" # for that other OS
293 293
294 294 if mode[0] != "r":
295 295 try:
296 296 s = os.stat(f)
297 297 except OSError:
298 298 d = os.path.dirname(f)
299 299 if not os.path.isdir(d):
300 300 os.makedirs(d)
301 301 else:
302 302 if s.st_nlink > 1:
303 303 file(f + ".tmp", "w").write(file(f).read())
304 304 os.rename(f+".tmp", f)
305 305
306 306 return file(f, mode)
307 307
308 308 return o
309 309
310 310 class localrepository:
311 311 def __init__(self, ui, path=None, create=0):
312 312 self.remote = 0
313 313 if path and path[:7] == "http://":
314 314 self.remote = 1
315 315 self.path = path
316 316 else:
317 317 if not path:
318 318 p = os.getcwd()
319 319 while not os.path.isdir(os.path.join(p, ".hg")):
320 320 p = os.path.dirname(p)
321 321 if p == "/": raise "No repo found"
322 322 path = p
323 323 self.path = os.path.join(path, ".hg")
324 324
325 325 self.root = path
326 326 self.ui = ui
327 327
328 328 if create:
329 329 os.mkdir(self.path)
330 330 os.mkdir(self.join("data"))
331 331
332 332 self.opener = opener(self.path)
333 333 self.wopener = opener(self.root)
334 334 self.manifest = manifest(self.opener)
335 335 self.changelog = changelog(self.opener)
336 336 self.ignorelist = None
337 337 self.tags = None
338 338
339 339 if not self.remote:
340 340 self.dirstate = dirstate(self.opener, ui, self.root)
341 341
342 342 def ignore(self, f):
343 343 if self.ignorelist is None:
344 344 self.ignorelist = []
345 345 try:
346 346 l = self.wfile(".hgignore")
347 347 for pat in l:
348 348 if pat != "\n":
349 349 self.ignorelist.append(re.compile(pat[:-1]))
350 350 except IOError: pass
351 351 for pat in self.ignorelist:
352 352 if pat.search(f): return True
353 353 return False
354 354
355 355 def lookup(self, key):
356 356 if self.tags is None:
357 357 self.tags = {}
358 358 try:
359 359 # read each head of the tags file, ending with the tip
360 360 # and add each tag found to the map, with "newer" ones
361 361 # taking precedence
362 362 fl = self.file(".hgtags")
363 363 h = fl.heads()
364 364 h.reverse()
365 365 for r in h:
366 366 for l in fl.revision(r).splitlines():
367 367 if l:
368 368 n, k = l.split(" ")
369 369 self.tags[k] = bin(n)
370 370 except KeyError: pass
371 371 self.tags['tip'] = self.changelog.tip()
372 372 try:
373 373 return self.tags[key]
374 374 except KeyError:
375 375 return self.changelog.lookup(key)
376 376
377 377 def join(self, f):
378 378 return os.path.join(self.path, f)
379 379
380 380 def wjoin(self, f):
381 381 return os.path.join(self.root, f)
382 382
383 383 def file(self, f):
384 384 if f[0] == '/': f = f[1:]
385 385 return filelog(self.opener, f)
386 386
387 387 def wfile(self, f, mode='r'):
388 388 return self.wopener(f, mode)
389 389
390 390 def transaction(self):
391 391 # save dirstate for undo
392 392 try:
393 393 ds = self.opener("dirstate").read()
394 394 except IOError:
395 395 ds = ""
396 396 self.opener("undo.dirstate", "w").write(ds)
397 397
398 398 return transaction.transaction(self.opener, self.join("journal"),
399 399 self.join("undo"))
400 400
401 401 def recover(self):
402 402 lock = self.lock()
403 403 if os.path.exists(self.join("recover")):
404 404 self.ui.status("attempting to rollback interrupted transaction\n")
405 405 return transaction.rollback(self.opener, self.join("recover"))
406 406 else:
407 407 self.ui.warn("no interrupted transaction available\n")
408 408
409 409 def undo(self):
410 410 lock = self.lock()
411 411 if os.path.exists(self.join("undo")):
412 412 self.ui.status("attempting to rollback last transaction\n")
413 413 transaction.rollback(self.opener, self.join("undo"))
414 414 self.dirstate = None
415 415 os.rename(self.join("undo.dirstate"), self.join("dirstate"))
416 416 self.dirstate = dirstate(self.opener, self.ui, self.root)
417 417 else:
418 418 self.ui.warn("no undo information available\n")
419 419
420 420 def lock(self, wait = 1):
421 421 try:
422 422 return lock.lock(self.join("lock"), 0)
423 423 except lock.LockHeld, inst:
424 424 if wait:
425 425 self.ui.warn("waiting for lock held by %s\n" % inst.args[0])
426 426 return lock.lock(self.join("lock"), wait)
427 427 raise inst
428 428
429 429 def rawcommit(self, files, text, user, date, p1=None, p2=None):
430 430 p1 = p1 or self.dirstate.parents()[0] or nullid
431 431 p2 = p2 or self.dirstate.parents()[1] or nullid
432 432 c1 = self.changelog.read(p1)
433 433 c2 = self.changelog.read(p2)
434 434 m1 = self.manifest.read(c1[0])
435 435 mf1 = self.manifest.readflags(c1[0])
436 436 m2 = self.manifest.read(c2[0])
437 437
438 438 tr = self.transaction()
439 439 mm = m1.copy()
440 440 mfm = mf1.copy()
441 441 linkrev = self.changelog.count()
442 442 self.dirstate.setparents(p1, p2)
443 443 for f in files:
444 444 try:
445 445 t = self.wfile(f).read()
446 446 tm = is_exec(self.wjoin(f))
447 447 r = self.file(f)
448 448 mfm[f] = tm
449 449 mm[f] = r.add(t, tr, linkrev,
450 450 m1.get(f, nullid), m2.get(f, nullid))
451 451 self.dirstate.update([f], "n")
452 452 except IOError:
453 453 try:
454 454 del mm[f]
455 455 del mfm[f]
456 456 self.dirstate.forget([f])
457 457 except:
458 458 # deleted from p2?
459 459 pass
460 460
461 461 mnode = self.manifest.add(mm, mfm, tr, linkrev, c1[0], c2[0])
462 462 n = self.changelog.add(mnode, files, text, tr, p1, p2, user, date)
463 463 tr.close()
464 464
465 465 def commit(self, files = None, text = "", user = None, date = None):
466 466 commit = []
467 467 remove = []
468 468 if files:
469 469 for f in files:
470 470 s = self.dirstate.state(f)
471 471 if s in 'nmai':
472 472 commit.append(f)
473 473 elif s == 'r':
474 474 remove.append(f)
475 475 else:
476 476 self.ui.warn("%s not tracked!\n" % f)
477 477 else:
478 478 (c, a, d, u) = self.diffdir(self.root)
479 479 commit = c + a
480 480 remove = d
481 481
482 482 if not commit and not remove:
483 483 self.ui.status("nothing changed\n")
484 484 return
485 485
486 486 p1, p2 = self.dirstate.parents()
487 487 c1 = self.changelog.read(p1)
488 488 c2 = self.changelog.read(p2)
489 489 m1 = self.manifest.read(c1[0])
490 490 mf1 = self.manifest.readflags(c1[0])
491 491 m2 = self.manifest.read(c2[0])
492 492 lock = self.lock()
493 493 tr = self.transaction()
494 494
495 495 # check in files
496 496 new = {}
497 497 linkrev = self.changelog.count()
498 498 commit.sort()
499 499 for f in commit:
500 500 self.ui.note(f + "\n")
501 501 try:
502 502 fp = self.wjoin(f)
503 503 mf1[f] = is_exec(fp)
504 504 t = file(fp).read()
505 505 except IOError:
506 506 self.warn("trouble committing %s!\n" % f)
507 507 raise
508 508
509 509 r = self.file(f)
510 510 fp1 = m1.get(f, nullid)
511 511 fp2 = m2.get(f, nullid)
512 512 new[f] = r.add(t, tr, linkrev, fp1, fp2)
513 513
514 514 # update manifest
515 515 m1.update(new)
516 516 for f in remove: del m1[f]
517 517 mn = self.manifest.add(m1, mf1, tr, linkrev, c1[0], c2[0])
518 518
519 519 # add changeset
520 520 new = new.keys()
521 521 new.sort()
522 522
523 523 if not text:
524 524 edittext = "\n" + "HG: manifest hash %s\n" % hex(mn)
525 525 edittext += "".join(["HG: changed %s\n" % f for f in new])
526 526 edittext += "".join(["HG: removed %s\n" % f for f in remove])
527 527 edittext = self.ui.edit(edittext)
528 528 if not edittext.rstrip():
529 529 return 1
530 530 text = edittext
531 531
532 532 n = self.changelog.add(mn, new, text, tr, p1, p2, user, date)
533 533 tr.close()
534 534
535 535 self.dirstate.setparents(n)
536 536 self.dirstate.update(new, "n")
537 537 self.dirstate.forget(remove)
538 538
539 539 def diffdir(self, path, changeset = None):
540 540 changed = []
541 541 added = []
542 542 unknown = []
543 543 mf = {}
544 544
545 545 if changeset:
546 546 change = self.changelog.read(changeset)
547 547 mf = self.manifest.read(change[0])
548 548 dc = dict.fromkeys(mf)
549 549 else:
550 550 changeset = self.dirstate.parents()[0]
551 551 change = self.changelog.read(changeset)
552 552 mf = self.manifest.read(change[0])
553 553 dc = self.dirstate.copy()
554 554
555 555 def fcmp(fn):
556 556 t1 = self.wfile(fn).read()
557 557 t2 = self.file(fn).revision(mf[fn])
558 558 return cmp(t1, t2)
559 559
560 560 for dir, subdirs, files in os.walk(path):
561 561 d = dir[len(self.root)+1:]
562 562 if ".hg" in subdirs: subdirs.remove(".hg")
563 563
564 564 for f in files:
565 565 fn = os.path.join(d, f)
566 566 try: s = os.stat(os.path.join(self.root, fn))
567 567 except: continue
568 568 if fn in dc:
569 569 c = dc[fn]
570 570 del dc[fn]
571 571 if not c:
572 572 if fcmp(fn):
573 573 changed.append(fn)
574 574 elif c[0] == 'm':
575 575 changed.append(fn)
576 576 elif c[0] == 'a':
577 577 added.append(fn)
578 578 elif c[0] == 'r':
579 579 unknown.append(fn)
580 580 elif c[2] != s.st_size or (c[1] ^ s.st_mode) & 0100:
581 581 changed.append(fn)
582 582 elif c[1] != s.st_mode or c[3] != s.st_mtime:
583 583 if fcmp(fn):
584 584 changed.append(fn)
585 585 else:
586 586 if self.ignore(fn): continue
587 587 unknown.append(fn)
588 588
589 589 deleted = dc.keys()
590 590 deleted.sort()
591 591
592 592 return (changed, added, deleted, unknown)
593 593
594 594 def diffrevs(self, node1, node2):
595 595 changed, added = [], []
596 596
597 597 change = self.changelog.read(node1)
598 598 mf1 = self.manifest.read(change[0])
599 599 change = self.changelog.read(node2)
600 600 mf2 = self.manifest.read(change[0])
601 601
602 602 for fn in mf2:
603 603 if mf1.has_key(fn):
604 604 if mf1[fn] != mf2[fn]:
605 605 changed.append(fn)
606 606 del mf1[fn]
607 607 else:
608 608 added.append(fn)
609 609
610 610 deleted = mf1.keys()
611 611 deleted.sort()
612 612
613 613 return (changed, added, deleted)
614 614
615 615 def add(self, list):
616 616 for f in list:
617 617 p = self.wjoin(f)
618 618 if not os.path.isfile(p):
619 619 self.ui.warn("%s does not exist!\n" % f)
620 620 elif self.dirstate.state(f) == 'n':
621 621 self.ui.warn("%s already tracked!\n" % f)
622 622 else:
623 623 self.dirstate.update([f], "a")
624 624
625 625 def forget(self, list):
626 626 for f in list:
627 627 if self.dirstate.state(f) not in 'ai':
628 628 self.ui.warn("%s not added!\n" % f)
629 629 else:
630 630 self.dirstate.forget([f])
631 631
632 632 def remove(self, list):
633 633 for f in list:
634 634 p = self.wjoin(f)
635 635 if os.path.isfile(p):
636 636 self.ui.warn("%s still exists!\n" % f)
637 637 elif f not in self.dirstate:
638 638 self.ui.warn("%s not tracked!\n" % f)
639 639 else:
640 640 self.dirstate.update([f], "r")
641 641
642 642 def heads(self):
643 643 return self.changelog.heads()
644 644
645 645 def branches(self, nodes):
646 646 if not nodes: nodes = [self.changelog.tip()]
647 647 b = []
648 648 for n in nodes:
649 649 t = n
650 650 while n:
651 651 p = self.changelog.parents(n)
652 652 if p[1] != nullid or p[0] == nullid:
653 653 b.append((t, n, p[0], p[1]))
654 654 break
655 655 n = p[0]
656 656 return b
657 657
658 658 def between(self, pairs):
659 659 r = []
660 660
661 661 for top, bottom in pairs:
662 662 n, l, i = top, [], 0
663 663 f = 1
664 664
665 665 while n != bottom:
666 666 p = self.changelog.parents(n)[0]
667 667 if i == f:
668 668 l.append(n)
669 669 f = f * 2
670 670 n = p
671 671 i += 1
672 672
673 673 r.append(l)
674 674
675 675 return r
676 676
677 677 def newer(self, nodes):
678 678 m = {}
679 679 nl = []
680 680 pm = {}
681 681 cl = self.changelog
682 682 t = l = cl.count()
683 683
684 684 # find the lowest numbered node
685 685 for n in nodes:
686 686 l = min(l, cl.rev(n))
687 687 m[n] = 1
688 688
689 689 for i in xrange(l, t):
690 690 n = cl.node(i)
691 691 if n in m: # explicitly listed
692 692 pm[n] = 1
693 693 nl.append(n)
694 694 continue
695 695 for p in cl.parents(n):
696 696 if p in pm: # parent listed
697 697 pm[n] = 1
698 698 nl.append(n)
699 699 break
700 700
701 701 return nl
702 702
703 703 def getchangegroup(self, remote):
704 704 m = self.changelog.nodemap
705 705 search = []
706 706 fetch = []
707 707 seen = {}
708 708 seenbranch = {}
709 709
710 710 # if we have an empty repo, fetch everything
711 711 if self.changelog.tip() == nullid:
712 712 self.ui.status("requesting all changes\n")
713 713 return remote.changegroup([nullid])
714 714
715 715 # otherwise, assume we're closer to the tip than the root
716 716 self.ui.status("searching for changes\n")
717 717 heads = remote.heads()
718 718 unknown = []
719 719 for h in heads:
720 720 if h not in m:
721 721 unknown.append(h)
722 722
723 723 if not unknown:
724 724 self.ui.status("nothing to do!\n")
725 725 return None
726 726
727 727 rep = {}
728 728 reqcnt = 0
729 729
730 730 unknown = remote.branches(unknown)
731 731 while unknown:
732 732 r = []
733 733 while unknown:
734 734 n = unknown.pop(0)
735 735 if n[0] in seen:
736 736 continue
737 seen[n[0]] = 1
738 737
739 738 self.ui.debug("examining %s:%s\n" % (short(n[0]), short(n[1])))
740 739 if n[0] == nullid:
741 740 break
742 if n[1] in seenbranch:
741 if n in seenbranch:
743 742 self.ui.debug("branch already found\n")
744 743 continue
745 744 if n[1] and n[1] in m: # do we know the base?
746 745 self.ui.debug("found incomplete branch %s:%s\n"
747 746 % (short(n[0]), short(n[1])))
748 747 search.append(n) # schedule branch range for scanning
749 seenbranch[n[1]] = 1
748 seenbranch[n] = 1
750 749 else:
751 750 if n[1] not in seen and n[1] not in fetch:
752 751 if n[2] in m and n[3] in m:
753 752 self.ui.debug("found new changeset %s\n" %
754 753 short(n[1]))
755 754 fetch.append(n[1]) # earliest unknown
756 755 continue
757 756
758 757 for a in n[2:4]:
759 758 if a not in rep:
760 759 r.append(a)
761 760 rep[a] = 1
762 761
762 seen[n[0]] = 1
763
763 764 if r:
764 765 reqcnt += 1
765 766 self.ui.debug("request %d: %s\n" %
766 767 (reqcnt, " ".join(map(short, r))))
767 768 for p in range(0, len(r), 10):
768 769 for b in remote.branches(r[p:p+10]):
769 770 self.ui.debug("received %s:%s\n" %
770 771 (short(b[0]), short(b[1])))
771 772 if b[0] not in m and b[0] not in seen:
772 773 unknown.append(b)
773 774
774 775 while search:
775 776 n = search.pop(0)
776 777 reqcnt += 1
777 778 l = remote.between([(n[0], n[1])])[0]
779 l.append(n[1])
778 780 p = n[0]
779 781 f = 1
780 for i in l + [n[1]]:
782 for i in l:
783 self.ui.debug("narrowing %d:%d %s\n" % (f, len(l), short(i)))
781 784 if i in m:
782 785 if f <= 2:
783 786 self.ui.debug("found new branch changeset %s\n" %
784 787 short(p))
785 788 fetch.append(p)
786 789 else:
787 790 self.ui.debug("narrowed branch search to %s:%s\n"
788 791 % (short(p), short(i)))
789 792 search.append((p, i))
790 793 break
791 794 p, f = i, f * 2
792 795
793 796 for f in fetch:
794 797 if f in m:
795 798 raise "already have", short(f[:4])
796 799
797 800 self.ui.note("adding new changesets starting at " +
798 801 " ".join([short(f) for f in fetch]) + "\n")
799 802
800 803 self.ui.debug("%d total queries\n" % reqcnt)
801 804
802 805 return remote.changegroup(fetch)
803 806
804 807 def changegroup(self, basenodes):
805 808 nodes = self.newer(basenodes)
806 809
807 810 # construct the link map
808 811 linkmap = {}
809 812 for n in nodes:
810 813 linkmap[self.changelog.rev(n)] = n
811 814
812 815 # construct a list of all changed files
813 816 changed = {}
814 817 for n in nodes:
815 818 c = self.changelog.read(n)
816 819 for f in c[3]:
817 820 changed[f] = 1
818 821 changed = changed.keys()
819 822 changed.sort()
820 823
821 824 # the changegroup is changesets + manifests + all file revs
822 825 revs = [ self.changelog.rev(n) for n in nodes ]
823 826
824 827 for y in self.changelog.group(linkmap): yield y
825 828 for y in self.manifest.group(linkmap): yield y
826 829 for f in changed:
827 830 yield struct.pack(">l", len(f) + 4) + f
828 831 g = self.file(f).group(linkmap)
829 832 for y in g:
830 833 yield y
831 834
832 835 def addchangegroup(self, generator):
833 836
834 837 class genread:
835 838 def __init__(self, generator):
836 839 self.g = generator
837 840 self.buf = ""
838 841 def read(self, l):
839 842 while l > len(self.buf):
840 843 try:
841 844 self.buf += self.g.next()
842 845 except StopIteration:
843 846 break
844 847 d, self.buf = self.buf[:l], self.buf[l:]
845 848 return d
846 849
847 850 def getchunk():
848 851 d = source.read(4)
849 852 if not d: return ""
850 853 l = struct.unpack(">l", d)[0]
851 854 if l <= 4: return ""
852 855 return source.read(l - 4)
853 856
854 857 def getgroup():
855 858 while 1:
856 859 c = getchunk()
857 860 if not c: break
858 861 yield c
859 862
860 863 def csmap(x):
861 864 self.ui.debug("add changeset %s\n" % short(x))
862 865 return self.changelog.count()
863 866
864 867 def revmap(x):
865 868 return self.changelog.rev(x)
866 869
867 870 if not generator: return
868 871 changesets = files = revisions = 0
869 872
870 873 source = genread(generator)
871 874 lock = self.lock()
872 875 tr = self.transaction()
873 876
874 877 # pull off the changeset group
875 878 self.ui.status("adding changesets\n")
876 879 co = self.changelog.tip()
877 880 cn = self.changelog.addgroup(getgroup(), csmap, tr, 1) # unique
878 881 changesets = self.changelog.rev(cn) - self.changelog.rev(co)
879 882
880 883 # pull off the manifest group
881 884 self.ui.status("adding manifests\n")
882 885 mm = self.manifest.tip()
883 886 mo = self.manifest.addgroup(getgroup(), revmap, tr)
884 887
885 888 # process the files
886 889 self.ui.status("adding file revisions\n")
887 890 while 1:
888 891 f = getchunk()
889 892 if not f: break
890 893 self.ui.debug("adding %s revisions\n" % f)
891 894 fl = self.file(f)
892 895 o = fl.tip()
893 896 n = fl.addgroup(getgroup(), revmap, tr)
894 897 revisions += fl.rev(n) - fl.rev(o)
895 898 files += 1
896 899
897 900 self.ui.status(("modified %d files, added %d changesets" +
898 901 " and %d new revisions\n")
899 902 % (files, changesets, revisions))
900 903
901 904 tr.close()
902 905 return
903 906
904 907 def update(self, node, allow=False, force=False):
905 908 pl = self.dirstate.parents()
906 909 if not force and pl[1] != nullid:
907 910 self.ui.warn("aborting: outstanding uncommitted merges\n")
908 911 return
909 912
910 913 p1, p2 = pl[0], node
911 914 pa = self.changelog.ancestor(p1, p2)
912 915 m1n = self.changelog.read(p1)[0]
913 916 m2n = self.changelog.read(p2)[0]
914 917 man = self.manifest.ancestor(m1n, m2n)
915 918 m1 = self.manifest.read(m1n)
916 919 mf1 = self.manifest.readflags(m1n)
917 920 m2 = self.manifest.read(m2n)
918 921 mf2 = self.manifest.readflags(m2n)
919 922 ma = self.manifest.read(man)
920 923 mfa = self.manifest.readflags(m2n)
921 924
922 925 (c, a, d, u) = self.diffdir(self.root)
923 926
924 927 # resolve the manifest to determine which files
925 928 # we care about merging
926 929 self.ui.note("resolving manifests\n")
927 930 self.ui.debug(" ancestor %s local %s remote %s\n" %
928 931 (short(man), short(m1n), short(m2n)))
929 932
930 933 merge = {}
931 934 get = {}
932 935 remove = []
933 936 mark = {}
934 937
935 938 # construct a working dir manifest
936 939 mw = m1.copy()
937 940 mfw = mf1.copy()
938 941 for f in a + c + u:
939 942 mw[f] = ""
940 943 mfw[f] = is_exec(self.wjoin(f))
941 944 for f in d:
942 945 if f in mw: del mw[f]
943 946
944 947 for f, n in mw.iteritems():
945 948 if f in m2:
946 949 s = 0
947 950
948 951 # are files different?
949 952 if n != m2[f]:
950 953 a = ma.get(f, nullid)
951 954 # are both different from the ancestor?
952 955 if n != a and m2[f] != a:
953 956 self.ui.debug(" %s versions differ, resolve\n" % f)
954 957 merge[f] = (m1.get(f, nullid), m2[f])
955 958 # merge executable bits
956 959 # "if we changed or they changed, change in merge"
957 960 a, b, c = mfa.get(f, 0), mfw[f], mf2[f]
958 961 mode = ((a^b) | (a^c)) ^ a
959 962 merge[f] = (m1.get(f, nullid), m2[f], mode)
960 963 s = 1
961 964 # are we clobbering?
962 965 # is remote's version newer?
963 966 # or are we going back in time?
964 967 elif force or m2[f] != a or (p2 == pa and mw[f] == m1[f]):
965 968 self.ui.debug(" remote %s is newer, get\n" % f)
966 969 get[f] = m2[f]
967 970 s = 1
968 971 else:
969 972 mark[f] = 1
970 973
971 974 if not s and mfw[f] != mf2[f]:
972 975 if force:
973 976 self.ui.debug(" updating permissions for %s\n" % f)
974 977 set_exec(self.wjoin(f), mf2[f])
975 978 else:
976 979 a, b, c = mfa.get(f, 0), mfw[f], mf2[f]
977 980 mode = ((a^b) | (a^c)) ^ a
978 981 if mode != b:
979 982 self.ui.debug(" updating permissions for %s\n" % f)
980 983 set_exec(self.wjoin(f), mode)
981 984 mark[f] = 1
982 985 del m2[f]
983 986 elif f in ma:
984 987 if not force and n != ma[f]:
985 988 r = self.ui.prompt(
986 989 (" local changed %s which remote deleted\n" % f) +
987 990 "(k)eep or (d)elete?", "[kd]", "k")
988 991 if r == "d":
989 992 remove.append(f)
990 993 else:
991 994 self.ui.debug("other deleted %s\n" % f)
992 995 remove.append(f) # other deleted it
993 996 else:
994 997 if n == m1.get(f, nullid): # same as parent
995 998 self.ui.debug("remote deleted %s\n" % f)
996 999 remove.append(f)
997 1000 else:
998 1001 self.ui.debug("working dir created %s, keeping\n" % f)
999 1002
1000 1003 for f, n in m2.iteritems():
1001 1004 if f[0] == "/": continue
1002 1005 if not force and f in ma and n != ma[f]:
1003 1006 r = self.ui.prompt(
1004 1007 ("remote changed %s which local deleted\n" % f) +
1005 1008 "(k)eep or (d)elete?", "[kd]", "k")
1006 1009 if r == "d": remove.append(f)
1007 1010 else:
1008 1011 self.ui.debug("remote created %s\n" % f)
1009 1012 get[f] = n
1010 1013
1011 1014 del mw, m1, m2, ma
1012 1015
1013 1016 if force:
1014 1017 for f in merge:
1015 1018 get[f] = merge[f][1]
1016 1019 merge = {}
1017 1020
1018 1021 if pa == p1 or pa == p2:
1019 1022 # we don't need to do any magic, just jump to the new rev
1020 1023 mode = 'n'
1021 1024 p1, p2 = p2, nullid
1022 1025 else:
1023 1026 if not allow:
1024 1027 self.ui.status("this update spans a branch" +
1025 1028 " affecting the following files:\n")
1026 1029 fl = merge.keys() + get.keys()
1027 1030 fl.sort()
1028 1031 for f in fl:
1029 1032 cf = ""
1030 1033 if f in merge: cf = " (resolve)"
1031 1034 self.ui.status(" %s%s\n" % (f, cf))
1032 1035 self.ui.warn("aborting update spanning branches!\n")
1033 1036 self.ui.status("(use update -m to perform a branch merge)\n")
1034 1037 return 1
1035 1038 # we have to remember what files we needed to get/change
1036 1039 # because any file that's different from either one of its
1037 1040 # parents must be in the changeset
1038 1041 mode = 'm'
1039 1042 self.dirstate.update(mark.keys(), "m")
1040 1043
1041 1044 self.dirstate.setparents(p1, p2)
1042 1045
1043 1046 # get the files we don't need to change
1044 1047 files = get.keys()
1045 1048 files.sort()
1046 1049 for f in files:
1047 1050 if f[0] == "/": continue
1048 1051 self.ui.note("getting %s\n" % f)
1049 1052 t = self.file(f).read(get[f])
1050 1053 try:
1051 1054 self.wfile(f, "w").write(t)
1052 1055 except IOError:
1053 1056 os.makedirs(os.path.dirname(self.wjoin(f)))
1054 1057 self.wfile(f, "w").write(t)
1055 1058 set_exec(self.wjoin(f), mf2[f])
1056 1059 self.dirstate.update([f], mode)
1057 1060
1058 1061 # merge the tricky bits
1059 1062 files = merge.keys()
1060 1063 files.sort()
1061 1064 for f in files:
1062 1065 self.ui.status("merging %s\n" % f)
1063 1066 m, o, flag = merge[f]
1064 1067 self.merge3(f, m, o)
1065 1068 set_exec(self.wjoin(f), flag)
1066 1069 self.dirstate.update([f], 'm')
1067 1070
1068 1071 for f in remove:
1069 1072 self.ui.note("removing %s\n" % f)
1070 1073 os.unlink(f)
1071 1074 if mode == 'n':
1072 1075 self.dirstate.forget(remove)
1073 1076 else:
1074 1077 self.dirstate.update(remove, 'r')
1075 1078
1076 1079 def merge3(self, fn, my, other):
1077 1080 """perform a 3-way merge in the working directory"""
1078 1081
1079 1082 def temp(prefix, node):
1080 1083 pre = "%s~%s." % (os.path.basename(fn), prefix)
1081 1084 (fd, name) = tempfile.mkstemp("", pre)
1082 1085 f = os.fdopen(fd, "w")
1083 1086 f.write(fl.revision(node))
1084 1087 f.close()
1085 1088 return name
1086 1089
1087 1090 fl = self.file(fn)
1088 1091 base = fl.ancestor(my, other)
1089 1092 a = self.wjoin(fn)
1090 1093 b = temp("other", other)
1091 1094 c = temp("base", base)
1092 1095
1093 1096 self.ui.note("resolving %s\n" % fn)
1094 1097 self.ui.debug("file %s: other %s ancestor %s\n" %
1095 1098 (fn, short(other), short(base)))
1096 1099
1097 1100 cmd = os.environ.get("HGMERGE", "hgmerge")
1098 1101 r = os.system("%s %s %s %s" % (cmd, a, b, c))
1099 1102 if r:
1100 1103 self.ui.warn("merging %s failed!\n" % fn)
1101 1104
1102 1105 os.unlink(b)
1103 1106 os.unlink(c)
1104 1107
1105 1108 def verify(self):
1106 1109 filelinkrevs = {}
1107 1110 filenodes = {}
1108 1111 changesets = revisions = files = 0
1109 1112 errors = 0
1110 1113
1111 1114 seen = {}
1112 1115 self.ui.status("checking changesets\n")
1113 1116 for i in range(self.changelog.count()):
1114 1117 changesets += 1
1115 1118 n = self.changelog.node(i)
1116 1119 if n in seen:
1117 1120 self.ui.warn("duplicate changeset at revision %d\n" % i)
1118 1121 errors += 1
1119 1122 seen[n] = 1
1120 1123
1121 1124 for p in self.changelog.parents(n):
1122 1125 if p not in self.changelog.nodemap:
1123 1126 self.ui.warn("changeset %s has unknown parent %s\n" %
1124 1127 (short(n), short(p)))
1125 1128 errors += 1
1126 1129 try:
1127 1130 changes = self.changelog.read(n)
1128 1131 except Exception, inst:
1129 1132 self.ui.warn("unpacking changeset %s: %s\n" % (short(n), inst))
1130 1133 errors += 1
1131 1134
1132 1135 for f in changes[3]:
1133 1136 filelinkrevs.setdefault(f, []).append(i)
1134 1137
1135 1138 seen = {}
1136 1139 self.ui.status("checking manifests\n")
1137 1140 for i in range(self.manifest.count()):
1138 1141 n = self.manifest.node(i)
1139 1142 if n in seen:
1140 1143 self.ui.warn("duplicate manifest at revision %d\n" % i)
1141 1144 errors += 1
1142 1145 seen[n] = 1
1143 1146
1144 1147 for p in self.manifest.parents(n):
1145 1148 if p not in self.manifest.nodemap:
1146 1149 self.ui.warn("manifest %s has unknown parent %s\n" %
1147 1150 (short(n), short(p)))
1148 1151 errors += 1
1149 1152
1150 1153 try:
1151 1154 delta = mdiff.patchtext(self.manifest.delta(n))
1152 1155 except KeyboardInterrupt:
1153 1156 print "aborted"
1154 1157 sys.exit(0)
1155 1158 except Exception, inst:
1156 1159 self.ui.warn("unpacking manifest %s: %s\n"
1157 1160 % (short(n), inst))
1158 1161 errors += 1
1159 1162
1160 1163 ff = [ l.split('\0') for l in delta.splitlines() ]
1161 1164 for f, fn in ff:
1162 1165 filenodes.setdefault(f, {})[bin(fn[:40])] = 1
1163 1166
1164 1167 self.ui.status("crosschecking files in changesets and manifests\n")
1165 1168 for f in filenodes:
1166 1169 if f not in filelinkrevs:
1167 1170 self.ui.warn("file %s in manifest but not in changesets\n" % f)
1168 1171 errors += 1
1169 1172
1170 1173 for f in filelinkrevs:
1171 1174 if f not in filenodes:
1172 1175 self.ui.warn("file %s in changeset but not in manifest\n" % f)
1173 1176 errors += 1
1174 1177
1175 1178 self.ui.status("checking files\n")
1176 1179 ff = filenodes.keys()
1177 1180 ff.sort()
1178 1181 for f in ff:
1179 1182 if f == "/dev/null": continue
1180 1183 files += 1
1181 1184 fl = self.file(f)
1182 1185 nodes = { nullid: 1 }
1183 1186 seen = {}
1184 1187 for i in range(fl.count()):
1185 1188 revisions += 1
1186 1189 n = fl.node(i)
1187 1190
1188 1191 if n in seen:
1189 1192 self.ui.warn("%s: duplicate revision %d\n" % (f, i))
1190 1193 errors += 1
1191 1194
1192 1195 if n not in filenodes[f]:
1193 1196 self.ui.warn("%s: %d:%s not in manifests\n"
1194 1197 % (f, i, short(n)))
1195 1198 print len(filenodes[f].keys()), fl.count(), f
1196 1199 errors += 1
1197 1200 else:
1198 1201 del filenodes[f][n]
1199 1202
1200 1203 flr = fl.linkrev(n)
1201 1204 if flr not in filelinkrevs[f]:
1202 1205 self.ui.warn("%s:%s points to unexpected changeset %d\n"
1203 1206 % (f, short(n), fl.linkrev(n)))
1204 1207 errors += 1
1205 1208 else:
1206 1209 filelinkrevs[f].remove(flr)
1207 1210
1208 1211 # verify contents
1209 1212 try:
1210 1213 t = fl.read(n)
1211 1214 except Exception, inst:
1212 1215 self.ui.warn("unpacking file %s %s: %s\n"
1213 1216 % (f, short(n), inst))
1214 1217 errors += 1
1215 1218
1216 1219 # verify parents
1217 1220 (p1, p2) = fl.parents(n)
1218 1221 if p1 not in nodes:
1219 1222 self.ui.warn("file %s:%s unknown parent 1 %s" %
1220 1223 (f, short(n), short(p1)))
1221 1224 errors += 1
1222 1225 if p2 not in nodes:
1223 1226 self.ui.warn("file %s:%s unknown parent 2 %s" %
1224 1227 (f, short(n), short(p1)))
1225 1228 errors += 1
1226 1229 nodes[n] = 1
1227 1230
1228 1231 # cross-check
1229 1232 for node in filenodes[f]:
1230 1233 self.ui.warn("node %s in manifests not in %s\n"
1231 1234 % (hex(n), f))
1232 1235 errors += 1
1233 1236
1234 1237 self.ui.status("%d files, %d changesets, %d total revisions\n" %
1235 1238 (files, changesets, revisions))
1236 1239
1237 1240 if errors:
1238 1241 self.ui.warn("%d integrity errors encountered!\n" % errors)
1239 1242 return 1
1240 1243
1241 1244 class remoterepository:
1242 1245 def __init__(self, ui, path):
1243 1246 self.url = path
1244 1247 self.ui = ui
1245 1248 no_list = [ "localhost", "127.0.0.1" ]
1246 1249 host = ui.config("http_proxy", "host")
1247 1250 user = ui.config("http_proxy", "user")
1248 1251 passwd = ui.config("http_proxy", "passwd")
1249 1252 no = ui.config("http_proxy", "no")
1250 1253 if no:
1251 1254 no_list = no_list + no.split(",")
1252 1255
1253 1256 no_proxy = 0
1254 1257 for h in no_list:
1255 1258 if (path.startswith("http://" + h + "/") or
1256 1259 path.startswith("http://" + h + ":") or
1257 1260 path == "http://" + h):
1258 1261 no_proxy = 1
1259 1262
1260 1263 # Note: urllib2 takes proxy values from the environment and those will
1261 1264 # take precedence
1262 1265
1263 1266 proxy_handler = urllib2.BaseHandler()
1264 1267 if host and not no_proxy:
1265 1268 proxy_handler = urllib2.ProxyHandler({"http" : "http://" + host})
1266 1269
1267 1270 authinfo = None
1268 1271 if user and passwd:
1269 1272 passmgr = urllib2.HTTPPasswordMgrWithDefaultRealm()
1270 1273 passmgr.add_password(None, host, user, passwd)
1271 1274 authinfo = urllib2.ProxyBasicAuthHandler(passmgr)
1272 1275
1273 1276 opener = urllib2.build_opener(proxy_handler, authinfo)
1274 1277 urllib2.install_opener(opener)
1275 1278
1276 1279 def do_cmd(self, cmd, **args):
1277 1280 self.ui.debug("sending %s command\n" % cmd)
1278 1281 q = {"cmd": cmd}
1279 1282 q.update(args)
1280 1283 qs = urllib.urlencode(q)
1281 1284 cu = "%s?%s" % (self.url, qs)
1282 1285 return urllib2.urlopen(cu)
1283 1286
1284 1287 def heads(self):
1285 1288 d = self.do_cmd("heads").read()
1286 1289 try:
1287 1290 return map(bin, d[:-1].split(" "))
1288 1291 except:
1289 1292 self.ui.warn("unexpected response:\n" + d[:400] + "\n...\n")
1290 1293 raise
1291 1294
1292 1295 def branches(self, nodes):
1293 1296 n = " ".join(map(hex, nodes))
1294 1297 d = self.do_cmd("branches", nodes=n).read()
1295 1298 try:
1296 1299 br = [ tuple(map(bin, b.split(" "))) for b in d.splitlines() ]
1297 1300 return br
1298 1301 except:
1299 1302 self.ui.warn("unexpected response:\n" + d[:400] + "\n...\n")
1300 1303 raise
1301 1304
1302 1305 def between(self, pairs):
1303 1306 n = "\n".join(["-".join(map(hex, p)) for p in pairs])
1304 1307 d = self.do_cmd("between", pairs=n).read()
1305 1308 try:
1306 1309 p = [ l and map(bin, l.split(" ")) or [] for l in d.splitlines() ]
1307 1310 return p
1308 1311 except:
1309 1312 self.ui.warn("unexpected response:\n" + d[:400] + "\n...\n")
1310 1313 raise
1311 1314
1312 1315 def changegroup(self, nodes):
1313 1316 n = " ".join(map(hex, nodes))
1314 1317 zd = zlib.decompressobj()
1315 1318 f = self.do_cmd("changegroup", roots=n)
1316 1319 bytes = 0
1317 1320 while 1:
1318 1321 d = f.read(4096)
1319 1322 bytes += len(d)
1320 1323 if not d:
1321 1324 yield zd.flush()
1322 1325 break
1323 1326 yield zd.decompress(d)
1324 1327 self.ui.note("%d bytes of data transfered\n" % bytes)
1325 1328
1326 1329 def repository(ui, path=None, create=0):
1327 1330 if path and path[:7] == "http://":
1328 1331 return remoterepository(ui, path)
1329 1332 if path and path[:5] == "hg://":
1330 1333 return remoterepository(ui, path.replace("hg://", "http://"))
1331 1334 if path and path[:11] == "old-http://":
1332 1335 return localrepository(ui, path.replace("old-http://", "http://"))
1333 1336 else:
1334 1337 return localrepository(ui, path, create)
1335 1338
1336 1339 class httprangereader:
1337 1340 def __init__(self, url):
1338 1341 self.url = url
1339 1342 self.pos = 0
1340 1343 def seek(self, pos):
1341 1344 self.pos = pos
1342 1345 def read(self, bytes=None):
1343 1346 opener = urllib2.build_opener(byterange.HTTPRangeHandler())
1344 1347 urllib2.install_opener(opener)
1345 1348 req = urllib2.Request(self.url)
1346 1349 end = ''
1347 1350 if bytes: end = self.pos + bytes
1348 1351 req.add_header('Range', 'bytes=%d-%s' % (self.pos, end))
1349 1352 f = urllib2.urlopen(req)
1350 1353 return f.read()
General Comments 0
You need to be logged in to leave comments. Login now