mirror of
https://github.com/subhobhai943/SUB-OS.git
synced 2026-10-25 16:52:29 +00:00
Initial commit: SUB-OS 64-Bit Production Monolithic Operating System with LazyBox userland suite
This commit is contained in:
commit
cd9c786d14
88 files changed
+7132
No files matched your search
@@ -0,0 +1,26 @@
|
||||
#ifndef _LIB_BITMAP_H
|
||||
#define _LIB_BITMAP_H
|
||||
|
||||
#include <stdint.h>
|
||||
#include <stddef.h>
|
||||
#include <stdbool.h>
|
||||
|
||||
typedef uint64_t bitmap_word_t;
|
||||
#define BITS_PER_WORD (sizeof(bitmap_word_t) * 8)
|
||||
|
||||
static inline void bitmap_set(bitmap_word_t* map, size_t bit) {
|
||||
map[bit / BITS_PER_WORD] |= ((bitmap_word_t)1 << (bit % BITS_PER_WORD));
|
||||
}
|
||||
|
||||
static inline void bitmap_clear(bitmap_word_t* map, size_t bit) {
|
||||
map[bit / BITS_PER_WORD] &= ~((bitmap_word_t)1 << (bit % BITS_PER_WORD));
|
||||
}
|
||||
|
||||
static inline bool bitmap_test(const bitmap_word_t* map, size_t bit) {
|
||||
return (map[bit / BITS_PER_WORD] & ((bitmap_word_t)1 << (bit % BITS_PER_WORD))) != 0;
|
||||
}
|
||||
|
||||
int64_t bitmap_find_first_free(const bitmap_word_t* map, size_t total_bits);
|
||||
int64_t bitmap_find_contiguous_free(const bitmap_word_t* map, size_t total_bits, size_t count);
|
||||
|
||||
#endif // _LIB_BITMAP_H
|
||||
@@ -0,0 +1,56 @@
|
||||
#ifndef _LIB_LIST_H
|
||||
#define _LIB_LIST_H
|
||||
|
||||
#include <stddef.h>
|
||||
|
||||
struct list_head {
|
||||
struct list_head *next, *prev;
|
||||
};
|
||||
|
||||
#define LIST_HEAD_INIT(name) { &(name), &(name) }
|
||||
#define LIST_HEAD(name) struct list_head name = LIST_HEAD_INIT(name)
|
||||
|
||||
static inline void INIT_LIST_HEAD(struct list_head *list) {
|
||||
list->next = list;
|
||||
list->prev = list;
|
||||
}
|
||||
|
||||
static inline void __list_add(struct list_head *new_node,
|
||||
struct list_head *prev,
|
||||
struct list_head *next) {
|
||||
next->prev = new_node;
|
||||
new_node->next = next;
|
||||
new_node->prev = prev;
|
||||
prev->next = new_node;
|
||||
}
|
||||
|
||||
static inline void list_add(struct list_head *new_node, struct list_head *head) {
|
||||
__list_add(new_node, head, head->next);
|
||||
}
|
||||
|
||||
static inline void list_add_tail(struct list_head *new_node, struct list_head *head) {
|
||||
__list_add(new_node, head->prev, head);
|
||||
}
|
||||
|
||||
static inline void list_del(struct list_head *entry) {
|
||||
entry->next->prev = entry->prev;
|
||||
entry->prev->next = entry->next;
|
||||
entry->next = NULL;
|
||||
entry->prev = NULL;
|
||||
}
|
||||
|
||||
static inline int list_empty(const struct list_head *head) {
|
||||
return head->next == head;
|
||||
}
|
||||
|
||||
#define list_entry(ptr, type, member) \
|
||||
((type *)((char *)(ptr) - offsetof(type, member)))
|
||||
|
||||
#define list_for_each(pos, head) \
|
||||
for (pos = (head)->next; pos != (head); pos = pos->next)
|
||||
|
||||
#define list_for_each_safe(pos, n, head) \
|
||||
for (pos = (head)->next, n = pos->next; pos != (head); \
|
||||
pos = n, n = pos->next)
|
||||
|
||||
#endif // _LIB_LIST_H
|
||||
@@ -0,0 +1,12 @@
|
||||
#ifndef _LIB_PRINTF_H
|
||||
#define _LIB_PRINTF_H
|
||||
|
||||
#include <stddef.h>
|
||||
#include <stdarg.h>
|
||||
|
||||
int sprintf(char* buf, const char* fmt, ...);
|
||||
int snprintf(char* buf, size_t size, const char* fmt, ...);
|
||||
int vsprintf(char* buf, const char* fmt, va_list args);
|
||||
int vsnprintf(char* buf, size_t size, const char* fmt, va_list args);
|
||||
|
||||
#endif // _LIB_PRINTF_H
|
||||
@@ -0,0 +1,33 @@
|
||||
#ifndef _LIB_STRING_H
|
||||
#define _LIB_STRING_H
|
||||
|
||||
#include <stddef.h>
|
||||
#include <stdint.h>
|
||||
#include <stdbool.h>
|
||||
|
||||
// Memory functions
|
||||
void* memset(void* dest, int val, size_t count);
|
||||
void* memcpy(void* dest, const void* src, size_t count);
|
||||
void* memmove(void* dest, const void* src, size_t count);
|
||||
int memcmp(const void* ptr1, const void* ptr2, size_t num);
|
||||
|
||||
// String functions
|
||||
size_t strlen(const char* str);
|
||||
int strcmp(const char* str1, const char* str2);
|
||||
int strncmp(const char* str1, const char* str2, size_t num);
|
||||
char* strcpy(char* dest, const char* src);
|
||||
char* strncpy(char* dest, const char* src, size_t num);
|
||||
char* strcat(char* dest, const char* src);
|
||||
char* strncat(char* dest, const char* src, size_t num);
|
||||
char* strchr(const char* str, int c);
|
||||
char* strrchr(const char* str, int c);
|
||||
char* strstr(const char* haystack, const char* needle);
|
||||
char* strdup(const char* s);
|
||||
|
||||
// Conversion functions
|
||||
char* itoa(int value, char* str, int base);
|
||||
char* itoa_hex(uint64_t value, char* str);
|
||||
int atoi(const char* str);
|
||||
long strtol(const char* str, char** endptr, int base);
|
||||
|
||||
#endif // _LIB_STRING_H
|
||||
Reference in new issue
Block a user