-
Notifications
You must be signed in to change notification settings - Fork 7
/
apc_sma.c
765 lines (644 loc) · 21.6 KB
/
apc_sma.c
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
/*
+----------------------------------------------------------------------+
| APC |
+----------------------------------------------------------------------+
| Copyright (c) 2006-2011 The PHP Group |
+----------------------------------------------------------------------+
| This source file is subject to version 3.01 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_01.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 |
| [email protected] so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
| Authors: Daniel Cowgill <[email protected]> |
| Rasmus Lerdorf <[email protected]> |
+----------------------------------------------------------------------+
This software was contributed to PHP by Community Connect Inc. in 2002
and revised in 2005 by Yahoo! Inc. to add support for PHP 5.1.
Future revisions and derivatives of this source code must acknowledge
Community Connect Inc. as the original contributor of this module by
leaving this note intact in the source code.
All other licensing and usage conditions are those of the PHP Group.
*/
/* $Id: apc_sma.c 328896 2012-12-26 05:28:14Z laruence $ */
#include "apc_sma.h"
#include "apc.h"
#include "apc_globals.h"
#include "apc_lock.h"
#include "apc_shm.h"
#include "apc_cache.h"
#include <limits.h>
#include "apc_mmap.h"
#ifdef HAVE_VALGRIND_MEMCHECK_H
#include <valgrind/memcheck.h>
#endif
enum { DEFAULT_NUMSEG=1, DEFAULT_SEGSIZE=30*1024*1024 };
static int sma_initialized = 0; /* true if the sma has been initialized */
static uint sma_numseg; /* number of shm segments to allow */
static size_t sma_segsize; /* size of each shm segment */
static apc_segment_t* sma_segments; /* array of shm segments */
static int sma_lastseg = 0; /* index of MRU segment */
typedef struct sma_header_t sma_header_t;
struct sma_header_t {
apc_lck_t sma_lock; /* segment lock, MUST BE ALIGNED for futex locks */
size_t segsize; /* size of entire segment */
size_t avail; /* bytes available (not necessarily contiguous) */
#if ALLOC_DISTRIBUTION
size_t adist[30];
#endif
};
#define SMA_HDR(i) ((sma_header_t*)((sma_segments[i]).shmaddr))
#define SMA_ADDR(i) ((char*)(SMA_HDR(i)))
#define SMA_RO(i) ((char*)(sma_segments[i]).roaddr)
#define SMA_LCK(i) ((SMA_HDR(i))->sma_lock)
/* do not enable for threaded http servers */
/* #define __APC_SMA_DEBUG__ 1 */
#ifdef __APC_SMA_DEBUG__
/* global counter for identifying blocks
* Technically it is possible to do the same
* using offsets, but double allocations of the
* same offset can happen. */
static volatile size_t block_id = 0;
#endif
#define APC_SMA_CANARIES 1
typedef struct block_t block_t;
struct block_t {
size_t size; /* size of this block */
size_t prev_size; /* size of sequentially previous block, 0 if prev is allocated */
size_t fnext; /* offset in segment of next free block */
size_t fprev; /* offset in segment of prev free block */
#ifdef APC_SMA_CANARIES
size_t canary; /* canary to check for memory overwrites */
#endif
#ifdef __APC_SMA_DEBUG__
size_t id; /* identifier for the memory block */
#endif
};
/* The macros BLOCKAT and OFFSET are used for convenience throughout this
* module. Both assume the presence of a variable shmaddr that points to the
* beginning of the shared memory segment in question. */
#define BLOCKAT(offset) ((block_t*)((char *)shmaddr + offset))
#define OFFSET(block) ((size_t)(((char*)block) - (char*)shmaddr))
/* macros for getting the next or previous sequential block */
#define NEXT_SBLOCK(block) ((block_t*)((char*)block + block->size))
#define PREV_SBLOCK(block) (block->prev_size ? ((block_t*)((char*)block - block->prev_size)) : NULL)
/* Canary macros for setting, checking and resetting memory canaries */
#ifdef APC_SMA_CANARIES
#define SET_CANARY(v) (v)->canary = 0x42424242
#define CHECK_CANARY(v) assert((v)->canary == 0x42424242)
#define RESET_CANARY(v) (v)->canary = -42
#else
#define SET_CANARY(v)
#define CHECK_CANARY(v)
#define RESET_CANARY(v)
#endif
/* {{{ MINBLOCKSIZE */
#define MINBLOCKSIZE (ALIGNWORD(1) + ALIGNWORD(sizeof(block_t)))
/* }}} */
#if 0
/* {{{ sma_debug_state(apc_sma_segment_t *segment, int canary_check, int verbose)
* useful for debuging state of memory blocks and free list, and sanity checking
*/
static void sma_debug_state(void* shmaddr, int canary_check, int verbose TSRMLS_DC) {
sma_header_t *header = (sma_header_t*)shmaddr;
block_t *cur = BLOCKAT(ALIGNWORD(sizeof(sma_header_t)));
block_t *prv = NULL;
size_t avail;
/* Verify free list */
if (verbose) apc_warning("Free List: " TSRMLS_CC);
while(1) {
if (verbose) apc_warning(" 0x%x[%d] (s%d)" TSRMLS_CC, cur, OFFSET(cur), cur->size);
if (canary_check) CHECK_CANARY(cur);
if (!cur->fnext) break;
cur = BLOCKAT(cur->fnext);
avail += cur->size;
if (prv == cur) {
apc_warning("Circular list detected!" TSRMLS_CC);
assert(0);
}
if (prv && cur->fprev != OFFSET(prv)) {
apc_warning("Previous pointer does not point to previous!" TSRMLS_CC);
assert(0);
}
prv = cur;
}
assert(avail == header->avail);
/* Verify each block */
if (verbose) apc_warning("Block List: " TSRMLS_CC);
cur = BLOCKAT(ALIGNWORD(sizeof(sma_header_t)));
while(1) {
if(!cur->fnext) {
if (verbose) apc_warning(" 0x%x[%d] (s%d) (u)" TSRMLS_CC, cur, OFFSET(cur), cur->size);
} else {
if (verbose) apc_warning(" 0x%x[%d] (s%d) (f)" TSRMLS_CC, cur, OFFSET(cur), cur->size);
}
if (canary_check) CHECK_CANARY(cur);
if (!cur->size && !cur->fnext) break;
if (!cur->size) {
cur = BLOCKAT(OFFSET(cur) + ALIGNWORD(sizeof(block_t)));
} else {
cur = NEXT_SBLOCK(cur);
}
if (prv == cur) {
apc_warning("Circular list detected!" TSRMLS_CC);
assert(0);
}
prv = cur;
}
}
/* }}} */
#endif
/* {{{ sma_allocate: tries to allocate at least size bytes in a segment */
static APC_HOTSPOT size_t sma_allocate(sma_header_t* header, size_t size, size_t fragment, size_t *allocated)
{
void* shmaddr; /* header of shared memory segment */
block_t* prv; /* block prior to working block */
block_t* cur; /* working block in list */
block_t* prvnextfit; /* block before next fit */
size_t realsize; /* actual size of block needed, including header */
const size_t block_size = ALIGNWORD(sizeof(struct block_t));
realsize = ALIGNWORD(size + block_size);
/*
* First, insure that the segment contains at least realsize free bytes,
* even if they are not contiguous.
*/
shmaddr = header;
if (header->avail < realsize) {
return -1;
}
prvnextfit = 0; /* initially null (no fit) */
prv = BLOCKAT(ALIGNWORD(sizeof(sma_header_t)));
CHECK_CANARY(prv);
while (prv->fnext != 0) {
cur = BLOCKAT(prv->fnext);
#ifdef __APC_SMA_DEBUG__
CHECK_CANARY(cur);
#endif
/* If it can fit realsize bytes in cur block, stop searching */
if (cur->size >= realsize) {
prvnextfit = prv;
break;
}
prv = cur;
}
if (prvnextfit == 0) {
return -1;
}
prv = prvnextfit;
cur = BLOCKAT(prv->fnext);
CHECK_CANARY(prv);
CHECK_CANARY(cur);
if (cur->size == realsize || (cur->size > realsize && cur->size < (realsize + (MINBLOCKSIZE + fragment)))) {
/* cur is big enough for realsize, but too small to split - unlink it */
*(allocated) = cur->size - block_size;
prv->fnext = cur->fnext;
BLOCKAT(cur->fnext)->fprev = OFFSET(prv);
NEXT_SBLOCK(cur)->prev_size = 0; /* block is alloc'd */
} else {
/* nextfit is too big; split it into two smaller blocks */
block_t* nxt; /* the new block (chopped part of cur) */
size_t oldsize; /* size of cur before split */
oldsize = cur->size;
cur->size = realsize;
*(allocated) = cur->size - block_size;
nxt = NEXT_SBLOCK(cur);
nxt->prev_size = 0; /* block is alloc'd */
nxt->size = oldsize - realsize; /* and fix the size */
NEXT_SBLOCK(nxt)->prev_size = nxt->size; /* adjust size */
SET_CANARY(nxt);
/* replace cur with next in free list */
nxt->fnext = cur->fnext;
nxt->fprev = cur->fprev;
BLOCKAT(nxt->fnext)->fprev = OFFSET(nxt);
BLOCKAT(nxt->fprev)->fnext = OFFSET(nxt);
#ifdef __APC_SMA_DEBUG__
nxt->id = -1;
#endif
}
cur->fnext = 0;
/* update the block header */
header->avail -= cur->size;
#if ALLOC_DISTRIBUTION
header->adist[(int)(log(size)/log(2))]++;
#endif
SET_CANARY(cur);
#ifdef __APC_SMA_DEBUG__
cur->id = ++block_id;
fprintf(stderr, "allocate(realsize=%d,size=%d,id=%d)\n", (int)(size), (int)(cur->size), cur->id);
#endif
return OFFSET(cur) + block_size;
}
/* }}} */
/* {{{ sma_deallocate: deallocates the block at the given offset */
static APC_HOTSPOT size_t sma_deallocate(void* shmaddr, size_t offset)
{
sma_header_t* header; /* header of shared memory segment */
block_t* cur; /* the new block to insert */
block_t* prv; /* the block before cur */
block_t* nxt; /* the block after cur */
size_t size; /* size of deallocated block */
offset -= ALIGNWORD(sizeof(struct block_t));
assert(offset >= 0);
/* find position of new block in free list */
cur = BLOCKAT(offset);
/* update the block header */
header = (sma_header_t*) shmaddr;
header->avail += cur->size;
size = cur->size;
if (cur->prev_size != 0) {
/* remove prv from list */
prv = PREV_SBLOCK(cur);
BLOCKAT(prv->fnext)->fprev = prv->fprev;
BLOCKAT(prv->fprev)->fnext = prv->fnext;
/* cur and prv share an edge, combine them */
prv->size +=cur->size;
RESET_CANARY(cur);
cur = prv;
}
nxt = NEXT_SBLOCK(cur);
if (nxt->fnext != 0) {
assert(NEXT_SBLOCK(NEXT_SBLOCK(cur))->prev_size == nxt->size);
/* cur and nxt shared an edge, combine them */
BLOCKAT(nxt->fnext)->fprev = nxt->fprev;
BLOCKAT(nxt->fprev)->fnext = nxt->fnext;
cur->size += nxt->size;
#ifdef __APC_SMA_DEBUG__
CHECK_CANARY(nxt);
nxt->id = -1; /* assert this or set it ? */
#endif
RESET_CANARY(nxt);
}
NEXT_SBLOCK(cur)->prev_size = cur->size;
/* insert new block after prv */
prv = BLOCKAT(ALIGNWORD(sizeof(sma_header_t)));
cur->fnext = prv->fnext;
prv->fnext = OFFSET(cur);
cur->fprev = OFFSET(prv);
BLOCKAT(cur->fnext)->fprev = OFFSET(cur);
return size;
}
/* }}} */
/* {{{ apc_sma_init */
void apc_sma_init(int numseg, size_t segsize, char *mmap_file_mask TSRMLS_DC)
{
uint i;
if (sma_initialized) {
return;
}
sma_initialized = 1;
#if APC_MMAP
/*
* I don't think multiple anonymous mmaps makes any sense
* so force sma_numseg to 1 in this case
*/
if(!mmap_file_mask ||
(mmap_file_mask && !strlen(mmap_file_mask)) ||
(mmap_file_mask && !strcmp(mmap_file_mask, "/dev/zero"))) {
sma_numseg = 1;
} else {
sma_numseg = numseg > 0 ? numseg : DEFAULT_NUMSEG;
}
#else
sma_numseg = numseg > 0 ? numseg : DEFAULT_NUMSEG;
#endif
sma_segsize = segsize > 0 ? segsize : DEFAULT_SEGSIZE;
sma_segments = (apc_segment_t*) apc_emalloc((sma_numseg * sizeof(apc_segment_t)) TSRMLS_CC);
for (i = 0; i < sma_numseg; i++) {
sma_header_t* header;
block_t *first, *empty, *last;
void* shmaddr;
#if APC_MMAP
sma_segments[i] = apc_mmap(mmap_file_mask, sma_segsize TSRMLS_CC);
if(sma_numseg != 1) memcpy(&mmap_file_mask[strlen(mmap_file_mask)-6], "XXXXXX", 6);
#else
sma_segments[i] = apc_shm_attach(apc_shm_create(i, sma_segsize TSRMLS_CC), sma_segsize TSRMLS_CC);
#endif
sma_segments[i].size = sma_segsize;
shmaddr = sma_segments[i].shmaddr;
header = (sma_header_t*) shmaddr;
apc_lck_create(NULL, 0, 1, header->sma_lock);
header->segsize = sma_segsize;
header->avail = sma_segsize - ALIGNWORD(sizeof(sma_header_t)) - ALIGNWORD(sizeof(block_t)) - ALIGNWORD(sizeof(block_t));
#if ALLOC_DISTRIBUTION
{
int j;
for(j=0; j<30; j++) header->adist[j] = 0;
}
#endif
first = BLOCKAT(ALIGNWORD(sizeof(sma_header_t)));
first->size = 0;
first->fnext = ALIGNWORD(sizeof(sma_header_t)) + ALIGNWORD(sizeof(block_t));
first->fprev = 0;
first->prev_size = 0;
SET_CANARY(first);
#ifdef __APC_SMA_DEBUG__
first->id = -1;
#endif
empty = BLOCKAT(first->fnext);
empty->size = header->avail - ALIGNWORD(sizeof(block_t));
empty->fnext = OFFSET(empty) + empty->size;
empty->fprev = ALIGNWORD(sizeof(sma_header_t));
empty->prev_size = 0;
SET_CANARY(empty);
#ifdef __APC_SMA_DEBUG__
empty->id = -1;
#endif
last = BLOCKAT(empty->fnext);
last->size = 0;
last->fnext = 0;
last->fprev = OFFSET(empty);
last->prev_size = empty->size;
SET_CANARY(last);
#ifdef __APC_SMA_DEBUG__
last->id = -1;
#endif
}
}
/* }}} */
/* {{{ apc_sma_cleanup */
void apc_sma_cleanup(TSRMLS_D)
{
uint i;
assert(sma_initialized);
for (i = 0; i < sma_numseg; i++) {
apc_lck_destroy(SMA_LCK(i));
#if APC_MMAP
apc_unmap(&sma_segments[i] TSRMLS_CC);
#else
apc_shm_detach(&sma_segments[i] TSRMLS_CC);
#endif
}
sma_initialized = 0;
apc_efree(sma_segments TSRMLS_CC);
}
/* }}} */
/* {{{ apc_sma_malloc_ex */
void* apc_sma_malloc_ex(size_t n, size_t fragment, size_t* allocated TSRMLS_DC)
{
size_t off;
uint i;
int nuked = 0;
restart:
assert(sma_initialized);
LOCK(SMA_LCK(sma_lastseg));
off = sma_allocate(SMA_HDR(sma_lastseg), n, fragment, allocated);
if(off == -1 && APCG(current_cache)) {
/* retry failed allocation after we expunge */
UNLOCK(SMA_LCK(sma_lastseg));
APCG(current_cache)->expunge_cb(APCG(current_cache), (n+fragment) TSRMLS_CC);
LOCK(SMA_LCK(sma_lastseg));
off = sma_allocate(SMA_HDR(sma_lastseg), n, fragment, allocated);
}
if (off != -1) {
void* p = (void *)(SMA_ADDR(sma_lastseg) + off);
UNLOCK(SMA_LCK(sma_lastseg));
#ifdef VALGRIND_MALLOCLIKE_BLOCK
VALGRIND_MALLOCLIKE_BLOCK(p, n, 0, 0);
#endif
return p;
}
UNLOCK(SMA_LCK(sma_lastseg));
for (i = 0; i < sma_numseg; i++) {
if (i == sma_lastseg) {
continue;
}
LOCK(SMA_LCK(i));
off = sma_allocate(SMA_HDR(i), n, fragment, allocated);
if(off == -1 && APCG(current_cache)) {
/* retry failed allocation after we expunge */
UNLOCK(SMA_LCK(i));
APCG(current_cache)->expunge_cb(APCG(current_cache), (n+fragment) TSRMLS_CC);
LOCK(SMA_LCK(i));
off = sma_allocate(SMA_HDR(i), n, fragment, allocated);
}
if (off != -1) {
void* p = (void *)(SMA_ADDR(i) + off);
UNLOCK(SMA_LCK(i));
sma_lastseg = i;
#ifdef VALGRIND_MALLOCLIKE_BLOCK
VALGRIND_MALLOCLIKE_BLOCK(p, n, 0, 0);
#endif
return p;
}
UNLOCK(SMA_LCK(i));
}
/* I've tried being nice, but now you're just asking for it */
if(!nuked) {
apc_cache->expunge_cb(apc_cache, (n+fragment) TSRMLS_CC);
apc_user_cache->expunge_cb(apc_user_cache, (n+fragment) TSRMLS_CC);
nuked = 1;
goto restart;
}
/* now, I've truly and well given up */
return NULL;
}
/* }}} */
/* {{{ apc_sma_malloc */
void* apc_sma_malloc(size_t n TSRMLS_DC)
{
size_t allocated;
void *p = apc_sma_malloc_ex(n, MINBLOCKSIZE, &allocated TSRMLS_CC);
return p;
}
/* }}} */
/* {{{ apc_sma_realloc */
void* apc_sma_realloc(void *p, size_t n TSRMLS_DC)
{
apc_sma_free(p TSRMLS_CC);
return apc_sma_malloc(n TSRMLS_CC);
}
/* }}} */
/* {{{ apc_sma_strdup */
char* apc_sma_strdup(const char* s TSRMLS_DC)
{
void* q;
int len;
if(!s) return NULL;
len = strlen(s)+1;
q = apc_sma_malloc(len TSRMLS_CC);
if(!q) return NULL;
memcpy(q, s, len);
return q;
}
/* }}} */
/* {{{ apc_sma_free */
void apc_sma_free(void* p TSRMLS_DC)
{
uint i;
size_t offset;
if (p == NULL) {
return;
}
assert(sma_initialized);
for (i = 0; i < sma_numseg; i++) {
offset = (size_t)((char *)p - SMA_ADDR(i));
if (p >= (void*)SMA_ADDR(i) && offset < sma_segsize) {
LOCK(SMA_LCK(i));
sma_deallocate(SMA_HDR(i), offset);
UNLOCK(SMA_LCK(i));
#ifdef VALGRIND_FREELIKE_BLOCK
VALGRIND_FREELIKE_BLOCK(p, 0);
#endif
return;
}
}
apc_error("apc_sma_free: could not locate address %p" TSRMLS_CC, p);
}
/* }}} */
#ifdef APC_MEMPROTECT
/* {{{ apc_sma_protect */
void* apc_sma_protect(void *p)
{
unsigned int i = 0;
size_t offset;
if (p == NULL) {
return NULL;
}
if(SMA_RO(sma_lastseg) == NULL) return p;
offset = (size_t)((char *)p - SMA_ADDR(sma_lastseg));
if(p >= (void*)SMA_ADDR(sma_lastseg) && offset < sma_segsize) {
return SMA_RO(sma_lastseg) + offset;
}
for (i = 0; i < sma_numseg; i++) {
offset = (size_t)((char *)p - SMA_ADDR(i));
if (p >= (void*)SMA_ADDR(i) && offset < sma_segsize) {
return SMA_RO(i) + offset;
}
}
return NULL;
}
/* }}} */
/* {{{ apc_sma_unprotect */
void* apc_sma_unprotect(void *p)
{
unsigned int i = 0;
size_t offset;
if (p == NULL) {
return NULL;
}
if(SMA_RO(sma_lastseg) == NULL) return p;
offset = (size_t)((char *)p - SMA_RO(sma_lastseg));
if(p >= (void*)SMA_RO(sma_lastseg) && offset < sma_segsize) {
return SMA_ADDR(sma_lastseg) + offset;
}
for (i = 0; i < sma_numseg; i++) {
offset = (size_t)((char *)p - SMA_RO(i));
if (p >= (void*)SMA_RO(i) && offset < sma_segsize) {
return SMA_ADDR(i) + offset;
}
}
return NULL;
}
/* }}} */
#else
/* {{{ apc_sma_protect */
void* apc_sma_protect(void *p) { return p; }
/* }}} */
/* {{{ apc_sma_unprotect */
void* apc_sma_unprotect(void *p) { return p; }
/* }}} */
#endif
/* {{{ apc_sma_info */
apc_sma_info_t* apc_sma_info(zend_bool limited TSRMLS_DC)
{
apc_sma_info_t* info;
apc_sma_link_t** link;
uint i;
char* shmaddr;
block_t* prv;
if (!sma_initialized) {
return NULL;
}
info = (apc_sma_info_t*) apc_emalloc(sizeof(apc_sma_info_t) TSRMLS_CC);
info->num_seg = sma_numseg;
info->seg_size = sma_segsize - (ALIGNWORD(sizeof(sma_header_t)) + ALIGNWORD(sizeof(block_t)) + ALIGNWORD(sizeof(block_t)));
info->list = apc_emalloc(info->num_seg * sizeof(apc_sma_link_t*) TSRMLS_CC);
for (i = 0; i < sma_numseg; i++) {
info->list[i] = NULL;
}
if(limited) return info;
/* For each segment */
for (i = 0; i < sma_numseg; i++) {
RDLOCK(SMA_LCK(i));
shmaddr = SMA_ADDR(i);
prv = BLOCKAT(ALIGNWORD(sizeof(sma_header_t)));
link = &info->list[i];
/* For each block in this segment */
while (BLOCKAT(prv->fnext)->fnext != 0) {
block_t* cur = BLOCKAT(prv->fnext);
#ifdef __APC_SMA_DEBUG__
CHECK_CANARY(cur);
#endif
*link = apc_emalloc(sizeof(apc_sma_link_t) TSRMLS_CC);
(*link)->size = cur->size;
(*link)->offset = prv->fnext;
(*link)->next = NULL;
link = &(*link)->next;
prv = cur;
#if ALLOC_DISTRIBUTION
sma_header_t* header = (sma_header_t*) segment->shmaddr;
memcpy(info->seginfo[i].adist, header->adist, sizeof(size_t) * 30);
#endif
}
RDUNLOCK(SMA_LCK(i));
}
return info;
}
/* }}} */
/* {{{ apc_sma_free_info */
void apc_sma_free_info(apc_sma_info_t* info TSRMLS_DC)
{
int i;
for (i = 0; i < info->num_seg; i++) {
apc_sma_link_t* p = info->list[i];
while (p) {
apc_sma_link_t* q = p;
p = p->next;
apc_efree(q TSRMLS_CC);
}
}
apc_efree(info->list TSRMLS_CC);
apc_efree(info TSRMLS_CC);
}
/* }}} */
/* {{{ apc_sma_get_avail_mem */
size_t apc_sma_get_avail_mem()
{
size_t avail_mem = 0;
uint i;
for (i = 0; i < sma_numseg; i++) {
sma_header_t* header = SMA_HDR(i);
avail_mem += header->avail;
}
return avail_mem;
}
/* }}} */
/* {{{ apc_sma_get_avail_size */
zend_bool apc_sma_get_avail_size(size_t size)
{
uint i;
for (i = 0; i < sma_numseg; i++) {
sma_header_t* header = SMA_HDR(i);
if (header->avail > size) {
return 1;
}
}
return 0;
}
/* }}} */
#if ALLOC_DISTRIBUTION
size_t *apc_sma_get_alloc_distribution(void) {
sma_header_t* header = (sma_header_t*) segment->sma_shmaddr;
return header->adist;
}
#endif
/*
* Local variables:
* tab-width: 4
* c-basic-offset: 4
* End:
* vim>600: expandtab sw=4 ts=4 sts=4 fdm=marker
* vim<600: expandtab sw=4 ts=4 sts=4
*/