|
| 1 | +package function |
| 2 | + |
| 3 | +import ( |
| 4 | + "io" |
| 5 | + |
| 6 | + "gopkg.in/src-d/go-git.v4/plumbing/filemode" |
| 7 | + "gopkg.in/src-d/go-git.v4/plumbing/object" |
| 8 | + |
| 9 | + "github.com/src-d/gitquery" |
| 10 | + git "gopkg.in/src-d/go-git.v4" |
| 11 | + "gopkg.in/src-d/go-git.v4/plumbing" |
| 12 | + "gopkg.in/src-d/go-mysql-server.v0/sql" |
| 13 | + "gopkg.in/src-d/go-mysql-server.v0/sql/expression" |
| 14 | +) |
| 15 | + |
| 16 | +// CommitHasTree is a function that checks whether a tree is part of a commit |
| 17 | +// or not. |
| 18 | +type CommitHasTree struct { |
| 19 | + expression.BinaryExpression |
| 20 | +} |
| 21 | + |
| 22 | +// NewCommitHasTree creates a new CommitHasTree function. |
| 23 | +func NewCommitHasTree(commit, tree sql.Expression) sql.Expression { |
| 24 | + return &CommitHasTree{expression.BinaryExpression{ |
| 25 | + Left: commit, |
| 26 | + Right: tree, |
| 27 | + }} |
| 28 | +} |
| 29 | + |
| 30 | +// Name implements the Expression interface. |
| 31 | +func (CommitHasTree) Name() string { return "commit_has_tree" } |
| 32 | + |
| 33 | +// Type implements the Expression interface. |
| 34 | +func (CommitHasTree) Type() sql.Type { return sql.Boolean } |
| 35 | + |
| 36 | +// Eval implements the Expression interface. |
| 37 | +func (f *CommitHasTree) Eval(s sql.Session, row sql.Row) (interface{}, error) { |
| 38 | + session, ok := s.(*gitquery.Session) |
| 39 | + if !ok { |
| 40 | + return nil, gitquery.ErrInvalidGitQuerySession.New(s) |
| 41 | + } |
| 42 | + |
| 43 | + left, err := f.Left.Eval(s, row) |
| 44 | + if err != nil { |
| 45 | + return nil, err |
| 46 | + } |
| 47 | + |
| 48 | + if left == nil { |
| 49 | + return nil, nil |
| 50 | + } |
| 51 | + |
| 52 | + left, err = sql.Text.Convert(left) |
| 53 | + if err != nil { |
| 54 | + return nil, err |
| 55 | + } |
| 56 | + |
| 57 | + right, err := f.Right.Eval(s, row) |
| 58 | + if err != nil { |
| 59 | + return nil, err |
| 60 | + } |
| 61 | + |
| 62 | + if right == nil { |
| 63 | + return nil, nil |
| 64 | + } |
| 65 | + |
| 66 | + right, err = sql.Text.Convert(right) |
| 67 | + if err != nil { |
| 68 | + return nil, err |
| 69 | + } |
| 70 | + |
| 71 | + commitHash := plumbing.NewHash(left.(string)) |
| 72 | + treeHash := plumbing.NewHash(right.(string)) |
| 73 | + |
| 74 | + iter, err := session.Pool.RepoIter() |
| 75 | + if err != nil { |
| 76 | + return nil, err |
| 77 | + } |
| 78 | + |
| 79 | + for { |
| 80 | + repo, err := iter.Next() |
| 81 | + if err == io.EOF { |
| 82 | + return false, nil |
| 83 | + } |
| 84 | + |
| 85 | + if err != nil { |
| 86 | + return nil, err |
| 87 | + } |
| 88 | + |
| 89 | + ok, err := commitHasTree(repo.Repo, commitHash, treeHash) |
| 90 | + if err == plumbing.ErrObjectNotFound { |
| 91 | + continue |
| 92 | + } |
| 93 | + |
| 94 | + return ok, nil |
| 95 | + } |
| 96 | +} |
| 97 | + |
| 98 | +func commitHasTree( |
| 99 | + repo *git.Repository, |
| 100 | + commitHash, treeHash plumbing.Hash, |
| 101 | +) (bool, error) { |
| 102 | + commit, err := repo.CommitObject(commitHash) |
| 103 | + if err != nil { |
| 104 | + return false, err |
| 105 | + } |
| 106 | + |
| 107 | + if commit.TreeHash == treeHash { |
| 108 | + return true, nil |
| 109 | + } |
| 110 | + |
| 111 | + tree, err := commit.Tree() |
| 112 | + if err != nil { |
| 113 | + return false, err |
| 114 | + } |
| 115 | + |
| 116 | + return treeInEntries(repo, tree.Entries, treeHash) |
| 117 | +} |
| 118 | + |
| 119 | +func treeInEntries( |
| 120 | + repo *git.Repository, |
| 121 | + entries []object.TreeEntry, |
| 122 | + hash plumbing.Hash, |
| 123 | +) (bool, error) { |
| 124 | + type stackFrame struct { |
| 125 | + pos int |
| 126 | + entries []object.TreeEntry |
| 127 | + } |
| 128 | + var stack = []*stackFrame{{0, entries}} |
| 129 | + |
| 130 | + for { |
| 131 | + if len(stack) == 0 { |
| 132 | + return false, nil |
| 133 | + } |
| 134 | + |
| 135 | + frame := stack[len(stack)-1] |
| 136 | + if frame.pos >= len(frame.entries) { |
| 137 | + stack = stack[:len(stack)-1] |
| 138 | + continue |
| 139 | + } |
| 140 | + |
| 141 | + entry := frame.entries[frame.pos] |
| 142 | + frame.pos++ |
| 143 | + if entry.Mode == filemode.Dir { |
| 144 | + if entry.Hash == hash { |
| 145 | + return true, nil |
| 146 | + } |
| 147 | + |
| 148 | + tree, err := repo.TreeObject(entry.Hash) |
| 149 | + if err != nil { |
| 150 | + return false, nil |
| 151 | + } |
| 152 | + |
| 153 | + stack = append(stack, &stackFrame{0, tree.Entries}) |
| 154 | + } |
| 155 | + } |
| 156 | +} |
| 157 | + |
| 158 | +// TransformUp implements the Expression interface. |
| 159 | +func (f *CommitHasTree) TransformUp(fn func(sql.Expression) (sql.Expression, error)) (sql.Expression, error) { |
| 160 | + left, err := f.Left.TransformUp(fn) |
| 161 | + if err != nil { |
| 162 | + return nil, err |
| 163 | + } |
| 164 | + |
| 165 | + right, err := f.Right.TransformUp(fn) |
| 166 | + if err != nil { |
| 167 | + return nil, err |
| 168 | + } |
| 169 | + |
| 170 | + return fn(NewCommitHasTree(left, right)) |
| 171 | +} |
0 commit comments