1 /* Copyright (c) 2014. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
10 #include "mc_private.h"
11 #include "mc/datatypes.h"
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_hash, mc,
15 "Logging specific to mc_hash");
18 typedef uint64_t mc_hash_t;
19 #define MC_HASH_INIT ((uint64_t)5381)
21 // #define MC_HASH(hash, value) hash = (((hash << 5) + hash) + (uint64_t) value)
22 #define MC_HASH(hash, value) \
23 { hash = (((hash << 5) + hash) + (uint64_t) value);\
24 XBT_DEBUG("%s:%i: %"PRIx64" -> %"PRIx64, __FILE__, __LINE__, (uint64_t) value, hash); }
28 typedef struct s_mc_hashing_state {
29 // Set of pointers/addresses already processed (avoid loops):
30 mc_address_set_t handled_addresses;
33 void mc_hash_state_init(mc_hashing_state* state);
34 void mc_hash_state_destroy(mc_hashing_state* state);
36 void mc_hash_state_init(mc_hashing_state* state) {
37 state->handled_addresses = mc_address_set_new();
40 void mc_hash_state_destroy(mc_hashing_state* state) {
41 mc_address_set_free(&state->handled_addresses);
44 // TODO, detect and avoid loops
46 static bool mc_ignored(const void* address, size_t size) {
47 mc_heap_ignore_region_t region;
48 unsigned int cursor = 0;
49 const void* end = (char*) address + size;
50 xbt_dynar_foreach(mc_heap_comparison_ignore, cursor, region) {
51 void* istart = region->address;
52 void* iend = (char*) region->address + region->size;
54 if(address>=istart && address<iend && end>=istart && end<iend)
61 static void mc_hash_binary(mc_hash_t *hash, const void* s, size_t len) {
62 const char* p = (const void*) s;
64 for(i=0; i!=len; ++i) {
69 /** \brief Compute a hash for a given value of a given type
71 * We try to be very conservative (do not hash too ambiguous things).
73 * \param address address of the variable
74 * \param type type of the variable
76 static void mc_hash_value(mc_hash_t* hash, mc_hashing_state* state, mc_object_info_t info, const void* address, dw_type_t type) {
80 // Simple case, hash this has binary:
81 case DW_TAG_base_type:
82 case DW_TAG_enumeration_type:
84 if(mc_ignored(address, 1))
86 mc_hash_binary(hash, address, type->byte_size);
90 case DW_TAG_array_type:
92 if(mc_ignored(address, type->byte_size))
95 long element_count = type->element_count;
96 dw_type_t subtype = type->subtype;
98 XBT_DEBUG("Hash array without subtype");
102 for(i=0; i!=element_count; ++i) {
103 XBT_DEBUG("Hash array element %i", i);
104 void* subaddress = ((char*)address)+i*subtype->byte_size;
105 mc_hash_value(hash, state, info, subaddress, subtype);
112 case DW_TAG_volatile_type:
113 case DW_TAG_const_type:
114 case DW_TAG_restrict_type:
116 type = type->subtype;
123 case DW_TAG_structure_type:
124 case DW_TAG_class_type:
126 if(mc_ignored(address, type->byte_size))
129 unsigned int cursor = 0;
131 xbt_dynar_foreach(type->members, cursor, member){
132 XBT_DEBUG("Hash struct member %s", member->name);
133 if(type->subtype==NULL)
135 mc_hash_value(hash, state, info, ((char*)address) + member->offset, type->subtype);
140 // Pointer, we hash a single value but it might be an array.
141 case DW_TAG_pointer_type:
142 case DW_TAG_reference_type:
143 case DW_TAG_rvalue_reference_type:
145 if(mc_ignored(address, 1))
148 void* pointed = *(void**)address;
150 XBT_DEBUG("Hashed pinter is NULL");
155 if(mc_address_test(state->handled_addresses, pointed)) {
156 XBT_DEBUG("Hashed pointed data %p already hashed", pointed);
159 mc_address_add(state->handled_addresses, pointed);
161 // Anything outside the R/W segments and the heap is not hashed:
162 bool valid_pointer = (pointed >= (void*) mc_binary_info->start_rw && pointed <= (void*) mc_binary_info->end_rw)
163 || (pointed >= (void*) mc_libsimgrid_info->start_rw && pointed <= (void*) mc_libsimgrid_info->end_rw)
164 || (pointed >= std_heap && pointed < (void*) ((const char*)std_heap + STD_HEAP_SIZE));
166 XBT_DEBUG("Hashed pointed data %p is in an ignored range", pointed);
170 if(type->subtype==NULL) {
171 XBT_DEBUG("Missing type for %p (type=%s)", pointed, type->dw_type_id);
176 type = type->subtype;
181 case DW_TAG_union_type:
182 case DW_TAG_subroutine_type:
189 static void mc_hash_object_globals(mc_hash_t *hash, mc_hashing_state* state, mc_object_info_t info) {
190 unsigned int cursor = 0;
191 dw_variable_t variable;
192 xbt_dynar_foreach(info->global_variables, cursor, variable) {
193 XBT_DEBUG("Hash global variable %s", variable->name);
195 if(variable->type_origin == NULL) {
200 dw_type_t type = variable->type;
206 const char* address = variable->address;
207 bool valid_pointer = (address >= mc_binary_info->start_rw && address <= mc_binary_info->end_rw)
208 || (address >= mc_libsimgrid_info->start_rw && address <= mc_libsimgrid_info->end_rw)
209 || (address >= (const char*) std_heap && address < (const char *)std_heap + STD_HEAP_SIZE);
210 if(!valid_pointer) continue;
212 mc_hash_value(hash, state, info, variable->address, type);
216 static void mc_hash_stack_frame(
218 mc_object_info_t info, unw_cursor_t* unw_cursor, dw_frame_t frame, char* frame_pointer, mc_hashing_state* state
223 unsigned int cursor = 0;
224 dw_variable_t variable;
225 xbt_dynar_foreach(frame->variables, cursor, variable){
227 if(variable->type_origin==NULL) {
228 XBT_DEBUG("Hash local variable %s without type", variable->name);
231 if(variable->location == NULL) {
232 XBT_DEBUG("Hash local variable %s without location", variable->name);
236 XBT_DEBUG("Hash local variable %s", variable->name);
238 void* variable_address = (void*) MC_dwarf_resolve_location(unw_cursor, variable->location, frame_pointer);
240 dw_type_t type = variable->type;
242 XBT_DEBUG("Hash local variable %s without loctypeation", variable->name);
246 mc_hash_value(hash, state, info, variable_address, type);
250 static void mc_hash_stack(mc_hash_t *hash, mc_snapshot_stack_t stack, mc_hashing_state* state) {
253 mc_stack_frame_t stack_frame;
255 xbt_dynar_foreach(stack->stack_frames, cursor, stack_frame) {
257 MC_HASH(*hash, stack_frame->ip);
259 mc_object_info_t info;
260 if(stack_frame->ip >= (unw_word_t) mc_libsimgrid_info->start_exec && stack_frame->ip < (unw_word_t) mc_libsimgrid_info->end_exec)
261 info = mc_libsimgrid_info;
262 else if(stack_frame->ip >= (unw_word_t) mc_binary_info->start_exec && stack_frame->ip < (unw_word_t) mc_binary_info->end_exec)
263 info = mc_binary_info;
267 mc_hash_stack_frame(hash, info, &(stack_frame->unw_cursor), stack_frame->frame, (void*)stack_frame->frame_base, state);
272 static void mc_hash_stacks(mc_hash_t *hash, mc_hashing_state* state, xbt_dynar_t stacks) {
273 unsigned int cursor = 0;
274 mc_snapshot_stack_t current_stack;
276 MC_HASH(*hash, xbt_dynar_length(stacks_areas));
279 xbt_dynar_foreach(stacks, cursor, current_stack){
280 XBT_DEBUG("Stack %i", i);
281 mc_hash_stack(hash, current_stack, state);
286 uint64_t mc_hash_processes_state(int num_state, xbt_dynar_t stacks) {
287 XBT_DEBUG("START hash %i", num_state);
289 mc_hashing_state state;
290 mc_hash_state_init(&state);
292 mc_hash_t hash = MC_HASH_INIT;
294 MC_HASH(hash, xbt_swag_size(simix_global->process_list)); // process count
295 mc_hash_object_globals(&hash, &state, mc_binary_info);
296 // mc_hash_object_globals(&hash, &state, mc_libsimgrid_info);
297 mc_hash_stacks(&hash, &state, stacks);
299 mc_hash_state_destroy(&state);
301 XBT_DEBUG("END hash %i", num_state);