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