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

Diff: include/pico_tree.h

Revision:
51:ab4529a384a6
Parent:
6:55b47464d5bc
--- a/include/pico_tree.h	Tue Aug 06 08:04:03 2013 +0000
+++ b/include/pico_tree.h	Mon Sep 02 08:02:21 2013 +0000
@@ -13,11 +13,11 @@
 
 // This is used to declare a new tree, leaf root by default
 #define PICO_TREE_DECLARE(name,compareFunction) \
-    struct pico_tree name =\
-    { \
-        &LEAF, \
-        compareFunction \
-    }
+	struct pico_tree name =\
+	{ \
+		&LEAF, \
+		compareFunction \
+	}
 
 struct pico_tree_node
 {
@@ -30,9 +30,9 @@
 
 struct pico_tree
 {
-    struct pico_tree_node * root; // root of the tree
+	struct pico_tree_node * root; // root of the tree
 
-    // this function directly provides the keys as parameters not the nodes.
+	// this function directly provides the keys as parameters not the nodes.
   int (*compare)(void* keyA, void* keyB);
 };
 
@@ -43,8 +43,8 @@
 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);
+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);
@@ -62,23 +62,23 @@
  */
 
 #define pico_tree_foreach(idx,tree) \
-        for ((idx) = pico_tree_firstNode((tree)->root); \
-             (idx) != &LEAF; \
-             (idx) = pico_tree_next(idx))
+		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))
+		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))
+		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))
+		for ((idx) = pico_tree_lastNode((tree)->root); \
+				((idx) != &LEAF) && ((idx2) = pico_tree_prev(idx), 1); \
+				 (idx) = (idx2))
 
 #endif