summaryrefslogtreecommitdiff
path: root/Documentation/RelNotes/1.7.5.txt
diff options
context:
space:
mode:
authorLibravatar Derrick Stolee <dstolee@microsoft.com>2019-06-18 11:14:24 -0700
committerLibravatar Junio C Hamano <gitster@pobox.com>2019-06-19 20:46:25 -0700
commitd4f4d60f6da8b93f768b2b4958c04cc1b3cea443 (patch)
tree1f88453dc1b3ff7d3e126b2288c9ae7076b360e3 /Documentation/RelNotes/1.7.5.txt
parentcommit-graph: document commit-graph chains (diff)
downloadtgif-d4f4d60f6da8b93f768b2b4958c04cc1b3cea443.tar.xz
commit-graph: prepare for commit-graph chains
To prepare for a chain of commit-graph files, augment the commit_graph struct to point to a base commit_graph. As we load commits from the graph, we may actually want to read from a base file according to the graph position. The "graph position" of a commit is given by concatenating the lexicographic commit orders from each of the commit-graph files in the chain. This means that we must distinguish two values: * lexicographic index : the position within the lexicographic order in a single commit-graph file. * graph position: the position within the concatenated order of multiple commit-graph files Given the lexicographic index of a commit in a graph, we can compute the graph position by adding the number of commits in the lower-level graphs. To find the lexicographic index of a commit, we subtract the number of commits in lower-level graphs. While here, change insert_parent_or_die() to take a uint32_t position, as that is the type used by its only caller and that makes more sense with the limits in the commit-graph format. Signed-off-by: Derrick Stolee <dstolee@microsoft.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'Documentation/RelNotes/1.7.5.txt')
0 files changed, 0 insertions, 0 deletions