forked from libgit2/rugged
-
Notifications
You must be signed in to change notification settings - Fork 2
/
rugged_revwalk.c
191 lines (164 loc) · 5.38 KB
/
rugged_revwalk.c
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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
/*
* The MIT License
*
* Copyright (c) 2011 GitHub, Inc
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
#include "rugged.h"
extern VALUE rb_mRugged;
VALUE rb_cRuggedWalker;
static void rb_git_walk__free(git_revwalk *walk)
{
git_revwalk_free(walk);
}
VALUE rugged_walker_new(VALUE klass, VALUE owner, git_revwalk *walk)
{
VALUE rb_walk = Data_Wrap_Struct(klass, NULL, &rb_git_walk__free, walk);
rugged_set_owner(rb_walk, owner);
return rb_walk;
}
/*
* call-seq:
* Walker.new(repository) -> walker
*
* Create a new +Walker+ instance able to walk commits found
* in +repository+, which is a <tt>Rugged::Repository</tt> instance.
*/
static VALUE rb_git_walker_new(VALUE klass, VALUE rb_repo)
{
git_repository *repo;
git_revwalk *walk;
int error;
Data_Get_Struct(rb_repo, git_repository, repo);
error = git_revwalk_new(&walk, repo);
rugged_exception_check(error);
return rugged_walker_new(klass, rb_repo, walk);;
}
/*
* call-seq:
* walker.each { |commit| block }
* walker.each -> Iterator
*
* Perform the walk through the repository, yielding each
* one of the commits found as a <tt>Rugged::Commit</tt> instance
* to +block+.
*
* If no +block+ is given, an +Iterator+ will be returned.
*
* The walker must have been previously set-up before a walk can be performed
* (i.e. at least one commit must have been pushed).
*
* walker.push("92b22bbcb37caf4f6f53d30292169e84f5e4283b")
* walker.each { |commit| puts commit.oid }
*
* generates:
*
* 92b22bbcb37caf4f6f53d30292169e84f5e4283b
* 6b750d5800439b502de669465b385e5f469c78b6
* ef9207141549f4ffcd3c4597e270d32e10d0a6bc
* cb75e05f0f8ac3407fb3bd0ebd5ff07573b16c9f
* ...
*/
static VALUE rb_git_walker_each(VALUE self)
{
git_revwalk *walk;
git_commit *commit;
git_repository *repo;
git_oid commit_oid;
int error;
Data_Get_Struct(self, git_revwalk, walk);
repo = git_revwalk_repository(walk);
if (!rb_block_given_p())
return rb_funcall(self, rb_intern("to_enum"), 0);
while ((error = git_revwalk_next(&commit_oid, walk)) == 0) {
error = git_commit_lookup(&commit, repo, &commit_oid);
rugged_exception_check(error);
rb_yield(rugged_object_new(rugged_owner(self), (git_object *)commit));
}
if (error != GIT_REVWALKOVER)
rugged_exception_check(error);
return Qnil;
}
/*
* call-seq:
* walker.push(commit)
*
* Push one new +commit+ to start the walk from. +commit+ must be a
* +String+ with the OID of a commit in the repository, or a <tt>Rugged::Commit</tt>
* instance.
*
* More than one commit may be pushed to the walker (to walk several
* branches simulataneously).
*
* Duplicate pushed commits will be ignored; at least one commit must have been
* pushed as a starting point before the walk can begin.
*
* walker.push("92b22bbcb37caf4f6f53d30292169e84f5e4283b")
*/
static VALUE rb_git_walker_push(VALUE self, VALUE rb_commit)
{
git_revwalk *walk;
git_commit *commit;
Data_Get_Struct(self, git_revwalk, walk);
commit = (git_commit *)rugged_object_load(
git_revwalk_repository(walk), rb_commit, GIT_OBJ_COMMIT);
git_revwalk_push(walk, git_object_id((git_object *)commit));
return Qnil;
}
/*
* call-seq:
* walker.hide(commit)
*
*/
static VALUE rb_git_walker_hide(VALUE self, VALUE rb_commit)
{
git_revwalk *walk;
git_commit *commit;
Data_Get_Struct(self, git_revwalk, walk);
commit = (git_commit *)rugged_object_load(
git_revwalk_repository(walk), rb_commit, GIT_OBJ_COMMIT);
git_revwalk_hide(walk, git_object_id((git_object *)commit));
return Qnil;
}
static VALUE rb_git_walker_sorting(VALUE self, VALUE ruby_sort_mode)
{
git_revwalk *walk;
Data_Get_Struct(self, git_revwalk, walk);
git_revwalk_sorting(walk, FIX2INT(ruby_sort_mode));
return Qnil;
}
static VALUE rb_git_walker_reset(VALUE self)
{
git_revwalk *walk;
Data_Get_Struct(self, git_revwalk, walk);
git_revwalk_reset(walk);
return Qnil;
}
void Init_rugged_revwalk()
{
rb_cRuggedWalker = rb_define_class_under(rb_mRugged, "Walker", rb_cObject);
rb_define_singleton_method(rb_cRuggedWalker, "new", rb_git_walker_new, 1);
rb_define_method(rb_cRuggedWalker, "push", rb_git_walker_push, 1);
rb_define_method(rb_cRuggedWalker, "each", rb_git_walker_each, 0);
rb_define_method(rb_cRuggedWalker, "walk", rb_git_walker_each, 0);
rb_define_method(rb_cRuggedWalker, "hide", rb_git_walker_hide, 1);
rb_define_method(rb_cRuggedWalker, "reset", rb_git_walker_reset, 0);
rb_define_method(rb_cRuggedWalker, "sorting", rb_git_walker_sorting, 1);
}