kamkow1/my-os-project2
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Porting PicoTCP WIP

Browse Source
This commit is contained in:
Kamil Kowalczyk
2025-10-29 14:29:06 +01:00
parent 6722f42e68
commit 815c2239fe
464 changed files with 235009 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

93
kernel/picotcp/include/pico_tree.h Normal file
View File

@ -0,0 +1,93 @@
/*********************************************************************
PicoTCP. Copyright (c) 2012-2017 Altran Intelligent Systems. Some rights reserved.
See COPYING, LICENSE.GPLv2 and LICENSE.GPLv3 for usage.
Author: Andrei Carp <andrei.carp@tass.be>
*********************************************************************/
#ifndef PICO_RBTREE_H
#define PICO_RBTREE_H
#include "pico_config.h"
/* This is used to declare a new tree, leaf root by default */
#define PICO_TREE_DECLARE(name, compareFunction) \
struct pico_tree name = \
{ \
&LEAF, \
compareFunction \
}
#define USE_PICO_PAGE0_ZALLOC (1)
#define USE_PICO_ZALLOC (2)
struct pico_tree_node
{
void*keyValue; /* generic key */
struct pico_tree_node*parent;
struct pico_tree_node*leftChild;
struct pico_tree_node*rightChild;
uint8_t color;
};
struct pico_tree
{
struct pico_tree_node *root; /* root of the tree */
/* this function directly provides the keys as parameters not the nodes. */
int (*compare)(void*keyA, void*keyB);
};
extern struct pico_tree_node LEAF; /* generic leaf node */
#ifdef PICO_SUPPORT_MM
void *pico_tree_insert_implementation(struct pico_tree *tree, void *key, uint8_t allocator);
void *pico_tree_delete_implementation(struct pico_tree *tree, void *key, uint8_t allocator);
#endif
/*
* Manipulation functions
*/
void *pico_tree_insert(struct pico_tree *tree, void *key);
void *pico_tree_delete(struct pico_tree *tree, void *key);
void *pico_tree_findKey(struct pico_tree *tree, void *key);
void pico_tree_drop(struct pico_tree *tree);
int pico_tree_empty(struct pico_tree *tree);
struct pico_tree_node *pico_tree_findNode(struct pico_tree *tree, void *key);
void *pico_tree_first(struct pico_tree *tree);
void *pico_tree_last(struct pico_tree *tree);
/*
* Traverse functions
*/
struct pico_tree_node *pico_tree_lastNode(struct pico_tree_node *node);
struct pico_tree_node *pico_tree_firstNode(struct pico_tree_node *node);
struct pico_tree_node *pico_tree_next(struct pico_tree_node *node);
struct pico_tree_node *pico_tree_prev(struct pico_tree_node *node);
/*
* For each macros
*/
#define pico_tree_foreach(idx, tree) \
for ((idx) = pico_tree_firstNode((tree)->root); \
(idx) != &LEAF; \
(idx) = pico_tree_next(idx))
#define pico_tree_foreach_reverse(idx, tree) \
for ((idx) = pico_tree_lastNode((tree)->root); \
(idx) != &LEAF; \
(idx) = pico_tree_prev(idx))
#define pico_tree_foreach_safe(idx, tree, idx2) \
for ((idx) = pico_tree_firstNode((tree)->root); \
((idx) != &LEAF) && ((idx2) = pico_tree_next(idx), 1); \
(idx) = (idx2))
#define pico_tree_foreach_reverse_safe(idx, tree, idx2) \
for ((idx) = pico_tree_lastNode((tree)->root); \
((idx) != &LEAF) && ((idx2) = pico_tree_prev(idx), 1); \
(idx) = (idx2))
#endif