85 lines
1.6 KiB
C
85 lines
1.6 KiB
C
#include "std.h"
|
|
#include "lpc_incl.h"
|
|
|
|
#ifdef CLASS_STATS
|
|
int num_classes;
|
|
int total_class_size;
|
|
#endif
|
|
|
|
void dealloc_class (array_t * p) {
|
|
int i;
|
|
|
|
#ifdef CLASS_STATS
|
|
num_classes--;
|
|
total_class_size -= sizeof(array_t) + sizeof(svalue_t) * (p->size - 1);
|
|
#endif
|
|
for (i = p->size; i--;)
|
|
free_svalue(&p->item[i], "dealloc_class");
|
|
FREE((char *) p);
|
|
}
|
|
|
|
void free_class (array_t * p)
|
|
{
|
|
if (--(p->ref) > 0)
|
|
return;
|
|
|
|
dealloc_class(p);
|
|
}
|
|
|
|
array_t *allocate_class (class_def_t * cld, int has_values) {
|
|
array_t *p;
|
|
int n = cld->size;
|
|
if(!n)
|
|
n++;
|
|
|
|
#ifdef CLASS_STATS
|
|
num_classes++;
|
|
total_class_size += sizeof(array_t) + sizeof(svalue_t) * (n - 1);
|
|
#endif
|
|
|
|
p = (array_t *)DXALLOC(sizeof(array_t) + sizeof(svalue_t) * (n - 1), TAG_CLASS, "allocate_class");
|
|
n = cld->size;
|
|
p->ref = 1;
|
|
p->size = n;
|
|
if (has_values) {
|
|
while (n--)
|
|
p->item[n] = *sp--;
|
|
} else {
|
|
while (n--)
|
|
p->item[n] = const0;
|
|
}
|
|
return p;
|
|
}
|
|
|
|
array_t *allocate_class_by_size (int size) {
|
|
array_t *p;
|
|
|
|
#ifdef CLASS_STATS
|
|
num_classes++;
|
|
total_class_size += sizeof(array_t) + sizeof(svalue_t) * (size - 1);
|
|
#endif
|
|
p = (array_t *)DXALLOC(sizeof(array_t) + sizeof(svalue_t) * (size - 1), TAG_CLASS, "allocate_class");
|
|
p->ref = 1;
|
|
p->size = size;
|
|
|
|
while (size--)
|
|
p->item[size] = const0;
|
|
|
|
return p;
|
|
}
|
|
|
|
array_t *allocate_empty_class_by_size (int size) {
|
|
array_t *p;
|
|
|
|
#ifdef CLASS_STATS
|
|
num_classes++;
|
|
total_class_size += sizeof(array_t) + sizeof(svalue_t) * (size - 1);
|
|
#endif
|
|
p = (array_t *)DXALLOC(sizeof(array_t) + sizeof(svalue_t) * (size - 1), TAG_CLASS, "allocate_class");
|
|
p->ref = 1;
|
|
p->size = size;
|
|
|
|
return p;
|
|
}
|
|
|