did some stuff, will probably refactor later

This commit is contained in:
Jozef Nagy 2025-05-11 22:20:45 +02:00
parent 10ee4fcbd9
commit bc4ec556e2
Signed by untrusted user who does not match committer: crz
GPG key ID: 459A4811CEAC7068
46 changed files with 1013 additions and 35635 deletions

41
boot/include/data/da.h Normal file
View file

@ -0,0 +1,41 @@
/*********************************************************************************/
/* Module Name: da.b */
/* Project: AurixOS */
/* */
/* Copyright (c) 2024-2025 Jozef Nagy */
/* */
/* This source is subject to the MIT License. */
/* See License.txt in the root of this repository. */
/* All other rights reserved. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR */
/* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, */
/* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE */
/* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER */
/* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, */
/* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE */
/* SOFTWARE. */
/*********************************************************************************/
#ifndef _DATA_DA_H
#define _DATA_DA_H
#include <mm/mman.h>
#include <print.h>
#include <stddef.h>
#include <efilib.h>
#define DA_INIT_CAPACITY 8192
#define DA_REALLOC(oldptr, newsz) mem_realloc(oldptr, newsz)
#define da_append(da, item) \
do {\
if ((da)->count >= (da)->capacity) { \
size_t new_capacity = (da)->capacity + DA_INIT_CAPACITY; \
(da)->items = DA_REALLOC((da)->items, new_capacity * sizeof((da)->items[0])); \
(da)->capacity = new_capacity; \
} \
(da)->items[(da)->count++] = (item); \
} while (0)
#endif /* _DATA_DA_H */

45
boot/include/data/list.h Normal file
View file

@ -0,0 +1,45 @@
/*********************************************************************************/
/* Module Name: list.h */
/* Project: AurixOS */
/* */
/* Copyright (c) 2024-2025 Jozef Nagy */
/* */
/* This source is subject to the MIT License. */
/* See License.txt in the root of this repository. */
/* All other rights reserved. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR */
/* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, */
/* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE */
/* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER */
/* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, */
/* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE */
/* SOFTWARE. */
/*********************************************************************************/
#ifndef _DATA_LIST_H
#define _DATA_LIST_H
#include <stdint.h>
typedef struct _ListNode {
void *data;
struct _ListNode *prev;
struct _ListNode *next;
} ListNode;
typedef struct _List {
uint32_t count;
ListNode *root;
} List;
List *list_new();
int list_add(List *list, void *data);
void *list_remove_at(List *list, uint32_t idx);
ListNode *listnode_new(void *data);
void *list_get_at(List *list, uint32_t idx);
#endif /* _DATA_LIST_H */