[PATCH v4 05/10] repo: add structure topology and path-depth metrics
- From
- Eslam reda ragheb via GitGitGadget <gitgitgadget@gmail.com>
- Date
- Feb 26, 2026, 21:14 UTC
- Message-ID
- <4b502925c9d70d37e0752fadfe061f1cdf692488.1772140487.git.gitgitgadget@gmail.com>
- In-Reply-To
- <pull.2208.v4.git.git.1772140487.gitgitgadget@gmail.com>
From: Eslam reda ragheb <eslam.reda.div@gmail.com>
Track additional structure-oriented maxima that are useful when diagnosing unusually complex histories.
These include commit parent fanout, tree entry count, blob path length/depth, and annotated tag chain depth.
The counters are gathered while traversing reachable objects and are reported in both table and keyvalue output.
This lets both humans and scripts consume the same topology signals.
Signed-off-by: Eslam reda ragheb <eslam.reda.div@gmail.com> --- builtin/repo.c | 171 ++++++++++++++++++++++++++++++++++++++++++++++++- 1 file changed, 170 insertions(+), 1 deletion(-)
diff --git a/builtin/repo.c b/builtin/repo.c index a2fc3fd8cc..f92c209469 100644 --- a/builtin/repo.c +++ b/builtin/repo.c @@ -17,6 +17,7 @@ #include "string-list.h" #include "shallow.h" #include "submodule.h" +#include "tree-walk.h" #include "utf8.h" static const char *const repo_usage[] = { @@ -429,6 +430,11 @@ struct object_stats { struct object_values max_inflated_sizes; struct object_values disk_sizes; struct object_values max_disk_sizes; + size_t max_commit_parent_count; + size_t max_tree_entry_count; + size_t max_blob_path_length; + size_t max_blob_path_depth; + size_t max_tag_chain_depth; }; struct repo_structure { @@ -545,6 +551,116 @@ static inline size_t get_max_object_value(struct object_values *values) return max; } +static size_t get_commit_parent_count(struct repository *repo, + const struct object_id *oid) +{ + unsigned long size = 0; + const char *cur; + const char *end; + void *buf; + size_t count = 0; + + buf = odb_read_object_peeled(repo->objects, oid, OBJ_COMMIT, &size, NULL); + if (!buf) + return 0; + + cur = buf; + end = cur + size; + while (cur < end) { + const char *newline = memchr(cur, '\n', end - cur); + size_t line_len; + + if (!newline) + break; + line_len = newline - cur; + if (!line_len) + break; + + if (line_len > 7 && !memcmp(cur, "parent ", 7)) + count++; + + cur = newline + 1; + } + + free(buf); + return count; +} + +static size_t get_tree_entry_count(struct repository *repo, + const struct object_id *oid) +{ + struct tree_desc desc; + struct name_entry entry; + unsigned long size = 0; + void *buf; + size_t count = 0; + + buf = odb_read_object_peeled(repo->objects, oid, OBJ_TREE, &size, NULL); + if (!buf) + return 0; + + init_tree_desc(&desc, oid, buf, size); + while (tree_entry(&desc, &entry)) + count++; + + free(buf); + return count; +} + +static size_t get_path_depth(const char *path) +{ + size_t depth = 0; + + if (!path || !*path) + return 0; + + depth = 1; + for (const char *cur = path; *cur; cur++) + if (*cur == '/') + depth++; + + return depth; +} + +static size_t get_tag_chain_depth(struct repository *repo, + const struct object_id *oid) +{ + struct object_id current = *oid; + size_t depth = 0; + + while (1) { + enum object_type type; + unsigned long size = 0; + struct object_id next; + const char *p, *end; + void *buf = odb_read_object(repo->objects, ¤t, &type, &size); + + if (!buf) + break; + if (type != OBJ_TAG) { + free(buf); + break; + } + + p = buf; + if (!skip_prefix(p, "object ", &p) || + parse_oid_hex_algop(p, &next, &end, repo->hash_algo) || + *end != '\n') { + free(buf); + break; + } + + depth++; + free(buf); + + if (oideq(&next, ¤t)) + break; + oidcpy(¤t, &next); + } + + return depth; +} + static void stats_table_setup_structure(struct stats_table *table, struct repo_structure *stats) { @@ -619,6 +735,17 @@ static void stats_table_setup_structure(struct stats_table *table, " * %s", _("Blobs")); stats_table_size_addf(table, objects->max_disk_sizes.tags, " * %s", _("Tags")); + + stats_table_count_addf(table, objects->max_commit_parent_count, + " * %s", _("Largest parent count")); + stats_table_count_addf(table, objects->max_tree_entry_count, + " * %s", _("Largest tree entries")); + stats_table_count_addf(table, objects->max_blob_path_length, + " * %s", _("Longest blob path")); + stats_table_count_addf(table, objects->max_blob_path_depth, + " * %s", _("Deepest blob path")); + stats_table_count_addf(table, objects->max_tag_chain_depth, + " * %s", _("Deepest tag chain")); } static void stats_table_print_structure(const struct stats_table *table) @@ -749,6 +876,17 @@ static void structure_keyvalue_print(struct repo_structure *stats, printf("objects.tags.max_disk_size%c%" PRIuMAX "%c", key_delim, (uintmax_t)stats->objects.max_disk_sizes.tags, value_delim); + printf("objects.commits.max_parent_count%c%" PRIuMAX "%c", key_delim, + (uintmax_t)stats->objects.max_commit_parent_count, value_delim); + printf("objects.trees.max_entry_count%c%" PRIuMAX "%c", key_delim, + (uintmax_t)stats->objects.max_tree_entry_count, value_delim); + printf("objects.blobs.max_path_length%c%" PRIuMAX "%c", key_delim, + (uintmax_t)stats->objects.max_blob_path_length, value_delim); + printf("objects.blobs.max_path_depth%c%" PRIuMAX "%c", key_delim, + (uintmax_t)stats->objects.max_blob_path_depth, value_delim); + printf("objects.tags.max_chain_depth%c%" PRIuMAX "%c", key_delim, + (uintmax_t)stats->objects.max_tag_chain_depth, value_delim); + printf("objects.commits.disk_size%c%" PRIuMAX "%c", key_delim, (uintmax_t)stats->objects.disk_sizes.commits, value_delim); printf("objects.trees.disk_size%c%" PRIuMAX "%c", key_delim, @@ -826,7 +964,7 @@ struct count_objects_data { struct progress *progress; }; -static int count_objects(const char *path UNUSED, struct oid_array *oids, +static int count_objects(const char *path, struct oid_array *oids, enum object_type type, void *cb_data) { struct count_objects_data *data = cb_data; @@ -862,6 +1000,13 @@ static int count_objects(const char *path UNUSED, struct oid_array *oids, switch (type) { case OBJ_TAG: + for (size_t i = 0; i < oids->nr; i++) { + size_t tag_chain_depth = get_tag_chain_depth(data->odb->repo, + &oids->oid[i]); + if (tag_chain_depth > stats->max_tag_chain_depth) + stats->max_tag_chain_depth = tag_chain_depth; + } + stats->type_counts.tags += oids->nr; stats->inflated_sizes.tags += inflated_total; if (max_inflated > stats->max_inflated_sizes.tags) @@ -871,6 +1016,13 @@ static int count_objects(const char *path UNUSED, struct oid_array *oids, stats->max_disk_sizes.tags = max_disk; break; case OBJ_COMMIT: + for (size_t i = 0; i < oids->nr; i++) { + size_t parent_count = get_commit_parent_count(data->odb->repo, + &oids->oid[i]); + if (parent_count > stats->max_commit_parent_count) + stats->max_commit_parent_count = parent_count; + } + stats->type_counts.commits += oids->nr; stats->inflated_sizes.commits += inflated_total; if (max_inflated > stats->max_inflated_sizes.commits) @@ -880,6 +1032,13 @@ static int count_objects(const char *path UNUSED, struct oid_array *oids, stats->max_disk_sizes.commits = max_disk; break; case OBJ_TREE: + for (size_t i = 0; i < oids->nr; i++) { + size_t entry_count = get_tree_entry_count(data->odb->repo, + &oids->oid[i]); + if (entry_count > stats->max_tree_entry_count) + stats->max_tree_entry_count = entry_count; + } + stats->type_counts.trees += oids->nr; stats->inflated_sizes.trees += inflated_total; if (max_inflated > stats->max_inflated_sizes.trees) @@ -889,6 +1048,16 @@ static int count_objects(const char *path UNUSED, struct oid_array *oids, stats->max_disk_sizes.trees = max_disk; break; case OBJ_BLOB: + if (path && *path) { + size_t path_len = strlen(path); + size_t path_depth = get_path_depth(path); + + if (path_len > stats->max_blob_path_length) + stats->max_blob_path_length = path_len; + if (path_depth > stats->max_blob_path_depth) + stats->max_blob_path_depth = path_depth; + } + stats->type_counts.blobs += oids->nr; stats->inflated_sizes.blobs += inflated_total; if (max_inflated > stats->max_inflated_sizes.blobs)
-- gitgitgadget