1
# Copyright (C) 2005-2011 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17
"""Copying of history from one branch to another.
19
The basic plan is that every branch knows the history of everything
20
that has merged into it. As the first step of a merge, pull, or
21
branch operation we copy history from the source into the destination
25
from __future__ import absolute_import
29
from .lazy_import import lazy_import
30
lazy_import(globals(), """
34
from breezy.bzr import (
43
from .i18n import gettext
44
from .revision import NULL_REVISION
48
from .trace import mutter
51
class RepoFetcher(object):
52
"""Pull revisions and texts from one repository to another.
54
This should not be used directly, it's essential a object to encapsulate
55
the logic in InterRepository.fetch().
58
def __init__(self, to_repository, from_repository, last_revision=None,
59
find_ghosts=True, fetch_spec=None):
60
"""Create a repo fetcher.
62
:param last_revision: If set, try to limit to the data this revision
64
:param fetch_spec: A SearchResult specifying which revisions to fetch.
65
If set, this overrides last_revision.
66
:param find_ghosts: If True search the entire history for ghosts.
68
# repository.fetch has the responsibility for short-circuiting
69
# attempts to copy between a repository and itself.
70
self.to_repository = to_repository
71
self.from_repository = from_repository
72
self.sink = to_repository._get_sink()
73
# must not mutate self._last_revision as its potentially a shared instance
74
self._last_revision = last_revision
75
self._fetch_spec = fetch_spec
76
self.find_ghosts = find_ghosts
77
self.from_repository.lock_read()
78
mutter("Using fetch logic to copy between %s(%s) and %s(%s)",
79
str(self.from_repository), str(self.from_repository._format),
80
str(self.to_repository), str(self.to_repository._format))
84
self.from_repository.unlock()
87
"""Primary worker function.
89
This initialises all the needed variables, and then fetches the
90
requested revisions, finally clearing the progress bar.
92
# Roughly this is what we're aiming for fetch to become:
94
# missing = self.sink.insert_stream(self.source.get_stream(search))
96
# missing = self.sink.insert_stream(self.source.get_items(missing))
99
self.file_ids_names = {}
100
with ui.ui_factory.nested_progress_bar() as pb:
101
pb.show_pct = pb.show_count = False
102
pb.update(gettext("Finding revisions"), 0, 2)
103
search_result = self._revids_to_fetch()
104
mutter('fetching: %s', search_result)
105
if search_result.is_empty():
107
pb.update(gettext("Fetching revisions"), 1, 2)
108
self._fetch_everything_for_search(search_result)
110
def _fetch_everything_for_search(self, search):
111
"""Fetch all data for the given set of revisions."""
112
# The first phase is "file". We pass the progress bar for it directly
113
# into item_keys_introduced_by, which has more information about how
114
# that phase is progressing than we do. Progress updates for the other
115
# phases are taken care of in this function.
116
# XXX: there should be a clear owner of the progress reporting. Perhaps
117
# item_keys_introduced_by should have a richer API than it does at the
118
# moment, so that it can feed the progress information back to this
120
if (self.from_repository._format.rich_root_data and
121
not self.to_repository._format.rich_root_data):
122
raise errors.IncompatibleRepositories(
123
self.from_repository, self.to_repository,
124
"different rich-root support")
125
with ui.ui_factory.nested_progress_bar() as pb:
126
pb.update("Get stream source")
127
source = self.from_repository._get_source(
128
self.to_repository._format)
129
stream = source.get_stream(search)
130
from_format = self.from_repository._format
131
pb.update("Inserting stream")
132
resume_tokens, missing_keys = self.sink.insert_stream(
133
stream, from_format, [])
135
pb.update("Missing keys")
136
stream = source.get_stream_for_missing_keys(missing_keys)
137
pb.update("Inserting missing keys")
138
resume_tokens, missing_keys = self.sink.insert_stream(
139
stream, from_format, resume_tokens)
141
raise AssertionError(
142
"second push failed to complete a fetch %r." % (
145
raise AssertionError(
146
"second push failed to commit the fetch %r." % (
148
pb.update("Finishing stream")
151
def _revids_to_fetch(self):
152
"""Determines the exact revisions needed from self.from_repository to
153
install self._last_revision in self.to_repository.
155
:returns: A SearchResult of some sort. (Possibly a
156
PendingAncestryResult, EmptySearchResult, etc.)
158
if self._fetch_spec is not None:
159
# The fetch spec is already a concrete search result.
160
return self._fetch_spec
161
elif self._last_revision == NULL_REVISION:
162
# fetch_spec is None + last_revision is null => empty fetch.
163
# explicit limit of no revisions needed
164
return vf_search.EmptySearchResult()
165
elif self._last_revision is not None:
166
return vf_search.NotInOtherForRevs(self.to_repository,
167
self.from_repository, [self._last_revision],
168
find_ghosts=self.find_ghosts).execute()
169
else: # self._last_revision is None:
170
return vf_search.EverythingNotInOther(self.to_repository,
171
self.from_repository,
172
find_ghosts=self.find_ghosts).execute()
175
class Inter1and2Helper(object):
176
"""Helper for operations that convert data from model 1 and 2
178
This is for use by fetchers and converters.
181
# This is a class variable so that the test suite can override it.
182
known_graph_threshold = 100
184
def __init__(self, source):
187
:param source: The repository data comes from
191
def iter_rev_trees(self, revs):
192
"""Iterate through RevisionTrees efficiently.
194
Additionally, the inventory's revision_id is set if unset.
196
Trees are retrieved in batches of 100, and then yielded in the order
199
:param revs: A list of revision ids
201
# In case that revs is not a list.
204
for tree in self.source.revision_trees(revs[:100]):
205
if tree.root_inventory.revision_id is None:
206
tree.root_inventory.revision_id = tree.get_revision_id()
210
def _find_root_ids(self, revs, parent_map, graph):
212
for tree in self.iter_rev_trees(revs):
213
root_id = tree.get_root_id()
214
revision_id = tree.get_file_revision(u'', root_id)
215
revision_root[revision_id] = root_id
216
# Find out which parents we don't already know root ids for
217
parents = set(viewvalues(parent_map))
218
parents.difference_update(revision_root)
219
parents.discard(NULL_REVISION)
220
# Limit to revisions present in the versionedfile
221
parents = graph.get_parent_map(parents)
222
for tree in self.iter_rev_trees(parents):
223
root_id = tree.get_root_id()
224
revision_root[tree.get_revision_id()] = root_id
227
def generate_root_texts(self, revs):
228
"""Generate VersionedFiles for all root ids.
230
:param revs: the revisions to include
232
graph = self.source.get_graph()
233
parent_map = graph.get_parent_map(revs)
234
rev_order = tsort.topo_sort(parent_map)
235
rev_id_to_root_id = self._find_root_ids(revs, parent_map, graph)
236
root_id_order = [(rev_id_to_root_id[rev_id], rev_id) for rev_id in
238
# Guaranteed stable, this groups all the file id operations together
239
# retaining topological order within the revisions of a file id.
240
# File id splits and joins would invalidate this, but they don't exist
241
# yet, and are unlikely to in non-rich-root environments anyway.
242
root_id_order.sort(key=operator.itemgetter(0))
243
# Create a record stream containing the roots to create.
244
if len(revs) > self.known_graph_threshold:
245
graph = self.source.get_known_graph_ancestry(revs)
246
new_roots_stream = _new_root_data_stream(
247
root_id_order, rev_id_to_root_id, parent_map, self.source, graph)
248
return [('texts', new_roots_stream)]
251
def _new_root_data_stream(
252
root_keys_to_create, rev_id_to_root_id_map, parent_map, repo, graph=None):
253
"""Generate a texts substream of synthesised root entries.
255
Used in fetches that do rich-root upgrades.
257
:param root_keys_to_create: iterable of (root_id, rev_id) pairs describing
258
the root entries to create.
259
:param rev_id_to_root_id_map: dict of known rev_id -> root_id mappings for
260
calculating the parents. If a parent rev_id is not found here then it
261
will be recalculated.
262
:param parent_map: a parent map for all the revisions in
264
:param graph: a graph to use instead of repo.get_graph().
266
for root_key in root_keys_to_create:
267
root_id, rev_id = root_key
268
parent_keys = _parent_keys_for_root_version(
269
root_id, rev_id, rev_id_to_root_id_map, parent_map, repo, graph)
270
yield versionedfile.FulltextContentFactory(
271
root_key, parent_keys, None, '')
274
def _parent_keys_for_root_version(
275
root_id, rev_id, rev_id_to_root_id_map, parent_map, repo, graph=None):
276
"""Get the parent keys for a given root id.
278
A helper function for _new_root_data_stream.
280
# Include direct parents of the revision, but only if they used the same
281
# root_id and are heads.
282
rev_parents = parent_map[rev_id]
284
for parent_id in rev_parents:
285
if parent_id == NULL_REVISION:
287
if parent_id not in rev_id_to_root_id_map:
288
# We probably didn't read this revision, go spend the extra effort
291
tree = repo.revision_tree(parent_id)
292
except errors.NoSuchRevision:
293
# Ghost, fill out rev_id_to_root_id in case we encounter this
295
# But set parent_root_id to None since we don't really know
296
parent_root_id = None
298
parent_root_id = tree.get_root_id()
299
rev_id_to_root_id_map[parent_id] = None
301
# rev_id_to_root_id_map[parent_id] = parent_root_id
302
# memory consumption maybe?
304
parent_root_id = rev_id_to_root_id_map[parent_id]
305
if root_id == parent_root_id:
306
# With stacking we _might_ want to refer to a non-local revision,
307
# but this code path only applies when we have the full content
308
# available, so ghosts really are ghosts, not just the edge of
310
parent_ids.append(parent_id)
312
# root_id may be in the parent anyway.
314
tree = repo.revision_tree(parent_id)
315
except errors.NoSuchRevision:
316
# ghost, can't refer to it.
320
parent_ids.append(tree.get_file_revision(tree.id2path(root_id), root_id))
321
except errors.NoSuchId:
324
# Drop non-head parents
326
graph = repo.get_graph()
327
heads = graph.heads(parent_ids)
329
for parent_id in parent_ids:
330
if parent_id in heads and parent_id not in selected_ids:
331
selected_ids.append(parent_id)
332
parent_keys = [(root_id, parent_id) for parent_id in selected_ids]
336
class TargetRepoKinds(object):
337
"""An enum-like set of constants.
339
They are the possible values of FetchSpecFactory.target_repo_kinds.
342
PREEXISTING = 'preexisting'
347
class FetchSpecFactory(object):
348
"""A helper for building the best fetch spec for a sprout call.
350
Factors that go into determining the sort of fetch to perform:
351
* did the caller specify any revision IDs?
352
* did the caller specify a source branch (need to fetch its
353
heads_to_fetch(), usually the tip + tags)
354
* is there an existing target repo (don't need to refetch revs it
356
* target is stacked? (similar to pre-existing target repo: even if
357
the target itself is new don't want to refetch existing revs)
359
:ivar source_branch: the source branch if one specified, else None.
360
:ivar source_branch_stop_revision_id: fetch up to this revision of
361
source_branch, rather than its tip.
362
:ivar source_repo: the source repository if one found, else None.
363
:ivar target_repo: the target repository acquired by sprout.
364
:ivar target_repo_kind: one of the TargetRepoKinds constants.
368
self._explicit_rev_ids = set()
369
self.source_branch = None
370
self.source_branch_stop_revision_id = None
371
self.source_repo = None
372
self.target_repo = None
373
self.target_repo_kind = None
376
def add_revision_ids(self, revision_ids):
377
"""Add revision_ids to the set of revision_ids to be fetched."""
378
self._explicit_rev_ids.update(revision_ids)
380
def make_fetch_spec(self):
381
"""Build a SearchResult or PendingAncestryResult or etc."""
382
if self.target_repo_kind is None or self.source_repo is None:
383
raise AssertionError(
384
'Incomplete FetchSpecFactory: %r' % (self.__dict__,))
385
if len(self._explicit_rev_ids) == 0 and self.source_branch is None:
386
if self.limit is not None:
387
raise NotImplementedError(
388
"limit is only supported with a source branch set")
389
# Caller hasn't specified any revisions or source branch
390
if self.target_repo_kind == TargetRepoKinds.EMPTY:
391
return vf_search.EverythingResult(self.source_repo)
393
# We want everything not already in the target (or target's
395
return vf_search.EverythingNotInOther(
396
self.target_repo, self.source_repo).execute()
397
heads_to_fetch = set(self._explicit_rev_ids)
398
if self.source_branch is not None:
399
must_fetch, if_present_fetch = self.source_branch.heads_to_fetch()
400
if self.source_branch_stop_revision_id is not None:
401
# Replace the tip rev from must_fetch with the stop revision
402
# XXX: this might be wrong if the tip rev is also in the
403
# must_fetch set for other reasons (e.g. it's the tip of
404
# multiple loom threads?), but then it's pretty unclear what it
405
# should mean to specify a stop_revision in that case anyway.
406
must_fetch.discard(self.source_branch.last_revision())
407
must_fetch.add(self.source_branch_stop_revision_id)
408
heads_to_fetch.update(must_fetch)
410
if_present_fetch = set()
411
if self.target_repo_kind == TargetRepoKinds.EMPTY:
412
# PendingAncestryResult does not raise errors if a requested head
413
# is absent. Ideally it would support the
414
# required_ids/if_present_ids distinction, but in practice
415
# heads_to_fetch will almost certainly be present so this doesn't
417
all_heads = heads_to_fetch.union(if_present_fetch)
418
ret = vf_search.PendingAncestryResult(all_heads, self.source_repo)
419
if self.limit is not None:
420
graph = self.source_repo.get_graph()
421
topo_order = list(graph.iter_topo_order(ret.get_keys()))
422
result_set = topo_order[:self.limit]
423
ret = self.source_repo.revision_ids_to_search_result(result_set)
426
return vf_search.NotInOtherForRevs(self.target_repo, self.source_repo,
427
required_ids=heads_to_fetch, if_present_ids=if_present_fetch,
428
limit=self.limit).execute()
added
removed
breezy/fetch.py
