next 415 daemons/attrd/attrd_sync.c for (GList *node = keys; node != NULL; node = node->next) { next 522 daemons/based/based_messages.c for (GList *iter = schemas; iter != NULL; iter = iter->next) { next 490 daemons/controld/controld_cib.c for (GList *iter = metadata->ra_params; iter != NULL; iter = iter->next) { next 213 daemons/controld/controld_control.c iter = iter->next) { next 95 daemons/controld/controld_execd.c for (iter = history->recurring_op_list; iter != NULL; iter = iter->next) { next 121 daemons/controld/controld_execd.c for (iter = history->recurring_op_list; iter != NULL; iter = iter->next) { next 563 daemons/controld/controld_execd.c for (gIter = entry->recurring_op_list; gIter != NULL; gIter = gIter->next) { next 1776 daemons/controld/controld_execd.c for (state_entry = lrm_state_list; state_entry != NULL; state_entry = state_entry->next) { next 333 daemons/controld/controld_fencing.c iter = iter->next; next 352 daemons/controld/controld_fencing.c for (iter = stonith_cleanup_list; iter != NULL; iter = iter->next) { next 372 daemons/controld/controld_fencing.c for (iter = stonith_cleanup_list; iter != NULL; iter = iter->next) { next 409 daemons/controld/controld_fencing.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 417 daemons/controld/controld_fencing.c for (lpc2 = synapse->actions; lpc2 != NULL; lpc2 = lpc2->next) { next 179 daemons/controld/controld_messages.c iter = iter->next) { next 211 daemons/controld/controld_metadata.c for (GList *iter = md->ra_params; iter != NULL; iter = iter->next) { next 501 daemons/controld/controld_remote_ra.c for (tmp = cmd->params; tmp; tmp = tmp->next) { next 872 daemons/controld/controld_remote_ra.c for (tmp = cmd->params; tmp; tmp = tmp->next) { next 1091 daemons/controld/controld_remote_ra.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 1100 daemons/controld/controld_remote_ra.c for (gIter = rm_list; gIter != NULL; gIter = gIter->next) { next 1124 daemons/controld/controld_remote_ra.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 1194 daemons/controld/controld_remote_ra.c for (gIter = ra_data->recurring_cmds; gIter != NULL; gIter = gIter->next) { next 1203 daemons/controld/controld_remote_ra.c for (gIter = ra_data->cmds; gIter != NULL; gIter = gIter->next) { next 77 daemons/controld/controld_te_callbacks.c && (xml->children != NULL) && (xml->children->next != NULL)) { next 98 daemons/controld/controld_te_events.c for (; gIter != NULL; gIter = gIter->next) { next 107 daemons/controld/controld_te_events.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 296 daemons/controld/controld_te_events.c item != NULL; item = item->next) { next 299 daemons/controld/controld_te_events.c for (GList *item2 = synapse->actions; item2; item2 = item2->next) { next 317 daemons/controld/controld_te_events.c for (; gIter != NULL; gIter = gIter->next) { next 321 daemons/controld/controld_te_events.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 393 daemons/controld/controld_te_events.c gIter = gIter->next) { next 397 daemons/controld/controld_te_events.c gIter2 = gIter2->next) { next 349 daemons/execd/cts-exec-helper.c for (iter = list; iter != NULL; iter = iter->next) { next 366 daemons/execd/cts-exec-helper.c for (iter = list; iter != NULL; iter = iter->next) { next 384 daemons/execd/cts-exec-helper.c for (iter = list; iter != NULL; iter = iter->next) { next 400 daemons/execd/cts-exec-helper.c for (op_item = op_list; op_item != NULL; op_item = op_item->next) { next 445 daemons/execd/execd_commands.c for (const GList *item = action_list; item != NULL; item = item->next) { next 1163 daemons/execd/execd_commands.c for (GList *op = rsc->recurring_ops; op != NULL; op = op->next) { next 1465 daemons/execd/execd_commands.c GList *next = gIter->next; next 1472 daemons/execd/execd_commands.c gIter = next; next 1479 daemons/execd/execd_commands.c GList *next = gIter->next; next 1501 daemons/execd/execd_commands.c gIter = next; next 1715 daemons/execd/execd_commands.c for (gIter = rsc->pending_ops; gIter != NULL; gIter = gIter->next) { next 1728 daemons/execd/execd_commands.c for (gIter = rsc->recurring_ops; gIter != NULL; gIter = gIter->next) { next 1774 daemons/execd/execd_commands.c for (cmd_iter = cmd_list; cmd_iter; cmd_iter = cmd_iter->next) { next 1816 daemons/execd/execd_commands.c for (GList *item = rsc->recurring_ops; item != NULL; item = item->next) { next 460 daemons/execd/remoted_proxy.c for (gIter = remove_these; gIter != NULL; gIter = gIter->next) { next 106 daemons/execd/remoted_schemas.c for (xmlNode *child = xml->children; child != NULL; child = child->next) { next 476 daemons/fenced/fenced_commands.c gIterNext = gIter->next; next 580 daemons/fenced/fenced_commands.c gIterNext = gIter->next; next 773 daemons/fenced/fenced_commands.c for (gIter = device->pending_ops; gIter != NULL; gIter = gIter->next) { next 1855 daemons/fenced/fenced_commands.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 1864 daemons/fenced/fenced_commands.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 2406 daemons/fenced/fenced_commands.c for (lpc = devices; lpc != NULL; lpc = lpc->next) { next 2510 daemons/fenced/fenced_commands.c int pid, const char *next, bool op_merged) next 2526 daemons/fenced/fenced_commands.c next = NULL; next 2560 daemons/fenced/fenced_commands.c if (next != NULL) { next 2561 daemons/fenced/fenced_commands.c pcmk__g_strcat(msg, ", retrying with ", next, NULL); next 2672 daemons/fenced/fenced_commands.c GList *next = NULL; next 2674 daemons/fenced/fenced_commands.c for (GList *iter = cmd_list; iter != NULL; iter = next) { next 2677 daemons/fenced/fenced_commands.c next = iter->next; // We might delete this entry, so grab next now next 2725 daemons/fenced/fenced_commands.c for (GList *iter = cmd->next_device_iter; iter != NULL; iter = iter->next) { next 2733 daemons/fenced/fenced_commands.c cmd->next_device_iter = iter->next; next 2776 daemons/fenced/fenced_commands.c cmd->next_device_iter = cmd->next_device_iter->next; next 2823 daemons/fenced/fenced_commands.c cmd->next_device_iter = devices->next; next 3067 daemons/fenced/fenced_commands.c for (dup_iter = list_op->duplicates; dup_iter != NULL; dup_iter = dup_iter->next) { next 347 daemons/fenced/fenced_remote.c for (iter = op->automatic_list; iter != NULL; iter = iter->next) { next 499 daemons/fenced/fenced_remote.c for (GList *iter = op->duplicates; iter != NULL; iter = iter->next) { next 852 daemons/fenced/fenced_remote.c for (lpc = devices; lpc != NULL; lpc = lpc->next) { next 1412 daemons/fenced/fenced_remote.c for (iter = op->query_results; iter != NULL; iter = iter->next) { next 1647 daemons/fenced/fenced_remote.c for (device_list = tp->levels[i]; device_list; device_list = device_list->next) { next 1650 daemons/fenced/fenced_remote.c for (iter = op->query_results; iter != NULL; iter = iter->next) { next 1682 daemons/fenced/fenced_remote.c for (iter = auto_list; iter != NULL; iter = iter->next) { next 1685 daemons/fenced/fenced_remote.c for (iter2 = op->query_results; iter2 != NULL; iter2 = iter2->next) { next 1766 daemons/fenced/fenced_remote.c for (iter = op->duplicates; iter != NULL; iter = iter->next) { next 1789 daemons/fenced/fenced_remote.c op->devices = op->devices->next; next 2146 daemons/fenced/fenced_remote.c for (device = tp->levels[i]; device; device = device->next) { next 2148 daemons/fenced/fenced_remote.c for (iter = op->query_results; iter && !match; iter = iter->next) { next 157 daemons/fenced/fenced_scheduler.c iter != NULL; iter = iter->next) { next 287 include/crm/common/internal.h return list && (list->next == NULL); next 294 include/crm/common/internal.h return list && (list->next != NULL); next 297 include/crm/common/xml_internal.h child = child->next; next 313 include/crm/common/xml_internal.h xmlNode *next = (child? child->next : NULL); next 315 include/crm/common/xml_internal.h while (next && (next->type == XML_TEXT_NODE)) { next 316 include/crm/common/xml_internal.h next = next->next; next 318 include/crm/common/xml_internal.h return next; next 33 include/crm/lrmd.h struct lrmd_key_value_s *next; next 174 include/crm/lrmd.h struct lrmd_list_s *next; next 165 include/crm/stonith-ng.h struct stonith_key_value_s *next; next 181 include/crm/stonith-ng.h struct stonith_history_s *next; next 96 lib/cib/cib_client.c iter = iter->next) { next 229 lib/common/acl.c for (aIter = docpriv->acls; aIter != NULL; aIter = aIter->next) { next 438 lib/common/acl.c xIter = xIter->next; next 496 lib/common/acl.c for(aIter = docpriv->acls; aIter != NULL && target; aIter = aIter->next) { next 576 lib/common/acl.c for (xmlAttr *prop = xml->properties; prop != NULL; prop = prop->next) { next 457 lib/common/ipc_attrd.c for (GList *iter = attrs; iter != NULL; iter = iter->next) { next 18 lib/common/lists.c for (const GList *item = items; item != NULL; item = item->next) { next 668 lib/common/logging.c const char *next = trace_tags; next 671 lib/common/logging.c offset = next; next 672 lib/common/logging.c next = strchrnul(offset, ','); next 673 lib/common/logging.c snprintf(token, sizeof(token), "%.*s", (int)(next - offset), offset); next 678 lib/common/logging.c if (next[0] != 0) { next 679 lib/common/logging.c next++; next 682 lib/common/logging.c } while (next != NULL && next[0] != 0); next 1136 lib/common/logging.c const char *next = NULL; next 1150 lib/common/logging.c next = output; next 1152 lib/common/logging.c offset = next; next 1153 lib/common/logging.c next = strchrnul(offset, '\n'); next 1155 lib/common/logging.c (int)(next - offset), offset); next 1156 lib/common/logging.c if (next[0] != 0) { next 1157 lib/common/logging.c next++; next 1160 lib/common/logging.c } while (next != NULL && next[0] != 0); next 1178 lib/common/mainloop.c iter = iter->next; next 1211 lib/common/mainloop.c for (iter = child_list; iter != NULL && match == NULL; iter = iter->next) { next 177 lib/common/nodes.c item = item->next) { next 201 lib/common/nodes.c for (const GList *iter = nodes; iter != NULL; iter = iter->next) { next 357 lib/common/nvpair.c pIter = pIter->next) { next 692 lib/common/nvpair.c iter = iter->next) { next 182 lib/common/options_display.c for (const GSList *iter = advanced; iter != NULL; iter = iter->next) { next 199 lib/common/options_display.c for (const GSList *iter = deprecated; iter != NULL; iter = iter->next) { next 178 lib/common/output_html.c for (GSList *iter = extra_headers; iter != NULL; iter = iter->next) { next 210 lib/common/output_log.c for (GList* gIter = priv->prefixes->head; gIter; gIter = gIter->next) { next 209 lib/common/output_xml.c node = node->next; next 70 lib/common/patchset.c pIter = pIter->next) { next 113 lib/common/patchset.c pIter = pIter->next) { next 166 lib/common/patchset.c for (gIter = docpriv->deleted_objs; gIter; gIter = gIter->next) { next 228 lib/common/patchset.c for (gIter = docpriv->deleted_objs; gIter; gIter = gIter->next) { next 658 lib/common/patchset.c pIter = pIter->next) { next 674 lib/common/patchset.c for (gIter = change_objs; gIter; gIter = gIter->next) { next 697 lib/common/patchset.c match_child = match_child->next; next 728 lib/common/patchset.c match_child = match_child->next; next 395 lib/common/scheduler.c item != NULL; item = item->next) { next 143 lib/common/schemas.c x_0_entry = iter->next; next 576 lib/common/schemas.c for (GList *iter = known_schemas; iter != NULL; iter = iter->next) { next 737 lib/common/schemas.c for (GList *iter = known_schemas; iter != NULL; iter = iter->next) { next 1075 lib/common/schemas.c for (GList *iter = schema->transforms; iter != NULL; iter = iter->next) { next 1181 lib/common/schemas.c for (; entry != NULL; entry = entry->next) { next 1209 lib/common/schemas.c || validate_with_silent(*xml, entry->next->data)) { next 1505 lib/common/schemas.c for (GList *iter = includes; iter != NULL; iter = iter->next) { next 986 lib/common/strings.c for (const GList *ele = lst; ele != NULL; ele = ele->next) { next 78 lib/common/tests/messages/pcmk__new_message_as_test.c assert_null(message->children->next); next 82 lib/common/tests/messages/pcmk__new_message_as_test.c assert_null(message->children->children->next); next 64 lib/common/tests/xml_element/pcmk__xe_next_test.c xmlNode *next = NULL; next 72 lib/common/tests/xml_element/pcmk__xe_next_test.c next = pcmk__xe_next(child, NULL); next 73 lib/common/tests/xml_element/pcmk__xe_next_test.c assert_non_null(next); next 74 lib/common/tests/xml_element/pcmk__xe_next_test.c assert_string_equal(pcmk__xe_id(next), "child2"); next 76 lib/common/tests/xml_element/pcmk__xe_next_test.c next = pcmk__xe_next(child, "bar"); next 77 lib/common/tests/xml_element/pcmk__xe_next_test.c assert_non_null(next); next 78 lib/common/tests/xml_element/pcmk__xe_next_test.c assert_string_equal(pcmk__xe_id(next), "child2"); next 80 lib/common/tests/xml_element/pcmk__xe_next_test.c next = pcmk__xe_next(child, "foo"); next 81 lib/common/tests/xml_element/pcmk__xe_next_test.c assert_non_null(next); next 82 lib/common/tests/xml_element/pcmk__xe_next_test.c assert_string_equal(pcmk__xe_id(next), "child3"); next 84 lib/common/tests/xml_element/pcmk__xe_next_test.c next = pcmk__xe_next(child, "foobar"); next 85 lib/common/tests/xml_element/pcmk__xe_next_test.c assert_null(next); next 41 lib/common/tests/xml_element/pcmk__xe_sort_attrs_test.c attr = attr->next) { next 57 lib/common/tests/xml_element/pcmk__xe_sort_attrs_test.c test_attr = test_attr->next, ref_attr = ref_attr->next) { next 66 lib/common/tests/xml_idref/pcmk__xe_dereference_children_test.c list = list->next; next 318 lib/common/xml.c iter = iter->next) { next 370 lib/common/xml.c iter = iter->next) { next 875 lib/common/xml.c xmlNode *next = iter->next; next 892 lib/common/xml.c iter = next; next 1203 lib/common/xml.c attr_iter = attr_iter->next; next 1256 lib/common/xml.c attr_iter = attr_iter->next; next 1289 lib/common/xml.c attr = attr->next) { next 1595 lib/common/xml.c *next = pcmk__xml_next(new_child); next 1597 lib/common/xml.c new_child = next, next = pcmk__xml_next(new_child)) { next 108 lib/common/xml_display.c attr = attr->next) { next 293 lib/common/xml_display.c attr = attr->next) { next 376 lib/common/xml_display.c iter = iter->next) { next 56 lib/common/xml_element.c child = child->next; next 106 lib/common/xml_element.c for (xmlNode *next = (xml == NULL)? NULL : xml->next; next 107 lib/common/xml_element.c next != NULL; next = next->next) { next 108 lib/common/xml_element.c if ((next->type == XML_ELEMENT_NODE) next 109 lib/common/xml_element.c && ((element_name == NULL) || pcmk__xe_is(next, element_name))) { next 110 lib/common/xml_element.c return next; next 255 lib/common/xml_element.c attr = attr->next) { next 315 lib/common/xml_element.c iter = iter->next) { next 320 lib/common/xml_element.c for (GSList *iter = attr_list; iter != NULL; iter = iter->next) { next 383 lib/common/xml_element.c xmlAttrPtr next = NULL; next 385 lib/common/xml_element.c for (xmlAttrPtr a = pcmk__xe_first_attr(element); a != NULL; a = next) { next 386 lib/common/xml_element.c next = a->next; // Grab now because attribute might get removed next 679 lib/common/xml_element.c attr = attr->next) { next 987 lib/common/xml_element.c for (xmlNode *node = children; node != NULL; node = node->next) { next 44 lib/common/xml_idref.c for (GList *iter = idref->refs; iter != NULL; iter = iter->next) { next 228 lib/common/xml_io.c attr = attr->next) { next 248 lib/common/xml_io.c child = child->next) { next 266 lib/fencing/st_client.c GList *next = g_list_next(list_item); next 273 lib/fencing/st_client.c list_item = next; next 331 lib/fencing/st_client.c for (; params; params = params->next) { next 451 lib/fencing/st_client.c for (; device_list; device_list = device_list->next) { next 756 lib/fencing/st_client.c last->next = kvp; next 783 lib/fencing/st_client.c stonith_history_t *next = head->next; next 792 lib/fencing/st_client.c head = next; next 1845 lib/fencing/st_client.c for (; params; params = params->next) { next 2011 lib/fencing/st_client.c for (; end->next != NULL; end = end->next); next 2012 lib/fencing/st_client.c end->next = pair; next 2036 lib/fencing/st_client.c stonith_key_value_t *next = head->next; next 2045 lib/fencing/st_client.c head = next; next 2125 lib/fencing/st_client.c for (hp = history; hp; hp = hp->next) { next 2189 lib/fencing/st_client.c iter = iter->next) { next 2353 lib/fencing/st_client.c prev_hp != NULL; prev_hp = prev_hp->next) { next 2392 lib/fencing/st_client.c tmp = hp->next; next 2397 lib/fencing/st_client.c hp->next = new; next 2402 lib/fencing/st_client.c if ((!np->next) || (hp->completed > np->next->completed) || next 2403 lib/fencing/st_client.c ((hp->completed == np->next->completed) && (hp->completed_nsec > np->next->completed_nsec))) { next 2404 lib/fencing/st_client.c hp->next = np->next; next 2405 lib/fencing/st_client.c np->next = hp; next 2408 lib/fencing/st_client.c np = np->next; next 2413 lib/fencing/st_client.c hp->next = pending; next 2423 lib/fencing/st_client.c while (last_pending->next) { next 2424 lib/fencing/st_client.c last_pending = last_pending->next; next 2427 lib/fencing/st_client.c last_pending->next = new; next 2466 lib/fencing/st_client.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 201 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 234 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 267 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 298 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 391 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 165 lib/lrmd/lrmd_alerts.c for (head = params; head != NULL; head = head->next) { next 117 lib/lrmd/lrmd_client.c while (end && end->next) { next 118 lib/lrmd/lrmd_client.c end = end->next; next 122 lib/lrmd/lrmd_client.c end->next = p; next 138 lib/lrmd/lrmd_client.c p = head->next; next 155 lib/lrmd/lrmd_client.c while (end && end->next) { next 156 lib/lrmd/lrmd_client.c end = end->next; next 160 lib/lrmd/lrmd_client.c end->next = p; next 174 lib/lrmd/lrmd_client.c p = head->next; next 1197 lib/lrmd/lrmd_client.c int next = fgetc(stream); next 1199 lib/lrmd/lrmd_client.c if (next == EOF) { next 1211 lib/lrmd/lrmd_client.c key->data[key->size++] = (unsigned char) next; next 2111 lib/lrmd/lrmd_client.c for (const lrmd_key_value_t *param = params; param; param = param->next) { next 2168 lib/lrmd/lrmd_client.c for (tmp = params; tmp; tmp = tmp->next) { next 2194 lib/lrmd/lrmd_client.c for (tmp = params; tmp; tmp = tmp->next) { next 2238 lib/lrmd/lrmd_client.c for (dIter = stonith_resources; dIter; dIter = dIter->next) { next 2263 lib/lrmd/lrmd_client.c for (gIter = agents; gIter != NULL; gIter = gIter->next) { next 2296 lib/lrmd/lrmd_client.c for (gIter2 = agents; gIter2 != NULL; gIter2 = gIter2->next) { next 2315 lib/lrmd/lrmd_client.c for (gIter = ocf_providers; gIter != NULL; gIter = gIter->next) { next 2337 lib/lrmd/lrmd_client.c for (gIter = standards; gIter != NULL; gIter = gIter->next) { next 23 lib/lrmd/lrmd_output.c for (iter = list; iter != NULL; iter = iter->next) { next 36 lib/lrmd/lrmd_output.c for (iter = list; iter != NULL; iter = iter->next) { next 126 lib/pacemaker/pcmk_acl.c for (i_node = xml_modify; i_node != NULL; i_node = i_node->next) { next 70 lib/pacemaker/pcmk_fence.c for (GList *iter = devices; iter != NULL; iter = iter->next) { next 95 lib/pacemaker/pcmk_fence.c hp = new->next; next 96 lib/pacemaker/pcmk_fence.c new->next = NULL; next 99 lib/pacemaker/pcmk_fence.c stonith_history_t *hp_next = hp->next; next 101 lib/pacemaker/pcmk_fence.c hp->next = NULL; next 103 lib/pacemaker/pcmk_fence.c for (np = new; ; np = np->next) { next 118 lib/pacemaker/pcmk_fence.c if (!np->next) { next 119 lib/pacemaker/pcmk_fence.c np->next = hp; next 297 lib/pacemaker/pcmk_fence.c for (stonith_history_t *hp = history; hp != NULL; hp = hp->next) { next 367 lib/pacemaker/pcmk_fence.c for (stonith_key_value_t *iter = devices; iter != NULL; iter = iter->next) { next 450 lib/pacemaker/pcmk_fence.c targets = targets->next; next 530 lib/pacemaker/pcmk_fence.c for (stonith_key_value_t *iter = devices; iter != NULL; iter = iter->next) { next 114 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 145 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 178 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 237 lib/pacemaker/pcmk_graph_consumer.c for (lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 259 lib/pacemaker/pcmk_graph_consumer.c for (lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 340 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 435 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 450 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 71 lib/pacemaker/pcmk_graph_logging.c synapse_iter != NULL; synapse_iter = synapse_iter->next) { next 76 lib/pacemaker/pcmk_graph_logging.c action_iter != NULL; action_iter = action_iter->next) { next 124 lib/pacemaker/pcmk_graph_logging.c for (const GList *lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 146 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 192 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 228 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 88 lib/pacemaker/pcmk_graph_producer.c iter != NULL; iter = iter->next) { next 180 lib/pacemaker/pcmk_graph_producer.c for (iter = action->actions_before; iter != NULL; iter = iter->next) { next 817 lib/pacemaker/pcmk_graph_producer.c iter != NULL; iter = iter->next) { next 921 lib/pacemaker/pcmk_graph_producer.c for (GList *lpc = action->actions_before; lpc != NULL; lpc = lpc->next) { next 992 lib/pacemaker/pcmk_graph_producer.c for (iter = rsc->priv->children; iter != NULL; iter = iter->next) { next 1064 lib/pacemaker/pcmk_graph_producer.c for (iter = scheduler->priv->resources; iter != NULL; iter = iter->next) { next 1075 lib/pacemaker/pcmk_graph_producer.c for (iter = scheduler->priv->actions; iter != NULL; iter = iter->next) { next 678 lib/pacemaker/pcmk_injections.c for (iter = injections->node_up; iter != NULL; iter = iter->next) { next 691 lib/pacemaker/pcmk_injections.c for (iter = injections->node_down; iter != NULL; iter = iter->next) { next 719 lib/pacemaker/pcmk_injections.c for (iter = injections->node_fail; iter != NULL; iter = iter->next) { next 733 lib/pacemaker/pcmk_injections.c for (iter = injections->ticket_grant; iter != NULL; iter = iter->next) { next 742 lib/pacemaker/pcmk_injections.c for (iter = injections->ticket_revoke; iter != NULL; iter = iter->next) { next 752 lib/pacemaker/pcmk_injections.c for (iter = injections->ticket_standby; iter != NULL; iter = iter->next) { next 761 lib/pacemaker/pcmk_injections.c for (iter = injections->ticket_activate; iter != NULL; iter = iter->next) { next 770 lib/pacemaker/pcmk_injections.c for (iter = injections->op_inject; iter != NULL; iter = iter->next) { next 75 lib/pacemaker/pcmk_output.c lpc != NULL; lpc = lpc->next) { next 80 lib/pacemaker/pcmk_output.c for (lpc2 = cons->nodes; lpc2 != NULL; lpc2 = lpc2->next) { next 395 lib/pacemaker/pcmk_output.c lpc != NULL; lpc = lpc->next) { next 446 lib/pacemaker/pcmk_output.c lpc != NULL; lpc = lpc->next) { next 484 lib/pacemaker/pcmk_output.c lpc != NULL; lpc = lpc->next) { next 535 lib/pacemaker/pcmk_output.c lpc != NULL; lpc = lpc->next) { next 564 lib/pacemaker/pcmk_output.c lpc != NULL; lpc = lpc->next) { next 569 lib/pacemaker/pcmk_output.c for (lpc2 = cons->nodes; lpc2 != NULL; lpc2 = lpc2->next) { next 1101 lib/pacemaker/pcmk_output.c pcmk_node_t *next = va_arg(args, pcmk_node_t *); next 1116 lib/pacemaker/pcmk_output.c || (current == NULL && next == NULL)) { next 1125 lib/pacemaker/pcmk_output.c moving = (current != NULL) && (next != NULL) next 1126 lib/pacemaker/pcmk_output.c && !pcmk__same_node(current, next); next 1128 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, PCMK_ACTION_START, next 1159 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, PCMK_ACTION_PROMOTE, next 1166 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, PCMK_ACTION_DEMOTE, next 1176 lib/pacemaker/pcmk_output.c CRM_CHECK(next != NULL, return rc); next 1178 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, next 1188 lib/pacemaker/pcmk_output.c next, start, NULL); next 1192 lib/pacemaker/pcmk_output.c next, start, NULL); next 1200 lib/pacemaker/pcmk_output.c current, next, promote, demote); next 1204 lib/pacemaker/pcmk_output.c pcmk__node_name(next)); next 1221 lib/pacemaker/pcmk_output.c (failed? "Recover" : "Move"), rsc, current, next, next 1231 lib/pacemaker/pcmk_output.c next, start, NULL); next 1251 lib/pacemaker/pcmk_output.c iter != NULL; iter = iter->next) { next 1286 lib/pacemaker/pcmk_output.c next, stop, start); next 1290 lib/pacemaker/pcmk_output.c rc = out->message(out, "rsc-action-item", "Move", rsc, current, next, next 1295 lib/pacemaker/pcmk_output.c rc = out->message(out, "rsc-action-item", "Reload", rsc, current, next, next 1301 lib/pacemaker/pcmk_output.c next, start, NULL); next 1307 lib/pacemaker/pcmk_output.c next, demote, NULL); next 1310 lib/pacemaker/pcmk_output.c CRM_LOG_ASSERT(next); next 1312 lib/pacemaker/pcmk_output.c next, promote, NULL); next 1316 lib/pacemaker/pcmk_output.c rc = out->message(out, "rsc-action-item", "Start", rsc, current, next, next 548 lib/pacemaker/pcmk_sched_actions.c for (lpc = then->actions_before; lpc != NULL; lpc = lpc->next) { next 657 lib/pacemaker/pcmk_sched_actions.c lpc2 = lpc2->next) { next 682 lib/pacemaker/pcmk_sched_actions.c for (lpc = then->actions_after; lpc != NULL; lpc = lpc->next) { next 1041 lib/pacemaker/pcmk_sched_actions.c for (iter = action->actions_before; iter != NULL; iter = iter->next) { next 1046 lib/pacemaker/pcmk_sched_actions.c for (iter = action->actions_after; iter != NULL; iter = iter->next) { next 1374 lib/pacemaker/pcmk_sched_actions.c GList *next = NULL; next 1379 lib/pacemaker/pcmk_sched_actions.c for (item = action->actions_before; item != NULL; item = next) { next 1382 lib/pacemaker/pcmk_sched_actions.c next = item->next; next 1421 lib/pacemaker/pcmk_sched_actions.c iter != NULL; iter = iter->next) { next 1467 lib/pacemaker/pcmk_sched_actions.c iter != NULL; iter = iter->next) { next 1821 lib/pacemaker/pcmk_sched_actions.c for (GList *iter = sorted_op_list; iter != NULL; iter = iter->next) { next 1899 lib/pacemaker/pcmk_sched_actions.c for (GList *iter = result; iter != NULL; iter = iter->next) { next 1938 lib/pacemaker/pcmk_sched_actions.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { next 446 lib/pacemaker/pcmk_sched_bundle.c for (const GList *iter = scratch; iter != NULL; iter = iter->next) { next 62 lib/pacemaker/pcmk_sched_clone.c for (GList *iter = colocations; iter != NULL; iter = iter->next) { next 159 lib/pacemaker/pcmk_sched_clone.c iter != NULL; iter = iter->next) { next 183 lib/pacemaker/pcmk_sched_clone.c for (GList *later = iter->next; next 184 lib/pacemaker/pcmk_sched_clone.c later != NULL; later = later->next) { next 335 lib/pacemaker/pcmk_sched_clone.c iter != NULL; iter = iter->next) { next 357 lib/pacemaker/pcmk_sched_clone.c for (iter = primary->priv->children; iter != NULL; iter = iter->next) { next 438 lib/pacemaker/pcmk_sched_clone.c iter != NULL; iter = iter->next) { next 470 lib/pacemaker/pcmk_sched_clone.c iter != NULL; iter = iter->next) { next 496 lib/pacemaker/pcmk_sched_clone.c child_iter != NULL; child_iter = child_iter->next) { next 535 lib/pacemaker/pcmk_sched_clone.c iter != NULL; iter = iter->next) { next 561 lib/pacemaker/pcmk_sched_clone.c (iter != NULL) && (child == NULL); iter = iter->next) { next 708 lib/pacemaker/pcmk_sched_clone.c iter != NULL; iter = iter->next) { next 716 lib/pacemaker/pcmk_sched_clone.c member_iter != NULL; member_iter = member_iter->next) { next 250 lib/pacemaker/pcmk_sched_colocation.c for (const GList *iter = addition; iter != NULL; iter = iter->next) { next 310 lib/pacemaker/pcmk_sched_colocation.c for (const GList *iter = addition; iter != NULL; iter = iter->next) { next 1108 lib/pacemaker/pcmk_sched_colocation.c for (iter = rsc->priv->actions; iter != NULL; iter = iter->next) { next 1122 lib/pacemaker/pcmk_sched_colocation.c for (iter = rsc->priv->children; iter != NULL; iter = iter->next) { next 1168 lib/pacemaker/pcmk_sched_colocation.c for (iter = rsc->priv->children; iter != NULL; iter = iter->next) { next 1188 lib/pacemaker/pcmk_sched_colocation.c for (iter = colocations; iter != NULL; iter = iter->next) { next 1566 lib/pacemaker/pcmk_sched_colocation.c loc_iter != NULL; loc_iter = loc_iter->next) { next 1860 lib/pacemaker/pcmk_sched_colocation.c for (GList *iter = colocations; iter != NULL; iter = iter->next) { next 83 lib/pacemaker/pcmk_sched_constraints.c for (GList *iter = rsc_list; iter != NULL; iter = iter->next) { next 294 lib/pacemaker/pcmk_sched_constraints.c for (iter = tag->refs; iter != NULL; iter = iter->next) { next 324 lib/pacemaker/pcmk_sched_constraints.c for (iter = tag_refs; iter != NULL; iter = iter->next) { next 389 lib/pacemaker/pcmk_sched_constraints.c for (GList *iter = tag->refs; iter != NULL; iter = iter->next) { next 436 lib/pacemaker/pcmk_sched_constraints.c iter != NULL; iter = iter->next) { next 64 lib/pacemaker/pcmk_sched_fencing.c for (GList *iter = rsc->priv->actions; iter != NULL; iter = iter->next) { next 144 lib/pacemaker/pcmk_sched_fencing.c for (iter = action_list; iter != NULL; iter = iter->next) { next 216 lib/pacemaker/pcmk_sched_fencing.c for (iter = action_list; iter != NULL; iter = iter->next) { next 264 lib/pacemaker/pcmk_sched_fencing.c iter != NULL; iter = iter->next) { next 297 lib/pacemaker/pcmk_sched_fencing.c for (GList *r = scheduler->priv->resources; r != NULL; r = r->next) { next 73 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 131 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 396 lib/pacemaker/pcmk_sched_group.c iter = iter->next) { next 491 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 561 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 656 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 704 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 753 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 816 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 866 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 883 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 895 lib/pacemaker/pcmk_sched_group.c cons_iter != NULL; cons_iter = cons_iter->next) { next 1015 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 1045 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 99 lib/pacemaker/pcmk_sched_instances.c child_iter != NULL; child_iter = child_iter->next) { next 153 lib/pacemaker/pcmk_sched_instances.c for (const GList *iter = colocations; iter != NULL; iter = iter->next) { next 165 lib/pacemaker/pcmk_sched_instances.c for (const GList *iter = colocations; iter != NULL; iter = iter->next) { next 258 lib/pacemaker/pcmk_sched_instances.c iter != NULL; iter = iter->next) { next 818 lib/pacemaker/pcmk_sched_instances.c iter = iter->next) { next 837 lib/pacemaker/pcmk_sched_instances.c for (iter = instances; iter != NULL; iter = iter->next) { next 915 lib/pacemaker/pcmk_sched_instances.c iter = iter->next) { next 932 lib/pacemaker/pcmk_sched_instances.c iter = iter->next) { next 999 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = instances; iter != NULL; iter = iter->next) { next 1157 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = instances; iter != NULL; iter = iter->next) { next 1216 lib/pacemaker/pcmk_sched_instances.c iter = iter->next) { next 1415 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = instances; iter != NULL; iter = iter->next) { next 1565 lib/pacemaker/pcmk_sched_instances.c after_iter != NULL; after_iter = after_iter->next) { next 1621 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = instances; iter != NULL; iter = iter->next) { next 1660 lib/pacemaker/pcmk_sched_instances.c for (const GList *iter = instances; iter != NULL; iter = iter->next) { next 263 lib/pacemaker/pcmk_sched_location.c iter != NULL; iter = iter->next) { next 424 lib/pacemaker/pcmk_sched_location.c iter != NULL; iter = iter->next) { next 708 lib/pacemaker/pcmk_sched_location.c iter != NULL; iter = iter->next) { next 749 lib/pacemaker/pcmk_sched_location.c for (GList *iter = location->nodes; iter != NULL; iter = iter->next) { next 129 lib/pacemaker/pcmk_sched_nodes.c iter != NULL; iter = iter->next) { next 161 lib/pacemaker/pcmk_sched_nodes.c iter != NULL; iter = iter->next) { next 181 lib/pacemaker/pcmk_sched_nodes.c for (const GList *iter = list; iter != NULL; iter = iter->next) { next 387 lib/pacemaker/pcmk_sched_nodes.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { next 399 lib/pacemaker/pcmk_sched_nodes.c for (GList *r = scheduler->priv->resources; r != NULL; r = r->next) { next 338 lib/pacemaker/pcmk_sched_ordering.c iter != NULL; iter = iter->next) { next 609 lib/pacemaker/pcmk_sched_ordering.c set_iter = set_iter->next; next 616 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = set_iter; iter != NULL; iter = iter->next) { next 647 lib/pacemaker/pcmk_sched_ordering.c set_iter = set_iter->next; next 1102 lib/pacemaker/pcmk_sched_ordering.c iter != NULL; iter = iter->next) { next 1108 lib/pacemaker/pcmk_sched_ordering.c input_iter != NULL; input_iter = input_iter->next) { next 1129 lib/pacemaker/pcmk_sched_ordering.c iter != NULL; iter = iter->next) { next 1267 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = then_actions; iter != NULL; iter = iter->next) { next 1354 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = first_actions; iter != NULL; iter = iter->next) { next 1410 lib/pacemaker/pcmk_sched_ordering.c iter != NULL; iter = iter->next) { next 1454 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = list; iter != NULL; iter = iter->next) { next 255 lib/pacemaker/pcmk_sched_primitive.c for (GList *iter = nodes->next; iter; iter = iter->next) { next 440 lib/pacemaker/pcmk_sched_primitive.c for (iter = this_with_colocations; iter != NULL; iter = iter->next) { next 448 lib/pacemaker/pcmk_sched_primitive.c for (iter = with_this_colocations; iter != NULL; iter = iter->next) { next 461 lib/pacemaker/pcmk_sched_primitive.c for (iter = this_with_colocations; iter != NULL; iter = iter->next) { next 469 lib/pacemaker/pcmk_sched_primitive.c for (iter = with_this_colocations; iter != NULL; iter = iter->next) { next 1045 lib/pacemaker/pcmk_sched_primitive.c for (GList *item = allowed_nodes; item; item = item->next) { next 1180 lib/pacemaker/pcmk_sched_primitive.c iter != NULL; iter = iter->next) { next 1214 lib/pacemaker/pcmk_sched_primitive.c iter != NULL; iter = iter->next) { next 1275 lib/pacemaker/pcmk_sched_primitive.c iter != NULL; iter = iter->next) { next 1401 lib/pacemaker/pcmk_sched_primitive.c for (iter = action_list; iter != NULL; iter = iter->next) { next 1432 lib/pacemaker/pcmk_sched_primitive.c for (iter = action_list; iter != NULL; iter = iter->next) { next 1458 lib/pacemaker/pcmk_sched_primitive.c iter != NULL; iter = iter->next) { next 58 lib/pacemaker/pcmk_sched_probes.c for (GList *iter = rscs; iter != NULL; iter = iter->next) { next 357 lib/pacemaker/pcmk_sched_probes.c iter != NULL; iter = iter->next) { next 453 lib/pacemaker/pcmk_sched_probes.c probe_iter = probe_iter->next) { next 458 lib/pacemaker/pcmk_sched_probes.c then_iter = then_iter->next) { next 515 lib/pacemaker/pcmk_sched_probes.c then_iter = then_iter->next) { next 594 lib/pacemaker/pcmk_sched_probes.c for (iter = then_actions; iter != NULL; iter = iter->next) { next 625 lib/pacemaker/pcmk_sched_probes.c for (iter = after->actions_after; iter != NULL; iter = iter->next) { next 691 lib/pacemaker/pcmk_sched_probes.c iter != NULL; iter = iter->next) { next 722 lib/pacemaker/pcmk_sched_probes.c for (GList *iter = probes; iter != NULL; iter = iter->next) { next 726 lib/pacemaker/pcmk_sched_probes.c then_iter = then_iter->next) { next 781 lib/pacemaker/pcmk_sched_probes.c iter != NULL; iter = iter->next) { next 803 lib/pacemaker/pcmk_sched_probes.c actions = actions->next) { next 813 lib/pacemaker/pcmk_sched_probes.c clone_actions = clone_actions->next) { next 847 lib/pacemaker/pcmk_sched_probes.c probe_iter = probe_iter->next) { next 882 lib/pacemaker/pcmk_sched_probes.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { next 90 lib/pacemaker/pcmk_sched_promotable.c for (iter = rsc->priv->children; iter != NULL; iter = iter->next) { next 97 lib/pacemaker/pcmk_sched_promotable.c for (iter = rsc->priv->actions; iter != NULL; iter = iter->next) { next 134 lib/pacemaker/pcmk_sched_promotable.c for (const GList *iter = location_constraints; iter; iter = iter->next) { next 176 lib/pacemaker/pcmk_sched_promotable.c iter != NULL; iter = iter->next) { next 461 lib/pacemaker/pcmk_sched_promotable.c iter != NULL; iter = iter->next) { next 512 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = clone->priv->children; iter; iter = iter->next) { next 541 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = clone->priv->children; iter; iter = iter->next) { next 719 lib/pacemaker/pcmk_sched_promotable.c iter != NULL; iter = iter->next) { next 796 lib/pacemaker/pcmk_sched_promotable.c iter != NULL; iter = iter->next) { next 1017 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = list; iter != NULL; iter = iter->next) { next 1126 lib/pacemaker/pcmk_sched_promotable.c iter != NULL; iter = iter->next) { next 1149 lib/pacemaker/pcmk_sched_promotable.c iter != NULL; iter = iter->next) { next 1193 lib/pacemaker/pcmk_sched_promotable.c iter != NULL; iter = iter->next) { next 1277 lib/pacemaker/pcmk_sched_promotable.c iter != NULL; iter = iter->next) { next 227 lib/pacemaker/pcmk_sched_recurring.c iter != NULL; iter = iter->next) { next 442 lib/pacemaker/pcmk_sched_recurring.c for (GList *iter = probes; iter != NULL; iter = iter->next) { next 463 lib/pacemaker/pcmk_sched_recurring.c for (GList *iter = stop_ops; iter != NULL; iter = iter->next) { next 521 lib/pacemaker/pcmk_sched_recurring.c iter != NULL; iter = iter->next) { next 403 lib/pacemaker/pcmk_sched_remote.c iter != NULL; iter = iter->next) { next 460 lib/pacemaker/pcmk_sched_remote.c item = item->next) { next 165 lib/pacemaker/pcmk_sched_resource.c iter != NULL; iter = iter->next) { next 193 lib/pacemaker/pcmk_sched_resource.c iter != NULL; iter = iter->next) { next 271 lib/pacemaker/pcmk_sched_resource.c for (iter = colocations; iter != NULL; iter = iter->next) { next 289 lib/pacemaker/pcmk_sched_resource.c for (iter = colocations; iter != NULL; iter = iter->next) { next 327 lib/pacemaker/pcmk_sched_resource.c pcmk_node_t *next = NULL; next 337 lib/pacemaker/pcmk_sched_resource.c iter != NULL; iter = iter->next) { next 346 lib/pacemaker/pcmk_sched_resource.c next = rsc->priv->assigned_node; next 362 lib/pacemaker/pcmk_sched_resource.c out->message(out, "rsc-action", rsc, current, next); next 427 lib/pacemaker/pcmk_sched_resource.c iter != NULL; iter = iter->next) { next 477 lib/pacemaker/pcmk_sched_resource.c iter != NULL; iter = iter->next) { next 573 lib/pacemaker/pcmk_sched_resource.c iter != NULL; iter = iter->next) { next 751 lib/pacemaker/pcmk_sched_resource.c for (const GList *iter = nodes; iter != NULL; iter = iter->next) { next 79 lib/pacemaker/pcmk_sched_tickets.c for (iter = rsc->priv->children; iter != NULL; iter = iter->next) { next 118 lib/pacemaker/pcmk_sched_tickets.c iter != NULL; iter = iter->next) { next 510 lib/pacemaker/pcmk_sched_tickets.c item != NULL; item = item->next) { next 284 lib/pacemaker/pcmk_sched_utilization.c for (GList *iter = rscs; iter != NULL; iter = iter->next) { next 438 lib/pacemaker/pcmk_sched_utilization.c for (iter = rsc->priv->active_nodes; iter != NULL; iter = iter->next) { next 446 lib/pacemaker/pcmk_sched_utilization.c for (iter = allowed_nodes; iter; iter = iter->next) { next 474 lib/pacemaker/pcmk_sched_utilization.c iter != NULL; iter = iter->next) { next 249 lib/pacemaker/pcmk_scheduler.c iter != NULL; iter = iter->next) { next 274 lib/pacemaker/pcmk_scheduler.c node_iter = node_iter->next) { next 277 lib/pacemaker/pcmk_scheduler.c rsc_iter != NULL; rsc_iter = rsc_iter->next) { next 310 lib/pacemaker/pcmk_scheduler.c iter != NULL; iter = iter->next) { next 324 lib/pacemaker/pcmk_scheduler.c for (iter = scheduler->priv->resources; iter != NULL; iter = iter->next) { next 359 lib/pacemaker/pcmk_scheduler.c iter != NULL; iter = iter->next) { next 407 lib/pacemaker/pcmk_scheduler.c iter != NULL; iter = iter->next) { next 430 lib/pacemaker/pcmk_scheduler.c iter != NULL; iter = iter->next) { next 451 lib/pacemaker/pcmk_scheduler.c iter != NULL; iter = iter->next) { next 561 lib/pacemaker/pcmk_scheduler.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { next 666 lib/pacemaker/pcmk_scheduler.c item != NULL; item = item->next) { next 723 lib/pacemaker/pcmk_scheduler.c iter != NULL; iter = iter->next) { next 237 lib/pacemaker/pcmk_simulate.c for (iter = scheduler->priv->actions; iter != NULL; iter = iter->next) { next 278 lib/pacemaker/pcmk_simulate.c for (iter = scheduler->priv->actions; iter != NULL; iter = iter->next) { next 282 lib/pacemaker/pcmk_simulate.c before_iter != NULL; before_iter = before_iter->next) { next 657 lib/pacemaker/pcmk_simulate.c iter != NULL; iter = iter->next) { next 404 lib/pacemaker/pcmk_ticket.c for (GList *list_iter = attr_delete; list_iter != NULL; list_iter = list_iter->next) { next 141 lib/pengine/bundle.c for (const GList *iter = data->replicas; iter != NULL; iter = iter->next) { next 167 lib/pengine/bundle.c for (GList *iter = bundle_data->replicas; iter != NULL; iter = iter->next) { next 217 lib/pengine/bundle.c for (GList *iter = bundle_data->replicas; iter != NULL; iter = iter->next) { next 243 lib/pengine/bundle.c iter = iter->next) { next 489 lib/pengine/bundle.c for (GList *iter = data->mounts; iter != NULL; iter = iter->next) { next 516 lib/pengine/bundle.c for (GList *iter = data->ports; iter != NULL; iter = iter->next) { next 881 lib/pengine/bundle.c gIter = gIter->next) { next 1217 lib/pengine/bundle.c childIter != NULL; childIter = childIter->next) { next 1267 lib/pengine/bundle.c gIter = gIter->next) { next 1331 lib/pengine/bundle.c for (iter = bundle_data->replicas; iter != NULL; iter = iter->next) { next 1381 lib/pengine/bundle.c gIter = gIter->next) { next 1419 lib/pengine/bundle.c gIter = gIter->next) { next 1590 lib/pengine/bundle.c gIter = gIter->next) { next 1733 lib/pengine/bundle.c gIter = gIter->next) { next 1915 lib/pengine/bundle.c for (GList *item = bundle_data->replicas; item != NULL; item = item->next) { next 1945 lib/pengine/bundle.c for (GList *gIter = bundle_data->replicas; gIter != NULL; gIter = gIter->next) { next 1998 lib/pengine/bundle.c for (GList *iter = data->replicas; iter != NULL; iter = iter->next) { next 2033 lib/pengine/bundle.c for (iter = data->replicas; iter != NULL; iter = iter->next) { next 2060 lib/pengine/bundle.c for (iter = containers; iter != NULL; iter = iter->next) { next 2063 lib/pengine/bundle.c node_iter != NULL; node_iter = node_iter->next) { next 156 lib/pengine/clone.c for (const GList *iter = list; iter != NULL; iter = iter->next) { next 448 lib/pengine/clone.c gIter != NULL; gIter = gIter->next) { next 513 lib/pengine/clone.c gIter != NULL; gIter = gIter->next) { next 556 lib/pengine/clone.c gIter != NULL; gIter = gIter->next) { next 649 lib/pengine/clone.c for (gIter = rsc->priv->children; gIter != NULL; gIter = gIter->next) { next 755 lib/pengine/clone.c for (gIter = promoted_list; gIter; gIter = gIter->next) { next 778 lib/pengine/clone.c for (gIter = started_list; gIter; gIter = gIter->next) { next 839 lib/pengine/clone.c for (nIter = list; nIter != NULL; nIter = nIter->next) { next 882 lib/pengine/clone.c for (GList *status_iter = list; status_iter != NULL; status_iter = status_iter->next) { next 926 lib/pengine/clone.c gIter != NULL; gIter = gIter->next) { next 958 lib/pengine/clone.c gIter != NULL; gIter = gIter->next) { next 1010 lib/pengine/clone.c iter != NULL; iter = iter->next) { next 183 lib/pengine/complex.c a != NULL; a = a->next) { next 1175 lib/pengine/complex.c iter != NULL; iter = iter->next) { next 1220 lib/pengine/complex.c item != NULL; item = item->next) { next 107 lib/pengine/group.c gIter != NULL; gIter = gIter->next) { next 241 lib/pengine/group.c gIter != NULL; gIter = gIter->next) { next 284 lib/pengine/group.c gIter != NULL; gIter = gIter->next) { next 362 lib/pengine/group.c gIter != NULL; gIter = gIter->next) { next 389 lib/pengine/group.c gIter != NULL; gIter = gIter->next) { next 410 lib/pengine/group.c gIter != NULL; gIter = gIter->next) { next 442 lib/pengine/group.c iter != NULL; iter = iter->next) { next 70 lib/pengine/native.c gIter != NULL; gIter = gIter->next) { next 95 lib/pengine/native.c gIter != NULL; gIter = gIter->next) { next 164 lib/pengine/native.c gIter != NULL; gIter = gIter->next) { next 254 lib/pengine/native.c iter != NULL; iter = iter->next) { next 312 lib/pengine/native.c gIter != NULL; gIter = gIter->next) { next 328 lib/pengine/native.c gIter != NULL; gIter = gIter->next) { next 628 lib/pengine/native.c iter != NULL; iter = iter->next) { next 799 lib/pengine/native.c gIter != NULL; gIter = gIter->next) { next 905 lib/pengine/native.c gIter != NULL; gIter = gIter->next) { next 927 lib/pengine/native.c if (result && (result->next == NULL)) { next 934 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 953 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 994 lib/pengine/native.c gIter2 != NULL; gIter2 = gIter2->next) { next 1051 lib/pengine/native.c for (GList *gIter = sorted_rscs; gIter; gIter = gIter->next) { next 1065 lib/pengine/native.c for (GList *gIter2 = sorted_nodes; gIter2; gIter2 = gIter2->next) { next 712 lib/pengine/pe_actions.c attr != NULL; attr = attr->next) { next 1146 lib/pengine/pe_actions.c for (GList *gIter = candidates; gIter != NULL; gIter = gIter->next) { next 1194 lib/pengine/pe_actions.c for (gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { next 1270 lib/pengine/pe_actions.c for (GList *gIter = matches; gIter != NULL; gIter = gIter->next) { next 1391 lib/pengine/pe_actions.c for (const GList *gIter = input; gIter != NULL; gIter = gIter->next) { next 1422 lib/pengine/pe_actions.c for (; gIter != NULL; gIter = gIter->next) { next 1459 lib/pengine/pe_actions.c for (GList *gIter = input; gIter != NULL; gIter = gIter->next) { next 129 lib/pengine/pe_notif.c for (const GList *iter = list; iter != NULL; iter = iter->next) { next 201 lib/pengine/pe_notif.c for (GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 270 lib/pengine/pe_notif.c for (const GSList *item = n_data->keys; item; item = item->next) { next 395 lib/pengine/pe_notif.c for (GList *iter = rsc->priv->actions; iter != NULL; iter = iter->next) { next 569 lib/pengine/pe_notif.c for (iter = rsc->priv->children; iter != NULL; iter = iter->next) { next 621 lib/pengine/pe_notif.c for (iter = rsc->priv->actions; iter != NULL; iter = iter->next) { next 834 lib/pengine/pe_notif.c for (iter = rsc->priv->actions; iter != NULL; iter = iter->next) { next 894 lib/pengine/pe_notif.c iter != NULL; iter = iter->next) { next 72 lib/pengine/pe_output.c for (gIter = rsc_list; gIter != NULL; gIter = gIter->next) { next 377 lib/pengine/pe_output.c for (GList *gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { next 731 lib/pengine/pe_output.c gIter != NULL; gIter = gIter->next) { next 746 lib/pengine/pe_output.c for (gIter2 = location->nodes; gIter2 != NULL; gIter2 = gIter2->next) { next 1833 lib/pengine/pe_output.c for (lpc2 = node->details->running_rsc; lpc2 != NULL; lpc2 = lpc2->next) { next 1975 lib/pengine/pe_output.c for (gIter2 = node->details->running_rsc; gIter2 != NULL; gIter2 = gIter2->next) { next 2108 lib/pengine/pe_output.c for (lpc = node->details->running_rsc; lpc != NULL; lpc = lpc->next) { next 2353 lib/pengine/pe_output.c for (GList *gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { next 2384 lib/pengine/pe_output.c for (GList *aIter = attr_list; aIter != NULL; aIter = aIter->next) { next 2555 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { next 2590 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { next 2692 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { next 3060 lib/pengine/pe_output.c rsc_iter != NULL; rsc_iter = rsc_iter->next) { next 3150 lib/pengine/pe_output.c for (gIter = op_list; gIter != NULL; gIter = gIter->next) { next 36 lib/pengine/remote.c gIter != NULL; gIter = gIter->next) { next 96 lib/pengine/remote.c for (iter = host->details->running_rsc; iter != NULL; iter = iter->next) { next 165 lib/pengine/status.c item != NULL; item = item->next) { next 201 lib/pengine/status.c for (rIter = rsc_list; id && rIter; rIter = rIter->next) { next 250 lib/pengine/status.c for (const GList *iter = nodes; iter != NULL; iter = iter->next) { next 36 lib/pengine/tags.c refs != NULL; refs = refs->next) { next 71 lib/pengine/tags.c refs != NULL; refs = refs->next) { next 57 lib/pengine/tests/native/native_find_rsc_test.c iter != NULL; iter = iter->next) { next 123 lib/pengine/tests/native/native_find_rsc_test.c iter != NULL; iter = iter->next) { next 218 lib/pengine/tests/native/native_find_rsc_test.c iter != NULL; iter = iter->next) { next 261 lib/pengine/tests/native/native_find_rsc_test.c iter != NULL; iter = iter->next) { next 363 lib/pengine/tests/native/native_find_rsc_test.c iter != NULL; iter = iter->next) { next 504 lib/pengine/tests/native/native_find_rsc_test.c iter != NULL; iter = iter->next) { next 725 lib/pengine/tests/native/native_find_rsc_test.c iter != NULL; iter = iter->next) { next 865 lib/pengine/tests/native/native_find_rsc_test.c iter != NULL; iter = iter->next) { next 871 lib/pengine/tests/native/native_find_rsc_test.c iter2 != NULL; iter2 = iter2->next) { next 51 lib/pengine/tests/native/pe_base_name_eq_test.c iter != NULL; iter = iter->next) { next 66 lib/pengine/tests/native/pe_base_name_eq_test.c iter != NULL; iter = iter->next) { next 79 lib/pengine/tests/native/pe_base_name_eq_test.c iter != NULL; iter = iter->next) { next 867 lib/pengine/unpack.c gIter != NULL; gIter = gIter->next) { next 1010 lib/pengine/unpack.c for (xIter = xml_ticket->properties; xIter; xIter = xIter->next) { next 1435 lib/pengine/unpack.c item != NULL; item = item->next) { next 1452 lib/pengine/unpack.c for (GList *gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { next 2091 lib/pengine/unpack.c (rIter != NULL) && (rsc == NULL); rIter = rIter->next) { next 2118 lib/pengine/unpack.c CRM_LOG_ASSERT(locations->next == NULL); next 2557 lib/pengine/unpack.c for (; gIter != NULL; gIter = gIter->next) { next 2593 lib/pengine/unpack.c for (; gIter != NULL; gIter = gIter->next) { next 2653 lib/pengine/unpack.c for (const GList *iter = sorted_op_list; iter != NULL; iter = iter->next) { next 2794 lib/pengine/unpack.c for (gIter = sorted_op_list; gIter != NULL; gIter = gIter->next) { next 3510 lib/pengine/unpack.c xIter != NULL; xIter = xIter->next) { next 5027 lib/pengine/unpack.c for (gIter = sorted_op_list; gIter != NULL; gIter = gIter->next) { next 43 lib/pengine/utils.c for (GList *n = rsc->priv->active_nodes; n != NULL; n = n->next) { next 157 lib/pengine/utils.c for (const GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 221 lib/pengine/utils.c for (const GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 311 lib/pengine/utils.c gIter != NULL; gIter = gIter->next) { next 375 lib/pengine/utils.c gIter != NULL; gIter = gIter->next) { next 407 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 505 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 595 lib/pengine/utils.c gIter != NULL; gIter = gIter->next) { next 606 lib/pengine/utils.c lpc != NULL; lpc = lpc->next) { next 620 lib/pengine/utils.c gIter != NULL; gIter = gIter->next) { next 770 lib/pengine/utils.c for (GList *ele = rsc->priv->active_nodes; ele; ele = ele->next) { next 793 lib/pengine/utils.c for (GList *gIter = rscs; gIter; gIter = gIter->next) { next 56 lib/services/dbus.c for (GList *gIter = conn_dispatches; gIter != NULL; gIter = gIter->next) { next 894 lib/services/services.c for (gIter = inflight_ops; gIter != NULL; gIter = gIter->next) { next 920 lib/services/services.c for (gIter = blocked_ops; gIter != NULL; gIter = gIter->next) { next 933 lib/services/services.c for (gIter = executed_ops; gIter != NULL; gIter = gIter->next) { next 1136 lib/services/services.c for (iter = standards; iter != NULL; iter = iter->next) { next 1152 lib/services/services.c for (iter = providers; iter != NULL; iter = iter->next) { next 72 lib/services/services_ocf.c for (gIter = providers; gIter != NULL; gIter = gIter->next) { next 112 libltdl/libltdl/lt__private.h lt_dlhandle next; next 59 libltdl/libltdl/slist.h struct slist *next; /* chain forward pointer*/ next 99 libltdl/loaders/preopen.c struct symlist_chain *next; next 166 libltdl/loaders/preopen.c for (lists = preloaded_symlists; lists; lists = lists->next) next 250 libltdl/loaders/preopen.c symlist_chain *next = lists->next; next 252 libltdl/loaders/preopen.c lists = next; next 268 libltdl/loaders/preopen.c lists && lists->symlist != symlist; lists = lists->next) next 279 libltdl/loaders/preopen.c tmp->next = preloaded_symlists; next 348 libltdl/loaders/preopen.c for (list = preloaded_symlists; list; list = list->next) next 135 libltdl/lt_dlloader.c return (lt_dlloader) (item ? item->next : loaders); next 286 libltdl/ltdl.c handles = handles->next; next 298 libltdl/ltdl.c cur = cur->next; next 314 libltdl/ltdl.c for (tmp = handles; tmp; tmp = tmp->next) next 337 libltdl/ltdl.c lt_dlloader *next = (lt_dlloader *) lt_dlloader_next (loader); next 353 libltdl/ltdl.c loader = next; next 384 libltdl/ltdl.c for (;handle; handle = handle->next) next 1503 libltdl/ltdl.c (*phandle)->next = handles; next 1959 libltdl/ltdl.c cur = cur->next; next 1982 libltdl/ltdl.c last->next = cur->next; next 1986 libltdl/ltdl.c handles = cur->next; next 2415 libltdl/ltdl.c handle = handle->next; next 2421 libltdl/ltdl.c handle = handle->next; next 2463 libltdl/ltdl.c cur = cur->next; next 60 libltdl/slist.c SList *next = head->next; next 62 libltdl/slist.c head = next; next 93 libltdl/slist.c *phead = stale->next; next 99 libltdl/slist.c for (head = *phead; head->next; head = head->next) next 101 libltdl/slist.c result = (*find) (head->next, matchdata); next 104 libltdl/slist.c stale = head->next; next 105 libltdl/slist.c head->next = stale->next; next 124 libltdl/slist.c for (; slist; slist = slist->next) next 152 libltdl/slist.c while (last->next) next 153 libltdl/slist.c last = last->next; next 155 libltdl/slist.c last->next = tail; next 175 libltdl/slist.c assert (!item->next); next 177 libltdl/slist.c item->next = slist; next 185 libltdl/slist.c return slist ? slist->next : NULL; next 197 libltdl/slist.c slist = slist->next; next 210 libltdl/slist.c slist = slist->next; next 226 libltdl/slist.c SList *next; next 230 libltdl/slist.c next = slist->next; next 231 libltdl/slist.c slist->next = result; next 233 libltdl/slist.c slist = next; next 250 libltdl/slist.c SList *next = slist->next; next 256 libltdl/slist.c slist = next; next 284 libltdl/slist.c insert = insert->next = left; next 285 libltdl/slist.c left = left->next; next 289 libltdl/slist.c insert = insert->next = right; next 290 libltdl/slist.c right = right->next; next 294 libltdl/slist.c insert->next = left ? left : right; next 296 libltdl/slist.c return merged.next; next 316 libltdl/slist.c right = slist->next; next 323 libltdl/slist.c while (right && (right = right->next)) next 325 libltdl/slist.c if (!right || !(right = right->next)) next 327 libltdl/slist.c slist = slist->next; next 329 libltdl/slist.c right = slist->next; next 330 libltdl/slist.c slist->next = 0; next 357 libltdl/slist.c item->next = 0; next 402 tools/attrd_updater.c for (const GList *iter = reply; iter != NULL; iter = iter->next) { next 85 tools/cibadmin.c for (child = xml->children; child; child = child->next) { next 399 tools/crm_mon.c node = node->next; next 176 tools/crm_node.c for (GList *node_iter = nodes; node_iter != NULL; node_iter = node_iter->next) { next 193 tools/crm_node.c for (GList *node_iter = nodes; node_iter != NULL; node_iter = node_iter->next) { next 246 tools/crm_node.c for (GList *node_iter = nodes; node_iter != NULL; node_iter = node_iter->next) { next 270 tools/crm_node.c for (GList *node_iter = nodes; node_iter != NULL; node_iter = node_iter->next) { next 875 tools/crm_resource.c for (iter = rsc->priv->children; iter != NULL; iter = iter->next) { next 1285 tools/crm_resource.c for (const GList *iter = remaining; iter != NULL; iter = iter->next) { next 344 tools/crm_resource_ban.c for(; n; n = n->next) { next 101 tools/crm_resource_print.c for (GList *lpc = ops; lpc != NULL; lpc = lpc->next) { next 188 tools/crm_resource_print.c for (GList *iter = results; iter != NULL; iter = iter->next) { next 208 tools/crm_resource_print.c for (GList *iter = results; iter != NULL; iter = iter->next) { next 593 tools/crm_resource_print.c for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) { next 633 tools/crm_resource_print.c for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) { next 665 tools/crm_resource_print.c for (lpc = resources; lpc != NULL; lpc = lpc->next) { next 699 tools/crm_resource_print.c for (lpc = activeResources; lpc != NULL; lpc = lpc->next) { next 706 tools/crm_resource_print.c for(lpc = unactiveResources; lpc != NULL; lpc = lpc->next) { next 751 tools/crm_resource_print.c for (lpc = resources; lpc != NULL; lpc = lpc->next) { next 787 tools/crm_resource_print.c for (lpc = activeResources; lpc != NULL; lpc = lpc->next) { next 800 tools/crm_resource_print.c for(lpc = unactiveResources; lpc != NULL; lpc = lpc->next) { next 101 tools/crm_resource_runtime.c iter = iter->next) { next 197 tools/crm_resource_runtime.c gIter != NULL; gIter = gIter->next) { next 429 tools/crm_resource_runtime.c for (GList *iter = resources; iter != NULL; iter = iter->next) { next 546 tools/crm_resource_runtime.c lpc != NULL; lpc = lpc->next) { next 661 tools/crm_resource_runtime.c for (GList *iter = resources; iter != NULL; iter = iter->next) { next 984 tools/crm_resource_runtime.c iter = iter->next) { next 1020 tools/crm_resource_runtime.c for (GList *iter = nodes; iter != NULL; iter = iter->next) { next 1120 tools/crm_resource_runtime.c for (GList *iter = scheduler->nodes; iter; iter = iter->next) { next 1326 tools/crm_resource_runtime.c for (hIter = hosts; host != NULL && hIter != NULL; hIter = hIter->next) { next 1365 tools/crm_resource_runtime.c for (rIter = rsc_list; rIter != NULL; rIter = rIter->next) { next 1389 tools/crm_resource_runtime.c for (item = items; item != NULL; item = item->next) { next 1399 tools/crm_resource_runtime.c for (item = items; item != NULL; item = item->next) { next 1573 tools/crm_resource_runtime.c iter != NULL; iter = iter->next) { next 1628 tools/crm_resource_runtime.c for (const GList *item = resources; item != NULL; item = item->next) { next 2040 tools/crm_resource_runtime.c for (const GList *action = actions; action != NULL; action = action->next) { next 2057 tools/crm_resource_runtime.c for (action = actions; action != NULL; action = action->next) { next 2496 tools/crm_resource_runtime.c iter = iter->next) {