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
|
/*
+----------------------------------------------------------------------+
| PHP Version 5 |
+----------------------------------------------------------------------+
| Copyright (c) 1997-2004 The PHP Group |
+----------------------------------------------------------------------+
| This source file is subject to version 3.0 of the PHP license, |
| that is bundled with this package in the file LICENSE, and is |
| available through the world-wide-web at the following url: |
| http://www.php.net/license/3_0.txt. |
| If you did not receive a copy of the PHP license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@php.net so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
| Authors: Antony Dovgal <tony2001@phpclub.net> |
| Mikael Johansson <mikael AT synd DOT info> |
+----------------------------------------------------------------------+
*/
/* $Id: memcache_queue.c 310129 2011-04-11 04:44:27Z hradtke $ */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "php.h"
#include "memcache_queue.h"
inline void mmc_queue_push(mmc_queue_t *queue, void *ptr) {
if (mmc_queue_contains(queue, ptr)) return;
if (queue->len >= queue->alloc) {
int increase = 1 + MMC_QUEUE_PREALLOC;
queue->alloc += increase;
queue->items = erealloc(queue->items, sizeof(*queue->items) * queue->alloc);
/* move tail segment downwards */
if (queue->head < queue->tail) {
memmove(queue->items + queue->tail + increase, queue->items + queue->tail, (queue->alloc - queue->tail - increase) * sizeof(*queue->items));
queue->tail += increase;
}
}
if (queue->len) {
queue->head++;
if (queue->head >= queue->alloc) {
queue->head = 0;
}
}
queue->items[queue->head] = ptr;
queue->len++;
}
inline void *mmc_queue_pop(mmc_queue_t *queue) {
if (queue->len) {
void *ptr;
ptr = queue->items[queue->tail];
queue->len--;
if (queue->len) {
queue->tail++;
if (queue->tail >= queue->alloc) {
queue->tail = 0;
}
}
return ptr;
}
return NULL;
}
inline int mmc_queue_contains(mmc_queue_t *queue, void *ptr) {
if (queue != NULL) {
int i;
for (i=0; i < queue->len; i++) {
if (mmc_queue_item(queue, i) == ptr) {
return 1;
}
}
}
return 0;
}
inline void mmc_queue_free(mmc_queue_t *queue) {
if (queue->items != NULL) {
efree(queue->items);
}
memset(queue, 0, sizeof(*queue));
}
inline void mmc_queue_copy(mmc_queue_t *target, mmc_queue_t *source) {
if (target->alloc != source->alloc) {
target->alloc = source->alloc;
target->items = erealloc(target->items, sizeof(*target->items) * target->alloc);
}
memcpy(target->items, source->items, sizeof(*source->items) * source->alloc);
target->head = source->head;
target->tail = source->tail;
target->len = source->len;
}
inline void mmc_queue_remove(mmc_queue_t *queue, void *ptr) {
void *item;
mmc_queue_t original = *queue;
mmc_queue_release(queue);
while ((item = mmc_queue_pop(&original)) != NULL) {
if (item != ptr) {
mmc_queue_push(queue, item);
}
}
mmc_queue_free(&original);
}
/*
* Local variables:
* tab-width: 4
* c-basic-offset: 4
* End:
* vim600: noet sw=4 ts=4 fdm=marker
* vim<600: noet sw=4 ts=4
*/
|
