aboutsummaryrefslogtreecommitdiff
path: root/format/pack/ingest/rev_write.go
blob: 5e9dbcbd45cc9d86af83cf449626a8abc8f2f5d3 (about) (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
package ingest

import (
	"encoding/binary"
	"slices"

	"codeberg.org/lindenii/furgit/objectid"
)

const (
	revMagic   = 0x52494458
	revVersion = 1
)

// writeRev writes rev index for resolved records.
func writeRev(state *ingestState) error {
	if !state.writeRev {
		return nil
	}

	idxOrder := buildIdxOrder(state)

	recordToIdxPos := make([]int, len(state.records))
	for pos, recordIdx := range idxOrder {
		recordToIdxPos[recordIdx] = pos
	}

	packOrder := buildPackOrder(state)

	hashImpl, err := state.algo.New()
	if err != nil {
		return err
	}

	var scratch [8]byte
	binary.BigEndian.PutUint32(scratch[:4], revMagic)

	if err := writeAndHash(state.revFile, hashImpl, scratch[:4]); err != nil {
		return err
	}

	binary.BigEndian.PutUint32(scratch[:4], revVersion)

	if err := writeAndHash(state.revFile, hashImpl, scratch[:4]); err != nil {
		return err
	}

	binary.BigEndian.PutUint32(scratch[:4], hashID(state.algo))

	if err := writeAndHash(state.revFile, hashImpl, scratch[:4]); err != nil {
		return err
	}

	for _, recordIdx := range packOrder {
		binary.BigEndian.PutUint32(scratch[:4], uint32(recordToIdxPos[recordIdx]))

		if err := writeAndHash(state.revFile, hashImpl, scratch[:4]); err != nil {
			return err
		}
	}

	if err := writeAndHash(state.revFile, hashImpl, state.packHash.Bytes()); err != nil {
		return err
	}

	revHash := hashImpl.Sum(nil)
	if _, err := state.revFile.Write(revHash); err != nil {
		return err
	}

	return state.revFile.Sync()
}

// buildPackOrder returns record indexes sorted by pack offset.
func buildPackOrder(state *ingestState) []int {
	out := make([]int, 0, len(state.records))
	for idx := range state.records {
		out = append(out, idx)
	}

	slices.SortFunc(out, func(a, b int) int {
		offA := state.records[a].offset

		offB := state.records[b].offset
		switch {
		case offA < offB:
			return -1
		case offA > offB:
			return 1
		default:
			return 0
		}
	})

	return out
}

// hashID converts object algorithm to pack hash-id encoding.
func hashID(algo objectid.Algorithm) uint32 {
	switch algo {
	case objectid.AlgorithmSHA1:
		return 1
	case objectid.AlgorithmSHA256:
		return 2
	default:
		return 0
	}
}