]>
Commit | Line | Data |
---|---|---|
528b2c61 | 1 | |
2 | /* | |
3 | * $Id: stmem.h,v 1.1 2003/01/23 00:37:26 robertc Exp $ | |
4 | * | |
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. | |
22 | * | |
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. | |
27 | * | |
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 | ||
34 | #ifndef SQUID_STMEM_H | |
35 | #define SQUID_STMEM_H | |
36 | ||
37 | class mem_node; | |
38 | class StoreIOBuffer; | |
39 | class mem_hdr { | |
40 | public: | |
41 | void freeContent(); | |
42 | int lowestOffset () const; | |
43 | off_t endOffset () const; | |
44 | int freeDataUpto (int); | |
45 | ssize_t copy (off_t, char *, size_t) const; | |
46 | bool hasContigousContentRange(size_t start, size_t end) const; | |
47 | /* success or fail */ | |
48 | bool write (StoreIOBuffer const &); | |
49 | ||
50 | /* Only for use of MemObject */ | |
51 | void internalAppend(const char *data, int len); | |
52 | mem_node *head; | |
53 | mem_node *tail; | |
54 | private: | |
55 | void unlinkHead(); | |
56 | void makeAppendSpace(); | |
57 | int appendToNode(mem_node *aNode, const char *data, int maxLength); | |
58 | void appendNode (mem_node *aNode); | |
59 | mem_node *getBlockContainingLocation (size_t location) const; | |
60 | size_t copyAvailable(mem_node *aNode, size_t location, size_t amount, char *target) const; | |
61 | bool unionNotEmpty (StoreIOBuffer const &); | |
62 | mem_node *getHighestBlockBeforeLocation (size_t location) const; | |
63 | mem_node *nodeToRecieve(off_t offset); | |
64 | size_t writeAvailable(mem_node *aNode, size_t location, size_t amount, char const *source); | |
65 | off_t inmem_hi; | |
66 | }; | |
67 | ||
68 | #endif /* SQUID_STMEM_H */ |