mbed port of tinydtls
netq.c@1:bc8a649bad13, 2013-10-11 (annotated)
- Committer:
- ashleymills
- Date:
- Fri Oct 11 08:46:21 2013 +0000
- Revision:
- 1:bc8a649bad13
- Parent:
- 0:04990d454f45
Cleaned up all the debug stuff I added finding the hash table bug.
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
ashleymills | 0:04990d454f45 | 1 | /* netq.h -- Simple packet queue |
ashleymills | 0:04990d454f45 | 2 | * |
ashleymills | 0:04990d454f45 | 3 | * Copyright (C) 2010--2012 Olaf Bergmann <bergmann@tzi.org> |
ashleymills | 0:04990d454f45 | 4 | * |
ashleymills | 0:04990d454f45 | 5 | * This file is part of the library tinyDTLS. Please see the file |
ashleymills | 0:04990d454f45 | 6 | * LICENSE for terms of use. |
ashleymills | 0:04990d454f45 | 7 | */ |
ashleymills | 0:04990d454f45 | 8 | |
ashleymills | 0:04990d454f45 | 9 | //#include "netinet/in.h" |
ashleymills | 0:04990d454f45 | 10 | #include "debug.h" |
ashleymills | 0:04990d454f45 | 11 | #include "netq.h" |
ashleymills | 0:04990d454f45 | 12 | |
ashleymills | 0:04990d454f45 | 13 | |
ashleymills | 0:04990d454f45 | 14 | #ifdef HAVE_ASSERT_H |
ashleymills | 0:04990d454f45 | 15 | #include <assert.h> |
ashleymills | 0:04990d454f45 | 16 | #else |
ashleymills | 0:04990d454f45 | 17 | #ifndef assert |
ashleymills | 0:04990d454f45 | 18 | #warning "assertions are disabled" |
ashleymills | 0:04990d454f45 | 19 | # define assert(x) |
ashleymills | 0:04990d454f45 | 20 | #endif |
ashleymills | 0:04990d454f45 | 21 | #endif |
ashleymills | 0:04990d454f45 | 22 | |
ashleymills | 0:04990d454f45 | 23 | #include "t_list.h" |
ashleymills | 0:04990d454f45 | 24 | |
ashleymills | 0:04990d454f45 | 25 | #ifndef WITH_CONTIKI |
ashleymills | 0:04990d454f45 | 26 | #include <stdlib.h> |
ashleymills | 0:04990d454f45 | 27 | |
ashleymills | 0:04990d454f45 | 28 | static inline netq_t * |
ashleymills | 0:04990d454f45 | 29 | netq_malloc_node() { |
ashleymills | 0:04990d454f45 | 30 | return (netq_t *)malloc(sizeof(netq_t)); |
ashleymills | 0:04990d454f45 | 31 | } |
ashleymills | 0:04990d454f45 | 32 | |
ashleymills | 0:04990d454f45 | 33 | static inline void |
ashleymills | 0:04990d454f45 | 34 | netq_free_node(netq_t *node) { |
ashleymills | 0:04990d454f45 | 35 | free(node); |
ashleymills | 0:04990d454f45 | 36 | } |
ashleymills | 0:04990d454f45 | 37 | |
ashleymills | 0:04990d454f45 | 38 | /* FIXME: implement Contiki's list functions using utlist.h */ |
ashleymills | 0:04990d454f45 | 39 | |
ashleymills | 0:04990d454f45 | 40 | #else /* WITH_CONTIKI */ |
ashleymills | 0:04990d454f45 | 41 | #include "memb.h" |
ashleymills | 0:04990d454f45 | 42 | |
ashleymills | 0:04990d454f45 | 43 | MEMB(netq_storage, netq_t, NETQ_MAXCNT); |
ashleymills | 0:04990d454f45 | 44 | |
ashleymills | 0:04990d454f45 | 45 | static inline netq_t * |
ashleymills | 0:04990d454f45 | 46 | netq_malloc_node() { |
ashleymills | 0:04990d454f45 | 47 | return (netq_t *)memb_alloc(&netq_storage); |
ashleymills | 0:04990d454f45 | 48 | } |
ashleymills | 0:04990d454f45 | 49 | |
ashleymills | 0:04990d454f45 | 50 | static inline void |
ashleymills | 0:04990d454f45 | 51 | netq_free_node(netq_t *node) { |
ashleymills | 0:04990d454f45 | 52 | memb_free(&netq_storage, node); |
ashleymills | 0:04990d454f45 | 53 | } |
ashleymills | 0:04990d454f45 | 54 | #endif /* WITH_CONTIKI */ |
ashleymills | 0:04990d454f45 | 55 | |
ashleymills | 0:04990d454f45 | 56 | void |
ashleymills | 0:04990d454f45 | 57 | netq_init() { |
ashleymills | 0:04990d454f45 | 58 | #ifdef WITH_CONTIKI |
ashleymills | 0:04990d454f45 | 59 | memb_init(&netq_storage); |
ashleymills | 0:04990d454f45 | 60 | #endif /* WITH_CONTIKI */ |
ashleymills | 0:04990d454f45 | 61 | } |
ashleymills | 0:04990d454f45 | 62 | |
ashleymills | 0:04990d454f45 | 63 | int |
ashleymills | 0:04990d454f45 | 64 | netq_insert_node(netq_t **queue, netq_t *node) { |
ashleymills | 0:04990d454f45 | 65 | netq_t *p; |
ashleymills | 0:04990d454f45 | 66 | |
ashleymills | 0:04990d454f45 | 67 | assert(queue); |
ashleymills | 0:04990d454f45 | 68 | assert(node); |
ashleymills | 0:04990d454f45 | 69 | |
ashleymills | 0:04990d454f45 | 70 | p = (netq_t *)list_head((list_t)queue); |
ashleymills | 0:04990d454f45 | 71 | while(p && p->t <= node->t) |
ashleymills | 0:04990d454f45 | 72 | p = list_item_next(p); |
ashleymills | 0:04990d454f45 | 73 | |
ashleymills | 0:04990d454f45 | 74 | if (p) |
ashleymills | 0:04990d454f45 | 75 | list_insert((list_t)queue, p, node); |
ashleymills | 0:04990d454f45 | 76 | else |
ashleymills | 0:04990d454f45 | 77 | list_push((list_t)queue, node); |
ashleymills | 0:04990d454f45 | 78 | |
ashleymills | 0:04990d454f45 | 79 | return 1; |
ashleymills | 0:04990d454f45 | 80 | } |
ashleymills | 0:04990d454f45 | 81 | |
ashleymills | 0:04990d454f45 | 82 | netq_t * |
ashleymills | 0:04990d454f45 | 83 | netq_head(netq_t **queue) { |
ashleymills | 0:04990d454f45 | 84 | if (!queue) |
ashleymills | 0:04990d454f45 | 85 | return NULL; |
ashleymills | 0:04990d454f45 | 86 | |
ashleymills | 0:04990d454f45 | 87 | return list_head((list_t)queue); |
ashleymills | 0:04990d454f45 | 88 | } |
ashleymills | 0:04990d454f45 | 89 | |
ashleymills | 0:04990d454f45 | 90 | netq_t *netq_pop_first(netq_t **queue) { |
ashleymills | 0:04990d454f45 | 91 | if (!queue) |
ashleymills | 0:04990d454f45 | 92 | return NULL; |
ashleymills | 0:04990d454f45 | 93 | |
ashleymills | 0:04990d454f45 | 94 | return list_pop((list_t)queue); |
ashleymills | 0:04990d454f45 | 95 | } |
ashleymills | 0:04990d454f45 | 96 | |
ashleymills | 0:04990d454f45 | 97 | netq_t * |
ashleymills | 0:04990d454f45 | 98 | netq_node_new() { |
ashleymills | 0:04990d454f45 | 99 | netq_t *node; |
ashleymills | 0:04990d454f45 | 100 | node = netq_malloc_node(); |
ashleymills | 0:04990d454f45 | 101 | |
ashleymills | 0:04990d454f45 | 102 | #ifndef NDEBUG |
ashleymills | 0:04990d454f45 | 103 | if (!node) |
ashleymills | 0:04990d454f45 | 104 | dsrv_log(LOG_WARN, "netq_node_new: malloc\n"); |
ashleymills | 0:04990d454f45 | 105 | #endif |
ashleymills | 0:04990d454f45 | 106 | |
ashleymills | 0:04990d454f45 | 107 | if (node) |
ashleymills | 0:04990d454f45 | 108 | memset(node, 0, sizeof(netq_t)); |
ashleymills | 0:04990d454f45 | 109 | |
ashleymills | 0:04990d454f45 | 110 | return node; |
ashleymills | 0:04990d454f45 | 111 | } |
ashleymills | 0:04990d454f45 | 112 | |
ashleymills | 0:04990d454f45 | 113 | void |
ashleymills | 0:04990d454f45 | 114 | netq_node_free(netq_t *node) { |
ashleymills | 0:04990d454f45 | 115 | if (node) |
ashleymills | 0:04990d454f45 | 116 | netq_free_node(node); |
ashleymills | 0:04990d454f45 | 117 | } |
ashleymills | 0:04990d454f45 | 118 | |
ashleymills | 0:04990d454f45 | 119 | void |
ashleymills | 0:04990d454f45 | 120 | netq_delete_all(netq_t *queue) { |
ashleymills | 0:04990d454f45 | 121 | netq_t *p; |
ashleymills | 0:04990d454f45 | 122 | if (queue) { |
ashleymills | 0:04990d454f45 | 123 | while((p = list_pop((list_t)&queue))) |
ashleymills | 0:04990d454f45 | 124 | netq_free_node(p); |
ashleymills | 0:04990d454f45 | 125 | } |
ashleymills | 0:04990d454f45 | 126 | } |
ashleymills | 0:04990d454f45 | 127 |