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
|
/**
* Copyright 2009-2010 10gen, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <stdio.h>
#include <php.h>
#include "test_mongo.h"
#include "php_mongo.h"
int test_mongo() {
printf("running Mongo tests: ");
run_test(test_php_mongo_free_cursor_node);
printf("\n");
}
int test_php_mongo_free_cursor_node() {
cursor_node *node1, *node2, *node3;
zend_rsrc_list_entry *le;
// alloc
node1 = (cursor_node*)pemalloc(sizeof(cursor_node), 1);
node2 = (cursor_node*)pemalloc(sizeof(cursor_node), 1);
node3 = (cursor_node*)pemalloc(sizeof(cursor_node), 1);
le = (zend_rsrc_list_entry*)emalloc(sizeof(zend_rsrc_list_entry));
le->ptr = node1;
// [node1][<->][NODE2][<->][node3]
node1->prev = node3->next = 0;
node1->next = node3->prev = node2;
node2->prev = node1;
node2->next = node3;
php_mongo_free_cursor_node(node2, le);
assert(le->ptr == node1);
assert(node1->next == node3);
assert(node3->prev == node1);
assert(node1->prev == 0);
assert(node3->next == 0);
// [node1][<->][NODE2]
node2 = node3;
php_mongo_free_cursor_node(node2, le);
assert(le->ptr == node1);
assert(node1->next == 0);
assert(node1->prev == 0);
// [NODE1]
php_mongo_free_cursor_node(node1, le);
assert(le->ptr == 0);
// realloc
node1 = (cursor_node*)pemalloc(sizeof(cursor_node), 1);
node2 = (cursor_node*)pemalloc(sizeof(cursor_node), 1);
node1->prev = 0;
node1->next = node2;
node2->prev = node1;
node2->next = 0;
le->ptr = node1;
// [NODE1][<->][node2]
php_mongo_free_cursor_node(node1, le);
assert(le->ptr == node2);
assert(node2->prev == 0);
assert(node2->next == 0);
// [NODE2] (repeat of [NODE1], above)
php_mongo_free_cursor_node(node2, le);
assert(le->ptr == 0);
efree(le);
}
|
