nodes              87 include/crm/common/ipc_controld.h         GList *nodes; // list of pcmk_controld_api_node_t *
nodes             382 include/crm/pengine/internal.h                               const char *comment, GHashTable *nodes,
nodes             385 include/crm/pengine/internal.h #define pe__show_node_weights(level, rsc, text, nodes, data_set)    \
nodes             387 include/crm/pengine/internal.h                                  (level), (rsc), (text), (nodes), (data_set))
nodes             180 include/crm/pengine/pe_types.h     GList *nodes;
nodes             173 lib/common/ipc_controld.c         data->data.nodes = g_list_prepend(data->data.nodes, node_info);
nodes             289 lib/common/ipc_controld.c         g_list_free_full(reply_data.data.nodes, free);
nodes             193 lib/pacemaker/libpacemaker_private.h                                       GHashTable **nodes, const char *attr,
nodes             461 lib/pacemaker/libpacemaker_private.h                                      GHashTable **nodes, const char *attr,
nodes             724 lib/pacemaker/libpacemaker_private.h                                            GHashTable **nodes, const char *attr,
nodes             872 lib/pacemaker/libpacemaker_private.h bool pcmk__any_node_available(GHashTable *nodes);
nodes             875 lib/pacemaker/libpacemaker_private.h GHashTable *pcmk__copy_node_table(GHashTable *nodes);
nodes             878 lib/pacemaker/libpacemaker_private.h GList *pcmk__sort_nodes(GList *nodes, pe_node_t *active_node);
nodes              84 lib/pacemaker/pcmk_graph_producer.c     for (gIter = data_set->nodes; gIter != NULL;
nodes            1757 lib/pacemaker/pcmk_output.c         CHECK_RC(rc, out->message(out, "node-list", data_set->nodes, unames,
nodes            1881 lib/pacemaker/pcmk_output.c         out->message(out, "node-list", data_set->nodes, unames, resources,
nodes            1962 lib/pacemaker/pcmk_output.c         out->message(out, "node-list", data_set->nodes, unames, resources,
nodes            1899 lib/pacemaker/pcmk_sched_actions.c     for (GList *iter = data_set->nodes; iter != NULL; iter = iter->next) {
nodes            1322 lib/pacemaker/pcmk_sched_colocation.c add_node_scores_matching_attr(GHashTable *nodes, const pe_resource_t *rsc,
nodes            1334 lib/pacemaker/pcmk_sched_colocation.c     g_hash_table_iter_init(&iter, nodes);
nodes            1421 lib/pacemaker/pcmk_sched_colocation.c                                 GHashTable **nodes, const char *attr,
nodes            1426 lib/pacemaker/pcmk_sched_colocation.c     CRM_CHECK((rsc != NULL) && (nodes != NULL), return);
nodes            1440 lib/pacemaker/pcmk_sched_colocation.c     if (*nodes == NULL) {
nodes            1448 lib/pacemaker/pcmk_sched_colocation.c         work = pcmk__copy_node_table(*nodes);
nodes            1520 lib/pacemaker/pcmk_sched_colocation.c     if (*nodes != NULL) {
nodes            1521 lib/pacemaker/pcmk_sched_colocation.c        g_hash_table_destroy(*nodes);
nodes            1523 lib/pacemaker/pcmk_sched_colocation.c     *nodes = work;
nodes             766 lib/pacemaker/pcmk_sched_group.c                                       GHashTable **nodes, const char *attr,
nodes             771 lib/pacemaker/pcmk_sched_group.c     CRM_CHECK((rsc != NULL) && (nodes != NULL), return);
nodes             800 lib/pacemaker/pcmk_sched_group.c     if (*nodes == NULL) {
nodes             807 lib/pacemaker/pcmk_sched_group.c     member->cmds->add_colocated_node_scores(member, log_id, nodes, attr, factor,
nodes             182 lib/pacemaker/pcmk_sched_instances.c apply_parent_colocations(const pe_resource_t *rsc, GHashTable **nodes)
nodes             197 lib/pacemaker/pcmk_sched_instances.c         other->cmds->add_colocated_node_scores(other, rsc->id, nodes,
nodes             209 lib/pacemaker/pcmk_sched_instances.c         other->cmds->add_colocated_node_scores(other, rsc->id, nodes,
nodes            1105 lib/pacemaker/pcmk_sched_instances.c     GList *nodes = NULL;
nodes            1115 lib/pacemaker/pcmk_sched_instances.c     nodes = pcmk__sort_nodes(g_hash_table_get_values(match_rsc->allowed_nodes),
nodes            1117 lib/pacemaker/pcmk_sched_instances.c     for (GList *iter = nodes; (iter != NULL) && (instance == NULL);
nodes            1128 lib/pacemaker/pcmk_sched_instances.c     g_list_free(nodes);
nodes             130 lib/pacemaker/pcmk_sched_location.c         match_L = pcmk__copy_node_list(data_set->nodes, true);
nodes             138 lib/pacemaker/pcmk_sched_location.c     for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) {
nodes             222 lib/pacemaker/pcmk_sched_location.c         pe_node_t *match = pe_find_node(data_set->nodes, node);
nodes              65 lib/pacemaker/pcmk_sched_nodes.c pcmk__copy_node_table(GHashTable *nodes)
nodes              71 lib/pacemaker/pcmk_sched_nodes.c     if (nodes == NULL) {
nodes              75 lib/pacemaker/pcmk_sched_nodes.c     g_hash_table_iter_init(&iter, nodes);
nodes             236 lib/pacemaker/pcmk_sched_nodes.c pcmk__sort_nodes(GList *nodes, pe_node_t *active_node)
nodes             238 lib/pacemaker/pcmk_sched_nodes.c     return g_list_sort_with_data(nodes, compare_nodes, active_node);
nodes             251 lib/pacemaker/pcmk_sched_nodes.c pcmk__any_node_available(GHashTable *nodes)
nodes             256 lib/pacemaker/pcmk_sched_nodes.c     if (nodes == NULL) {
nodes             259 lib/pacemaker/pcmk_sched_nodes.c     g_hash_table_iter_init(&iter, nodes);
nodes             293 lib/pacemaker/pcmk_sched_nodes.c     for (GList *iter = data_set->nodes; iter != NULL; iter = iter->next) {
nodes             131 lib/pacemaker/pcmk_sched_primitive.c         GList *nodes = g_hash_table_get_values(rsc->allowed_nodes);
nodes             133 lib/pacemaker/pcmk_sched_primitive.c         if (nodes != NULL) {
nodes             134 lib/pacemaker/pcmk_sched_primitive.c             return pcmk__sort_nodes(nodes, pe__current_node(rsc));
nodes             152 lib/pacemaker/pcmk_sched_primitive.c     GList *nodes = NULL;
nodes             168 lib/pacemaker/pcmk_sched_primitive.c     nodes = sorted_allowed_nodes(rsc);
nodes             169 lib/pacemaker/pcmk_sched_primitive.c     if (nodes != NULL) {
nodes             170 lib/pacemaker/pcmk_sched_primitive.c         best = (pe_node_t *) nodes->data; // First node has best score
nodes             173 lib/pacemaker/pcmk_sched_primitive.c     if ((prefer != NULL) && (nodes != NULL)) {
nodes             200 lib/pacemaker/pcmk_sched_primitive.c                          pe__node_name(chosen), rsc->id, g_list_length(nodes));
nodes             235 lib/pacemaker/pcmk_sched_primitive.c                 for (GList *iter = nodes->next; iter; iter = iter->next) {
nodes             260 lib/pacemaker/pcmk_sched_primitive.c                      pe__node_name(chosen), rsc->id, g_list_length(nodes));
nodes             264 lib/pacemaker/pcmk_sched_primitive.c     g_list_free(nodes);
nodes             325 lib/pacemaker/pcmk_sched_primitive.c     pe_node_t *remote_node = pe_find_node(connection->cluster->nodes,
nodes            1572 lib/pacemaker/pcmk_sched_primitive.c     g_list_foreach(rsc->cluster->nodes, ban_if_not_locked, rsc);
nodes             855 lib/pacemaker/pcmk_sched_probes.c     for (GList *iter = data_set->nodes; iter != NULL; iter = iter->next) {
nodes             491 lib/pacemaker/pcmk_sched_recurring.c     for (GList *iter = rsc->cluster->nodes; iter != NULL; iter = iter->next) {
nodes             584 lib/pacemaker/pcmk_sched_resource.c get_node_weight(const pe_node_t *node, GHashTable *nodes)
nodes             588 lib/pacemaker/pcmk_sched_resource.c     if ((node != NULL) && (nodes != NULL)) {
nodes             589 lib/pacemaker/pcmk_sched_resource.c         weighted_node = g_hash_table_lookup(nodes, node->details->id);
nodes             610 lib/pacemaker/pcmk_sched_resource.c     const GList *nodes = (const GList *) data;
nodes             636 lib/pacemaker/pcmk_sched_resource.c     if (nodes == NULL) {
nodes             673 lib/pacemaker/pcmk_sched_resource.c     for (const GList *iter = nodes; iter != NULL; iter = iter->next) {
nodes             716 lib/pacemaker/pcmk_sched_resource.c     GList *nodes = g_list_copy(data_set->nodes);
nodes             718 lib/pacemaker/pcmk_sched_resource.c     nodes = pcmk__sort_nodes(nodes, NULL);
nodes             720 lib/pacemaker/pcmk_sched_resource.c                                                 cmp_resources, nodes);
nodes             721 lib/pacemaker/pcmk_sched_resource.c     g_list_free(nodes);
nodes             463 lib/pacemaker/pcmk_sched_utilization.c     for (const GList *iter = data_set->nodes; iter != NULL; iter = iter->next) {
nodes             251 lib/pacemaker/pcmk_scheduler.c     for (GList *iter = data_set->nodes; iter != NULL; iter = iter->next) {
nodes             279 lib/pacemaker/pcmk_scheduler.c     for (GList *node_iter = data_set->nodes; node_iter != NULL;
nodes             359 lib/pacemaker/pcmk_scheduler.c     for (GList *iter = data_set->nodes; iter != NULL; iter = iter->next) {
nodes             556 lib/pacemaker/pcmk_scheduler.c     for (GList *iter = data_set->nodes; iter != NULL; iter = iter->next) {
nodes             309 lib/pacemaker/pcmk_status.c     for (GList *iter = data_set->nodes; iter != NULL; iter = iter->next) {
nodes             541 lib/pengine/bundle.c         node = pe_find_node(parent->cluster->nodes, uname);
nodes            1940 lib/pengine/bundle.c     GHashTable *nodes = NULL;
nodes            1982 lib/pengine/bundle.c     nodes = g_hash_table_new(NULL, NULL);
nodes            1991 lib/pengine/bundle.c             if (g_hash_table_insert(nodes, (gpointer) node->details,
nodes            2002 lib/pengine/bundle.c     g_hash_table_destroy(nodes);
nodes             221 lib/pengine/clone.c                                        g_list_length(data_set->nodes));
nodes             361 lib/pengine/clone.c         clone_data->clone_max = QB_MAX(1, g_list_length(data_set->nodes));
nodes            1136 lib/pengine/clone.c                 GList *nodes = nodes_with_status(stopped, status);
nodes            1137 lib/pengine/clone.c                 GString *nodes_str = node_list_to_str(nodes);
nodes            1147 lib/pengine/clone.c                 g_list_free(nodes);
nodes            1235 lib/pengine/clone.c         if (clone_data->clone_max == g_list_length(data_set->nodes)) {
nodes             143 lib/pengine/native.c                     rsc->allowed_nodes = pe__node_list2table(data_set->nodes);
nodes            1041 lib/pengine/pe_actions.c     for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) {
nodes             671 lib/pengine/pe_notif.c     GList *nodes = NULL;
nodes             736 lib/pengine/pe_notif.c     nodes = g_hash_table_get_values(n_data->allowed_nodes);
nodes             742 lib/pengine/pe_notif.c         nodes = g_list_sort(nodes, pe__cmp_node_name);
nodes             744 lib/pengine/pe_notif.c     get_node_names(nodes, &node_list, NULL);
nodes             746 lib/pengine/pe_notif.c     g_list_free(nodes);
nodes             750 lib/pengine/pe_notif.c         get_node_names(rsc->cluster->nodes, &node_list, &metal_list);
nodes             753 lib/pengine/pe_notif.c         get_node_names(rsc->cluster->nodes, &node_list, NULL);
nodes             347 lib/pengine/pe_output.c     for (GList *gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) {
nodes             418 lib/pengine/pe_output.c         out->message(out, "cluster-counts", g_list_length(data_set->nodes),
nodes             487 lib/pengine/pe_output.c         out->message(out, "cluster-counts", g_list_length(data_set->nodes),
nodes            2102 lib/pengine/pe_output.c     for (GList *gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) {
nodes            2279 lib/pengine/pe_output.c     GList *nodes = va_arg(args, GList *);
nodes            2287 lib/pengine/pe_output.c     for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) {
nodes            2307 lib/pengine/pe_output.c     GList *nodes = va_arg(args, GList *);
nodes            2322 lib/pengine/pe_output.c     for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) {
nodes            2411 lib/pengine/pe_output.c     GList *nodes = va_arg(args, GList *);
nodes            2418 lib/pengine/pe_output.c     for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) {
nodes            2455 lib/pengine/pe_output.c         pe_node_t *node = pe_find_node_id(data_set->nodes, ID(node_state));
nodes              21 lib/pengine/remote.c            && pe__is_remote_node(pe_find_node(data_set->nodes, rsc->id));
nodes             133 lib/pengine/remote.c             pe_node_t *guest_node = pe_find_node(data_set->nodes, rsc->id);
nodes             193 lib/pengine/status.c pe_free_nodes(GList *nodes)
nodes             195 lib/pengine/status.c     for (GList *iterator = nodes; iterator != NULL; iterator = iterator->next) {
nodes             227 lib/pengine/status.c     if (nodes != NULL) {
nodes             228 lib/pengine/status.c         g_list_free(nodes);
nodes             315 lib/pengine/status.c     pe_free_nodes(data_set->nodes);
nodes             426 lib/pengine/status.c pe_find_node_any(const GList *nodes, const char *id, const char *uname)
nodes             431 lib/pengine/status.c         match = pe_find_node_id(nodes, id);
nodes             434 lib/pengine/status.c         match = pe_find_node(nodes, uname);
nodes             448 lib/pengine/status.c pe_find_node_id(const GList *nodes, const char *id)
nodes             450 lib/pengine/status.c     for (const GList *iter = nodes; iter != NULL; iter = iter->next) {
nodes             473 lib/pengine/status.c pe_find_node(const GList *nodes, const char *node_name)
nodes             475 lib/pengine/status.c     for (const GList *iter = nodes; iter != NULL; iter = iter->next) {
nodes              70 lib/pengine/tags.c         pe_node_t *node = pe_find_node_id(data_set->nodes, id);
nodes              55 lib/pengine/tests/native/native_find_rsc_test.c     cluster01 = pe_find_node(data_set->nodes, "cluster01");
nodes              56 lib/pengine/tests/native/native_find_rsc_test.c     cluster02 = pe_find_node(data_set->nodes, "cluster02");
nodes              57 lib/pengine/tests/native/native_find_rsc_test.c     httpd_bundle_0 = pe_find_node(data_set->nodes, "httpd-bundle-0");
nodes              25 lib/pengine/tests/status/pe_find_node_any_test.c     GList *nodes = NULL;
nodes              37 lib/pengine/tests/status/pe_find_node_any_test.c     nodes = g_list_append(nodes, a);
nodes              38 lib/pengine/tests/status/pe_find_node_any_test.c     nodes = g_list_append(nodes, b);
nodes              40 lib/pengine/tests/status/pe_find_node_any_test.c     assert_ptr_equal(b, pe_find_node_any(nodes, "id2", NULL));
nodes              41 lib/pengine/tests/status/pe_find_node_any_test.c     assert_ptr_equal(b, pe_find_node_any(nodes, "ID2", NULL));
nodes              43 lib/pengine/tests/status/pe_find_node_any_test.c     assert_ptr_equal(a, pe_find_node_any(nodes, "xyz", "cluster1"));
nodes              44 lib/pengine/tests/status/pe_find_node_any_test.c     assert_ptr_equal(a, pe_find_node_any(nodes, NULL, "cluster1"));
nodes              46 lib/pengine/tests/status/pe_find_node_any_test.c     assert_null(pe_find_node_any(nodes, "id10", NULL));
nodes              47 lib/pengine/tests/status/pe_find_node_any_test.c     assert_null(pe_find_node_any(nodes, "nodeid1", NULL));
nodes              48 lib/pengine/tests/status/pe_find_node_any_test.c     assert_null(pe_find_node_any(nodes, NULL, "cluster10"));
nodes              49 lib/pengine/tests/status/pe_find_node_any_test.c     assert_null(pe_find_node_any(nodes, NULL, "nodecluster1"));
nodes              50 lib/pengine/tests/status/pe_find_node_any_test.c     assert_null(pe_find_node_any(nodes, "id3", "cluster3"));
nodes              51 lib/pengine/tests/status/pe_find_node_any_test.c     assert_null(pe_find_node_any(nodes, NULL, NULL));
nodes              57 lib/pengine/tests/status/pe_find_node_any_test.c     g_list_free(nodes);
nodes              23 lib/pengine/tests/status/pe_find_node_id_test.c     GList *nodes = NULL;
nodes              33 lib/pengine/tests/status/pe_find_node_id_test.c     nodes = g_list_append(nodes, a);
nodes              34 lib/pengine/tests/status/pe_find_node_id_test.c     nodes = g_list_append(nodes, b);
nodes              36 lib/pengine/tests/status/pe_find_node_id_test.c     assert_ptr_equal(a, pe_find_node_id(nodes, "id1"));
nodes              37 lib/pengine/tests/status/pe_find_node_id_test.c     assert_null(pe_find_node_id(nodes, "id10"));
nodes              38 lib/pengine/tests/status/pe_find_node_id_test.c     assert_null(pe_find_node_id(nodes, "nodeid1"));
nodes              39 lib/pengine/tests/status/pe_find_node_id_test.c     assert_ptr_equal(b, pe_find_node_id(nodes, "ID2"));
nodes              40 lib/pengine/tests/status/pe_find_node_id_test.c     assert_null(pe_find_node_id(nodes, "xyz"));
nodes              46 lib/pengine/tests/status/pe_find_node_id_test.c     g_list_free(nodes);
nodes              23 lib/pengine/tests/status/pe_find_node_test.c     GList *nodes = NULL;
nodes              33 lib/pengine/tests/status/pe_find_node_test.c     nodes = g_list_append(nodes, a);
nodes              34 lib/pengine/tests/status/pe_find_node_test.c     nodes = g_list_append(nodes, b);
nodes              36 lib/pengine/tests/status/pe_find_node_test.c     assert_ptr_equal(a, pe_find_node(nodes, "cluster1"));
nodes              37 lib/pengine/tests/status/pe_find_node_test.c     assert_null(pe_find_node(nodes, "cluster10"));
nodes              38 lib/pengine/tests/status/pe_find_node_test.c     assert_null(pe_find_node(nodes, "nodecluster1"));
nodes              39 lib/pengine/tests/status/pe_find_node_test.c     assert_ptr_equal(b, pe_find_node(nodes, "CLUSTER2"));
nodes              40 lib/pengine/tests/status/pe_find_node_test.c     assert_null(pe_find_node(nodes, "xyz"));
nodes              46 lib/pengine/tests/status/pe_find_node_test.c     g_list_free(nodes);
nodes             404 lib/pengine/unpack.c     if (pe_find_node(data_set->nodes, uname) != NULL) {
nodes             467 lib/pengine/unpack.c     data_set->nodes = g_list_insert_sorted(data_set->nodes, new_node,
nodes             595 lib/pengine/unpack.c     if (data_set->localhost && pe_find_node(data_set->nodes, data_set->localhost) == NULL) {
nodes             649 lib/pengine/unpack.c             if (new_node_id && pe_find_node(data_set->nodes, new_node_id) == NULL) {
nodes             667 lib/pengine/unpack.c             if (new_node_id && pe_find_node(data_set->nodes, new_node_id) == NULL) {
nodes             686 lib/pengine/unpack.c                 if (new_node_id && pe_find_node(data_set->nodes, new_node_id) == NULL) {
nodes             720 lib/pengine/unpack.c     remote_node = pe_find_node(data_set->nodes, new_rsc->id);
nodes            1101 lib/pengine/unpack.c     this_node = pe_find_node_any(data_set->nodes, id, uname);
nodes            1181 lib/pengine/unpack.c         this_node = pe_find_node_any(data_set->nodes, id, uname);
nodes            1312 lib/pengine/unpack.c     for (GList *gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) {
nodes            1714 lib/pengine/unpack.c         node = pe_find_node(data_set->nodes, rsc_id);
nodes            2149 lib/pengine/unpack.c                     tmpnode = pe_find_node(rsc->cluster->nodes, rsc->id);
nodes            2181 lib/pengine/unpack.c         tmpnode = pe_find_node(rsc->cluster->nodes, rsc->id);
nodes            3003 lib/pengine/unpack.c     target_node = pe_find_node(history->rsc->cluster->nodes, target);
nodes            3031 lib/pengine/unpack.c         pe_node_t *source_node = pe_find_node(history->rsc->cluster->nodes,
nodes            3099 lib/pengine/unpack.c         pe_node_t *target_node = pe_find_node(history->rsc->cluster->nodes,
nodes            3165 lib/pengine/unpack.c         pe_node_t *source_node = pe_find_node(history->rsc->cluster->nodes,
nodes            3355 lib/pengine/unpack.c     fail_rsc->allowed_nodes = pe__node_list2table(rsc->cluster->nodes);
nodes            3807 lib/pengine/unpack.c     pe_node_t *remote_node = pe_find_node(data_set->nodes, remote_conn->id);
nodes            3845 lib/pengine/unpack.c         pe_node_t *remote_node = pe_find_node(rsc->cluster->nodes, rsc->id);
nodes            4412 lib/pengine/unpack.c         target = pe_find_node(history->rsc->cluster->nodes, migrate_target);
nodes            4785 lib/pengine/unpack.c             this_node = pe_find_node(data_set->nodes, uname);
nodes             217 lib/pengine/utils.c                         GHashTable *nodes, pe_working_set_t *data_set)
nodes             222 lib/pengine/utils.c     GList *list = g_list_sort(g_hash_table_get_values(nodes),
nodes             248 lib/pengine/utils.c                      GHashTable *nodes)
nodes             256 lib/pengine/utils.c     g_hash_table_iter_init(&iter, nodes);
nodes             291 lib/pengine/utils.c                          const char *comment, GHashTable *nodes,
nodes             298 lib/pengine/utils.c     if (nodes == NULL) {
nodes             304 lib/pengine/utils.c         pe__log_node_weights(file, function, line, rsc, comment, nodes);
nodes             306 lib/pengine/utils.c         pe__output_node_weights(rsc, comment, nodes, data_set);
nodes             405 lib/pengine/utils.c         GList *gIter = data_set->nodes;
nodes             832 lib/pengine/utils.c     GList *nodes = NULL;
nodes             839 lib/pengine/utils.c         nodes = g_list_prepend(nodes, strdup("*"));
nodes             841 lib/pengine/utils.c         pe_node_t *node = pe_find_node(data_set->nodes, s);
nodes             847 lib/pengine/utils.c             nodes = g_list_prepend(nodes, strdup(s));
nodes             855 lib/pengine/utils.c             nodes = pe__unames_with_tag(data_set, s);
nodes             859 lib/pengine/utils.c     return nodes;
nodes              25 maint/gnulib/lib/gl_anytreehash_list1.h   gl_oset_t nodes;                  /* set of nodes, sorted by position */
nodes             121 maint/gnulib/lib/gl_anytreehash_list1.h                   gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes;
nodes             123 maint/gnulib/lib/gl_anytreehash_list1.h                   gl_list_node_t node = gl_oset_first (nodes);
nodes             128 maint/gnulib/lib/gl_anytreehash_list1.h                       return gl_oset_nx_add (nodes, new_node);
nodes             139 maint/gnulib/lib/gl_anytreehash_list1.h                       gl_oset_t nodes;
nodes             142 maint/gnulib/lib/gl_anytreehash_list1.h                       nodes =
nodes             145 maint/gnulib/lib/gl_anytreehash_list1.h                       if (nodes == NULL)
nodes             148 maint/gnulib/lib/gl_anytreehash_list1.h                       if (gl_oset_nx_add (nodes, node) < 0)
nodes             150 maint/gnulib/lib/gl_anytreehash_list1.h                       if (gl_oset_nx_add (nodes, new_node) < 0)
nodes             160 maint/gnulib/lib/gl_anytreehash_list1.h                       multi_entry->nodes = nodes;
nodes             165 maint/gnulib/lib/gl_anytreehash_list1.h                       gl_oset_free (nodes);
nodes             217 maint/gnulib/lib/gl_anytreehash_list1.h               gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes;
nodes             219 maint/gnulib/lib/gl_anytreehash_list1.h               gl_list_node_t node = gl_oset_first (nodes);
nodes             224 maint/gnulib/lib/gl_anytreehash_list1.h                   if (!gl_oset_remove (nodes, old_node))
nodes             226 maint/gnulib/lib/gl_anytreehash_list1.h                   if (gl_oset_size (nodes) == 1)
nodes             229 maint/gnulib/lib/gl_anytreehash_list1.h                       node = gl_oset_first (nodes);
nodes             232 maint/gnulib/lib/gl_anytreehash_list1.h                       gl_oset_free (nodes);
nodes              45 maint/gnulib/lib/gl_anytreehash_list2.h                   gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes;
nodes              47 maint/gnulib/lib/gl_anytreehash_list2.h                   gl_list_node_t node = gl_oset_first (nodes);
nodes              65 maint/gnulib/lib/gl_anytreehash_list2.h                           if (gl_oset_search_atleast (nodes,
nodes             161 maint/gnulib/lib/gl_anytreehash_list2.h                   gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes;
nodes             163 maint/gnulib/lib/gl_anytreehash_list2.h                   gl_oset_free (nodes);
nodes             117 maint/gnulib/lib/hamt.c   Hamt_entry *nodes[FLEXIBLE_ARRAY_MEMBER];
nodes             253 maint/gnulib/lib/hamt.c     = xmalloc (FLEXSIZEOF (struct subtrie, nodes,
nodes             290 maint/gnulib/lib/hamt.c       new_subtrie->nodes[k] = entry;
nodes             292 maint/gnulib/lib/hamt.c       new_subtrie->nodes[k] = copy_entry (subtrie->nodes[k]);
nodes             307 maint/gnulib/lib/hamt.c         new_subtrie->nodes[k] = copy_entry (subtrie->nodes[k]);
nodes             309 maint/gnulib/lib/hamt.c         new_subtrie->nodes[k] = copy_entry (subtrie->nodes[k - 1]);
nodes             311 maint/gnulib/lib/hamt.c         new_subtrie->nodes[k] = entry;
nodes             325 maint/gnulib/lib/hamt.c         return copy_entry (subtrie->nodes[1]);
nodes             326 maint/gnulib/lib/hamt.c       return copy_entry (subtrie->nodes[0]);
nodes             333 maint/gnulib/lib/hamt.c         new_subtrie->nodes[k] = copy_entry (subtrie->nodes[k]);
nodes             335 maint/gnulib/lib/hamt.c         new_subtrie->nodes[k] = copy_entry (subtrie->nodes[k + 1]);
nodes             433 maint/gnulib/lib/hamt.c   Hamt_entry **node_ptr = subtrie->nodes;
nodes             486 maint/gnulib/lib/hamt.c   return entry_lookup (functions, subtrie->nodes[j], elt, hash >> 5);
nodes             553 maint/gnulib/lib/hamt.c           subtrie->nodes[0] = elt1;
nodes             554 maint/gnulib/lib/hamt.c           subtrie->nodes[1] = elt2;
nodes             558 maint/gnulib/lib/hamt.c           subtrie->nodes[0] = elt2;
nodes             559 maint/gnulib/lib/hamt.c           subtrie->nodes[1] = elt1;
nodes             566 maint/gnulib/lib/hamt.c       subtrie->nodes[0]
nodes             630 maint/gnulib/lib/hamt.c       Hamt_entry *entry = subtrie->nodes[j];
nodes             639 maint/gnulib/lib/hamt.c           subtrie->nodes[j] = new_entry;
nodes             779 maint/gnulib/lib/hamt.c       Hamt_entry *entry = subtrie->nodes[j];
nodes             790 maint/gnulib/lib/hamt.c           subtrie->nodes[j] = new_entry;
nodes             893 maint/gnulib/lib/hamt.c   Hamt_entry *const *node_ptr = subtrie->nodes;
nodes             961 maint/gnulib/lib/hamt.c       entry = subtrie->nodes[0];
nodes            1020 maint/gnulib/lib/hamt.c           while (iter->entry[++iter->depth] = subtrie->nodes[j],
nodes             287 maint/gnulib/lib/regcomp.c   for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)
nodes             289 maint/gnulib/lib/regcomp.c       Idx node = init_state->nodes.elems[node_cnt];
nodes             290 maint/gnulib/lib/regcomp.c       re_token_type_t type = dfa->nodes[node].type;
nodes             294 maint/gnulib/lib/regcomp.c 	  re_set_fastmap (fastmap, icase, dfa->nodes[node].opr.c);
nodes             303 maint/gnulib/lib/regcomp.c 	      *p++ = dfa->nodes[node].opr.c;
nodes             305 maint/gnulib/lib/regcomp.c 		     &&	dfa->nodes[node].type == CHARACTER
nodes             306 maint/gnulib/lib/regcomp.c 		     && dfa->nodes[node].mb_partial)
nodes             307 maint/gnulib/lib/regcomp.c 		*p++ = dfa->nodes[node].opr.c;
nodes             322 maint/gnulib/lib/regcomp.c 	      bitset_word_t w = dfa->nodes[node].opr.sbcset[i];
nodes             330 maint/gnulib/lib/regcomp.c 	  re_charset_t *cset = dfa->nodes[node].opr.mbcset;
nodes             563 maint/gnulib/lib/regcomp.c   if (dfa->nodes)
nodes             565 maint/gnulib/lib/regcomp.c       free_token (dfa->nodes + i);
nodes             579 maint/gnulib/lib/regcomp.c   re_free (dfa->nodes);
nodes             827 maint/gnulib/lib/regcomp.c   dfa->nodes = re_malloc (re_token_t, dfa->nodes_alloc);
nodes             884 maint/gnulib/lib/regcomp.c   if (__glibc_unlikely (dfa->nodes == NULL || dfa->state_table == NULL))
nodes             983 maint/gnulib/lib/regcomp.c 	re_token_type_t type = dfa->nodes[node_idx].type;
nodes             991 maint/gnulib/lib/regcomp.c 	    clexp_node = dfa->nodes + init_nodes.elems[clexp_idx];
nodes             993 maint/gnulib/lib/regcomp.c 		&& clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx)
nodes            1054 maint/gnulib/lib/regcomp.c     switch (dfa->nodes[node].type)
nodes            1057 maint/gnulib/lib/regcomp.c 	if (dfa->nodes[node].opr.c >= ASCII_CHARS)
nodes            1061 maint/gnulib/lib/regcomp.c 	switch (dfa->nodes[node].opr.ctx_type)
nodes            1095 maint/gnulib/lib/regcomp.c 	      if (dfa->nodes[node].opr.sbcset[i] >> rshift != 0)
nodes            1108 maint/gnulib/lib/regcomp.c 	if (dfa->nodes[node].type == CHARACTER
nodes            1109 maint/gnulib/lib/regcomp.c 	    && dfa->nodes[node].opr.c >= ASCII_CHARS)
nodes            1110 maint/gnulib/lib/regcomp.c 	  dfa->nodes[node].mb_partial = 0;
nodes            1111 maint/gnulib/lib/regcomp.c 	else if (dfa->nodes[node].type == OP_PERIOD)
nodes            1112 maint/gnulib/lib/regcomp.c 	  dfa->nodes[node].type = OP_UTF8_PERIOD;
nodes            1359 maint/gnulib/lib/regcomp.c 	dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type;
nodes            1458 maint/gnulib/lib/regcomp.c       if (dfa->nodes[org_node].type == OP_BACK_REF)
nodes            1498 maint/gnulib/lib/regcomp.c 	  constraint |= dfa->nodes[org_node].constraint;
nodes            1560 maint/gnulib/lib/regcomp.c   for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx)
nodes            1563 maint/gnulib/lib/regcomp.c 	  && constraint == dfa->nodes[idx].constraint)
nodes            1576 maint/gnulib/lib/regcomp.c   Idx dup_idx = re_dfa_add_node (dfa, dfa->nodes[org_idx]);
nodes            1579 maint/gnulib/lib/regcomp.c       dfa->nodes[dup_idx].constraint = constraint;
nodes            1580 maint/gnulib/lib/regcomp.c       dfa->nodes[dup_idx].constraint |= dfa->nodes[org_idx].constraint;
nodes            1581 maint/gnulib/lib/regcomp.c       dfa->nodes[dup_idx].duplicated = 1;
nodes            1674 maint/gnulib/lib/regcomp.c   if (dfa->nodes[node].constraint
nodes            1676 maint/gnulib/lib/regcomp.c       && !dfa->nodes[dfa->edests[node].elems[0]].duplicated)
nodes            1679 maint/gnulib/lib/regcomp.c 				    dfa->nodes[node].constraint);
nodes            1685 maint/gnulib/lib/regcomp.c   if (IS_EPSILON_NODE(dfa->nodes[node].type))
nodes              25 maint/gnulib/lib/regex_internal.c 					  const re_node_set *nodes,
nodes              28 maint/gnulib/lib/regex_internal.c 					  const re_node_set *nodes,
nodes            1395 maint/gnulib/lib/regex_internal.c       new_nodes = re_realloc (dfa->nodes, re_token_t, new_nodes_alloc);
nodes            1398 maint/gnulib/lib/regex_internal.c       dfa->nodes = new_nodes;
nodes            1418 maint/gnulib/lib/regex_internal.c   dfa->nodes[dfa->nodes_len] = token;
nodes            1419 maint/gnulib/lib/regex_internal.c   dfa->nodes[dfa->nodes_len].constraint = 0;
nodes            1420 maint/gnulib/lib/regex_internal.c   dfa->nodes[dfa->nodes_len].accept_mb =
nodes            1430 maint/gnulib/lib/regex_internal.c calc_state_hash (const re_node_set *nodes, unsigned int context)
nodes            1432 maint/gnulib/lib/regex_internal.c   re_hashval_t hash = nodes->nelem + context;
nodes            1434 maint/gnulib/lib/regex_internal.c   for (i = 0 ; i < nodes->nelem ; i++)
nodes            1435 maint/gnulib/lib/regex_internal.c     hash += nodes->elems[i];
nodes            1451 maint/gnulib/lib/regex_internal.c 		  const re_node_set *nodes)
nodes            1461 maint/gnulib/lib/regex_internal.c   if (__glibc_unlikely (nodes->nelem == 0))
nodes            1466 maint/gnulib/lib/regex_internal.c   hash = calc_state_hash (nodes, 0);
nodes            1474 maint/gnulib/lib/regex_internal.c       if (re_node_set_compare (&state->nodes, nodes))
nodes            1479 maint/gnulib/lib/regex_internal.c   new_state = create_ci_newstate (dfa, nodes, hash);
nodes            1499 maint/gnulib/lib/regex_internal.c 			  const re_node_set *nodes, unsigned int context)
nodes            1509 maint/gnulib/lib/regex_internal.c   if (nodes->nelem == 0)
nodes            1514 maint/gnulib/lib/regex_internal.c   hash = calc_state_hash (nodes, context);
nodes            1522 maint/gnulib/lib/regex_internal.c 	  && re_node_set_compare (state->entrance_nodes, nodes))
nodes            1526 maint/gnulib/lib/regex_internal.c   new_state = create_cd_newstate (dfa, nodes, context, hash);
nodes            1547 maint/gnulib/lib/regex_internal.c   err = re_node_set_alloc (&newstate->non_eps_nodes, newstate->nodes.nelem);
nodes            1550 maint/gnulib/lib/regex_internal.c   for (i = 0; i < newstate->nodes.nelem; i++)
nodes            1552 maint/gnulib/lib/regex_internal.c       Idx elem = newstate->nodes.elems[i];
nodes            1553 maint/gnulib/lib/regex_internal.c       if (!IS_EPSILON_NODE (dfa->nodes[elem].type))
nodes            1578 maint/gnulib/lib/regex_internal.c   if (state->entrance_nodes != &state->nodes)
nodes            1583 maint/gnulib/lib/regex_internal.c   re_node_set_free (&state->nodes);
nodes            1594 maint/gnulib/lib/regex_internal.c create_ci_newstate (const re_dfa_t *dfa, const re_node_set *nodes,
nodes            1604 maint/gnulib/lib/regex_internal.c   err = re_node_set_init_copy (&newstate->nodes, nodes);
nodes            1611 maint/gnulib/lib/regex_internal.c   newstate->entrance_nodes = &newstate->nodes;
nodes            1612 maint/gnulib/lib/regex_internal.c   for (i = 0 ; i < nodes->nelem ; i++)
nodes            1614 maint/gnulib/lib/regex_internal.c       re_token_t *node = dfa->nodes + nodes->elems[i];
nodes            1642 maint/gnulib/lib/regex_internal.c create_cd_newstate (const re_dfa_t *dfa, const re_node_set *nodes,
nodes            1652 maint/gnulib/lib/regex_internal.c   err = re_node_set_init_copy (&newstate->nodes, nodes);
nodes            1660 maint/gnulib/lib/regex_internal.c   newstate->entrance_nodes = &newstate->nodes;
nodes            1662 maint/gnulib/lib/regex_internal.c   for (i = 0 ; i < nodes->nelem ; i++)
nodes            1664 maint/gnulib/lib/regex_internal.c       re_token_t *node = dfa->nodes + nodes->elems[i];
nodes            1680 maint/gnulib/lib/regex_internal.c 	  if (newstate->entrance_nodes == &newstate->nodes)
nodes            1689 maint/gnulib/lib/regex_internal.c 	      if (re_node_set_init_copy (newstate->entrance_nodes, nodes)
nodes            1701 maint/gnulib/lib/regex_internal.c 	      re_node_set_remove_at (&newstate->nodes, i - nctx_nodes);
nodes             516 maint/gnulib/lib/regex_internal.h   re_node_set nodes;
nodes             631 maint/gnulib/lib/regex_internal.h   re_token_t *nodes;
nodes             127 maint/gnulib/lib/regexec.c 					  const re_node_set *nodes);
nodes             134 maint/gnulib/lib/regexec.c static Idx find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
nodes             617 maint/gnulib/lib/regexec.c   if (dfa->init_state->nodes.nelem == 0
nodes             618 maint/gnulib/lib/regexec.c       && dfa->init_state_word->nodes.nelem == 0
nodes             619 maint/gnulib/lib/regexec.c       && (dfa->init_state_nl->nodes.nelem == 0
nodes            1060 maint/gnulib/lib/regexec.c 	  err = check_subexp_matching_top (mctx, &cur_state->nodes, 0);
nodes            1066 maint/gnulib/lib/regexec.c 	      err = transit_state_bkref (mctx, &cur_state->nodes);
nodes            1164 maint/gnulib/lib/regexec.c   re_token_type_t type = dfa->nodes[node].type;
nodes            1165 maint/gnulib/lib/regexec.c   unsigned int constraint = dfa->nodes[node].constraint;
nodes            1187 maint/gnulib/lib/regexec.c   for (i = 0; i < state->nodes.nelem; ++i)
nodes            1188 maint/gnulib/lib/regexec.c     if (check_halt_node_context (mctx->dfa, state->nodes.elems[i], context))
nodes            1189 maint/gnulib/lib/regexec.c       return state->nodes.elems[i];
nodes            1205 maint/gnulib/lib/regexec.c   if (IS_EPSILON_NODE (dfa->nodes[node].type))
nodes            1207 maint/gnulib/lib/regexec.c       re_node_set *cur_nodes = &mctx->state_log[*pidx]->nodes;
nodes            1249 maint/gnulib/lib/regexec.c       re_token_type_t type = dfa->nodes[node].type;
nodes            1251 maint/gnulib/lib/regexec.c       if (dfa->nodes[node].accept_mb)
nodes            1255 maint/gnulib/lib/regexec.c 	  Idx subexp_idx = dfa->nodes[node].opr.idx + 1;
nodes            1282 maint/gnulib/lib/regexec.c 	      if (re_node_set_contains (&mctx->state_log[*pidx]->nodes,
nodes            1289 maint/gnulib/lib/regexec.c 	  || check_node_accept (mctx, dfa->nodes + node, *pidx))
nodes            1294 maint/gnulib/lib/regexec.c 		     || !re_node_set_contains (&mctx->state_log[*pidx]->nodes,
nodes            1476 maint/gnulib/lib/regexec.c   int type = dfa->nodes[cur_node].type;
nodes            1479 maint/gnulib/lib/regexec.c       Idx reg_num = dfa->nodes[cur_node].opr.idx + 1;
nodes            1491 maint/gnulib/lib/regexec.c       Idx reg_num = dfa->nodes[cur_node].opr.idx + 1;
nodes            1503 maint/gnulib/lib/regexec.c 	      if (dfa->nodes[cur_node].opt_subexp
nodes            1541 maint/gnulib/lib/regexec.c   ((state) != NULL && re_node_set_contains (&(state)->nodes, node))
nodes            1619 maint/gnulib/lib/regexec.c       DEBUG_ASSERT (!IS_EPSILON_NODE (dfa->nodes[prev_node].type));
nodes            1622 maint/gnulib/lib/regexec.c       if (dfa->nodes[prev_node].accept_mb)
nodes            1629 maint/gnulib/lib/regexec.c 	  && check_node_accept (mctx, dfa->nodes + prev_node, str_idx)
nodes            1694 maint/gnulib/lib/regexec.c 	  err = re_node_set_init_union (&merged_set, &dst[st_idx]->nodes,
nodes            1695 maint/gnulib/lib/regexec.c 					&src[st_idx]->nodes);
nodes            1716 maint/gnulib/lib/regexec.c 		: &mctx->state_log[str_idx]->nodes);
nodes            1797 maint/gnulib/lib/regexec.c 	if (IS_EPSILON_NODE (dfa->nodes[cur_node].type))
nodes            1845 maint/gnulib/lib/regexec.c       subexp_idx = dfa->nodes[ent->node].opr.idx;
nodes            1879 maint/gnulib/lib/regexec.c       switch (dfa->nodes[node].type)
nodes            1930 maint/gnulib/lib/regexec.c 	  if ((boundaries & 1) && subexp_idx == dfa->nodes[node].opr.idx)
nodes            1935 maint/gnulib/lib/regexec.c 	  if ((boundaries & 2) && subexp_idx == dfa->nodes[node].opr.idx)
nodes            1993 maint/gnulib/lib/regexec.c       subexp_idx = dfa->nodes[ent->node].opr.idx;
nodes            2001 maint/gnulib/lib/regexec.c 	      re_token_type_t type = dfa->nodes[node].type;
nodes            2003 maint/gnulib/lib/regexec.c 		  && subexp_idx == dfa->nodes[node].opr.idx)
nodes            2006 maint/gnulib/lib/regexec.c 		       && subexp_idx == dfa->nodes[node].opr.idx)
nodes            2045 maint/gnulib/lib/regexec.c 	      re_token_type_t type = dfa->nodes[node].type;
nodes            2048 maint/gnulib/lib/regexec.c 		  if (subexp_idx != dfa->nodes[node].opr.idx)
nodes            2085 maint/gnulib/lib/regexec.c       type = dfa->nodes[node].type;
nodes            2303 maint/gnulib/lib/regexec.c       *err = check_subexp_matching_top (mctx, &next_state->nodes,
nodes            2311 maint/gnulib/lib/regexec.c 	  *err = transit_state_bkref (mctx, &next_state->nodes);
nodes            2370 maint/gnulib/lib/regexec.c       if (dfa->nodes[node].type == OP_OPEN_SUBEXP
nodes            2371 maint/gnulib/lib/regexec.c 	  && dfa->nodes[node].opr.idx < BITSET_WORD_BITS
nodes            2373 maint/gnulib/lib/regexec.c 	      & ((bitset_word_t) 1 << dfa->nodes[node].opr.idx)))
nodes            2397 maint/gnulib/lib/regexec.c   *err = re_node_set_alloc (&next_nodes, state->nodes.nelem + 1);
nodes            2400 maint/gnulib/lib/regexec.c   for (node_cnt = 0; node_cnt < state->nodes.nelem; ++node_cnt)
nodes            2402 maint/gnulib/lib/regexec.c       Idx cur_node = state->nodes.elems[node_cnt];
nodes            2403 maint/gnulib/lib/regexec.c       if (check_node_accept (mctx, dfa->nodes + cur_node, cur_str_idx))
nodes            2432 maint/gnulib/lib/regexec.c   for (i = 0; i < pstate->nodes.nelem; ++i)
nodes            2435 maint/gnulib/lib/regexec.c       Idx cur_node_idx = pstate->nodes.elems[i];
nodes            2441 maint/gnulib/lib/regexec.c       if (!dfa->nodes[cur_node_idx].accept_mb)
nodes            2444 maint/gnulib/lib/regexec.c       if (dfa->nodes[cur_node_idx].constraint)
nodes            2449 maint/gnulib/lib/regexec.c 	  if (NOT_SATISFY_NEXT_CONSTRAINT (dfa->nodes[cur_node_idx].constraint,
nodes            2494 maint/gnulib/lib/regexec.c transit_state_bkref (re_match_context_t *mctx, const re_node_set *nodes)
nodes            2501 maint/gnulib/lib/regexec.c   for (i = 0; i < nodes->nelem; ++i)
nodes            2504 maint/gnulib/lib/regexec.c       Idx node_idx = nodes->elems[i];
nodes            2506 maint/gnulib/lib/regexec.c       const re_token_t *node = dfa->nodes + node_idx;
nodes            2549 maint/gnulib/lib/regexec.c 			: mctx->state_log[cur_str_idx]->nodes.nelem);
nodes            2581 maint/gnulib/lib/regexec.c 	      && mctx->state_log[cur_str_idx]->nodes.nelem > prev_nelem)
nodes            2623 maint/gnulib/lib/regexec.c   subexp_num = dfa->nodes[bkref_node].opr.idx;
nodes            2633 maint/gnulib/lib/regexec.c       if (dfa->nodes[sub_top->node].opr.idx != subexp_num)
nodes            2691 maint/gnulib/lib/regexec.c 	  const re_node_set *nodes;
nodes            2716 maint/gnulib/lib/regexec.c 	  nodes = &mctx->state_log[sl_str]->nodes;
nodes            2717 maint/gnulib/lib/regexec.c 	  cls_node = find_subexp_node (dfa, nodes, subexp_num,
nodes            2787 maint/gnulib/lib/regexec.c find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
nodes            2791 maint/gnulib/lib/regexec.c   for (cls_idx = 0; cls_idx < nodes->nelem; ++cls_idx)
nodes            2793 maint/gnulib/lib/regexec.c       Idx cls_node = nodes->elems[cls_idx];
nodes            2794 maint/gnulib/lib/regexec.c       const re_token_t *node = dfa->nodes + cls_node;
nodes            2821 maint/gnulib/lib/regexec.c   subexp_num = dfa->nodes[top_node].opr.idx;
nodes            2870 maint/gnulib/lib/regexec.c 	  err = re_node_set_init_copy (&next_nodes, &cur_state->nodes);
nodes            2904 maint/gnulib/lib/regexec.c 				   &mctx->state_log[str_idx + 1]->nodes);
nodes            2951 maint/gnulib/lib/regexec.c 	       : &mctx->state_log[last_str]->nodes);
nodes            2988 maint/gnulib/lib/regexec.c       DEBUG_ASSERT (!IS_EPSILON_NODE (dfa->nodes[cur_node].type));
nodes            2991 maint/gnulib/lib/regexec.c       if (dfa->nodes[cur_node].accept_mb)
nodes            3004 maint/gnulib/lib/regexec.c 		  err = re_node_set_merge (&union_set, &dest_state->nodes);
nodes            3029 maint/gnulib/lib/regexec.c 	  || check_node_accept (mctx, dfa->nodes + cur_node, str_idx))
nodes            3109 maint/gnulib/lib/regexec.c       if (dfa->nodes[cur_node].type == type
nodes            3110 maint/gnulib/lib/regexec.c 	  && dfa->nodes[cur_node].opr.idx == ex_subexp)
nodes            3200 maint/gnulib/lib/regexec.c 	      if (re_node_set_contains (&mctx->state_log[to_idx]->nodes,
nodes            3204 maint/gnulib/lib/regexec.c 					   &mctx->state_log[to_idx]->nodes);
nodes            3431 maint/gnulib/lib/regexec.c   const re_node_set *cur_nodes = &state->nodes;
nodes            3438 maint/gnulib/lib/regexec.c       re_token_t *node = &dfa->nodes[cur_nodes->elems[i]];
nodes            3614 maint/gnulib/lib/regexec.c   const re_token_t *node = dfa->nodes + node_idx;
nodes             229 tools/crm_node.c             reply->data.nodes = g_list_sort(reply->data.nodes, sort_node);
nodes             230 tools/crm_node.c             for (GList *node_iter = reply->data.nodes;
nodes            1063 tools/crm_resource.c         dest = pe_find_node(data_set->nodes, options.host_uname);
nodes            1075 tools/crm_resource.c         rc = cli_resource_clear(options.rsc_id, NULL, data_set->nodes,
nodes            1290 tools/crm_resource.c         pe_node_t *node = pe_find_node(data_set->nodes, options.host_uname);
nodes            1790 tools/crm_resource.c         node = pe_find_node(data_set->nodes, options.host_uname);
nodes            1894 tools/crm_resource.c             node = pe_find_node(data_set->nodes, options.host_uname);
nodes            1935 tools/crm_resource.c             GList *nodes = cli_resource_search(rsc, options.rsc_id, data_set);
nodes            1936 tools/crm_resource.c             rc = out->message(out, "resource-search-list", nodes, options.rsc_id);
nodes            1937 tools/crm_resource.c             g_list_free_full(nodes, free);
nodes             523 tools/crm_resource_print.c     GList *nodes = va_arg(args, GList *);
nodes             529 tools/crm_resource_print.c     if (!out->is_quiet(out) && nodes == NULL) {
nodes             534 tools/crm_resource_print.c     for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) {
nodes             571 tools/crm_resource_print.c     GList *nodes = va_arg(args, GList *);
nodes             578 tools/crm_resource_print.c     for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) {
nodes             567 tools/crm_resource_runtime.c         pe_node_t *node = pe_find_node(data_set->nodes, host_uname);
nodes             783 tools/crm_resource_runtime.c         GList *nodes = g_hash_table_get_values(rsc->known_on);
nodes             785 tools/crm_resource_runtime.c         if(nodes == NULL && force) {
nodes             786 tools/crm_resource_runtime.c             nodes = pcmk__copy_node_list(data_set->nodes, false);
nodes             788 tools/crm_resource_runtime.c         } else if(nodes == NULL && rsc->exclusive_discover) {
nodes             795 tools/crm_resource_runtime.c                     nodes = g_list_prepend(nodes, node);
nodes             799 tools/crm_resource_runtime.c         } else if(nodes == NULL) {
nodes             800 tools/crm_resource_runtime.c             nodes = g_hash_table_get_values(rsc->allowed_nodes);
nodes             803 tools/crm_resource_runtime.c         for (lpc = nodes; lpc != NULL; lpc = lpc->next) {
nodes             812 tools/crm_resource_runtime.c                 g_list_free(nodes);
nodes             817 tools/crm_resource_runtime.c         g_list_free(nodes);
nodes             821 tools/crm_resource_runtime.c     node = pe_find_node(data_set->nodes, host_uname);
nodes             881 tools/crm_resource_runtime.c         pe_node_t *node = pe_find_node(data_set->nodes, node_name);
nodes             909 tools/crm_resource_runtime.c         for (GList *iter = data_set->nodes; iter; iter = iter->next) {
nodes            2019 tools/crm_resource_runtime.c             GList *nodes = cli_resource_search(rsc, requested_name, data_set);
nodes            2020 tools/crm_resource_runtime.c             if(nodes != NULL && force == FALSE) {
nodes            2028 tools/crm_resource_runtime.c             g_list_free_full(nodes, free);
nodes            2075 tools/crm_resource_runtime.c     pe_node_t *dest = pe_find_node(data_set->nodes, host_name);
nodes            2140 tools/crm_resource_runtime.c     cli_resource_clear(rsc_id, NULL, data_set->nodes, cib, cib_options, false, force);
nodes            2143 tools/crm_resource_runtime.c     cli_resource_clear(rsc_id, dest->details->uname, data_set->nodes, cib,