Fcalva/gint
1
0
Fork 0
mirror of https://git.planet-casio.com/Lephenixnoir/gint.git synced 2024-12-28 20:43:36 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

(typos and TODOs)

Browse source
This commit is contained in:
Lephe 2021-04-20 12:19:24 +02:00
parent 9260925d5f
commit 52bc1fc848
No known key found for this signature in database
GPG key ID: 1BBA026E13FC0495
3 changed files with 3 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
TODO
View file

@ -1,4 +1,5 @@
Extensions on existing code: Extensions on existing code:
* bfile: implement the optimization-restart as realized by Kbd2
* kernel: use GINT_CB() for all callbacks, without breaking the timer API * kernel: use GINT_CB() for all callbacks, without breaking the timer API
* kernel: better restore to userspace before panic (ensure BL=0 IMASK=0) * kernel: better restore to userspace before panic (ensure BL=0 IMASK=0)
* kernel: check if cpu_setVBR() really needs to be perma-mapped * kernel: check if cpu_setVBR() really needs to be perma-mapped

2
include/gint/std/string.h
View file

@ -13,7 +13,7 @@ void *memcpy(void * restrict dest, void const * restrict src, size_t n);
/* memset(): Fill a chunk of memory with a single byte */ /* memset(): Fill a chunk of memory with a single byte */
void *memset(void *dest, int byte, size_t n); void *memset(void *dest, int byte, size_t n);
/* memcpy(): Compare two chunks of memory */ /* memcmp(): Compare two chunks of memory */
int memcmp(void const *s1, void const *s2, size_t n); int memcmp(void const *s1, void const *s2, size_t n);
/* memmove(): Copy a chunk of memory to a possibly overlapping destination */ /* memmove(): Copy a chunk of memory to a possibly overlapping destination */

2
src/kmalloc/arena_gint.c
View file

@ -33,7 +33,7 @@
detect whether to merge into the previous block after a free(). detect whether to merge into the previous block after a free().
The allocation algorithm will mostly use way #3 to find free blocks. When The allocation algorithm will mostly use way #3 to find free blocks. When
freeing, ways #1 and #2 are used to coalese adjacent blocks. Ways #3 and #4 freeing, ways #1 and #2 are used to coalesce adjacent blocks. Ways #3 and #4
are used to maintain the linked lists. are used to maintain the linked lists.
The footer uses 8 bytes if the block has 8 bytes of raw data, and 12 bytes The footer uses 8 bytes if the block has 8 bytes of raw data, and 12 bytes