Lines Matching refs:func
357 die ("no count of blocks in func found\n");
724 function_reverse_succ_arcs (Function *func)
731 for (i = 0; i < func->n_blocks; i++)
732 if (func->block_graph[i].succ)
733 func->block_graph[i].succ = reverse_arcs (func->block_graph[i].succ);
758 Function *func;
796 func = dbus_new0 (Function, 1);
797 if (func == NULL)
801 func->name = _dbus_strdup (_dbus_string_get_const_data (&funcname));
802 func->checksum = checksum;
806 func->block_graph = dbus_new0 (Block, n_blocks_in_func);
807 func->n_blocks = n_blocks_in_func;
839 function_add_arc (func, j, destination_block,
854 function_reverse_succ_arcs (func);
856 if (!_dbus_list_append (functions, func))
1113 function_solve_graph (Function *func)
1126 n_blocks = func->n_blocks;
1127 block_graph = func->block_graph;
1244 func->name);
1263 Function *func = link->data;
1265 function_solve_graph (func);
1383 Function *func;
1399 func = NULL;
1470 func = link->data;
1473 if (func->name == NULL)
1475 if (!_dbus_string_copy_data (&f, &func->name))
1480 if (!_dbus_string_equal_c_str (&f, func->name))
1483 func->name, strlen (func->name),
1510 else if (func != NULL)
1515 if (block < func->n_blocks)
1517 if (!_dbus_list_append (&func->block_graph[block].lines,
1523 &func->block_graph[block]))
1529 block, func->n_blocks);
1725 Function *func = link->data;
1732 if (func->block_graph[0].lines == NULL)
1736 while (i < func->n_blocks)
1738 if (func->block_graph[i].lines != NULL)
1740 func->block_graph[0].inside_dbus_build_tests =
1741 func->block_graph[i].inside_dbus_build_tests;
1751 while (i < func->n_blocks)
1753 if (func->block_graph[i].lines == NULL)
1755 func->block_graph[i].inside_dbus_build_tests =
1756 func->block_graph[i-1].inside_dbus_build_tests;
1763 while (i < func->n_blocks)
1766 if (func->block_graph[i].lines != NULL &&
1767 !func->block_graph[i].inside_dbus_build_tests)
1773 if (i == func->n_blocks)
1774 func->inside_dbus_build_tests = TRUE;
1819 Function *func = link->data;
1832 while (i < func->n_blocks)
1834 if (!func->block_graph[i].inside_dbus_build_tests)
1838 if (func->block_graph[i].exec_count > 0)
1845 if (func->block_graph[i].exec_count > 0)
1854 func->partial = TRUE;
1858 func->unused = TRUE;
1860 func->n_test_blocks = n_test_blocks;
1861 func->n_test_blocks_executed = n_test_blocks_executed;
1862 func->n_nontest_blocks = n_nontest_blocks;
1863 func->n_nontest_blocks_executed = n_nontest_blocks_executed;
2005 Function *func = link->data;
2007 if (func->inside_dbus_build_tests)
2013 if (!func->unused)
2016 if (func->partial)
2021 func->n_test_blocks;
2024 func->n_nontest_blocks_executed;
2027 func->n_nontest_blocks;
2110 Function *func = link->data;
2112 printf ("=== %s():\n", func->name);
2115 while (i < func->n_blocks)
2117 Block *b = &func->block_graph[i];
2240 Function *func = link->data;
2242 if (func->unused &&
2243 !func->inside_dbus_build_tests)
2258 Function *func = link->data;
2260 if (func->unused &&
2261 !func->inside_dbus_build_tests)
2262 printf (" %s\n", func->name);
2289 Function *func = link->data;
2291 if (POORLY_TESTED (func))
2306 Function *func = link->data;
2308 if (POORLY_TESTED (func))
2309 printf (" %s (%d%%)\n", func->name,
2310 (int) (TEST_FRACTION (func) * 100));
2344 Function *func = link->data;
2346 if (func->n_nontest_blocks_executed <
2347 func->n_nontest_blocks)
2366 Function *func = link->data;
2368 if (func->n_nontest_blocks_executed <
2369 func->n_nontest_blocks)
2371 funcs[i] = func;
2389 Function *func = funcs[i];
2392 func->name,
2393 func->n_nontest_blocks - func->n_nontest_blocks_executed,
2394 func->n_nontest_blocks);
