Daniele Lacamera
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 RTOSgeneric mbed Ethernet driverhigh performance NXP LPC1768 specific Ethernet driverMulti-threading support for mbed RTOSBerkeley sockets and integration with the New Socket APIFork of the apps running on top of the New Socket APIScheduling 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: stack/pico_protocol.c
- Revision:
- 137:a1c8bfa9d691
- Parent:
- 133:5b075f5e141a
- Child:
- 152:a3d286bf94e5
--- a/stack/pico_protocol.c Fri Jan 17 10:13:51 2014 +0100
+++ b/stack/pico_protocol.c Fri Feb 07 11:21:12 2014 +0100
@@ -11,6 +11,13 @@
#include "pico_protocol.h"
#include "pico_tree.h"
+struct pico_proto_rr
+{
+ struct pico_tree *t;
+ struct pico_tree_node *node_in, *node_out;
+};
+
+
static int pico_proto_cmp(void *ka, void *kb)
{
struct pico_protocol *a = ka, *b = kb;
@@ -28,295 +35,136 @@
PICO_TREE_DECLARE(Transport_proto_tree, pico_proto_cmp);
PICO_TREE_DECLARE(Socket_proto_tree, pico_proto_cmp);
-static int proto_loop(struct pico_protocol *proto, int loop_score, int direction)
+/* Static variables to keep track of the round robin loop */
+static struct pico_proto_rr proto_rr_datalink = {
+ &Datalink_proto_tree, NULL, NULL
+};
+static struct pico_proto_rr proto_rr_network = {
+ &Network_proto_tree, NULL, NULL
+};
+static struct pico_proto_rr proto_rr_transport = {
+ &Transport_proto_tree, NULL, NULL
+};
+static struct pico_proto_rr proto_rr_socket = {
+ &Socket_proto_tree, NULL, NULL
+};
+
+static int proto_loop_in(struct pico_protocol *proto, int loop_score)
{
struct pico_frame *f;
-
- if (direction == PICO_LOOP_DIR_IN) {
-
- while(loop_score > 0) {
- if (proto->q_in->frames <= 0)
- break;
+ while(loop_score > 0) {
+ if (proto->q_in->frames <= 0)
+ break;
- f = pico_dequeue(proto->q_in);
- if ((f) && (proto->process_in(proto, f) > 0)) {
- loop_score--;
- }
- }
- } else if (direction == PICO_LOOP_DIR_OUT) {
-
- while(loop_score > 0) {
- if (proto->q_out->frames <= 0)
- break;
-
- f = pico_dequeue(proto->q_out);
- if ((f) && (proto->process_out(proto, f) > 0)) {
- loop_score--;
- }
+ f = pico_dequeue(proto->q_in);
+ if ((f) && (proto->process_in(proto, f) > 0)) {
+ loop_score--;
}
}
+ return loop_score;
+}
+
+static int proto_loop_out(struct pico_protocol *proto, int loop_score)
+{
+ struct pico_frame *f;
+ while(loop_score > 0) {
+ if (proto->q_out->frames <= 0)
+ break;
+
+ f = pico_dequeue(proto->q_out);
+ if ((f) && (proto->process_out(proto, f) > 0)) {
+ loop_score--;
+ }
+ }
+ return loop_score;
+}
+
+static int proto_loop(struct pico_protocol *proto, int loop_score, int direction)
+{
+
+ if (direction == PICO_LOOP_DIR_IN)
+ loop_score = proto_loop_in(proto, loop_score);
+ else if (direction == PICO_LOOP_DIR_OUT)
+ loop_score = proto_loop_out(proto, loop_score);
return loop_score;
}
-#define DL_LOOP_MIN 1
-
-int pico_protocol_datalink_loop(int loop_score, int direction)
+static struct pico_tree_node *roundrobin_init(struct pico_proto_rr *rr, int direction)
{
- struct pico_protocol *start;
- static struct pico_protocol *next = NULL, *next_in = NULL, *next_out = NULL;
- static struct pico_tree_node *next_node, *in_node, *out_node;
+ struct pico_tree_node *next_node = NULL;
+ /* Initialization (takes place only once) */
+ if (rr->node_in == NULL)
+ rr->node_in = pico_tree_firstNode(rr->t->root);
- if (next_in == NULL) {
- in_node = pico_tree_firstNode(Datalink_proto_tree.root);
- if (in_node)
- next_in = in_node->keyValue;
- }
-
- if (next_out == NULL) {
- out_node = pico_tree_firstNode(Datalink_proto_tree.root);
- if (out_node)
- next_out = out_node->keyValue;
- }
+ if (rr->node_out == NULL)
+ rr->node_out = pico_tree_firstNode(rr->t->root);
if (direction == PICO_LOOP_DIR_IN)
- {
- next_node = in_node;
- next = next_in;
- }
- else if (direction == PICO_LOOP_DIR_OUT)
- {
- next_node = out_node;
- next = next_out;
- }
+ next_node = rr->node_in;
+ else
+ next_node = rr->node_out;
+
+ return next_node;
+}
+
+static void roundrobin_end(struct pico_proto_rr *rr, int direction, struct pico_tree_node *last)
+{
+ if (direction == PICO_LOOP_DIR_IN)
+ rr->node_in = last;
+ else
+ rr->node_out = last;
+}
+
+static int pico_protocol_generic_loop(struct pico_proto_rr *rr, int loop_score, int direction)
+{
+ struct pico_protocol *start, *next;
+ struct pico_tree_node *next_node = roundrobin_init(rr, direction);
+
+ if (!next_node)
+ return loop_score;
+ else
+ next = next_node->keyValue;
/* init start node */
start = next;
- /* round-robin all datalink protocols, break if traversed all protocols */
- while (loop_score > DL_LOOP_MIN && next != NULL) {
+ /* round-robin all layer protocols, break if traversed all protocols */
+ while (loop_score > 1 && next != NULL) {
loop_score = proto_loop(next, loop_score, direction);
-
- /* next = RB_NEXT(pico_protocol_tree, &Datalink_proto_tree, next); */
next_node = pico_tree_next(next_node);
next = next_node->keyValue;
-
if (next == NULL)
{
- next_node = pico_tree_firstNode(Datalink_proto_tree.root);
+ next_node = pico_tree_firstNode(rr->t->root);
next = next_node->keyValue;
}
if (next == start)
break;
}
- if (direction == PICO_LOOP_DIR_IN)
- {
- in_node = next_node;
- next_in = next;
- }
- else if (direction == PICO_LOOP_DIR_OUT)
- {
- out_node = next_node;
- next_out = next;
- }
-
+ roundrobin_end(rr, direction, next_node);
return loop_score;
}
-
-#define NW_LOOP_MIN 1
+int pico_protocol_datalink_loop(int loop_score, int direction)
+{
+ return pico_protocol_generic_loop(&proto_rr_datalink, loop_score, direction);
+}
int pico_protocol_network_loop(int loop_score, int direction)
{
- struct pico_protocol *start;
- static struct pico_protocol *next = NULL, *next_in = NULL, *next_out = NULL;
- static struct pico_tree_node *next_node, *in_node, *out_node;
-
- if (next_in == NULL) {
- in_node = pico_tree_firstNode(Network_proto_tree.root);
- if (in_node)
- next_in = in_node->keyValue;
- }
-
- if (next_out == NULL) {
- out_node = pico_tree_firstNode(Network_proto_tree.root);
- if (out_node)
- next_out = out_node->keyValue;
- }
-
- if (direction == PICO_LOOP_DIR_IN)
- {
- next_node = in_node;
- next = next_in;
- }
- else if (direction == PICO_LOOP_DIR_OUT)
- {
- next_node = out_node;
- next = next_out;
- }
-
- /* init start node */
- start = next;
-
- /* round-robin all network protocols, break if traversed all protocols */
- while (loop_score > NW_LOOP_MIN && next != NULL) {
- loop_score = proto_loop(next, loop_score, direction);
-
- next_node = pico_tree_next(next_node);
- next = next_node->keyValue;
-
- if (next == NULL)
- {
- next_node = pico_tree_firstNode(Network_proto_tree.root);
- next = next_node->keyValue;
- }
-
- if (next == start)
- break;
- }
- if (direction == PICO_LOOP_DIR_IN)
- {
- in_node = next_node;
- next_in = next;
- }
- else if (direction == PICO_LOOP_DIR_OUT)
- {
- out_node = next_node;
- next_out = next;
- }
-
- return loop_score;
+ return pico_protocol_generic_loop(&proto_rr_network, loop_score, direction);
}
-#define TP_LOOP_MIN 1
-
int pico_protocol_transport_loop(int loop_score, int direction)
{
- struct pico_protocol *start;
- static struct pico_protocol *next = NULL, *next_in = NULL, *next_out = NULL;
- static struct pico_tree_node *next_node, *in_node, *out_node;
-
- if (next_in == NULL) {
- in_node = pico_tree_firstNode(Transport_proto_tree.root);
- if (in_node)
- next_in = in_node->keyValue;
- }
-
- if (next_out == NULL) {
- out_node = pico_tree_firstNode(Transport_proto_tree.root);
- if (out_node)
- next_out = out_node->keyValue;
- }
-
- if (direction == PICO_LOOP_DIR_IN)
- {
- next_node = in_node;
- next = next_in;
- }
- else if (direction == PICO_LOOP_DIR_OUT)
- {
- next_node = out_node;
- next = next_out;
- }
-
- /* init start node */
- start = next;
-
- /* round-robin all transport protocols, break if traversed all protocols */
- while (loop_score > DL_LOOP_MIN && next != NULL) {
- loop_score = proto_loop(next, loop_score, direction);
-
- /* next = RB_NEXT(pico_protocol_tree, &Transport_proto_tree, next); */
- next_node = pico_tree_next(next_node);
- next = next_node->keyValue;
-
- if (next == NULL)
- {
- next_node = pico_tree_firstNode(Transport_proto_tree.root);
- next = next_node->keyValue;
- }
-
- if (next == start)
- break;
- }
- if (direction == PICO_LOOP_DIR_IN)
- {
- in_node = next_node;
- next_in = next;
- }
- else if (direction == PICO_LOOP_DIR_OUT)
- {
- out_node = next_node;
- next_out = next;
- }
-
- return loop_score;
+ return pico_protocol_generic_loop(&proto_rr_transport, loop_score, direction);
}
-
-#define SOCK_LOOP_MIN 1
-
int pico_protocol_socket_loop(int loop_score, int direction)
{
- struct pico_protocol *start;
- static struct pico_protocol *next = NULL, *next_in = NULL, *next_out = NULL;
- static struct pico_tree_node *next_node, *in_node, *out_node;
-
- if (next_in == NULL) {
- in_node = pico_tree_firstNode(Socket_proto_tree.root);
- if(in_node)
- next_in = in_node->keyValue;
- }
-
- if (next_out == NULL) {
- out_node = pico_tree_firstNode(Socket_proto_tree.root);
- if(out_node)
- next_out = out_node->keyValue;
- }
-
- if (direction == PICO_LOOP_DIR_IN)
- {
- next_node = in_node;
- next = next_in;
- }
- else if (direction == PICO_LOOP_DIR_OUT)
- {
- next_node = out_node;
- next = next_out;
- }
-
- /* init start node */
- start = next;
-
- /* round-robin all transport protocols, break if traversed all protocols */
- while (loop_score > SOCK_LOOP_MIN && next != NULL) {
- loop_score = proto_loop(next, loop_score, direction);
-
- next_node = pico_tree_next(next_node);
- next = next_node->keyValue;
-
- if (next == NULL)
- {
- next_node = pico_tree_firstNode(next_node);
- next = next_node->keyValue;
- }
-
- if (next == start)
- break;
- }
- if (direction == PICO_LOOP_DIR_IN)
- {
- in_node = next_node;
- next_in = next;
- }
- else if (direction == PICO_LOOP_DIR_OUT)
- {
- out_node = next_node;
- next_out = next;
- }
-
- return loop_score;
+ return pico_protocol_generic_loop(&proto_rr_socket, loop_score, direction);
}
int pico_protocols_loop(int loop_score)
@@ -330,6 +178,12 @@
return loop_score;
}
+static void proto_layer_rr_reset(struct pico_proto_rr *rr)
+{
+ rr->node_in = NULL;
+ rr->node_out = NULL;
+}
+
void pico_protocol_init(struct pico_protocol *p)
{
if (!p)
@@ -339,15 +193,19 @@
switch (p->layer) {
case PICO_LAYER_DATALINK:
pico_tree_insert(&Datalink_proto_tree, p);
+ proto_layer_rr_reset(&proto_rr_datalink);
break;
case PICO_LAYER_NETWORK:
pico_tree_insert(&Network_proto_tree, p);
+ proto_layer_rr_reset(&proto_rr_network);
break;
case PICO_LAYER_TRANSPORT:
pico_tree_insert(&Transport_proto_tree, p);
+ proto_layer_rr_reset(&proto_rr_transport);
break;
case PICO_LAYER_SOCKET:
pico_tree_insert(&Socket_proto_tree, p);
+ proto_layer_rr_reset(&proto_rr_socket);
break;
}
dbg("Protocol %s registered (layer: %d).\n", p->name, p->layer);
