Searched refs:num_roots (Results 1 – 4 of 4) sorted by relevance
26 int num_roots; variable99 while (num_roots_arrived < num_roots - 1) {} in thread_func()169 num_roots = atoi(argv[1]); in main()170 pthread_t *roots = (pthread_t*)malloc(sizeof(pthread_t) * num_roots); in main()171 int *root_ids = (int*)malloc(sizeof(int) * num_roots); in main()180 for (i = 1; i < num_roots; ++i) { in main()189 for (i = 1; i < num_roots; ++i) { in main()
380 unsigned num_roots() const { return Roots.size(); } in num_roots() function
90 if (G.num_roots() == 0) { // Initialize the analysis by constructing in ExecuteWorkList()
2594 assert(TrimmedGraph->num_roots() == 1); in BugPathGetter()