Daniele Lacamera / PicoTCP Featured

Free (GPLv2) TCP/IP stack developed by TASS Belgium

Dependents:   lpc1768-picotcp-demo ZeroMQ_PicoTCP_Publisher_demo TCPSocket_HelloWorld_PicoTCP Pico_TCP_UDP_Test ... more

PicoTCP. Copyright (c) 2013 TASS Belgium NV.

Released under the GNU General Public License, version 2.

Different licensing models may exist, at the sole discretion of the Copyright holders.

Official homepage: http://www.picotcp.com

Bug tracker: https://github.com/tass-belgium/picotcp/issues

Development steps:

  • initial integration with mbed RTOS
  • generic mbed Ethernet driver
  • high performance NXP LPC1768 specific Ethernet driver
  • Multi-threading support for mbed RTOS
  • Berkeley sockets and integration with the New Socket API
  • Fork of the apps running on top of the New Socket API
  • Scheduling optimizations
  • Debugging/benchmarking/testing

Demo application (measuring TCP sender performance):

Import programlpc1768-picotcp-demo

A PicoTCP demo app testing the ethernet throughput on the lpc1768 mbed board.

Last commit 17 May 2013 by TASS Belgium

include/pico_tree.h@3:b4047e8a0123, 2013-05-24 (annotated)

Committer:
daniele
Date:
Fri May 24 15:25:25 2013 +0000
Revision:
3:b4047e8a0123
Updated from main repo + fixed Mutexes;

Who changed what in which revision?

