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

include/heap.h@1:cfe8984a32b4, 2013-05-17 (annotated)

Committer:
tass
Date:
Fri May 17 12:09:59 2013 +0000
Revision:
1:cfe8984a32b4
Parent:
libraries/picotcp/include/heap.h@0:d7f2341ab245 
Update for smaller SOCKETQ

Who changed what in which revision?

UserRevisionLine numberNew contents of line
daniele 0:d7f2341ab245 1 /*********************************************************************
daniele 0:d7f2341ab245 2 PicoTCP. Copyright (c) 2012 TASS Belgium NV. Some rights reserved.
daniele 0:d7f2341ab245 3 See LICENSE and COPYING for usage.
daniele 0:d7f2341ab245 4
daniele 0:d7f2341ab245 5 *********************************************************************/
daniele 0:d7f2341ab245 6
daniele 0:d7f2341ab245 7 #define DECLARE_HEAP(type, orderby) \
daniele 0:d7f2341ab245 8 struct heap_##type { \
daniele 0:d7f2341ab245 9 uint32_t size; \
daniele 0:d7f2341ab245 10 uint32_t n; \
daniele 0:d7f2341ab245 11 type *top; \
daniele 0:d7f2341ab245 12 }; \
daniele 0:d7f2341ab245 13 typedef struct heap_##type heap_##type; \
daniele 0:d7f2341ab245 14 static inline int heap_insert(struct heap_##type *heap, type *el) \
daniele 0:d7f2341ab245 15 { \
daniele 0:d7f2341ab245 16 int i; \
daniele 0:d7f2341ab245 17 type * newTop; \
daniele 0:d7f2341ab245 18 if (++heap->n >= heap->size) { \
daniele 0:d7f2341ab245 19 newTop = pico_zalloc((heap->n + 1) * sizeof(type)); \
daniele 0:d7f2341ab245 20 if(!newTop) \
daniele 0:d7f2341ab245 21 return -1; \
daniele 0:d7f2341ab245 22 if (heap->top) {\
daniele 0:d7f2341ab245 23 memcpy(newTop,heap->top,heap->n*sizeof(type)); \
daniele 0:d7f2341ab245 24 pico_free(heap->top); \
daniele 0:d7f2341ab245 25 } \
daniele 0:d7f2341ab245 26 heap->top = newTop; \
daniele 0:d7f2341ab245 27 heap->size++; \
daniele 0:d7f2341ab245 28 } \
daniele 0:d7f2341ab245 29 if (heap->n == 1) { \
daniele 0:d7f2341ab245 30 memcpy(&heap->top[1], el, sizeof(type)); \
daniele 0:d7f2341ab245 31 return 0; \
daniele 0:d7f2341ab245 32 } \
daniele 0:d7f2341ab245 33 for (i = heap->n; ((i > 1) && (heap->top[i / 2].orderby > el->orderby)); i /= 2) { \
daniele 0:d7f2341ab245 34 memcpy(&heap->top[i], &heap->top[i / 2], sizeof(type)); \
daniele 0:d7f2341ab245 35 } \
daniele 0:d7f2341ab245 36 memcpy(&heap->top[i], el, sizeof(type)); \
daniele 0:d7f2341ab245 37 return 0; \
daniele 0:d7f2341ab245 38 } \
daniele 0:d7f2341ab245 39 static inline int heap_peek(struct heap_##type *heap, type *first) \
daniele 0:d7f2341ab245 40 { \
daniele 0:d7f2341ab245 41 type *last; \
daniele 0:d7f2341ab245 42 int i, child; \
daniele 0:d7f2341ab245 43 if(heap->n == 0) { \
daniele 0:d7f2341ab245 44 return -1; \
daniele 0:d7f2341ab245 45 } \
daniele 0:d7f2341ab245 46 memcpy(first, &heap->top[1], sizeof(type)); \
daniele 0:d7f2341ab245 47 last = &heap->top[heap->n--]; \
daniele 0:d7f2341ab245 48 for(i = 1; (i * 2) <= heap->n; i = child) { \
daniele 0:d7f2341ab245 49 child = 2 * i; \
daniele 0:d7f2341ab245 50 if ((child != heap->n) && \
daniele 0:d7f2341ab245 51 (heap->top[child + 1]).orderby \
daniele 0:d7f2341ab245 52 < (heap->top[child]).orderby) \
daniele 0:d7f2341ab245 53 child++; \
daniele 0:d7f2341ab245 54 if (last->orderby > \
daniele 0:d7f2341ab245 55 heap->top[child].orderby) \
daniele 0:d7f2341ab245 56 memcpy(&heap->top[i], &heap->top[child],\
daniele 0:d7f2341ab245 57 sizeof(type)); \
daniele 0:d7f2341ab245 58 else \
daniele 0:d7f2341ab245 59 break; \
daniele 0:d7f2341ab245 60 } \
daniele 0:d7f2341ab245 61 memcpy(&heap->top[i], last, sizeof(type)); \
daniele 0:d7f2341ab245 62 return 0; \
daniele 0:d7f2341ab245 63 } \
daniele 0:d7f2341ab245 64 static inline type *heap_first(heap_##type *heap) \
daniele 0:d7f2341ab245 65 { \
daniele 0:d7f2341ab245 66 if (heap->n == 0) \
daniele 0:d7f2341ab245 67 return NULL; \
daniele 0:d7f2341ab245 68 return &heap->top[1]; \
daniele 0:d7f2341ab245 69 } \
daniele 0:d7f2341ab245 70 static inline heap_##type *heap_init(void) \
daniele 0:d7f2341ab245 71 { \
daniele 0:d7f2341ab245 72 heap_##type *p = (heap_##type *)pico_zalloc(sizeof(heap_##type)); \
daniele 0:d7f2341ab245 73 return p; \
daniele 0:d7f2341ab245 74 } \
daniele 0:d7f2341ab245 75 static inline void heap_destroy(heap_##type *h) \
daniele 0:d7f2341ab245 76 { \
daniele 0:d7f2341ab245 77 pico_free(h->top); \
daniele 0:d7f2341ab245 78 pico_free(h); \
daniele 0:d7f2341ab245 79 } \
daniele 0:d7f2341ab245 80
daniele 0:d7f2341ab245 81