next 209 daemons/controld/controld_control.c for (gIter = fsa_message_queue; gIter != NULL; gIter = gIter->next) { next 101 daemons/controld/controld_execd.c for (iter = history->recurring_op_list; iter != NULL; iter = iter->next) { next 127 daemons/controld/controld_execd.c for (iter = history->recurring_op_list; iter != NULL; iter = iter->next) { next 532 daemons/controld/controld_execd.c for (GList *iter = metadata->ra_params; iter != NULL; iter = iter->next) { next 808 daemons/controld/controld_execd.c for (gIter = entry->recurring_op_list; gIter != NULL; gIter = gIter->next) { next 2150 daemons/controld/controld_execd.c for (state_entry = lrm_state_list; state_entry != NULL; state_entry = state_entry->next) { next 297 daemons/controld/controld_fencing.c iter = iter->next; next 316 daemons/controld/controld_fencing.c for (iter = stonith_cleanup_list; iter != NULL; iter = iter->next) { next 336 daemons/controld/controld_fencing.c for (iter = stonith_cleanup_list; iter != NULL; iter = iter->next) { next 372 daemons/controld/controld_fencing.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 380 daemons/controld/controld_fencing.c for (lpc2 = synapse->actions; lpc2 != NULL; lpc2 = lpc2->next) { next 179 daemons/controld/controld_messages.c for (lpc = fsa_message_queue; lpc != NULL; lpc = lpc->next) { next 303 daemons/controld/controld_metadata.c for (GList *iter = md->ra_params; iter != NULL; iter = iter->next) { next 388 daemons/controld/controld_remote_ra.c for (tmp = cmd->params; tmp; tmp = tmp->next) { next 744 daemons/controld/controld_remote_ra.c for (tmp = cmd->params; tmp; tmp = tmp->next) { next 951 daemons/controld/controld_remote_ra.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 958 daemons/controld/controld_remote_ra.c for (gIter = rm_list; gIter != NULL; gIter = gIter->next) { next 982 daemons/controld/controld_remote_ra.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 1049 daemons/controld/controld_remote_ra.c for (gIter = ra_data->recurring_cmds; gIter != NULL; gIter = gIter->next) { next 1057 daemons/controld/controld_remote_ra.c for (gIter = ra_data->cmds; gIter != NULL; gIter = gIter->next) { next 266 daemons/controld/controld_te_callbacks.c && xml->children && xml->children->next) { next 39 daemons/controld/controld_te_events.c for (; gIter != NULL; gIter = gIter->next) { next 48 daemons/controld/controld_te_events.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 202 daemons/controld/controld_te_events.c for (GList *item = transition_graph->synapses; item; item = item->next) { next 205 daemons/controld/controld_te_events.c for (GList *item2 = synapse->actions; item2; item2 = item2->next) { next 223 daemons/controld/controld_te_events.c for (; gIter != NULL; gIter = gIter->next) { next 227 daemons/controld/controld_te_events.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 300 daemons/controld/controld_te_events.c gIter = gIter->next) { next 304 daemons/controld/controld_te_events.c gIter2 = gIter2->next) { next 338 daemons/execd/cts-exec-helper.c for (iter = list; iter != NULL; iter = iter->next) { next 355 daemons/execd/cts-exec-helper.c for (iter = list; iter != NULL; iter = iter->next) { next 373 daemons/execd/cts-exec-helper.c for (iter = list; iter != NULL; iter = iter->next) { next 389 daemons/execd/cts-exec-helper.c for (op_item = op_list; op_item != NULL; op_item = op_item->next) { next 420 daemons/execd/execd_commands.c for (GList *item = action_list; item != NULL; item = item->next) { next 1149 daemons/execd/execd_commands.c for (cmd_iter = cmd_list; cmd_iter; cmd_iter = cmd_iter->next) { next 1420 daemons/execd/execd_commands.c GList *next = gIter->next; next 1427 daemons/execd/execd_commands.c gIter = next; next 1434 daemons/execd/execd_commands.c GList *next = gIter->next; next 1456 daemons/execd/execd_commands.c gIter = next; next 1636 daemons/execd/execd_commands.c for (gIter = rsc->pending_ops; gIter != NULL; gIter = gIter->next) { next 1649 daemons/execd/execd_commands.c for (gIter = rsc->recurring_ops; gIter != NULL; gIter = gIter->next) { next 1695 daemons/execd/execd_commands.c for (cmd_iter = cmd_list; cmd_iter; cmd_iter = cmd_iter->next) { next 1735 daemons/execd/execd_commands.c for (GList *item = rsc->recurring_ops; item != NULL; item = item->next) { next 420 daemons/execd/remoted_proxy.c for (gIter = remove_these; gIter != NULL; gIter = gIter->next) { next 320 daemons/fenced/fenced_commands.c gIterNext = gIter->next; next 416 daemons/fenced/fenced_commands.c gIterNext = gIter->next; next 624 daemons/fenced/fenced_commands.c for (gIter = device->pending_ops; gIter != NULL; gIter = gIter->next) { next 1623 daemons/fenced/fenced_commands.c for (dIter = devices; dIter; dIter = dIter->next) { next 1721 daemons/fenced/fenced_commands.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 1731 daemons/fenced/fenced_commands.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 2134 daemons/fenced/fenced_commands.c for (lpc = devices; lpc != NULL; lpc = lpc->next) { next 2265 daemons/fenced/fenced_commands.c log_async_result(async_command_t *cmd, int rc, int pid, const char *next, next 2281 daemons/fenced/fenced_commands.c next = NULL; next 2304 daemons/fenced/fenced_commands.c if (next != NULL) { next 2305 daemons/fenced/fenced_commands.c g_string_append_printf(msg, ", retrying with %s", next); next 2438 daemons/fenced/fenced_commands.c for (iter = cmd->device_next; iter != NULL; iter = iter->next) { next 2442 daemons/fenced/fenced_commands.c cmd->device_next = iter->next; next 2452 daemons/fenced/fenced_commands.c cmd->device_next = cmd->device_next->next; next 2477 daemons/fenced/fenced_commands.c gIterNext = gIter->next; next 2554 daemons/fenced/fenced_commands.c cmd->device_next = devices->next; next 2810 daemons/fenced/fenced_commands.c for (dup_iter = list_op->duplicates; dup_iter != NULL; dup_iter = dup_iter->next) { next 325 daemons/fenced/fenced_remote.c for (iter = op->automatic_list; iter != NULL; iter = iter->next) { next 439 daemons/fenced/fenced_remote.c for (iter = op->duplicates; iter != NULL; iter = iter->next) { next 741 daemons/fenced/fenced_remote.c for (lpc = devices; lpc != NULL; lpc = lpc->next) { next 1229 daemons/fenced/fenced_remote.c for (iter = op->query_results; iter != NULL; iter = iter->next) { next 1404 daemons/fenced/fenced_remote.c for (device_list = tp->levels[i]; device_list; device_list = device_list->next) { next 1405 daemons/fenced/fenced_remote.c for (iter = op->query_results; iter != NULL; iter = iter->next) { next 1470 daemons/fenced/fenced_remote.c for (iter = op->duplicates; iter != NULL; iter = iter->next) { next 1494 daemons/fenced/fenced_remote.c op->devices = op->devices->next; next 1768 daemons/fenced/fenced_remote.c for (device = tp->levels[i]; device; device = device->next) { next 1770 daemons/fenced/fenced_remote.c for (iter = op->query_results; iter && !match; iter = iter->next) { next 670 daemons/fenced/pacemaker-fenced.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 201 include/crm/cib/internal.h gboolean cib_config_changed(xmlNode * last, xmlNode * next, xmlNode ** diff); next 301 include/crm/common/internal.h return list && (list->next == NULL); next 308 include/crm/common/internal.h return list && (list->next != NULL); next 203 include/crm/common/xml_internal.h child = child->next; next 219 include/crm/common/xml_internal.h xmlNode *next = (child? child->next : NULL); next 221 include/crm/common/xml_internal.h while (next && (next->type == XML_TEXT_NODE)) { next 222 include/crm/common/xml_internal.h next = next->next; next 224 include/crm/common/xml_internal.h return next; next 241 include/crm/common/xml_internal.h child = child->next; next 257 include/crm/common/xml_internal.h xmlNode *next = child? child->next : NULL; next 259 include/crm/common/xml_internal.h while (next && (next->type != XML_ELEMENT_NODE)) { next 260 include/crm/common/xml_internal.h next = next->next; next 262 include/crm/common/xml_internal.h return next; next 31 include/crm/lrmd.h struct lrmd_key_value_s *next; next 281 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 603 lib/cib/cib_ops.c cib_config_changed(xmlNode * last, xmlNode * next, xmlNode ** diff) next 612 lib/cib/cib_ops.c if (*diff == NULL && last != NULL && next != NULL) { next 613 lib/cib/cib_ops.c *diff = diff_xml_object(last, next, FALSE); next 255 lib/common/acl.c for (aIter = p->acls; aIter != NULL; aIter = aIter->next) { next 368 lib/common/acl.c xIter = xIter->next; next 428 lib/common/acl.c for(aIter = doc->acls; aIter != NULL && target; aIter = aIter->next) { next 497 lib/common/acl.c for (xmlAttr *prop = xml->properties; prop != NULL; prop = prop->next) { next 19 lib/common/lists.c for (item = items; item != NULL; item = item->next) { next 22 lib/common/lists.c for (candidate = from; candidate != NULL; candidate = candidate->next) { next 609 lib/common/logging.c const char *next = trace_tags; next 612 lib/common/logging.c offset = next; next 613 lib/common/logging.c next = strchrnul(offset, ','); next 614 lib/common/logging.c snprintf(token, sizeof(token), "%.*s", (int)(next - offset), offset); next 619 lib/common/logging.c if (next[0] != 0) { next 620 lib/common/logging.c next++; next 623 lib/common/logging.c } while (next != NULL && next[0] != 0); next 1052 lib/common/logging.c const char *next = NULL; next 1066 lib/common/logging.c next = output; next 1068 lib/common/logging.c offset = next; next 1069 lib/common/logging.c next = strchrnul(offset, '\n'); next 1071 lib/common/logging.c (int)(next - offset), offset); next 1072 lib/common/logging.c if (next[0] != 0) { next 1073 lib/common/logging.c next++; next 1076 lib/common/logging.c } while (next != NULL && next[0] != 0); next 1191 lib/common/mainloop.c iter = iter->next; next 1224 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 929 lib/common/nvpair.c pIter = pIter->next) { next 176 lib/common/output_log.c for (GList* gIter = priv->prefixes->head; gIter; gIter = gIter->next) { next 169 lib/common/output_xml.c node = node->next; next 115 lib/common/patchset.c pIter = pIter->next) { next 159 lib/common/patchset.c pIter = pIter->next) { next 209 lib/common/patchset.c for (gIter = p->deleted_objs; gIter; gIter = gIter->next) { next 222 lib/common/patchset.c xml_repair_v1_diff(xmlNode *last, xmlNode *next, xmlNode *local_diff, next 275 lib/common/patchset.c for (lpc = 0; next && lpc < PCMK__NELEM(vfields); lpc++) { next 276 lib/common/patchset.c const char *value = crm_element_value(next, vfields[lpc]); next 281 lib/common/patchset.c for (xmlAttrPtr a = pcmk__xe_first_attr(next); a != NULL; a = a->next) { next 282 lib/common/patchset.c const char *p_value = crm_element_value(next, (const char *) a->name); next 353 lib/common/patchset.c for (gIter = doc->deleted_objs; gIter; gIter = gIter->next) { next 742 lib/common/patchset.c xIter = xIter->next) { next 1211 lib/common/patchset.c pIter = pIter->next) { next 1227 lib/common/patchset.c for (gIter = change_objs; gIter; gIter = gIter->next) { next 1250 lib/common/patchset.c match_child = match_child->next; next 1288 lib/common/patchset.c match_child = match_child->next; next 1544 lib/common/patchset.c pIter = pIter->next) { next 1557 lib/common/patchset.c xIter = xIter->next) { next 1585 lib/common/patchset.c pIter = pIter->next) { next 1615 lib/common/patchset.c pIter = pIter->next) { next 269 lib/common/schemas.c add_schema_by_version(const schema_version_t *version, int next, next 326 lib/common/schemas.c next = -1; next 331 lib/common/schemas.c transform_upgrade, transform_enter, transform_onleave, next); next 397 lib/common/schemas.c int next = 0; next 415 lib/common/schemas.c next = -1; next 417 lib/common/schemas.c if (add_schema_by_version(&version, next, transform_expected) next 1054 lib/common/schemas.c int next = -1; /* -1 denotes "inactive" value */ next 1091 lib/common/schemas.c if (next != -1) { next 1094 lib/common/schemas.c next = -1; next 1106 lib/common/schemas.c if (next != -1) { next 1108 lib/common/schemas.c known_schemas[next].name); next 1109 lib/common/schemas.c next = -1; next 1120 lib/common/schemas.c next = known_schemas[lpc].after_transform; next 1122 lib/common/schemas.c if (next <= lpc) { next 1127 lib/common/schemas.c } else if (max > 0 && (lpc == max || next > max)) { next 1129 lib/common/schemas.c known_schemas[lpc].name, lpc, next, max); next 1138 lib/common/schemas.c || validate_with_silent(xml, next)) { next 1140 lib/common/schemas.c known_schemas[lpc].name, known_schemas[next].name); next 1142 lib/common/schemas.c lpc = next; next 1146 lib/common/schemas.c known_schemas[lpc].name, known_schemas[next].name, next 1157 lib/common/schemas.c } else if (validate_with(upgrade, next, to_logs)) { next 1160 lib/common/schemas.c lpc = next; next 1161 lib/common/schemas.c *best = next; next 1173 lib/common/schemas.c next = -1; next 888 lib/common/strings.c for (GList *ele = lst; ele != NULL; ele = ele->next) { next 402 lib/common/xml.c for(gIter = doc->deleted_objs; gIter; gIter = gIter->next) { next 529 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(src); a != NULL; a = a->next) { next 546 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(target); a != NULL; a = a->next) { next 633 lib/common/xml.c xmlAttrPtr next = NULL; next 635 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(element); a != NULL; a = next) { next 636 lib/common/xml.c next = a->next; // Grab now because attribute might get removed next 1021 lib/common/xml.c xmlNode *next = iter->next; next 1039 lib/common/xml.c iter = next; next 1468 lib/common/xml.c a = a->next) { next 1586 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(data); a != NULL; a = a->next) { next 1704 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(data); a != NULL; a = a->next) { next 1740 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(data); a != NULL; a = a->next) { next 1758 lib/common/xml.c for(xChild = data->children; xChild != NULL; xChild = xChild->next) { next 1886 lib/common/xml.c time_t next, new = time(NULL); next 1918 lib/common/xml.c next = time(NULL); next 1919 lib/common/xml.c if ((now + 1) < next) { next 1921 lib/common/xml.c crm_err("xmlNodeDump() -> %dbytes took %ds", *max, next - now); next 2078 lib/common/xml.c for (xmlAttr *attr = pcmk__xe_first_attr(xml); attr; attr = attr->next) { next 2176 lib/common/xml.c attr_iter = attr_iter->next; next 2218 lib/common/xml.c attr_iter = attr_iter->next; next 2398 lib/common/xml.c for (xmlAttrPtr a = pcmk__xe_first_attr(xml_node); a != NULL; a = a->next) { next 2577 lib/common/xml.c a = a->next) { next 2698 lib/common/xml.c a = a->next) { next 2741 lib/common/xml.c xmlNode *next = pcmk__xml_next(child_of_child); next 2749 lib/common/xml.c child_of_child = next; next 299 lib/fencing/st_client.c GList *next = g_list_next(list_item); next 306 lib/fencing/st_client.c list_item = next; next 363 lib/fencing/st_client.c for (; params; params = params->next) { next 486 lib/fencing/st_client.c for (; device_list; device_list = device_list->next) { next 1210 lib/fencing/st_client.c last->next = kvp; next 1227 lib/fencing/st_client.c for (hp = history; hp; hp_old = hp, hp = hp->next, free(hp_old)) { next 2107 lib/fencing/st_client.c for (; params; params = params->next) { next 2274 lib/fencing/st_client.c while (end && end->next) { next 2275 lib/fencing/st_client.c end = end->next; next 2279 lib/fencing/st_client.c end->next = p; next 2293 lib/fencing/st_client.c p = head->next; next 2381 lib/fencing/st_client.c for (hp = history; hp; hp = hp->next) { next 2433 lib/fencing/st_client.c for (dIter = devices; dIter != NULL; dIter = dIter->next) { next 2598 lib/fencing/st_client.c for (stonith_history_t *prev_hp = top_history; prev_hp; prev_hp = prev_hp->next) { next 2631 lib/fencing/st_client.c tmp = hp->next; next 2636 lib/fencing/st_client.c hp->next = new; next 2641 lib/fencing/st_client.c if ((!np->next) || (hp->completed > np->next->completed) || next 2642 lib/fencing/st_client.c ((hp->completed == np->next->completed) && (hp->completed_nsec > np->next->completed_nsec))) { next 2643 lib/fencing/st_client.c hp->next = np->next; next 2644 lib/fencing/st_client.c np->next = hp; next 2647 lib/fencing/st_client.c np = np->next; next 2652 lib/fencing/st_client.c hp->next = pending; next 2662 lib/fencing/st_client.c while (last_pending->next) { next 2663 lib/fencing/st_client.c last_pending = last_pending->next; next 2666 lib/fencing/st_client.c last_pending->next = new; next 2697 lib/fencing/st_client.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 45 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 74 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 103 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 131 lib/fencing/st_output.c for (stonith_history_t *hp = history; hp; hp = hp->next) { next 220 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 118 lib/lrmd/lrmd_client.c while (end && end->next) { next 119 lib/lrmd/lrmd_client.c end = end->next; next 123 lib/lrmd/lrmd_client.c end->next = p; next 139 lib/lrmd/lrmd_client.c p = head->next; next 156 lib/lrmd/lrmd_client.c while (end && end->next) { next 157 lib/lrmd/lrmd_client.c end = end->next; next 161 lib/lrmd/lrmd_client.c end->next = p; next 175 lib/lrmd/lrmd_client.c p = head->next; next 393 lib/lrmd/lrmd_client.c for (iter = native->pending_notify; iter; iter = iter->next) { next 1090 lib/lrmd/lrmd_client.c int next = fgetc(stream); next 1092 lib/lrmd/lrmd_client.c if (next == EOF) { next 1104 lib/lrmd/lrmd_client.c key->data[key->size++] = (unsigned char) next; next 1963 lib/lrmd/lrmd_client.c for (const lrmd_key_value_t *param = params; param; param = param->next) { next 2020 lib/lrmd/lrmd_client.c for (tmp = params; tmp; tmp = tmp->next) { next 2046 lib/lrmd/lrmd_client.c for (tmp = params; tmp; tmp = tmp->next) { next 2090 lib/lrmd/lrmd_client.c for (dIter = stonith_resources; dIter; dIter = dIter->next) { next 2115 lib/lrmd/lrmd_client.c for (gIter = agents; gIter != NULL; gIter = gIter->next) { next 2148 lib/lrmd/lrmd_client.c for (gIter2 = agents; gIter2 != NULL; gIter2 = gIter2->next) { next 2167 lib/lrmd/lrmd_client.c for (gIter = ocf_providers; gIter != NULL; gIter = gIter->next) { next 2189 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 208 lib/pacemaker/pcmk_fence.c for (hp = history; hp; hp = hp->next) { next 270 lib/pacemaker/pcmk_fence.c for (stonith_key_value_t *dIter = devices; dIter; dIter = dIter->next) { next 351 lib/pacemaker/pcmk_fence.c targets = targets->next; next 428 lib/pacemaker/pcmk_fence.c for (stonith_key_value_t *dIter = devices; dIter; dIter = dIter->next) { next 532 lib/pacemaker/pcmk_fence.c hp = new->next; next 533 lib/pacemaker/pcmk_fence.c new->next = NULL; next 536 lib/pacemaker/pcmk_fence.c stonith_history_t *hp_next = hp->next; next 538 lib/pacemaker/pcmk_fence.c hp->next = NULL; next 540 lib/pacemaker/pcmk_fence.c for (np = new; ; np = np->next) { next 554 lib/pacemaker/pcmk_fence.c if (!np->next) { next 555 lib/pacemaker/pcmk_fence.c np->next = hp; next 51 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 82 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 113 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 173 lib/pacemaker/pcmk_graph_consumer.c for (lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 195 lib/pacemaker/pcmk_graph_consumer.c for (lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 275 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 365 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 379 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 77 lib/pacemaker/pcmk_graph_logging.c for (GList *sIter = graph->synapses; sIter != NULL; sIter = sIter->next) { next 81 lib/pacemaker/pcmk_graph_logging.c aIter = aIter->next) { next 118 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 143 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = synapse->inputs; lpc != NULL; lpc = lpc->next) { next 182 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = synapse->actions; lpc != NULL; lpc = lpc->next) { next 213 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { next 457 lib/pacemaker/pcmk_graph_producer.c for (lpc = then->actions_before; lpc != NULL; lpc = lpc->next) { next 573 lib/pacemaker/pcmk_graph_producer.c for (lpc2 = first->actions_after; lpc2 != NULL; lpc2 = lpc2->next) { next 598 lib/pacemaker/pcmk_graph_producer.c for (lpc = then->actions_after; lpc != NULL; lpc = lpc->next) { next 655 lib/pacemaker/pcmk_graph_producer.c gIter = gIter->next) { next 740 lib/pacemaker/pcmk_graph_producer.c for (iter = action->actions_before; iter != NULL; iter = iter->next) { next 1082 lib/pacemaker/pcmk_graph_producer.c for (lpc = action->actions_after; lpc != NULL; lpc = lpc->next) { next 1425 lib/pacemaker/pcmk_graph_producer.c iter != NULL; iter = iter->next) { next 1454 lib/pacemaker/pcmk_graph_producer.c GList *next = NULL; next 1459 lib/pacemaker/pcmk_graph_producer.c for (item = action->actions_before; item != NULL; item = next) { next 1462 lib/pacemaker/pcmk_graph_producer.c next = item->next; next 1548 lib/pacemaker/pcmk_graph_producer.c for (lpc = action->actions_before; lpc != NULL; lpc = lpc->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 365 lib/pacemaker/pcmk_output.c for (GList *lpc = rsc->rsc_cons; lpc != NULL; lpc = lpc->next) { next 410 lib/pacemaker/pcmk_output.c for (GList *lpc = rsc->rsc_cons; lpc != NULL; lpc = lpc->next) { next 443 lib/pacemaker/pcmk_output.c for (GList *lpc = rsc->rsc_cons_lhs; lpc != NULL; lpc = lpc->next) { next 488 lib/pacemaker/pcmk_output.c for (GList *lpc = rsc->rsc_cons_lhs; lpc != NULL; lpc = lpc->next) { next 517 lib/pacemaker/pcmk_output.c for (lpc = list; lpc != NULL; lpc = lpc->next) { next 522 lib/pacemaker/pcmk_output.c for (lpc2 = cons->node_list_rh; lpc2 != NULL; lpc2 = lpc2->next) { next 881 lib/pacemaker/pcmk_output.c pe_node_t *next = va_arg(args, pe_node_t *); next 895 lib/pacemaker/pcmk_output.c || (current == NULL && next == NULL)) { next 902 lib/pacemaker/pcmk_output.c if (current != NULL && next != NULL && !pcmk__str_eq(current->details->id, next->details->id, pcmk__str_casei)) { next 906 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, RSC_START, FALSE); next 923 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, RSC_PROMOTE, FALSE); next 929 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, RSC_DEMOTE, FALSE); next 938 lib/pacemaker/pcmk_output.c possible_matches = pe__resource_actions(rsc, next, RSC_MIGRATED, FALSE); next 943 lib/pacemaker/pcmk_output.c CRM_CHECK(next != NULL,); next 944 lib/pacemaker/pcmk_output.c if (next == NULL) { next 948 lib/pacemaker/pcmk_output.c next, start, NULL); next 952 lib/pacemaker/pcmk_output.c next, start, NULL); next 959 lib/pacemaker/pcmk_output.c current, next, promote, demote); next 962 lib/pacemaker/pcmk_output.c role2text(rsc->role), next->details->uname); next 972 lib/pacemaker/pcmk_output.c rsc, current, next, stop, NULL); next 981 lib/pacemaker/pcmk_output.c next, start, NULL); next 996 lib/pacemaker/pcmk_output.c for (gIter = rsc->running_on; gIter != NULL; gIter = gIter->next) { next 1022 lib/pacemaker/pcmk_output.c next, stop, start); next 1026 lib/pacemaker/pcmk_output.c rc = out->message(out, "rsc-action-item", "Move", rsc, current, next, next 1031 lib/pacemaker/pcmk_output.c rc = out->message(out, "rsc-action-item", "Reload", rsc, current, next, next 1036 lib/pacemaker/pcmk_output.c next, start, NULL); next 1042 lib/pacemaker/pcmk_output.c next, demote, NULL); next 1045 lib/pacemaker/pcmk_output.c CRM_LOG_ASSERT(next); next 1047 lib/pacemaker/pcmk_output.c next, promote, NULL); next 1050 lib/pacemaker/pcmk_output.c rc = out->message(out, "rsc-action-item", "Start", rsc, current, next, next 396 lib/pacemaker/pcmk_sched_allocate.c for (gIter = sorted_op_list; gIter != NULL; gIter = gIter->next) { next 461 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->resources; gIter != NULL; gIter = gIter->next) { next 493 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 553 lib/pacemaker/pcmk_sched_allocate.c for (gIter = result; gIter != NULL; gIter = gIter->next) { next 589 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 653 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 666 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 750 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 767 lib/pacemaker/pcmk_sched_allocate.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 806 lib/pacemaker/pcmk_sched_allocate.c for (GList *gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 833 lib/pacemaker/pcmk_sched_allocate.c for (GList *gIter2 = data_set->resources; gIter2 != NULL; gIter2 = gIter2->next) { next 944 lib/pacemaker/pcmk_sched_allocate.c for (GList *item = data_set->nodes; item != NULL; item = item->next) { next 972 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 985 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 990 lib/pacemaker/pcmk_sched_allocate.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 1099 lib/pacemaker/pcmk_sched_allocate.c for (gIter = nodes; gIter != NULL; gIter = gIter->next) { next 1158 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->resources; gIter != NULL; gIter = gIter->next) { next 1170 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->resources; gIter != NULL; gIter = gIter->next) { next 1187 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 1226 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 1240 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 1293 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->resources; gIter != NULL; gIter = gIter->next) { next 1307 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->resources; gIter != NULL; gIter = gIter->next) { next 1326 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 1343 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 1379 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 1467 lib/pacemaker/pcmk_sched_allocate.c for (gIter = shutdown_ops; gIter != NULL; gIter = gIter->next) { next 1484 lib/pacemaker/pcmk_sched_allocate.c for (gIter = stonith_ops; gIter != NULL; gIter = gIter->next) { next 1535 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->ordering_constraints; gIter != NULL; gIter = gIter->next) { next 1636 lib/pacemaker/pcmk_sched_allocate.c for (pIter = probes; pIter != NULL; pIter = pIter->next) { next 1640 lib/pacemaker/pcmk_sched_allocate.c for (rIter = rh_actions; rIter != NULL; rIter = rIter->next) { next 1706 lib/pacemaker/pcmk_sched_allocate.c for (gIter = then_actions; gIter != NULL; gIter = gIter->next) { next 1737 lib/pacemaker/pcmk_sched_allocate.c for (gIter = after->actions_after; gIter != NULL; gIter = gIter->next) { next 1791 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->actions; gIter != NULL; gIter = gIter->next) { next 1814 lib/pacemaker/pcmk_sched_allocate.c for (gIter = probes; gIter != NULL; gIter= gIter->next) { next 1818 lib/pacemaker/pcmk_sched_allocate.c for (aIter = probe->actions_after; aIter != NULL; aIter = aIter->next) { next 1834 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->resources; gIter != NULL; gIter = gIter->next) { next 1849 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->resources; gIter != NULL; gIter = gIter->next) { next 1912 lib/pacemaker/pcmk_sched_allocate.c for (actions = start->actions_before; actions != NULL; actions = actions->next) { next 1921 lib/pacemaker/pcmk_sched_allocate.c for (clone_actions = first->actions_before; clone_actions != NULL; clone_actions = clone_actions->next) { next 1949 lib/pacemaker/pcmk_sched_allocate.c for (pIter = probes; pIter != NULL; pIter = pIter->next) { next 2056 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 2072 lib/pacemaker/pcmk_sched_allocate.c for (; gIter != NULL; gIter = gIter->next) { next 2113 lib/pacemaker/pcmk_sched_allocate.c for (gIter = data_set->actions; gIter != NULL; gIter = gIter->next) { next 25 lib/pacemaker/pcmk_sched_bundle.c for (GList *gIter = data->replicas; gIter != NULL; gIter = gIter->next) { next 49 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 92 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 180 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 257 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 363 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 396 lib/pacemaker/pcmk_sched_bundle.c for (GList *gIter = scratch; gIter != NULL; gIter = gIter->next) { next 512 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 596 lib/pacemaker/pcmk_sched_bundle.c for (gIter = children; gIter != NULL; gIter = gIter->next) { next 622 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 654 lib/pacemaker/pcmk_sched_bundle.c for (gIter = children; gIter != NULL; gIter = gIter->next) { next 834 lib/pacemaker/pcmk_sched_bundle.c for (gIter = children; gIter != NULL; gIter = gIter->next) { next 848 lib/pacemaker/pcmk_sched_bundle.c for (GList *lpc = then_child_action->actions_after; lpc != NULL; lpc = lpc->next) { next 849 lib/pacemaker/pcmk_sched_bundle.c pe_action_wrapper_t *next = (pe_action_wrapper_t *) lpc->data; next 850 lib/pacemaker/pcmk_sched_bundle.c update_action(next->action, data_set); next 872 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 907 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 978 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 1014 lib/pacemaker/pcmk_sched_bundle.c tIter = tIter->next) { next 1074 lib/pacemaker/pcmk_sched_bundle.c gIter = gIter->next) { next 69 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 123 lib/pacemaker/pcmk_sched_clone.c gIter = gIter->next) { next 136 lib/pacemaker/pcmk_sched_clone.c gIter = gIter->next) { next 153 lib/pacemaker/pcmk_sched_clone.c gIter = gIter->next) { next 166 lib/pacemaker/pcmk_sched_clone.c gIter = gIter->next) { next 215 lib/pacemaker/pcmk_sched_clone.c gIter1 = gIter1->next, gIter2 = gIter2->next) { next 548 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 557 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 584 lib/pacemaker/pcmk_sched_clone.c for(GList *nIter = nodes; nIter != NULL; nIter = nIter->next) { next 606 lib/pacemaker/pcmk_sched_clone.c for (GList *gIter = children; gIter != NULL && allocated < max; gIter = gIter->next) { next 649 lib/pacemaker/pcmk_sched_clone.c for (GList *gIter = children; gIter != NULL; gIter = gIter->next) { next 705 lib/pacemaker/pcmk_sched_clone.c for (GList *gIter = rsc->rsc_cons; gIter != NULL; gIter = gIter->next) { next 714 lib/pacemaker/pcmk_sched_clone.c for (GList *gIter = rsc->rsc_cons_lhs; gIter != NULL; gIter = gIter->next) { next 753 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 771 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 814 lib/pacemaker/pcmk_sched_clone.c for (GList *item = actions; item != NULL; item = item->next) { next 848 lib/pacemaker/pcmk_sched_clone.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 901 lib/pacemaker/pcmk_sched_clone.c for (GList *gIter = children; gIter != NULL; gIter = gIter->next) { next 974 lib/pacemaker/pcmk_sched_clone.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 1011 lib/pacemaker/pcmk_sched_clone.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 1077 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 1187 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 1205 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 1267 lib/pacemaker/pcmk_sched_clone.c for (gIter = children; gIter != NULL; gIter = gIter->next) { next 1316 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 1360 lib/pacemaker/pcmk_sched_clone.c for (; gIter != NULL; gIter = gIter->next) { next 1385 lib/pacemaker/pcmk_sched_clone.c child_iter = child_iter->next) { next 1412 lib/pacemaker/pcmk_sched_clone.c for (GList *gIter = clone->children; gIter != NULL; gIter = gIter->next) { next 1430 lib/pacemaker/pcmk_sched_clone.c child_iter = child_iter->next) { next 1452 lib/pacemaker/pcmk_sched_clone.c child_iter = child_iter->next) { next 750 lib/pacemaker/pcmk_sched_colocation.c for (GList *gIter = rsc->actions; gIter != NULL; gIter = gIter->next) { next 797 lib/pacemaker/pcmk_sched_colocation.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 806 lib/pacemaker/pcmk_sched_colocation.c for (gIter = rsc->rsc_cons_lhs; gIter != NULL; gIter = gIter->next) { next 110 lib/pacemaker/pcmk_sched_constraints.c for (rIter = rsc_list; id && rIter; rIter = rIter->next) { next 275 lib/pacemaker/pcmk_sched_constraints.c for (gIter = tag->refs; gIter != NULL; gIter = gIter->next) { next 306 lib/pacemaker/pcmk_sched_constraints.c for (gIter = tag_refs; gIter != NULL; gIter = gIter->next) { next 371 lib/pacemaker/pcmk_sched_constraints.c for (gIter = tag->refs; gIter != NULL; gIter = gIter->next) { next 415 lib/pacemaker/pcmk_sched_constraints.c for (GList *iter = data_set->resources; iter != NULL; iter = iter->next) { next 64 lib/pacemaker/pcmk_sched_fencing.c for (gIter = rsc->actions; gIter != NULL; gIter = gIter->next) { next 142 lib/pacemaker/pcmk_sched_fencing.c for (gIter = action_list; gIter != NULL; gIter = gIter->next) { next 234 lib/pacemaker/pcmk_sched_fencing.c for (gIter = action_list; gIter != NULL; gIter = gIter->next) { next 281 lib/pacemaker/pcmk_sched_fencing.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 313 lib/pacemaker/pcmk_sched_fencing.c for (GList *r = data_set->resources; r != NULL; r = r->next) { next 58 lib/pacemaker/pcmk_sched_group.c for (GList *item = rsc->children->next; item != NULL; item = item->next) { next 62 lib/pacemaker/pcmk_sched_group.c cons_iter = cons_iter->next) { next 118 lib/pacemaker/pcmk_sched_group.c for (; gIter != NULL; gIter = gIter->next) { next 150 lib/pacemaker/pcmk_sched_group.c for (; gIter != NULL; gIter = gIter->next) { next 204 lib/pacemaker/pcmk_sched_group.c for (; gIter != NULL; gIter = gIter->next) { next 242 lib/pacemaker/pcmk_sched_group.c for (; gIter != NULL; gIter = gIter->next) { next 393 lib/pacemaker/pcmk_sched_group.c for (; gIter != NULL; gIter = gIter->next) { next 441 lib/pacemaker/pcmk_sched_group.c for (; gIter != NULL; gIter = gIter->next) { next 455 lib/pacemaker/pcmk_sched_group.c for (gIter = action->rsc->children; gIter != NULL; gIter = gIter->next) { next 506 lib/pacemaker/pcmk_sched_group.c for (; gIter != NULL; gIter = gIter->next) { next 535 lib/pacemaker/pcmk_sched_group.c for (; gIter != NULL; gIter = gIter->next) { next 557 lib/pacemaker/pcmk_sched_group.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 586 lib/pacemaker/pcmk_sched_group.c for (; gIter != NULL; gIter = gIter->next) { next 622 lib/pacemaker/pcmk_sched_group.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 131 lib/pacemaker/pcmk_sched_location.c for (gIter = match_L; gIter != NULL; gIter = gIter->next) { next 138 lib/pacemaker/pcmk_sched_location.c for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 322 lib/pacemaker/pcmk_sched_location.c for (rIter = data_set->resources; rIter; rIter = rIter->next) { next 601 lib/pacemaker/pcmk_sched_location.c iter != NULL; iter = iter->next) { next 643 lib/pacemaker/pcmk_sched_location.c gIter = gIter->next) { next 41 lib/pacemaker/pcmk_sched_messages.c for (GList *item = data_set->resources; item != NULL; item = item->next) { next 146 lib/pacemaker/pcmk_sched_messages.c for (; gIter != NULL; gIter = gIter->next) { next 43 lib/pacemaker/pcmk_sched_native.c gboolean StopRsc(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set); next 44 lib/pacemaker/pcmk_sched_native.c gboolean StartRsc(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set); next 45 lib/pacemaker/pcmk_sched_native.c gboolean DemoteRsc(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set); next 46 lib/pacemaker/pcmk_sched_native.c gboolean PromoteRsc(pe_resource_t * rsc, pe_node_t * next, gboolean optional, next 48 lib/pacemaker/pcmk_sched_native.c gboolean RoleError(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set); next 49 lib/pacemaker/pcmk_sched_native.c gboolean NullOp(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set); next 67 lib/pacemaker/pcmk_sched_native.c typedef gboolean (*rsc_transition_fn)(pe_resource_t *rsc, pe_node_t *next, next 172 lib/pacemaker/pcmk_sched_native.c for (GList *iter = nodes->next; iter; iter = iter->next) { next 442 lib/pacemaker/pcmk_sched_native.c for (; gIter != NULL; gIter = gIter->next) { next 518 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->rsc_cons; gIter != NULL; gIter = gIter->next) { next 549 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->rsc_cons_lhs; gIter != NULL; gIter = gIter->next) { next 769 lib/pacemaker/pcmk_sched_native.c for (gIter = possible_matches; gIter != NULL; gIter = gIter->next) { next 976 lib/pacemaker/pcmk_sched_native.c for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 1019 lib/pacemaker/pcmk_sched_native.c for (pIter = probes; pIter != NULL; pIter = pIter->next) { next 1035 lib/pacemaker/pcmk_sched_native.c for (local_gIter = stop_ops; local_gIter != NULL; local_gIter = local_gIter->next) { next 1227 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->dangling_migrations; gIter != NULL; gIter = gIter->next) { next 1531 lib/pacemaker/pcmk_sched_native.c for (GList *item = allowed_nodes; item; item = item->next) { next 1570 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->running_on; gIter != NULL; gIter = gIter->next) { next 1587 lib/pacemaker/pcmk_sched_native.c for (GList *item = allowed_nodes; item; item = item->next) { next 1588 lib/pacemaker/pcmk_sched_native.c pe_node_t *next = item->data; next 1590 lib/pacemaker/pcmk_sched_native.c next->details->uname); next 1594 lib/pacemaker/pcmk_sched_native.c load_stopped->node = pe__copy_node(next); next 1651 lib/pacemaker/pcmk_sched_native.c for (GList *item = allowed_nodes; item; item = item->next) { next 2004 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->actions; gIter != NULL; gIter = gIter->next) { next 2011 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 2037 lib/pacemaker/pcmk_sched_native.c pe_node_t *next = NULL; next 2052 lib/pacemaker/pcmk_sched_native.c next = rsc->allocated_to; next 2069 lib/pacemaker/pcmk_sched_native.c out->message(out, "rsc-action", rsc, current, next, moving); next 2073 lib/pacemaker/pcmk_sched_native.c StopRsc(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set) next 2080 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->running_on; gIter != NULL; gIter = gIter->next) { next 2087 lib/pacemaker/pcmk_sched_native.c next->details->uname, rsc->id); next 2124 lib/pacemaker/pcmk_sched_native.c StartRsc(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set) next 2129 lib/pacemaker/pcmk_sched_native.c pe_rsc_trace(rsc, "%s on %s %d %d", rsc->id, next ? next->details->uname : "N/A", optional, next ? next->weight : 0); next 2130 lib/pacemaker/pcmk_sched_native.c start = start_action(rsc, next, TRUE); next 2132 lib/pacemaker/pcmk_sched_native.c pcmk__order_vs_unfence(rsc, next, start, pe_order_implies_then, data_set); next 2143 lib/pacemaker/pcmk_sched_native.c PromoteRsc(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set) next 2150 lib/pacemaker/pcmk_sched_native.c CRM_CHECK(next != NULL, return FALSE); next 2151 lib/pacemaker/pcmk_sched_native.c pe_rsc_trace(rsc, "%s on %s", rsc->id, next->details->uname); next 2153 lib/pacemaker/pcmk_sched_native.c action_list = pe__resource_actions(rsc, next, RSC_START, TRUE); next 2155 lib/pacemaker/pcmk_sched_native.c for (gIter = action_list; gIter != NULL; gIter = gIter->next) { next 2165 lib/pacemaker/pcmk_sched_native.c promote_action(rsc, next, optional); next 2169 lib/pacemaker/pcmk_sched_native.c pe_rsc_debug(rsc, "%s\tPromote %s (canceled)", next->details->uname, rsc->id); next 2171 lib/pacemaker/pcmk_sched_native.c action_list = pe__resource_actions(rsc, next, RSC_PROMOTE, TRUE); next 2173 lib/pacemaker/pcmk_sched_native.c for (gIter = action_list; gIter != NULL; gIter = gIter->next) { next 2184 lib/pacemaker/pcmk_sched_native.c DemoteRsc(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set) next 2192 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->running_on; gIter != NULL; gIter = gIter->next) { next 2195 lib/pacemaker/pcmk_sched_native.c pe_rsc_trace(rsc, "%s on %s", rsc->id, next ? next->details->uname : "N/A"); next 2202 lib/pacemaker/pcmk_sched_native.c RoleError(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set) next 2205 lib/pacemaker/pcmk_sched_native.c crm_err("%s on %s", rsc->id, next ? next->details->uname : "N/A"); next 2211 lib/pacemaker/pcmk_sched_native.c NullOp(pe_resource_t * rsc, pe_node_t * next, gboolean optional, pe_working_set_t * data_set) next 2301 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 2485 lib/pacemaker/pcmk_sched_native.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 94 lib/pacemaker/pcmk_sched_notif.c for (gIter = list; gIter != NULL; gIter = gIter->next) { next 158 lib/pacemaker/pcmk_sched_notif.c for (GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 198 lib/pacemaker/pcmk_sched_notif.c for (GSList *item = n_data->keys; item; item = item->next) { next 271 lib/pacemaker/pcmk_sched_notif.c for (; gIter != NULL; gIter = gIter->next) { next 408 lib/pacemaker/pcmk_sched_notif.c for (; gIter != NULL; gIter = gIter->next) { next 458 lib/pacemaker/pcmk_sched_notif.c for (; gIter != NULL; gIter = gIter->next) { next 646 lib/pacemaker/pcmk_sched_notif.c for (; gIter != NULL; gIter = gIter->next) { next 656 lib/pacemaker/pcmk_sched_notif.c for (gIter = rsc->actions; gIter != NULL; gIter = gIter->next) { next 716 lib/pacemaker/pcmk_sched_notif.c for (; gIter != NULL; gIter = gIter->next) { next 335 lib/pacemaker/pcmk_sched_ordering.c rIter = rIter->next) { next 785 lib/pacemaker/pcmk_sched_ordering.c set_iter = set_iter->next; next 792 lib/pacemaker/pcmk_sched_ordering.c for (GList *gIter = set_iter; gIter != NULL; gIter = gIter->next) { next 823 lib/pacemaker/pcmk_sched_ordering.c set_iter = set_iter->next; next 1247 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = data_set->actions; iter != NULL; iter = iter->next) { next 1252 lib/pacemaker/pcmk_sched_ordering.c input_iter != NULL; input_iter = input_iter->next) { next 1274 lib/pacemaker/pcmk_sched_ordering.c for (GList *iter = data_set->actions; iter != NULL; iter = iter->next) { next 1394 lib/pacemaker/pcmk_sched_ordering.c for (GList *gIter = rh_actions; gIter != NULL; gIter = gIter->next) { next 1476 lib/pacemaker/pcmk_sched_ordering.c for (GList *gIter = lh_actions; gIter != NULL; gIter = gIter->next) { next 1504 lib/pacemaker/pcmk_sched_ordering.c gIter != NULL; gIter = gIter->next) { next 113 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 125 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 148 lib/pacemaker/pcmk_sched_promotable.c for (GList *gIter = location_constraints; gIter; gIter = gIter->next) { next 194 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 309 lib/pacemaker/pcmk_sched_promotable.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 317 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 338 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 358 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 381 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 395 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 427 lib/pacemaker/pcmk_sched_promotable.c for (rIter = parent->children; rIter; rIter = rIter->next) { next 447 lib/pacemaker/pcmk_sched_promotable.c for (rIter = parent->children; rIter; rIter = rIter->next) { next 499 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 592 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 645 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 687 lib/pacemaker/pcmk_sched_promotable.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 740 lib/pacemaker/pcmk_sched_promotable.c for (gIter2 = child_rsc->rsc_cons; gIter2 != NULL; gIter2 = gIter2->next) { next 759 lib/pacemaker/pcmk_sched_promotable.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 832 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 891 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 942 lib/pacemaker/pcmk_sched_promotable.c for (; gIter != NULL; gIter = gIter->next) { next 995 lib/pacemaker/pcmk_sched_promotable.c for (gIter = primary->children; gIter != NULL; gIter = gIter->next) { next 420 lib/pacemaker/pcmk_sched_remote.c for (GList *gIter = data_set->actions; gIter != NULL; gIter = gIter->next) { next 475 lib/pacemaker/pcmk_sched_remote.c item = item->next) { next 36 lib/pacemaker/pcmk_sched_resource.c for (gIter = rsc->rsc_cons; gIter != NULL; gIter = gIter->next) { next 55 lib/pacemaker/pcmk_sched_resource.c for (gIter = rsc->rsc_cons_lhs; gIter != NULL; gIter = gIter->next) { next 63 lib/pacemaker/pcmk_sched_tickets.c for (gIter = rsc_lh->children; gIter != NULL; gIter = gIter->next) { next 99 lib/pacemaker/pcmk_sched_tickets.c gIter = gIter->next) { next 425 lib/pacemaker/pcmk_sched_transition.c for (gIter = injections->node_up; gIter != NULL; gIter = gIter->next) { next 439 lib/pacemaker/pcmk_sched_transition.c for (gIter = injections->node_down; gIter != NULL; gIter = gIter->next) { next 464 lib/pacemaker/pcmk_sched_transition.c for (gIter = injections->node_fail; gIter != NULL; gIter = gIter->next) { next 479 lib/pacemaker/pcmk_sched_transition.c for (gIter = injections->ticket_grant; gIter != NULL; gIter = gIter->next) { next 490 lib/pacemaker/pcmk_sched_transition.c for (gIter = injections->ticket_revoke; gIter != NULL; gIter = gIter->next) { next 501 lib/pacemaker/pcmk_sched_transition.c for (gIter = injections->ticket_standby; gIter != NULL; gIter = gIter->next) { next 512 lib/pacemaker/pcmk_sched_transition.c for (gIter = injections->ticket_activate; gIter != NULL; gIter = gIter->next) { next 523 lib/pacemaker/pcmk_sched_transition.c for (gIter = injections->op_inject; gIter != NULL; gIter = gIter->next) { next 687 lib/pacemaker/pcmk_sched_transition.c for (gIter = fake_op_fail_list; gIter != NULL; gIter = gIter->next) { next 211 lib/pacemaker/pcmk_sched_utilization.c for (; gIter1 != NULL; gIter1 = gIter1->next) { next 221 lib/pacemaker/pcmk_sched_utilization.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 258 lib/pacemaker/pcmk_sched_utilization.c for (gIter = all_rscs; gIter != NULL; gIter = gIter->next) { next 371 lib/pacemaker/pcmk_sched_utilization.c for (; gIter != NULL; gIter = gIter->next) { next 85 lib/pacemaker/pcmk_sched_utils.c for (const GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 266 lib/pacemaker/pcmk_sched_utils.c for (gIter = rsc->actions; gIter != NULL; gIter = gIter->next) { next 383 lib/pacemaker/pcmk_sched_utils.c for (; gIter != NULL; gIter = gIter->next) { next 392 lib/pacemaker/pcmk_sched_utils.c for (; gIter != NULL; gIter = gIter->next) { next 163 lib/pacemaker/pcmk_simulate.c for (gIter = data_set->actions; gIter != NULL; gIter = gIter->next) { next 204 lib/pacemaker/pcmk_simulate.c for (gIter = data_set->actions; gIter != NULL; gIter = gIter->next) { next 209 lib/pacemaker/pcmk_simulate.c for (gIter2 = action->actions_before; gIter2 != NULL; gIter2 = gIter2->next) { next 230 lib/pengine/bundle.c for(GList *pIter = data->mounts; pIter != NULL; pIter = pIter->next) { next 252 lib/pengine/bundle.c for(GList *pIter = data->ports; pIter != NULL; pIter = pIter->next) { next 396 lib/pengine/bundle.c for(GList *pIter = data->mounts; pIter != NULL; pIter = pIter->next) { next 418 lib/pengine/bundle.c for(GList *pIter = data->ports; pIter != NULL; pIter = pIter->next) { next 560 lib/pengine/bundle.c for(GList *pIter = data->mounts; pIter != NULL; pIter = pIter->next) { next 588 lib/pengine/bundle.c for(GList *pIter = data->ports; pIter != NULL; pIter = pIter->next) { next 931 lib/pengine/bundle.c gIter = gIter->next) { next 1253 lib/pengine/bundle.c childIter = childIter->next) { next 1300 lib/pengine/bundle.c gIter = gIter->next) { next 1338 lib/pengine/bundle.c for (iter = bundle_data->replicas; iter != NULL; iter = iter->next) { next 1387 lib/pengine/bundle.c gIter = gIter->next) { next 1451 lib/pengine/bundle.c gIter = gIter->next) { next 1491 lib/pengine/bundle.c gIter = gIter->next) { next 1614 lib/pengine/bundle.c gIter = gIter->next) { next 1742 lib/pengine/bundle.c gIter = gIter->next) { next 1878 lib/pengine/bundle.c gIter = gIter->next) { next 2017 lib/pengine/bundle.c for (GList *item = bundle_data->replicas; item != NULL; item = item->next) { next 2046 lib/pengine/bundle.c for (GList *gIter = bundle_data->replicas; gIter != NULL; gIter = gIter->next) { next 299 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 387 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 410 lib/pengine/clone.c for (gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 469 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 549 lib/pengine/clone.c for (gIter = promoted_list; gIter; gIter = gIter->next) { next 565 lib/pengine/clone.c for (gIter = started_list; gIter; gIter = gIter->next) { next 620 lib/pengine/clone.c for (nIter = list; nIter != NULL; nIter = nIter->next) { next 666 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 736 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 832 lib/pengine/clone.c for (gIter = promoted_list; gIter; gIter = gIter->next) { next 856 lib/pengine/clone.c for (gIter = started_list; gIter; gIter = gIter->next) { next 919 lib/pengine/clone.c for (nIter = list; nIter != NULL; nIter = nIter->next) { next 963 lib/pengine/clone.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 994 lib/pengine/clone.c for (; gIter != NULL; gIter = gIter->next) { next 1042 lib/pengine/clone.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 162 lib/pengine/complex.c for (xmlAttrPtr a = pcmk__xe_first_attr(rsc->xml); a != NULL; a = a->next) { next 877 lib/pengine/complex.c for (; gIter != NULL; gIter = gIter->next) { next 1018 lib/pengine/complex.c node_iter = node_iter->next) { next 1091 lib/pengine/complex.c for (GList *item = rsc->children; item != NULL; item = item->next) { next 321 lib/pengine/failcounts.c for (gIter = rsc->fillers; gIter != NULL; gIter = gIter->next) { next 29 lib/pengine/group.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 170 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 198 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 238 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 279 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 341 lib/pengine/group.c for (GList *gIter = rsc->children; gIter; gIter = gIter->next) { next 367 lib/pengine/group.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 387 lib/pengine/group.c for (; gIter != NULL; gIter = gIter->next) { next 412 lib/pengine/group.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 74 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 95 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 164 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 245 lib/pengine/native.c for (GList *iter = rsc->running_on; iter; iter = iter->next) { next 308 lib/pengine/native.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 347 lib/pengine/native.c for (GList *gIter = rsc->running_on; gIter != NULL; gIter = gIter->next) { next 496 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 658 lib/pengine/native.c for (GList *iter = rsc->running_on; iter != NULL; iter = iter->next) { next 834 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 955 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 1057 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 1077 lib/pengine/native.c if (result && (result->next == NULL)) { next 1084 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 1102 lib/pengine/native.c for (; gIter != NULL; gIter = gIter->next) { next 1143 lib/pengine/native.c for (; gIter2 != NULL; gIter2 = gIter2->next) { next 1275 lib/pengine/native.c for (GList *gIter = sorted_rscs; gIter; gIter = gIter->next) { next 1289 lib/pengine/native.c for (GList *gIter2 = sorted_nodes; gIter2; gIter2 = gIter2->next) { next 52 lib/pengine/pe_output.c for (gIter = rsc_list; gIter != NULL; gIter = gIter->next) { next 619 lib/pengine/pe_output.c for (gIter = data_set->placement_constraints; gIter != NULL; gIter = gIter->next) { next 631 lib/pengine/pe_output.c for (gIter2 = location->node_list_rh; gIter2 != NULL; gIter2 = gIter2->next) { next 1457 lib/pengine/pe_output.c for (lpc2 = node->details->running_rsc; lpc2 != NULL; lpc2 = lpc2->next) { next 1534 lib/pengine/pe_output.c for (gIter2 = node->details->running_rsc; gIter2 != NULL; gIter2 = gIter2->next) { next 1607 lib/pengine/pe_output.c for (lpc = node->details->running_rsc; lpc != NULL; lpc = lpc->next) { next 1834 lib/pengine/pe_output.c for (GList *gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 1863 lib/pengine/pe_output.c for (GList *aIter = attr_list; aIter != NULL; aIter = aIter->next) { next 2014 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { next 2055 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { next 2178 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { next 2520 lib/pengine/pe_output.c for (rsc_iter = data_set->resources; rsc_iter != NULL; rsc_iter = rsc_iter->next) { next 2604 lib/pengine/pe_output.c for (gIter = op_list; gIter != NULL; gIter = gIter->next) { next 2880 lib/pengine/pe_output.c for (; gIter != NULL; gIter = gIter->next) { next 72 lib/pengine/remote.c for (GList *gIter = rsc->fillers; gIter != NULL; gIter = gIter->next) { next 129 lib/pengine/remote.c for (iter = host->details->running_rsc; iter != NULL; iter = iter->next) { next 252 lib/pengine/remote.c for (GList *item = data_set->param_check; item != NULL; item = item->next) { next 133 lib/pengine/status.c item = item->next) { next 161 lib/pengine/status.c iterator = iterator->next; next 176 lib/pengine/status.c iterator = iterator->next; next 186 lib/pengine/status.c for (GList *iterator = nodes; iterator != NULL; iterator = iterator->next) { next 231 lib/pengine/status.c iterator = iterator->next; next 250 lib/pengine/status.c iterator = iterator->next; next 392 lib/pengine/status.c for (rIter = rsc_list; id && rIter; rIter = rIter->next) { next 422 lib/pengine/status.c for (; gIter != NULL; gIter = gIter->next) { next 438 lib/pengine/status.c for (; gIter != NULL; gIter = gIter->next) { next 35 lib/pengine/tags.c for (GList *refs = ((pe_tag_t *) value)->refs; refs; refs = refs->next) { next 67 lib/pengine/tags.c for (GList *refs = ((pe_tag_t *) value)->refs; refs; refs = refs->next) { next 797 lib/pengine/unpack.c for (gIter = data_set->resources; gIter != NULL; gIter = gIter->next) { next 894 lib/pengine/unpack.c for (xIter = xml_ticket->properties; xIter; xIter = xIter->next) { next 1276 lib/pengine/unpack.c for (GList *item = data_set->stop_needed; item; item = item->next) { next 1292 lib/pengine/unpack.c for (GList *gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 1752 lib/pengine/unpack.c for (rIter = parent->children; rsc == NULL && rIter; rIter = rIter->next) { next 1777 lib/pengine/unpack.c CRM_LOG_ASSERT(locations->next == NULL); next 2183 lib/pengine/unpack.c for (; gIter != NULL; gIter = gIter->next) { next 2207 lib/pengine/unpack.c for (; gIter != NULL; gIter = gIter->next) { next 2262 lib/pengine/unpack.c for (; gIter != NULL; gIter = gIter->next) { next 2397 lib/pengine/unpack.c for (gIter = sorted_op_list; gIter != NULL; gIter = gIter->next) { next 2848 lib/pengine/unpack.c for (xIter = data_set->failed->children; xIter; xIter = xIter->next) { next 4027 lib/pengine/unpack.c for (gIter = sorted_op_list; gIter != NULL; gIter = gIter->next) { next 98 lib/pengine/utils.c for (GList *n = rsc->running_on; n != NULL; n = n->next) { next 181 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 209 lib/pengine/utils.c for (GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 242 lib/pengine/utils.c for (GList *gIter = list; gIter != NULL; gIter = gIter->next) { next 325 lib/pengine/utils.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 1140 lib/pengine/utils.c for (xIter = xml_obj->properties; xIter; xIter = xIter->next) { next 1491 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 1546 lib/pengine/utils.c for (gIter = input; gIter != NULL; gIter = gIter->next) { next 1577 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 1614 lib/pengine/utils.c for (GList *gIter = input; gIter != NULL; gIter = gIter->next) { next 1674 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 1700 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 1927 lib/pengine/utils.c for (; gIter != NULL; gIter = gIter->next) { next 2023 lib/pengine/utils.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 2031 lib/pengine/utils.c for (GList *lpc = data_set->resources; lpc != NULL; lpc = lpc->next) { next 2041 lib/pengine/utils.c for (GList *gIter = rsc->children; gIter != NULL; gIter = gIter->next) { next 2049 lib/pengine/utils.c for (GList *gIter = candidates; gIter != NULL; gIter = gIter->next) { next 2092 lib/pengine/utils.c for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 2170 lib/pengine/utils.c for (GList *gIter = matches; gIter != NULL; gIter = gIter->next) { next 2296 lib/pengine/utils.c for (gIter = tag->refs; gIter != NULL; gIter = gIter->next) { next 2470 lib/pengine/utils.c for (GList *ele = rsc->running_on; ele; ele = ele->next) { next 2492 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 908 lib/services/services.c for (gIter = inflight_ops; gIter != NULL; gIter = gIter->next) { next 934 lib/services/services.c for (gIter = blocked_ops; gIter != NULL; gIter = gIter->next) { next 947 lib/services/services.c for (gIter = executed_ops; gIter != NULL; gIter = gIter->next) { next 1177 lib/services/services.c for (iter = standards; iter != NULL; iter = iter->next) { next 1193 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 981 maint/gnulib/lib/regcomp.c bin_tree_storage_t *storage, *next; next 982 maint/gnulib/lib/regcomp.c for (storage = dfa->str_tree_storage; storage; storage = next) next 984 maint/gnulib/lib/regcomp.c next = storage->next; next 1409 maint/gnulib/lib/regcomp.c node->left->next = node; next 1412 maint/gnulib/lib/regcomp.c node->left->next = node->right->first; next 1413 maint/gnulib/lib/regcomp.c node->right->next = node->next; next 1417 maint/gnulib/lib/regcomp.c node->left->next = node->next; next 1419 maint/gnulib/lib/regcomp.c node->right->next = node->next; next 1439 maint/gnulib/lib/regcomp.c DEBUG_ASSERT (node->next == NULL); next 1450 maint/gnulib/lib/regcomp.c left = node->next->node_idx; next 1454 maint/gnulib/lib/regcomp.c right = node->next->node_idx; next 1464 maint/gnulib/lib/regcomp.c err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx); next 1468 maint/gnulib/lib/regcomp.c dfa->nexts[idx] = node->next->node_idx; next 1475 maint/gnulib/lib/regcomp.c dfa->nexts[idx] = node->next->node_idx; next 1999 maint/gnulib/lib/regcomp.c re_token_t next; next 2001 maint/gnulib/lib/regcomp.c peek_token (&next, input, syntax); next 2003 maint/gnulib/lib/regcomp.c if (next.type != OP_ALT && next.type != OP_CLOSE_SUBEXP) next 3813 maint/gnulib/lib/regcomp.c storage->next = dfa->str_tree_storage; next 3826 maint/gnulib/lib/regcomp.c tree->next = NULL; next 474 maint/gnulib/lib/regex_internal.h struct bin_tree_t *next; next 489 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 368 tools/cibadmin.c for (child = xml->children; child; child = child->next) { next 310 tools/crm_mon.c node = node->next; next 1720 tools/crm_mon.c for (gIter = data_set->nodes; gIter != NULL; gIter = gIter->next) { next 1837 tools/crm_mon.c for(cIter = xml->children; cIter; cIter = cIter->next) { next 230 tools/crm_node.c node_iter != NULL; node_iter = node_iter->next) { next 979 tools/crm_resource.c for(iter = rsc->children; iter; iter = iter->next) { next 1095 tools/crm_resource.c for (ele = remaining; ele != NULL; ele = ele->next) { next 88 tools/crm_resource_ban.c for(; n && rc == pcmk_rc_ok; n = n->next) { next 329 tools/crm_resource_ban.c for(; n; n = n->next) { next 99 tools/crm_resource_print.c for (GList *lpc = ops; lpc != NULL; lpc = lpc->next) { next 530 tools/crm_resource_print.c for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) { next 574 tools/crm_resource_print.c for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) { next 604 tools/crm_resource_print.c for (lpc = resources; lpc != NULL; lpc = lpc->next) { next 637 tools/crm_resource_print.c for (lpc = activeResources; lpc != NULL; lpc = lpc->next) { next 644 tools/crm_resource_print.c for(lpc = unactiveResources; lpc != NULL; lpc = lpc->next) { next 689 tools/crm_resource_print.c for (lpc = resources; lpc != NULL; lpc = lpc->next) { next 723 tools/crm_resource_print.c for (lpc = activeResources; lpc != NULL; lpc = lpc->next) { next 736 tools/crm_resource_print.c for(lpc = unactiveResources; lpc != NULL; lpc = lpc->next) { next 51 tools/crm_resource_runtime.c for (GList *iter = rsc->children; iter != NULL; iter = iter->next) { next 54 tools/crm_resource_runtime.c for (GList *iter2 = child->running_on; iter2 != NULL; iter2 = iter2->next) { next 88 tools/crm_resource_runtime.c for (GList *iter = rsc->running_on; iter != NULL; iter = iter->next) { next 199 tools/crm_resource_runtime.c for(GList *gIter = rsc->children; gIter; gIter = gIter->next) { next 331 tools/crm_resource_runtime.c ; gIter; gIter = gIter->next) { next 409 tools/crm_resource_runtime.c for (lpc = rsc->rsc_cons_lhs; lpc != NULL; lpc = lpc->next) { next 456 tools/crm_resource_runtime.c for(GList *gIter = resources; gIter; gIter = gIter->next) { next 739 tools/crm_resource_runtime.c for (lpc = rsc->children; lpc != NULL; lpc = lpc->next) { next 773 tools/crm_resource_runtime.c for (lpc = nodes; lpc != NULL; lpc = lpc->next) { next 879 tools/crm_resource_runtime.c for (GList *iter = data_set->nodes; iter; iter = iter->next) { next 979 tools/crm_resource_runtime.c for (hIter = hosts; host != NULL && hIter != NULL; hIter = hIter->next) { next 1020 tools/crm_resource_runtime.c for (rIter = rsc_list; rIter != NULL; rIter = rIter->next) { next 1042 tools/crm_resource_runtime.c for (item = items; item != NULL; item = item->next) { next 1052 tools/crm_resource_runtime.c for (item = items; item != NULL; item = item->next) { next 1199 tools/crm_resource_runtime.c for(iter = rsc->children; iter; iter = iter->next) { next 1234 tools/crm_resource_runtime.c for (item = resources; item != NULL; item = item->next) { next 1563 tools/crm_resource_runtime.c for (action = actions; action != NULL; action = action->next) { next 1579 tools/crm_resource_runtime.c for (action = actions; action != NULL; action = action->next) { next 1930 tools/crm_resource_runtime.c for(iter = rsc->children; iter; iter = iter->next) { next 357 tools/crm_ticket.c for(list_iter = attr_delete; list_iter; list_iter = list_iter->next) { next 407 tools/crm_ticket.c for(list_iter = attr_delete; list_iter; list_iter = list_iter->next) { next 300 tools/ipmiservicelogd.c sl_event.next = NULL; /* only used if in a linked list */