new_node 326 daemons/controld/controld_membership.c xmlNode *new_node = NULL; new_node 337 daemons/controld/controld_membership.c new_node = pcmk__xe_create(node_list, PCMK_XE_NODE); new_node 338 daemons/controld/controld_membership.c crm_xml_add(new_node, PCMK_XA_ID, node->uuid); new_node 339 daemons/controld/controld_membership.c crm_xml_add(new_node, PCMK_XA_UNAME, node->uname); new_node 76 lib/pacemaker/pcmk_sched_nodes.c pcmk_node_t *new_node = pe__copy_node(node); new_node 78 lib/pacemaker/pcmk_sched_nodes.c g_hash_table_insert(new_table, (gpointer) new_node->details->id, new_node 79 lib/pacemaker/pcmk_sched_nodes.c new_node); new_node 175 lib/pacemaker/pcmk_sched_nodes.c pcmk_node_t *new_node = NULL; new_node 178 lib/pacemaker/pcmk_sched_nodes.c new_node = pe__copy_node(this_node); new_node 180 lib/pacemaker/pcmk_sched_nodes.c new_node->weight = 0; new_node 182 lib/pacemaker/pcmk_sched_nodes.c result = g_list_prepend(result, new_node); new_node 473 lib/pengine/unpack.c pcmk_node_t *new_node = NULL; new_node 479 lib/pengine/unpack.c new_node = calloc(1, sizeof(pcmk_node_t)); new_node 480 lib/pengine/unpack.c if (new_node == NULL) { new_node 485 lib/pengine/unpack.c new_node->weight = score; new_node 486 lib/pengine/unpack.c new_node->details = calloc(1, sizeof(struct pe_node_shared_s)); new_node 488 lib/pengine/unpack.c if (new_node->details == NULL) { new_node 489 lib/pengine/unpack.c free(new_node); new_node 495 lib/pengine/unpack.c new_node->details->id = id; new_node 496 lib/pengine/unpack.c new_node->details->uname = uname; new_node 497 lib/pengine/unpack.c new_node->details->online = FALSE; new_node 498 lib/pengine/unpack.c new_node->details->shutdown = FALSE; new_node 499 lib/pengine/unpack.c new_node->details->rsc_discovery_enabled = TRUE; new_node 500 lib/pengine/unpack.c new_node->details->running_rsc = NULL; new_node 501 lib/pengine/unpack.c new_node->details->data_set = scheduler; new_node 505 lib/pengine/unpack.c new_node->details->type = pcmk_node_variant_cluster; new_node 508 lib/pengine/unpack.c new_node->details->type = pcmk_node_variant_remote; new_node 525 lib/pengine/unpack.c new_node->details->type = node_ping; new_node 528 lib/pengine/unpack.c new_node->details->attrs = pcmk__strkey_table(free, free); new_node 530 lib/pengine/unpack.c if (pcmk__is_pacemaker_remote_node(new_node)) { new_node 531 lib/pengine/unpack.c pcmk__insert_dup(new_node->details->attrs, CRM_ATTR_KIND, "remote"); new_node 533 lib/pengine/unpack.c pcmk__insert_dup(new_node->details->attrs, CRM_ATTR_KIND, "cluster"); new_node 536 lib/pengine/unpack.c new_node->details->utilization = pcmk__strkey_table(free, free); new_node 537 lib/pengine/unpack.c new_node->details->digest_cache = pcmk__strkey_table(free, new_node 540 lib/pengine/unpack.c scheduler->nodes = g_list_insert_sorted(scheduler->nodes, new_node, new_node 542 lib/pengine/unpack.c return new_node; new_node 612 lib/pengine/unpack.c handle_startup_fencing(pcmk_scheduler_t *scheduler, pcmk_node_t *new_node) new_node 614 lib/pengine/unpack.c if ((new_node->details->type == pcmk_node_variant_remote) new_node 615 lib/pengine/unpack.c && (new_node->details->remote_rsc == NULL)) { new_node 625 lib/pengine/unpack.c new_node->details->unclean = TRUE; new_node 629 lib/pengine/unpack.c new_node->details->unclean = FALSE; new_node 634 lib/pengine/unpack.c new_node->details->unseen = TRUE; new_node 641 lib/pengine/unpack.c pcmk_node_t *new_node = NULL; new_node 653 lib/pengine/unpack.c new_node = NULL; new_node 673 lib/pengine/unpack.c new_node = pe_create_node(id, uname, type, score, scheduler); new_node 675 lib/pengine/unpack.c if (new_node == NULL) { new_node 679 lib/pengine/unpack.c handle_startup_fencing(scheduler, new_node); new_node 681 lib/pengine/unpack.c add_node_attrs(xml_obj, new_node, FALSE, scheduler); new_node 91 lib/pengine/utils.c pcmk_node_t *new_node = NULL; new_node 95 lib/pengine/utils.c new_node = pcmk__assert_alloc(1, sizeof(pcmk_node_t)); new_node 97 lib/pengine/utils.c new_node->rsc_discover_mode = this_node->rsc_discover_mode; new_node 98 lib/pengine/utils.c new_node->weight = this_node->weight; new_node 99 lib/pengine/utils.c new_node->fixed = this_node->fixed; // @COMPAT deprecated and unused new_node 100 lib/pengine/utils.c new_node->count = this_node->count; new_node 101 lib/pengine/utils.c new_node->details = this_node->details; new_node 103 lib/pengine/utils.c return new_node; new_node 121 lib/pengine/utils.c pcmk_node_t *new_node = NULL; new_node 123 lib/pengine/utils.c new_node = pe__copy_node((const pcmk_node_t *) gIter->data); new_node 124 lib/pengine/utils.c g_hash_table_insert(result, (gpointer) new_node->details->id, new_node); new_node 541 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t new_node = new_node 544 maint/gnulib/lib/gl_anyavltree_list2.h if (new_node == NULL) new_node 547 maint/gnulib/lib/gl_anyavltree_list2.h new_node->left = NULL; new_node 548 maint/gnulib/lib/gl_anyavltree_list2.h new_node->right = NULL; new_node 549 maint/gnulib/lib/gl_anyavltree_list2.h new_node->balance = 0; new_node 550 maint/gnulib/lib/gl_anyavltree_list2.h new_node->branch_size = 1; new_node 551 maint/gnulib/lib/gl_anyavltree_list2.h new_node->value = elt; new_node 553 maint/gnulib/lib/gl_anyavltree_list2.h new_node->h.hashcode = new_node 555 maint/gnulib/lib/gl_anyavltree_list2.h ? list->base.hashcode_fn (new_node->value) new_node 556 maint/gnulib/lib/gl_anyavltree_list2.h : (size_t)(uintptr_t) new_node->value); new_node 562 maint/gnulib/lib/gl_anyavltree_list2.h list->root = new_node; new_node 563 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = NULL; new_node 572 maint/gnulib/lib/gl_anyavltree_list2.h node->left = new_node; new_node 573 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = node; new_node 593 maint/gnulib/lib/gl_anyavltree_list2.h if (add_to_bucket (list, new_node) < 0) new_node 595 maint/gnulib/lib/gl_anyavltree_list2.h gl_tree_remove_node_from_tree (list, new_node); new_node 596 maint/gnulib/lib/gl_anyavltree_list2.h free (new_node); new_node 602 maint/gnulib/lib/gl_anyavltree_list2.h return new_node; new_node 609 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t new_node = new_node 612 maint/gnulib/lib/gl_anyavltree_list2.h if (new_node == NULL) new_node 615 maint/gnulib/lib/gl_anyavltree_list2.h new_node->left = NULL; new_node 616 maint/gnulib/lib/gl_anyavltree_list2.h new_node->right = NULL; new_node 617 maint/gnulib/lib/gl_anyavltree_list2.h new_node->balance = 0; new_node 618 maint/gnulib/lib/gl_anyavltree_list2.h new_node->branch_size = 1; new_node 619 maint/gnulib/lib/gl_anyavltree_list2.h new_node->value = elt; new_node 621 maint/gnulib/lib/gl_anyavltree_list2.h new_node->h.hashcode = new_node 623 maint/gnulib/lib/gl_anyavltree_list2.h ? list->base.hashcode_fn (new_node->value) new_node 624 maint/gnulib/lib/gl_anyavltree_list2.h : (size_t)(uintptr_t) new_node->value); new_node 630 maint/gnulib/lib/gl_anyavltree_list2.h list->root = new_node; new_node 631 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = NULL; new_node 640 maint/gnulib/lib/gl_anyavltree_list2.h node->right = new_node; new_node 641 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = node; new_node 661 maint/gnulib/lib/gl_anyavltree_list2.h if (add_to_bucket (list, new_node) < 0) new_node 663 maint/gnulib/lib/gl_anyavltree_list2.h gl_tree_remove_node_from_tree (list, new_node); new_node 664 maint/gnulib/lib/gl_anyavltree_list2.h free (new_node); new_node 670 maint/gnulib/lib/gl_anyavltree_list2.h return new_node; new_node 677 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t new_node; new_node 680 maint/gnulib/lib/gl_anyavltree_list2.h new_node = new_node 682 maint/gnulib/lib/gl_anyavltree_list2.h if (new_node == NULL) new_node 685 maint/gnulib/lib/gl_anyavltree_list2.h new_node->left = NULL; new_node 686 maint/gnulib/lib/gl_anyavltree_list2.h new_node->right = NULL; new_node 687 maint/gnulib/lib/gl_anyavltree_list2.h new_node->balance = 0; new_node 688 maint/gnulib/lib/gl_anyavltree_list2.h new_node->branch_size = 1; new_node 689 maint/gnulib/lib/gl_anyavltree_list2.h new_node->value = elt; new_node 691 maint/gnulib/lib/gl_anyavltree_list2.h new_node->h.hashcode = new_node 693 maint/gnulib/lib/gl_anyavltree_list2.h ? list->base.hashcode_fn (new_node->value) new_node 694 maint/gnulib/lib/gl_anyavltree_list2.h : (size_t)(uintptr_t) new_node->value); new_node 700 maint/gnulib/lib/gl_anyavltree_list2.h node->left = new_node; new_node 708 maint/gnulib/lib/gl_anyavltree_list2.h node->right = new_node; new_node 712 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = node; new_node 730 maint/gnulib/lib/gl_anyavltree_list2.h if (add_to_bucket (list, new_node) < 0) new_node 732 maint/gnulib/lib/gl_anyavltree_list2.h gl_tree_remove_node_from_tree (list, new_node); new_node 733 maint/gnulib/lib/gl_anyavltree_list2.h free (new_node); new_node 739 maint/gnulib/lib/gl_anyavltree_list2.h return new_node; new_node 746 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t new_node; new_node 749 maint/gnulib/lib/gl_anyavltree_list2.h new_node = new_node 751 maint/gnulib/lib/gl_anyavltree_list2.h if (new_node == NULL) new_node 754 maint/gnulib/lib/gl_anyavltree_list2.h new_node->left = NULL; new_node 755 maint/gnulib/lib/gl_anyavltree_list2.h new_node->right = NULL; new_node 756 maint/gnulib/lib/gl_anyavltree_list2.h new_node->balance = 0; new_node 757 maint/gnulib/lib/gl_anyavltree_list2.h new_node->branch_size = 1; new_node 758 maint/gnulib/lib/gl_anyavltree_list2.h new_node->value = elt; new_node 760 maint/gnulib/lib/gl_anyavltree_list2.h new_node->h.hashcode = new_node 762 maint/gnulib/lib/gl_anyavltree_list2.h ? list->base.hashcode_fn (new_node->value) new_node 763 maint/gnulib/lib/gl_anyavltree_list2.h : (size_t)(uintptr_t) new_node->value); new_node 769 maint/gnulib/lib/gl_anyavltree_list2.h node->right = new_node; new_node 777 maint/gnulib/lib/gl_anyavltree_list2.h node->left = new_node; new_node 781 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = node; new_node 799 maint/gnulib/lib/gl_anyavltree_list2.h if (add_to_bucket (list, new_node) < 0) new_node 801 maint/gnulib/lib/gl_anyavltree_list2.h gl_tree_remove_node_from_tree (list, new_node); new_node 802 maint/gnulib/lib/gl_anyavltree_list2.h free (new_node); new_node 808 maint/gnulib/lib/gl_anyavltree_list2.h return new_node; new_node 694 maint/gnulib/lib/gl_anylinked_list2.h gl_list_node_t new_node = new_node 697 maint/gnulib/lib/gl_anylinked_list2.h if (new_node == NULL) new_node 700 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(const void *) new_node->value = elt; new_node 702 maint/gnulib/lib/gl_anylinked_list2.h new_node->h.hashcode = new_node 704 maint/gnulib/lib/gl_anylinked_list2.h ? list->base.hashcode_fn (new_node->value) new_node 705 maint/gnulib/lib/gl_anylinked_list2.h : (size_t)(uintptr_t) new_node->value); new_node 708 maint/gnulib/lib/gl_anylinked_list2.h if (add_to_bucket (list, new_node) < 0) new_node 710 maint/gnulib/lib/gl_anylinked_list2.h free (new_node); new_node 716 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->next = node; new_node 717 maint/gnulib/lib/gl_anylinked_list2.h new_node->prev = node->prev; new_node 718 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->prev->next = new_node; new_node 719 maint/gnulib/lib/gl_anylinked_list2.h node->prev = new_node; new_node 726 maint/gnulib/lib/gl_anylinked_list2.h return new_node; new_node 732 maint/gnulib/lib/gl_anylinked_list2.h gl_list_node_t new_node = new_node 735 maint/gnulib/lib/gl_anylinked_list2.h if (new_node == NULL) new_node 738 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(const void *) new_node->value = elt; new_node 740 maint/gnulib/lib/gl_anylinked_list2.h new_node->h.hashcode = new_node 742 maint/gnulib/lib/gl_anylinked_list2.h ? list->base.hashcode_fn (new_node->value) new_node 743 maint/gnulib/lib/gl_anylinked_list2.h : (size_t)(uintptr_t) new_node->value); new_node 746 maint/gnulib/lib/gl_anylinked_list2.h if (add_to_bucket (list, new_node) < 0) new_node 748 maint/gnulib/lib/gl_anylinked_list2.h free (new_node); new_node 754 maint/gnulib/lib/gl_anylinked_list2.h new_node->prev = node; new_node 755 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->next = node->next; new_node 756 maint/gnulib/lib/gl_anylinked_list2.h new_node->next->prev = new_node; new_node 757 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) node->next = new_node; new_node 764 maint/gnulib/lib/gl_anylinked_list2.h return new_node; new_node 771 maint/gnulib/lib/gl_anylinked_list2.h gl_list_node_t new_node; new_node 777 maint/gnulib/lib/gl_anylinked_list2.h new_node = (struct gl_list_node_impl *) malloc (sizeof (struct gl_list_node_impl)); new_node 778 maint/gnulib/lib/gl_anylinked_list2.h if (new_node == NULL) new_node 781 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(const void *) new_node->value = elt; new_node 783 maint/gnulib/lib/gl_anylinked_list2.h new_node->h.hashcode = new_node 785 maint/gnulib/lib/gl_anylinked_list2.h ? list->base.hashcode_fn (new_node->value) new_node 786 maint/gnulib/lib/gl_anylinked_list2.h : (size_t)(uintptr_t) new_node->value); new_node 789 maint/gnulib/lib/gl_anylinked_list2.h if (add_to_bucket (list, new_node) < 0) new_node 791 maint/gnulib/lib/gl_anylinked_list2.h free (new_node); new_node 804 maint/gnulib/lib/gl_anylinked_list2.h new_node->prev = node; new_node 805 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->next = node->next; new_node 806 maint/gnulib/lib/gl_anylinked_list2.h new_node->next->prev = new_node; new_node 807 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) node->next = new_node; new_node 817 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->next = node; new_node 818 maint/gnulib/lib/gl_anylinked_list2.h new_node->prev = node->prev; new_node 819 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->prev->next = new_node; new_node 820 maint/gnulib/lib/gl_anylinked_list2.h node->prev = new_node; new_node 828 maint/gnulib/lib/gl_anylinked_list2.h return new_node; new_node 784 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t new_node = new_node 787 maint/gnulib/lib/gl_anyrbtree_list2.h if (new_node == NULL) new_node 790 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->left = NULL; new_node 791 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->right = NULL; new_node 792 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->branch_size = 1; new_node 793 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->value = elt; new_node 795 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->h.hashcode = new_node 797 maint/gnulib/lib/gl_anyrbtree_list2.h ? list->base.hashcode_fn (new_node->value) new_node 798 maint/gnulib/lib/gl_anyrbtree_list2.h : (size_t)(uintptr_t) new_node->value); new_node 804 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->color = BLACK; new_node 805 maint/gnulib/lib/gl_anyrbtree_list2.h list->root = new_node; new_node 806 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = NULL; new_node 815 maint/gnulib/lib/gl_anyrbtree_list2.h node->left = new_node; new_node 816 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = node; new_node 827 maint/gnulib/lib/gl_anyrbtree_list2.h rebalance_after_add (list, new_node, node); new_node 834 maint/gnulib/lib/gl_anyrbtree_list2.h if (add_to_bucket (list, new_node) < 0) new_node 836 maint/gnulib/lib/gl_anyrbtree_list2.h gl_tree_remove_node_from_tree (list, new_node); new_node 837 maint/gnulib/lib/gl_anyrbtree_list2.h free (new_node); new_node 843 maint/gnulib/lib/gl_anyrbtree_list2.h return new_node; new_node 850 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t new_node = new_node 853 maint/gnulib/lib/gl_anyrbtree_list2.h if (new_node == NULL) new_node 856 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->left = NULL; new_node 857 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->right = NULL; new_node 858 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->branch_size = 1; new_node 859 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->value = elt; new_node 861 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->h.hashcode = new_node 863 maint/gnulib/lib/gl_anyrbtree_list2.h ? list->base.hashcode_fn (new_node->value) new_node 864 maint/gnulib/lib/gl_anyrbtree_list2.h : (size_t)(uintptr_t) new_node->value); new_node 870 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->color = BLACK; new_node 871 maint/gnulib/lib/gl_anyrbtree_list2.h list->root = new_node; new_node 872 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = NULL; new_node 881 maint/gnulib/lib/gl_anyrbtree_list2.h node->right = new_node; new_node 882 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = node; new_node 893 maint/gnulib/lib/gl_anyrbtree_list2.h rebalance_after_add (list, new_node, node); new_node 900 maint/gnulib/lib/gl_anyrbtree_list2.h if (add_to_bucket (list, new_node) < 0) new_node 902 maint/gnulib/lib/gl_anyrbtree_list2.h gl_tree_remove_node_from_tree (list, new_node); new_node 903 maint/gnulib/lib/gl_anyrbtree_list2.h free (new_node); new_node 909 maint/gnulib/lib/gl_anyrbtree_list2.h return new_node; new_node 916 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t new_node = new_node 919 maint/gnulib/lib/gl_anyrbtree_list2.h if (new_node == NULL) new_node 922 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->left = NULL; new_node 923 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->right = NULL; new_node 924 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->branch_size = 1; new_node 925 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->value = elt; new_node 927 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->h.hashcode = new_node 929 maint/gnulib/lib/gl_anyrbtree_list2.h ? list->base.hashcode_fn (new_node->value) new_node 930 maint/gnulib/lib/gl_anyrbtree_list2.h : (size_t)(uintptr_t) new_node->value); new_node 935 maint/gnulib/lib/gl_anyrbtree_list2.h node->left = new_node; new_node 940 maint/gnulib/lib/gl_anyrbtree_list2.h node->right = new_node; new_node 942 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = node; new_node 953 maint/gnulib/lib/gl_anyrbtree_list2.h rebalance_after_add (list, new_node, node); new_node 959 maint/gnulib/lib/gl_anyrbtree_list2.h if (add_to_bucket (list, new_node) < 0) new_node 961 maint/gnulib/lib/gl_anyrbtree_list2.h gl_tree_remove_node_from_tree (list, new_node); new_node 962 maint/gnulib/lib/gl_anyrbtree_list2.h free (new_node); new_node 968 maint/gnulib/lib/gl_anyrbtree_list2.h return new_node; new_node 975 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t new_node = new_node 978 maint/gnulib/lib/gl_anyrbtree_list2.h if (new_node == NULL) new_node 981 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->left = NULL; new_node 982 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->right = NULL; new_node 983 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->branch_size = 1; new_node 984 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->value = elt; new_node 986 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->h.hashcode = new_node 988 maint/gnulib/lib/gl_anyrbtree_list2.h ? list->base.hashcode_fn (new_node->value) new_node 989 maint/gnulib/lib/gl_anyrbtree_list2.h : (size_t)(uintptr_t) new_node->value); new_node 994 maint/gnulib/lib/gl_anyrbtree_list2.h node->right = new_node; new_node 999 maint/gnulib/lib/gl_anyrbtree_list2.h node->left = new_node; new_node 1001 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = node; new_node 1012 maint/gnulib/lib/gl_anyrbtree_list2.h rebalance_after_add (list, new_node, node); new_node 1018 maint/gnulib/lib/gl_anyrbtree_list2.h if (add_to_bucket (list, new_node) < 0) new_node 1020 maint/gnulib/lib/gl_anyrbtree_list2.h gl_tree_remove_node_from_tree (list, new_node); new_node 1021 maint/gnulib/lib/gl_anyrbtree_list2.h free (new_node); new_node 1027 maint/gnulib/lib/gl_anyrbtree_list2.h return new_node; new_node 100 maint/gnulib/lib/gl_anytreehash_list1.h add_to_bucket (gl_list_t list, gl_list_node_t new_node) new_node 102 maint/gnulib/lib/gl_anytreehash_list1.h size_t bucket = new_node->h.hashcode % list->table_size; new_node 107 maint/gnulib/lib/gl_anytreehash_list1.h size_t hashcode = new_node->h.hashcode; new_node 108 maint/gnulib/lib/gl_anytreehash_list1.h const void *value = new_node->value; new_node 128 maint/gnulib/lib/gl_anytreehash_list1.h return gl_oset_nx_add (nodes, new_node); new_node 150 maint/gnulib/lib/gl_anytreehash_list1.h if (gl_oset_nx_add (nodes, new_node) < 0) new_node 173 maint/gnulib/lib/gl_anytreehash_list1.h new_node->h.hash_next = list->table[bucket]; new_node 174 maint/gnulib/lib/gl_anytreehash_list1.h list->table[bucket] = &new_node->h; new_node 301 maint/gnulib/lib/gl_avltree_ordered.h NODE_T new_node = new_node 304 maint/gnulib/lib/gl_avltree_ordered.h if (new_node == NULL) new_node 307 maint/gnulib/lib/gl_avltree_ordered.h new_node->left = NULL; new_node 308 maint/gnulib/lib/gl_avltree_ordered.h new_node->right = NULL; new_node 309 maint/gnulib/lib/gl_avltree_ordered.h new_node->balance = 0; new_node 310 maint/gnulib/lib/gl_avltree_ordered.h NODE_PAYLOAD_ASSIGN(new_node) new_node 315 maint/gnulib/lib/gl_avltree_ordered.h container->root = new_node; new_node 316 maint/gnulib/lib/gl_avltree_ordered.h new_node->parent = NULL; new_node 325 maint/gnulib/lib/gl_avltree_ordered.h node->left = new_node; new_node 326 maint/gnulib/lib/gl_avltree_ordered.h new_node->parent = node; new_node 335 maint/gnulib/lib/gl_avltree_ordered.h return new_node; new_node 340 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_add_node_before (CONTAINER_T container, NODE_T node, NODE_T new_node) new_node 344 maint/gnulib/lib/gl_avltree_ordered.h new_node->left = NULL; new_node 345 maint/gnulib/lib/gl_avltree_ordered.h new_node->right = NULL; new_node 346 maint/gnulib/lib/gl_avltree_ordered.h new_node->balance = 0; new_node 351 maint/gnulib/lib/gl_avltree_ordered.h node->left = new_node; new_node 359 maint/gnulib/lib/gl_avltree_ordered.h node->right = new_node; new_node 363 maint/gnulib/lib/gl_avltree_ordered.h new_node->parent = node; new_node 376 maint/gnulib/lib/gl_avltree_ordered.h NODE_T new_node = new_node 379 maint/gnulib/lib/gl_avltree_ordered.h if (new_node == NULL) new_node 382 maint/gnulib/lib/gl_avltree_ordered.h NODE_PAYLOAD_ASSIGN(new_node) new_node 384 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_add_node_before (container, node, new_node); new_node 385 maint/gnulib/lib/gl_avltree_ordered.h return new_node; new_node 390 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_add_node_after (CONTAINER_T container, NODE_T node, NODE_T new_node) new_node 394 maint/gnulib/lib/gl_avltree_ordered.h new_node->left = NULL; new_node 395 maint/gnulib/lib/gl_avltree_ordered.h new_node->right = NULL; new_node 396 maint/gnulib/lib/gl_avltree_ordered.h new_node->balance = 0; new_node 401 maint/gnulib/lib/gl_avltree_ordered.h node->right = new_node; new_node 409 maint/gnulib/lib/gl_avltree_ordered.h node->left = new_node; new_node 413 maint/gnulib/lib/gl_avltree_ordered.h new_node->parent = node; new_node 426 maint/gnulib/lib/gl_avltree_ordered.h NODE_T new_node = new_node 429 maint/gnulib/lib/gl_avltree_ordered.h if (new_node == NULL) new_node 432 maint/gnulib/lib/gl_avltree_ordered.h NODE_PAYLOAD_ASSIGN(new_node) new_node 434 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_add_node_after (container, node, new_node); new_node 435 maint/gnulib/lib/gl_avltree_ordered.h return new_node; new_node 533 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T new_node = new_node 536 maint/gnulib/lib/gl_rbtree_ordered.h if (new_node == NULL) new_node 539 maint/gnulib/lib/gl_rbtree_ordered.h new_node->left = NULL; new_node 540 maint/gnulib/lib/gl_rbtree_ordered.h new_node->right = NULL; new_node 541 maint/gnulib/lib/gl_rbtree_ordered.h NODE_PAYLOAD_ASSIGN(new_node) new_node 546 maint/gnulib/lib/gl_rbtree_ordered.h new_node->color = BLACK; new_node 547 maint/gnulib/lib/gl_rbtree_ordered.h container->root = new_node; new_node 548 maint/gnulib/lib/gl_rbtree_ordered.h new_node->parent = NULL; new_node 557 maint/gnulib/lib/gl_rbtree_ordered.h node->left = new_node; new_node 558 maint/gnulib/lib/gl_rbtree_ordered.h new_node->parent = node; new_node 561 maint/gnulib/lib/gl_rbtree_ordered.h rebalance_after_add (container, new_node, node); new_node 565 maint/gnulib/lib/gl_rbtree_ordered.h return new_node; new_node 570 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_add_node_before (CONTAINER_T container, NODE_T node, NODE_T new_node) new_node 572 maint/gnulib/lib/gl_rbtree_ordered.h new_node->left = NULL; new_node 573 maint/gnulib/lib/gl_rbtree_ordered.h new_node->right = NULL; new_node 577 maint/gnulib/lib/gl_rbtree_ordered.h node->left = new_node; new_node 582 maint/gnulib/lib/gl_rbtree_ordered.h node->right = new_node; new_node 584 maint/gnulib/lib/gl_rbtree_ordered.h new_node->parent = node; new_node 587 maint/gnulib/lib/gl_rbtree_ordered.h rebalance_after_add (container, new_node, node); new_node 596 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T new_node = new_node 599 maint/gnulib/lib/gl_rbtree_ordered.h if (new_node == NULL) new_node 602 maint/gnulib/lib/gl_rbtree_ordered.h NODE_PAYLOAD_ASSIGN(new_node) new_node 604 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_add_node_before (container, node, new_node); new_node 605 maint/gnulib/lib/gl_rbtree_ordered.h return new_node; new_node 610 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_add_node_after (CONTAINER_T container, NODE_T node, NODE_T new_node) new_node 612 maint/gnulib/lib/gl_rbtree_ordered.h new_node->left = NULL; new_node 613 maint/gnulib/lib/gl_rbtree_ordered.h new_node->right = NULL; new_node 617 maint/gnulib/lib/gl_rbtree_ordered.h node->right = new_node; new_node 622 maint/gnulib/lib/gl_rbtree_ordered.h node->left = new_node; new_node 624 maint/gnulib/lib/gl_rbtree_ordered.h new_node->parent = node; new_node 627 maint/gnulib/lib/gl_rbtree_ordered.h rebalance_after_add (container, new_node, node); new_node 636 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T new_node = new_node 639 maint/gnulib/lib/gl_rbtree_ordered.h if (new_node == NULL) new_node 642 maint/gnulib/lib/gl_rbtree_ordered.h NODE_PAYLOAD_ASSIGN(new_node) new_node 644 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_add_node_after (container, node, new_node); new_node 645 maint/gnulib/lib/gl_rbtree_ordered.h return new_node; new_node 2674 maint/gnulib/lib/localename.c struct struniq_hash_node *new_node; new_node 2680 maint/gnulib/lib/localename.c new_node = new_node 2683 maint/gnulib/lib/localename.c if (new_node == NULL) new_node 2686 maint/gnulib/lib/localename.c memcpy (new_node->contents, string, size); new_node 2696 maint/gnulib/lib/localename.c free (new_node); new_node 2697 maint/gnulib/lib/localename.c new_node = p; new_node 2702 maint/gnulib/lib/localename.c new_node->next = struniq_hash_table[slot]; new_node 2703 maint/gnulib/lib/localename.c struniq_hash_table[slot] = new_node; new_node 2708 maint/gnulib/lib/localename.c return new_node->contents; new_node 80 maint/gnulib/lib/pagealign_alloc.c memnode_t *new_node = XMALLOC (memnode_t); new_node 81 maint/gnulib/lib/pagealign_alloc.c new_node->aligned_ptr = aligned_ptr; new_node 82 maint/gnulib/lib/pagealign_alloc.c new_node->info = info; new_node 83 maint/gnulib/lib/pagealign_alloc.c new_node->next = memnode_table; new_node 84 maint/gnulib/lib/pagealign_alloc.c memnode_table = new_node;