HomeSort by relevance Sort by last modified time
    Searched full:bbccs (Results 1 - 5 of 5) sorted by null

  /external/valgrind/main/callgrind/
bbcc.c 43 void CLG_(init_bbcc_hash)(bbcc_hash* bbccs)
47 CLG_ASSERT(bbccs != 0);
49 bbccs->size = N_BBCC_INITIAL_ENTRIES;
50 bbccs->entries = 0;
51 bbccs->table = (BBCC**) CLG_MALLOC("cl.bbcc.ibh.1",
52 bbccs->size * sizeof(BBCC*));
54 for (i = 0; i < bbccs->size; i++) bbccs->table[i] = NULL;
134 /* All BBCCs for recursion level 0 are inserted into a
138 * BBCCs for other recursion levels are in bbcc->rec_array
248 BBCC** bbccs; local
    [all...]
threads.c 52 * - BBCCs
120 CLG_(init_bbcc_hash)( &(t->bbccs) );
148 CLG_(copy_current_bbcc_hash)( &(t->bbccs) );
172 CLG_(set_current_bbcc_hash) ( &(t->bbccs) );
global.h 321 BBCC* bbcc_list; /* BBCCs for same BB (see next_bbcc in BBCC) */
375 * On demand, multiple BBCCs will be created for the same BB
394 * recursion BBCCs. Shared. */
398 BBCC* next_bbcc; /* Chain of BBCCs for same BB */
592 * If --separate-threads=no, BBCCs and JCCs can be shared by all threads, i.e.
610 bbcc_hash bbccs; member in struct:_thread_info
756 void CLG_(init_bbcc_hash)(bbcc_hash* bbccs);
dump.c 1148 /* add BBCCs with active call in call stack of current thread.
1176 /* add BBCCs with active call in call stack of current thread.
1198 * Put all BBCCs with costs into a sorted array.
1210 /* count number of BBCCs with >0 executions */
1220 CLG_DEBUG(0, "prepare_dump: %d BBCCs\n", prepare_count);
1222 /* allocate bbcc array, insert BBCCs and sort */
1239 CLG_DEBUG(0," BBCCs inserted\n");
1244 CLG_DEBUG(0," BBCCs sorted\n");
    [all...]
main.c     [all...]

Completed in 497 milliseconds