next 417 daemons/attrd/attrd_sync.c for (GList *node = keys; node != NULL; node = node->next) { next 316 daemons/attrd/attrd_utils.c for (xmlAttrPtr a = pcmk__xe_first_attr(src); a != NULL; a = a->next) { next 504 daemons/controld/controld_cib.c for (GList *iter = metadata->ra_params; iter != NULL; iter = iter->next) { next 209 daemons/controld/controld_control.c iter = iter->next) { next 97 daemons/controld/controld_execd.c for (iter = history->recurring_op_list; iter != NULL; iter = iter->next) { next 123 daemons/controld/controld_execd.c for (iter = history->recurring_op_list; iter != NULL; iter = iter->next) { next 560 daemons/controld/controld_execd.c for (gIter = entry->recurring_op_list; gIter != NULL; gIter = gIter->next) { next 1791 daemons/controld/controld_execd.c for (state_entry = lrm_state_list; state_entry != NULL; state_entry = state_entry->next) { next 336 daemons/controld/controld_fencing.c iter = iter->next; next 355 daemons/controld/controld_fencing.c for (iter = stonith_cleanup_list; iter != NULL; iter = iter->next) { next 375 daemons/controld/controld_fencing.c for (iter = stonith_cleanup_list; iter != NULL; iter = iter->next) { next 411 daemons/controld/controld_fencing.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 419 daemons/controld/controld_fencing.c for (lpc2 = synapse->actions; lpc2 != NULL; lpc2 = lpc2->next) { next 180 daemons/controld/controld_messages.c iter = iter->next) { next 220 daemons/controld/controld_metadata.c for (GList *iter = md->ra_params; iter != NULL; iter = iter->next) { next 495 daemons/controld/controld_remote_ra.c for (tmp = cmd->params; tmp; tmp = tmp->next) { next 863 daemons/controld/controld_remote_ra.c for (tmp = cmd->params; tmp; tmp = tmp->next) { next 1076 daemons/controld/controld_remote_ra.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 1085 daemons/controld/controld_remote_ra.c for (gIter = rm_list; gIter != NULL; gIter = gIter->next) { next 1109 daemons/controld/controld_remote_ra.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 1177 daemons/controld/controld_remote_ra.c for (gIter = ra_data->recurring_cmds; gIter != NULL; gIter = gIter->next) { next 1186 daemons/controld/controld_remote_ra.c for (gIter = ra_data->cmds; gIter != NULL; gIter = gIter->next) { next 248 daemons/controld/controld_te_callbacks.c && (xml->children != NULL) && (xml->children->next != NULL)) { next 96 daemons/controld/controld_te_events.c for (; gIter != NULL; gIter = gIter->next) { next 105 daemons/controld/controld_te_events.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 286 daemons/controld/controld_te_events.c item != NULL; item = item->next) { next 289 daemons/controld/controld_te_events.c for (GList *item2 = synapse->actions; item2; item2 = item2->next) { next 307 daemons/controld/controld_te_events.c for (; gIter != NULL; gIter = gIter->next) { next 311 daemons/controld/controld_te_events.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 384 daemons/controld/controld_te_events.c gIter = gIter->next) { next 388 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 430 daemons/execd/execd_commands.c for (const GList *item = action_list; item != NULL; item = item->next) { next 1115 daemons/execd/execd_commands.c for (GList *op = rsc->recurring_ops; op != NULL; op = op->next) { next 1426 daemons/execd/execd_commands.c GList *next = gIter->next; next 1433 daemons/execd/execd_commands.c gIter = next; next 1440 daemons/execd/execd_commands.c GList *next = gIter->next; next 1462 daemons/execd/execd_commands.c gIter = next; next 1651 daemons/execd/execd_commands.c for (gIter = rsc->pending_ops; gIter != NULL; gIter = gIter->next) { next 1664 daemons/execd/execd_commands.c for (gIter = rsc->recurring_ops; gIter != NULL; gIter = gIter->next) { next 1710 daemons/execd/execd_commands.c for (cmd_iter = cmd_list; cmd_iter; cmd_iter = cmd_iter->next) { next 1750 daemons/execd/execd_commands.c for (GList *item = rsc->recurring_ops; item != NULL; item = item->next) { next 422 daemons/execd/remoted_proxy.c for (gIter = remove_these; gIter != NULL; gIter = gIter->next) { next 412 daemons/fenced/fenced_commands.c gIterNext = gIter->next; next 514 daemons/fenced/fenced_commands.c gIterNext = gIter->next; next 720 daemons/fenced/fenced_commands.c for (gIter = device->pending_ops; gIter != NULL; gIter = gIter->next) { next 1805 daemons/fenced/fenced_commands.c for (dIter = devices; dIter; dIter = dIter->next) { next 1909 daemons/fenced/fenced_commands.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 1919 daemons/fenced/fenced_commands.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 2432 daemons/fenced/fenced_commands.c for (lpc = devices; lpc != NULL; lpc = lpc->next) { next 2533 daemons/fenced/fenced_commands.c int pid, const char *next, bool op_merged) next 2548 daemons/fenced/fenced_commands.c next = NULL; next 2581 daemons/fenced/fenced_commands.c if (next != NULL) { next 2582 daemons/fenced/fenced_commands.c pcmk__g_strcat(msg, ", retrying with ", next, NULL); next 2709 daemons/fenced/fenced_commands.c GList *next = NULL; next 2711 daemons/fenced/fenced_commands.c for (GList *iter = cmd_list; iter != NULL; iter = next) { next 2714 daemons/fenced/fenced_commands.c next = iter->next; // We might delete this entry, so grab next now next 2762 daemons/fenced/fenced_commands.c for (GList *iter = cmd->next_device_iter; iter != NULL; iter = iter->next) { next 2770 daemons/fenced/fenced_commands.c cmd->next_device_iter = iter->next; next 2812 daemons/fenced/fenced_commands.c cmd->next_device_iter = cmd->next_device_iter->next; next 2871 daemons/fenced/fenced_commands.c cmd->next_device_iter = devices->next; next 3112 daemons/fenced/fenced_commands.c for (dup_iter = list_op->duplicates; dup_iter != NULL; dup_iter = dup_iter->next) { next 337 daemons/fenced/fenced_remote.c for (iter = op->automatic_list; iter != NULL; iter = iter->next) { next 486 daemons/fenced/fenced_remote.c for (GList *iter = op->duplicates; iter != NULL; iter = iter->next) { next 835 daemons/fenced/fenced_remote.c for (lpc = devices; lpc != NULL; lpc = lpc->next) { next 1361 daemons/fenced/fenced_remote.c for (iter = op->query_results; iter != NULL; iter = iter->next) { next 1560 daemons/fenced/fenced_remote.c for (device_list = tp->levels[i]; device_list; device_list = device_list->next) { next 1573 daemons/fenced/fenced_remote.c for (iter = op->query_results; iter != NULL; iter = iter->next) { next 1597 daemons/fenced/fenced_remote.c for (iter = auto_list; iter != NULL; iter = iter->next) { next 1600 daemons/fenced/fenced_remote.c for (iter2 = op->query_results; iter2 != NULL; iter = iter2->next) { next 1670 daemons/fenced/fenced_remote.c for (iter = op->duplicates; iter != NULL; iter = iter->next) { next 1693 daemons/fenced/fenced_remote.c op->devices = op->devices->next; next 2044 daemons/fenced/fenced_remote.c for (device = tp->levels[i]; device; device = device->next) { next 2046 daemons/fenced/fenced_remote.c for (iter = op->query_results; iter && !match; iter = iter->next) { next 125 daemons/fenced/fenced_scheduler.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 287 include/crm/cib/internal.h bool cib__config_changed_v1(xmlNode *last, xmlNode *next, xmlNode **diff); next 284 include/crm/common/internal.h return list && (list->next == NULL); next 291 include/crm/common/internal.h return list && (list->next != NULL); next 273 include/crm/common/xml_internal.h child = child->next; next 289 include/crm/common/xml_internal.h xmlNode *next = (child? child->next : NULL); next 291 include/crm/common/xml_internal.h while (next && (next->type == XML_TEXT_NODE)) { next 292 include/crm/common/xml_internal.h next = next->next; next 294 include/crm/common/xml_internal.h return next; next 311 include/crm/common/xml_internal.h child = child->next; next 327 include/crm/common/xml_internal.h xmlNode *next = child? child->next : NULL; next 329 include/crm/common/xml_internal.h while (next && (next->type != XML_ELEMENT_NODE)) { next 330 include/crm/common/xml_internal.h next = next->next; next 332 include/crm/common/xml_internal.h return next; next 33 include/crm/lrmd.h struct lrmd_key_value_s *next; next 231 include/crm/lrmd.h struct lrmd_list_s *next; next 101 include/crm/stonith-ng.h struct stonith_key_value_s *next; next 112 include/crm/stonith-ng.h struct stonith_history_s *next; next 120 lib/cib/cib_client.c iter = iter->next) { next 790 lib/cib/cib_ops.c cib__config_changed_v1(xmlNode *last, xmlNode *next, xmlNode **diff) next 799 lib/cib/cib_ops.c if (*diff == NULL && last != NULL && next != NULL) { next 800 lib/cib/cib_ops.c *diff = diff_xml_object(last, next, FALSE); next 235 lib/common/acl.c for (aIter = docpriv->acls; aIter != NULL; aIter = aIter->next) { next 401 lib/common/acl.c xIter = xIter->next; next 458 lib/common/acl.c for(aIter = docpriv->acls; aIter != NULL && target; aIter = aIter->next) { next 527 lib/common/acl.c for (xmlAttr *prop = xml->properties; prop != NULL; prop = prop->next) { next 530 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 654 lib/common/logging.c const char *next = trace_tags; next 657 lib/common/logging.c offset = next; next 658 lib/common/logging.c next = strchrnul(offset, ','); next 659 lib/common/logging.c snprintf(token, sizeof(token), "%.*s", (int)(next - offset), offset); next 664 lib/common/logging.c if (next[0] != 0) { next 665 lib/common/logging.c next++; next 668 lib/common/logging.c } while (next != NULL && next[0] != 0); next 1109 lib/common/logging.c const char *next = NULL; next 1123 lib/common/logging.c next = output; next 1125 lib/common/logging.c offset = next; next 1126 lib/common/logging.c next = strchrnul(offset, '\n'); next 1128 lib/common/logging.c (int)(next - offset), offset); next 1129 lib/common/logging.c if (next[0] != 0) { next 1130 lib/common/logging.c next++; next 1133 lib/common/logging.c } while (next != NULL && next[0] != 0); next 1175 lib/common/mainloop.c iter = iter->next; next 1208 lib/common/mainloop.c for (iter = child_list; iter != NULL && match == NULL; iter = iter->next) { next 166 lib/common/nvpair.c iter = iter->next) { next 844 lib/common/nvpair.c pIter = pIter->next) { next 214 lib/common/output_log.c for (GList* gIter = priv->prefixes->head; gIter; gIter = gIter->next) { next 178 lib/common/output_xml.c node = node->next; next 73 lib/common/patchset.c pIter = pIter->next) { next 116 lib/common/patchset.c pIter = pIter->next) { next 167 lib/common/patchset.c for (gIter = docpriv->deleted_objs; gIter; gIter = gIter->next) { next 180 lib/common/patchset.c xml_repair_v1_diff(xmlNode *last, xmlNode *next, xmlNode *local_diff, next 233 lib/common/patchset.c for (lpc = 0; next && lpc < PCMK__NELEM(vfields); lpc++) { next 234 lib/common/patchset.c const char *value = crm_element_value(next, vfields[lpc]); next 239 lib/common/patchset.c for (xmlAttrPtr a = pcmk__xe_first_attr(next); a != NULL; a = a->next) { next 312 lib/common/patchset.c for (gIter = docpriv->deleted_objs; gIter; gIter = gIter->next) { next 513 lib/common/patchset.c xIter = xIter->next) { next 981 lib/common/patchset.c pIter = pIter->next) { next 997 lib/common/patchset.c for (gIter = change_objs; gIter; gIter = gIter->next) { next 1020 lib/common/patchset.c match_child = match_child->next; next 1062 lib/common/patchset.c match_child = match_child->next; next 1309 lib/common/patchset.c pIter = pIter->next) { next 1322 lib/common/patchset.c xIter = xIter->next) { next 1350 lib/common/patchset.c pIter = pIter->next) { next 1380 lib/common/patchset.c pIter = pIter->next) { next 267 lib/common/schemas.c add_schema_by_version(const schema_version_t *version, int next, next 324 lib/common/schemas.c next = -1; next 329 lib/common/schemas.c transform_upgrade, transform_enter, transform_onleave, next); next 395 lib/common/schemas.c int next = 0; next 413 lib/common/schemas.c next = -1; next 415 lib/common/schemas.c if (add_schema_by_version(&version, next, transform_expected) next 991 lib/common/schemas.c int next = -1; /* -1 denotes "inactive" value */ next 1031 lib/common/schemas.c if (next != -1) { next 1034 lib/common/schemas.c next = -1; next 1046 lib/common/schemas.c if (next != -1) { next 1048 lib/common/schemas.c known_schemas[next].name); next 1049 lib/common/schemas.c next = -1; next 1060 lib/common/schemas.c next = known_schemas[lpc].after_transform; next 1062 lib/common/schemas.c if (next <= lpc) { next 1067 lib/common/schemas.c } else if (max > 0 && (lpc == max || next > max)) { next 1069 lib/common/schemas.c known_schemas[lpc].name, lpc, next, max); next 1078 lib/common/schemas.c || validate_with_silent(xml, next)) { next 1080 lib/common/schemas.c known_schemas[lpc].name, known_schemas[next].name); next 1082 lib/common/schemas.c lpc = next; next 1086 lib/common/schemas.c known_schemas[lpc].name, known_schemas[next].name, next 1095 lib/common/schemas.c } else if (validate_with(upgrade, next, error_handler, GUINT_TO_POINTER(LOG_ERR))) { next 1098 lib/common/schemas.c lpc = next; next 1099 lib/common/schemas.c *best = next; next 1111 lib/common/schemas.c next = -1; next 890 lib/common/strings.c for (const GList *ele = lst; ele != NULL; ele = ele->next) { next 465 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(src); a != NULL; a = a->next) { next 494 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(target); a != NULL; a = a->next) { next 597 lib/common/xml.c xmlAttrPtr next = NULL; next 599 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(element); a != NULL; a = next) { next 600 lib/common/xml.c next = a->next; // Grab now because attribute might get removed next 967 lib/common/xml.c xmlNode *next = iter->next; next 985 lib/common/xml.c iter = next; next 1426 lib/common/xml.c attr = attr->next) { next 1446 lib/common/xml.c child = child->next) { next 1745 lib/common/xml.c for (xmlAttr *attr = pcmk__xe_first_attr(xml); attr; attr = attr->next) { next 1859 lib/common/xml.c attr_iter = attr_iter->next; next 1906 lib/common/xml.c attr_iter = attr_iter->next; next 2097 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(xml_node); a != NULL; a = a->next) { next 2275 lib/common/xml.c a = a->next) { next 2397 lib/common/xml.c a = a->next) { next 2440 lib/common/xml.c xmlNode *next = pcmk__xml_next(child_of_child); next 2448 lib/common/xml.c child_of_child = next; next 2671 lib/common/xml.c for (xmlNode *node = children; node != NULL; node = node->next) { next 109 lib/common/xml_display.c attr = attr->next) { next 300 lib/common/xml_display.c attr = attr->next) { next 385 lib/common/xml_display.c iter = iter->next) { next 256 lib/fencing/st_client.c GList *next = g_list_next(list_item); next 263 lib/fencing/st_client.c list_item = next; next 321 lib/fencing/st_client.c for (; params; params = params->next) { next 442 lib/fencing/st_client.c for (; device_list; device_list = device_list->next) { next 746 lib/fencing/st_client.c last->next = kvp; next 763 lib/fencing/st_client.c for (hp = history; hp; hp_old = hp, hp = hp->next, free(hp_old)) { next 1751 lib/fencing/st_client.c for (; params; params = params->next) { next 1936 lib/fencing/st_client.c while (end && end->next) { next 1937 lib/fencing/st_client.c end = end->next; next 1941 lib/fencing/st_client.c end->next = p; next 1955 lib/fencing/st_client.c p = head->next; next 2043 lib/fencing/st_client.c for (hp = history; hp; hp = hp->next) { next 2095 lib/fencing/st_client.c for (dIter = devices; dIter != NULL; dIter = dIter->next) { next 2267 lib/fencing/st_client.c prev_hp != NULL; prev_hp = prev_hp->next) { next 2306 lib/fencing/st_client.c tmp = hp->next; next 2311 lib/fencing/st_client.c hp->next = new; next 2316 lib/fencing/st_client.c if ((!np->next) || (hp->completed > np->next->completed) || next 2317 lib/fencing/st_client.c ((hp->completed == np->next->completed) && (hp->completed_nsec > np->next->completed_nsec))) { next 2318 lib/fencing/st_client.c hp->next = np->next; next 2319 lib/fencing/st_client.c np->next = hp; next 2322 lib/fencing/st_client.c np = np->next; next 2327 lib/fencing/st_client.c hp->next = pending; next 2337 lib/fencing/st_client.c while (last_pending->next) { next 2338 lib/fencing/st_client.c last_pending = last_pending->next; next 2341 lib/fencing/st_client.c last_pending->next = new; next 2372 lib/fencing/st_client.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 182 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 215 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 248 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 279 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 372 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 170 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 396 lib/lrmd/lrmd_client.c for (iter = native->pending_notify; iter; iter = iter->next) { next 1126 lib/lrmd/lrmd_client.c int next = fgetc(stream); next 1128 lib/lrmd/lrmd_client.c if (next == EOF) { next 1140 lib/lrmd/lrmd_client.c key->data[key->size++] = (unsigned char) next; next 1987 lib/lrmd/lrmd_client.c for (const lrmd_key_value_t *param = params; param; param = param->next) { next 2044 lib/lrmd/lrmd_client.c for (tmp = params; tmp; tmp = tmp->next) { next 2070 lib/lrmd/lrmd_client.c for (tmp = params; tmp; tmp = tmp->next) { next 2114 lib/lrmd/lrmd_client.c for (dIter = stonith_resources; dIter; dIter = dIter->next) { next 2139 lib/lrmd/lrmd_client.c for (gIter = agents; gIter != NULL; gIter = gIter->next) { next 2172 lib/lrmd/lrmd_client.c for (gIter2 = agents; gIter2 != NULL; gIter2 = gIter2->next) { next 2191 lib/lrmd/lrmd_client.c for (gIter = ocf_providers; gIter != NULL; gIter = gIter->next) { next 2213 lib/lrmd/lrmd_client.c for (gIter = standards; gIter != NULL; gIter = gIter->next) { next 22 lib/lrmd/lrmd_output.c for (iter = list; iter != NULL; iter = iter->next) { next 35 lib/lrmd/lrmd_output.c for (iter = list; iter != NULL; iter = iter->next) { next 127 lib/pacemaker/pcmk_acl.c for (i_node = xml_modify; i_node != NULL; i_node = i_node->next) { next 87 lib/pacemaker/pcmk_fence.c hp = new->next; next 88 lib/pacemaker/pcmk_fence.c new->next = NULL; next 91 lib/pacemaker/pcmk_fence.c stonith_history_t *hp_next = hp->next; next 93 lib/pacemaker/pcmk_fence.c hp->next = NULL; next 95 lib/pacemaker/pcmk_fence.c for (np = new; ; np = np->next) { next 110 lib/pacemaker/pcmk_fence.c if (!np->next) { next 111 lib/pacemaker/pcmk_fence.c np->next = hp; next 271 lib/pacemaker/pcmk_fence.c for (hp = history; hp; hp = hp->next) { next 343 lib/pacemaker/pcmk_fence.c for (stonith_key_value_t *iter = devices; iter != NULL; iter = iter->next) { next 428 lib/pacemaker/pcmk_fence.c targets = targets->next; next 510 lib/pacemaker/pcmk_fence.c for (stonith_key_value_t *iter = devices; iter != NULL; iter = iter->next) { next 54 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 85 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 118 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 180 lib/pacemaker/pcmk_graph_consumer.c for (lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 204 lib/pacemaker/pcmk_graph_consumer.c for (lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 285 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 380 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 395 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 72 lib/pacemaker/pcmk_graph_logging.c synapse_iter != NULL; synapse_iter = synapse_iter->next) { next 77 lib/pacemaker/pcmk_graph_logging.c action_iter != NULL; action_iter = action_iter->next) { next 125 lib/pacemaker/pcmk_graph_logging.c for (const GList *lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 147 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 193 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 89 lib/pacemaker/pcmk_graph_producer.c iter != NULL; iter = iter->next) { next 173 lib/pacemaker/pcmk_graph_producer.c for (iter = action->actions_before; iter != NULL; iter = iter->next) { next 818 lib/pacemaker/pcmk_graph_producer.c iter != NULL; iter = iter->next) { next 923 lib/pacemaker/pcmk_graph_producer.c for (GList *lpc = action->actions_before; lpc != NULL; lpc = lpc->next) { next 988 lib/pacemaker/pcmk_graph_producer.c for (iter = rsc->children; iter != NULL; iter = iter->next) { next 1052 lib/pacemaker/pcmk_graph_producer.c for (iter = scheduler->resources; iter != NULL; iter = iter->next) { next 1063 lib/pacemaker/pcmk_graph_producer.c for (iter = scheduler->actions; iter != NULL; iter = iter->next) { next 667 lib/pacemaker/pcmk_injections.c for (iter = injections->node_up; iter != NULL; iter = iter->next) { next 681 lib/pacemaker/pcmk_injections.c for (iter = injections->node_down; iter != NULL; iter = iter->next) { next 708 lib/pacemaker/pcmk_injections.c for (iter = injections->node_fail; iter != NULL; iter = iter->next) { next 723 lib/pacemaker/pcmk_injections.c for (iter = injections->ticket_grant; iter != NULL; iter = iter->next) { next 732 lib/pacemaker/pcmk_injections.c for (iter = injections->ticket_revoke; iter != NULL; iter = iter->next) { next 741 lib/pacemaker/pcmk_injections.c for (iter = injections->ticket_standby; iter != NULL; iter = iter->next) { next 750 lib/pacemaker/pcmk_injections.c for (iter = injections->ticket_activate; iter != NULL; iter = iter->next) { next 759 lib/pacemaker/pcmk_injections.c for (iter = injections->op_inject; iter != NULL; iter = iter->next) { next 78 lib/pacemaker/pcmk_output.c for (lpc = list; lpc != NULL; lpc = lpc->next) { next 83 lib/pacemaker/pcmk_output.c for (lpc2 = cons->node_list_rh; lpc2 != NULL; lpc2 = lpc2->next) { next 382 lib/pacemaker/pcmk_output.c for (GList *lpc = rsc->rsc_cons; lpc != NULL; lpc = lpc->next) { next 431 lib/pacemaker/pcmk_output.c for (GList *lpc = rsc->rsc_cons; lpc != NULL; lpc = lpc->next) { next 468 lib/pacemaker/pcmk_output.c for (GList *lpc = rsc->rsc_cons_lhs; lpc != NULL; lpc = lpc->next) { next 518 lib/pacemaker/pcmk_output.c for (GList *lpc = rsc->rsc_cons_lhs; lpc != NULL; lpc = lpc->next) { next 547 lib/pacemaker/pcmk_output.c for (lpc = list; lpc != NULL; lpc = lpc->next) { next 552 lib/pacemaker/pcmk_output.c for (lpc2 = cons->node_list_rh; lpc2 != NULL; lpc2 = lpc2->next) { next 1082 lib/pacemaker/pcmk_output.c pcmk_node_t *next = va_arg(args, pcmk_node_t *); next 1097 lib/pacemaker/pcmk_output.c || (current == NULL && next == NULL)) { next 1106 lib/pacemaker/pcmk_output.c moving = (current != NULL) && (next != NULL) next 1107 lib/pacemaker/pcmk_output.c && !pe__same_node(current, next); next 1109 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, PCMK_ACTION_START, next 1140 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, PCMK_ACTION_PROMOTE, next 1147 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, PCMK_ACTION_DEMOTE, next 1157 lib/pacemaker/pcmk_output.c CRM_CHECK(next != NULL, return rc); next 1159 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, next 1169 lib/pacemaker/pcmk_output.c next, start, NULL); next 1173 lib/pacemaker/pcmk_output.c next, start, NULL); next 1181 lib/pacemaker/pcmk_output.c current, next, promote, demote); next 1184 lib/pacemaker/pcmk_output.c role2text(rsc->role), pe__node_name(next)); next 1201 lib/pacemaker/pcmk_output.c (failed? "Recover" : "Move"), rsc, current, next, next 1211 lib/pacemaker/pcmk_output.c next, start, NULL); next 1230 lib/pacemaker/pcmk_output.c for (GList *iter = rsc->running_on; iter != NULL; iter = iter->next) { next 1263 lib/pacemaker/pcmk_output.c next, stop, start); next 1267 lib/pacemaker/pcmk_output.c rc = out->message(out, "rsc-action-item", "Move", rsc, current, next, next 1272 lib/pacemaker/pcmk_output.c rc = out->message(out, "rsc-action-item", "Reload", rsc, current, next, next 1278 lib/pacemaker/pcmk_output.c next, start, NULL); next 1284 lib/pacemaker/pcmk_output.c next, demote, NULL); next 1287 lib/pacemaker/pcmk_output.c CRM_LOG_ASSERT(next); next 1289 lib/pacemaker/pcmk_output.c next, promote, NULL); next 1293 lib/pacemaker/pcmk_output.c rc = out->message(out, "rsc-action-item", "Start", rsc, current, next, next 539 lib/pacemaker/pcmk_sched_actions.c for (lpc = then->actions_before; lpc != NULL; lpc = lpc->next) { next 645 lib/pacemaker/pcmk_sched_actions.c lpc2 = lpc2->next) { next 670 lib/pacemaker/pcmk_sched_actions.c for (lpc = then->actions_after; lpc != NULL; lpc = lpc->next) { next 1028 lib/pacemaker/pcmk_sched_actions.c for (iter = action->actions_before; iter != NULL; iter = iter->next) { next 1033 lib/pacemaker/pcmk_sched_actions.c for (iter = action->actions_after; iter != NULL; iter = iter->next) { next 1352 lib/pacemaker/pcmk_sched_actions.c GList *next = NULL; next 1357 lib/pacemaker/pcmk_sched_actions.c for (item = action->actions_before; item != NULL; item = next) { next 1360 lib/pacemaker/pcmk_sched_actions.c next = item->next; next 1398 lib/pacemaker/pcmk_sched_actions.c for (GList *iter = scheduler->actions; iter != NULL; iter = iter->next) { next 1442 lib/pacemaker/pcmk_sched_actions.c for (GList *iter = scheduler->resources; iter != NULL; iter = iter->next) { next 1785 lib/pacemaker/pcmk_sched_actions.c for (GList *iter = sorted_op_list; iter != NULL; iter = iter->next) { next 1863 lib/pacemaker/pcmk_sched_actions.c for (GList *iter = result; iter != NULL; iter = iter->next) { next 1901 lib/pacemaker/pcmk_sched_actions.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { next 436 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 156 lib/pacemaker/pcmk_sched_clone.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 179 lib/pacemaker/pcmk_sched_clone.c for (GList *later = iter->next; next 180 lib/pacemaker/pcmk_sched_clone.c later != NULL; later = later->next) { next 326 lib/pacemaker/pcmk_sched_clone.c for (iter = primary->children; iter != NULL; iter = iter->next) { next 345 lib/pacemaker/pcmk_sched_clone.c for (iter = primary->children; iter != NULL; iter = iter->next) { next 412 lib/pacemaker/pcmk_sched_clone.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 442 lib/pacemaker/pcmk_sched_clone.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 467 lib/pacemaker/pcmk_sched_clone.c child_iter = child_iter->next) { next 505 lib/pacemaker/pcmk_sched_clone.c for (GList *iter = clone->children; iter != NULL; iter = iter->next) { next 530 lib/pacemaker/pcmk_sched_clone.c iter = iter->next) { next 673 lib/pacemaker/pcmk_sched_clone.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 680 lib/pacemaker/pcmk_sched_clone.c member_iter = member_iter->next) { next 216 lib/pacemaker/pcmk_sched_colocation.c for (const GList *iter = addition; iter != NULL; iter = iter->next) { next 276 lib/pacemaker/pcmk_sched_colocation.c for (const GList *iter = addition; iter != NULL; iter = iter->next) { next 1020 lib/pacemaker/pcmk_sched_colocation.c for (iter = rsc->actions; iter != NULL; iter = iter->next) { next 1034 lib/pacemaker/pcmk_sched_colocation.c for (iter = rsc->children; iter != NULL; iter = iter->next) { next 1080 lib/pacemaker/pcmk_sched_colocation.c for (iter = rsc->children; iter != NULL; iter = iter->next) { next 1099 lib/pacemaker/pcmk_sched_colocation.c for (iter = colocations; iter != NULL; iter = iter->next) { next 1727 lib/pacemaker/pcmk_sched_colocation.c for (GList *iter = colocations; iter != NULL; iter = iter->next) { next 112 lib/pacemaker/pcmk_sched_constraints.c for (GList *iter = rsc_list; iter != NULL; iter = iter->next) { next 275 lib/pacemaker/pcmk_sched_constraints.c for (iter = tag->refs; iter != NULL; iter = iter->next) { next 308 lib/pacemaker/pcmk_sched_constraints.c for (iter = tag_refs; iter != NULL; iter = iter->next) { next 373 lib/pacemaker/pcmk_sched_constraints.c for (GList *iter = tag->refs; iter != NULL; iter = iter->next) { next 419 lib/pacemaker/pcmk_sched_constraints.c for (GList *iter = scheduler->resources; iter != NULL; iter = iter->next) { next 62 lib/pacemaker/pcmk_sched_fencing.c for (GList *iter = rsc->actions; iter != NULL; iter = iter->next) { next 142 lib/pacemaker/pcmk_sched_fencing.c for (iter = action_list; iter != NULL; iter = iter->next) { next 213 lib/pacemaker/pcmk_sched_fencing.c for (iter = action_list; iter != NULL; iter = iter->next) { next 259 lib/pacemaker/pcmk_sched_fencing.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 291 lib/pacemaker/pcmk_sched_fencing.c for (GList *r = scheduler->resources; r != NULL; r = r->next) { next 69 lib/pacemaker/pcmk_sched_group.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 122 lib/pacemaker/pcmk_sched_group.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 374 lib/pacemaker/pcmk_sched_group.c for (GList *iter = dependent->children; iter != NULL; iter = iter->next) { next 438 lib/pacemaker/pcmk_sched_group.c iter = iter->next) { next 497 lib/pacemaker/pcmk_sched_group.c for (GList *iter = action->rsc->children; iter != NULL; iter = iter->next) { next 586 lib/pacemaker/pcmk_sched_group.c for (GList *iter = then->rsc->children; iter != NULL; iter = iter->next) { next 627 lib/pacemaker/pcmk_sched_group.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 668 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 726 lib/pacemaker/pcmk_sched_group.c for (const GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 774 lib/pacemaker/pcmk_sched_group.c iter != NULL; iter = iter->next) { next 788 lib/pacemaker/pcmk_sched_group.c for (const GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 799 lib/pacemaker/pcmk_sched_group.c cons_iter = cons_iter->next) { next 917 lib/pacemaker/pcmk_sched_group.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 945 lib/pacemaker/pcmk_sched_group.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 96 lib/pacemaker/pcmk_sched_instances.c child_iter != NULL; child_iter = child_iter->next) { next 148 lib/pacemaker/pcmk_sched_instances.c for (const GList *iter = colocations; iter != NULL; iter = iter->next) { next 160 lib/pacemaker/pcmk_sched_instances.c for (const GList *iter = colocations; iter != NULL; iter = iter->next) { next 251 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 807 lib/pacemaker/pcmk_sched_instances.c iter = iter->next) { next 826 lib/pacemaker/pcmk_sched_instances.c for (iter = instances; iter != NULL; iter = iter->next) { next 903 lib/pacemaker/pcmk_sched_instances.c iter = iter->next) { next 920 lib/pacemaker/pcmk_sched_instances.c iter = iter->next) { next 987 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = instances; iter != NULL; iter = iter->next) { next 1134 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = instances; iter != NULL; iter = iter->next) { next 1188 lib/pacemaker/pcmk_sched_instances.c iter = iter->next) { next 1387 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = instances; iter != NULL; iter = iter->next) { next 1534 lib/pacemaker/pcmk_sched_instances.c after_iter != NULL; after_iter = after_iter->next) { next 1590 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = instances; iter != NULL; iter = iter->next) { next 1629 lib/pacemaker/pcmk_sched_instances.c for (const GList *iter = instances; iter != NULL; iter = iter->next) { next 132 lib/pacemaker/pcmk_sched_location.c for (iter = nodes; iter != NULL; iter = iter->next) { next 139 lib/pacemaker/pcmk_sched_location.c for (iter = rsc->cluster->nodes; iter != NULL; iter = iter->next) { next 322 lib/pacemaker/pcmk_sched_location.c iter = iter->next) { next 603 lib/pacemaker/pcmk_sched_location.c iter != NULL; iter = iter->next) { next 648 lib/pacemaker/pcmk_sched_location.c iter != NULL; iter = iter->next) { next 125 lib/pacemaker/pcmk_sched_nodes.c for (const GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 155 lib/pacemaker/pcmk_sched_nodes.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 174 lib/pacemaker/pcmk_sched_nodes.c for (const GList *iter = list; iter != NULL; iter = iter->next) { next 377 lib/pacemaker/pcmk_sched_nodes.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { next 389 lib/pacemaker/pcmk_sched_nodes.c for (GList *r = scheduler->resources; r != NULL; r = r->next) { next 354 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = rsc_first->children; iter != NULL; iter = iter->next) { next 644 lib/pacemaker/pcmk_sched_ordering.c set_iter = set_iter->next; next 651 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = set_iter; iter != NULL; iter = iter->next) { next 682 lib/pacemaker/pcmk_sched_ordering.c set_iter = set_iter->next; next 1107 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = scheduler->actions; iter != NULL; iter = iter->next) { next 1112 lib/pacemaker/pcmk_sched_ordering.c input_iter != NULL; input_iter = input_iter->next) { next 1133 lib/pacemaker/pcmk_sched_ordering.c iter != NULL; iter = iter->next) { next 1270 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = then_actions; iter != NULL; iter = iter->next) { next 1353 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = first_actions; iter != NULL; iter = iter->next) { next 1408 lib/pacemaker/pcmk_sched_ordering.c iter != NULL; iter = iter->next) { next 1452 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = list; iter != NULL; iter = iter->next) { next 253 lib/pacemaker/pcmk_sched_primitive.c for (GList *iter = nodes->next; iter; iter = iter->next) { next 433 lib/pacemaker/pcmk_sched_primitive.c for (iter = this_with_colocations; iter != NULL; iter = iter->next) { next 441 lib/pacemaker/pcmk_sched_primitive.c for (iter = with_this_colocations; iter != NULL; iter = iter->next) { next 454 lib/pacemaker/pcmk_sched_primitive.c for (iter = this_with_colocations; iter != NULL; iter = iter->next) { next 462 lib/pacemaker/pcmk_sched_primitive.c for (iter = with_this_colocations; iter != NULL; iter = iter->next) { next 1013 lib/pacemaker/pcmk_sched_primitive.c for (GList *item = allowed_nodes; item; item = item->next) { next 1139 lib/pacemaker/pcmk_sched_primitive.c for (GList *iter = rsc->rsc_cons_lhs; iter != NULL; iter = iter->next) { next 1169 lib/pacemaker/pcmk_sched_primitive.c for (GList *iter = rsc->rsc_cons; iter != NULL; iter = iter->next) { next 1228 lib/pacemaker/pcmk_sched_primitive.c for (GList *iter = rsc->running_on; iter != NULL; iter = iter->next) { next 1355 lib/pacemaker/pcmk_sched_primitive.c for (iter = action_list; iter != NULL; iter = iter->next) { next 1386 lib/pacemaker/pcmk_sched_primitive.c for (iter = action_list; iter != NULL; iter = iter->next) { next 1411 lib/pacemaker/pcmk_sched_primitive.c for (GList *iter = rsc->running_on; iter != NULL; iter = iter->next) { next 57 lib/pacemaker/pcmk_sched_probes.c for (GList *iter = rscs; iter != NULL; iter = iter->next) { next 344 lib/pacemaker/pcmk_sched_probes.c iter = iter->next) { next 439 lib/pacemaker/pcmk_sched_probes.c probe_iter = probe_iter->next) { next 444 lib/pacemaker/pcmk_sched_probes.c then_iter = then_iter->next) { next 501 lib/pacemaker/pcmk_sched_probes.c then_iter = then_iter->next) { next 582 lib/pacemaker/pcmk_sched_probes.c for (iter = then_actions; iter != NULL; iter = iter->next) { next 614 lib/pacemaker/pcmk_sched_probes.c for (iter = after->actions_after; iter != NULL; iter = iter->next) { next 673 lib/pacemaker/pcmk_sched_probes.c for (GList *iter = scheduler->actions; iter != NULL; iter = iter->next) { next 704 lib/pacemaker/pcmk_sched_probes.c for (GList *iter = probes; iter != NULL; iter = iter->next) { next 708 lib/pacemaker/pcmk_sched_probes.c then_iter = then_iter->next) { next 762 lib/pacemaker/pcmk_sched_probes.c for (GList *iter = scheduler->resources; iter != NULL; iter = iter->next) { next 784 lib/pacemaker/pcmk_sched_probes.c actions = actions->next) { next 794 lib/pacemaker/pcmk_sched_probes.c clone_actions = clone_actions->next) { next 829 lib/pacemaker/pcmk_sched_probes.c probe_iter = probe_iter->next) { next 864 lib/pacemaker/pcmk_sched_probes.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { next 88 lib/pacemaker/pcmk_sched_promotable.c for (iter = rsc->children; iter != NULL; iter = iter->next) { next 95 lib/pacemaker/pcmk_sched_promotable.c for (iter = rsc->actions; iter != NULL; iter = iter->next) { next 132 lib/pacemaker/pcmk_sched_promotable.c for (const GList *iter = location_constraints; iter; iter = iter->next) { next 173 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 457 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = clone->children; iter != NULL; iter = iter->next) { next 505 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = clone->children; iter; iter = iter->next) { next 534 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = clone->children; iter; iter = iter->next) { next 702 lib/pacemaker/pcmk_sched_promotable.c iter != NULL; iter = iter->next) { next 769 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 975 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = list; iter != NULL; iter = iter->next) { next 1081 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = clone->children; iter != NULL; iter = iter->next) { next 1102 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = clone->children; iter != NULL; iter = iter->next) { next 1144 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = clone->children; iter != NULL; iter = iter->next) { next 1224 lib/pacemaker/pcmk_sched_promotable.c for (GList *iter = primary->children; iter != NULL; iter = iter->next) { next 220 lib/pacemaker/pcmk_sched_recurring.c iter != NULL; iter = iter->next) { next 426 lib/pacemaker/pcmk_sched_recurring.c for (GList *iter = probes; iter != NULL; iter = iter->next) { next 447 lib/pacemaker/pcmk_sched_recurring.c for (GList *iter = stop_ops; iter != NULL; iter = iter->next) { next 503 lib/pacemaker/pcmk_sched_recurring.c for (GList *iter = rsc->cluster->nodes; iter != NULL; iter = iter->next) { next 407 lib/pacemaker/pcmk_sched_remote.c for (GList *iter = scheduler->actions; iter != NULL; iter = iter->next) { next 464 lib/pacemaker/pcmk_sched_remote.c item = item->next) { next 163 lib/pacemaker/pcmk_sched_resource.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 188 lib/pacemaker/pcmk_sched_resource.c for (GList *iter = scheduler->resources; iter != NULL; iter = iter->next) { next 263 lib/pacemaker/pcmk_sched_resource.c for (iter = colocations; iter != NULL; iter = iter->next) { next 281 lib/pacemaker/pcmk_sched_resource.c for (iter = colocations; iter != NULL; iter = iter->next) { next 319 lib/pacemaker/pcmk_sched_resource.c pcmk_node_t *next = NULL; next 327 lib/pacemaker/pcmk_sched_resource.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 335 lib/pacemaker/pcmk_sched_resource.c next = rsc->allocated_to; next 351 lib/pacemaker/pcmk_sched_resource.c out->message(out, "rsc-action", rsc, current, next); next 412 lib/pacemaker/pcmk_sched_resource.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 460 lib/pacemaker/pcmk_sched_resource.c for (GList *iter = rsc->actions; iter != NULL; iter = iter->next) { next 554 lib/pacemaker/pcmk_sched_resource.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 724 lib/pacemaker/pcmk_sched_resource.c for (const GList *iter = nodes; iter != NULL; iter = iter->next) { next 77 lib/pacemaker/pcmk_sched_tickets.c for (iter = rsc->children; iter != NULL; iter = iter->next) { next 111 lib/pacemaker/pcmk_sched_tickets.c for (iter = rsc->running_on; iter != NULL; iter = iter->next) { next 522 lib/pacemaker/pcmk_sched_tickets.c for (GList *item = rsc->rsc_tickets; item != NULL; item = item->next) { next 278 lib/pacemaker/pcmk_sched_utilization.c for (GList *iter = rscs; iter != NULL; iter = iter->next) { next 428 lib/pacemaker/pcmk_sched_utilization.c for (iter = rsc->running_on; iter != NULL; iter = iter->next) { next 435 lib/pacemaker/pcmk_sched_utilization.c for (iter = allowed_nodes; iter; iter = iter->next) { next 461 lib/pacemaker/pcmk_sched_utilization.c iter != NULL; iter = iter->next) { next 237 lib/pacemaker/pcmk_scheduler.c for (GList *iter = scheduler->resources; iter != NULL; iter = iter->next) { next 258 lib/pacemaker/pcmk_scheduler.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { next 287 lib/pacemaker/pcmk_scheduler.c node_iter = node_iter->next) { next 289 lib/pacemaker/pcmk_scheduler.c rsc_iter = rsc_iter->next) { next 320 lib/pacemaker/pcmk_scheduler.c for (iter = scheduler->resources; iter != NULL; iter = iter->next) { next 332 lib/pacemaker/pcmk_scheduler.c for (iter = scheduler->resources; iter != NULL; iter = iter->next) { next 366 lib/pacemaker/pcmk_scheduler.c for (GList *iter = rsc->cluster->nodes; iter != NULL; iter = iter->next) { next 412 lib/pacemaker/pcmk_scheduler.c for (GList *iter = scheduler->resources; iter != NULL; iter = iter->next) { next 433 lib/pacemaker/pcmk_scheduler.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 453 lib/pacemaker/pcmk_scheduler.c iter != NULL; iter = iter->next) { next 562 lib/pacemaker/pcmk_scheduler.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { next 664 lib/pacemaker/pcmk_scheduler.c for (GList *item = scheduler->resources; item != NULL; item = item->next) { next 719 lib/pacemaker/pcmk_scheduler.c iter != NULL; iter = iter->next) { next 233 lib/pacemaker/pcmk_simulate.c for (iter = scheduler->actions; iter != NULL; iter = iter->next) { next 274 lib/pacemaker/pcmk_simulate.c for (iter = scheduler->actions; iter != NULL; iter = iter->next) { next 278 lib/pacemaker/pcmk_simulate.c before_iter != NULL; before_iter = before_iter->next) { next 593 lib/pacemaker/pcmk_simulate.c iter != NULL; iter = iter->next) { next 321 lib/pacemaker/pcmk_status.c for (GList *iter = scheduler->nodes; iter != NULL; iter = 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 498 lib/pengine/bundle.c for (GList *iter = data->mounts; iter != NULL; iter = iter->next) { next 536 lib/pengine/bundle.c for (GList *iter = data->ports; iter != NULL; iter = iter->next) { next 908 lib/pengine/bundle.c gIter = gIter->next) { next 1219 lib/pengine/bundle.c childIter = childIter->next) { next 1264 lib/pengine/bundle.c gIter = gIter->next) { next 1325 lib/pengine/bundle.c for (iter = bundle_data->replicas; iter != NULL; iter = iter->next) { next 1374 lib/pengine/bundle.c gIter = gIter->next) { next 1434 lib/pengine/bundle.c gIter = gIter->next) { next 1478 lib/pengine/bundle.c gIter = gIter->next) { next 1631 lib/pengine/bundle.c gIter = gIter->next) { next 1765 lib/pengine/bundle.c gIter = gIter->next) { next 1911 lib/pengine/bundle.c gIter = gIter->next) { next 2050 lib/pengine/bundle.c for (GList *item = bundle_data->replicas; item != NULL; item = item->next) { next 2080 lib/pengine/bundle.c for (GList *gIter = bundle_data->replicas; gIter != NULL; gIter = gIter->next) { next 2119 lib/pengine/bundle.c for (GList *iter = data->replicas; iter != NULL; iter = iter->next) { next 2154 lib/pengine/bundle.c for (iter = data->replicas; iter != NULL; iter = iter->next) { next 2180 lib/pengine/bundle.c for (iter = containers; iter != NULL; iter = iter->next) { next 2184 lib/pengine/bundle.c node_iter = node_iter->next) { next 163 lib/pengine/clone.c for (const GList *iter = list; iter != NULL; iter = iter->next) { next 446 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 547 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 571 lib/pengine/clone.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 633 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 716 lib/pengine/clone.c for (gIter = promoted_list; gIter; gIter = gIter->next) { next 732 lib/pengine/clone.c for (gIter = started_list; gIter; gIter = gIter->next) { next 787 lib/pengine/clone.c for (nIter = list; nIter != NULL; nIter = nIter->next) { next 846 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 926 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 1027 lib/pengine/clone.c for (gIter = promoted_list; gIter; gIter = gIter->next) { next 1050 lib/pengine/clone.c for (gIter = started_list; gIter; gIter = gIter->next) { next 1109 lib/pengine/clone.c for (nIter = list; nIter != NULL; nIter = nIter->next) { next 1145 lib/pengine/clone.c for (GList *status_iter = list; status_iter != NULL; status_iter = status_iter->next) { next 1188 lib/pengine/clone.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 1219 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 1268 lib/pengine/clone.c iter != NULL; iter = iter->next) { next 179 lib/pengine/complex.c for (xmlAttrPtr a = pcmk__xe_first_attr(rsc->xml); a != NULL; a = a->next) { next 1116 lib/pengine/complex.c for (GList *iter = rsc->running_on; iter != NULL; iter = iter->next) { next 1159 lib/pengine/complex.c for (GList *item = rsc->children; item != NULL; item = item->next) { next 104 lib/pengine/group.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 242 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 275 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 320 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 363 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 436 lib/pengine/group.c for (GList *gIter = rsc->children; gIter; gIter = gIter->next) { next 462 lib/pengine/group.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 482 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 512 lib/pengine/group.c iter != NULL; iter = iter->next) { next 74 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 96 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 167 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 254 lib/pengine/native.c for (GList *iter = rsc->running_on; iter; iter = iter->next) { next 316 lib/pengine/native.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 353 lib/pengine/native.c for (GList *gIter = rsc->running_on; gIter != NULL; gIter = gIter->next) { next 516 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 703 lib/pengine/native.c for (GList *iter = rsc->running_on; iter != NULL; iter = iter->next) { next 885 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 1020 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 1125 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 1145 lib/pengine/native.c if (result && (result->next == NULL)) { next 1152 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 1170 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 1211 lib/pengine/native.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 1347 lib/pengine/native.c for (GList *gIter = sorted_rscs; gIter; gIter = gIter->next) { next 1361 lib/pengine/native.c for (GList *gIter2 = sorted_nodes; gIter2; gIter2 = gIter2->next) { next 761 lib/pengine/pe_actions.c attr != NULL; attr = attr->next) { next 1174 lib/pengine/pe_actions.c for (GList *gIter = candidates; gIter != NULL; gIter = gIter->next) { next 1222 lib/pengine/pe_actions.c for (gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { next 1299 lib/pengine/pe_actions.c for (GList *gIter = matches; gIter != NULL; gIter = gIter->next) { next 1491 lib/pengine/pe_actions.c for (const GList *gIter = input; gIter != NULL; gIter = gIter->next) { next 1522 lib/pengine/pe_actions.c for (; gIter != NULL; gIter = gIter->next) { next 1559 lib/pengine/pe_actions.c for (GList *gIter = input; gIter != NULL; gIter = gIter->next) { next 130 lib/pengine/pe_notif.c for (const GList *iter = list; iter != NULL; iter = iter->next) { next 194 lib/pengine/pe_notif.c for (GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 264 lib/pengine/pe_notif.c for (const GSList *item = n_data->keys; item; item = item->next) { next 389 lib/pengine/pe_notif.c for (GList *iter = rsc->actions; iter != NULL; iter = iter->next) { next 560 lib/pengine/pe_notif.c for (iter = rsc->children; iter != NULL; iter = iter->next) { next 610 lib/pengine/pe_notif.c for (iter = rsc->actions; iter != NULL; iter = iter->next) { next 821 lib/pengine/pe_notif.c for (iter = rsc->actions; iter != NULL; iter = iter->next) { next 879 lib/pengine/pe_notif.c for (iter = rsc->running_on; iter != NULL; iter = iter->next) { next 69 lib/pengine/pe_output.c for (gIter = rsc_list; gIter != NULL; gIter = gIter->next) { next 365 lib/pengine/pe_output.c for (GList *gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { next 719 lib/pengine/pe_output.c gIter != NULL; gIter = gIter->next) { next 734 lib/pengine/pe_output.c for (gIter2 = location->node_list_rh; gIter2 != NULL; gIter2 = gIter2->next) { next 1688 lib/pengine/pe_output.c for (lpc2 = node->details->running_rsc; lpc2 != NULL; lpc2 = lpc2->next) { next 1832 lib/pengine/pe_output.c for (gIter2 = node->details->running_rsc; gIter2 != NULL; gIter2 = gIter2->next) { next 1922 lib/pengine/pe_output.c for (lpc = node->details->running_rsc; lpc != NULL; lpc = lpc->next) { next 2149 lib/pengine/pe_output.c for (GList *gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { next 2178 lib/pengine/pe_output.c for (GList *aIter = attr_list; aIter != NULL; aIter = aIter->next) { next 2334 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { next 2369 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { next 2465 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { next 2826 lib/pengine/pe_output.c for (rsc_iter = scheduler->resources; rsc_iter != NULL; rsc_iter = rsc_iter->next) { next 2912 lib/pengine/pe_output.c for (gIter = op_list; gIter != NULL; gIter = gIter->next) { next 72 lib/pengine/remote.c for (GList *gIter = rsc->fillers; gIter != NULL; gIter = gIter->next) { next 131 lib/pengine/remote.c for (iter = host->details->running_rsc; iter != NULL; iter = iter->next) { next 259 lib/pengine/remote.c item != NULL; item = item->next) { next 139 lib/pengine/status.c item = item->next) { next 170 lib/pengine/status.c iterator = iterator->next; next 185 lib/pengine/status.c iterator = iterator->next; next 195 lib/pengine/status.c for (GList *iterator = nodes; iterator != NULL; iterator = iterator->next) { next 240 lib/pengine/status.c iterator = iterator->next; next 259 lib/pengine/status.c iterator = iterator->next; next 401 lib/pengine/status.c for (rIter = rsc_list; id && rIter; rIter = rIter->next) { next 450 lib/pengine/status.c for (const GList *iter = nodes; iter != NULL; iter = iter->next) { next 475 lib/pengine/status.c for (const GList *iter = nodes; iter != NULL; iter = iter->next) { next 35 lib/pengine/tags.c for (GList *refs = ((pcmk_tag_t *) value)->refs; refs; refs = refs->next) { next 68 lib/pengine/tags.c for (GList *refs = ((pcmk_tag_t *) value)->refs; refs; refs = refs->next) { next 58 lib/pengine/tests/native/native_find_rsc_test.c for (GList *iter = scheduler->resources; iter != NULL; iter = iter->next) { next 121 lib/pengine/tests/native/native_find_rsc_test.c for (GList *iter = scheduler->resources; iter != NULL; iter = iter->next) { next 214 lib/pengine/tests/native/native_find_rsc_test.c for (GList *iter = exim_group->children; iter != NULL; iter = iter->next) { next 255 lib/pengine/tests/native/native_find_rsc_test.c for (GList *iter = inactive_group->children; iter != NULL; iter = iter->next) { next 355 lib/pengine/tests/native/native_find_rsc_test.c for (GList *iter = promotable_clone->children; iter != NULL; iter = iter->next) { next 494 lib/pengine/tests/native/native_find_rsc_test.c for (GList *iter = promotable_clone->children; iter != NULL; iter = iter->next) { next 713 lib/pengine/tests/native/native_find_rsc_test.c for (GList *iter = mysql_clone_group->children; iter != NULL; iter = iter->next) { next 851 lib/pengine/tests/native/native_find_rsc_test.c for (GList *iter = mysql_clone_group->children; iter != NULL; iter = iter->next) { next 855 lib/pengine/tests/native/native_find_rsc_test.c for (GList *iter2 = rsc->children; iter2 != NULL; iter2 = iter2->next) { next 52 lib/pengine/tests/native/pe_base_name_eq_test.c for (GList *iter = scheduler->resources; iter != NULL; iter = iter->next) { next 62 lib/pengine/tests/native/pe_base_name_eq_test.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 72 lib/pengine/tests/native/pe_base_name_eq_test.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 860 lib/pengine/unpack.c for (gIter = scheduler->resources; gIter != NULL; gIter = gIter->next) { next 958 lib/pengine/unpack.c for (xIter = xml_ticket->properties; xIter; xIter = xIter->next) { next 1354 lib/pengine/unpack.c for (GList *item = scheduler->stop_needed; item; item = item->next) { next 1370 lib/pengine/unpack.c for (GList *gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { next 1999 lib/pengine/unpack.c for (rIter = parent->children; rsc == NULL && rIter; rIter = rIter->next) { next 2024 lib/pengine/unpack.c CRM_LOG_ASSERT(locations->next == NULL); next 2448 lib/pengine/unpack.c for (; gIter != NULL; gIter = gIter->next) { next 2484 lib/pengine/unpack.c for (; gIter != NULL; gIter = gIter->next) { next 2544 lib/pengine/unpack.c for (const GList *iter = sorted_op_list; iter != NULL; iter = iter->next) { next 2685 lib/pengine/unpack.c for (gIter = sorted_op_list; gIter != NULL; gIter = gIter->next) { next 3421 lib/pengine/unpack.c xIter != NULL; xIter = xIter->next) { next 4991 lib/pengine/unpack.c for (gIter = sorted_op_list; gIter != NULL; gIter = gIter->next) { next 44 lib/pengine/utils.c for (GList *n = rsc->running_on; n != NULL; n = n->next) { next 121 lib/pengine/utils.c for (const GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 186 lib/pengine/utils.c for (const GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 272 lib/pengine/utils.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 340 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 369 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 473 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 555 lib/pengine/utils.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 564 lib/pengine/utils.c for (GList *lpc = scheduler->resources; lpc != NULL; lpc = lpc->next) { next 574 lib/pengine/utils.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 636 lib/pengine/utils.c for (gIter = tag->refs; gIter != NULL; gIter = gIter->next) { next 763 lib/pengine/utils.c for (GList *ele = rsc->running_on; ele; ele = ele->next) { next 785 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 915 lib/services/services.c for (gIter = inflight_ops; gIter != NULL; gIter = gIter->next) { next 941 lib/services/services.c for (gIter = blocked_ops; gIter != NULL; gIter = gIter->next) { next 954 lib/services/services.c for (gIter = executed_ops; gIter != NULL; gIter = gIter->next) { next 1184 lib/services/services.c for (iter = standards; iter != NULL; iter = iter->next) { next 1200 lib/services/services.c for (iter = providers; iter != NULL; iter = iter->next) { next 140 lib/services/services_nagios.c for (GList *gIter = plugin_list; gIter != NULL; gIter = gIter->next) { next 72 lib/services/services_ocf.c for (gIter = providers; gIter != NULL; gIter = gIter->next) { next 111 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 94 maint/gnulib/lib/acl-internal.c for (ace = acl->acl_first; count > 0; ace = ace->next, count--) next 117 maint/gnulib/lib/alloca.c union hdr *next; /* For chaining headers. */ next 156 maint/gnulib/lib/alloca.c register header *np = hp->h.next; next 190 maint/gnulib/lib/alloca.c new->h.next = last_alloca_header; next 418 maint/gnulib/lib/argp-help.c struct hol_cluster *next; next 528 maint/gnulib/lib/argp-help.c cl->next = hol->clusters; next 542 maint/gnulib/lib/argp-help.c struct hol_cluster *next = cl->next; next 544 maint/gnulib/lib/argp-help.c cl = next; next 942 maint/gnulib/lib/argp-help.c cl_end = &(*cl_end)->next; next 517 maint/gnulib/lib/argp-parse.c parser->state.next = 0; /* Tell getopt to initialize. */ next 582 maint/gnulib/lib/argp-parse.c if (parser->state.next == parser->state.argc) next 601 maint/gnulib/lib/argp-parse.c *end_index = parser->state.next; next 605 maint/gnulib/lib/argp-parse.c *end_index = parser->state.next; next 671 maint/gnulib/lib/argp-parse.c int index = --parser->state.next; next 681 maint/gnulib/lib/argp-parse.c parser->state.next++; /* For ARGP_KEY_ARG, consume the arg. */ next 688 maint/gnulib/lib/argp-parse.c parser->state.next--; /* For ARGP_KEY_ARGS, put back the arg. */ next 700 maint/gnulib/lib/argp-parse.c parser->state.next = parser->state.argc; next 702 maint/gnulib/lib/argp-parse.c if (parser->state.next > index) next 706 maint/gnulib/lib/argp-parse.c (--group)->args_processed += (parser->state.next - index); next 787 maint/gnulib/lib/argp-parse.c if (parser->state.quoted && parser->state.next < parser->state.quoted) next 798 maint/gnulib/lib/argp-parse.c parser->opt_data.optind = parser->state.next; next 810 maint/gnulib/lib/argp-parse.c parser->state.next = parser->opt_data.optind; next 817 maint/gnulib/lib/argp-parse.c if (parser->state.next > 1 next 818 maint/gnulib/lib/argp-parse.c && strcmp (parser->state.argv[parser->state.next - 1], QUOTE) next 824 maint/gnulib/lib/argp-parse.c parser->state.quoted = parser->state.next; next 841 maint/gnulib/lib/argp-parse.c if (parser->state.next >= parser->state.argc next 852 maint/gnulib/lib/argp-parse.c parser->opt_data.optarg = parser->state.argv[parser->state.next++]; next 319 maint/gnulib/lib/argp.h int next; next 213 maint/gnulib/lib/bitset.c bitset_bindex next = bitno; next 215 maint/gnulib/lib/bitset.c if (!bitset_list (src, &val, 1, &next)) next 232 maint/gnulib/lib/bitset.c bitset_bindex next = bitno; next 234 maint/gnulib/lib/bitset.c if (!bitset_list_reverse (src, &val, 1, &next)) next 261 maint/gnulib/lib/bitset.c bitset_bindex next = 0; next 263 maint/gnulib/lib/bitset.c if (bitset_list (src, val, 2, &next) != 1) next 354 maint/gnulib/lib/bitset.c bitset_bindex next = 0; next 356 maint/gnulib/lib/bitset.c while ((num = bitset_list (src, list, BITSET_LIST_SIZE, &next))) next 93 maint/gnulib/lib/bitset.h bitset_bindex next; next 321 maint/gnulib/lib/bitset.h for (ITER.next = (MIN), ITER.num = BITSET_LIST_SIZE; \ next 324 maint/gnulib/lib/bitset.h BITSET_LIST_SIZE, &ITER.next));) \ next 341 maint/gnulib/lib/bitset.h for (ITER.next = (MIN), ITER.num = BITSET_LIST_SIZE; \ next 344 maint/gnulib/lib/bitset.h BITSET_LIST_SIZE, &ITER.next));) \ next 50 maint/gnulib/lib/bitset/array.c bitset_bindex num, bitset_bindex *next) next 59 maint/gnulib/lib/bitset/array.c bitset_bindex bitno = *next; next 76 maint/gnulib/lib/bitset/array.c *next = bitno + pos + 1; next 80 maint/gnulib/lib/bitset/array.c *next = bitno + BITSET_WORD_BITS; next 124 maint/gnulib/lib/bitset/array.c bitset_bindex num, bitset_bindex *next) next 126 maint/gnulib/lib/bitset/array.c bitset_bindex rbitno = *next; next 155 maint/gnulib/lib/bitset/array.c *next = n_bits - (bitoff + pos); next 164 maint/gnulib/lib/bitset/array.c *next = n_bits - (bitoff + 1); next 174 maint/gnulib/lib/bitset/array.c bitset_bindex num, bitset_bindex *next) next 181 maint/gnulib/lib/bitset/array.c bitset_bindex bitno = *next; next 217 maint/gnulib/lib/bitset/array.c *next = bitno + pos + 1; next 242 maint/gnulib/lib/bitset/array.c *next = bitoff + pos + 1; next 248 maint/gnulib/lib/bitset/array.c *next = bitoff; next 64 maint/gnulib/lib/bitset/list.c struct lbitset_elt_struct *next; /* Next element. */ next 101 maint/gnulib/lib/bitset/list.c lbitset_free_list = elt->next; next 158 maint/gnulib/lib/bitset/list.c elt->next = lbitset_free_list; next 167 maint/gnulib/lib/bitset/list.c lbitset_elt *next = elt->next; next 171 maint/gnulib/lib/bitset/list.c prev->next = next; next 173 maint/gnulib/lib/bitset/list.c if (next) next 174 maint/gnulib/lib/bitset/list.c next->prev = prev; next 177 maint/gnulib/lib/bitset/list.c LBITSET_HEAD (bset) = next; next 186 maint/gnulib/lib/bitset/list.c if (next) next 188 maint/gnulib/lib/bitset/list.c bset->b.cdata = next->words; next 189 maint/gnulib/lib/bitset/list.c bset->b.cindex = next->index; next 220 maint/gnulib/lib/bitset/list.c elt->prev->next = 0; next 230 maint/gnulib/lib/bitset/list.c lbitset_elt *next; next 231 maint/gnulib/lib/bitset/list.c for (; elt; elt = next) next 233 maint/gnulib/lib/bitset/list.c next = elt->next; next 261 maint/gnulib/lib/bitset/list.c elt->next = elt->prev = 0; next 276 maint/gnulib/lib/bitset/list.c ptr->prev->next = elt; next 281 maint/gnulib/lib/bitset/list.c elt->next = ptr; next 290 maint/gnulib/lib/bitset/list.c ptr->next && ptr->next->index < windex; ptr = ptr->next) next 293 maint/gnulib/lib/bitset/list.c if (ptr->next) next 294 maint/gnulib/lib/bitset/list.c ptr->next->prev = elt; next 298 maint/gnulib/lib/bitset/list.c elt->next = ptr->next; next 300 maint/gnulib/lib/bitset/list.c ptr->next = elt; next 340 maint/gnulib/lib/bitset/list.c elt->next && (elt->index + LBITSET_ELT_WORDS - 1) < windex; next 341 maint/gnulib/lib/bitset/list.c elt = elt->next) next 381 maint/gnulib/lib/bitset/list.c lbitset_elt *next; next 382 maint/gnulib/lib/bitset/list.c for (lbitset_elt *elt = LBITSET_HEAD (bset); elt; elt = next) next 384 maint/gnulib/lib/bitset/list.c next = elt->next; next 416 maint/gnulib/lib/bitset/list.c selt && delt; selt = selt->next, delt = delt->next) next 444 maint/gnulib/lib/bitset/list.c for (lbitset_elt *elt = head; elt; elt = elt->next) next 449 maint/gnulib/lib/bitset/list.c tmp->next = 0; next 451 maint/gnulib/lib/bitset/list.c prev->next = tmp; next 560 maint/gnulib/lib/bitset/list.c bitset_bindex num, bitset_bindex *next) next 567 maint/gnulib/lib/bitset/list.c bitset_bindex rbitno = *next; next 618 maint/gnulib/lib/bitset/list.c *next = n_bits - (bitoff + pos); next 634 maint/gnulib/lib/bitset/list.c *next = n_bits - (bitoff + 1); next 644 maint/gnulib/lib/bitset/list.c bitset_bindex num, bitset_bindex *next) next 653 maint/gnulib/lib/bitset/list.c bitset_bindex bitno = *next; next 672 maint/gnulib/lib/bitset/list.c elt = elt->next) next 697 maint/gnulib/lib/bitset/list.c *next = bitno + pos + 1; next 704 maint/gnulib/lib/bitset/list.c elt = elt->next; next 761 maint/gnulib/lib/bitset/list.c *next = bitno + pos + 1; next 770 maint/gnulib/lib/bitset/list.c elt = elt->next; next 778 maint/gnulib/lib/bitset/list.c *next = bitno; next 787 maint/gnulib/lib/bitset/list.c lbitset_elt *next; next 789 maint/gnulib/lib/bitset/list.c for (elt = LBITSET_HEAD (dst); elt; elt = next) next 791 maint/gnulib/lib/bitset/list.c next = elt->next; next 873 maint/gnulib/lib/bitset/list.c selt || delt; selt = selt->next, delt = delt->next) next 883 maint/gnulib/lib/bitset/list.c lbitset_zero_elts[2].next = delt; next 888 maint/gnulib/lib/bitset/list.c lbitset_zero_elts[1].next = selt; next 906 maint/gnulib/lib/bitset/list.c selt && delt; selt = selt->next, delt = delt->next) next 912 maint/gnulib/lib/bitset/list.c lbitset_zero_elts[2].next = delt; next 917 maint/gnulib/lib/bitset/list.c lbitset_zero_elts[1].next = selt; next 960 maint/gnulib/lib/bitset/list.c selt1 = selt1->next; next 962 maint/gnulib/lib/bitset/list.c selt2 = selt2->next; next 970 maint/gnulib/lib/bitset/list.c selt1 = selt1->next; next 978 maint/gnulib/lib/bitset/list.c selt2 = selt2->next; next 989 maint/gnulib/lib/bitset/list.c delt = delt->next; next 995 maint/gnulib/lib/bitset/list.c delt = delt->next; next 1267 maint/gnulib/lib/bitset/list.c for (lbitset_elt *elt = LBITSET_HEAD (bset); elt; elt = elt->next) next 573 maint/gnulib/lib/bitset/stats.c bitset_bindex num, bitset_bindex *next) next 575 maint/gnulib/lib/bitset/stats.c bitset_bindex count = BITSET_LIST_ (bset->s.bset, list, num, next); next 615 maint/gnulib/lib/bitset/stats.c bitset_bindex num, bitset_bindex *next) next 617 maint/gnulib/lib/bitset/stats.c return BITSET_LIST_REVERSE_ (bset->s.bset, list, num, next); next 64 maint/gnulib/lib/bitset/table.c struct tbitset_elt_struct *next; next 96 maint/gnulib/lib/bitset/table.c #define TBITSET_NEXT(ELT) ((ELT)->u.next) next 530 maint/gnulib/lib/bitset/table.c bitset_bindex num, bitset_bindex *next) next 537 maint/gnulib/lib/bitset/table.c bitset_bindex rbitno = *next; next 574 maint/gnulib/lib/bitset/table.c *next = n_bits - (bitoff + pos); next 589 maint/gnulib/lib/bitset/table.c *next = n_bits - (bitoff + 1); next 599 maint/gnulib/lib/bitset/table.c bitset_bindex num, bitset_bindex *next) next 604 maint/gnulib/lib/bitset/table.c bitset_bindex bitno = *next; next 630 maint/gnulib/lib/bitset/table.c *next = bitno + pos + 1; next 698 maint/gnulib/lib/bitset/table.c *next = bitno + pos + 1; next 708 maint/gnulib/lib/bitset/table.c *next = bitno; next 153 maint/gnulib/lib/bitset/vector.c bitset_bindex num, bitset_bindex *next) next 156 maint/gnulib/lib/bitset/vector.c bitset_bindex rbitno = *next; next 185 maint/gnulib/lib/bitset/vector.c *next = n_bits - (bitoff + pos); next 194 maint/gnulib/lib/bitset/vector.c *next = n_bits - (bitoff + 1); next 204 maint/gnulib/lib/bitset/vector.c bitset_bindex num, bitset_bindex *next) next 209 maint/gnulib/lib/bitset/vector.c bitset_bindex bitno = *next; next 251 maint/gnulib/lib/bitset/vector.c *next = bitno + pos + 1; next 276 maint/gnulib/lib/bitset/vector.c *next = bitoff + pos + 1; next 282 maint/gnulib/lib/bitset/vector.c *next = bitoff; next 33 maint/gnulib/lib/dirfd.c struct dirp_fd_list *next; next 46 maint/gnulib/lib/dirfd.c new_dirp_fd->next = dirp_fd_start; next 61 maint/gnulib/lib/dirfd.c dirp_fd_prev = dirp_fd, dirp_fd = dirp_fd->next) next 66 maint/gnulib/lib/dirfd.c dirp_fd_prev->next = dirp_fd->next; next 68 maint/gnulib/lib/dirfd.c dirp_fd_start = dirp_fd_start->next; next 89 maint/gnulib/lib/dirfd.c for (dirp_fd = dirp_fd_start; dirp_fd; dirp_fd = dirp_fd->next) next 103 maint/gnulib/lib/exclude.c struct exclude_segment *next; /* next segment in list */ next 115 maint/gnulib/lib/exclude.c struct pattern_buffer *next; next 136 maint/gnulib/lib/exclude.c pbuf->next = ex->patbuf; next 276 maint/gnulib/lib/exclude.c sp->next = ex->head; next 311 maint/gnulib/lib/exclude.c struct exclude_segment *next = seg->next; next 313 maint/gnulib/lib/exclude.c seg = next; next 318 maint/gnulib/lib/exclude.c struct pattern_buffer *next = pbuf->next; next 321 maint/gnulib/lib/exclude.c pbuf = next; next 480 maint/gnulib/lib/exclude.c for (seg = ex->head; ; seg = seg->next) next 495 maint/gnulib/lib/exclude.c if (! seg->next) next 100 maint/gnulib/lib/fd-hook.c struct fd_hook *next = link->private_next; next 103 maint/gnulib/lib/fd-hook.c if (next != NULL && prev != NULL) next 106 maint/gnulib/lib/fd-hook.c prev->private_next = next; next 107 maint/gnulib/lib/fd-hook.c next->private_prev = prev; next 984 maint/gnulib/lib/fnmatch_loop.c struct patternlist *next; next 1062 maint/gnulib/lib/fnmatch_loop.c newp->next = NULL; \ next 1066 maint/gnulib/lib/fnmatch_loop.c lastp = &newp->next next 1118 maint/gnulib/lib/fnmatch_loop.c while ((list = list->next) != NULL); next 1141 maint/gnulib/lib/fnmatch_loop.c while ((list = list->next) != NULL); next 1152 maint/gnulib/lib/fnmatch_loop.c for (runp = list; runp != NULL; runp = runp->next) next 1187 maint/gnulib/lib/fnmatch_loop.c list = list->next; next 942 maint/gnulib/lib/fts.c next: tmp = p; next 990 maint/gnulib/lib/fts.c goto next; next 52 maint/gnulib/lib/gl_anyhash2.h gl_hash_entry_t next = node->hash_next; next 58 maint/gnulib/lib/gl_anyhash2.h node = next; next 28 maint/gnulib/lib/gl_anylinked_list1.h struct gl_list_node_impl *next; next 64 maint/gnulib/lib/gl_anylinked_list2.h list->root.next = &list->root; next 138 maint/gnulib/lib/gl_anylinked_list2.h tail->next = node; next 141 maint/gnulib/lib/gl_anylinked_list2.h tail->next = &list->root; next 203 maint/gnulib/lib/gl_anylinked_list2.h gl_list_node_t after_removed = node->next; next 204 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) before_removed->next = after_removed; next 223 maint/gnulib/lib/gl_anylinked_list2.h return (node->next != &list->root ? node->next : NULL); next 236 maint/gnulib/lib/gl_anylinked_list2.h return list->root.next; next 262 maint/gnulib/lib/gl_anylinked_list2.h node = list->root.next; next 264 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 288 maint/gnulib/lib/gl_anylinked_list2.h node = list->root.next; next 290 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 318 maint/gnulib/lib/gl_anylinked_list2.h gl_list_node_t after_removed = node->next; next 319 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) before_removed->next = after_removed; next 372 maint/gnulib/lib/gl_anylinked_list2.h for (node = list->root.next; ; node = node->next) next 421 maint/gnulib/lib/gl_anylinked_list2.h node = list->root.next; next 423 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 427 maint/gnulib/lib/gl_anylinked_list2.h node = node->next, end_index--) next 441 maint/gnulib/lib/gl_anylinked_list2.h for (node = list->root.next; node != &list->root; node = node->next) next 465 maint/gnulib/lib/gl_anylinked_list2.h gl_list_node_t node = list->root.next; next 469 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 473 maint/gnulib/lib/gl_anylinked_list2.h for (; end_index > 0; node = node->next, end_index--) next 479 maint/gnulib/lib/gl_anylinked_list2.h for (; end_index > 0; node = node->next, end_index--) next 552 maint/gnulib/lib/gl_anylinked_list2.h node = list->root.next; next 554 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 558 maint/gnulib/lib/gl_anylinked_list2.h node = node->next, index++) next 589 maint/gnulib/lib/gl_anylinked_list2.h gl_list_node_t node = list->root.next; next 592 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 598 maint/gnulib/lib/gl_anylinked_list2.h node = node->next, index++) next 606 maint/gnulib/lib/gl_anylinked_list2.h node = node->next, index++) next 641 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) node->next = list->root.next; next 642 maint/gnulib/lib/gl_anylinked_list2.h node->next->prev = node; next 643 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) list->root.next = node; next 678 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) node->next = &list->root; next 680 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) node->prev->next = node; next 716 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->next = node; next 718 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->prev->next = new_node; next 755 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->next = node->next; next 756 maint/gnulib/lib/gl_anylinked_list2.h new_node->next->prev = new_node; next 757 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) node->next = new_node; next 803 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 805 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->next = node->next; next 806 maint/gnulib/lib/gl_anylinked_list2.h new_node->next->prev = new_node; next 807 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) node->next = new_node; next 817 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->next = node; next 819 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) new_node->prev->next = new_node; next 835 maint/gnulib/lib/gl_anylinked_list2.h gl_list_node_t next; next 844 maint/gnulib/lib/gl_anylinked_list2.h next = node->next; next 846 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) prev->next = next; next 847 maint/gnulib/lib/gl_anylinked_list2.h next->prev = prev; next 873 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 874 maint/gnulib/lib/gl_anylinked_list2.h removed_node = node->next; next 875 maint/gnulib/lib/gl_anylinked_list2.h after_removed = node->next->next; next 876 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) node->next = after_removed; next 891 maint/gnulib/lib/gl_anylinked_list2.h ASYNCSAFE(gl_list_node_t) before_removed->next = node; next 921 maint/gnulib/lib/gl_anylinked_list2.h for (node = list->root.next; node != &list->root; ) next 923 maint/gnulib/lib/gl_anylinked_list2.h gl_list_node_t next = node->next; next 927 maint/gnulib/lib/gl_anylinked_list2.h node = next; next 944 maint/gnulib/lib/gl_anylinked_list2.h result.p = list->root.next; next 992 maint/gnulib/lib/gl_anylinked_list2.h node = list->root.next; next 994 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 1008 maint/gnulib/lib/gl_anylinked_list2.h node = list->root.next; next 1010 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 1013 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 1036 maint/gnulib/lib/gl_anylinked_list2.h iterator->p = node->next; next 1056 maint/gnulib/lib/gl_anylinked_list2.h for (node = list->root.next; node != &list->root; node = node->next) next 1089 maint/gnulib/lib/gl_anylinked_list2.h node = list->root.next; next 1091 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 1109 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 1123 maint/gnulib/lib/gl_anylinked_list2.h for (node = list->root.next, index = 0; next 1125 maint/gnulib/lib/gl_anylinked_list2.h node = node->next, index++) next 1159 maint/gnulib/lib/gl_anylinked_list2.h node = list->root.next; next 1161 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 1179 maint/gnulib/lib/gl_anylinked_list2.h node = node->next; next 1193 maint/gnulib/lib/gl_anylinked_list2.h for (node = list->root.next; node != &list->root; node = node->next) next 1205 maint/gnulib/lib/gl_anylinked_list2.h for (node = list->root.next; node != &list->root; node = node->next) next 157 maint/gnulib/lib/gl_anytreehash_list2.h gl_hash_entry_t next = entry->hash_next; next 167 maint/gnulib/lib/gl_anytreehash_list2.h entry = next; next 233 maint/gnulib/lib/gl_hash_map.c gl_hash_entry_t next = node->hash_next; next 242 maint/gnulib/lib/gl_hash_map.c node = next; next 218 maint/gnulib/lib/gl_hash_set.c gl_hash_entry_t next = node->hash_next; next 225 maint/gnulib/lib/gl_hash_set.c node = next; next 36 maint/gnulib/lib/gl_linkedhash_map.c struct gl_list_node_impl *next; next 105 maint/gnulib/lib/gl_linkedhash_map.c map->root.next = &map->root; next 194 maint/gnulib/lib/gl_linkedhash_map.c ASYNCSAFE(gl_list_node_t) node->next = &map->root; next 196 maint/gnulib/lib/gl_linkedhash_map.c ASYNCSAFE(gl_list_node_t) node->prev->next = node; next 236 maint/gnulib/lib/gl_linkedhash_map.c gl_list_node_t next = node->next; next 238 maint/gnulib/lib/gl_linkedhash_map.c ASYNCSAFE(gl_list_node_t) prev->next = next; next 239 maint/gnulib/lib/gl_linkedhash_map.c next->prev = prev; next 260 maint/gnulib/lib/gl_linkedhash_map.c for (node = map->root.next; node != &map->root; ) next 262 maint/gnulib/lib/gl_linkedhash_map.c gl_list_node_t next = node->next; next 268 maint/gnulib/lib/gl_linkedhash_map.c node = next; next 286 maint/gnulib/lib/gl_linkedhash_map.c result.p = map->root.next; next 306 maint/gnulib/lib/gl_linkedhash_map.c iterator->p = node->next; next 36 maint/gnulib/lib/gl_linkedhash_set.c struct gl_list_node_impl *next; next 102 maint/gnulib/lib/gl_linkedhash_set.c set->root.next = &set->root; next 182 maint/gnulib/lib/gl_linkedhash_set.c ASYNCSAFE(gl_list_node_t) node->next = &set->root; next 184 maint/gnulib/lib/gl_linkedhash_set.c ASYNCSAFE(gl_list_node_t) node->prev->next = node; next 222 maint/gnulib/lib/gl_linkedhash_set.c gl_list_node_t next = node->next; next 224 maint/gnulib/lib/gl_linkedhash_set.c ASYNCSAFE(gl_list_node_t) prev->next = next; next 225 maint/gnulib/lib/gl_linkedhash_set.c next->prev = prev; next 245 maint/gnulib/lib/gl_linkedhash_set.c for (node = set->root.next; node != &set->root; ) next 247 maint/gnulib/lib/gl_linkedhash_set.c gl_list_node_t next = node->next; next 251 maint/gnulib/lib/gl_linkedhash_set.c node = next; next 269 maint/gnulib/lib/gl_linkedhash_set.c result.p = set->root.next; next 287 maint/gnulib/lib/gl_linkedhash_set.c iterator->p = node->next; next 387 maint/gnulib/lib/glob.c const char *next; next 407 maint/gnulib/lib/glob.c next = next_brace_sub (begin + 1, flags); next 408 maint/gnulib/lib/glob.c if (next == NULL) next 419 maint/gnulib/lib/glob.c rest = next; next 444 maint/gnulib/lib/glob.c mempcpy (mempcpy (alt_start, p, next - p), rest, rest_len); next 464 maint/gnulib/lib/glob.c if (*next == '}') next 468 maint/gnulib/lib/glob.c p = next + 1; next 469 maint/gnulib/lib/glob.c next = next_brace_sub (p, flags); next 470 maint/gnulib/lib/glob.c assert (next != NULL); next 1287 maint/gnulib/lib/glob.c struct globnames *next; size_t count; char *name[nnames]; next 1301 maint/gnulib/lib/glob.c init_names->next = NULL; next 1407 maint/gnulib/lib/glob.c newnames->next = names; next 1456 maint/gnulib/lib/glob.c names = names->next; next 1482 maint/gnulib/lib/glob.c names = names->next; next 49 maint/gnulib/lib/hash.c struct hash_entry *next; next 172 maint/gnulib/lib/hash.c while (cursor = cursor->next, cursor) next 201 maint/gnulib/lib/hash.c while (cursor = cursor->next, cursor) next 249 maint/gnulib/lib/hash.c for (cursor = bucket; cursor; cursor = cursor->next) next 283 maint/gnulib/lib/hash.c if (cursor->data == entry && cursor->next) next 284 maint/gnulib/lib/hash.c return cursor->next->data; next 285 maint/gnulib/lib/hash.c cursor = cursor->next; next 310 maint/gnulib/lib/hash.c for (cursor = bucket; cursor; cursor = cursor->next) next 334 maint/gnulib/lib/hash.c for (cursor = bucket; cursor; cursor = cursor->next) next 576 maint/gnulib/lib/hash.c struct hash_entry *next; next 579 maint/gnulib/lib/hash.c for (cursor = bucket->next; cursor; cursor = next) next 585 maint/gnulib/lib/hash.c next = cursor->next; next 588 maint/gnulib/lib/hash.c cursor->next = table->free_entry_list; next 596 maint/gnulib/lib/hash.c bucket->next = NULL; next 609 maint/gnulib/lib/hash.c struct hash_entry *next; next 618 maint/gnulib/lib/hash.c for (cursor = bucket; cursor; cursor = cursor->next) next 633 maint/gnulib/lib/hash.c for (cursor = bucket->next; cursor; cursor = next) next 635 maint/gnulib/lib/hash.c next = cursor->next; next 641 maint/gnulib/lib/hash.c for (cursor = table->free_entry_list; cursor; cursor = next) next 643 maint/gnulib/lib/hash.c next = cursor->next; next 667 maint/gnulib/lib/hash.c table->free_entry_list = new->next; next 688 maint/gnulib/lib/hash.c entry->next = table->free_entry_list; next 718 maint/gnulib/lib/hash.c if (bucket->next) next 720 maint/gnulib/lib/hash.c struct hash_entry *next = bucket->next; next 724 maint/gnulib/lib/hash.c *bucket = *next; next 725 maint/gnulib/lib/hash.c free_entry (table, next); next 737 maint/gnulib/lib/hash.c for (cursor = bucket; cursor->next; cursor = cursor->next) next 739 maint/gnulib/lib/hash.c if (entry == cursor->next->data next 740 maint/gnulib/lib/hash.c || table->comparator (entry, cursor->next->data)) next 742 maint/gnulib/lib/hash.c void *data = cursor->next->data; next 746 maint/gnulib/lib/hash.c struct hash_entry *next = cursor->next; next 750 maint/gnulib/lib/hash.c cursor->next = next->next; next 751 maint/gnulib/lib/hash.c free_entry (table, next); next 773 maint/gnulib/lib/hash.c struct hash_entry *next; next 786 maint/gnulib/lib/hash.c for (cursor = bucket->next; cursor; cursor = next) next 791 maint/gnulib/lib/hash.c next = cursor->next; next 797 maint/gnulib/lib/hash.c cursor->next = new_bucket->next; next 798 maint/gnulib/lib/hash.c new_bucket->next = cursor; next 813 maint/gnulib/lib/hash.c bucket->next = NULL; next 828 maint/gnulib/lib/hash.c new_entry->next = new_bucket->next; next 829 maint/gnulib/lib/hash.c new_bucket->next = new_entry; next 989 maint/gnulib/lib/hash.c new_entry->next = bucket->next; next 990 maint/gnulib/lib/hash.c bucket->next = new_entry; next 1057 maint/gnulib/lib/hash.c struct hash_entry *next; next 1060 maint/gnulib/lib/hash.c next = cursor->next; next 1062 maint/gnulib/lib/hash.c cursor = next; next 1096 maint/gnulib/lib/hash.c for (cursor = bucket; cursor; cursor = cursor->next) next 44 maint/gnulib/lib/idcache.c struct userid *next; next 74 maint/gnulib/lib/idcache.c for (tail = user_alist; tail; tail = tail->next) next 92 maint/gnulib/lib/idcache.c match->next = user_alist; next 110 maint/gnulib/lib/idcache.c for (tail = user_alist; tail; tail = tail->next) next 115 maint/gnulib/lib/idcache.c for (tail = nouser_alist; tail; tail = tail->next) next 138 maint/gnulib/lib/idcache.c tail->next = user_alist; next 143 maint/gnulib/lib/idcache.c tail->next = nouser_alist; next 156 maint/gnulib/lib/idcache.c for (tail = group_alist; tail; tail = tail->next) next 174 maint/gnulib/lib/idcache.c match->next = group_alist; next 192 maint/gnulib/lib/idcache.c for (tail = group_alist; tail; tail = tail->next) next 197 maint/gnulib/lib/idcache.c for (tail = nogroup_alist; tail; tail = tail->next) next 220 maint/gnulib/lib/idcache.c tail->next = group_alist; next 225 maint/gnulib/lib/idcache.c tail->next = nogroup_alist; next 56 maint/gnulib/lib/localename-table.h struct locale_hash_node *next; next 2654 maint/gnulib/lib/localename.c struct struniq_hash_node * volatile next; next 2676 maint/gnulib/lib/localename.c for (p = struniq_hash_table[slot]; p != NULL; p = p->next) next 2693 maint/gnulib/lib/localename.c for (p = struniq_hash_table[slot]; p != NULL; p = p->next) next 2702 maint/gnulib/lib/localename.c new_node->next = struniq_hash_table[slot]; next 2747 maint/gnulib/lib/localename.c for (p = locale_hash_table[slot]; p != NULL; p = p->next) next 2875 maint/gnulib/lib/localename.c p = p->next) next 2940 maint/gnulib/lib/localename.c for (p = locale_hash_table[slot]; p != NULL; p = p->next) next 2950 maint/gnulib/lib/localename.c node->next = locale_hash_table[slot]; next 3009 maint/gnulib/lib/localename.c p = p->next) next 3032 maint/gnulib/lib/localename.c for (p = locale_hash_table[slot]; p != NULL; p = p->next) next 3042 maint/gnulib/lib/localename.c node->next = locale_hash_table[slot]; next 3073 maint/gnulib/lib/localename.c for (p = &locale_hash_table[slot]; *p != NULL; p = &(*p)->next) next 3077 maint/gnulib/lib/localename.c *p = (*p)->next; next 184 maint/gnulib/lib/mgetgroups.c gid_t *next; next 187 maint/gnulib/lib/mgetgroups.c for (next = g + 1; next < groups_end; next++) next 189 maint/gnulib/lib/mgetgroups.c if (*next == first || *next == *g) next 192 maint/gnulib/lib/mgetgroups.c *++g = *next; next 671 maint/gnulib/lib/mountlist.c struct rootdir_entry *next; next 713 maint/gnulib/lib/mountlist.c rootdir_tail = &re->next; next 728 maint/gnulib/lib/mountlist.c for (re = rootdir_list; re; re = re->next) next 752 maint/gnulib/lib/mountlist.c rootdir_list = re->next; next 70 maint/gnulib/lib/pagealign_alloc.c memnode_t *next; next 83 maint/gnulib/lib/pagealign_alloc.c new_node->next = memnode_table; next 97 maint/gnulib/lib/pagealign_alloc.c for (c = *p_next; c != NULL; p_next = &c->next, c = c->next) next 107 maint/gnulib/lib/pagealign_alloc.c *p_next = c->next; next 945 maint/gnulib/lib/regcomp.c bin_tree_storage_t *storage, *next; next 946 maint/gnulib/lib/regcomp.c for (storage = dfa->str_tree_storage; storage; storage = next) next 948 maint/gnulib/lib/regcomp.c next = storage->next; next 1371 maint/gnulib/lib/regcomp.c node->left->next = node; next 1374 maint/gnulib/lib/regcomp.c node->left->next = node->right->first; next 1375 maint/gnulib/lib/regcomp.c node->right->next = node->next; next 1379 maint/gnulib/lib/regcomp.c node->left->next = node->next; next 1381 maint/gnulib/lib/regcomp.c node->right->next = node->next; next 1401 maint/gnulib/lib/regcomp.c DEBUG_ASSERT (node->next == NULL); next 1412 maint/gnulib/lib/regcomp.c left = node->next->node_idx; next 1416 maint/gnulib/lib/regcomp.c right = node->next->node_idx; next 1426 maint/gnulib/lib/regcomp.c err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx); next 1430 maint/gnulib/lib/regcomp.c dfa->nexts[idx] = node->next->node_idx; next 1437 maint/gnulib/lib/regcomp.c dfa->nexts[idx] = node->next->node_idx; next 1955 maint/gnulib/lib/regcomp.c re_token_t next; next 1957 maint/gnulib/lib/regcomp.c peek_token (&next, input, syntax); next 1959 maint/gnulib/lib/regcomp.c if (next.type != OP_ALT && next.type != OP_CLOSE_SUBEXP) next 3677 maint/gnulib/lib/regcomp.c storage->next = dfa->str_tree_storage; next 3690 maint/gnulib/lib/regcomp.c tree->next = NULL; next 465 maint/gnulib/lib/regex_internal.h struct bin_tree_t *next; next 480 maint/gnulib/lib/regex_internal.h struct bin_tree_storage_t *next; next 38 maint/gnulib/lib/striconveha.c struct autodetect_alias *next; next 81 maint/gnulib/lib/striconveha.c &autodetect_predefined[SIZEOF(autodetect_predefined)-1].next; next 136 maint/gnulib/lib/striconveha.c new_alias->next = NULL; next 139 maint/gnulib/lib/striconveha.c autodetect_list_end = &new_alias->next; next 167 maint/gnulib/lib/striconveha.c for (alias = autodetect_list; alias != NULL; alias = alias->next) next 271 maint/gnulib/lib/striconveha.c for (alias = autodetect_list; alias != NULL; alias = alias->next) next 25 maint/gnulib/lib/time-internal.h struct tm_zone *next; next 73 maint/gnulib/lib/time_rz.c tz->next = NULL; next 129 maint/gnulib/lib/time_rz.c tz = tz->next = tzalloc (zone); next 139 maint/gnulib/lib/time_rz.c if (!*zone_copy && tz->next) next 141 maint/gnulib/lib/time_rz.c tz = tz->next; next 166 maint/gnulib/lib/time_rz.c timezone_t next = tz->next; next 168 maint/gnulib/lib/time_rz.c tz = next; next 74 maint/gnulib/lib/timevar.c struct timevar_stack_def *next; next 192 maint/gnulib/lib/timevar.c unused_stack_instances = unused_stack_instances->next; next 200 maint/gnulib/lib/timevar.c context->next = stack; next 225 maint/gnulib/lib/timevar.c stack = stack->next; next 229 maint/gnulib/lib/timevar.c popped->next = unused_stack_instances; next 44 maint/gnulib/lib/unigbrk/u16-grapheme-next.c ucs4_t next; next 46 maint/gnulib/lib/unigbrk/u16-grapheme-next.c mblen = u16_mbtouc (&next, s, end - s); next 47 maint/gnulib/lib/unigbrk/u16-grapheme-next.c if (uc_is_grapheme_break (prev, next)) next 50 maint/gnulib/lib/unigbrk/u16-grapheme-next.c prev = next; next 36 maint/gnulib/lib/unigbrk/u16-grapheme-prev.c ucs4_t next; next 41 maint/gnulib/lib/unigbrk/u16-grapheme-prev.c s = u16_prev (&next, s, start); next 54 maint/gnulib/lib/unigbrk/u16-grapheme-prev.c if (uc_is_grapheme_break (prev, next)) next 58 maint/gnulib/lib/unigbrk/u16-grapheme-prev.c next = prev; next 44 maint/gnulib/lib/unigbrk/u32-grapheme-next.c ucs4_t next; next 46 maint/gnulib/lib/unigbrk/u32-grapheme-next.c u32_mbtouc (&next, s, end - s); next 47 maint/gnulib/lib/unigbrk/u32-grapheme-next.c if (uc_is_grapheme_break (prev, next)) next 50 maint/gnulib/lib/unigbrk/u32-grapheme-next.c prev = next; next 36 maint/gnulib/lib/unigbrk/u32-grapheme-prev.c ucs4_t next; next 41 maint/gnulib/lib/unigbrk/u32-grapheme-prev.c u32_prev (&next, s, start); next 52 maint/gnulib/lib/unigbrk/u32-grapheme-prev.c if (uc_is_grapheme_break (prev, next)) next 55 maint/gnulib/lib/unigbrk/u32-grapheme-prev.c next = prev; next 44 maint/gnulib/lib/unigbrk/u8-grapheme-next.c ucs4_t next; next 46 maint/gnulib/lib/unigbrk/u8-grapheme-next.c mblen = u8_mbtouc (&next, s, end - s); next 47 maint/gnulib/lib/unigbrk/u8-grapheme-next.c if (uc_is_grapheme_break (prev, next)) next 50 maint/gnulib/lib/unigbrk/u8-grapheme-next.c prev = next; next 36 maint/gnulib/lib/unigbrk/u8-grapheme-prev.c ucs4_t next; next 41 maint/gnulib/lib/unigbrk/u8-grapheme-prev.c s = u8_prev (&next, s, start); next 54 maint/gnulib/lib/unigbrk/u8-grapheme-prev.c if (uc_is_grapheme_break (prev, next)) next 58 maint/gnulib/lib/unigbrk/u8-grapheme-prev.c next = prev; next 98 maint/gnulib/lib/windows-cond.c struct glwthread_waitqueue_link *next = elt->link.wql_next; next 99 maint/gnulib/lib/windows-cond.c prev->wql_next = next; next 100 maint/gnulib/lib/windows-cond.c next->wql_prev = prev; next 118 maint/gnulib/lib/windows-cond.c struct glwthread_waitqueue_link *next; next 122 maint/gnulib/lib/windows-cond.c next = elt->link.wql_next; next 123 maint/gnulib/lib/windows-cond.c prev->wql_next = next; next 124 maint/gnulib/lib/windows-cond.c next->wql_prev = prev; next 145 maint/gnulib/lib/windows-cond.c struct glwthread_waitqueue_link *next; next 149 maint/gnulib/lib/windows-cond.c next = elt->link.wql_next; next 150 maint/gnulib/lib/windows-cond.c prev->wql_next = next; next 151 maint/gnulib/lib/windows-cond.c next->wql_prev = prev; next 159 maint/gnulib/lib/windows-cond.c l = next; next 99 maint/gnulib/lib/windows-timedrwlock.c struct glwthread_waitqueue_link *next = elt->link.wql_next; next 100 maint/gnulib/lib/windows-timedrwlock.c prev->wql_next = next; next 101 maint/gnulib/lib/windows-timedrwlock.c next->wql_prev = prev; next 120 maint/gnulib/lib/windows-timedrwlock.c struct glwthread_waitqueue_link *next; next 124 maint/gnulib/lib/windows-timedrwlock.c next = elt->link.wql_next; next 125 maint/gnulib/lib/windows-timedrwlock.c prev->wql_next = next; next 126 maint/gnulib/lib/windows-timedrwlock.c next->wql_prev = prev; next 148 maint/gnulib/lib/windows-timedrwlock.c struct glwthread_waitqueue_link *next; next 152 maint/gnulib/lib/windows-timedrwlock.c next = elt->link.wql_next; next 153 maint/gnulib/lib/windows-timedrwlock.c prev->wql_next = next; next 154 maint/gnulib/lib/windows-timedrwlock.c next->wql_prev = prev; next 163 maint/gnulib/lib/windows-timedrwlock.c l = next; next 46 maint/gnulib/lib/xvasprintf.c const char *next = va_arg (ap, const char *); next 47 maint/gnulib/lib/xvasprintf.c totalsize = xsum (totalsize, strlen (next)); next 65 maint/gnulib/lib/xvasprintf.c const char *next = va_arg (args, const char *); next 66 maint/gnulib/lib/xvasprintf.c size_t len = strlen (next); next 67 maint/gnulib/lib/xvasprintf.c memcpy (p, next, len); next 46 maint/gnulib/tests/test-list-c++.cc ASSERT (iter1.next (elt)); next 48 maint/gnulib/tests/test-list-c++.cc ASSERT (iter1.next (elt)); next 50 maint/gnulib/tests/test-list-c++.cc ASSERT (iter1.next (elt)); next 52 maint/gnulib/tests/test-list-c++.cc ASSERT (iter1.next (elt)); next 54 maint/gnulib/tests/test-list-c++.cc ASSERT (!iter1.next (elt)); next 62 maint/gnulib/tests/test-list-c++.cc ASSERT (iter2.next (elt)); next 64 maint/gnulib/tests/test-list-c++.cc ASSERT (iter2.next (elt)); next 66 maint/gnulib/tests/test-list-c++.cc ASSERT (!iter1.next (elt)); next 54 maint/gnulib/tests/test-map-c++.cc ASSERT (iter1.next (key, val)); next 57 maint/gnulib/tests/test-map-c++.cc ASSERT (iter1.next (key, val)); next 60 maint/gnulib/tests/test-map-c++.cc ASSERT (iter1.next (key, val)); next 63 maint/gnulib/tests/test-map-c++.cc ASSERT (iter1.next (key, val)); next 66 maint/gnulib/tests/test-map-c++.cc ASSERT (iter1.next (key, val)); next 69 maint/gnulib/tests/test-map-c++.cc ASSERT (!iter1.next (key, val)); next 48 maint/gnulib/tests/test-omap-c++.cc ASSERT (iter1.next (key, val)); next 51 maint/gnulib/tests/test-omap-c++.cc ASSERT (iter1.next (key, val)); next 54 maint/gnulib/tests/test-omap-c++.cc ASSERT (iter1.next (key, val)); next 57 maint/gnulib/tests/test-omap-c++.cc ASSERT (iter1.next (key, val)); next 60 maint/gnulib/tests/test-omap-c++.cc ASSERT (iter1.next (key, val)); next 63 maint/gnulib/tests/test-omap-c++.cc ASSERT (!iter1.next (key, val)); next 62 maint/gnulib/tests/test-oset-c++.cc ASSERT (iter1.next (elt)); next 64 maint/gnulib/tests/test-oset-c++.cc ASSERT (iter1.next (elt)); next 66 maint/gnulib/tests/test-oset-c++.cc ASSERT (iter1.next (elt)); next 68 maint/gnulib/tests/test-oset-c++.cc ASSERT (!iter1.next (elt)); next 77 maint/gnulib/tests/test-oset-c++.cc ASSERT (iter2.next (elt)); next 79 maint/gnulib/tests/test-oset-c++.cc ASSERT (iter2.next (elt)); next 81 maint/gnulib/tests/test-oset-c++.cc ASSERT (iter2.next (elt)); next 83 maint/gnulib/tests/test-oset-c++.cc ASSERT (!iter2.next (elt)); next 89 maint/gnulib/tests/test-oset-c++.cc ASSERT (iter3.next (elt)); next 91 maint/gnulib/tests/test-oset-c++.cc ASSERT (iter3.next (elt)); next 93 maint/gnulib/tests/test-oset-c++.cc ASSERT (!iter3.next (elt)); next 45 maint/gnulib/tests/test-set-c++.cc ASSERT (iter1.next (elt)); next 47 maint/gnulib/tests/test-set-c++.cc ASSERT (iter1.next (elt)); next 49 maint/gnulib/tests/test-set-c++.cc ASSERT (iter1.next (elt)); next 51 maint/gnulib/tests/test-set-c++.cc ASSERT (!iter1.next (elt)); next 33 maint/gnulib/tests/unigbrk/test-u16-grapheme-next.c const uint16_t *next; next 52 maint/gnulib/tests/unigbrk/test-u16-grapheme-next.c next = u16_grapheme_next (s, s + n); next 53 maint/gnulib/tests/unigbrk/test-u16-grapheme-next.c if (next != s + len) next 57 maint/gnulib/tests/unigbrk/test-u16-grapheme-next.c if (next == NULL) next 60 maint/gnulib/tests/unigbrk/test-u16-grapheme-next.c fprintf (stderr, "u16_grapheme_next skipped %zu units", next - s); next 33 maint/gnulib/tests/unigbrk/test-u32-grapheme-next.c const uint32_t *next; next 52 maint/gnulib/tests/unigbrk/test-u32-grapheme-next.c next = u32_grapheme_next (s, s + n); next 53 maint/gnulib/tests/unigbrk/test-u32-grapheme-next.c if (next != s + len) next 57 maint/gnulib/tests/unigbrk/test-u32-grapheme-next.c if (next == NULL) next 60 maint/gnulib/tests/unigbrk/test-u32-grapheme-next.c fprintf (stderr, "u32_grapheme_next skipped %zu units", next - s); next 33 maint/gnulib/tests/unigbrk/test-u8-grapheme-next.c const uint8_t *next = u8_grapheme_next (s, s + n); next 34 maint/gnulib/tests/unigbrk/test-u8-grapheme-next.c if (next != s + len) next 38 maint/gnulib/tests/unigbrk/test-u8-grapheme-next.c if (next == NULL) next 41 maint/gnulib/tests/unigbrk/test-u8-grapheme-next.c fprintf (stderr, "u8_grapheme_next skipped %zu bytes", next - s); next 107 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c ucs4_t next; next 129 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c next = 0; next 144 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c next = next_int; next 149 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c && uc_graphemeclusterbreak_property (next) == GBP_EM) next 152 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c int next_gbp = uc_graphemeclusterbreak_property (next); next 157 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c next, graphemebreakproperty_to_string (next_gbp)); next 159 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c else if (uc_graphemeclusterbreak_property (next) == GBP_RI next 163 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c int next_gbp = uc_graphemeclusterbreak_property (next); next 168 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c next, graphemebreakproperty_to_string (next_gbp)); next 170 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c else if (uc_is_grapheme_break (prev, next) != should_break) next 173 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c int next_gbp = uc_graphemeclusterbreak_property (next); next 179 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c next, graphemebreakproperty_to_string (next_gbp)); next 184 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c prev = next; next 186 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c if (!(uc_graphemeclusterbreak_property (next) == GBP_EXTEND next 189 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c last_compchar_prop = uc_graphemeclusterbreak_property (next); next 191 maint/gnulib/tests/unigbrk/test-uc-is-grapheme-break.c if (uc_graphemeclusterbreak_property (next) == GBP_RI) next 397 tools/attrd_updater.c for (const GList *iter = reply; iter != NULL; iter = iter->next) { next 87 tools/cibadmin.c for (child = xml->children; child; child = child->next) { next 408 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 990 tools/crm_resource.c for(iter = rsc->children; iter; iter = iter->next) { next 1109 tools/crm_resource.c for (ele = remaining; ele != NULL; ele = ele->next) { next 332 tools/crm_resource_ban.c for(; n; n = n->next) { next 107 tools/crm_resource_print.c for (GList *lpc = ops; lpc != NULL; lpc = lpc->next) { next 539 tools/crm_resource_print.c for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) { next 583 tools/crm_resource_print.c for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) { next 612 tools/crm_resource_print.c for (lpc = resources; lpc != NULL; lpc = lpc->next) { next 645 tools/crm_resource_print.c for (lpc = activeResources; lpc != NULL; lpc = lpc->next) { next 652 tools/crm_resource_print.c for(lpc = unactiveResources; lpc != NULL; lpc = lpc->next) { next 696 tools/crm_resource_print.c for (lpc = resources; lpc != NULL; lpc = lpc->next) { next 730 tools/crm_resource_print.c for (lpc = activeResources; lpc != NULL; lpc = lpc->next) { next 743 tools/crm_resource_print.c for(lpc = unactiveResources; lpc != NULL; lpc = lpc->next) { next 23 tools/crm_resource_runtime.c for (const GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 27 tools/crm_resource_runtime.c iter2 != NULL; iter2 = iter2->next) { next 63 tools/crm_resource_runtime.c for (GList *iter = rsc->running_on; iter != NULL; iter = iter->next) { next 174 tools/crm_resource_runtime.c for(GList *gIter = rsc->children; gIter; gIter = gIter->next) { next 331 tools/crm_resource_runtime.c for (GList *iter = resources; iter != NULL; iter = iter->next) { next 424 tools/crm_resource_runtime.c for (lpc = rsc->rsc_cons_lhs; lpc != NULL; lpc = lpc->next) { next 484 tools/crm_resource_runtime.c for (GList *iter = resources; iter != NULL; iter = iter->next) { next 781 tools/crm_resource_runtime.c for (const GList *lpc = rsc->children; lpc != NULL; lpc = lpc->next) { next 815 tools/crm_resource_runtime.c for (lpc = nodes; lpc != NULL; lpc = lpc->next) { next 921 tools/crm_resource_runtime.c for (GList *iter = scheduler->nodes; iter; iter = iter->next) { next 1108 tools/crm_resource_runtime.c for (hIter = hosts; host != NULL && hIter != NULL; hIter = hIter->next) { next 1146 tools/crm_resource_runtime.c for (rIter = rsc_list; rIter != NULL; rIter = rIter->next) { next 1168 tools/crm_resource_runtime.c for (item = items; item != NULL; item = item->next) { next 1178 tools/crm_resource_runtime.c for (item = items; item != NULL; item = item->next) { next 1342 tools/crm_resource_runtime.c for (GList *iter = rsc->children; iter; iter = iter->next) { next 1396 tools/crm_resource_runtime.c for (const GList *item = resources; item != NULL; item = item->next) { next 1786 tools/crm_resource_runtime.c for (const GList *action = actions; action != NULL; action = action->next) { next 1803 tools/crm_resource_runtime.c for (action = actions; action != NULL; action = action->next) { next 2167 tools/crm_resource_runtime.c for (const GList *iter = rsc->children; iter; iter = iter->next) { next 554 tools/crm_ticket.c for(list_iter = attr_delete; list_iter; list_iter = list_iter->next) { next 603 tools/crm_ticket.c for(list_iter = attr_delete; list_iter; list_iter = list_iter->next) {