void MR_io_tabling_stats(FILE *fp) { const MR_TableIoDecl *table_io_decl; const MR_ProcLayout *proc_layout; MR_ConstString proc_name; int arity; MR_Word is_func; int hv; MR_TrieNode answer_block_trie; MR_Word *answer_block; MR_Hash_Table hash_table; MR_IO_Table_Stats_Hash_Record *hash_record; MR_IO_Table_Stats_Hash_Record *record; int num_entries; int count; int i; /* ** Create a fresh new hash table, separate the table created by ** any previous call to this function. We can't use structure assignment, ** as that causes gcc 3.2 to throw a fit. */ hash_table.MR_ht_size = MR_io_tabling_stats_table.MR_ht_size; hash_table.MR_ht_store = NULL; hash_table.MR_ht_key = MR_io_tabling_stats_table.MR_ht_key; hash_table.MR_ht_hash = MR_io_tabling_stats_table.MR_ht_hash; hash_table.MR_ht_equal = MR_io_tabling_stats_table.MR_ht_equal; MR_init_hash_table(hash_table); num_entries = 0; for (i = MR_io_tabling_start; i < MR_io_tabling_counter_hwm; i++) { MR_TABLE_START_INT(NULL, MR_FALSE, MR_FALSE, answer_block_trie, (MR_TrieNode) &MR_io_tabling_pointer, MR_io_tabling_start, i); answer_block = answer_block_trie->MR_answerblock; if (answer_block == NULL) { continue; } table_io_decl = (const MR_TableIoDecl *) answer_block[0]; proc_layout = table_io_decl->MR_table_io_decl_proc; hash_record = MR_lookup_hash_table(hash_table, proc_layout); if (hash_record == NULL) { hash_record = MR_GC_NEW(MR_IO_Table_Stats_Hash_Record); hash_record->MR_io_tabling_stats_proc = proc_layout; hash_record->MR_io_tabling_stats_count = 1; (void) MR_insert_hash_table(hash_table, hash_record); num_entries++; } else { hash_record->MR_io_tabling_stats_count++; } } MR_io_tabling_stats_sort_arena = MR_GC_NEW_ARRAY(MR_IO_Table_Stats_Hash_Record, num_entries); MR_io_tabling_stats_sort_arena_next = 0; MR_process_all_entries(hash_table, MR_add_to_sort_arena); if (MR_io_tabling_stats_sort_arena_next != num_entries) { MR_fatal_error("MR_io_tabling_stats: num_entries mismatch"); } qsort(MR_io_tabling_stats_sort_arena, num_entries, sizeof(MR_IO_Table_Stats_Hash_Record), MR_compare_in_sort_arena); for (i = 0; i < num_entries; i++) { record = &MR_io_tabling_stats_sort_arena[i]; proc_layout = record->MR_io_tabling_stats_proc; count = record->MR_io_tabling_stats_count; MR_generate_proc_name_from_layout(proc_layout, &proc_name, &arity, &is_func); fprintf(fp, "%8d %4s %s/%d\n", count, (is_func ? "func" : "pred"), proc_name, arity); } }
MR_bool MR_trace_get_action(MR_IoActionNum action_number, MR_ConstString *proc_name_ptr, MR_Word *is_func_ptr, MR_Word *arg_list_ptr) { const MR_TableIoDecl *table_io_decl; const MR_ProcLayout *proc_layout; MR_ConstString proc_name; MR_Word is_func; MR_Word arg_list; MR_Word arg; int filtered_arity; int arity; int hv; MR_TrieNode answer_block_trie; MR_Word *answer_block; MR_TypeInfo *type_params; MR_TypeInfo type_info; if (! (MR_io_tabling_start <= action_number && action_number < MR_io_tabling_counter_hwm)) { return MR_FALSE; } MR_TABLE_START_INT(NULL, MR_tabledebug, MR_FALSE, answer_block_trie, (MR_TrieNode) &MR_io_tabling_pointer, MR_io_tabling_start, action_number); answer_block = answer_block_trie->MR_answerblock; if (answer_block == NULL) { return MR_FALSE; } table_io_decl = (const MR_TableIoDecl *) answer_block[0]; proc_layout = table_io_decl->MR_table_io_decl_proc; filtered_arity = table_io_decl->MR_table_io_decl_filtered_arity; MR_generate_proc_name_from_layout(proc_layout, &proc_name, &arity, &is_func); type_params = MR_materialize_answer_block_type_params( table_io_decl->MR_table_io_decl_type_params, answer_block, filtered_arity); MR_restore_transient_hp(); arg_list = MR_list_empty(); MR_save_transient_hp(); for (hv = filtered_arity; hv >= 1; hv--) { type_info = MR_create_type_info(type_params, table_io_decl->MR_table_io_decl_ptis[hv - 1]); MR_restore_transient_hp(); MR_new_univ_on_hp(arg, type_info, answer_block[hv]); arg_list = MR_univ_list_cons(arg, arg_list); MR_save_transient_hp(); } MR_free(type_params); *proc_name_ptr = proc_name; *is_func_ptr = is_func; *arg_list_ptr = arg_list; return MR_TRUE; }
MR_bool MR_trace_get_action(MR_IoActionNum action_number, MR_ConstString *proc_name_ptr, MR_Word *is_func_ptr, MR_bool *have_arg_infos_ptr, MR_Word *arg_list_ptr) { const MR_TableIoEntry *table_io_entry; const MR_ProcLayout *proc_layout; MR_ConstString proc_name; MR_Word is_func; int arity; int hv; MR_TrieNode answer_block_trie; MR_Word *answer_block; if (! (MR_io_tabling_start <= action_number && action_number < MR_io_tabling_counter_hwm)) { return MR_FALSE; } MR_TABLE_START_INT(NULL, MR_tabledebug, MR_FALSE, answer_block_trie, (MR_TrieNode) &MR_io_tabling_pointer, MR_io_tabling_start, action_number); answer_block = answer_block_trie->MR_answerblock; if (answer_block == NULL) { return MR_FALSE; } table_io_entry = (const MR_TableIoEntry *) answer_block[0]; proc_layout = table_io_entry->MR_table_io_entry_proc; MR_generate_proc_name_from_layout(proc_layout, &proc_name, &arity, &is_func); *proc_name_ptr = proc_name; *is_func_ptr = is_func; if (table_io_entry->MR_table_io_entry_have_arg_infos) { int filtered_arity; MR_Word arg_list; MR_Word arg; MR_TypeInfo *type_params; MR_TypeInfo type_info; *have_arg_infos_ptr = MR_TRUE; filtered_arity = table_io_entry->MR_table_io_entry_num_ptis; type_params = MR_materialize_answer_block_type_params( table_io_entry->MR_table_io_entry_type_params, answer_block, filtered_arity); MR_restore_transient_hp(); arg_list = MR_list_empty(); MR_save_transient_hp(); for (hv = filtered_arity; hv >= 1; hv--) { type_info = MR_create_type_info(type_params, table_io_entry->MR_table_io_entry_ptis[hv - 1]); MR_restore_transient_hp(); MR_new_univ_on_hp(arg, type_info, answer_block[hv]); arg_list = MR_univ_list_cons(arg, arg_list); MR_save_transient_hp(); } MR_free(type_params); *arg_list_ptr = arg_list; } else { *have_arg_infos_ptr = MR_FALSE; // *arg_list_ptr is not meaningful when *have_arg_infos_ptr is false, // but setting it to the empty list makes it easier to catch any // caller that ignores that fact. *arg_list_ptr = MR_list_empty(); } return MR_TRUE; }