mars/brick.c

400 lines
11 KiB
C
Raw Normal View History

2010-07-23 11:55:18 +00:00
// (c) 2010 Thomas Schoebel-Theuer / 1&1 Internet AG
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/string.h>
2010-07-30 05:46:22 +00:00
//#define BRICK_DEBUGGING
2010-07-23 11:55:18 +00:00
#define _STRATEGY
#define BRICK_OBJ_NR /*empty => leads to an open array */
2010-07-30 05:46:22 +00:00
2010-07-23 11:55:18 +00:00
#include "brick.h"
//////////////////////////////////////////////////////////////
// object stuff
//////////////////////////////////////////////////////////////
// brick stuff
static int nr_brick_types = 0;
static const struct generic_brick_type *brick_types[MAX_BRICK_TYPES] = {};
int generic_register_brick_type(const struct generic_brick_type *new_type)
{
int i;
int found = -1;
2010-07-30 05:46:22 +00:00
BRICK_DBG("generic_register_brick_type() name=%s\n", new_type->type_name);
2010-07-23 11:55:18 +00:00
for (i = 0; i < nr_brick_types; i++) {
if (!brick_types[i]) {
found = i;
continue;
}
if (!strcmp(brick_types[i]->type_name, new_type->type_name)) {
2010-07-30 05:46:22 +00:00
BRICK_ERR("sorry, bricktype %s is already registered.\n", new_type->type_name);
2010-07-23 11:55:18 +00:00
return -EEXIST;
}
}
if (found < 0) {
if (nr_brick_types >= MAX_BRICK_TYPES) {
2010-07-30 05:46:22 +00:00
BRICK_ERR("sorry, cannot register bricktype %s.\n", new_type->type_name);
return -ENOMEM;
2010-07-23 11:55:18 +00:00
}
found = nr_brick_types++;
}
brick_types[found] = new_type;
BRICK_DBG("generic_register_brick_type() done.\n");
return 0;
}
EXPORT_SYMBOL_GPL(generic_register_brick_type);
int generic_unregister_brick_type(const struct generic_brick_type *old_type)
{
BRICK_DBG("generic_unregister_brick_type()\n");
return -1; // NYI
}
EXPORT_SYMBOL_GPL(generic_unregister_brick_type);
int generic_brick_init_full(
void *data,
int size,
const struct generic_brick_type *brick_type,
const struct generic_input_type **input_types,
const struct generic_output_type **output_types,
char **names)
{
struct generic_brick *brick = data;
int status;
int i;
BRICK_DBG("generic_brick_init_full()\n");
// first, call the generic constructors
status = generic_brick_init(brick_type, brick, *names++);
if (status)
return status;
data += brick_type->brick_size;
size -= brick_type->brick_size;
2010-07-30 05:46:22 +00:00
if (size < 0) {
BRICK_ERR("Not enough MEMORY\n");
2010-07-23 11:55:18 +00:00
return -ENOMEM;
2010-07-30 05:46:22 +00:00
}
2010-07-23 11:55:18 +00:00
if (!input_types) {
BRICK_DBG("generic_brick_init_full: switch to default input_types\n");
input_types = brick_type->default_input_types;
names = brick_type->default_input_names;
}
if (input_types) {
BRICK_DBG("generic_brick_init_full: input_types\n");
brick->inputs = data;
data += sizeof(void*) * brick_type->max_inputs;
size -= sizeof(void*) * brick_type->max_inputs;
2010-07-30 05:46:22 +00:00
if (size < 0) {
return -ENOMEM;
}
2010-07-23 11:55:18 +00:00
for (i = 0; i < brick_type->max_inputs; i++) {
struct generic_input *input = data;
const struct generic_input_type *type = *input_types++;
BRICK_DBG("generic_brick_init_full: calling generic_input_init()\n");
status = generic_input_init(brick, i, type, input, names ? *names++ : type->type_name);
if (status)
return status;
data += type->input_size;
size -= type->input_size;
if (size < 0)
return -ENOMEM;
}
}
if (!output_types) {
BRICK_DBG("generic_brick_init_full: switch to default output_types\n");
output_types = brick_type->default_output_types;
names = brick_type->default_output_names;
}
if (output_types) {
BRICK_DBG("generic_brick_init_full: output_types\n");
brick->outputs = data;
data += sizeof(void*) * brick_type->max_outputs;
size -= sizeof(void*) * brick_type->max_outputs;
if (size < 0)
return -1;
for (i = 0; i < brick_type->max_outputs; i++) {
struct generic_output *output = data;
const struct generic_output_type *type = *output_types++;
BRICK_DBG("generic_brick_init_full: calling generic_output_init()\n");
generic_output_init(brick, i, type, output, names ? *names++ : type->type_name);
if (status)
return status;
data += type->output_size;
size -= type->output_size;
if (size < 0)
return -ENOMEM;
}
}
// call the specific constructors
BRICK_DBG("generic_brick_init_full: call specific contructors.\n");
if (brick_type->brick_construct) {
BRICK_DBG("generic_brick_init_full: calling brick_construct()\n");
status = brick_type->brick_construct(brick);
if (status)
return status;
}
for (i = 0; i < brick_type->max_inputs; i++) {
struct generic_input *input = brick->inputs[i];
if (!input)
continue;
if (!input->type) {
BRICK_ERR("input has no associated type!\n");
continue;
}
if (input->type->input_construct) {
BRICK_DBG("generic_brick_init_full: calling input_construct()\n");
status = input->type->input_construct(input);
if (status)
return status;
}
}
for (i = 0; i < brick_type->max_outputs; i++) {
struct generic_output *output = brick->outputs[i];
if (!output)
continue;
if (!output->type) {
BRICK_ERR("output has no associated type!\n");
continue;
}
if (output->type->output_construct) {
BRICK_DBG("generic_brick_init_full: calling output_construct()\n");
status = output->type->output_construct(output);
if (status)
return status;
}
}
return 0;
}
EXPORT_SYMBOL_GPL(generic_brick_init_full);
int generic_brick_exit_full(struct generic_brick *brick)
{
int i;
int status;
// first, check all outputs
for (i = 0; i < brick->nr_outputs; i++) {
struct generic_output *output = brick->outputs[i];
if (!output)
continue;
if (!output->type) {
BRICK_ERR("output has no associated type!\n");
continue;
}
if (output->nr_connected) {
BRICK_DBG("output is connected!\n");
return -EPERM;
}
}
// ok, test succeeded. start destruction...
for (i = 0; i < brick->type->max_outputs; i++) {
struct generic_output *output = brick->outputs[i];
if (!output)
continue;
if (!output->type) {
BRICK_ERR("output has no associated type!\n");
continue;
}
if (output->type->output_destruct) {
BRICK_DBG("generic_brick_exit_full: calling output_destruct()\n");
status = output->type->output_destruct(output);
if (status)
return status;
brick->outputs[i] = NULL; // others may remain leftover
}
}
for (i = 0; i < brick->type->max_inputs; i++) {
struct generic_input *input = brick->inputs[i];
if (!input)
continue;
if (!input->type) {
BRICK_ERR("input has no associated type!\n");
continue;
}
if (input->type->input_destruct) {
BRICK_DBG("generic_brick_exit_full: calling input_destruct()\n");
status = input->type->input_destruct(input);
if (status)
return status;
brick->inputs[i] = NULL; // others may remain leftover
status = generic_disconnect(input);
if (status)
return status;
}
}
if (brick->type->brick_destruct) {
BRICK_DBG("generic_brick_exit_full: calling brick_destruct()\n");
status = brick->type->brick_destruct(brick);
if (status)
return status;
}
return 0;
}
EXPORT_SYMBOL_GPL(generic_brick_exit_full);
2010-07-30 11:50:20 +00:00
int generic_brick_exit_recursively(struct generic_brick *brick, bool destroy_inputs)
2010-07-23 11:55:18 +00:00
{
int final_status = 0;
2010-07-30 11:50:20 +00:00
LIST_HEAD(tmp);
list_add(&brick->tmp_head, &tmp);
while (!list_empty(&tmp)) {
2010-07-23 11:55:18 +00:00
int i;
int status;
2010-07-30 11:50:20 +00:00
int postpone = 0;
brick = container_of(tmp.next, struct generic_brick, tmp_head);
list_del_init(&brick->tmp_head);
2010-07-23 11:55:18 +00:00
for (i = 0; i < brick->nr_outputs; i++) {
struct generic_output *output = brick->outputs[i];
2010-07-30 11:50:20 +00:00
if (output && output->nr_connected) {
postpone += output->nr_connected;
2010-07-23 11:55:18 +00:00
}
}
for (i = 0; i < brick->nr_inputs; i++) {
struct generic_input *input = brick->inputs[i];
2010-07-30 11:50:20 +00:00
if (input && input->connect) {
2010-07-23 11:55:18 +00:00
struct generic_brick *other = input->connect->brick;
2010-07-30 11:50:20 +00:00
if (destroy_inputs) {
list_add(&other->tmp_head, &tmp);
postpone++;
} else {
}
2010-07-23 11:55:18 +00:00
}
}
2010-07-30 11:50:20 +00:00
if (postpone) {
list_add_tail(&brick->tmp_head, &tmp);
continue;
}
2010-07-23 11:55:18 +00:00
status = generic_brick_exit_full(brick);
if (status)
final_status = status;
}
return final_status;
}
EXPORT_SYMBOL_GPL(generic_brick_exit_recursively);
////////////////////////////////////////////////////////////////////////
// default implementations
2010-08-01 20:21:18 +00:00
int default_init_object_layout(struct generic_output *output, struct generic_object_layout *object_layout, int aspect_max, const struct generic_object_type *object_type)
{
void *data;
int status;
data = kzalloc(aspect_max * sizeof(void*), GFP_KERNEL);
if (!data)
return -ENOMEM;
object_layout->aspect_layouts = data;
object_layout->object_type = object_type;
object_layout->aspect_count = 0;
object_layout->aspect_max = aspect_max;
object_layout->object_size = object_type->default_size;
status = output->ops->make_object_layout(output, object_layout);
if (unlikely(status < 0)) {
kfree(data);
object_layout->object_type = NULL;
BRICK_ERR("emergency, cannot add aspects to object_layout %s!\n", object_type->object_type_name);
goto done;
}
BRICK_INF("OK, object_layout %s init succeeded.\n", object_type->object_type_name);
done:
return status;
}
EXPORT_SYMBOL_GPL(default_init_object_layout);
2010-07-23 11:55:18 +00:00
int default_make_object_layout(struct generic_output *output, struct generic_object_layout *object_layout)
{
2010-07-30 05:46:22 +00:00
struct generic_brick *brick = output->brick;
const struct generic_output_type *output_type = output->type;
2010-07-23 11:55:18 +00:00
const struct generic_object_type *object_type = object_layout->object_type;
2010-07-30 05:46:22 +00:00
const int nr = object_type->brick_obj_nr;
const struct generic_aspect_type *aspect_type = output_type->aspect_types[nr];
int layout_code = output_type->layout_code[nr];
2010-07-23 11:55:18 +00:00
int status;
2010-07-30 05:46:22 +00:00
int aspect_size;
2010-07-23 11:55:18 +00:00
2010-07-30 05:46:22 +00:00
if (!aspect_type) {
BRICK_ERR("aspect type on %s does not exist\n", output_type->type_name);
return -ENOENT;
}
aspect_size = aspect_type->aspect_size;
if (layout_code == LAYOUT_ALL) {
int i;
for (i = 0; i < brick->type->max_inputs; i++) {
struct generic_input *input = brick->inputs[i];
if (input && input->connect) {
int substatus = input->connect->ops->make_object_layout(input->connect, object_layout);
if (substatus < 0)
return substatus;
aspect_size += substatus;
}
}
} else {
for (; layout_code != 0; layout_code >>= 8) {
unsigned int my_code = layout_code & 255;
struct generic_input *input;
int substatus;
if (my_code == 255)
break;
if (my_code >= brick->type->max_inputs)
continue;
input = brick->inputs[my_code];
if (!input || !input->connect)
continue;
substatus = input->connect->ops->make_object_layout(input->connect, object_layout);
2010-07-23 11:55:18 +00:00
if (substatus < 0)
return substatus;
aspect_size += substatus;
}
}
2010-07-30 05:46:22 +00:00
status = generic_add_aspect(output, object_layout, aspect_type);
2010-07-23 11:55:18 +00:00
if (status < 0)
return status;
return aspect_size;
}
2010-07-30 05:46:22 +00:00
EXPORT_SYMBOL_GPL(default_make_object_layout);
2010-08-01 20:21:18 +00:00
struct generic_object *alloc_generic(struct generic_output *output, struct generic_object_layout *object_layout)
{
void *data;
struct generic_object *object;
data = kzalloc(object_layout->object_size, GFP_KERNEL);
if (unlikely(!data))
goto err;
object = generic_construct(data, object_layout);
if (unlikely(!object))
goto err_free;
return object;
err_free:
kfree(data);
err:
return NULL;
}
EXPORT_SYMBOL_GPL(alloc_generic);
2010-08-02 16:31:10 +00:00
void free_generic(struct generic_object *object)
{
kfree(object);
}
EXPORT_SYMBOL_GPL(free_generic);