Lines Matching defs:new_entry
561 dgraph_entry_t * new_entry = NULL; // free on error
620 new_entry = (dgraph_entry_t *)malloc(sizeof(dgraph_entry_t));
621 if (!new_entry) {
625 bzero(new_entry, sizeof(dgraph_entry_t));
626 new_entry->expected_kmod_name = dgstrdup(expected_kmod_name);
627 if (!new_entry->expected_kmod_name) {
631 new_entry->expected_kmod_vers = dgstrdup(expected_kmod_vers);
632 if (!new_entry->expected_kmod_vers) {
636 new_entry->is_kernel_component = is_kernel_component;
639 new_entry->is_symbol_set = (2 & is_kernel_component);
641 new_entry->opaques = 0;
642 if (!strncmp(new_entry->expected_kmod_name,
644 new_entry->opaques |= kOpaqueLink;
645 if (!strcmp(new_entry->expected_kmod_name,
647 new_entry->opaques |= kOpaqueLink | kRawKernelLink;
650 dgraph->has_symbol_sets |= new_entry->is_symbol_set;
652 new_entry->do_load = !is_kernel_component;
655 new_entry->object = NULL; // provided elswehere in userland
656 new_entry->object_length = 0;
658 new_entry->object = object;
659 new_entry->object_length = object_length;
660 new_entry->object_is_kmem = object_is_kmem;
662 new_entry->user_data = user_data;
663 new_entry->user_data_length = user_data_length;
666 new_entry->name = dgstrdup(name);
667 if (!new_entry->name) {
671 dgraph->graph[dgraph->length++] = new_entry;
676 new_entry->dependencies_capacity = 5;
677 new_entry->num_dependencies = 0;
678 new_entry->dependencies = (dgraph_entry_t **)malloc(
679 new_entry->dependencies_capacity * sizeof(dgraph_entry_t *));
680 if (!new_entry->dependencies) {
685 if (new_entry->loaded_address == 0) {
686 new_entry->loaded_address = load_address;
688 new_entry->do_load = 0;
692 the_entry = new_entry;
696 if (new_entry) __dgraph_entry_free(new_entry);
697 the_entry = new_entry = NULL;