Skip to content

G
git2
Commit 8b93ccdf by Patrick Steinhardt
Options

examples: general: extract function demonstrating revwalking

parent c079e3c8
Showing with 53 additions and 39 deletions
examples/general.c
...@@ -43,6 +43,7 @@ ...@@ -43,6 +43,7 @@
#include <stdio.h> #include <stdio.h>
#include <string.h> #include <string.h>
static void revwalking(git_repository *repo);
static void index_walking(git_repository *repo); static void index_walking(git_repository *repo);
static void reference_listing(git_repository *repo); static void reference_listing(git_repository *repo);
static void config_files(const char *repo_path); static void config_files(const char *repo_path);
...@@ -373,43 +374,63 @@ int main (int argc, char** argv) ...@@ -373,43 +374,63 @@ int main (int argc, char** argv)
printf("Blob Size: %ld\n", (long)git_blob_rawsize(blob)); // 8 printf("Blob Size: %ld\n", (long)git_blob_rawsize(blob)); // 8
git_blob_rawcontent(blob); // "content" git_blob_rawcontent(blob); // "content"
// ### Revwalking revwalking(repo);
index_walking(repo);
reference_listing(repo);
config_files(repo_path);
// The libgit2 [revision walking api][rw] provides methods to traverse the // Finally, when you're done with the repository, you can free it as well.
// directed graph created by the parent pointers of the commit objects. git_repository_free(repo);
// Since all commits point back to the commit that came directly before
// them, you can walk this parentage as a graph and find all the commits
// that were ancestors of (reachable from) a given starting point. This
// can allow you to create `git log` type functionality.
//
// [rw]: http://libgit2.github.com/libgit2/#HEAD/group/revwalk
printf("\n*Revwalking*\n"); return 0;
}
/**
* ### Revwalking
*
* The libgit2 [revision walking api][rw] provides methods to traverse the
* directed graph created by the parent pointers of the commit objects.
* Since all commits point back to the commit that came directly before
* them, you can walk this parentage as a graph and find all the commits
* that were ancestors of (reachable from) a given starting point. This
* can allow you to create `git log` type functionality.
*
* [rw]: http://libgit2.github.com/libgit2/#HEAD/group/revwalk
*/
static void revwalking(git_repository *repo)
{
const git_signature *cauth;
const char *cmsg;
int error;
git_revwalk *walk; git_revwalk *walk;
git_commit *wcommit; git_commit *wcommit;
git_oid oid;
printf("\n*Revwalking*\n");
git_oid_fromstr(&oid, "5b5b025afb0b4c913b4c338a42934a3863bf3644"); git_oid_fromstr(&oid, "5b5b025afb0b4c913b4c338a42934a3863bf3644");
// To use the revwalker, create a new walker, tell it how you want to sort /**
// the output and then push one or more starting points onto the walker. * To use the revwalker, create a new walker, tell it how you want to sort
// If you want to emulate the output of `git log` you would push the SHA * the output and then push one or more starting points onto the walker.
// of the commit that HEAD points to into the walker and then start * If you want to emulate the output of `git log` you would push the SHA
// traversing them. You can also 'hide' commits that you want to stop at * of the commit that HEAD points to into the walker and then start
// or not see any of their ancestors. So if you want to emulate `git log * traversing them. You can also 'hide' commits that you want to stop at
// branch1..branch2`, you would push the oid of `branch2` and hide the oid * or not see any of their ancestors. So if you want to emulate `git log
// of `branch1`. * branch1..branch2`, you would push the oid of `branch2` and hide the oid
* of `branch1`.
*/
git_revwalk_new(&walk, repo); git_revwalk_new(&walk, repo);
git_revwalk_sorting(walk, GIT_SORT_TOPOLOGICAL | GIT_SORT_REVERSE); git_revwalk_sorting(walk, GIT_SORT_TOPOLOGICAL | GIT_SORT_REVERSE);
git_revwalk_push(walk, &oid); git_revwalk_push(walk, &oid);
const git_signature *cauth; /**
const char *cmsg; * Now that we have the starting point pushed onto the walker, we start
* asking for ancestors. It will return them in the sorting order we asked
// Now that we have the starting point pushed onto the walker, we start * for as commit oids. We can then lookup and parse the committed pointed
// asking for ancestors. It will return them in the sorting order we asked * at by the returned OID; note that this operation is specially fast
// for as commit oids. We can then lookup and parse the committed pointed * since the raw contents of the commit object will be cached in memory
// at by the returned OID; note that this operation is specially fast */
// since the raw contents of the commit object will be cached in memory
while ((git_revwalk_next(&oid, walk)) == 0) { while ((git_revwalk_next(&oid, walk)) == 0) {
error = git_commit_lookup(&wcommit, repo, &oid); error = git_commit_lookup(&wcommit, repo, &oid);
check_error(error, "looking up commit during revwalk"); check_error(error, "looking up commit during revwalk");
...@@ -421,20 +442,13 @@ int main (int argc, char** argv) ...@@ -421,20 +442,13 @@ int main (int argc, char** argv)
git_commit_free(wcommit); git_commit_free(wcommit);
} }
// Like the other objects, be sure to free the revwalker when you're done /**
// to prevent memory leaks. Also, make sure that the repository being * Like the other objects, be sure to free the revwalker when you're done
// walked it not deallocated while the walk is in progress, or it will * to prevent memory leaks. Also, make sure that the repository being
// result in undefined behavior * walked it not deallocated while the walk is in progress, or it will
* result in undefined behavior
*/
git_revwalk_free(walk); git_revwalk_free(walk);
index_walking(repo);
reference_listing(repo);
config_files(repo_path);
// Finally, when you're done with the repository, you can free it as well.
git_repository_free(repo);
return 0;
} }
/** /**
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment