abdelrahman/wizapp-stdlib
0
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Remove codegen and implement dbl_list as generic container

Browse Source
This commit is contained in:
Abdelrahman Said
2025-04-16 00:07:11 +01:00
parent 0942643b4e
commit 6fb078a868
35 changed files with 552 additions and 1199 deletions
Download Patch File Download Diff File Expand all files Collapse all files

0
codegen/dbl_list/__init__.py
View File

206
codegen/dbl_list/gen_dbl_list.py
View File

@@ -1,206 +0,0 @@
from pathlib import Path
from dataclasses import dataclass, field
from codegen.constants import WAPP_SRC_ROOT
from codegen.utils import load_func_body_from_file
from codegen.datatypes import (
CDataType,
CStruct,
CFunc,
CHeader,
CSource,
CArg,
CType,
CPointer,
CPointerType,
CQualifier,
CInclude,
get_datatype_string,
)
@dataclass
class DblListData:
out_dir: Path
common_includes: list[CInclude] = field(default_factory=list)
hdr_includes: list[CInclude] = field(default_factory=list)
src_includes: list[CInclude] = field(default_factory=list)
common_decl_types: list[CStruct] = field(default_factory=list)
hdr_decl_types: list[CStruct] = field(default_factory=list)
src_decl_types: list[CStruct] = field(default_factory=list)
def gen_dbl_list():
def __format_func_body(filename: Path, type_string: str):
return load_func_body_from_file(filename).format(
T=type_string,
Tupper=type_string.upper(),
Tlower=type_string.lower(),
)
datatypes: dict[CDataType, DblListData] = {
"Str8": DblListData(
common_includes=[
CInclude(header="../../../common/aliases/aliases.h", local=True),
],
src_includes=[
CInclude(header="./str8.h", local=True),
],
hdr_decl_types=[
CStruct(name="str8", cargs=[], typedef_name="Str8"),
],
out_dir=WAPP_SRC_ROOT / "core/strings/str8/",
),
}
snippets_dir = Path(__file__).parent / "snippets"
for _type, dbl_list_data in datatypes.items():
type_string = get_datatype_string(_type)
node = CStruct(
name=f"{type_string}Node",
cargs=[
CArg(name="string", _type=type_string, pointer=CPointer(_type=CPointerType.SINGLE)),
CArg(name="prev", _type=f"{type_string}Node", pointer=CPointer(_type=CPointerType.SINGLE)),
CArg(name="next", _type=f"{type_string}Node", pointer=CPointer(_type=CPointerType.SINGLE)),
],
)
dl_list = CStruct(
name=f"{type_string}List",
cargs=[
CArg(name="first", _type=node, pointer=CPointer(_type=CPointerType.SINGLE)),
CArg(name="last", _type=node, pointer=CPointer(_type=CPointerType.SINGLE)),
CArg(name="total_size", _type=CType.U64),
CArg(name="node_count", _type=CType.U64),
],
)
get_func = CFunc(
name=f"wapp_{type_string.lower()}_list_get",
ret_type=node,
args=[
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE), qualifier=CQualifier.CONST),
CArg(name="index", _type=CType.U64),
],
body=__format_func_body(snippets_dir / "list_get", type_string),
pointer=CPointer(CPointerType.SINGLE),
)
push_front_func = CFunc(
name=f"wapp_{type_string.lower()}_list_push_front",
ret_type=CType.VOID,
args=[
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
CArg(name="node", _type=node, pointer=CPointer(CPointerType.SINGLE)),
],
body=__format_func_body(snippets_dir / "list_push_front", type_string),
)
push_back_func = CFunc(
name=f"wapp_{type_string.lower()}_list_push_back",
ret_type=CType.VOID,
args=[
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
CArg(name="node", _type=node, pointer=CPointer(CPointerType.SINGLE)),
],
body=__format_func_body(snippets_dir / "list_push_back", type_string),
)
insert_func = CFunc(
name=f"wapp_{type_string.lower()}_list_insert",
ret_type=CType.VOID,
args=[
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
CArg(name="node", _type=node, pointer=CPointer(CPointerType.SINGLE)),
CArg(name="index", _type=CType.U64),
],
body=__format_func_body(snippets_dir / "list_insert", type_string),
)
pop_front_func = CFunc(
name=f"wapp_{type_string.lower()}_list_pop_front",
ret_type=node,
args=[
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
],
body=__format_func_body(snippets_dir / "list_pop_front", type_string),
pointer=CPointer(CPointerType.SINGLE),
)
pop_back_func = CFunc(
name=f"wapp_{type_string.lower()}_list_pop_back",
ret_type=node,
args=[
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
],
body=__format_func_body(snippets_dir / "list_pop_back", type_string),
pointer=CPointer(CPointerType.SINGLE),
)
remove_func = CFunc(
name=f"wapp_{type_string.lower()}_list_remove",
ret_type=node,
args=[
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
CArg(name="index", _type=CType.U64),
],
body=__format_func_body(snippets_dir / "list_remove", type_string),
pointer=CPointer(CPointerType.SINGLE),
)
empty_func = CFunc(
name=f"wapp_{type_string.lower()}_list_empty",
ret_type=CType.VOID,
args=[
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
],
body=__format_func_body(snippets_dir / "list_empty", type_string),
)
node_to_list_func = CFunc(
name=f"{type_string.lower()}_node_to_list",
ret_type=dl_list,
args=[
CArg(name="node", _type=node, pointer=CPointer(CPointerType.SINGLE)),
],
body=__format_func_body(snippets_dir / "node_to_list", type_string),
qualifiers=[CQualifier.INTERNAL],
)
header = CHeader(
name=f"{type_string.lower()}_list",
decl_types=dbl_list_data.common_decl_types + dbl_list_data.hdr_decl_types,
includes=[],
types=[node, dl_list],
funcs=[
get_func,
push_front_func,
push_back_func,
insert_func,
pop_front_func,
pop_back_func,
remove_func,
empty_func,
]
)
source = CSource(
name=header.name,
decl_types=dbl_list_data.common_decl_types + dbl_list_data.src_decl_types,
includes=[CInclude(header, local=True, same_dir=True), CInclude(header="stddef.h")],
internal_funcs=[node_to_list_func],
funcs=header.funcs
)
if len(dbl_list_data.common_includes) > 0:
header.includes.extend(dbl_list_data.common_includes)
source.includes.extend(dbl_list_data.common_includes)
if len(dbl_list_data.hdr_includes) > 0:
header.includes.extend(dbl_list_data.hdr_includes)
if len(dbl_list_data.src_includes) > 0:
source.includes.extend(dbl_list_data.src_includes)
header.save(dbl_list_data.out_dir)
source.save(dbl_list_data.out_dir)

8
codegen/dbl_list/snippets/list_empty
View File

@@ -1,8 +0,0 @@
if (!list) {{
return;
}}
u64 count = list->node_count;
for (u64 i = 0; i < count; ++i) {{
wapp_str8_list_pop_back(list);
}}

13
codegen/dbl_list/snippets/list_get
View File

@@ -1,13 +0,0 @@
if (index >= list->node_count) {{
return NULL;
}}
{T}Node *output = NULL;
{T}Node *current = list->first;
for (u64 i = 1; i <= index; ++i) {{
current = current->next;
}}
output = current;
return output;

29
codegen/dbl_list/snippets/list_insert
View File

@@ -1,29 +0,0 @@
if (!list || !node || !(node->string)) {{
return;
}}
if (index == 0) {{
wapp_str8_list_push_front(list, node);
return;
}} else if (index == list->node_count) {{
wapp_str8_list_push_back(list, node);
return;
}}
{T}Node *dst_node = wapp_str8_list_get(list, index);
if (!dst_node) {{
return;
}}
{T}List node_list = {Tlower}_node_to_list(node);
list->total_size += node_list.total_size;
list->node_count += node_list.node_count;
{T}Node *prev = dst_node->prev;
dst_node->prev = node_list.last;
prev->next = node_list.first;
node_list.first->prev = prev;
node_list.last->next = dst_node;

