]>
Commit | Line | Data |
---|---|---|
c8f4eac4 | 1 | |
2 | /* | |
507d0a78 | 3 | * DEBUG: none Linked list functions (deprecated) |
c8f4eac4 | 4 | * AUTHOR: Harvest Derived |
5 | * | |
6 | * SQUID Web Proxy Cache http://www.squid-cache.org/ | |
7 | * ---------------------------------------------------------- | |
8 | * | |
9 | * Squid is the result of efforts by numerous individuals from | |
10 | * the Internet community; see the CONTRIBUTORS file for full | |
11 | * details. Many organizations have provided support for Squid's | |
12 | * development; see the SPONSORS file for full details. Squid is | |
13 | * Copyrighted (C) 2001 by the Regents of the University of | |
14 | * California; see the COPYRIGHT file for full details. Squid | |
15 | * incorporates software developed and/or copyrighted by other | |
16 | * sources; see the CREDITS file for full details. | |
17 | * | |
18 | * This program is free software; you can redistribute it and/or modify | |
19 | * it under the terms of the GNU General Public License as published by | |
20 | * the Free Software Foundation; either version 2 of the License, or | |
21 | * (at your option) any later version. | |
26ac0430 | 22 | * |
c8f4eac4 | 23 | * This program is distributed in the hope that it will be useful, |
24 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
25 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
26 | * GNU General Public License for more details. | |
26ac0430 | 27 | * |
c8f4eac4 | 28 | * You should have received a copy of the GNU General Public License |
29 | * along with this program; if not, write to the Free Software | |
30 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. | |
31 | * | |
32 | */ | |
33 | ||
582c2af2 | 34 | #include "squid.h" |
8a89c28f | 35 | #include "Mem.h" |
41c97755 | 36 | #include "SquidList.h" |
582c2af2 | 37 | #include "typedefs.h" |
c8f4eac4 | 38 | |
39 | /* This should go away, in favour of the List template class */ | |
40 | ||
41 | void | |
42 | linklistPush(link_list ** L, void *p) | |
43 | { | |
44 | link_list *l = (link_list *)memAllocate(MEM_LINK_LIST); | |
45 | l->next = NULL; | |
46 | l->ptr = p; | |
47 | ||
48 | while (*L) | |
49 | L = &(*L)->next; | |
50 | ||
51 | *L = l; | |
52 | } | |
53 | ||
54 | void * | |
55 | linklistShift(link_list ** L) | |
56 | { | |
57 | void *p; | |
58 | link_list *l; | |
59 | ||
60 | if (NULL == *L) | |
61 | return NULL; | |
62 | ||
63 | l = *L; | |
64 | ||
65 | p = l->ptr; | |
66 | ||
67 | *L = (*L)->next; | |
68 | ||
69 | memFree(l, MEM_LINK_LIST); | |
70 | ||
71 | return p; | |
72 | } | |
73 |