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.

modules/pico_mbed.cpp

Committer:
tass
Date:
2016-01-28
Revision:
155:a70f34550c34
Parent:
151:dbbb7e41f583

File content as of revision 155:a70f34550c34:

#include <mbed.h>
#include <rtos.h>

extern "C" {
#include "pico_config.h"

    pico_time local_time;
    uint32_t last_os_time;

    void *pico_mutex_init(void)
    {
        return new Mutex();
    }

    void pico_mutex_lock(void *_m)
    {
        Mutex *m = (Mutex *)_m;
        m->lock();
    }

    void pico_mutex_unlock(void *_m)
    {
        Mutex *m = (Mutex *)_m;
        m->unlock();
    }

    void pico_mutex_deinit(void *_m)
    {
        Mutex *m = (Mutex *)_m;
        delete m;
    }
    
#ifdef PICO_MEASURE_STACK
int freeStack = STACK_TOTAL_WORDS;
void stack_fill_pattern(void * ptr)
{
    int * movingPtr = (int *)ptr;
    int * finalPtr = movingPtr - STACK_TOTAL_WORDS;
    while(movingPtr >= finalPtr)
    {
        *movingPtr = STACK_PATTERN;
        movingPtr--;
    }
}

void stack_count_free_words(void *ptr)
{
    int * movingPtr = (int *)ptr;
    int * finalPtr = movingPtr - STACK_TOTAL_WORDS;
    int tmpFreeStack = 0;
    
    while(finalPtr != movingPtr)
    {
        if(*finalPtr != STACK_PATTERN)
            break;
        tmpFreeStack++;
        finalPtr++;
    }
    freeStack = tmpFreeStack;
}

int stack_get_free_words(void)
{
    return freeStack;
}

#endif

}