80 lines
1.5 KiB
C
80 lines
1.5 KiB
C
#include "class.h"
|
|
|
|
#include "type.h"
|
|
|
|
#include <assert.h>
|
|
#include <blue/core/class.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
void *b_class_get(b_type id)
|
|
{
|
|
struct b_type_registration *r = b_type_get_registration(id);
|
|
if (!r) {
|
|
return NULL;
|
|
}
|
|
|
|
return r->r_class;
|
|
}
|
|
|
|
const char *b_class_get_name(const struct _b_class *c)
|
|
{
|
|
if (!c) {
|
|
return NULL;
|
|
}
|
|
|
|
assert(c->c_magic == B_CLASS_MAGIC);
|
|
|
|
return c->c_type->r_info->t_name;
|
|
}
|
|
|
|
void *b_class_get_interface(const struct _b_class *c, const union b_type_id *id)
|
|
{
|
|
if (!c) {
|
|
return NULL;
|
|
}
|
|
|
|
assert(c->c_magic == B_CLASS_MAGIC);
|
|
|
|
const struct b_type_registration *type_reg = c->c_type;
|
|
struct b_type_component *comp
|
|
= b_type_get_component(&type_reg->r_components, id);
|
|
|
|
if (!comp) {
|
|
return NULL;
|
|
}
|
|
|
|
return (char *)c + comp->c_class_data_offset;
|
|
}
|
|
|
|
b_result b_class_instantiate(
|
|
struct b_type_registration *type, struct _b_class **out_class)
|
|
{
|
|
struct _b_class *out = malloc(type->r_class_size);
|
|
if (!out) {
|
|
return B_RESULT_ERR(NO_MEMORY);
|
|
}
|
|
|
|
memset(out, 0x0, type->r_class_size);
|
|
|
|
out->c_magic = B_CLASS_MAGIC;
|
|
out->c_type = type;
|
|
|
|
struct b_queue_entry *entry = b_queue_first(&type->r_class_hierarchy);
|
|
while (entry) {
|
|
struct b_type_component *comp
|
|
= b_unbox(struct b_type_component, entry, c_entry);
|
|
const struct b_type_info *class_info = comp->c_type->r_info;
|
|
void *class_data = (char *)out + comp->c_class_data_offset;
|
|
|
|
if (class_info->t_class_init) {
|
|
class_info->t_class_init(out, class_data);
|
|
}
|
|
|
|
entry = b_queue_next(entry);
|
|
}
|
|
|
|
*out_class = out;
|
|
return B_RESULT_SUCCESS;
|
|
}
|