21
codegen/dbl_list/snippets/list_pop_back
View File

@@ -1,21 +0,0 @@
{T}Node *output = NULL;
if (!list || list->node_count == 0) {{
goto RETURN_{Tupper}_LIST_POP_BACK;
}}
output = list->last;
if (list->node_count == 1) {{
*list = ({T}List){{0}};
goto RETURN_{Tupper}_LIST_POP_BACK;
}}
--(list->node_count);
list->total_size -= output->string->size;
list->last = output->prev;
output->prev = output->next = NULL;
RETURN_{Tupper}_LIST_POP_BACK:
return output;

21
codegen/dbl_list/snippets/list_pop_front
View File

@@ -1,21 +0,0 @@
{T}Node *output = NULL;
if (!list || list->node_count == 0) {{
goto RETURN_{Tupper}_LIST_POP_FRONT;
}}
output = list->first;
if (list->node_count == 1) {{
*list = ({T}List){{0}};
goto RETURN_{Tupper}_LIST_POP_FRONT;
}}
--(list->node_count);
list->total_size -= output->string->size;
list->first = output->next;
output->prev = output->next = NULL;
RETURN_{Tupper}_LIST_POP_FRONT:
return output;

21
codegen/dbl_list/snippets/list_push_back
View File

@@ -1,21 +0,0 @@
if (!list || !node || !(node->string)) {{
return;
}}
{T}List node_list = {Tlower}_node_to_list(node);
if (list->node_count == 0) {{
*list = node_list;
return;
}}
list->total_size += node_list.total_size;
list->node_count += node_list.node_count;
{T}Node *last = list->last;
if (last) {{
last->next = node_list.first;
}}
list->last = node_list.last;
node_list.first->prev = last;

21
codegen/dbl_list/snippets/list_push_front
View File

@@ -1,21 +0,0 @@
if (!list || !node || !(node->string)) {{
return;
}}
{T}List node_list = {Tlower}_node_to_list(node);
if (list->node_count == 0) {{
*list = node_list;
return;
}}
list->total_size += node_list.total_size;
list->node_count += node_list.node_count;
{T}Node *first = list->first;
if (first) {{
first->prev = node_list.last;
}}
list->first = node_list.first;
node_list.last->next = first;

28
codegen/dbl_list/snippets/list_remove
View File

@@ -1,28 +0,0 @@
{T}Node *output = NULL;
if (!list) {{
goto RETURN_{Tupper}_LIST_REMOVE;
}}
if (index == 0) {{
output = wapp_str8_list_pop_front(list);
goto RETURN_{Tupper}_LIST_REMOVE;
}} else if (index == list->node_count) {{
output = wapp_str8_list_pop_back(list);
goto RETURN_{Tupper}_LIST_REMOVE;
}}
output = wapp_str8_list_get(list, index);
if (!output) {{
goto RETURN_{Tupper}_LIST_REMOVE;
}}
output->prev->next = output->next;
output->next->prev = output->prev;
--(list->node_count);
list->total_size -= output->string->size;
output->prev = output->next = NULL;
RETURN_{Tupper}_LIST_REMOVE:
return output;

15
codegen/dbl_list/snippets/node_to_list
View File

@@ -1,15 +0,0 @@
{T}List output = {{.first = node, .last = node, .total_size = node->string->size, .node_count = 1}};
while (output.first->prev != NULL) {{
output.total_size += output.first->prev->string->size;
output.first = output.first->prev;
++(output.node_count);
}}
while (output.last->next != NULL) {{
output.total_size += output.last->next->string->size;
output.last = output.last->next;
++(output.node_count);
}}
return output;