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
|
/*
* Copyright (C)2005-2022 Haxe Foundation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
#include <neko.h>
#include <neko_mod.h>
/**
<doc>
<h1>Memory</h1>
<p>
An API for memory manipulation and statistics.
</p>
</doc>
**/
typedef struct _vtree {
int_val v;
struct _vtree *left;
struct _vtree *right;
} vtree;
typedef struct {
vtree **t;
int s;
} vparams;
static int mem_cache( void *v, vtree **t ) {
vtree *p = *t;
vtree *prev = NULL;
while( p != NULL ) {
if( p->v == (int_val)v )
return 1;
prev = p;
if( p->v > (int_val)v )
p = p->left;
else
p = p->right;
}
p = (vtree*)alloc(sizeof(vtree));
p->v = (int_val)v;
p->left = NULL;
p->right = NULL;
if( prev == NULL )
*t = p;
else {
if( prev->v > p->v )
prev->left = p;
else
prev->right = p;
}
return 0;
}
static void mem_obj_field( value v, field f, void *_p );
static int mem_module( neko_module *m, vtree **l );
static int mem_size_rec( value v, vtree **l ) {
switch( val_type(v) ) {
case VAL_INT:
case VAL_BOOL:
case VAL_NULL:
return 0;
case VAL_FLOAT:
if( mem_cache(v,l) )
return 0;
return sizeof(vfloat);
case VAL_INT32:
if( mem_cache(v,l) )
return 0;
return sizeof(vint32);
case VAL_STRING:
if( mem_cache(v,l) )
return 0;
return sizeof(value) + val_strlen(v);
case VAL_OBJECT:
if( mem_cache(v,l) )
return 0;
{
vparams p;
p.t = l;
p.s = sizeof(vobject);
val_iter_fields(v,mem_obj_field,&p);
if( ((vobject*)v)->proto != NULL )
p.s += mem_size_rec((value)((vobject*)v)->proto,l);
return p.s;
}
case VAL_ARRAY:
if( mem_cache(v,l) )
return 0;
{
int t = sizeof(value);
int size = val_array_size(v);
int i;
t += size * sizeof(value);
for(i=0;i<size;i++)
t += mem_size_rec(val_array_ptr(v)[i],l);
return t;
}
case VAL_FUNCTION:
if( mem_cache(v,l) )
return 0;
{
int t = sizeof(vfunction);
t += mem_size_rec(((vfunction*)v)->env,l);
if( val_tag(v) == VAL_PRIMITIVE )
t += mem_size_rec((value)((vfunction*)v)->module,l);
else
t += mem_module(((vfunction*)v)->module,l);
return t;
}
case VAL_ABSTRACT:
{
int t;
if( mem_cache(v,l) )
return 0;
t = sizeof(vabstract);
if( val_kind(v) == neko_kind_module )
t += mem_module((neko_module*)val_data(v),l);
else if( val_kind(v) == k_hash ) {
vhash *h = (vhash*)val_data(v);
int i;
t += sizeof(vhash);
t += sizeof(hcell*) * h->ncells;
for(i=0;i<h->ncells;i++) {
hcell *c = h->cells[i];
while( c != NULL ) {
t += sizeof(hcell);
t += mem_size_rec(c->key,l);
t += mem_size_rec(c->val,l);
c = c->next;
}
}
}
return t;
}
default:
val_throw(alloc_string("mem_size : Unexpected value"));
break;
}
return 0;
}
static void mem_obj_field( value v, field f, void *_p ) {
vparams *p = (vparams*)_p;
p->s += sizeof(objcell);
p->s += mem_size_rec(v,p->t);
}
static int mem_module( neko_module *m, vtree **l ) {
int t = 0;
unsigned int i;
if( mem_cache(m,l) )
return 0;
t += sizeof(neko_module);
t += m->codesize * sizeof(int_val);
t += m->nglobals * sizeof(int_val);
for(i=0;i<m->nglobals;i++)
t += mem_size_rec(m->globals[i],l);
t += m->nfields * sizeof(value*);
for(i=0;i<m->nfields;i++)
t += mem_size_rec(m->fields[i],l);
t += mem_size_rec(m->loader,l);
t += mem_size_rec(m->exports,l);
t += mem_size_rec(m->dbgtbl,l);
if( m->dbgidxs )
t += sizeof(neko_debug) * (m->codesize >> 5);
t += mem_size_rec(m->name,l);
return t;
}
/**
mem_size : any -> int
<doc>Calculate the quite precise amount of VM memory reachable from this value</doc>
**/
static value mem_size( value v ) {
vtree *t = NULL;
return alloc_int(mem_size_rec(v,&t));
}
/**
mem_local_size : any -> any array -> int
<doc>Calculate the quite precise amount of VM memory reachable from this value, without scanning the values contained in the array.</doc>
**/
static value mem_local_size( value v, value a ) {
vtree *t = NULL;
int i;
val_check(a,array);
for(i=0;i<val_array_size(a);i++) {
value k = val_array_ptr(a)[i];
mem_cache(k,&t);
if( val_is_abstract(k) && val_kind(k) == neko_kind_module )
mem_cache(val_data(k),&t);
}
return alloc_int(mem_size_rec(v,&t));
}
DEFINE_PRIM(mem_size,1);
DEFINE_PRIM(mem_local_size,2);
/* ************************************************************************ */
|
