Lines Matching refs:func
358 die ("no count of blocks in func found\n");
725 function_reverse_succ_arcs (Function *func)
732 for (i = 0; i < func->n_blocks; i++)
733 if (func->block_graph[i].succ)
734 func->block_graph[i].succ = reverse_arcs (func->block_graph[i].succ);
759 Function *func;
797 func = dbus_new0 (Function, 1);
798 if (func == NULL)
802 func->name = _dbus_strdup (_dbus_string_get_const_data (&funcname));
803 func->checksum = checksum;
807 func->block_graph = dbus_new0 (Block, n_blocks_in_func);
808 func->n_blocks = n_blocks_in_func;
840 function_add_arc (func, j, destination_block,
855 function_reverse_succ_arcs (func);
857 if (!_dbus_list_append (functions, func))
1114 function_solve_graph (Function *func)
1127 n_blocks = func->n_blocks;
1128 block_graph = func->block_graph;
1245 func->name);
1264 Function *func = link->data;
1266 function_solve_graph (func);
1384 Function *func;
1400 func = NULL;
1471 func = link->data;
1474 if (func->name == NULL)
1476 if (!_dbus_string_copy_data (&f, &func->name))
1481 if (!_dbus_string_equal_c_str (&f, func->name))
1484 func->name, strlen (func->name),
1511 else if (func != NULL)
1516 if (block < func->n_blocks)
1518 if (!_dbus_list_append (&func->block_graph[block].lines,
1524 &func->block_graph[block]))
1530 block, func->n_blocks);
1726 Function *func = link->data;
1733 if (func->block_graph[0].lines == NULL)
1737 while (i < func->n_blocks)
1739 if (func->block_graph[i].lines != NULL)
1741 func->block_graph[0].inside_dbus_build_tests =
1742 func->block_graph[i].inside_dbus_build_tests;
1752 while (i < func->n_blocks)
1754 if (func->block_graph[i].lines == NULL)
1756 func->block_graph[i].inside_dbus_build_tests =
1757 func->block_graph[i-1].inside_dbus_build_tests;
1764 while (i < func->n_blocks)
1767 if (func->block_graph[i].lines != NULL &&
1768 !func->block_graph[i].inside_dbus_build_tests)
1774 if (i == func->n_blocks)
1775 func->inside_dbus_build_tests = TRUE;
1820 Function *func = link->data;
1833 while (i < func->n_blocks)
1835 if (!func->block_graph[i].inside_dbus_build_tests)
1839 if (func->block_graph[i].exec_count > 0)
1846 if (func->block_graph[i].exec_count > 0)
1855 func->partial = TRUE;
1859 func->unused = TRUE;
1861 func->n_test_blocks = n_test_blocks;
1862 func->n_test_blocks_executed = n_test_blocks_executed;
1863 func->n_nontest_blocks = n_nontest_blocks;
1864 func->n_nontest_blocks_executed = n_nontest_blocks_executed;
2006 Function *func = link->data;
2008 if (func->inside_dbus_build_tests)
2014 if (!func->unused)
2017 if (func->partial)
2022 func->n_test_blocks;
2025 func->n_nontest_blocks_executed;
2028 func->n_nontest_blocks;
2111 Function *func = link->data;
2113 printf ("=== %s():\n", func->name);
2116 while (i < func->n_blocks)
2118 Block *b = &func->block_graph[i];
2241 Function *func = link->data;
2243 if (func->unused &&
2244 !func->inside_dbus_build_tests)
2259 Function *func = link->data;
2261 if (func->unused &&
2262 !func->inside_dbus_build_tests)
2263 printf (" %s\n", func->name);
2290 Function *func = link->data;
2292 if (POORLY_TESTED (func))
2307 Function *func = link->data;
2309 if (POORLY_TESTED (func))
2310 printf (" %s (%d%%)\n", func->name,
2311 (int) (TEST_FRACTION (func) * 100));
2345 Function *func = link->data;
2347 if (func->n_nontest_blocks_executed <
2348 func->n_nontest_blocks)
2367 Function *func = link->data;
2369 if (func->n_nontest_blocks_executed <
2370 func->n_nontest_blocks)
2372 funcs[i] = func;
2390 Function *func = funcs[i];
2393 func->name,
2394 func->n_nontest_blocks - func->n_nontest_blocks_executed,
2395 func->n_nontest_blocks);
