2 * This file is free software; you can redistribute it and/or modify
3 * it under the terms of the GNU General Public License, version 2,
4 * as published by the Free Software Foundation.
6 * In addition to the permissions in the GNU General Public License,
7 * the authors give you unlimited permission to link the compiled
8 * version of this file into combinations with other programs,
9 * and to distribute those combinations without any restriction
10 * coming from the use of this file. (The General Public License
11 * restrictions do apply in other respects; for example, they cover
12 * modification of the file, and distribution when not linked into
13 * a combined executable.)
15 * This file is distributed in the hope that it will be useful, but
16 * WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; see the file COPYING. If not, write to
22 * the Free Software Foundation, 51 Franklin Street, Fifth Floor,
23 * Boston, MA 02110-1301, USA.
26 #include "test_helpers.h"
29 $ git log --oneline --graph --decorate
30 * a4a7dce (HEAD, br2) Merge branch 'master' into br2
32 | * 9fd738e (master) a fourth commit
33 | * 4a202b3 a third commit
34 * | c47800c branch commit one
36 * 5b5b025 another commit
39 static const char *commit_head
= "a4a7dce85cf63874e984719f4fdd239f5145052f";
41 static const char *commit_ids
[] = {
42 "a4a7dce85cf63874e984719f4fdd239f5145052f", /* 0 */
43 "9fd738e8f7967c078dceed8190330fc8648ee56a", /* 1 */
44 "4a202b346bb0fb0db7eff3cffeb3c70babbd2045", /* 2 */
45 "c47800c7266a2be04c571c04d5a6614691ea99bd", /* 3 */
46 "8496071c1b46c854b31185ea97743be6a8774479", /* 4 */
47 "5b5b025afb0b4c913b4c338a42934a3863bf3644", /* 5 */
50 /* Careful: there are two possible topological sorts */
51 static const int commit_sorting_topo
[][6] = {
52 {0, 1, 2, 3, 5, 4}, {0, 3, 1, 2, 5, 4}
55 static const int commit_sorting_time
[][6] = {
59 static const int commit_sorting_topo_reverse
[][6] = {
60 {4, 5, 3, 2, 1, 0}, {4, 5, 2, 1, 3, 0}
63 static const int commit_sorting_time_reverse
[][6] = {
67 #define commit_count 6
68 static const int result_bytes
= 24;
71 static int get_commit_index(git_oid
*raw_oid
)
76 git_oid_fmt(oid
, raw_oid
);
78 for (i
= 0; i
< commit_count
; ++i
)
79 if (memcmp(oid
, commit_ids
[i
], 40) == 0)
85 static int test_walk(git_revwalk
*walk
, const git_oid
*root
,
86 int flags
, const int possible_results
[][6], int results_count
)
91 int result_array
[commit_count
];
93 git_revwalk_sorting(walk
, flags
);
94 git_revwalk_push(walk
, root
);
96 for (i
= 0; i
< commit_count
; ++i
)
101 while (git_revwalk_next(&oid
, walk
) == GIT_SUCCESS
) {
102 result_array
[i
++] = get_commit_index(&oid
);
105 git_oid_fmt(str, &oid);
107 printf(" %d) %s\n", i, str);
111 for (i
= 0; i
< results_count
; ++i
)
112 if (memcmp(possible_results
[i
],
113 result_array
, result_bytes
) == 0)
119 BEGIN_TEST(walk0
, "do a simple walk on a repo with different sorting modes")
121 git_repository
*repo
;
124 must_pass(git_repository_open(&repo
, REPOSITORY_FOLDER
));
125 must_pass(git_revwalk_new(&walk
, repo
));
127 git_oid_fromstr(&id
, commit_head
);
129 must_pass(test_walk(walk
, &id
, GIT_SORT_TIME
, commit_sorting_time
, 1));
130 must_pass(test_walk(walk
, &id
, GIT_SORT_TOPOLOGICAL
, commit_sorting_topo
, 2));
131 must_pass(test_walk(walk
, &id
, GIT_SORT_TIME
| GIT_SORT_REVERSE
, commit_sorting_time_reverse
, 1));
132 must_pass(test_walk(walk
, &id
, GIT_SORT_TOPOLOGICAL
| GIT_SORT_REVERSE
, commit_sorting_topo_reverse
, 2));
134 git_revwalk_free(walk
);
135 git_repository_free(repo
);