Differences between revisions 4 and 5
Revision 4 as of 2010-06-10 14:01:36
Size: 1070
Revision 5 as of 2010-06-10 14:20:46
Size: 1327
Deletions are marked like this. Additions are marked like this.
Line 32: Line 32:

== Use Cases ==

A branch can be killed off, local or not:

digraph {
  graph [rankdir = LR]
  node [shape = box, style = filled, fillcolor = cornflowerblue]
  Y [fillcolor = FireBrick]

  A -> B -> C -> D -> E;
  B -> X-> Y;

Poisoned Changesets

Status: draft

1. Definitions

We will use the following definitions:

poisoned changeset

a changeset with poisoned=1 in its extra dict.

dead head
a poisoned changeset that is also a head.
dead changeset
a changeset from which you can only reach dead heads.
dead branch
a set of dead changesets

2. Rules for Push

When pushing changesets, the following two rules are observed:

  1. First, send changesets that are not on a dead branch.
  2. Then, send changesets descending from what is now remote heads.

The discovery protocols gives us the heads of the common set of nodes. From these we can compute the changesets that are not on a dead branch (rule 1). We can then look at the remaining heads among the nodes in the common set and push descendants of these.

No new information is neede by this protocol, everything can be computed locally from information about the common set of nodes.

3. Rules for Pull

Symmetric to pull, but the server needs to filter the changesets.

4. Use Cases

A branch can be killed off, local or not:

PoisonedChangesetsPlan (last edited 2015-06-12 08:45:14 by Pierre-YvesDavid)