mirror of
https://github.com/git-for-windows/git.git
synced 2026-06-27 00:58:30 -05:00
9759608622
The Git project is not exactly the easiest project to get started in: it's written in C and POSIX shell, with bits of Perl, Rust and other languages sprinkled into it. On top of that, the project has grown somewhat organically over time, making the codebase hard to navigate. These are problems that we're aware of, and there have been and still are efforts to clean up some of the technical debt that is natural to exist an a project that is more than 20 years old. Furthermore, we provide resources to newcomers that help them out like our coding guidelines, code of conduct or "MyFirstContribution.adoc". But there is a rather practical problem: finding your way around in our project's tree is not easy. Doing a directory listing in the top-level directory will present you with more than 550 files, which makes it extremely hard for a newcomer to figure out what files they are even supposed to look at. This makes the onboarding experience somewhat harder than it really needs to be. This isn't only a problem for newcomers though, as I myself struggle to find the files I am looking for because of the sheer number of files. Besides the problem of discoverability it also creates a problem of structure. It is not obvious at all which files are part of "libgit.a" and which files are only linked into our final executables. So while we have this split in our build systems, that split is not evident at all in our tree. Introduce a new "lib/" directory and move all of our sources for "libgit.a" into it to fix these issues. It makes the split we have evident and reduces the number of files in our top-level tree from 550 files to ~80 files. This is still a lot of files, but it's significantly easier to navigate already. Furthermore, we can further iterate after this step and think about introducing a better structure for remaining files, as well. Signed-off-by: Patrick Steinhardt <ps@pks.im> Signed-off-by: Junio C Hamano <gitster@pobox.com>
106 lines
3.1 KiB
C
106 lines
3.1 KiB
C
#ifndef COMMIT_SLAB_IMPL_H
|
|
#define COMMIT_SLAB_IMPL_H
|
|
|
|
#define implement_static_commit_slab(slabname, elemtype) \
|
|
implement_commit_slab(slabname, elemtype, MAYBE_UNUSED static)
|
|
|
|
#define implement_shared_commit_slab(slabname, elemtype) \
|
|
implement_commit_slab(slabname, elemtype, )
|
|
|
|
#define implement_commit_slab(slabname, elemtype, scope) \
|
|
\
|
|
scope void init_ ##slabname## _with_stride(struct slabname *s, \
|
|
unsigned stride) \
|
|
{ \
|
|
unsigned int elem_size; \
|
|
if (!stride) \
|
|
stride = 1; \
|
|
s->stride = stride; \
|
|
elem_size = sizeof(elemtype) * stride; \
|
|
s->slab_size = COMMIT_SLAB_SIZE / elem_size; \
|
|
s->slab_count = 0; \
|
|
s->slab = NULL; \
|
|
} \
|
|
\
|
|
scope void init_ ##slabname(struct slabname *s) \
|
|
{ \
|
|
init_ ##slabname## _with_stride(s, 1); \
|
|
} \
|
|
\
|
|
scope void clear_ ##slabname(struct slabname *s) \
|
|
{ \
|
|
unsigned int i; \
|
|
for (i = 0; i < s->slab_count; i++) \
|
|
free(s->slab[i]); \
|
|
s->slab_count = 0; \
|
|
FREE_AND_NULL(s->slab); \
|
|
} \
|
|
\
|
|
scope void deep_clear_ ##slabname(struct slabname *s, void (*free_fn)(elemtype *)) \
|
|
{ \
|
|
unsigned int i; \
|
|
for (i = 0; i < s->slab_count; i++) { \
|
|
unsigned int j; \
|
|
if (!s->slab[i]) \
|
|
continue; \
|
|
for (j = 0; j < s->slab_size; j++) \
|
|
free_fn(&s->slab[i][j * s->stride]); \
|
|
} \
|
|
clear_ ##slabname(s); \
|
|
} \
|
|
\
|
|
scope elemtype *slabname## _at_peek(struct slabname *s, \
|
|
const struct commit *c, \
|
|
int add_if_missing) \
|
|
{ \
|
|
unsigned int nth_slab, nth_slot; \
|
|
\
|
|
nth_slab = c->index / s->slab_size; \
|
|
nth_slot = c->index % s->slab_size; \
|
|
\
|
|
if (s->slab_count <= nth_slab) { \
|
|
unsigned int i; \
|
|
if (!add_if_missing) \
|
|
return NULL; \
|
|
REALLOC_ARRAY(s->slab, nth_slab + 1); \
|
|
for (i = s->slab_count; i <= nth_slab; i++) \
|
|
s->slab[i] = NULL; \
|
|
s->slab_count = nth_slab + 1; \
|
|
} \
|
|
if (!s->slab[nth_slab]) { \
|
|
if (!add_if_missing) \
|
|
return NULL; \
|
|
s->slab[nth_slab] = xcalloc(s->slab_size, \
|
|
sizeof(**s->slab) * s->stride); \
|
|
} \
|
|
return &s->slab[nth_slab][nth_slot * s->stride]; \
|
|
} \
|
|
\
|
|
scope elemtype *slabname## _at(struct slabname *s, \
|
|
const struct commit *c) \
|
|
{ \
|
|
return slabname##_at_peek(s, c, 1); \
|
|
} \
|
|
\
|
|
scope elemtype *slabname## _peek(struct slabname *s, \
|
|
const struct commit *c) \
|
|
{ \
|
|
return slabname##_at_peek(s, c, 0); \
|
|
} \
|
|
\
|
|
struct slabname
|
|
|
|
/*
|
|
* Note that this redundant forward declaration is required
|
|
* to allow a terminating semicolon, which makes instantiations look
|
|
* like function declarations. I.e., the expansion of
|
|
*
|
|
* implement_commit_slab(indegree, int, static);
|
|
*
|
|
* ends in 'struct indegree;'. This would otherwise
|
|
* be a syntax error according (at least) to ISO C. It's hard to
|
|
* catch because GCC silently parses it by default.
|
|
*/
|
|
|
|
#endif /* COMMIT_SLAB_IMPL_H */
|