mirror of
https://github.com/ganelson/inform.git
synced 2024-07-03 07:24:58 +03:00
206 lines
8 KiB
OpenEdge ABL
206 lines
8 KiB
OpenEdge ABL
[SynopticTables::] Tables.
|
|
|
|
To compile the main/synoptic/tables submodule.
|
|
|
|
@ Our inventory |inv| already contains a list |inv->table_nodes| of all packages
|
|
in the tree with type |_table|.
|
|
|
|
=
|
|
void SynopticTables::compile(inter_tree *I, pipeline_step *step, tree_inventory *inv) {
|
|
if (InterNodeList::array_len(inv->table_nodes) > 0) @<Assign unique table ID numbers@>;
|
|
if (InterNodeList::array_len(inv->table_column_nodes) > 0) @<Assign unique table column ID numbers@>;
|
|
if (InterNodeList::array_len(inv->table_column_usage_nodes) > 0) {
|
|
InterNodeList::array_sort(inv->table_column_usage_nodes, MakeSynopticModuleStage::module_order);
|
|
for (int i=0; i<InterNodeList::array_len(inv->table_column_usage_nodes); i++) {
|
|
inter_package *pack = PackageInstruction::at_this_head(inv->table_column_usage_nodes->list[i].node);
|
|
inter_tree_node *ID = Synoptic::get_definition(pack, I"column_identity");
|
|
inter_symbol *id_s = NULL;
|
|
inter_pair id_val = ConstantInstruction::constant(ID);
|
|
if (InterValuePairs::is_symbolic(id_val))
|
|
id_s = InterValuePairs::to_symbol_at(id_val, ID);
|
|
if (id_s == NULL) internal_error("column_identity not a symbol");
|
|
ID = InterSymbol::definition(id_s);
|
|
inter_tree_node *D = Synoptic::get_definition(pack, I"column_bits");
|
|
inter_ti D_bits =
|
|
InterValuePairs::to_number(ConstantInstruction::constant(D));
|
|
inter_ti ID_bits =
|
|
InterValuePairs::to_number(ConstantInstruction::constant(ID));
|
|
ConstantInstruction::set_constant(D, InterValuePairs::number(D_bits + ID_bits));
|
|
}
|
|
}
|
|
@<Define TABLEOFTABLES array@>;
|
|
@<Define PRINT_TABLE function@>;
|
|
@<Define TC_KOV function@>;
|
|
@<Define TB_BLANKS array@>;
|
|
@<Define RANKING_TABLE constant@>;
|
|
}
|
|
|
|
@ Each table package contains a numeric constant with the symbol name |table_id|.
|
|
We want to ensure that these ID numbers are contiguous from 1 and never duplicated,
|
|
so we change the values of these constants accordingly.
|
|
|
|
@<Assign unique table ID numbers@> =
|
|
InterNodeList::array_sort(inv->table_nodes, MakeSynopticModuleStage::module_order);
|
|
for (int i=0; i<InterNodeList::array_len(inv->table_nodes); i++) {
|
|
inter_package *pack = PackageInstruction::at_this_head(inv->table_nodes->list[i].node);
|
|
inter_tree_node *D = Synoptic::get_definition(pack, I"table_id");
|
|
ConstantInstruction::set_constant(D, InterValuePairs::number((inter_ti) i+1));
|
|
}
|
|
|
|
@ And similarly for columns. The runtime code uses a range of unique ID numbers
|
|
to represent table columns; these can't simply be addresses of the data because
|
|
two uses of columns called "population" in different tables need to have the
|
|
same ID in each context. (They need to run from 100 upward because numbers 0 to
|
|
99 refer to columns by index within the current table: see //assertions: Tables//.)
|
|
|
|
@<Assign unique table column ID numbers@> =
|
|
InterNodeList::array_sort(inv->table_column_nodes, MakeSynopticModuleStage::module_order);
|
|
for (int i=0; i<InterNodeList::array_len(inv->table_column_nodes); i++) {
|
|
inter_package *pack = PackageInstruction::at_this_head(inv->table_column_nodes->list[i].node);
|
|
inter_tree_node *D = Synoptic::get_definition(pack, I"table_column_id");
|
|
ConstantInstruction::set_constant(D, InterValuePairs::number((inter_ti) i+100));
|
|
}
|
|
|
|
@<Define TABLEOFTABLES array@> =
|
|
inter_name *iname = HierarchyLocations::iname(I, TABLEOFTABLES_HL);
|
|
Synoptic::begin_array(I, step, iname);
|
|
Synoptic::symbol_entry(InterNames::to_symbol(
|
|
HierarchyLocations::iname(I, THEEMPTYTABLE_HL)));
|
|
for (int i=0; i<InterNodeList::array_len(inv->table_nodes); i++) {
|
|
inter_package *pack = PackageInstruction::at_this_head(inv->table_nodes->list[i].node);
|
|
inter_symbol *value_s = Metadata::required_symbol(pack, I"^value");
|
|
Synoptic::symbol_entry(value_s);
|
|
}
|
|
Synoptic::numeric_entry(0);
|
|
Synoptic::numeric_entry(0);
|
|
Synoptic::end_array(I);
|
|
|
|
@<Define PRINT_TABLE function@> =
|
|
inter_name *iname = HierarchyLocations::iname(I, PRINT_TABLE_HL);
|
|
Synoptic::begin_function(I, iname);
|
|
inter_symbol *T_s = Synoptic::local(I, I"T", NULL);
|
|
Produce::inv_primitive(I, SWITCH_BIP);
|
|
Produce::down(I);
|
|
Produce::val_symbol(I, K_value, T_s);
|
|
Produce::code(I);
|
|
Produce::down(I);
|
|
Produce::inv_primitive(I, CASE_BIP);
|
|
Produce::down(I);
|
|
Produce::val_iname(I, K_value,
|
|
HierarchyLocations::iname(I, THEEMPTYTABLE_HL));
|
|
Produce::code(I);
|
|
Produce::down(I);
|
|
Produce::inv_primitive(I, PRINT_BIP);
|
|
Produce::down(I);
|
|
Produce::val_text(I, I"(the empty table)");
|
|
Produce::up(I);
|
|
Produce::rtrue(I);
|
|
Produce::up(I);
|
|
Produce::up(I);
|
|
|
|
for (int i=0; i<InterNodeList::array_len(inv->table_nodes); i++) {
|
|
inter_package *pack = PackageInstruction::at_this_head(inv->table_nodes->list[i].node);
|
|
inter_symbol *value_s = Metadata::required_symbol(pack, I"^value");
|
|
text_stream *printed_name = Metadata::required_textual(pack, I"^printed_name");
|
|
Produce::inv_primitive(I, CASE_BIP);
|
|
Produce::down(I);
|
|
Produce::val_symbol(I, K_value, value_s);
|
|
Produce::code(I);
|
|
Produce::down(I);
|
|
Produce::inv_primitive(I, PRINT_BIP);
|
|
Produce::down(I);
|
|
Produce::val_text(I, printed_name);
|
|
Produce::up(I);
|
|
Produce::rtrue(I);
|
|
Produce::up(I);
|
|
Produce::up(I);
|
|
}
|
|
|
|
Produce::inv_primitive(I, DEFAULT_BIP);
|
|
Produce::down(I);
|
|
Produce::code(I);
|
|
Produce::down(I);
|
|
Produce::inv_primitive(I, PRINT_BIP);
|
|
Produce::down(I);
|
|
Produce::val_text(I, I"** No such table **");
|
|
Produce::up(I);
|
|
Produce::rtrue(I);
|
|
Produce::up(I);
|
|
Produce::up(I);
|
|
Produce::up(I);
|
|
Produce::up(I);
|
|
Synoptic::end_function(I, step, iname);
|
|
|
|
@<Define TC_KOV function@> =
|
|
inter_name *iname = HierarchyLocations::iname(I, TC_KOV_HL);
|
|
Synoptic::begin_function(I, iname);
|
|
inter_symbol *tc_s = Synoptic::local(I, I"tc", NULL);
|
|
inter_symbol *unk_s = Synoptic::local(I, I"unk", NULL);
|
|
Produce::inv_primitive(I, SWITCH_BIP);
|
|
Produce::down(I);
|
|
Produce::val_symbol(I, K_value, tc_s);
|
|
Produce::code(I);
|
|
Produce::down(I);
|
|
|
|
for (int i=0; i<InterNodeList::array_len(inv->table_column_nodes); i++) {
|
|
inter_package *pack =
|
|
PackageInstruction::at_this_head(inv->table_column_nodes->list[i].node);
|
|
inter_symbol *tc_kind = Metadata::required_symbol(pack, I"^column_kind");
|
|
Produce::inv_primitive(I, CASE_BIP);
|
|
Produce::down(I);
|
|
Produce::val(I, K_value, InterValuePairs::number((inter_ti) (i + 100)));
|
|
Produce::code(I);
|
|
Produce::down(I);
|
|
Produce::inv_primitive(I, RETURN_BIP);
|
|
Produce::down(I);
|
|
Produce::val_symbol(I, K_value, tc_kind);
|
|
Produce::up(I);
|
|
Produce::up(I);
|
|
Produce::up(I);
|
|
}
|
|
|
|
Produce::up(I);
|
|
Produce::up(I);
|
|
Produce::inv_primitive(I, RETURN_BIP);
|
|
Produce::down(I);
|
|
Produce::val_symbol(I, K_value, unk_s);
|
|
Produce::up(I);
|
|
Synoptic::end_function(I, step, iname);
|
|
|
|
@<Define TB_BLANKS array@> =
|
|
inter_name *iname = HierarchyLocations::iname(I, TB_BLANKS_HL);
|
|
Synoptic::begin_byte_array(I, step, iname);
|
|
inter_ti hwm = 0;
|
|
for (int i=0; i<InterNodeList::array_len(inv->table_column_usage_nodes); i++) {
|
|
inter_package *pack =
|
|
PackageInstruction::at_this_head(inv->table_column_usage_nodes->list[i].node);
|
|
inter_tree_node *D = Synoptic::get_optional_definition(pack, I"column_blanks");
|
|
if (D) {
|
|
ConstantInstruction::set_constant(D, InterValuePairs::number(hwm));
|
|
inter_tree_node *B = Synoptic::get_definition(pack, I"^column_blank_data");
|
|
for (int i=0; i<ConstantInstruction::list_len(B); i++) {
|
|
Synoptic::numeric_entry(
|
|
InterValuePairs::to_number(ConstantInstruction::list_entry(B, i)));
|
|
hwm++;
|
|
}
|
|
}
|
|
}
|
|
Synoptic::numeric_entry(0);
|
|
Synoptic::numeric_entry(0);
|
|
Synoptic::end_array(I);
|
|
|
|
@<Define RANKING_TABLE constant@> =
|
|
inter_name *iname = HierarchyLocations::iname(I, RANKING_TABLE_HL);
|
|
int found = FALSE;
|
|
for (int i=0; i<InterNodeList::array_len(inv->table_nodes); i++) {
|
|
inter_package *pack =
|
|
PackageInstruction::at_this_head(inv->table_nodes->list[i].node);
|
|
if (Metadata::read_optional_numeric(pack, I"^ranking_table")) {
|
|
inter_symbol *value_s = Metadata::required_symbol(pack, I"^value");
|
|
Produce::symbol_constant(I, iname, K_value, value_s);
|
|
found = TRUE;
|
|
break;
|
|
}
|
|
}
|
|
if (found == FALSE) Produce::numeric_constant(I, iname, K_value, 0);
|