1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/*
* UNIXODBC module
*
* Copyright (C) 2005-2006 Marco Lorrai
* Copyright (C) 2008 1&1 Internet AG
*
* This file is part of Kamailio, a free SIP server.
*
* Kamailio is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version
*
* Kamailio is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*
* History:
* --------
* 2005-12-01 initial commit (chgen)
* 2006-04-04 simplified link list (sgupta)
* 2006-05-05 removed static allocation of 1k per column data (sgupta)
*/
#include "../../dprint.h"
#include "../../mem/mem.h"
#include "list.h"
/*!
* \brief Create a list
* \param start start of the list
* \param link inserted element
* \param n number of values
* \param value inserted value
* \return 0 on success, -1 on failure
*/
int db_unixodbc_list_insert(list** start, list** link, int n, strn* value)
{
int i = 0;
list* nlink;
if (!(*start)) *link = NULL;
nlink=(list*)pkg_malloc(sizeof(list));
if(!nlink) {
LM_ERR("no more pkg memory (1)\n");
return -1;
}
nlink->rownum = n;
nlink->next = NULL;
nlink->lengths = (unsigned long*)pkg_malloc(sizeof(unsigned long)*n);
if(!nlink->lengths) {
LM_ERR("no more pkg memory (2)\n");
pkg_free(nlink);
return -1;
}
for(i=0; i<n; i++)
nlink->lengths[i] = value[i].buflen;
nlink->data = (char**)pkg_malloc(sizeof(char*)*n);
if(!nlink->data) {
LM_ERR("no more pkg memory (3)\n");
pkg_free( nlink->lengths );
pkg_free(nlink);
return -1;
}
for(i=0; i<n; i++) {
nlink->data[i] = pkg_malloc(sizeof(char) * nlink->lengths[i]);
if(!nlink->data[i]) {
LM_ERR("no more pkg memory (4)\n");
pkg_free( nlink->lengths );
pkg_free( nlink->data );
pkg_free(nlink);
return -1;
}
memcpy(nlink->data[i], value[i].s, nlink->lengths[i]);
}
if (!(*start)) {
*link = nlink;
*start = *link;
} else {
(*link)->next = nlink;
*link = (*link)->next;
}
return 0;
}
/*!
* \brief Destroy a list
* \param link list element(s)
*/
void db_unixodbc_list_destroy(list *start)
{
int i = 0;
while(start) {
list* temp = start;
start = start->next;
for(i = 0; i < temp->rownum; i++)
pkg_free( temp->data[i] );
pkg_free(temp->data);
pkg_free(temp->lengths);
pkg_free(temp);
}
}
|
