From e6c97a53a7b5ac4014d30d236ea2bf5adb4bb521 Mon Sep 17 00:00:00 2001
From: AlexeyAB <alexeyab84@gmail.com>
Date: Tue, 07 Aug 2018 20:19:50 +0000
Subject: [PATCH] Maxpool fixes
---
src/list.c | 72 +++++++++++++++++++++---------------
1 files changed, 42 insertions(+), 30 deletions(-)
diff --git a/src/list.c b/src/list.c
index 0e4165d..39e3033 100644
--- a/src/list.c
+++ b/src/list.c
@@ -1,14 +1,15 @@
#include <stdlib.h>
#include <string.h>
#include "list.h"
+#include "option_list.h"
list *make_list()
{
- list *l = malloc(sizeof(list));
- l->size = 0;
- l->front = 0;
- l->back = 0;
- return l;
+ list *l = malloc(sizeof(list));
+ l->size = 0;
+ l->front = 0;
+ l->back = 0;
+ return l;
}
/*
@@ -39,44 +40,55 @@
void list_insert(list *l, void *val)
{
- node *new = malloc(sizeof(node));
- new->val = val;
- new->next = 0;
+ node *new = malloc(sizeof(node));
+ new->val = val;
+ new->next = 0;
- if(!l->back){
- l->front = new;
- new->prev = 0;
- }else{
- l->back->next = new;
- new->prev = l->back;
- }
- l->back = new;
- ++l->size;
+ if(!l->back){
+ l->front = new;
+ new->prev = 0;
+ }else{
+ l->back->next = new;
+ new->prev = l->back;
+ }
+ l->back = new;
+ ++l->size;
}
void free_node(node *n)
{
- node *next;
- while(n) {
- next = n->next;
- free(n);
- n = next;
- }
+ node *next;
+ while(n) {
+ next = n->next;
+ free(n);
+ n = next;
+ }
}
void free_list(list *l)
{
- free_node(l->front);
- free(l);
+ free_node(l->front);
+ free(l);
}
void free_list_contents(list *l)
{
- node *n = l->front;
- while(n){
- free(n->val);
- n = n->next;
- }
+ node *n = l->front;
+ while(n){
+ free(n->val);
+ n = n->next;
+ }
+}
+
+void free_list_contents_kvp(list *l)
+{
+ node *n = l->front;
+ while (n) {
+ kvp *p = n->val;
+ free(p->key);
+ free(n->val);
+ n = n->next;
+ }
}
void **list_to_array(list *l)
--
Gitblit v1.10.0