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

stack/pico_protocol.c

Committer:
tass picotcp@tass.be
Date:
2014-01-16
Revision:
133:5b075f5e141a
Parent:
131:4758606c9316
Child:
137:a1c8bfa9d691

File content as of revision 133:5b075f5e141a:

/*********************************************************************
   PicoTCP. Copyright (c) 2012 TASS Belgium NV. Some rights reserved.
   See LICENSE and COPYING for usage.

   .

   Authors: Daniele Lacamera
 *********************************************************************/


#include "pico_protocol.h"
#include "pico_tree.h"

static int pico_proto_cmp(void *ka, void *kb)
{
    struct pico_protocol *a = ka, *b = kb;
    if (a->hash < b->hash)
        return -1;

    if (a->hash > b->hash)
        return 1;

    return 0;
}

PICO_TREE_DECLARE(Datalink_proto_tree, pico_proto_cmp);
PICO_TREE_DECLARE(Network_proto_tree, pico_proto_cmp);
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)
{
    struct pico_frame *f;

    if (direction == PICO_LOOP_DIR_IN) {

        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--;
            }
        }
    }

    return loop_score;
}

#define DL_LOOP_MIN 1

int pico_protocol_datalink_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(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 (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 datalink 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, &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 = 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;
}


#define NW_LOOP_MIN 1

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;
}

#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;
}


#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;
}

int pico_protocols_loop(int loop_score)
{
/*
   loop_score = pico_protocol_datalink_loop(loop_score);
   loop_score = pico_protocol_network_loop(loop_score);
   loop_score = pico_protocol_transport_loop(loop_score);
   loop_score = pico_protocol_socket_loop(loop_score);
 */
    return loop_score;
}

void pico_protocol_init(struct pico_protocol *p)
{
    if (!p)
        return;

    p->hash = pico_hash(p->name, (uint32_t)strlen(p->name));
    switch (p->layer) {
    case PICO_LAYER_DATALINK:
        pico_tree_insert(&Datalink_proto_tree, p);
        break;
    case PICO_LAYER_NETWORK:
        pico_tree_insert(&Network_proto_tree, p);
        break;
    case PICO_LAYER_TRANSPORT:
        pico_tree_insert(&Transport_proto_tree, p);
        break;
    case PICO_LAYER_SOCKET:
        pico_tree_insert(&Socket_proto_tree, p);
        break;
    }
    dbg("Protocol %s registered (layer: %d).\n", p->name, p->layer);

}