1
0
mirror of git://projects.qi-hardware.com/eda-tools.git synced 2024-12-23 13:51:09 +02:00
eda-tools/eeshow/git-hist.c
2016-08-12 14:43:28 -03:00

274 lines
5.8 KiB
C

/*
* git-hist.c - Retrieve revision history from GIT repo
*
* Written 2016 by Werner Almesberger
* Copyright 2016 by Werner Almesberger
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*/
#include <stddef.h>
#include <stdlib.h>
#include <stdio.h>
#include <time.h> /* for vcs_long_for_pango */
#include <alloca.h>
#include "util.h"
#include "diag.h"
#include "fmt-pango.h" /* for vcs_long_for_pango */
#include "git-util.h"
#include "git-file.h"
#include "git-hist.h"
/*
* @@@ we assume to have a single head. That isn't necessarily true, since
* each open branch has its own head. Getting this right is for further study.
*/
static struct hist *new_commit(unsigned branch)
{
struct hist *h;
h = alloc_type(struct hist);
h->commit = NULL;
h->branch = branch;
h->newer = NULL;
h->n_newer = 0;
h->older = NULL;
h->n_older = 0;
return h;
}
static void uplink(struct hist *down, struct hist *up)
{
down->newer = realloc(down->newer,
sizeof(struct hist *) * (down->n_newer + 1));
if (!down->newer)
diag_pfatal("realloc");
down->newer[down->n_newer++] = up;
}
static struct hist *find_commit(struct hist *h, const git_commit *commit)
{
unsigned i;
struct hist *found;
/*
* @@@ should probably use
* git_oid_equal(git_object_id(a), git_object_id(b))
*/
if (h->commit == commit)
return h;
for (i = 0; i != h->n_older; i++) {
if (h->older[i]->newer[0] != h)
continue;
found = find_commit(h->older[i], commit);
if (found)
return found;
}
return NULL;
}
static void recurse(struct hist *h,
unsigned n_branches, struct hist **branches)
{
unsigned n, i, j;
struct hist **b;
const git_error *e;
n = git_commit_parentcount(h->commit);
if (verbose > 2)
progress(3, "commit %p: %u + %u\n", h->commit, n_branches, n);
b = alloca(sizeof(struct hist) * (n_branches - 1 + n));
n_branches--;
memcpy(b, branches, sizeof(struct hist *) * n_branches);
h->older = alloc_type_n(struct hist *, n);
h->n_older = n;
for (i = 0; i != n; i++) {
git_commit *commit;
struct hist *found = NULL;
if (git_commit_parent(&commit, h->commit, i)) {
e = giterr_last();
fatal("git_commit_parent: %s\n", e->message);
}
for (j = 0; j != n_branches; j++) {
found = find_commit(b[j], commit);
if (found)
break;
}
if (found) {
uplink(found, h);
h->older[i] = found;
} else {
struct hist *new;
new = new_commit(n_branches);
new->commit = commit;
h->older[i] = new;
b[n_branches++] = new;
uplink(new, h);
recurse(new, n_branches, b);
}
}
}
bool vcs_git_try(const char *path)
{
git_repository *repo;
git_init_once();
if (git_repository_open_ext(&repo, path,
GIT_REPOSITORY_OPEN_CROSS_FS, NULL))
return 0;
return !git_repository_is_empty(repo);
}
struct hist *vcs_git_hist(const char *path)
{
struct hist *head, *dirty;
git_repository *repo;
git_oid oid;
const git_error *e;
head = new_commit(0);
git_init_once();
if (git_repository_open_ext(&repo, path,
GIT_REPOSITORY_OPEN_CROSS_FS, NULL)) {
e = giterr_last();
fatal("%s: %s\n", path, e->message);
}
if (git_reference_name_to_id(&oid, repo, "HEAD")) {
e = giterr_last();
fatal("%s: %s\n", git_repository_path(repo), e->message);
}
if (git_commit_lookup(&head->commit, repo, &oid)) {
e = giterr_last();
fatal("%s: %s\n", git_repository_path(repo), e->message);
}
recurse(head, 1, &head);
if (!git_repo_is_dirty(repo))
return head;
dirty = new_commit(0);
dirty->older = alloc_type(struct hist *);
dirty->older[0] = head;
dirty->n_older = 1;
uplink(head, dirty);
return dirty;
}
char *vcs_git_get_rev(struct hist *h)
{
const git_oid *oid = git_commit_id(h->commit);
char *s = alloc_size(GIT_OID_HEXSZ + 1);
return git_oid_tostr(s, GIT_OID_HEXSZ + 1, oid);
}
const char *vcs_git_summary(struct hist *h)
{
const char *summary;
const git_error *e;
if (!h->commit)
return "Uncommitted changes";
summary = git_commit_summary(h->commit);
if (summary)
return summary;
e = giterr_last();
fatal("git_commit_summary: %s\n", e->message);
}
/*
* @@@ This one is a bit inconvenient. It depends both on the information the
* VCS provides, some of which is fairly generic, but some may not be, and
* the very specific constraints imposed by the markup format of Pango.
*/
char *vcs_git_long_for_pango(struct hist *h)
{
const git_error *e;
git_buf buf = { 0 };
time_t commit_time;
const git_signature *sig;
char *s;
if (!h->commit)
return stralloc("Uncommitted changes");
if (git_object_short_id(&buf, (git_object *) h->commit))
goto fail;
commit_time = git_commit_time(h->commit);
sig = git_commit_committer(h->commit);
s = fmt_pango("<b>%s</b> %s%s &lt;%s&gt;<small>\n%s</small>",
buf.ptr, ctime(&commit_time), sig->name, sig->email,
git_commit_summary(h->commit));
git_buf_free(&buf);
return s;
fail:
e = giterr_last();
fatal("vcs_git_long_for_pango: %s\n", e->message);
}
void hist_iterate(struct hist *h,
void (*fn)(void *user, struct hist *h), void *user)
{
unsigned i;
fn(user, h);
for (i = 0; i != h->n_older; i++)
if (h->older[i]->newer[h->older[i]->n_newer - 1] == h)
hist_iterate(h->older[i], fn, user);
}
void dump_hist(struct hist *h)
{
git_buf buf = { 0 };
const git_error *e;
unsigned i;
if (h->commit) {
if (git_object_short_id(&buf, (git_object *) h->commit)) {
e = giterr_last();
fatal("git_object_short_id: %s\n", e->message);
}
printf("%*s%s %s\n",
2 * h->branch, "", buf.ptr, vcs_git_summary(h));
git_buf_free(&buf);
} else {
printf("dirty\n");
}
for (i = 0; i != h->n_older; i++)
if (h->older[i]->newer[h->older[i]->n_newer - 1] == h)
dump_hist(h->older[i]);
}