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
|
/*
* $Id$
*
* Copyright (C) 2001-2003 FhG Fokus
*
* 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:
* --------
* 2003-03-19 all mallocs/frees replaced w/ pkg_malloc/pkg_free (andrei)
*/
#include <stdlib.h>
#include <string.h>
#include "../../mem/mem.h"
#include "sub_list.h"
struct node* append_to_list(struct node *head, char *offset, char *name)
{
struct node *new_node;
new_node = pkg_malloc(sizeof(struct node));
if (!new_node)
return 0;
new_node->offset = offset;
new_node->name = name;
new_node->next = head;
return new_node;
}
char* search_the_list(struct node *head, char *name)
{
struct node *n;
n = head;
while (n) {
if (strcasecmp(n->name,name)==0)
return n->offset;
n = n->next;
}
return 0;
}
void delete_list(struct node* head)
{
struct node *n;
;
while (head) {
n=head->next;
pkg_free(head);
head = n;
}
}
|
