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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/* Helper functions for maintaining a fixed-size lru-ordered queue
Copyright (C) 1996 Free Software Foundation, Inc.
Written by Miles Bader <miles@gnu.ai.mit.edu>
This program 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, or (at
your option) any later version.
This program 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., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include <string.h>
#include <malloc.h>
#include "cacheq.h"
/* Move ENTRY to the most-recently-used end of CACHEQ. */
void
cacheq_make_mru (struct cacheq *cq, void *entry)
{
struct cacheq_hdr *h = entry;
if (h != cq->mru)
{
/* First remove it. We known H->prev isn't 0 because H wasn't
previously == MRU. */
((struct cacheq_hdr *)h->prev)->next = h->next;
if (h->next)
((struct cacheq_hdr *)h->next)->prev = h->prev;
else
cq->lru = h->prev;
/* Now make it MRU. */
h->next = cq->mru;
h->prev = 0;
cq->mru->prev = h;
cq->mru = h;
}
}
/* Move ENTRY to the least-recently-used end of CACHEQ. */
void
cacheq_make_lru (struct cacheq *cq, void *entry)
{
struct cacheq_hdr *h = entry;
if (h != cq->lru)
{
/* First remove it. We known H->next isn't 0 because H wasn't
previously == LRU. */
((struct cacheq_hdr *)h->next)->prev = h->prev;
if (h->prev)
((struct cacheq_hdr *)h->prev)->next = h->next;
else
cq->mru = h->next;
/* Now make it LRU. */
h->prev = cq->lru;
h->next = 0;
cq->lru->next = h;
cq->lru = h;
}
}
/* Change CQ's size to be LENGTH entries. */
error_t
cacheq_set_length (struct cacheq *cq, int length)
{
if (length != cq->length)
{
size_t esz = cq->entry_size;
void *new_entries = malloc (esz * length);
/* Source entries. */
struct cacheq_hdr *fh = cq->mru;
/* Destination entries (and limit). */
struct cacheq_hdr *th = new_entries, *end = new_entries + esz * length;
struct cacheq_hdr *prev_th = 0;
if (! new_entries)
return ENOMEM;
while (fh || th)
{
struct cacheq_hdr *next_th =
(!th || th > end) ? 0 : (void *)th + esz;
if (fh && th)
bcopy (fh, th, esz); /* Copy the bits in a moved entry. */
else if (th)
bzero (th, esz); /* Zero the bits in a new entry. */
if (th)
/* Fixup headers. */
{
th->prev = prev_th;
th->next = next_th;
}
/* Call user hooks as appropiate. */
if (fh && th)
{
if (cq->move_entry)
(*cq->move_entry) (fh, th);
}
else if (th)
{
if (cq->init_entry)
(*cq->init_entry) (th);
}
else
{
if (cq->finalize_entry)
(*cq->finalize_entry) (fh);
}
if (fh)
fh = fh->next;
if (th)
{
prev_th = th;
th = next_th;
}
}
free (cq->entries);
cq->entries = new_entries;
cq->mru = new_entries;
cq->lru = prev_th;
cq->length = length;
}
return 0;
}
|
