rbraun/x15.git - The X15 microkernel

Age	Commit message (Collapse)	Author
2017-05-31	Move limits.h to the include directory	Richard Braun
	This turns limits.h into a standard header.
2017-05-30	Move assert.h to the include directory	Richard Braun
	This turns assert.h into a standard header.
2017-04-29	Revert "Remove unneeded quotes when using #error"	Richard Braun
	This reverts commit b1aa94d0c7dba4138f651e6b081c1a0055ea8d54. New occurrences of #error are also affected by this commit.
2017-03-13	Remove unneeded quotes when using #error	Richard Braun

2017-02-04	Clean up compilation	Richard Braun
	Instead of mixing standard headers and internal redefinitions of standard types, completely rely on the compiler for what is guaranteed for a free standing environment. This results in the removal of kern/stddef.h and kern/stdint.h. The kern/types.h header is reintroduced for the different (and saner) purpose of defining types not specified in standard C, namely ssize_t for now.
2017-01-26	kern/{llsync,rdxtree}: don't use llsync until it's ready	Richard Braun

2017-01-26	kern/rdxtree: reintroduce the rdxtree module	Richard Braun

2014-05-24	kern/rdxtree: remove module	Richard Braun
	This module is currently unused and it is likely that a radix tree won't be easy to use as a generic library in the kernel. This means the code is very likely to return, tightly integrated as part of other modules.
2013-07-05	kern/rdxtree: specify tree as const when looking up	Richard Braun

2013-07-05	kern/rdxtree: use 64-bit keys	Richard Braun

2013-07-05	kern/rdxtree: minor comment updates	Richard Braun

2013-07-05	kern/rdxtree: change definition of rdxtree_bm_t	Richard Braun
	When the radix value is 6, always typedef to unsigned long long.
2013-06-09	kern/rdxtree: use a constructor for internal nodes	Richard Braun
	A tree node is larger than 512 bytes on a 64-bit machine. Initializing it on each allocation can get noticeably slow in case there is hysteresis.
2013-06-09	kern/rdxtree: new module	Richard Braun
	This module implements radix trees, a data structure consisting of a tree of arrays which can store many items while guaranteeing a small maximum tree height.