-/*\r
- * Mesa 3-D graphics library\r
- * Version: 6.3\r
- *\r
- * Copyright (C) 2005 Brian Paul All Rights Reserved.\r
- *\r
- * Permission is hereby granted, free of charge, to any person obtaining a\r
- * copy of this software and associated documentation files (the "Software"),\r
- * to deal in the Software without restriction, including without limitation\r
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,\r
- * and/or sell copies of the Software, and to permit persons to whom the\r
- * Software is furnished to do so, subject to the following conditions:\r
- *\r
- * The above copyright notice and this permission notice shall be included\r
- * in all copies or substantial portions of the Software.\r
- *\r
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS\r
- * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\r
- * BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN\r
- * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r
- */\r
-\r
-/**\r
- * \file slang_storage.c\r
- * slang variable storage\r
- * \author Michal Krol\r
- */\r
-\r
-#include "imports.h"\r
-#include "slang_utility.h"\r
-#include "slang_storage.h"\r
-#include "slang_assemble.h"\r
-\r
-/* slang_storage_array */\r
-\r
-void slang_storage_array_construct (slang_storage_array *arr)\r
-{\r
- arr->type = slang_stor_aggregate;\r
- arr->aggregate = NULL;\r
- arr->length = 0;\r
-}\r
-\r
-void slang_storage_array_destruct (slang_storage_array *arr)\r
-{\r
- if (arr->aggregate != NULL)\r
- {\r
- slang_storage_aggregate_destruct (arr->aggregate);\r
- slang_alloc_free (arr->aggregate);\r
- }\r
-}\r
-\r
-/* slang_storage_aggregate */\r
-\r
-void slang_storage_aggregate_construct (slang_storage_aggregate *agg)\r
-{\r
- agg->arrays = NULL;\r
- agg->count = 0;\r
-}\r
-\r
-void slang_storage_aggregate_destruct (slang_storage_aggregate *agg)\r
-{\r
- unsigned int i;\r
- for (i = 0; i < agg->count; i++)\r
- slang_storage_array_destruct (agg->arrays + i);\r
- slang_alloc_free (agg->arrays);\r
-}\r
-\r
-static slang_storage_array *slang_storage_aggregate_push_new (slang_storage_aggregate *agg)\r
-{\r
- slang_storage_array *arr = NULL;\r
- agg->arrays = (slang_storage_array *) slang_alloc_realloc (agg->arrays, agg->count * sizeof (\r
- slang_storage_array), (agg->count + 1) * sizeof (slang_storage_array));\r
- if (agg->arrays != NULL)\r
- {\r
- arr = agg->arrays + agg->count;\r
- slang_storage_array_construct (arr);\r
- agg->count++;\r
- }\r
- return arr;\r
-}\r
-\r
-/* _slang_aggregate_variable() */\r
-\r
-static int aggregate_vector (slang_storage_aggregate *agg, slang_storage_type basic_type,\r
- unsigned int row_count)\r
-{\r
- slang_storage_array *arr = slang_storage_aggregate_push_new (agg);\r
- if (arr == NULL)\r
- return 0;\r
- arr->type = basic_type;\r
- arr->length = row_count;\r
- return 1;\r
-}\r
-\r
-static int aggregate_matrix (slang_storage_aggregate *agg, slang_storage_type basic_type,\r
- unsigned int dimension)\r
-{\r
- slang_storage_array *arr = slang_storage_aggregate_push_new (agg);\r
- if (arr == NULL)\r
- return 0;\r
- arr->type = slang_stor_aggregate;\r
- arr->length = dimension;\r
- arr->aggregate = (slang_storage_aggregate *) slang_alloc_malloc (sizeof (\r
- slang_storage_aggregate));\r
- if (arr->aggregate == NULL)\r
- return 0;\r
- slang_storage_aggregate_construct (arr->aggregate);\r
- if (!aggregate_vector (arr->aggregate, basic_type, dimension))\r
- return 0;\r
- return 1;\r
-}\r
-\r
-static int aggregate_variables (slang_storage_aggregate *agg, const slang_variable_scope *vars,\r
- slang_function_scope *funcs, slang_struct_scope *structs)\r
-{\r
- unsigned int i;\r
- for (i = 0; i < vars->num_variables; i++)\r
- if (!_slang_aggregate_variable (agg, &vars->variables[i].type.specifier,\r
- vars->variables[i].array_size, funcs, structs))\r
- return 0;\r
- return 1;\r
-}\r
-\r
-int _slang_aggregate_variable (slang_storage_aggregate *agg, slang_type_specifier *spec,\r
- slang_operation *array_size, slang_function_scope *funcs, slang_struct_scope *structs)\r
-{\r
- switch (spec->type)\r
- {\r
- case slang_spec_bool:\r
- return aggregate_vector (agg, slang_stor_bool, 1);\r
- case slang_spec_bvec2:\r
- return aggregate_vector (agg, slang_stor_bool, 2);\r
- case slang_spec_bvec3:\r
- return aggregate_vector (agg, slang_stor_bool, 3);\r
- case slang_spec_bvec4:\r
- return aggregate_vector (agg, slang_stor_bool, 4);\r
- case slang_spec_int:\r
- return aggregate_vector (agg, slang_stor_int, 1);\r
- case slang_spec_ivec2:\r
- return aggregate_vector (agg, slang_stor_int, 2);\r
- case slang_spec_ivec3:\r
- return aggregate_vector (agg, slang_stor_int, 3);\r
- case slang_spec_ivec4:\r
- return aggregate_vector (agg, slang_stor_int, 4);\r
- case slang_spec_float:\r
- return aggregate_vector (agg, slang_stor_float, 1);\r
- case slang_spec_vec2:\r
- return aggregate_vector (agg, slang_stor_float, 2);\r
- case slang_spec_vec3:\r
- return aggregate_vector (agg, slang_stor_float, 3);\r
- case slang_spec_vec4:\r
- return aggregate_vector (agg, slang_stor_float, 4);\r
- case slang_spec_mat2:\r
- return aggregate_matrix (agg, slang_stor_float, 2);\r
- case slang_spec_mat3:\r
- return aggregate_matrix (agg, slang_stor_float, 3);\r
- case slang_spec_mat4:\r
- return aggregate_matrix (agg, slang_stor_float, 4);\r
- case slang_spec_sampler1D:\r
- case slang_spec_sampler2D:\r
- case slang_spec_sampler3D:\r
- case slang_spec_samplerCube:\r
- case slang_spec_sampler1DShadow:\r
- case slang_spec_sampler2DShadow:\r
- return aggregate_vector (agg, slang_stor_int, 1);\r
- case slang_spec_struct:\r
- return aggregate_variables (agg, spec->_struct->fields, funcs, structs);\r
- case slang_spec_array:\r
- {\r
- slang_storage_array *arr;\r
- slang_assembly_file file;\r
- slang_assembly_flow_control flow;\r
- slang_assembly_name_space space;\r
- slang_assembly_local_info info;\r
- slang_assembly_stack_info stk;\r
-\r
- arr = slang_storage_aggregate_push_new (agg);\r
- if (arr == NULL)\r
- return 0;\r
- arr->type = slang_stor_aggregate;\r
- arr->aggregate = (slang_storage_aggregate *) slang_alloc_malloc (sizeof (\r
- slang_storage_aggregate));\r
- if (arr->aggregate == NULL)\r
- return 0;\r
- slang_storage_aggregate_construct (arr->aggregate);\r
- if (!_slang_aggregate_variable (arr->aggregate, spec->_array, NULL, funcs, structs))\r
- return 0;\r
- slang_assembly_file_construct (&file);\r
- space.funcs = funcs;\r
- space.structs = structs;\r
- /* XXX: vars! */\r
- space.vars = NULL;\r
- if (!_slang_assemble_operation (&file, array_size, 0, &flow, &space, &info, &stk))\r
- {\r
- slang_assembly_file_destruct (&file);\r
- return 0;\r
- }\r
- /* TODO: evaluate array size */\r
- slang_assembly_file_destruct (&file);\r
- arr->length = 256;\r
- }\r
- return 1;\r
- default:\r
- return 0;\r
- }\r
-}\r
-\r
-/* _slang_sizeof_aggregate() */\r
-\r
-unsigned int _slang_sizeof_aggregate (const slang_storage_aggregate *agg)\r
-{\r
- unsigned int i, size = 0;\r
- for (i = 0; i < agg->count; i++)\r
- {\r
- unsigned int element_size;\r
- if (agg->arrays[i].type == slang_stor_aggregate)\r
- element_size = _slang_sizeof_aggregate (agg->arrays[i].aggregate);\r
- else\r
- element_size = sizeof (GLfloat);\r
- size += element_size * agg->arrays[i].length;\r
- }\r
- return size;\r
-}\r
-\r
-/* _slang_flatten_aggregate () */\r
-\r
-int _slang_flatten_aggregate (slang_storage_aggregate *flat, const slang_storage_aggregate *agg)\r
-{\r
- unsigned int i;\r
- for (i = 0; i < agg->count; i++)\r
- {\r
- unsigned int j;\r
- for (j = 0; j < agg->arrays[i].length; j++)\r
- {\r
- if (agg->arrays[i].type == slang_stor_aggregate)\r
- {\r
- if (!_slang_flatten_aggregate (flat, agg->arrays[i].aggregate))\r
- return 0;\r
- }\r
- else\r
- {\r
- slang_storage_array *arr;\r
- arr = slang_storage_aggregate_push_new (flat);\r
- if (arr == NULL)\r
- return 0;\r
- arr->type = agg->arrays[i].type;\r
- arr->length = 1;\r
- }\r
- }\r
- }\r
- return 1;\r
-}\r
-\r
+/*
+ * Mesa 3-D graphics library
+ * Version: 6.3
+ *
+ * Copyright (C) 2005 Brian Paul All Rights Reserved.
+ *
+ * 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
+ * BRIAN PAUL 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.
+ */
+
+/**
+ * \file slang_storage.c
+ * slang variable storage
+ * \author Michal Krol
+ */
+
+#include "imports.h"
+#include "slang_utility.h"
+#include "slang_storage.h"
+#include "slang_assemble.h"
+
+/* slang_storage_array */
+
+void slang_storage_array_construct (slang_storage_array *arr)
+{
+ arr->type = slang_stor_aggregate;
+ arr->aggregate = NULL;
+ arr->length = 0;
+}
+
+void slang_storage_array_destruct (slang_storage_array *arr)
+{
+ if (arr->aggregate != NULL)
+ {
+ slang_storage_aggregate_destruct (arr->aggregate);
+ slang_alloc_free (arr->aggregate);
+ }
+}
+
+/* slang_storage_aggregate */
+
+void slang_storage_aggregate_construct (slang_storage_aggregate *agg)
+{
+ agg->arrays = NULL;
+ agg->count = 0;
+}
+
+void slang_storage_aggregate_destruct (slang_storage_aggregate *agg)
+{
+ unsigned int i;
+ for (i = 0; i < agg->count; i++)
+ slang_storage_array_destruct (agg->arrays + i);
+ slang_alloc_free (agg->arrays);
+}
+
+static slang_storage_array *slang_storage_aggregate_push_new (slang_storage_aggregate *agg)
+{
+ slang_storage_array *arr = NULL;
+ agg->arrays = (slang_storage_array *) slang_alloc_realloc (agg->arrays, agg->count * sizeof (
+ slang_storage_array), (agg->count + 1) * sizeof (slang_storage_array));
+ if (agg->arrays != NULL)
+ {
+ arr = agg->arrays + agg->count;
+ slang_storage_array_construct (arr);
+ agg->count++;
+ }
+ return arr;
+}
+
+/* _slang_aggregate_variable() */
+
+static int aggregate_vector (slang_storage_aggregate *agg, slang_storage_type basic_type,
+ unsigned int row_count)
+{
+ slang_storage_array *arr = slang_storage_aggregate_push_new (agg);
+ if (arr == NULL)
+ return 0;
+ arr->type = basic_type;
+ arr->length = row_count;
+ return 1;
+}
+
+static int aggregate_matrix (slang_storage_aggregate *agg, slang_storage_type basic_type,
+ unsigned int dimension)
+{
+ slang_storage_array *arr = slang_storage_aggregate_push_new (agg);
+ if (arr == NULL)
+ return 0;
+ arr->type = slang_stor_aggregate;
+ arr->length = dimension;
+ arr->aggregate = (slang_storage_aggregate *) slang_alloc_malloc (sizeof (
+ slang_storage_aggregate));
+ if (arr->aggregate == NULL)
+ return 0;
+ slang_storage_aggregate_construct (arr->aggregate);
+ if (!aggregate_vector (arr->aggregate, basic_type, dimension))
+ return 0;
+ return 1;
+}
+
+static int aggregate_variables (slang_storage_aggregate *agg, const slang_variable_scope *vars,
+ slang_function_scope *funcs, slang_struct_scope *structs)
+{
+ unsigned int i;
+ for (i = 0; i < vars->num_variables; i++)
+ if (!_slang_aggregate_variable (agg, &vars->variables[i].type.specifier,
+ vars->variables[i].array_size, funcs, structs))
+ return 0;
+ return 1;
+}
+
+int _slang_aggregate_variable (slang_storage_aggregate *agg, slang_type_specifier *spec,
+ slang_operation *array_size, slang_function_scope *funcs, slang_struct_scope *structs)
+{
+ switch (spec->type)
+ {
+ case slang_spec_bool:
+ return aggregate_vector (agg, slang_stor_bool, 1);
+ case slang_spec_bvec2:
+ return aggregate_vector (agg, slang_stor_bool, 2);
+ case slang_spec_bvec3:
+ return aggregate_vector (agg, slang_stor_bool, 3);
+ case slang_spec_bvec4:
+ return aggregate_vector (agg, slang_stor_bool, 4);
+ case slang_spec_int:
+ return aggregate_vector (agg, slang_stor_int, 1);
+ case slang_spec_ivec2:
+ return aggregate_vector (agg, slang_stor_int, 2);
+ case slang_spec_ivec3:
+ return aggregate_vector (agg, slang_stor_int, 3);
+ case slang_spec_ivec4:
+ return aggregate_vector (agg, slang_stor_int, 4);
+ case slang_spec_float:
+ return aggregate_vector (agg, slang_stor_float, 1);
+ case slang_spec_vec2:
+ return aggregate_vector (agg, slang_stor_float, 2);
+ case slang_spec_vec3:
+ return aggregate_vector (agg, slang_stor_float, 3);
+ case slang_spec_vec4:
+ return aggregate_vector (agg, slang_stor_float, 4);
+ case slang_spec_mat2:
+ return aggregate_matrix (agg, slang_stor_float, 2);
+ case slang_spec_mat3:
+ return aggregate_matrix (agg, slang_stor_float, 3);
+ case slang_spec_mat4:
+ return aggregate_matrix (agg, slang_stor_float, 4);
+ case slang_spec_sampler1D:
+ case slang_spec_sampler2D:
+ case slang_spec_sampler3D:
+ case slang_spec_samplerCube:
+ case slang_spec_sampler1DShadow:
+ case slang_spec_sampler2DShadow:
+ return aggregate_vector (agg, slang_stor_int, 1);
+ case slang_spec_struct:
+ return aggregate_variables (agg, spec->_struct->fields, funcs, structs);
+ case slang_spec_array:
+ {
+ slang_storage_array *arr;
+ slang_assembly_file file;
+ slang_assembly_flow_control flow;
+ slang_assembly_name_space space;
+ slang_assembly_local_info info;
+ slang_assembly_stack_info stk;
+
+ arr = slang_storage_aggregate_push_new (agg);
+ if (arr == NULL)
+ return 0;
+ arr->type = slang_stor_aggregate;
+ arr->aggregate = (slang_storage_aggregate *) slang_alloc_malloc (sizeof (
+ slang_storage_aggregate));
+ if (arr->aggregate == NULL)
+ return 0;
+ slang_storage_aggregate_construct (arr->aggregate);
+ if (!_slang_aggregate_variable (arr->aggregate, spec->_array, NULL, funcs, structs))
+ return 0;
+ slang_assembly_file_construct (&file);
+ space.funcs = funcs;
+ space.structs = structs;
+ /* XXX: vars! */
+ space.vars = NULL;
+ if (!_slang_assemble_operation (&file, array_size, 0, &flow, &space, &info, &stk))
+ {
+ slang_assembly_file_destruct (&file);
+ return 0;
+ }
+ /* TODO: evaluate array size */
+ slang_assembly_file_destruct (&file);
+ arr->length = 256;
+ }
+ return 1;
+ default:
+ return 0;
+ }
+}
+
+/* _slang_sizeof_aggregate() */
+
+unsigned int _slang_sizeof_aggregate (const slang_storage_aggregate *agg)
+{
+ unsigned int i, size = 0;
+ for (i = 0; i < agg->count; i++)
+ {
+ unsigned int element_size;
+ if (agg->arrays[i].type == slang_stor_aggregate)
+ element_size = _slang_sizeof_aggregate (agg->arrays[i].aggregate);
+ else
+ element_size = sizeof (GLfloat);
+ size += element_size * agg->arrays[i].length;
+ }
+ return size;
+}
+
+/* _slang_flatten_aggregate () */
+
+int _slang_flatten_aggregate (slang_storage_aggregate *flat, const slang_storage_aggregate *agg)
+{
+ unsigned int i;
+ for (i = 0; i < agg->count; i++)
+ {
+ unsigned int j;
+ for (j = 0; j < agg->arrays[i].length; j++)
+ {
+ if (agg->arrays[i].type == slang_stor_aggregate)
+ {
+ if (!_slang_flatten_aggregate (flat, agg->arrays[i].aggregate))
+ return 0;
+ }
+ else
+ {
+ slang_storage_array *arr;
+ arr = slang_storage_aggregate_push_new (flat);
+ if (arr == NULL)
+ return 0;
+ arr->type = agg->arrays[i].type;
+ arr->length = 1;
+ }
+ }
+ }
+ return 1;
+}
+
-/*\r
- * Mesa 3-D graphics library\r
- * Version: 6.3\r
- *\r
- * Copyright (C) 2005 Brian Paul All Rights Reserved.\r
- *\r
- * Permission is hereby granted, free of charge, to any person obtaining a\r
- * copy of this software and associated documentation files (the "Software"),\r
- * to deal in the Software without restriction, including without limitation\r
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,\r
- * and/or sell copies of the Software, and to permit persons to whom the\r
- * Software is furnished to do so, subject to the following conditions:\r
- *\r
- * The above copyright notice and this permission notice shall be included\r
- * in all copies or substantial portions of the Software.\r
- *\r
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS\r
- * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\r
- * BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN\r
- * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r
- */\r
-\r
-#if !defined SLANG_STORAGE_H\r
-#define SLANG_STORAGE_H\r
-\r
-#include "slang_compile.h"\r
-\r
-#if defined __cplusplus\r
-extern "C" {\r
-#endif\r
-\r
-/*\r
- Program variable data storage is kept completely transparent to the front-end compiler. It is\r
- up to the back-end how the data is actually allocated. The slang_storage_type enum\r
- provides the basic information about how the memory is interpreted. This abstract piece\r
- of memory is called a data slot. A data slot of a particular type has a fixed size.\r
-\r
- For now, only the three basic types are supported, that is bool, int and float. Other built-in\r
- types like vector or matrix can easily be decomposed into a series of basic types.\r
-*/\r
-typedef enum slang_storage_type_\r
-{\r
- slang_stor_aggregate,\r
- slang_stor_bool,\r
- slang_stor_int,\r
- slang_stor_float\r
-} slang_storage_type;\r
-\r
-/*\r
- The slang_storage_array structure groups data slots of the same type into an array. This\r
- array has a fixed length. Arrays are required to have a size equal to the sum of sizes of its\r
- elements. They are also required to support indirect addressing. That is, if B references\r
- first data slot in the array, S is the size of the data slot and I is the integral index that\r
- is not known at compile time, B+I*S references I-th data slot.\r
-\r
- This structure is also used to break down built-in data types that are not supported directly.\r
- Vectors, like vec3, are constructed from arrays of their basic types. Matrices are formed of\r
- an array of column vectors, which are in turn processed as other vectors.\r
-*/\r
-typedef struct slang_storage_array_\r
-{\r
- slang_storage_type type;\r
- struct slang_storage_aggregate_ *aggregate; /* slang_stor_aggregate */\r
- unsigned int length;\r
-} slang_storage_array;\r
-\r
-void slang_storage_array_construct (slang_storage_array *);\r
-void slang_storage_array_destruct (slang_storage_array *);\r
-\r
-/*\r
- The slang_storage_aggregate structure relaxes the indirect addressing requirement for\r
- slang_storage_array structure. Aggregates are always accessed statically - its member\r
- addresses are well-known at compile time. For example, user-defined types are implemented as\r
- aggregates. Aggregates can collect data of a different type.\r
-*/\r
-typedef struct slang_storage_aggregate_\r
-{\r
- slang_storage_array *arrays;\r
- unsigned int count;\r
-} slang_storage_aggregate;\r
-\r
-void slang_storage_aggregate_construct (slang_storage_aggregate *);\r
-void slang_storage_aggregate_destruct (slang_storage_aggregate *);\r
-\r
-int _slang_aggregate_variable (slang_storage_aggregate *, struct slang_type_specifier_ *,\r
- struct slang_operation_ *, struct slang_function_scope_ *, slang_struct_scope *);\r
-\r
-/*\r
- returns total size (in machine units) of the given aggregate\r
- returns 0 on error\r
-*/\r
-unsigned int _slang_sizeof_aggregate (const slang_storage_aggregate *);\r
-\r
-/*\r
- converts structured aggregate to a flat one, with arrays of generic type being\r
- one-element long\r
- returns 1 on success\r
- returns 0 otherwise\r
-*/\r
-int _slang_flatten_aggregate (slang_storage_aggregate *, const slang_storage_aggregate *);\r
-\r
-#ifdef __cplusplus\r
-}\r
-#endif\r
-\r
-#endif\r
-\r
+/*
+ * Mesa 3-D graphics library
+ * Version: 6.3
+ *
+ * Copyright (C) 2005 Brian Paul All Rights Reserved.
+ *
+ * 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
+ * BRIAN PAUL 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.
+ */
+
+#if !defined SLANG_STORAGE_H
+#define SLANG_STORAGE_H
+
+#include "slang_compile.h"
+
+#if defined __cplusplus
+extern "C" {
+#endif
+
+/*
+ Program variable data storage is kept completely transparent to the front-end compiler. It is
+ up to the back-end how the data is actually allocated. The slang_storage_type enum
+ provides the basic information about how the memory is interpreted. This abstract piece
+ of memory is called a data slot. A data slot of a particular type has a fixed size.
+
+ For now, only the three basic types are supported, that is bool, int and float. Other built-in
+ types like vector or matrix can easily be decomposed into a series of basic types.
+*/
+typedef enum slang_storage_type_
+{
+ slang_stor_aggregate,
+ slang_stor_bool,
+ slang_stor_int,
+ slang_stor_float
+} slang_storage_type;
+
+/*
+ The slang_storage_array structure groups data slots of the same type into an array. This
+ array has a fixed length. Arrays are required to have a size equal to the sum of sizes of its
+ elements. They are also required to support indirect addressing. That is, if B references
+ first data slot in the array, S is the size of the data slot and I is the integral index that
+ is not known at compile time, B+I*S references I-th data slot.
+
+ This structure is also used to break down built-in data types that are not supported directly.
+ Vectors, like vec3, are constructed from arrays of their basic types. Matrices are formed of
+ an array of column vectors, which are in turn processed as other vectors.
+*/
+typedef struct slang_storage_array_
+{
+ slang_storage_type type;
+ struct slang_storage_aggregate_ *aggregate; /* slang_stor_aggregate */
+ unsigned int length;
+} slang_storage_array;
+
+void slang_storage_array_construct (slang_storage_array *);
+void slang_storage_array_destruct (slang_storage_array *);
+
+/*
+ The slang_storage_aggregate structure relaxes the indirect addressing requirement for
+ slang_storage_array structure. Aggregates are always accessed statically - its member
+ addresses are well-known at compile time. For example, user-defined types are implemented as
+ aggregates. Aggregates can collect data of a different type.
+*/
+typedef struct slang_storage_aggregate_
+{
+ slang_storage_array *arrays;
+ unsigned int count;
+} slang_storage_aggregate;
+
+void slang_storage_aggregate_construct (slang_storage_aggregate *);
+void slang_storage_aggregate_destruct (slang_storage_aggregate *);
+
+int _slang_aggregate_variable (slang_storage_aggregate *, struct slang_type_specifier_ *,
+ struct slang_operation_ *, struct slang_function_scope_ *, slang_struct_scope *);
+
+/*
+ returns total size (in machine units) of the given aggregate
+ returns 0 on error
+*/
+unsigned int _slang_sizeof_aggregate (const slang_storage_aggregate *);
+
+/*
+ converts structured aggregate to a flat one, with arrays of generic type being
+ one-element long
+ returns 1 on success
+ returns 0 otherwise
+*/
+int _slang_flatten_aggregate (slang_storage_aggregate *, const slang_storage_aggregate *);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
+