Lines Matching defs:dgraph
76 #include "dgraph.h"
152 // used by dgraph.c so can't be static
178 static kload_error __kload_patch_dgraph(dgraph_t * dgraph
184 static kload_error __kload_load_modules(dgraph_t * dgraph
197 dgraph_t * dgraph,
204 static kload_error __kload_load_module(dgraph_t * dgraph,
222 dgraph_t * dgraph,
238 kload_error kload_load_dgraph(dgraph_t * dgraph
261 dgraph_log(dgraph);
284 * If we're doing symbols only, then all entries in the dgraph must
291 for (i = 0; i < dgraph->length; i++) {
292 struct dgraph_entry_t * entry = dgraph->load_order[i];
334 result = kload_set_load_addresses_from_kernel(dgraph, kernel_file,
337 result = kload_set_load_addresses_from_kernel(dgraph);
366 for (i = 0; i < dgraph->length; i++) {
367 struct dgraph_entry_t * entry = dgraph->load_order[i];
418 result = __kload_load_modules(dgraph, kernel_file,
423 result = __kload_load_modules(dgraph);
439 for (i = 0; i < dgraph->length; i++) {
440 dgraph_entry_t * current_entry = dgraph->graph[i];
631 kload_error __kload_make_opaque_basefile(dgraph_t * dgraph, struct mach_header * hdr)
645 if (dgraph->opaque_base_image)
650 dgraph->opaque_base_image = keep_base_image;
651 dgraph->opaque_base_length = keep_base_size;
720 dgraph->opaque_base_image = mem;
721 dgraph->opaque_base_length = size;
732 kload_error __kload_load_modules(dgraph_t * dgraph
766 result = kload_map_dgraph(dgraph, kernel_file);
768 result = kload_map_dgraph(dgraph);
776 result = __kload_patch_dgraph(dgraph, kernel_file);
778 result = __kload_patch_dgraph(dgraph);
787 __kload_output_patches(dgraph, patch_file, patch_dir,
829 if (dgraph->has_symbol_sets)
831 result = __kload_make_opaque_basefile(dgraph, (struct mach_header *) kernel_base_addr);
838 (char *) dgraph->opaque_base_image,
839 dgraph->opaque_base_length);
855 for (i = 0; i < dgraph->length; i++) {
856 dgraph_entry_t * current_entry = dgraph->load_order[i];
871 if (dgraph->have_loaded_symbols)
881 (char *) dgraph->opaque_base_image,
882 dgraph->opaque_base_length);
883 dgraph->have_loaded_symbols = false;
895 dgraph_entry_t * image_dep = dgraph->load_order[j];
942 dgraph->have_loaded_symbols = true;
947 if (dgraph->has_opaque_links
957 result = __kload_load_module(dgraph, current_entry,
958 (current_entry == dgraph->root),
962 result = __kload_load_module(dgraph, current_entry,
963 (current_entry == dgraph->root));
969 if (dgraph->has_opaque_links && (current_entry != dgraph->root))
993 if ( (interactive_level == 1 && current_entry == dgraph->root) ||
1027 if (current_entry != dgraph->root ||
1028 (current_entry == dgraph->root && do_start_kmod)) {
1055 } /* for i, dgraph->length */
1087 kload_error __kload_load_module(dgraph_t * dgraph,
1252 dgraph->have_loaded_symbols = true;
1555 dgraph_t * dgraph,
1559 dgraph_t * dgraph)
1580 for (i = 0; i < dgraph->length; i++) {
1581 dgraph_entry_t * entry = dgraph->load_order[i];
1672 dgraph_t * dgraph,
1684 result = kload_map_dgraph(dgraph, kernel_file);
1693 for (i = 0; i < dgraph->length; i++) {
1694 dgraph_entry_t * entry = dgraph->load_order[i];
1733 dgraph_t * dgraph,
1744 result = kload_map_dgraph(dgraph, kernel_file);
1754 for (i = 0; i < dgraph->length; i++) {
1755 dgraph_entry_t * entry = dgraph->load_order[i];
1805 for (i = 0; i < dgraph->length; i++) {
1806 dgraph_entry_t * entry = dgraph->load_order[i];
1827 dgraph_t * dgraph,
1839 * We have to map the dgraph's modules before checking whether they've
1842 result = kload_map_dgraph(dgraph, kernel_file);
1851 for (i = 0; i < dgraph->length; i++) {
1852 struct dgraph_entry_t * entry = dgraph->load_order[i];
1868 for (i = 0; i < dgraph->length; i++) {
1870 dgraph_entry_t * current_entry = dgraph->load_order[i];
1875 cresult = __kload_check_module_loaded(dgraph, current_entry,
1881 if (current_entry == dgraph->root &&
1905 dgraph_t * dgraph)
1917 * We have to map the dgraph's modules before checking whether they've
1920 result = kload_map_dgraph(dgraph);
1929 for (i = 0; i < dgraph->length; i++) {
1930 struct dgraph_entry_t * entry = dgraph->load_order[i];
1938 for (i = 0; i < dgraph->length; i++) {
1940 dgraph_entry_t * current_entry = dgraph->load_order[i];
1945 cresult = __kload_check_module_loaded(dgraph, current_entry, false);
1950 if (current_entry == dgraph->root &&
2005 dgraph_t * dgraph,
2081 if (entry == dgraph->root) {
2114 kload_error __kload_patch_dgraph(dgraph_t * dgraph
2131 for (i = 0; i < dgraph->length; i++) {
2132 dgraph_entry_t * current_entry = dgraph->load_order[i];
2195 dgraph_t * dgraph,
2210 for (i = 0; i < dgraph->length; i++) {
2212 struct dgraph_entry_t * entry = dgraph->load_order[i];
2310 kld_file_debug_dump(dgraph->root->name, patch_file);