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.

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 *********************************************************************/
daniele 3:b4047e8a0123 6 #ifndef _INCLUDE_PICO_QUEUE
daniele 3:b4047e8a0123 7 #define _INCLUDE_PICO_QUEUE
daniele 3:b4047e8a0123 8 #include <stdint.h>
daniele 3:b4047e8a0123 9 #include "pico_config.h"
daniele 3:b4047e8a0123 10 #include "pico_frame.h"
daniele 3:b4047e8a0123 11
daniele 3:b4047e8a0123 12 #ifndef NULL
daniele 3:b4047e8a0123 13 #define NULL ((void *)0)
daniele 3:b4047e8a0123 14 #endif
daniele 3:b4047e8a0123 15
daniele 3:b4047e8a0123 16 struct pico_queue {
daniele 3:b4047e8a0123 17 uint32_t frames;
daniele 3:b4047e8a0123 18 uint32_t size;
daniele 3:b4047e8a0123 19 uint32_t max_frames;
daniele 3:b4047e8a0123 20 uint32_t max_size;
daniele 3:b4047e8a0123 21 struct pico_frame *head;
daniele 3:b4047e8a0123 22 struct pico_frame *tail;
daniele 3:b4047e8a0123 23 #ifdef PICO_SUPPORT_MUTEX
daniele 3:b4047e8a0123 24 void * mutex;
daniele 3:b4047e8a0123 25 #endif
daniele 3:b4047e8a0123 26 };
daniele 3:b4047e8a0123 27
daniele 3:b4047e8a0123 28 #ifdef PICO_SUPPORT_MUTEX
daniele 3:b4047e8a0123 29 #define LOCK(x) {\
daniele 3:b4047e8a0123 30 if (x == NULL) \
daniele 3:b4047e8a0123 31 x = pico_mutex_init(); \
daniele 3:b4047e8a0123 32 pico_mutex_lock(x); \
daniele 3:b4047e8a0123 33 }
daniele 3:b4047e8a0123 34 #define UNLOCK(x) pico_mutex_unlock(x);
daniele 3:b4047e8a0123 35
daniele 3:b4047e8a0123 36 #else
daniele 3:b4047e8a0123 37 #define LOCK(x) do{}while(0)
daniele 3:b4047e8a0123 38 #define UNLOCK(x) do{}while(0)
daniele 3:b4047e8a0123 39 #endif
daniele 3:b4047e8a0123 40
daniele 3:b4047e8a0123 41 #ifdef PICO_SUPPORT_DEBUG_TOOLS
daniele 3:b4047e8a0123 42 static void debug_q(struct pico_queue *q)
daniele 3:b4047e8a0123 43 {
daniele 3:b4047e8a0123 44 struct pico_frame *p = q->head;
daniele 3:b4047e8a0123 45 dbg("%d: ", q->frames);
daniele 3:b4047e8a0123 46 while(p) {
daniele 3:b4047e8a0123 47 dbg("(%p)-->", p);
daniele 3:b4047e8a0123 48 p = p->next;
daniele 3:b4047e8a0123 49 }
daniele 3:b4047e8a0123 50 dbg("X\n");
daniele 3:b4047e8a0123 51 }
daniele 3:b4047e8a0123 52 #endif
daniele 3:b4047e8a0123 53
daniele 3:b4047e8a0123 54 static inline int pico_enqueue(struct pico_queue *q, struct pico_frame *p)
daniele 3:b4047e8a0123 55 {
daniele 3:b4047e8a0123 56 if ((q->max_frames) && (q->max_frames <= q->frames))
daniele 3:b4047e8a0123 57 return -1;
daniele 3:b4047e8a0123 58
daniele 3:b4047e8a0123 59 if ((q->max_size) && (q->max_size < (p->buffer_len + q->size)))
daniele 3:b4047e8a0123 60 return -1;
daniele 3:b4047e8a0123 61
daniele 3:b4047e8a0123 62 LOCK(q->mutex);
daniele 3:b4047e8a0123 63
daniele 3:b4047e8a0123 64 p->next = NULL;
daniele 3:b4047e8a0123 65 if (!q->head) {
daniele 3:b4047e8a0123 66 q->head = p;
daniele 3:b4047e8a0123 67 q->tail = p;
daniele 3:b4047e8a0123 68 q->size = 0;
daniele 3:b4047e8a0123 69 q->frames = 0;
daniele 3:b4047e8a0123 70 } else {
daniele 3:b4047e8a0123 71 q->tail->next = p;
daniele 3:b4047e8a0123 72 q->tail = p;
daniele 3:b4047e8a0123 73 }
daniele 3:b4047e8a0123 74 q->size += p->buffer_len;
daniele 3:b4047e8a0123 75 q->frames++;
daniele 3:b4047e8a0123 76 #ifdef PICO_SUPPORT_DEBUG_TOOLS
daniele 3:b4047e8a0123 77 debug_q(q);
daniele 3:b4047e8a0123 78 #endif
daniele 3:b4047e8a0123 79
daniele 3:b4047e8a0123 80 UNLOCK(q->mutex);
daniele 3:b4047e8a0123 81 return q->size;
daniele 3:b4047e8a0123 82 }
daniele 3:b4047e8a0123 83
daniele 3:b4047e8a0123 84 static inline struct pico_frame *pico_dequeue(struct pico_queue *q)
daniele 3:b4047e8a0123 85 {
daniele 3:b4047e8a0123 86 struct pico_frame *p = q->head;
daniele 3:b4047e8a0123 87 if (q->frames < 1)
daniele 3:b4047e8a0123 88 return NULL;
daniele 3:b4047e8a0123 89 LOCK(q->mutex);
daniele 3:b4047e8a0123 90
daniele 3:b4047e8a0123 91 q->head = p->next;
daniele 3:b4047e8a0123 92 q->frames--;
daniele 3:b4047e8a0123 93 q->size -= p->buffer_len;
daniele 3:b4047e8a0123 94 if (q->head == NULL)
daniele 3:b4047e8a0123 95 q->tail = NULL;
daniele 3:b4047e8a0123 96 #ifdef PICO_SUPPORT_DEBUG_TOOLS
daniele 3:b4047e8a0123 97 debug_q(q);
daniele 3:b4047e8a0123 98 #endif
daniele 3:b4047e8a0123 99 p->next = NULL;
daniele 3:b4047e8a0123 100 UNLOCK(q->mutex);
daniele 3:b4047e8a0123 101 return p;
daniele 3:b4047e8a0123 102 }
daniele 3:b4047e8a0123 103
daniele 3:b4047e8a0123 104 static inline struct pico_frame *pico_queue_peek(struct pico_queue *q)
daniele 3:b4047e8a0123 105 {
daniele 3:b4047e8a0123 106 struct pico_frame *p = q->head;
daniele 3:b4047e8a0123 107 if (q->frames < 1)
daniele 3:b4047e8a0123 108 return NULL;
daniele 3:b4047e8a0123 109 #ifdef PICO_SUPPORT_DEBUG_TOOLS
daniele 3:b4047e8a0123 110 debug_q(q);
daniele 3:b4047e8a0123 111 #endif
daniele 3:b4047e8a0123 112 return p;
daniele 3:b4047e8a0123 113 }
daniele 3:b4047e8a0123 114
daniele 3:b4047e8a0123 115 static inline void pico_queue_empty(struct pico_queue *q)
daniele 3:b4047e8a0123 116 {
daniele 3:b4047e8a0123 117 struct pico_frame *p = pico_dequeue(q);
daniele 3:b4047e8a0123 118 while(p) {
daniele 3:b4047e8a0123 119 pico_free(p);
daniele 3:b4047e8a0123 120 p = pico_dequeue(q);
daniele 3:b4047e8a0123 121 }
daniele 3:b4047e8a0123 122 }
daniele 3:b4047e8a0123 123
daniele 3:b4047e8a0123 124 #endif