static MR_Unsigned MR_standardize_num(MR_Unsigned num, MR_Hash_Table *table_ptr, MR_bool *init_ptr, int *next_ptr) { const MR_Standard_Hash_Record *record; MR_Standard_Hash_Record *new_record; int std_num; if (! *init_ptr) { *init_ptr = MR_TRUE; MR_init_hash_table(*table_ptr); } record = MR_lookup_hash_table(*table_ptr, num); if (record != NULL) { return record->MR_std_std_number; } std_num = *next_ptr; (*next_ptr)++; new_record = MR_GC_NEW(MR_Standard_Hash_Record); new_record->MR_std_orig_number = num; new_record->MR_std_std_number = std_num; (void) MR_insert_hash_table(*table_ptr, new_record); return std_num; }
MR_Word MR_lookup_proc_defn_rep(const MR_ProcLayout *proc_layout) { const MR_ProcLayoutRep *layout_rep; MR_do_init_proc_defn_rep_table(); layout_rep = MR_lookup_hash_table(proc_defn_rep_table, proc_layout); if (layout_rep == NULL) { #ifdef MR_DEBUG_PROC_REP if (MR_progdebug) { printf("search for layout %p: not found\n", proc_layout); } #endif return 0; } #ifdef MR_DEBUG_PROC_REP if (MR_progdebug) { printf("search for layout %p: found pair %p, rep %x\n", proc_layout, layout_rep, layout_rep->plr_rep); } #endif return layout_rep->plr_rep; }
MR_Internal * MR_lookup_internal_by_addr(const MR_Code *addr) { MR_do_init_label_tables(); MR_do_init_modules(); #ifdef MR_LOWLEVEL_DEBUG if (MR_progdebug) { printf("looking for internal label at %p\n", addr); } #endif return (MR_Internal *) MR_lookup_hash_table(internal_addr_table, addr); }
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); } }