tab 59 ompi/mca/topo/treematch/treematch/tm_bucket.c double **tab = NULL; tab 67 ompi/mca/topo/treematch/treematch/tm_bucket.c tab = bl->tab; tab 74 ompi/mca/topo/treematch/treematch/tm_bucket.c if(tab[i1][j1]==tab[i2][j2]){ tab 81 ompi/mca/topo/treematch/treematch/tm_bucket.c return (tab[i1][j1] > tab[i2][j2]) ? -1 : 1; tab 92 ompi/mca/topo/treematch/treematch/tm_bucket.c val = bucket_list->tab[i][j]; tab 120 ompi/mca/topo/treematch/treematch/tm_bucket.c val = bucket_list->tab[i][j]; tab 141 ompi/mca/topo/treematch/treematch/tm_bucket.c void check_bucket(bucket_t *b,double **tab,double inf, double sup) tab 147 ompi/mca/topo/treematch/treematch/tm_bucket.c if((tab[i][j] < inf) || (tab[i][j] > sup)){ tab 149 ompi/mca/topo/treematch/treematch/tm_bucket.c fprintf(stderr,"[%d] (%d,%d):%f not in [%f,%f]\n",k,i,j,tab[i][j],inf,sup); tab 182 ompi/mca/topo/treematch/treematch/tm_bucket.c check_bucket(bucket_list->bucket_tab[i],bucket_list->tab,inf,sup); tab 289 ompi/mca/topo/treematch/treematch/tm_bucket.c void partial_sort(bucket_list_t *bl,double **tab,int N) tab 319 ompi/mca/topo/treematch/treematch/tm_bucket.c bucket_list->tab = tab; tab 351 ompi/mca/topo/treematch/treematch/tm_bucket.c printf("%f\n",tab[i][j]); tab 365 ompi/mca/topo/treematch/treematch/tm_bucket.c pivot[k-1] = tab[i][j]; tab 19 ompi/mca/topo/treematch/treematch/tm_bucket.h double **tab; tab 53 ompi/mca/topo/treematch/treematch/tm_mapping.c int fill_tab(int **new_tab,int *tab, int n, int start, int max_val, int shift); tab 59 ompi/mca/topo/treematch/treematch/tm_mapping.c void print_1D_tab(int *tab,int N); tab 85 ompi/mca/topo/treematch/treematch/tm_mapping.c void print_1D_tab(int *tab,int N) tab 89 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("%d", tab[i]); tab 427 ompi/mca/topo/treematch/treematch/tm_mapping.c static void set_val(int *tab, int val, int n){ tab 431 ompi/mca/topo/treematch/treematch/tm_mapping.c if(tab[i] ==- 1){ tab 432 ompi/mca/topo/treematch/treematch/tm_mapping.c tab[i] = val; tab 593 ompi/mca/topo/treematch/treematch/tm_mapping.c int fill_tab(int **new_tab,int *tab, int n, int start, int max_val, int shift) tab 605 ompi/mca/topo/treematch/treematch/tm_mapping.c if(tab[end] >= max_val) tab 622 ompi/mca/topo/treematch/treematch/tm_mapping.c res[j] = tab[i] - shift; tab 13 ompi/mca/topo/treematch/treematch/tm_mapping.h int fill_tab(int **new_tab,int *tab, int n, int start, int max_val, int shift); tab 20 ompi/mca/topo/treematch/treematch/tm_mapping.h void print_1D_tab(int *tab,int N); tab 21 ompi/mca/topo/treematch/treematch/tm_solution.c int in_tab(int *tab, int n, int val); tab 275 ompi/mca/topo/treematch/treematch/tm_solution.c int in_tab(int *tab, int n, int val){ tab 278 ompi/mca/topo/treematch/treematch/tm_solution.c if(tab[i] == val) tab 13 ompi/mca/topo/treematch/treematch/tm_solution.h int in_tab(int *tab, int n, int val); tab 318 ompi/mca/topo/treematch/treematch/tm_thread_pool.c int n, *tab; tab 322 ompi/mca/topo/treematch/treematch/tm_thread_pool.c tab = (int*)args[1]; tab 328 ompi/mca/topo/treematch/treematch/tm_thread_pool.c *res+=tab[i]; tab 342 ompi/mca/topo/treematch/treematch/tm_thread_pool.c int tab[100]; tab 357 ompi/mca/topo/treematch/treematch/tm_thread_pool.c tab[i]=i; tab 361 ompi/mca/topo/treematch/treematch/tm_thread_pool.c args2[1] = tab; tab 145 ompi/mca/topo/treematch/treematch/tm_topology.c double tab[11] = {1024,512,256,128,64,32,16,8,4,2,1}; tab 147 ompi/mca/topo/treematch/treematch/tm_topology.c return tab[depth]; tab 521 ompi/mca/topo/treematch/treematch/tm_topology.c int *tab = NULL; tab 545 ompi/mca/topo/treematch/treematch/tm_topology.c tab = (int*)MALLOC(n*sizeof(int)); tab 556 ompi/mca/topo/treematch/treematch/tm_topology.c tab[i] = atoi(ptr); tab 572 ompi/mca/topo/treematch/treematch/tm_topology.c qsort(tab,n,sizeof(int),int_cmp_inc); tab 574 ompi/mca/topo/treematch/treematch/tm_topology.c return tm_topology_set_binding_constraints_cpy(tab, n, topology, 0); tab 216 ompi/mca/topo/treematch/treematch/tm_tree.c double *aggregate_obj_weight(tm_tree_t *new_tab_node, double *tab, int M) tab 221 ompi/mca/topo/treematch/treematch/tm_tree.c if(!tab) tab 230 ompi/mca/topo/treematch/treematch/tm_tree.c res[i] += tab[id1]; tab 364 ompi/mca/topo/treematch/treematch/tm_tree.c void free_tab_double(double**tab, int mat_order) tab 368 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(tab[i]); tab 369 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(tab); tab 372 ompi/mca/topo/treematch/treematch/tm_tree.c void free_tab_int(int**tab, int mat_order) tab 376 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(tab[i]); tab 377 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(tab); tab 380 ompi/mca/topo/treematch/treematch/tm_tree.c void display_tab(double **tab, int mat_order) tab 390 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%g ", tab[i][j]); tab 392 ompi/mca/topo/treematch/treematch/tm_tree.c fprintf(stderr, "%g ", tab[i][j]); tab 393 ompi/mca/topo/treematch/treematch/tm_tree.c line += tab[i][j]; tab 433 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t *new_group_list(tm_tree_t **tab, double val, group_list_t *next) tab 438 ompi/mca/topo/treematch/treematch/tm_tree.c res->tab = tab; tab 449 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t **tab = NULL; tab 452 ompi/mca/topo/treematch/treematch/tm_tree.c tab=(tm_tree_t **)MALLOC(sizeof(tm_tree_t *)*arity); tab 455 ompi/mca/topo/treematch/treematch/tm_tree.c tab[i] = cur_group[i]; tab 463 ompi/mca/topo/treematch/treematch/tm_tree.c elem = new_group_list(tab, val, list->next); tab 521 ompi/mca/topo/treematch/treematch/tm_tree.c if(elem->tab[i]->id == selection[j]->tab[k]->id) tab 539 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%d ", selection[i]->tab[j]->id); tab 564 ompi/mca/topo/treematch/treematch/tm_tree.c int recurs_select_independent_groups(group_list_t **tab, int i, int n, int arity, int d, int M, double val, double *best_val, group_list_t **selection, group_list_t **best_selection) tab 585 ompi/mca/topo/treematch/treematch/tm_tree.c elem = tab[i]; tab 591 ompi/mca/topo/treematch/treematch/tm_tree.c return recurs_select_independent_groups(tab, i+1, n, arity, d+1, M, val, best_val, selection, best_selection); tab 600 ompi/mca/topo/treematch/treematch/tm_tree.c int test_independent_groups(group_list_t **tab, int i, int n, int arity, int d, int M, double val, double *best_val, group_list_t **selection, group_list_t **best_selection) tab 610 ompi/mca/topo/treematch/treematch/tm_tree.c elem = tab[i]; tab 615 ompi/mca/topo/treematch/treematch/tm_tree.c return recurs_select_independent_groups(tab, i+1, n, arity, d+1, M, val, best_val, selection, best_selection); tab 627 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(list->tab); tab 639 ompi/mca/topo/treematch/treematch/tm_tree.c return (e1->tab[0]->id < e2->tab[0]->id) ? - 1 : 1; tab 693 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%d ", tab_group[i]->tab[j]->id); tab 739 ompi/mca/topo/treematch/treematch/tm_tree.c if(elem1->tab[ii]->id == elem2->tab[jj]->id){ tab 880 ompi/mca/topo/treematch/treematch/tm_tree.c elem-> tab = group->tab; tab 1040 ompi/mca/topo/treematch/treematch/tm_tree.c static double *build_bound_array(double *tab, int n){ tab 1048 ompi/mca/topo/treematch/treematch/tm_tree.c qsort(tab, n, sizeof(double), dbl_cmp_inc); tab 1055 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%.0f ",tab[i]); tab 1059 ompi/mca/topo/treematch/treematch/tm_tree.c bound[1] = tab[0]; tab 1061 ompi/mca/topo/treematch/treematch/tm_tree.c bound[i] = bound[i-1] + tab[i-1]; tab 1069 ompi/mca/topo/treematch/treematch/tm_tree.c static work_unit_t *create_work_unit(work_unit_t *cur, int *tab,int size){ tab 1072 ompi/mca/topo/treematch/treematch/tm_tree.c memcpy(tab_group, tab, size*sizeof(int)); tab 1150 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%d ", tab_group[i]->tab[j]->id); tab 1230 ompi/mca/topo/treematch/treematch/tm_tree.c static int old_recurs_exhaustive_search(group_list_t **tab, int i, int n, int arity, int d, int solution_size, double val, double *best_val, group_list_t **selection, group_list_t **best_selection, int8_t **indep_mat) tab 1253 ompi/mca/topo/treematch/treematch/tm_tree.c elem = tab[i]; tab 1260 ompi/mca/topo/treematch/treematch/tm_tree.c old_recurs_exhaustive_search(tab, i+1, n, arity, d+1, solution_size, val, best_val, selection, best_selection, indep_mat); tab 1272 ompi/mca/topo/treematch/treematch/tm_tree.c static int recurs_exhaustive_search(group_list_t **tab, int i, int n, int arity, int d, int solution_size, double val, double *best_val, group_list_t **selection, group_list_t **best_selection, int8_t **indep_mat, int* tab_i) tab 1297 ompi/mca/topo/treematch/treematch/tm_tree.c elem = tab[i]; tab 1343 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%d ", tab_group[i]->tab[j]->id); tab 1428 ompi/mca/topo/treematch/treematch/tm_tree.c void list_to_tab(group_list_t *list, group_list_t **tab, int n) tab 1437 ompi/mca/topo/treematch/treematch/tm_tree.c tab[n-i-1] = list; tab 1438 ompi/mca/topo/treematch/treematch/tm_tree.c tab[n-i-1]->id = n-i-1; tab 1448 ompi/mca/topo/treematch/treematch/tm_tree.c void display_tab_group(group_list_t **tab, int n, int arity) tab 1455 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%d ", tab[i]->tab[j]->id); tab 1456 ompi/mca/topo/treematch/treematch/tm_tree.c printf(": %.2f %.2f\n", tab[i]->val, tab[i]->wg); tab 1473 ompi/mca/topo/treematch/treematch/tm_tree.c void compute_weighted_degree(group_list_t **tab, int n, int arity) tab 1477 ompi/mca/topo/treematch/treematch/tm_tree.c tab[i]->sum_neighbour = 0; tab 1482 ompi/mca/topo/treematch/treematch/tm_tree.c if(!independent_tab(tab[i]->tab, tab[j]->tab, arity)){ tab 1483 ompi/mca/topo/treematch/treematch/tm_tree.c tab[i]->sum_neighbour += tab[j]->val; tab 1484 ompi/mca/topo/treematch/treematch/tm_tree.c tab[j]->sum_neighbour += tab[i]->val; tab 1487 ompi/mca/topo/treematch/treematch/tm_tree.c tab[i]->wg = tab[i]->sum_neighbour/tab[i]->val; tab 1488 ompi/mca/topo/treematch/treematch/tm_tree.c if(tab[i]->sum_neighbour == 0) tab 1489 ompi/mca/topo/treematch/treematch/tm_tree.c tab[i]->wg = 0; tab 1931 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[l].child[j] = best_selection[l]->tab[j]; tab 1979 ompi/mca/topo/treematch/treematch/tm_tree.c void complete_obj_weight(double **tab, int mat_order, int K) tab 1984 ompi/mca/topo/treematch/treematch/tm_tree.c old_tab = *tab; tab 1997 ompi/mca/topo/treematch/treematch/tm_tree.c *tab = new_tab; tab 2029 ompi/mca/topo/treematch/treematch/tm_tree.c void complete_tab_node(tm_tree_t **tab, int mat_order, int K, int depth, tm_topology_t *topology) tab 2037 ompi/mca/topo/treematch/treematch/tm_tree.c old_tab = *tab; tab 2042 ompi/mca/topo/treematch/treematch/tm_tree.c *tab = new_tab; tab 7 ompi/mca/topo/treematch/treematch/tm_tree.h void display_tab(double **tab,int N); tab 14 ompi/mca/topo/treematch/treematch/tm_tree.h tm_tree_t **tab; tab 142 opal/mca/event/libevent2022/libevent/test/regress_testutils.c struct regress_dns_server_table *tab = data; tab 151 opal/mca/event/libevent2022/libevent/test/regress_testutils.c while (tab->q && evutil_ascii_strcasecmp(question, tab->q) && tab 152 opal/mca/event/libevent2022/libevent/test/regress_testutils.c strcmp("*", tab->q)) tab 153 opal/mca/event/libevent2022/libevent/test/regress_testutils.c ++tab; tab 154 opal/mca/event/libevent2022/libevent/test/regress_testutils.c if (tab->q == NULL) tab 157 opal/mca/event/libevent2022/libevent/test/regress_testutils.c ++tab->seen; tab 159 opal/mca/event/libevent2022/libevent/test/regress_testutils.c if (!strcmp(tab->anstype, "err")) { tab 160 opal/mca/event/libevent2022/libevent/test/regress_testutils.c int err = atoi(tab->ans); tab 163 opal/mca/event/libevent2022/libevent/test/regress_testutils.c } else if (!strcmp(tab->anstype, "errsoa")) { tab 164 opal/mca/event/libevent2022/libevent/test/regress_testutils.c int err = atoi(tab->ans); tab 180 opal/mca/event/libevent2022/libevent/test/regress_testutils.c } else if (!strcmp(tab->anstype, "A")) { tab 182 opal/mca/event/libevent2022/libevent/test/regress_testutils.c if (!evutil_inet_pton(AF_INET, tab->ans, &in)) { tab 183 opal/mca/event/libevent2022/libevent/test/regress_testutils.c TT_DIE(("Bad A value %s in table", tab->ans)); tab 187 opal/mca/event/libevent2022/libevent/test/regress_testutils.c } else if (!strcmp(tab->anstype, "AAAA")) { tab 189 opal/mca/event/libevent2022/libevent/test/regress_testutils.c if (!evutil_inet_pton(AF_INET6, tab->ans, &in6)) { tab 190 opal/mca/event/libevent2022/libevent/test/regress_testutils.c TT_DIE(("Bad AAAA value %s in table", tab->ans)); tab 195 opal/mca/event/libevent2022/libevent/test/regress_testutils.c TT_DIE(("Weird table entry with type '%s'", tab->anstype));