1
# Copyright (C) 2005, 2006, 2007 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
from bzrlib.lazy_import import lazy_import
18
lazy_import(globals(), """
19
from itertools import izip
30
from bzrlib.index import (
35
GraphIndexPrefixAdapter,
37
from bzrlib.knit import KnitGraphIndex, _PackAccess, _KnitData
38
from bzrlib.osutils import rand_chars
39
from bzrlib.pack import ContainerWriter
40
from bzrlib.store import revision
41
from bzrlib import tsort
58
from bzrlib.decorators import needs_read_lock, needs_write_lock
59
from bzrlib.repofmt.knitrepo import KnitRepository
60
from bzrlib.repository import (
63
MetaDirRepositoryFormat,
66
import bzrlib.revision as _mod_revision
67
from bzrlib.store.revision.knit import KnitRevisionStore
68
from bzrlib.store.versioned import VersionedFileStore
69
from bzrlib.trace import mutter, note, warning
72
class PackCommitBuilder(CommitBuilder):
73
"""A subclass of CommitBuilder to add texts with pack semantics.
75
Specifically this uses one knit object rather than one knit object per
76
added text, reducing memory and object pressure.
79
def __init__(self, repository, parents, config, timestamp=None,
80
timezone=None, committer=None, revprops=None,
82
CommitBuilder.__init__(self, repository, parents, config,
83
timestamp=timestamp, timezone=timezone, committer=committer,
84
revprops=revprops, revision_id=revision_id)
85
self._file_graph = graph.Graph(
86
repository._pack_collection.text_index.combined_index)
88
def _add_text_to_weave(self, file_id, new_lines, parents, nostore_sha):
89
return self.repository._pack_collection._add_text_to_weave(file_id,
90
self._new_revision_id, new_lines, parents, nostore_sha,
93
def _heads(self, file_id, revision_ids):
94
keys = [(file_id, revision_id) for revision_id in revision_ids]
95
return set([key[1] for key in self._file_graph.heads(keys)])
98
class PackRootCommitBuilder(RootCommitBuilder):
99
"""A subclass of RootCommitBuilder to add texts with pack semantics.
101
Specifically this uses one knit object rather than one knit object per
102
added text, reducing memory and object pressure.
105
def __init__(self, repository, parents, config, timestamp=None,
106
timezone=None, committer=None, revprops=None,
108
CommitBuilder.__init__(self, repository, parents, config,
109
timestamp=timestamp, timezone=timezone, committer=committer,
110
revprops=revprops, revision_id=revision_id)
111
self._file_graph = graph.Graph(
112
repository._pack_collection.text_index.combined_index)
114
def _add_text_to_weave(self, file_id, new_lines, parents, nostore_sha):
115
return self.repository._pack_collection._add_text_to_weave(file_id,
116
self._new_revision_id, new_lines, parents, nostore_sha,
119
def _heads(self, file_id, revision_ids):
120
keys = [(file_id, revision_id) for revision_id in revision_ids]
121
return set([key[1] for key in self._file_graph.heads(keys)])
125
"""An in memory proxy for a pack and its indices.
127
This is a base class that is not directly used, instead the classes
128
ExistingPack and NewPack are used.
131
def __init__(self, revision_index, inventory_index, text_index,
133
"""Create a pack instance.
135
:param revision_index: A GraphIndex for determining what revisions are
136
present in the Pack and accessing the locations of their texts.
137
:param inventory_index: A GraphIndex for determining what inventories are
138
present in the Pack and accessing the locations of their
140
:param text_index: A GraphIndex for determining what file texts
141
are present in the pack and accessing the locations of their
142
texts/deltas (via (fileid, revisionid) tuples).
143
:param revision_index: A GraphIndex for determining what signatures are
144
present in the Pack and accessing the locations of their texts.
146
self.revision_index = revision_index
147
self.inventory_index = inventory_index
148
self.text_index = text_index
149
self.signature_index = signature_index
151
def access_tuple(self):
152
"""Return a tuple (transport, name) for the pack content."""
153
return self.pack_transport, self.file_name()
156
"""Get the file name for the pack on disk."""
157
return self.name + '.pack'
159
def get_revision_count(self):
160
return self.revision_index.key_count()
162
def inventory_index_name(self, name):
163
"""The inv index is the name + .iix."""
164
return self.index_name('inventory', name)
166
def revision_index_name(self, name):
167
"""The revision index is the name + .rix."""
168
return self.index_name('revision', name)
170
def signature_index_name(self, name):
171
"""The signature index is the name + .six."""
172
return self.index_name('signature', name)
174
def text_index_name(self, name):
175
"""The text index is the name + .tix."""
176
return self.index_name('text', name)
178
def _external_compression_parents_of_texts(self):
181
for node in self.text_index.iter_all_entries():
183
refs.update(node[3][1])
187
class ExistingPack(Pack):
188
"""An in memory proxy for an existing .pack and its disk indices."""
190
def __init__(self, pack_transport, name, revision_index, inventory_index,
191
text_index, signature_index):
192
"""Create an ExistingPack object.
194
:param pack_transport: The transport where the pack file resides.
195
:param name: The name of the pack on disk in the pack_transport.
197
Pack.__init__(self, revision_index, inventory_index, text_index,
200
self.pack_transport = pack_transport
201
assert None not in (revision_index, inventory_index, text_index,
202
signature_index, name, pack_transport)
204
def __eq__(self, other):
205
return self.__dict__ == other.__dict__
207
def __ne__(self, other):
208
return not self.__eq__(other)
211
return "<bzrlib.repofmt.pack_repo.Pack object at 0x%x, %s, %s" % (
212
id(self), self.transport, self.name)
216
"""An in memory proxy for a pack which is being created."""
218
# A map of index 'type' to the file extension and position in the
220
index_definitions = {
221
'revision': ('.rix', 0),
222
'inventory': ('.iix', 1),
224
'signature': ('.six', 3),
227
def __init__(self, upload_transport, index_transport, pack_transport,
228
upload_suffix='', file_mode=None):
229
"""Create a NewPack instance.
231
:param upload_transport: A writable transport for the pack to be
232
incrementally uploaded to.
233
:param index_transport: A writable transport for the pack's indices to
234
be written to when the pack is finished.
235
:param pack_transport: A writable transport for the pack to be renamed
236
to when the upload is complete. This *must* be the same as
237
upload_transport.clone('../packs').
238
:param upload_suffix: An optional suffix to be given to any temporary
239
files created during the pack creation. e.g '.autopack'
240
:param file_mode: An optional file mode to create the new files with.
242
# The relative locations of the packs are constrained, but all are
243
# passed in because the caller has them, so as to avoid object churn.
245
# Revisions: parents list, no text compression.
246
InMemoryGraphIndex(reference_lists=1),
247
# Inventory: We want to map compression only, but currently the
248
# knit code hasn't been updated enough to understand that, so we
249
# have a regular 2-list index giving parents and compression
251
InMemoryGraphIndex(reference_lists=2),
252
# Texts: compression and per file graph, for all fileids - so two
253
# reference lists and two elements in the key tuple.
254
InMemoryGraphIndex(reference_lists=2, key_elements=2),
255
# Signatures: Just blobs to store, no compression, no parents
257
InMemoryGraphIndex(reference_lists=0),
259
# where should the new pack be opened
260
self.upload_transport = upload_transport
261
# where are indices written out to
262
self.index_transport = index_transport
263
# where is the pack renamed to when it is finished?
264
self.pack_transport = pack_transport
265
# What file mode to upload the pack and indices with.
266
self._file_mode = file_mode
267
# tracks the content written to the .pack file.
268
self._hash = md5.new()
269
# a four-tuple with the length in bytes of the indices, once the pack
270
# is finalised. (rev, inv, text, sigs)
271
self.index_sizes = None
272
# How much data to cache when writing packs. Note that this is not
273
# synchronised with reads, because it's not in the transport layer, so
274
# is not safe unless the client knows it won't be reading from the pack
276
self._cache_limit = 0
277
# the temporary pack file name.
278
self.random_name = rand_chars(20) + upload_suffix
279
# when was this pack started ?
280
self.start_time = time.time()
281
# open an output stream for the data added to the pack.
282
self.write_stream = self.upload_transport.open_write_stream(
283
self.random_name, mode=self._file_mode)
284
if 'pack' in debug.debug_flags:
285
mutter('%s: create_pack: pack stream open: %s%s t+%6.3fs',
286
time.ctime(), self.upload_transport.base, self.random_name,
287
time.time() - self.start_time)
288
# A list of byte sequences to be written to the new pack, and the
289
# aggregate size of them. Stored as a list rather than separate
290
# variables so that the _write_data closure below can update them.
291
self._buffer = [[], 0]
292
# create a callable for adding data
294
# robertc says- this is a closure rather than a method on the object
295
# so that the variables are locals, and faster than accessing object
297
def _write_data(bytes, flush=False, _buffer=self._buffer,
298
_write=self.write_stream.write, _update=self._hash.update):
299
_buffer[0].append(bytes)
300
_buffer[1] += len(bytes)
302
if _buffer[1] > self._cache_limit or flush:
303
bytes = ''.join(_buffer[0])
307
# expose this on self, for the occasion when clients want to add data.
308
self._write_data = _write_data
309
# a pack writer object to serialise pack records.
310
self._writer = pack.ContainerWriter(self._write_data)
312
# what state is the pack in? (open, finished, aborted)
316
"""Cancel creating this pack."""
317
self._state = 'aborted'
318
self.write_stream.close()
319
# Remove the temporary pack file.
320
self.upload_transport.delete(self.random_name)
321
# The indices have no state on disk.
323
def access_tuple(self):
324
"""Return a tuple (transport, name) for the pack content."""
325
assert self._state in ('open', 'finished')
326
if self._state == 'finished':
327
return Pack.access_tuple(self)
329
return self.upload_transport, self.random_name
331
def data_inserted(self):
332
"""True if data has been added to this pack."""
333
return bool(self.get_revision_count() or
334
self.inventory_index.key_count() or
335
self.text_index.key_count() or
336
self.signature_index.key_count())
339
"""Finish the new pack.
342
- finalises the content
343
- assigns a name (the md5 of the content, currently)
344
- writes out the associated indices
345
- renames the pack into place.
346
- stores the index size tuple for the pack in the index_sizes
351
self._write_data('', flush=True)
352
self.name = self._hash.hexdigest()
354
# XXX: It'd be better to write them all to temporary names, then
355
# rename them all into place, so that the window when only some are
356
# visible is smaller. On the other hand none will be seen until
357
# they're in the names list.
358
self.index_sizes = [None, None, None, None]
359
self._write_index('revision', self.revision_index, 'revision')
360
self._write_index('inventory', self.inventory_index, 'inventory')
361
self._write_index('text', self.text_index, 'file texts')
362
self._write_index('signature', self.signature_index,
363
'revision signatures')
364
self.write_stream.close()
365
# Note that this will clobber an existing pack with the same name,
366
# without checking for hash collisions. While this is undesirable this
367
# is something that can be rectified in a subsequent release. One way
368
# to rectify it may be to leave the pack at the original name, writing
369
# its pack-names entry as something like 'HASH: index-sizes
370
# temporary-name'. Allocate that and check for collisions, if it is
371
# collision free then rename it into place. If clients know this scheme
372
# they can handle missing-file errors by:
373
# - try for HASH.pack
374
# - try for temporary-name
375
# - refresh the pack-list to see if the pack is now absent
376
self.upload_transport.rename(self.random_name,
377
'../packs/' + self.name + '.pack')
378
self._state = 'finished'
379
if 'pack' in debug.debug_flags:
380
# XXX: size might be interesting?
381
mutter('%s: create_pack: pack renamed into place: %s%s->%s%s t+%6.3fs',
382
time.ctime(), self.upload_transport.base, self.random_name,
383
self.pack_transport, self.name,
384
time.time() - self.start_time)
387
"""Flush any current data."""
389
bytes = ''.join(self._buffer[0])
390
self.write_stream.write(bytes)
391
self._hash.update(bytes)
392
self._buffer[:] = [[], 0]
394
def index_name(self, index_type, name):
395
"""Get the disk name of an index type for pack name 'name'."""
396
return name + NewPack.index_definitions[index_type][0]
398
def index_offset(self, index_type):
399
"""Get the position in a index_size array for a given index type."""
400
return NewPack.index_definitions[index_type][1]
402
def _replace_index_with_readonly(self, index_type):
403
setattr(self, index_type + '_index',
404
GraphIndex(self.index_transport,
405
self.index_name(index_type, self.name),
406
self.index_sizes[self.index_offset(index_type)]))
408
def set_write_cache_size(self, size):
409
self._cache_limit = size
411
def _write_index(self, index_type, index, label):
412
"""Write out an index.
414
:param index_type: The type of index to write - e.g. 'revision'.
415
:param index: The index object to serialise.
416
:param label: What label to give the index e.g. 'revision'.
418
index_name = self.index_name(index_type, self.name)
419
self.index_sizes[self.index_offset(index_type)] = \
420
self.index_transport.put_file(index_name, index.finish(),
421
mode=self._file_mode)
422
if 'pack' in debug.debug_flags:
423
# XXX: size might be interesting?
424
mutter('%s: create_pack: wrote %s index: %s%s t+%6.3fs',
425
time.ctime(), label, self.upload_transport.base,
426
self.random_name, time.time() - self.start_time)
427
# Replace the writable index on this object with a readonly,
428
# presently unloaded index. We should alter
429
# the index layer to make its finish() error if add_node is
430
# subsequently used. RBC
431
self._replace_index_with_readonly(index_type)
434
class AggregateIndex(object):
435
"""An aggregated index for the RepositoryPackCollection.
437
AggregateIndex is reponsible for managing the PackAccess object,
438
Index-To-Pack mapping, and all indices list for a specific type of index
439
such as 'revision index'.
441
A CombinedIndex provides an index on a single key space built up
442
from several on-disk indices. The AggregateIndex builds on this
443
to provide a knit access layer, and allows having up to one writable
444
index within the collection.
446
# XXX: Probably 'can be written to' could/should be separated from 'acts
447
# like a knit index' -- mbp 20071024
450
"""Create an AggregateIndex."""
451
self.index_to_pack = {}
452
self.combined_index = CombinedGraphIndex([])
453
self.knit_access = _PackAccess(self.index_to_pack)
455
def replace_indices(self, index_to_pack, indices):
456
"""Replace the current mappings with fresh ones.
458
This should probably not be used eventually, rather incremental add and
459
removal of indices. It has been added during refactoring of existing
462
:param index_to_pack: A mapping from index objects to
463
(transport, name) tuples for the pack file data.
464
:param indices: A list of indices.
466
# refresh the revision pack map dict without replacing the instance.
467
self.index_to_pack.clear()
468
self.index_to_pack.update(index_to_pack)
469
# XXX: API break - clearly a 'replace' method would be good?
470
self.combined_index._indices[:] = indices
471
# the current add nodes callback for the current writable index if
473
self.add_callback = None
475
def add_index(self, index, pack):
476
"""Add index to the aggregate, which is an index for Pack pack.
478
Future searches on the aggregate index will seach this new index
479
before all previously inserted indices.
481
:param index: An Index for the pack.
482
:param pack: A Pack instance.
484
# expose it to the index map
485
self.index_to_pack[index] = pack.access_tuple()
486
# put it at the front of the linear index list
487
self.combined_index.insert_index(0, index)
489
def add_writable_index(self, index, pack):
490
"""Add an index which is able to have data added to it.
492
There can be at most one writable index at any time. Any
493
modifications made to the knit are put into this index.
495
:param index: An index from the pack parameter.
496
:param pack: A Pack instance.
498
assert self.add_callback is None, \
499
"%s already has a writable index through %s" % \
500
(self, self.add_callback)
501
# allow writing: queue writes to a new index
502
self.add_index(index, pack)
503
# Updates the index to packs mapping as a side effect,
504
self.knit_access.set_writer(pack._writer, index, pack.access_tuple())
505
self.add_callback = index.add_nodes
508
"""Reset all the aggregate data to nothing."""
509
self.knit_access.set_writer(None, None, (None, None))
510
self.index_to_pack.clear()
511
del self.combined_index._indices[:]
512
self.add_callback = None
514
def remove_index(self, index, pack):
515
"""Remove index from the indices used to answer queries.
517
:param index: An index from the pack parameter.
518
:param pack: A Pack instance.
520
del self.index_to_pack[index]
521
self.combined_index._indices.remove(index)
522
if (self.add_callback is not None and
523
getattr(index, 'add_nodes', None) == self.add_callback):
524
self.add_callback = None
525
self.knit_access.set_writer(None, None, (None, None))
528
class Packer(object):
529
"""Create a pack from packs."""
531
def __init__(self, pack_collection, packs, suffix, revision_ids=None):
534
:param pack_collection: A RepositoryPackCollection object where the
535
new pack is being written to.
536
:param packs: The packs to combine.
537
:param suffix: The suffix to use on the temporary files for the pack.
538
:param revision_ids: Revision ids to limit the pack to.
542
self.revision_ids = revision_ids
543
# The pack object we are creating.
545
self._pack_collection = pack_collection
546
# The index layer keys for the revisions being copied. None for 'all
548
self._revision_keys = None
549
# What text keys to copy. None for 'all texts'. This is set by
550
# _copy_inventory_texts
551
self._text_filter = None
554
def _extra_init(self):
555
"""A template hook to allow extending the constructor trivially."""
557
def pack(self, pb=None):
558
"""Create a new pack by reading data from other packs.
560
This does little more than a bulk copy of data. One key difference
561
is that data with the same item key across multiple packs is elided
562
from the output. The new pack is written into the current pack store
563
along with its indices, and the name added to the pack names. The
564
source packs are not altered and are not required to be in the current
567
:param pb: An optional progress bar to use. A nested bar is created if
569
:return: A Pack object, or None if nothing was copied.
571
# open a pack - using the same name as the last temporary file
572
# - which has already been flushed, so its safe.
573
# XXX: - duplicate code warning with start_write_group; fix before
574
# considering 'done'.
575
if self._pack_collection._new_pack is not None:
576
raise errors.BzrError('call to create_pack_from_packs while '
577
'another pack is being written.')
578
if self.revision_ids is not None:
579
if len(self.revision_ids) == 0:
580
# silly fetch request.
583
self.revision_ids = frozenset(self.revision_ids)
585
self.pb = ui.ui_factory.nested_progress_bar()
589
return self._create_pack_from_packs()
595
"""Open a pack for the pack we are creating."""
596
return NewPack(self._pack_collection._upload_transport,
597
self._pack_collection._index_transport,
598
self._pack_collection._pack_transport, upload_suffix=self.suffix,
599
file_mode=self._pack_collection.repo.control_files._file_mode)
601
def _copy_revision_texts(self):
602
"""Copy revision data to the new pack."""
604
if self.revision_ids:
605
revision_keys = [(revision_id,) for revision_id in self.revision_ids]
608
# select revision keys
609
revision_index_map = self._pack_collection._packs_list_to_pack_map_and_index_list(
610
self.packs, 'revision_index')[0]
611
revision_nodes = self._pack_collection._index_contents(revision_index_map, revision_keys)
612
# copy revision keys and adjust values
613
self.pb.update("Copying revision texts", 1)
614
total_items, readv_group_iter = self._revision_node_readv(revision_nodes)
615
list(self._copy_nodes_graph(revision_index_map, self.new_pack._writer,
616
self.new_pack.revision_index, readv_group_iter, total_items))
617
if 'pack' in debug.debug_flags:
618
mutter('%s: create_pack: revisions copied: %s%s %d items t+%6.3fs',
619
time.ctime(), self._pack_collection._upload_transport.base,
620
self.new_pack.random_name,
621
self.new_pack.revision_index.key_count(),
622
time.time() - self.new_pack.start_time)
623
self._revision_keys = revision_keys
625
def _copy_inventory_texts(self):
626
"""Copy the inventory texts to the new pack.
628
self._revision_keys is used to determine what inventories to copy.
630
Sets self._text_filter appropriately.
632
# select inventory keys
633
inv_keys = self._revision_keys # currently the same keyspace, and note that
634
# querying for keys here could introduce a bug where an inventory item
635
# is missed, so do not change it to query separately without cross
636
# checking like the text key check below.
637
inventory_index_map = self._pack_collection._packs_list_to_pack_map_and_index_list(
638
self.packs, 'inventory_index')[0]
639
inv_nodes = self._pack_collection._index_contents(inventory_index_map, inv_keys)
640
# copy inventory keys and adjust values
641
# XXX: Should be a helper function to allow different inv representation
643
self.pb.update("Copying inventory texts", 2)
644
total_items, readv_group_iter = self._least_readv_node_readv(inv_nodes)
645
# Only grab the output lines if we will be processing them
646
output_lines = bool(self.revision_ids)
647
inv_lines = self._copy_nodes_graph(inventory_index_map,
648
self.new_pack._writer, self.new_pack.inventory_index,
649
readv_group_iter, total_items, output_lines=output_lines)
650
if self.revision_ids:
651
self._process_inventory_lines(inv_lines)
653
# eat the iterator to cause it to execute.
655
self._text_filter = None
656
if 'pack' in debug.debug_flags:
657
mutter('%s: create_pack: inventories copied: %s%s %d items t+%6.3fs',
658
time.ctime(), self._pack_collection._upload_transport.base,
659
self.new_pack.random_name,
660
self.new_pack.inventory_index.key_count(),
661
time.time() - self.new_pack.start_time)
663
def _copy_text_texts(self):
665
text_index_map, text_nodes = self._get_text_nodes()
666
if self._text_filter is not None:
667
# We could return the keys copied as part of the return value from
668
# _copy_nodes_graph but this doesn't work all that well with the
669
# need to get line output too, so we check separately, and as we're
670
# going to buffer everything anyway, we check beforehand, which
671
# saves reading knit data over the wire when we know there are
673
text_nodes = set(text_nodes)
674
present_text_keys = set(_node[1] for _node in text_nodes)
675
missing_text_keys = set(self._text_filter) - present_text_keys
676
if missing_text_keys:
677
# TODO: raise a specific error that can handle many missing
679
a_missing_key = missing_text_keys.pop()
680
raise errors.RevisionNotPresent(a_missing_key[1],
682
# copy text keys and adjust values
683
self.pb.update("Copying content texts", 3)
684
total_items, readv_group_iter = self._least_readv_node_readv(text_nodes)
685
list(self._copy_nodes_graph(text_index_map, self.new_pack._writer,
686
self.new_pack.text_index, readv_group_iter, total_items))
687
self._log_copied_texts()
689
def _check_references(self):
690
"""Make sure our external refereneces are present."""
691
external_refs = self.new_pack._external_compression_parents_of_texts()
693
index = self._pack_collection.text_index.combined_index
694
found_items = list(index.iter_entries(external_refs))
695
if len(found_items) != len(external_refs):
696
found_keys = set(k for idx, k, refs, value in found_items)
697
missing_items = external_refs - found_keys
698
missing_file_id, missing_revision_id = missing_items.pop()
699
raise errors.RevisionNotPresent(missing_revision_id,
702
def _create_pack_from_packs(self):
703
self.pb.update("Opening pack", 0, 5)
704
self.new_pack = self.open_pack()
705
new_pack = self.new_pack
706
# buffer data - we won't be reading-back during the pack creation and
707
# this makes a significant difference on sftp pushes.
708
new_pack.set_write_cache_size(1024*1024)
709
if 'pack' in debug.debug_flags:
710
plain_pack_list = ['%s%s' % (a_pack.pack_transport.base, a_pack.name)
711
for a_pack in self.packs]
712
if self.revision_ids is not None:
713
rev_count = len(self.revision_ids)
716
mutter('%s: create_pack: creating pack from source packs: '
717
'%s%s %s revisions wanted %s t=0',
718
time.ctime(), self._pack_collection._upload_transport.base, new_pack.random_name,
719
plain_pack_list, rev_count)
720
self._copy_revision_texts()
721
self._copy_inventory_texts()
722
self._copy_text_texts()
723
# select signature keys
724
signature_filter = self._revision_keys # same keyspace
725
signature_index_map = self._pack_collection._packs_list_to_pack_map_and_index_list(
726
self.packs, 'signature_index')[0]
727
signature_nodes = self._pack_collection._index_contents(signature_index_map,
729
# copy signature keys and adjust values
730
self.pb.update("Copying signature texts", 4)
731
self._copy_nodes(signature_nodes, signature_index_map, new_pack._writer,
732
new_pack.signature_index)
733
if 'pack' in debug.debug_flags:
734
mutter('%s: create_pack: revision signatures copied: %s%s %d items t+%6.3fs',
735
time.ctime(), self._pack_collection._upload_transport.base, new_pack.random_name,
736
new_pack.signature_index.key_count(),
737
time.time() - new_pack.start_time)
738
self._check_references()
739
if not self._use_pack(new_pack):
742
self.pb.update("Finishing pack", 5)
744
self._pack_collection.allocate(new_pack)
747
def _copy_nodes(self, nodes, index_map, writer, write_index):
748
"""Copy knit nodes between packs with no graph references."""
749
pb = ui.ui_factory.nested_progress_bar()
751
return self._do_copy_nodes(nodes, index_map, writer,
756
def _do_copy_nodes(self, nodes, index_map, writer, write_index, pb):
757
# for record verification
758
knit_data = _KnitData(None)
759
# plan a readv on each source pack:
761
nodes = sorted(nodes)
762
# how to map this into knit.py - or knit.py into this?
763
# we don't want the typical knit logic, we want grouping by pack
764
# at this point - perhaps a helper library for the following code
765
# duplication points?
767
for index, key, value in nodes:
768
if index not in request_groups:
769
request_groups[index] = []
770
request_groups[index].append((key, value))
772
pb.update("Copied record", record_index, len(nodes))
773
for index, items in request_groups.iteritems():
774
pack_readv_requests = []
775
for key, value in items:
776
# ---- KnitGraphIndex.get_position
777
bits = value[1:].split(' ')
778
offset, length = int(bits[0]), int(bits[1])
779
pack_readv_requests.append((offset, length, (key, value[0])))
780
# linear scan up the pack
781
pack_readv_requests.sort()
783
transport, path = index_map[index]
784
reader = pack.make_readv_reader(transport, path,
785
[offset[0:2] for offset in pack_readv_requests])
786
for (names, read_func), (_1, _2, (key, eol_flag)) in \
787
izip(reader.iter_records(), pack_readv_requests):
788
raw_data = read_func(None)
789
# check the header only
790
df, _ = knit_data._parse_record_header(key[-1], raw_data)
792
pos, size = writer.add_bytes_record(raw_data, names)
793
write_index.add_node(key, eol_flag + "%d %d" % (pos, size))
794
pb.update("Copied record", record_index)
797
def _copy_nodes_graph(self, index_map, writer, write_index,
798
readv_group_iter, total_items, output_lines=False):
799
"""Copy knit nodes between packs.
801
:param output_lines: Return lines present in the copied data as
802
an iterator of line,version_id.
804
pb = ui.ui_factory.nested_progress_bar()
806
for result in self._do_copy_nodes_graph(index_map, writer,
807
write_index, output_lines, pb, readv_group_iter, total_items):
810
# Python 2.4 does not permit try:finally: in a generator.
816
def _do_copy_nodes_graph(self, index_map, writer, write_index,
817
output_lines, pb, readv_group_iter, total_items):
818
# for record verification
819
knit_data = _KnitData(None)
820
# for line extraction when requested (inventories only)
822
factory = knit.KnitPlainFactory()
824
pb.update("Copied record", record_index, total_items)
825
for index, readv_vector, node_vector in readv_group_iter:
827
transport, path = index_map[index]
828
reader = pack.make_readv_reader(transport, path, readv_vector)
829
for (names, read_func), (key, eol_flag, references) in \
830
izip(reader.iter_records(), node_vector):
831
raw_data = read_func(None)
834
# read the entire thing
835
content, _ = knit_data._parse_record(version_id, raw_data)
836
if len(references[-1]) == 0:
837
line_iterator = factory.get_fulltext_content(content)
839
line_iterator = factory.get_linedelta_content(content)
840
for line in line_iterator:
841
yield line, version_id
843
# check the header only
844
df, _ = knit_data._parse_record_header(version_id, raw_data)
846
pos, size = writer.add_bytes_record(raw_data, names)
847
write_index.add_node(key, eol_flag + "%d %d" % (pos, size), references)
848
pb.update("Copied record", record_index)
851
def _get_text_nodes(self):
852
text_index_map = self._pack_collection._packs_list_to_pack_map_and_index_list(
853
self.packs, 'text_index')[0]
854
return text_index_map, self._pack_collection._index_contents(text_index_map,
857
def _least_readv_node_readv(self, nodes):
858
"""Generate request groups for nodes using the least readv's.
860
:param nodes: An iterable of graph index nodes.
861
:return: Total node count and an iterator of the data needed to perform
862
readvs to obtain the data for nodes. Each item yielded by the
863
iterator is a tuple with:
864
index, readv_vector, node_vector. readv_vector is a list ready to
865
hand to the transport readv method, and node_vector is a list of
866
(key, eol_flag, references) for the the node retrieved by the
867
matching readv_vector.
869
# group by pack so we do one readv per pack
870
nodes = sorted(nodes)
873
for index, key, value, references in nodes:
874
if index not in request_groups:
875
request_groups[index] = []
876
request_groups[index].append((key, value, references))
878
for index, items in request_groups.iteritems():
879
pack_readv_requests = []
880
for key, value, references in items:
881
# ---- KnitGraphIndex.get_position
882
bits = value[1:].split(' ')
883
offset, length = int(bits[0]), int(bits[1])
884
pack_readv_requests.append(
885
((offset, length), (key, value[0], references)))
886
# linear scan up the pack to maximum range combining.
887
pack_readv_requests.sort()
888
# split out the readv and the node data.
889
pack_readv = [readv for readv, node in pack_readv_requests]
890
node_vector = [node for readv, node in pack_readv_requests]
891
result.append((index, pack_readv, node_vector))
894
def _log_copied_texts(self):
895
if 'pack' in debug.debug_flags:
896
mutter('%s: create_pack: file texts copied: %s%s %d items t+%6.3fs',
897
time.ctime(), self._pack_collection._upload_transport.base,
898
self.new_pack.random_name,
899
self.new_pack.text_index.key_count(),
900
time.time() - self.new_pack.start_time)
902
def _process_inventory_lines(self, inv_lines):
903
"""Use up the inv_lines generator and setup a text key filter."""
904
repo = self._pack_collection.repo
905
fileid_revisions = repo._find_file_ids_from_xml_inventory_lines(
906
inv_lines, self.revision_ids)
908
for fileid, file_revids in fileid_revisions.iteritems():
909
text_filter.extend([(fileid, file_revid) for file_revid in file_revids])
910
self._text_filter = text_filter
912
def _revision_node_readv(self, revision_nodes):
913
"""Return the total revisions and the readv's to issue.
915
:param revision_nodes: The revision index contents for the packs being
916
incorporated into the new pack.
917
:return: As per _least_readv_node_readv.
919
return self._least_readv_node_readv(revision_nodes)
921
def _use_pack(self, new_pack):
922
"""Return True if new_pack should be used.
924
:param new_pack: The pack that has just been created.
925
:return: True if the pack should be used.
927
return new_pack.data_inserted()
930
class OptimisingPacker(Packer):
931
"""A packer which spends more time to create better disk layouts."""
933
def _revision_node_readv(self, revision_nodes):
934
"""Return the total revisions and the readv's to issue.
936
This sort places revisions in topological order with the ancestors
939
:param revision_nodes: The revision index contents for the packs being
940
incorporated into the new pack.
941
:return: As per _least_readv_node_readv.
943
# build an ancestors dict
946
for index, key, value, references in revision_nodes:
947
ancestors[key] = references[0]
948
by_key[key] = (index, value, references)
949
order = tsort.topo_sort(ancestors)
951
# Single IO is pathological, but it will work as a starting point.
953
for key in reversed(order):
954
index, value, references = by_key[key]
955
# ---- KnitGraphIndex.get_position
956
bits = value[1:].split(' ')
957
offset, length = int(bits[0]), int(bits[1])
959
(index, [(offset, length)], [(key, value[0], references)]))
960
# TODO: combine requests in the same index that are in ascending order.
961
return total, requests
964
class ReconcilePacker(Packer):
965
"""A packer which regenerates indices etc as it copies.
967
This is used by ``bzr reconcile`` to cause parent text pointers to be
971
def _extra_init(self):
972
self._data_changed = False
974
def _process_inventory_lines(self, inv_lines):
975
"""Generate a text key reference map rather for reconciling with."""
976
repo = self._pack_collection.repo
977
refs = repo._find_text_key_references_from_xml_inventory_lines(
979
self._text_refs = refs
980
# during reconcile we:
981
# - convert unreferenced texts to full texts
982
# - correct texts which reference a text not copied to be full texts
983
# - copy all others as-is but with corrected parents.
984
# - so at this point we don't know enough to decide what becomes a full
986
self._text_filter = None
988
def _copy_text_texts(self):
989
"""generate what texts we should have and then copy."""
990
self.pb.update("Copying content texts", 3)
991
# we have three major tasks here:
992
# 1) generate the ideal index
993
repo = self._pack_collection.repo
994
ancestors = dict([(key[0], tuple(ref[0] for ref in refs[0])) for
996
self.new_pack.revision_index.iter_all_entries()])
997
ideal_index = repo._generate_text_key_index(self._text_refs, ancestors)
998
# 2) generate a text_nodes list that contains all the deltas that can
999
# be used as-is, with corrected parents.
1002
discarded_nodes = []
1003
NULL_REVISION = _mod_revision.NULL_REVISION
1004
text_index_map, text_nodes = self._get_text_nodes()
1005
for node in text_nodes:
1011
ideal_parents = tuple(ideal_index[node[1]])
1013
discarded_nodes.append(node)
1014
self._data_changed = True
1016
if ideal_parents == (NULL_REVISION,):
1018
if ideal_parents == node[3][0]:
1020
ok_nodes.append(node)
1021
elif ideal_parents[0:1] == node[3][0][0:1]:
1022
# the left most parent is the same, or there are no parents
1023
# today. Either way, we can preserve the representation as
1024
# long as we change the refs to be inserted.
1025
self._data_changed = True
1026
ok_nodes.append((node[0], node[1], node[2],
1027
(ideal_parents, node[3][1])))
1028
self._data_changed = True
1030
# Reinsert this text completely
1031
bad_texts.append((node[1], ideal_parents))
1032
self._data_changed = True
1033
# we're finished with some data.
1036
# 3) bulk copy the ok data
1037
total_items, readv_group_iter = self._least_readv_node_readv(ok_nodes)
1038
list(self._copy_nodes_graph(text_index_map, self.new_pack._writer,
1039
self.new_pack.text_index, readv_group_iter, total_items))
1040
# 4) adhoc copy all the other texts.
1041
# We have to topologically insert all texts otherwise we can fail to
1042
# reconcile when parts of a single delta chain are preserved intact,
1043
# and other parts are not. E.g. Discarded->d1->d2->d3. d1 will be
1044
# reinserted, and if d3 has incorrect parents it will also be
1045
# reinserted. If we insert d3 first, d2 is present (as it was bulk
1046
# copied), so we will try to delta, but d2 is not currently able to be
1047
# extracted because it's basis d1 is not present. Topologically sorting
1048
# addresses this. The following generates a sort for all the texts that
1049
# are being inserted without having to reference the entire text key
1050
# space (we only topo sort the revisions, which is smaller).
1051
topo_order = tsort.topo_sort(ancestors)
1052
rev_order = dict(zip(topo_order, range(len(topo_order))))
1053
bad_texts.sort(key=lambda key:rev_order[key[0][1]])
1054
transaction = repo.get_transaction()
1055
file_id_index = GraphIndexPrefixAdapter(
1056
self.new_pack.text_index,
1058
add_nodes_callback=self.new_pack.text_index.add_nodes)
1059
knit_index = KnitGraphIndex(file_id_index,
1060
add_callback=file_id_index.add_nodes,
1061
deltas=True, parents=True)
1062
output_knit = knit.KnitVersionedFile('reconcile-texts',
1063
self._pack_collection.transport,
1066
access_method=_PackAccess(
1067
{self.new_pack.text_index:self.new_pack.access_tuple()},
1068
(self.new_pack._writer, self.new_pack.text_index)),
1069
factory=knit.KnitPlainFactory())
1070
for key, parent_keys in bad_texts:
1071
# We refer to the new pack to delta data being output.
1072
# A possible improvement would be to catch errors on short reads
1073
# and only flush then.
1074
self.new_pack.flush()
1076
for parent_key in parent_keys:
1077
if parent_key[0] != key[0]:
1078
# Graph parents must match the fileid
1079
raise errors.BzrError('Mismatched key parent %r:%r' %
1081
parents.append(parent_key[1])
1082
source_weave = repo.weave_store.get_weave(key[0], transaction)
1083
text_lines = source_weave.get_lines(key[1])
1084
# adapt the 'knit' to the current file_id.
1085
file_id_index = GraphIndexPrefixAdapter(
1086
self.new_pack.text_index,
1088
add_nodes_callback=self.new_pack.text_index.add_nodes)
1089
knit_index._graph_index = file_id_index
1090
knit_index._add_callback = file_id_index.add_nodes
1091
output_knit.add_lines_with_ghosts(
1092
key[1], parents, text_lines, random_id=True, check_content=False)
1093
# 5) check that nothing inserted has a reference outside the keyspace.
1094
missing_text_keys = self.new_pack._external_compression_parents_of_texts()
1095
if missing_text_keys:
1096
raise errors.BzrError('Reference to missing compression parents %r'
1098
self._log_copied_texts()
1100
def _use_pack(self, new_pack):
1101
"""Override _use_pack to check for reconcile having changed content."""
1102
# XXX: we might be better checking this at the copy time.
1103
original_inventory_keys = set()
1104
inv_index = self._pack_collection.inventory_index.combined_index
1105
for entry in inv_index.iter_all_entries():
1106
original_inventory_keys.add(entry[1])
1107
new_inventory_keys = set()
1108
for entry in new_pack.inventory_index.iter_all_entries():
1109
new_inventory_keys.add(entry[1])
1110
if new_inventory_keys != original_inventory_keys:
1111
self._data_changed = True
1112
return new_pack.data_inserted() and self._data_changed
1115
class RepositoryPackCollection(object):
1116
"""Management of packs within a repository."""
1118
def __init__(self, repo, transport, index_transport, upload_transport,
1120
"""Create a new RepositoryPackCollection.
1122
:param transport: Addresses the repository base directory
1123
(typically .bzr/repository/).
1124
:param index_transport: Addresses the directory containing indices.
1125
:param upload_transport: Addresses the directory into which packs are written
1126
while they're being created.
1127
:param pack_transport: Addresses the directory of existing complete packs.
1130
self.transport = transport
1131
self._index_transport = index_transport
1132
self._upload_transport = upload_transport
1133
self._pack_transport = pack_transport
1134
self._suffix_offsets = {'.rix': 0, '.iix': 1, '.tix': 2, '.six': 3}
1137
self._packs_by_name = {}
1138
# the previous pack-names content
1139
self._packs_at_load = None
1140
# when a pack is being created by this object, the state of that pack.
1141
self._new_pack = None
1142
# aggregated revision index data
1143
self.revision_index = AggregateIndex()
1144
self.inventory_index = AggregateIndex()
1145
self.text_index = AggregateIndex()
1146
self.signature_index = AggregateIndex()
1148
def add_pack_to_memory(self, pack):
1149
"""Make a Pack object available to the repository to satisfy queries.
1151
:param pack: A Pack object.
1153
assert pack.name not in self._packs_by_name
1154
self.packs.append(pack)
1155
self._packs_by_name[pack.name] = pack
1156
self.revision_index.add_index(pack.revision_index, pack)
1157
self.inventory_index.add_index(pack.inventory_index, pack)
1158
self.text_index.add_index(pack.text_index, pack)
1159
self.signature_index.add_index(pack.signature_index, pack)
1161
def _add_text_to_weave(self, file_id, revision_id, new_lines, parents,
1162
nostore_sha, random_revid):
1163
file_id_index = GraphIndexPrefixAdapter(
1164
self.text_index.combined_index,
1166
add_nodes_callback=self.text_index.add_callback)
1167
self.repo._text_knit._index._graph_index = file_id_index
1168
self.repo._text_knit._index._add_callback = file_id_index.add_nodes
1169
return self.repo._text_knit.add_lines_with_ghosts(
1170
revision_id, parents, new_lines, nostore_sha=nostore_sha,
1171
random_id=random_revid, check_content=False)[0:2]
1173
def all_packs(self):
1174
"""Return a list of all the Pack objects this repository has.
1176
Note that an in-progress pack being created is not returned.
1178
:return: A list of Pack objects for all the packs in the repository.
1181
for name in self.names():
1182
result.append(self.get_pack_by_name(name))
1186
"""Pack the pack collection incrementally.
1188
This will not attempt global reorganisation or recompression,
1189
rather it will just ensure that the total number of packs does
1190
not grow without bound. It uses the _max_pack_count method to
1191
determine if autopacking is needed, and the pack_distribution
1192
method to determine the number of revisions in each pack.
1194
If autopacking takes place then the packs name collection will have
1195
been flushed to disk - packing requires updating the name collection
1196
in synchronisation with certain steps. Otherwise the names collection
1199
:return: True if packing took place.
1201
# XXX: Should not be needed when the management of indices is sane.
1202
total_revisions = self.revision_index.combined_index.key_count()
1203
total_packs = len(self._names)
1204
if self._max_pack_count(total_revisions) >= total_packs:
1206
# XXX: the following may want to be a class, to pack with a given
1208
mutter('Auto-packing repository %s, which has %d pack files, '
1209
'containing %d revisions into %d packs.', self, total_packs,
1210
total_revisions, self._max_pack_count(total_revisions))
1211
# determine which packs need changing
1212
pack_distribution = self.pack_distribution(total_revisions)
1214
for pack in self.all_packs():
1215
revision_count = pack.get_revision_count()
1216
if revision_count == 0:
1217
# revision less packs are not generated by normal operation,
1218
# only by operations like sign-my-commits, and thus will not
1219
# tend to grow rapdily or without bound like commit containing
1220
# packs do - leave them alone as packing them really should
1221
# group their data with the relevant commit, and that may
1222
# involve rewriting ancient history - which autopack tries to
1223
# avoid. Alternatively we could not group the data but treat
1224
# each of these as having a single revision, and thus add
1225
# one revision for each to the total revision count, to get
1226
# a matching distribution.
1228
existing_packs.append((revision_count, pack))
1229
pack_operations = self.plan_autopack_combinations(
1230
existing_packs, pack_distribution)
1231
self._execute_pack_operations(pack_operations)
1234
def _execute_pack_operations(self, pack_operations, _packer_class=Packer):
1235
"""Execute a series of pack operations.
1237
:param pack_operations: A list of [revision_count, packs_to_combine].
1238
:param _packer_class: The class of packer to use (default: Packer).
1241
for revision_count, packs in pack_operations:
1242
# we may have no-ops from the setup logic
1245
_packer_class(self, packs, '.autopack').pack()
1247
self._remove_pack_from_memory(pack)
1248
# record the newly available packs and stop advertising the old
1250
self._save_pack_names(clear_obsolete_packs=True)
1251
# Move the old packs out of the way now they are no longer referenced.
1252
for revision_count, packs in pack_operations:
1253
self._obsolete_packs(packs)
1255
def lock_names(self):
1256
"""Acquire the mutex around the pack-names index.
1258
This cannot be used in the middle of a read-only transaction on the
1261
self.repo.control_files.lock_write()
1264
"""Pack the pack collection totally."""
1265
self.ensure_loaded()
1266
total_packs = len(self._names)
1268
# This is arguably wrong because we might not be optimal, but for
1269
# now lets leave it in. (e.g. reconcile -> one pack. But not
1272
total_revisions = self.revision_index.combined_index.key_count()
1273
# XXX: the following may want to be a class, to pack with a given
1275
mutter('Packing repository %s, which has %d pack files, '
1276
'containing %d revisions into 1 packs.', self, total_packs,
1278
# determine which packs need changing
1279
pack_distribution = [1]
1280
pack_operations = [[0, []]]
1281
for pack in self.all_packs():
1282
pack_operations[-1][0] += pack.get_revision_count()
1283
pack_operations[-1][1].append(pack)
1284
self._execute_pack_operations(pack_operations, OptimisingPacker)
1286
def plan_autopack_combinations(self, existing_packs, pack_distribution):
1287
"""Plan a pack operation.
1289
:param existing_packs: The packs to pack. (A list of (revcount, Pack)
1291
:param pack_distribution: A list with the number of revisions desired
1294
if len(existing_packs) <= len(pack_distribution):
1296
existing_packs.sort(reverse=True)
1297
pack_operations = [[0, []]]
1298
# plan out what packs to keep, and what to reorganise
1299
while len(existing_packs):
1300
# take the largest pack, and if its less than the head of the
1301
# distribution chart we will include its contents in the new pack for
1302
# that position. If its larger, we remove its size from the
1303
# distribution chart
1304
next_pack_rev_count, next_pack = existing_packs.pop(0)
1305
if next_pack_rev_count >= pack_distribution[0]:
1306
# this is already packed 'better' than this, so we can
1307
# not waste time packing it.
1308
while next_pack_rev_count > 0:
1309
next_pack_rev_count -= pack_distribution[0]
1310
if next_pack_rev_count >= 0:
1312
del pack_distribution[0]
1314
# didn't use that entire bucket up
1315
pack_distribution[0] = -next_pack_rev_count
1317
# add the revisions we're going to add to the next output pack
1318
pack_operations[-1][0] += next_pack_rev_count
1319
# allocate this pack to the next pack sub operation
1320
pack_operations[-1][1].append(next_pack)
1321
if pack_operations[-1][0] >= pack_distribution[0]:
1322
# this pack is used up, shift left.
1323
del pack_distribution[0]
1324
pack_operations.append([0, []])
1326
return pack_operations
1328
def ensure_loaded(self):
1329
# NB: if you see an assertion error here, its probably access against
1330
# an unlocked repo. Naughty.
1331
if not self.repo.is_locked():
1332
raise errors.ObjectNotLocked(self.repo)
1333
if self._names is None:
1335
self._packs_at_load = set()
1336
for index, key, value in self._iter_disk_pack_index():
1338
self._names[name] = self._parse_index_sizes(value)
1339
self._packs_at_load.add((key, value))
1340
# populate all the metadata.
1343
def _parse_index_sizes(self, value):
1344
"""Parse a string of index sizes."""
1345
return tuple([int(digits) for digits in value.split(' ')])
1347
def get_pack_by_name(self, name):
1348
"""Get a Pack object by name.
1350
:param name: The name of the pack - e.g. '123456'
1351
:return: A Pack object.
1354
return self._packs_by_name[name]
1356
rev_index = self._make_index(name, '.rix')
1357
inv_index = self._make_index(name, '.iix')
1358
txt_index = self._make_index(name, '.tix')
1359
sig_index = self._make_index(name, '.six')
1360
result = ExistingPack(self._pack_transport, name, rev_index,
1361
inv_index, txt_index, sig_index)
1362
self.add_pack_to_memory(result)
1365
def allocate(self, a_new_pack):
1366
"""Allocate name in the list of packs.
1368
:param a_new_pack: A NewPack instance to be added to the collection of
1369
packs for this repository.
1371
self.ensure_loaded()
1372
if a_new_pack.name in self._names:
1373
raise errors.BzrError(
1374
'Pack %r already exists in %s' % (a_new_pack.name, self))
1375
self._names[a_new_pack.name] = tuple(a_new_pack.index_sizes)
1376
self.add_pack_to_memory(a_new_pack)
1378
def _iter_disk_pack_index(self):
1379
"""Iterate over the contents of the pack-names index.
1381
This is used when loading the list from disk, and before writing to
1382
detect updates from others during our write operation.
1383
:return: An iterator of the index contents.
1385
return GraphIndex(self.transport, 'pack-names', None
1386
).iter_all_entries()
1388
def _make_index(self, name, suffix):
1389
size_offset = self._suffix_offsets[suffix]
1390
index_name = name + suffix
1391
index_size = self._names[name][size_offset]
1393
self._index_transport, index_name, index_size)
1395
def _max_pack_count(self, total_revisions):
1396
"""Return the maximum number of packs to use for total revisions.
1398
:param total_revisions: The total number of revisions in the
1401
if not total_revisions:
1403
digits = str(total_revisions)
1405
for digit in digits:
1406
result += int(digit)
1410
"""Provide an order to the underlying names."""
1411
return sorted(self._names.keys())
1413
def _obsolete_packs(self, packs):
1414
"""Move a number of packs which have been obsoleted out of the way.
1416
Each pack and its associated indices are moved out of the way.
1418
Note: for correctness this function should only be called after a new
1419
pack names index has been written without these pack names, and with
1420
the names of packs that contain the data previously available via these
1423
:param packs: The packs to obsolete.
1424
:param return: None.
1427
pack.pack_transport.rename(pack.file_name(),
1428
'../obsolete_packs/' + pack.file_name())
1429
# TODO: Probably needs to know all possible indices for this pack
1430
# - or maybe list the directory and move all indices matching this
1431
# name whether we recognize it or not?
1432
for suffix in ('.iix', '.six', '.tix', '.rix'):
1433
self._index_transport.rename(pack.name + suffix,
1434
'../obsolete_packs/' + pack.name + suffix)
1436
def pack_distribution(self, total_revisions):
1437
"""Generate a list of the number of revisions to put in each pack.
1439
:param total_revisions: The total number of revisions in the
1442
if total_revisions == 0:
1444
digits = reversed(str(total_revisions))
1446
for exponent, count in enumerate(digits):
1447
size = 10 ** exponent
1448
for pos in range(int(count)):
1450
return list(reversed(result))
1452
def _pack_tuple(self, name):
1453
"""Return a tuple with the transport and file name for a pack name."""
1454
return self._pack_transport, name + '.pack'
1456
def _remove_pack_from_memory(self, pack):
1457
"""Remove pack from the packs accessed by this repository.
1459
Only affects memory state, until self._save_pack_names() is invoked.
1461
self._names.pop(pack.name)
1462
self._packs_by_name.pop(pack.name)
1463
self._remove_pack_indices(pack)
1465
def _remove_pack_indices(self, pack):
1466
"""Remove the indices for pack from the aggregated indices."""
1467
self.revision_index.remove_index(pack.revision_index, pack)
1468
self.inventory_index.remove_index(pack.inventory_index, pack)
1469
self.text_index.remove_index(pack.text_index, pack)
1470
self.signature_index.remove_index(pack.signature_index, pack)
1473
"""Clear all cached data."""
1474
# cached revision data
1475
self.repo._revision_knit = None
1476
self.revision_index.clear()
1477
# cached signature data
1478
self.repo._signature_knit = None
1479
self.signature_index.clear()
1480
# cached file text data
1481
self.text_index.clear()
1482
self.repo._text_knit = None
1483
# cached inventory data
1484
self.inventory_index.clear()
1485
# remove the open pack
1486
self._new_pack = None
1487
# information about packs.
1490
self._packs_by_name = {}
1491
self._packs_at_load = None
1493
def _make_index_map(self, index_suffix):
1494
"""Return information on existing indices.
1496
:param suffix: Index suffix added to pack name.
1498
:returns: (pack_map, indices) where indices is a list of GraphIndex
1499
objects, and pack_map is a mapping from those objects to the
1500
pack tuple they describe.
1502
# TODO: stop using this; it creates new indices unnecessarily.
1503
self.ensure_loaded()
1504
suffix_map = {'.rix': 'revision_index',
1505
'.six': 'signature_index',
1506
'.iix': 'inventory_index',
1507
'.tix': 'text_index',
1509
return self._packs_list_to_pack_map_and_index_list(self.all_packs(),
1510
suffix_map[index_suffix])
1512
def _packs_list_to_pack_map_and_index_list(self, packs, index_attribute):
1513
"""Convert a list of packs to an index pack map and index list.
1515
:param packs: The packs list to process.
1516
:param index_attribute: The attribute that the desired index is found
1518
:return: A tuple (map, list) where map contains the dict from
1519
index:pack_tuple, and lsit contains the indices in the same order
1525
index = getattr(pack, index_attribute)
1526
indices.append(index)
1527
pack_map[index] = (pack.pack_transport, pack.file_name())
1528
return pack_map, indices
1530
def _index_contents(self, pack_map, key_filter=None):
1531
"""Get an iterable of the index contents from a pack_map.
1533
:param pack_map: A map from indices to pack details.
1534
:param key_filter: An optional filter to limit the
1537
indices = [index for index in pack_map.iterkeys()]
1538
all_index = CombinedGraphIndex(indices)
1539
if key_filter is None:
1540
return all_index.iter_all_entries()
1542
return all_index.iter_entries(key_filter)
1544
def _unlock_names(self):
1545
"""Release the mutex around the pack-names index."""
1546
self.repo.control_files.unlock()
1548
def _save_pack_names(self, clear_obsolete_packs=False):
1549
"""Save the list of packs.
1551
This will take out the mutex around the pack names list for the
1552
duration of the method call. If concurrent updates have been made, a
1553
three-way merge between the current list and the current in memory list
1556
:param clear_obsolete_packs: If True, clear out the contents of the
1557
obsolete_packs directory.
1561
builder = GraphIndexBuilder()
1562
# load the disk nodes across
1564
for index, key, value in self._iter_disk_pack_index():
1565
disk_nodes.add((key, value))
1566
# do a two-way diff against our original content
1567
current_nodes = set()
1568
for name, sizes in self._names.iteritems():
1570
((name, ), ' '.join(str(size) for size in sizes)))
1571
deleted_nodes = self._packs_at_load - current_nodes
1572
new_nodes = current_nodes - self._packs_at_load
1573
disk_nodes.difference_update(deleted_nodes)
1574
disk_nodes.update(new_nodes)
1575
# TODO: handle same-name, index-size-changes here -
1576
# e.g. use the value from disk, not ours, *unless* we're the one
1578
for key, value in disk_nodes:
1579
builder.add_node(key, value)
1580
self.transport.put_file('pack-names', builder.finish(),
1581
mode=self.repo.control_files._file_mode)
1582
# move the baseline forward
1583
self._packs_at_load = disk_nodes
1584
# now clear out the obsolete packs directory
1585
if clear_obsolete_packs:
1586
self.transport.clone('obsolete_packs').delete_multi(
1587
self.transport.list_dir('obsolete_packs'))
1589
self._unlock_names()
1590
# synchronise the memory packs list with what we just wrote:
1591
new_names = dict(disk_nodes)
1592
# drop no longer present nodes
1593
for pack in self.all_packs():
1594
if (pack.name,) not in new_names:
1595
self._remove_pack_from_memory(pack)
1596
# add new nodes/refresh existing ones
1597
for key, value in disk_nodes:
1599
sizes = self._parse_index_sizes(value)
1600
if name in self._names:
1602
if sizes != self._names[name]:
1603
# the pack for name has had its indices replaced - rare but
1604
# important to handle. XXX: probably can never happen today
1605
# because the three-way merge code above does not handle it
1606
# - you may end up adding the same key twice to the new
1607
# disk index because the set values are the same, unless
1608
# the only index shows up as deleted by the set difference
1609
# - which it may. Until there is a specific test for this,
1610
# assume its broken. RBC 20071017.
1611
self._remove_pack_from_memory(self.get_pack_by_name(name))
1612
self._names[name] = sizes
1613
self.get_pack_by_name(name)
1616
self._names[name] = sizes
1617
self.get_pack_by_name(name)
1619
def _start_write_group(self):
1620
# Do not permit preparation for writing if we're not in a 'write lock'.
1621
if not self.repo.is_write_locked():
1622
raise errors.NotWriteLocked(self)
1623
self._new_pack = NewPack(self._upload_transport, self._index_transport,
1624
self._pack_transport, upload_suffix='.pack',
1625
file_mode=self.repo.control_files._file_mode)
1626
# allow writing: queue writes to a new index
1627
self.revision_index.add_writable_index(self._new_pack.revision_index,
1629
self.inventory_index.add_writable_index(self._new_pack.inventory_index,
1631
self.text_index.add_writable_index(self._new_pack.text_index,
1633
self.signature_index.add_writable_index(self._new_pack.signature_index,
1636
# reused revision and signature knits may need updating
1638
# "Hysterical raisins. client code in bzrlib grabs those knits outside
1639
# of write groups and then mutates it inside the write group."
1640
if self.repo._revision_knit is not None:
1641
self.repo._revision_knit._index._add_callback = \
1642
self.revision_index.add_callback
1643
if self.repo._signature_knit is not None:
1644
self.repo._signature_knit._index._add_callback = \
1645
self.signature_index.add_callback
1646
# create a reused knit object for text addition in commit.
1647
self.repo._text_knit = self.repo.weave_store.get_weave_or_empty(
1650
def _abort_write_group(self):
1651
# FIXME: just drop the transient index.
1652
# forget what names there are
1653
if self._new_pack is not None:
1654
self._new_pack.abort()
1655
self._remove_pack_indices(self._new_pack)
1656
self._new_pack = None
1657
self.repo._text_knit = None
1659
def _commit_write_group(self):
1660
self._remove_pack_indices(self._new_pack)
1661
if self._new_pack.data_inserted():
1662
# get all the data to disk and read to use
1663
self._new_pack.finish()
1664
self.allocate(self._new_pack)
1665
self._new_pack = None
1666
if not self.autopack():
1667
# when autopack takes no steps, the names list is still
1669
self._save_pack_names()
1671
self._new_pack.abort()
1672
self._new_pack = None
1673
self.repo._text_knit = None
1676
class KnitPackRevisionStore(KnitRevisionStore):
1677
"""An object to adapt access from RevisionStore's to use KnitPacks.
1679
This class works by replacing the original RevisionStore.
1680
We need to do this because the KnitPackRevisionStore is less
1681
isolated in its layering - it uses services from the repo.
1684
def __init__(self, repo, transport, revisionstore):
1685
"""Create a KnitPackRevisionStore on repo with revisionstore.
1687
This will store its state in the Repository, use the
1688
indices to provide a KnitGraphIndex,
1689
and at the end of transactions write new indices.
1691
KnitRevisionStore.__init__(self, revisionstore.versioned_file_store)
1693
self._serializer = revisionstore._serializer
1694
self.transport = transport
1696
def get_revision_file(self, transaction):
1697
"""Get the revision versioned file object."""
1698
if getattr(self.repo, '_revision_knit', None) is not None:
1699
return self.repo._revision_knit
1700
self.repo._pack_collection.ensure_loaded()
1701
add_callback = self.repo._pack_collection.revision_index.add_callback
1702
# setup knit specific objects
1703
knit_index = KnitGraphIndex(
1704
self.repo._pack_collection.revision_index.combined_index,
1705
add_callback=add_callback)
1706
self.repo._revision_knit = knit.KnitVersionedFile(
1707
'revisions', self.transport.clone('..'),
1708
self.repo.control_files._file_mode,
1709
create=False, access_mode=self.repo._access_mode(),
1710
index=knit_index, delta=False, factory=knit.KnitPlainFactory(),
1711
access_method=self.repo._pack_collection.revision_index.knit_access)
1712
return self.repo._revision_knit
1714
def get_signature_file(self, transaction):
1715
"""Get the signature versioned file object."""
1716
if getattr(self.repo, '_signature_knit', None) is not None:
1717
return self.repo._signature_knit
1718
self.repo._pack_collection.ensure_loaded()
1719
add_callback = self.repo._pack_collection.signature_index.add_callback
1720
# setup knit specific objects
1721
knit_index = KnitGraphIndex(
1722
self.repo._pack_collection.signature_index.combined_index,
1723
add_callback=add_callback, parents=False)
1724
self.repo._signature_knit = knit.KnitVersionedFile(
1725
'signatures', self.transport.clone('..'),
1726
self.repo.control_files._file_mode,
1727
create=False, access_mode=self.repo._access_mode(),
1728
index=knit_index, delta=False, factory=knit.KnitPlainFactory(),
1729
access_method=self.repo._pack_collection.signature_index.knit_access)
1730
return self.repo._signature_knit
1733
class KnitPackTextStore(VersionedFileStore):
1734
"""Presents a TextStore abstraction on top of packs.
1736
This class works by replacing the original VersionedFileStore.
1737
We need to do this because the KnitPackRevisionStore is less
1738
isolated in its layering - it uses services from the repo and shares them
1739
with all the data written in a single write group.
1742
def __init__(self, repo, transport, weavestore):
1743
"""Create a KnitPackTextStore on repo with weavestore.
1745
This will store its state in the Repository, use the
1746
indices FileNames to provide a KnitGraphIndex,
1747
and at the end of transactions write new indices.
1749
# don't call base class constructor - it's not suitable.
1750
# no transient data stored in the transaction
1752
self._precious = False
1754
self.transport = transport
1755
self.weavestore = weavestore
1756
# XXX for check() which isn't updated yet
1757
self._transport = weavestore._transport
1759
def get_weave_or_empty(self, file_id, transaction):
1760
"""Get a 'Knit' backed by the .tix indices.
1762
The transaction parameter is ignored.
1764
self.repo._pack_collection.ensure_loaded()
1765
add_callback = self.repo._pack_collection.text_index.add_callback
1766
# setup knit specific objects
1767
file_id_index = GraphIndexPrefixAdapter(
1768
self.repo._pack_collection.text_index.combined_index,
1769
(file_id, ), 1, add_nodes_callback=add_callback)
1770
knit_index = KnitGraphIndex(file_id_index,
1771
add_callback=file_id_index.add_nodes,
1772
deltas=True, parents=True)
1773
return knit.KnitVersionedFile('text:' + file_id,
1774
self.transport.clone('..'),
1777
access_method=self.repo._pack_collection.text_index.knit_access,
1778
factory=knit.KnitPlainFactory())
1780
get_weave = get_weave_or_empty
1783
"""Generate a list of the fileids inserted, for use by check."""
1784
self.repo._pack_collection.ensure_loaded()
1786
for index, key, value, refs in \
1787
self.repo._pack_collection.text_index.combined_index.iter_all_entries():
1792
class InventoryKnitThunk(object):
1793
"""An object to manage thunking get_inventory_weave to pack based knits."""
1795
def __init__(self, repo, transport):
1796
"""Create an InventoryKnitThunk for repo at transport.
1798
This will store its state in the Repository, use the
1799
indices FileNames to provide a KnitGraphIndex,
1800
and at the end of transactions write a new index..
1803
self.transport = transport
1805
def get_weave(self):
1806
"""Get a 'Knit' that contains inventory data."""
1807
self.repo._pack_collection.ensure_loaded()
1808
add_callback = self.repo._pack_collection.inventory_index.add_callback
1809
# setup knit specific objects
1810
knit_index = KnitGraphIndex(
1811
self.repo._pack_collection.inventory_index.combined_index,
1812
add_callback=add_callback, deltas=True, parents=True)
1813
return knit.KnitVersionedFile(
1814
'inventory', self.transport.clone('..'),
1815
self.repo.control_files._file_mode,
1816
create=False, access_mode=self.repo._access_mode(),
1817
index=knit_index, delta=True, factory=knit.KnitPlainFactory(),
1818
access_method=self.repo._pack_collection.inventory_index.knit_access)
1821
class KnitPackRepository(KnitRepository):
1822
"""Experimental graph-knit using repository."""
1824
def __init__(self, _format, a_bzrdir, control_files, _revision_store,
1825
control_store, text_store, _commit_builder_class, _serializer):
1826
KnitRepository.__init__(self, _format, a_bzrdir, control_files,
1827
_revision_store, control_store, text_store, _commit_builder_class,
1829
index_transport = control_files._transport.clone('indices')
1830
self._pack_collection = RepositoryPackCollection(self, control_files._transport,
1832
control_files._transport.clone('upload'),
1833
control_files._transport.clone('packs'))
1834
self._revision_store = KnitPackRevisionStore(self, index_transport, self._revision_store)
1835
self.weave_store = KnitPackTextStore(self, index_transport, self.weave_store)
1836
self._inv_thunk = InventoryKnitThunk(self, index_transport)
1837
# True when the repository object is 'write locked' (as opposed to the
1838
# physical lock only taken out around changes to the pack-names list.)
1839
# Another way to represent this would be a decorator around the control
1840
# files object that presents logical locks as physical ones - if this
1841
# gets ugly consider that alternative design. RBC 20071011
1842
self._write_lock_count = 0
1843
self._transaction = None
1845
self._reconcile_does_inventory_gc = True
1846
self._reconcile_fixes_text_parents = True
1847
self._reconcile_backsup_inventory = False
1849
def _abort_write_group(self):
1850
self._pack_collection._abort_write_group()
1852
def _access_mode(self):
1853
"""Return 'w' or 'r' for depending on whether a write lock is active.
1855
This method is a helper for the Knit-thunking support objects.
1857
if self.is_write_locked():
1861
def _find_inconsistent_revision_parents(self):
1862
"""Find revisions with incorrectly cached parents.
1864
:returns: an iterator yielding tuples of (revison-id, parents-in-index,
1865
parents-in-revision).
1867
if not self.is_locked():
1868
raise errors.ObjectNotLocked(self)
1869
pb = ui.ui_factory.nested_progress_bar()
1872
revision_nodes = self._pack_collection.revision_index \
1873
.combined_index.iter_all_entries()
1874
index_positions = []
1875
# Get the cached index values for all revisions, and also the location
1876
# in each index of the revision text so we can perform linear IO.
1877
for index, key, value, refs in revision_nodes:
1878
pos, length = value[1:].split(' ')
1879
index_positions.append((index, int(pos), key[0],
1880
tuple(parent[0] for parent in refs[0])))
1881
pb.update("Reading revision index.", 0, 0)
1882
index_positions.sort()
1883
batch_count = len(index_positions) / 1000 + 1
1884
pb.update("Checking cached revision graph.", 0, batch_count)
1885
for offset in xrange(batch_count):
1886
pb.update("Checking cached revision graph.", offset)
1887
to_query = index_positions[offset * 1000:(offset + 1) * 1000]
1890
rev_ids = [item[2] for item in to_query]
1891
revs = self.get_revisions(rev_ids)
1892
for revision, item in zip(revs, to_query):
1893
index_parents = item[3]
1894
rev_parents = tuple(revision.parent_ids)
1895
if index_parents != rev_parents:
1896
result.append((revision.revision_id, index_parents, rev_parents))
1901
@symbol_versioning.deprecated_method(symbol_versioning.one_one)
1902
def get_parents(self, revision_ids):
1903
"""See graph._StackedParentsProvider.get_parents."""
1904
parent_map = self.get_parent_map(revision_ids)
1905
return [parent_map.get(r, None) for r in revision_ids]
1907
def get_parent_map(self, keys):
1908
"""See graph._StackedParentsProvider.get_parent_map
1910
This implementation accesses the combined revision index to provide
1913
self._pack_collection.ensure_loaded()
1914
index = self._pack_collection.revision_index.combined_index
1916
if _mod_revision.NULL_REVISION in keys:
1917
keys.discard(_mod_revision.NULL_REVISION)
1918
found_parents = {_mod_revision.NULL_REVISION:()}
1921
search_keys = set((revision_id,) for revision_id in keys)
1922
for index, key, value, refs in index.iter_entries(search_keys):
1925
parents = (_mod_revision.NULL_REVISION,)
1927
parents = tuple(parent[0] for parent in parents)
1928
found_parents[key[0]] = parents
1929
return found_parents
1931
def has_revisions(self, revision_ids):
1932
"""See Repository.has_revisions()."""
1933
revision_ids = set(revision_ids)
1934
result = revision_ids.intersection(
1935
set([None, _mod_revision.NULL_REVISION]))
1936
revision_ids.difference_update(result)
1937
index = self._pack_collection.revision_index.combined_index
1938
keys = [(revision_id,) for revision_id in revision_ids]
1939
result.update(node[1][0] for node in index.iter_entries(keys))
1942
def _make_parents_provider(self):
1943
return graph.CachingParentsProvider(self)
1945
def _refresh_data(self):
1946
if self._write_lock_count == 1 or (
1947
self.control_files._lock_count == 1 and
1948
self.control_files._lock_mode == 'r'):
1949
# forget what names there are
1950
self._pack_collection.reset()
1951
# XXX: Better to do an in-memory merge when acquiring a new lock -
1952
# factor out code from _save_pack_names.
1953
self._pack_collection.ensure_loaded()
1955
def _start_write_group(self):
1956
self._pack_collection._start_write_group()
1958
def _commit_write_group(self):
1959
return self._pack_collection._commit_write_group()
1961
def get_inventory_weave(self):
1962
return self._inv_thunk.get_weave()
1964
def get_transaction(self):
1965
if self._write_lock_count:
1966
return self._transaction
1968
return self.control_files.get_transaction()
1970
def is_locked(self):
1971
return self._write_lock_count or self.control_files.is_locked()
1973
def is_write_locked(self):
1974
return self._write_lock_count
1976
def lock_write(self, token=None):
1977
if not self._write_lock_count and self.is_locked():
1978
raise errors.ReadOnlyError(self)
1979
self._write_lock_count += 1
1980
if self._write_lock_count == 1:
1981
from bzrlib import transactions
1982
self._transaction = transactions.WriteTransaction()
1983
self._refresh_data()
1985
def lock_read(self):
1986
if self._write_lock_count:
1987
self._write_lock_count += 1
1989
self.control_files.lock_read()
1990
self._refresh_data()
1992
def leave_lock_in_place(self):
1993
# not supported - raise an error
1994
raise NotImplementedError(self.leave_lock_in_place)
1996
def dont_leave_lock_in_place(self):
1997
# not supported - raise an error
1998
raise NotImplementedError(self.dont_leave_lock_in_place)
2002
"""Compress the data within the repository.
2004
This will pack all the data to a single pack. In future it may
2005
recompress deltas or do other such expensive operations.
2007
self._pack_collection.pack()
2010
def reconcile(self, other=None, thorough=False):
2011
"""Reconcile this repository."""
2012
from bzrlib.reconcile import PackReconciler
2013
reconciler = PackReconciler(self, thorough=thorough)
2014
reconciler.reconcile()
2018
if self._write_lock_count == 1 and self._write_group is not None:
2019
self.abort_write_group()
2020
self._transaction = None
2021
self._write_lock_count = 0
2022
raise errors.BzrError(
2023
'Must end write group before releasing write lock on %s'
2025
if self._write_lock_count:
2026
self._write_lock_count -= 1
2027
if not self._write_lock_count:
2028
transaction = self._transaction
2029
self._transaction = None
2030
transaction.finish()
2032
self.control_files.unlock()
2035
class RepositoryFormatPack(MetaDirRepositoryFormat):
2036
"""Format logic for pack structured repositories.
2038
This repository format has:
2039
- a list of packs in pack-names
2040
- packs in packs/NAME.pack
2041
- indices in indices/NAME.{iix,six,tix,rix}
2042
- knit deltas in the packs, knit indices mapped to the indices.
2043
- thunk objects to support the knits programming API.
2044
- a format marker of its own
2045
- an optional 'shared-storage' flag
2046
- an optional 'no-working-trees' flag
2050
# Set this attribute in derived classes to control the repository class
2051
# created by open and initialize.
2052
repository_class = None
2053
# Set this attribute in derived classes to control the
2054
# _commit_builder_class that the repository objects will have passed to
2055
# their constructor.
2056
_commit_builder_class = None
2057
# Set this attribute in derived clases to control the _serializer that the
2058
# repository objects will have passed to their constructor.
2060
# External references are not supported in pack repositories yet.
2061
supports_external_lookups = False
2063
def _get_control_store(self, repo_transport, control_files):
2064
"""Return the control store for this repository."""
2065
return VersionedFileStore(
2068
file_mode=control_files._file_mode,
2069
versionedfile_class=knit.KnitVersionedFile,
2070
versionedfile_kwargs={'factory': knit.KnitPlainFactory()},
2073
def _get_revision_store(self, repo_transport, control_files):
2074
"""See RepositoryFormat._get_revision_store()."""
2075
versioned_file_store = VersionedFileStore(
2077
file_mode=control_files._file_mode,
2080
versionedfile_class=knit.KnitVersionedFile,
2081
versionedfile_kwargs={'delta': False,
2082
'factory': knit.KnitPlainFactory(),
2086
return KnitRevisionStore(versioned_file_store)
2088
def _get_text_store(self, transport, control_files):
2089
"""See RepositoryFormat._get_text_store()."""
2090
return self._get_versioned_file_store('knits',
2093
versionedfile_class=knit.KnitVersionedFile,
2094
versionedfile_kwargs={
2095
'create_parent_dir': True,
2096
'delay_create': True,
2097
'dir_mode': control_files._dir_mode,
2101
def initialize(self, a_bzrdir, shared=False):
2102
"""Create a pack based repository.
2104
:param a_bzrdir: bzrdir to contain the new repository; must already
2106
:param shared: If true the repository will be initialized as a shared
2109
mutter('creating repository in %s.', a_bzrdir.transport.base)
2110
dirs = ['indices', 'obsolete_packs', 'packs', 'upload']
2111
builder = GraphIndexBuilder()
2112
files = [('pack-names', builder.finish())]
2113
utf8_files = [('format', self.get_format_string())]
2115
self._upload_blank_content(a_bzrdir, dirs, files, utf8_files, shared)
2116
return self.open(a_bzrdir=a_bzrdir, _found=True)
2118
def open(self, a_bzrdir, _found=False, _override_transport=None):
2119
"""See RepositoryFormat.open().
2121
:param _override_transport: INTERNAL USE ONLY. Allows opening the
2122
repository at a slightly different url
2123
than normal. I.e. during 'upgrade'.
2126
format = RepositoryFormat.find_format(a_bzrdir)
2127
assert format.__class__ == self.__class__
2128
if _override_transport is not None:
2129
repo_transport = _override_transport
2131
repo_transport = a_bzrdir.get_repository_transport(None)
2132
control_files = lockable_files.LockableFiles(repo_transport,
2133
'lock', lockdir.LockDir)
2134
text_store = self._get_text_store(repo_transport, control_files)
2135
control_store = self._get_control_store(repo_transport, control_files)
2136
_revision_store = self._get_revision_store(repo_transport, control_files)
2137
return self.repository_class(_format=self,
2139
control_files=control_files,
2140
_revision_store=_revision_store,
2141
control_store=control_store,
2142
text_store=text_store,
2143
_commit_builder_class=self._commit_builder_class,
2144
_serializer=self._serializer)
2147
class RepositoryFormatKnitPack1(RepositoryFormatPack):
2148
"""A no-subtrees parameterized Pack repository.
2150
This format was introduced in 0.92.
2153
repository_class = KnitPackRepository
2154
_commit_builder_class = PackCommitBuilder
2155
_serializer = xml5.serializer_v5
2157
def _get_matching_bzrdir(self):
2158
return bzrdir.format_registry.make_bzrdir('pack-0.92')
2160
def _ignore_setting_bzrdir(self, format):
2163
_matchingbzrdir = property(_get_matching_bzrdir, _ignore_setting_bzrdir)
2165
def get_format_string(self):
2166
"""See RepositoryFormat.get_format_string()."""
2167
return "Bazaar pack repository format 1 (needs bzr 0.92)\n"
2169
def get_format_description(self):
2170
"""See RepositoryFormat.get_format_description()."""
2171
return "Packs containing knits without subtree support"
2173
def check_conversion_target(self, target_format):
2177
class RepositoryFormatKnitPack3(RepositoryFormatPack):
2178
"""A subtrees parameterized Pack repository.
2180
This repository format uses the xml7 serializer to get:
2181
- support for recording full info about the tree root
2182
- support for recording tree-references
2184
This format was introduced in 0.92.
2187
repository_class = KnitPackRepository
2188
_commit_builder_class = PackRootCommitBuilder
2189
rich_root_data = True
2190
supports_tree_reference = True
2191
_serializer = xml7.serializer_v7
2193
def _get_matching_bzrdir(self):
2194
return bzrdir.format_registry.make_bzrdir(
2195
'pack-0.92-subtree')
2197
def _ignore_setting_bzrdir(self, format):
2200
_matchingbzrdir = property(_get_matching_bzrdir, _ignore_setting_bzrdir)
2202
def check_conversion_target(self, target_format):
2203
if not target_format.rich_root_data:
2204
raise errors.BadConversionTarget(
2205
'Does not support rich root data.', target_format)
2206
if not getattr(target_format, 'supports_tree_reference', False):
2207
raise errors.BadConversionTarget(
2208
'Does not support nested trees', target_format)
2210
def get_format_string(self):
2211
"""See RepositoryFormat.get_format_string()."""
2212
return "Bazaar pack repository format 1 with subtree support (needs bzr 0.92)\n"
2214
def get_format_description(self):
2215
"""See RepositoryFormat.get_format_description()."""
2216
return "Packs containing knits with subtree support\n"
2219
class RepositoryFormatKnitPack4(RepositoryFormatPack):
2220
"""A rich-root, no subtrees parameterized Pack repository.
2222
This repository format uses the xml6 serializer to get:
2223
- support for recording full info about the tree root
2225
This format was introduced in 1.0.
2228
repository_class = KnitPackRepository
2229
_commit_builder_class = PackRootCommitBuilder
2230
rich_root_data = True
2231
supports_tree_reference = False
2232
_serializer = xml6.serializer_v6
2234
def _get_matching_bzrdir(self):
2235
return bzrdir.format_registry.make_bzrdir(
2238
def _ignore_setting_bzrdir(self, format):
2241
_matchingbzrdir = property(_get_matching_bzrdir, _ignore_setting_bzrdir)
2243
def check_conversion_target(self, target_format):
2244
if not target_format.rich_root_data:
2245
raise errors.BadConversionTarget(
2246
'Does not support rich root data.', target_format)
2248
def get_format_string(self):
2249
"""See RepositoryFormat.get_format_string()."""
2250
return ("Bazaar pack repository format 1 with rich root"
2251
" (needs bzr 1.0)\n")
2253
def get_format_description(self):
2254
"""See RepositoryFormat.get_format_description()."""
2255
return "Packs containing knits with rich root support\n"
2258
class RepositoryFormatPackDevelopment0(RepositoryFormatPack):
2259
"""A no-subtrees development repository.
2261
This format should be retained until the second release after bzr 1.0.
2263
No changes to the disk behaviour from pack-0.92.
2266
repository_class = KnitPackRepository
2267
_commit_builder_class = PackCommitBuilder
2268
_serializer = xml5.serializer_v5
2270
def _get_matching_bzrdir(self):
2271
return bzrdir.format_registry.make_bzrdir('development0')
2273
def _ignore_setting_bzrdir(self, format):
2276
_matchingbzrdir = property(_get_matching_bzrdir, _ignore_setting_bzrdir)
2278
def get_format_string(self):
2279
"""See RepositoryFormat.get_format_string()."""
2280
return "Bazaar development format 0 (needs bzr.dev from before 1.3)\n"
2282
def get_format_description(self):
2283
"""See RepositoryFormat.get_format_description()."""
2284
return ("Development repository format, currently the same as "
2287
def check_conversion_target(self, target_format):
2291
class RepositoryFormatPackDevelopment0Subtree(RepositoryFormatPack):
2292
"""A subtrees development repository.
2294
This format should be retained until the second release after bzr 1.0.
2296
No changes to the disk behaviour from pack-0.92-subtree.
2299
repository_class = KnitPackRepository
2300
_commit_builder_class = PackRootCommitBuilder
2301
rich_root_data = True
2302
supports_tree_reference = True
2303
_serializer = xml7.serializer_v7
2305
def _get_matching_bzrdir(self):
2306
return bzrdir.format_registry.make_bzrdir(
2307
'development0-subtree')
2309
def _ignore_setting_bzrdir(self, format):
2312
_matchingbzrdir = property(_get_matching_bzrdir, _ignore_setting_bzrdir)
2314
def check_conversion_target(self, target_format):
2315
if not target_format.rich_root_data:
2316
raise errors.BadConversionTarget(
2317
'Does not support rich root data.', target_format)
2318
if not getattr(target_format, 'supports_tree_reference', False):
2319
raise errors.BadConversionTarget(
2320
'Does not support nested trees', target_format)
2322
def get_format_string(self):
2323
"""See RepositoryFormat.get_format_string()."""
2324
return ("Bazaar development format 0 with subtree support "
2325
"(needs bzr.dev from before 1.3)\n")
2327
def get_format_description(self):
2328
"""See RepositoryFormat.get_format_description()."""
2329
return ("Development repository format, currently the same as "
2330
"pack-0.92-subtree\n")
added
removed
bzrlib/repofmt/pack_repo.py