UserRevisionLine numberNew contents of line
daniele 3:b4047e8a0123 1 /*********************************************************************
daniele 3:b4047e8a0123 2 PicoTCP. Copyright (c) 2012 TASS Belgium NV. Some rights reserved.
daniele 3:b4047e8a0123 3 See LICENSE and COPYING for usage.
daniele 3:b4047e8a0123 4
daniele 3:b4047e8a0123 5 Author: Andrei Carp <andrei.carp@tass.be>
daniele 3:b4047e8a0123 6 *********************************************************************/
daniele 3:b4047e8a0123 7
daniele 3:b4047e8a0123 8 #ifndef __PICO_RBTREE_H__
daniele 3:b4047e8a0123 9 #define __PICO_RBTREE_H__
daniele 3:b4047e8a0123 10
daniele 3:b4047e8a0123 11 #include <stdint.h>
daniele 3:b4047e8a0123 12 #include "pico_config.h"
daniele 3:b4047e8a0123 13
daniele 3:b4047e8a0123 14 // This is used to declare a new tree, leaf root by default
daniele 3:b4047e8a0123 15 #define PICO_TREE_DECLARE(name,compareFunction) \
daniele 3:b4047e8a0123 16 struct pico_tree name =\
daniele 3:b4047e8a0123 17 { \
daniele 3:b4047e8a0123 18 &LEAF, \
daniele 3:b4047e8a0123 19 compareFunction \
daniele 3:b4047e8a0123 20 }
daniele 3:b4047e8a0123 21
daniele 3:b4047e8a0123 22
daniele 3:b4047e8a0123 23 struct pico_tree_node
daniele 3:b4047e8a0123 24 {
daniele 3:b4047e8a0123 25 void* keyValue; // generic key
daniele 3:b4047e8a0123 26 struct pico_tree_node* parent;
daniele 3:b4047e8a0123 27 struct pico_tree_node* leftChild;
daniele 3:b4047e8a0123 28 struct pico_tree_node* rightChild;
daniele 3:b4047e8a0123 29 uint8_t color;
daniele 3:b4047e8a0123 30 };
daniele 3:b4047e8a0123 31
daniele 3:b4047e8a0123 32 struct pico_tree
daniele 3:b4047e8a0123 33 {
daniele 3:b4047e8a0123 34 struct pico_tree_node * root; // root of the tree
daniele 3:b4047e8a0123 35
daniele 3:b4047e8a0123 36 // this function directly provides the keys as parameters not the nodes.
daniele 3:b4047e8a0123 37 int (*compare)(void* keyA, void* keyB);
daniele 3:b4047e8a0123 38 };
daniele 3:b4047e8a0123 39
daniele 3:b4047e8a0123 40 extern struct pico_tree_node LEAF; // generic leaf node
daniele 3:b4047e8a0123 41 /*
daniele 3:b4047e8a0123 42 * Manipulation functions
daniele 3:b4047e8a0123 43 */
daniele 3:b4047e8a0123 44 void * pico_tree_insert(struct pico_tree * tree, void * key);
daniele 3:b4047e8a0123 45 void * pico_tree_delete(struct pico_tree * tree, void * key);
daniele 3:b4047e8a0123 46 void * pico_tree_findKey(struct pico_tree * tree, void * key);
daniele 3:b4047e8a0123 47 void pico_tree_drop(struct pico_tree * tree);
daniele 3:b4047e8a0123 48 int pico_tree_empty(struct pico_tree * tree);
daniele 3:b4047e8a0123 49 struct pico_tree_node * pico_tree_findNode(struct pico_tree * tree, void * key);
daniele 3:b4047e8a0123 50
daniele 3:b4047e8a0123 51 void * pico_tree_first(struct pico_tree * tree);
daniele 3:b4047e8a0123 52 void * pico_tree_last(struct pico_tree * tree);
daniele 3:b4047e8a0123 53 /*
daniele 3:b4047e8a0123 54 * Traverse functions
daniele 3:b4047e8a0123 55 */
daniele 3:b4047e8a0123 56 struct pico_tree_node * pico_tree_lastNode(struct pico_tree_node * node);
daniele 3:b4047e8a0123 57 struct pico_tree_node * pico_tree_firstNode(struct pico_tree_node * node);
daniele 3:b4047e8a0123 58 struct pico_tree_node * pico_tree_next(struct pico_tree_node * node);
daniele 3:b4047e8a0123 59 struct pico_tree_node * pico_tree_prev(struct pico_tree_node * node);
daniele 3:b4047e8a0123 60
daniele 3:b4047e8a0123 61 /*
daniele 3:b4047e8a0123 62 * For each macros
daniele 3:b4047e8a0123 63 */
daniele 3:b4047e8a0123 64
daniele 3:b4047e8a0123 65 #define pico_tree_foreach(idx,tree) \
daniele 3:b4047e8a0123 66 for ((idx) = pico_tree_firstNode((tree)->root); \
daniele 3:b4047e8a0123 67 (idx) != &LEAF; \
daniele 3:b4047e8a0123 68 (idx) = pico_tree_next(idx))
daniele 3:b4047e8a0123 69
daniele 3:b4047e8a0123 70 #define pico_tree_foreach_reverse(idx,tree) \
daniele 3:b4047e8a0123 71 for ((idx) = pico_tree_lastNode((tree)->root); \
daniele 3:b4047e8a0123 72 (idx) != &LEAF; \
daniele 3:b4047e8a0123 73 (idx) = pico_tree_prev(idx))
daniele 3:b4047e8a0123 74
daniele 3:b4047e8a0123 75 #define pico_tree_foreach_safe(idx,tree,idx2) \
daniele 3:b4047e8a0123 76 for ((idx) = pico_tree_firstNode((tree)->root); \
daniele 3:b4047e8a0123 77 ((idx) != &LEAF) && ((idx2) = pico_tree_next(idx), 1); \
daniele 3:b4047e8a0123 78 (idx) = (idx2))
daniele 3:b4047e8a0123 79
daniele 3:b4047e8a0123 80 #define pico_tree_foreach_reverse_safe(idx,tree,idx2) \
daniele 3:b4047e8a0123 81 for ((idx) = pico_tree_lastNode((tree)->root); \
daniele 3:b4047e8a0123 82 ((idx) != &LEAF) && ((idx2) = pico_tree_prev(idx), 1); \
daniele 3:b4047e8a0123 83 (idx) = (idx2))
daniele 3:b4047e8a0123 84
daniele 3:b4047e8a0123 85 #endif