mirror of
https://github.com/nodemcu/nodemcu-firmware.git
synced 2025-01-30 21:12:55 +08:00
526d21dab4
The PR removed the bulk of non-newlib headers from the NodeMCU source base. app/libc has now been cut down to the bare minimum overrides to shadow the corresponding functions in the SDK's libc. The old c_xyz.h headerfiles have been nuked in favour of the standard <xyz.h> headers, with a few exceptions over in sdk-overrides. Again, shipping a libc.a without headers is a terrible thing to do. We're still living on a prayer that libc was configured the same was as a default-configured xtensa gcc toolchain assumes it is. That part I cannot do anything about, unfortunately, but it's no worse than it has been before. This enables our source files to compile successfully using the standard header files, and use the typical malloc()/calloc()/realloc()/free(), the strwhatever()s and memwhatever()s. These end up, through macro and linker magic, mapped to the appropriate SDK or ROM functions.
142 lines
2.6 KiB
C
142 lines
2.6 KiB
C
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include "node.h"
|
|
|
|
static inline coap_queue_t *
|
|
coap_malloc_node(void) {
|
|
return (coap_queue_t *)calloc(1,sizeof(coap_queue_t));
|
|
}
|
|
|
|
void coap_free_node(coap_queue_t *node) {
|
|
free(node);
|
|
}
|
|
|
|
int coap_insert_node(coap_queue_t **queue, coap_queue_t *node) {
|
|
coap_queue_t *p, *q;
|
|
if ( !queue || !node )
|
|
return 0;
|
|
|
|
/* set queue head if empty */
|
|
if ( !*queue ) {
|
|
*queue = node;
|
|
return 1;
|
|
}
|
|
|
|
/* replace queue head if PDU's time is less than head's time */
|
|
q = *queue;
|
|
if (node->t < q->t) {
|
|
node->next = q;
|
|
*queue = node;
|
|
q->t -= node->t; /* make q->t relative to node->t */
|
|
return 1;
|
|
}
|
|
|
|
/* search for right place to insert */
|
|
do {
|
|
node->t -= q->t; /* make node-> relative to q->t */
|
|
p = q;
|
|
q = q->next;
|
|
} while (q && q->t <= node->t);
|
|
|
|
/* insert new item */
|
|
if (q) {
|
|
q->t -= node->t; /* make q->t relative to node->t */
|
|
}
|
|
node->next = q;
|
|
p->next = node;
|
|
return 1;
|
|
}
|
|
|
|
int coap_delete_node(coap_queue_t *node) {
|
|
if ( !node )
|
|
return 0;
|
|
|
|
coap_delete_pdu(node->pdu);
|
|
coap_free_node(node);
|
|
|
|
return 1;
|
|
}
|
|
|
|
void coap_delete_all(coap_queue_t *queue) {
|
|
if ( !queue )
|
|
return;
|
|
|
|
coap_delete_all( queue->next );
|
|
coap_delete_node( queue );
|
|
}
|
|
|
|
coap_queue_t * coap_new_node(void) {
|
|
coap_queue_t *node;
|
|
node = coap_malloc_node();
|
|
|
|
if ( ! node ) {
|
|
return NULL;
|
|
}
|
|
|
|
memset(node, 0, sizeof(*node));
|
|
return node;
|
|
}
|
|
|
|
coap_queue_t * coap_peek_next( coap_queue_t *queue ) {
|
|
if ( !queue )
|
|
return NULL;
|
|
|
|
return queue;
|
|
}
|
|
|
|
coap_queue_t * coap_pop_next( coap_queue_t **queue ) { // this function is called inside timeout callback only.
|
|
coap_queue_t *next;
|
|
|
|
if ( !(*queue) )
|
|
return NULL;
|
|
|
|
next = *queue;
|
|
*queue = (*queue)->next;
|
|
// if (queue) {
|
|
// queue->t += next->t;
|
|
// }
|
|
next->next = NULL;
|
|
return next;
|
|
}
|
|
|
|
int coap_remove_node( coap_queue_t **queue, const coap_tid_t id){
|
|
coap_queue_t *p, *q, *node;
|
|
if ( !queue )
|
|
return 0;
|
|
if ( !*queue ) // if empty
|
|
return 0;
|
|
|
|
q = *queue;
|
|
if (q->id == id) {
|
|
node = q;
|
|
*queue = q->next;
|
|
node->next = NULL;
|
|
if(*queue){
|
|
(*queue)->t += node->t;
|
|
}
|
|
coap_delete_node(node);
|
|
return 1;
|
|
}
|
|
|
|
/* search for right node to remove */
|
|
while (q && q->id != id) {
|
|
p = q;
|
|
q = q->next;
|
|
}
|
|
|
|
/* find the node */
|
|
if (q) {
|
|
node = q; /* save the node */
|
|
p->next = q->next; /* remove the node */
|
|
q = q->next;
|
|
node->next = NULL;
|
|
if (q) // add node->t to the node after.
|
|
{
|
|
q->t += node->t;
|
|
}
|
|
coap_delete_node(node);
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|