entry 160 daemons/controld/controld_execd.c rsc_history_t *entry = NULL; entry 175 daemons/controld/controld_execd.c entry = g_hash_table_lookup(lrm_state->resource_history, op->rsc_id); entry 176 daemons/controld/controld_execd.c if (entry == NULL && rsc) { entry 177 daemons/controld/controld_execd.c entry = pcmk__assert_alloc(1, sizeof(rsc_history_t)); entry 178 daemons/controld/controld_execd.c entry->id = pcmk__str_copy(op->rsc_id); entry 179 daemons/controld/controld_execd.c g_hash_table_insert(lrm_state->resource_history, entry->id, entry); entry 181 daemons/controld/controld_execd.c entry->rsc.id = entry->id; entry 182 daemons/controld/controld_execd.c entry->rsc.type = pcmk__str_copy(rsc->type); entry 183 daemons/controld/controld_execd.c entry->rsc.standard = pcmk__str_copy(rsc->standard); entry 184 daemons/controld/controld_execd.c entry->rsc.provider = pcmk__str_copy(rsc->provider); entry 186 daemons/controld/controld_execd.c } else if (entry == NULL) { entry 191 daemons/controld/controld_execd.c entry->last_callid = op->call_id; entry 197 daemons/controld/controld_execd.c history_remove_recurring_op(entry, op); entry 209 daemons/controld/controld_execd.c if (entry->failed) { entry 210 daemons/controld/controld_execd.c lrmd_free_event(entry->failed); entry 212 daemons/controld/controld_execd.c entry->failed = lrmd_copy_event(op); entry 215 daemons/controld/controld_execd.c if (entry->last) { entry 216 daemons/controld/controld_execd.c lrmd_free_event(entry->last); entry 218 daemons/controld/controld_execd.c entry->last = lrmd_copy_event(op); entry 224 daemons/controld/controld_execd.c if (entry->stop_params) { entry 225 daemons/controld/controld_execd.c g_hash_table_destroy(entry->stop_params); entry 227 daemons/controld/controld_execd.c entry->stop_params = pcmk__strkey_table(free, free); entry 229 daemons/controld/controld_execd.c g_hash_table_foreach(op->params, copy_instance_keys, entry->stop_params); entry 235 daemons/controld/controld_execd.c history_remove_recurring_op(entry, op); entry 239 daemons/controld/controld_execd.c entry->recurring_op_list = g_list_prepend(entry->recurring_op_list, lrmd_copy_event(op)); entry 241 daemons/controld/controld_execd.c } else if ((entry->recurring_op_list != NULL) entry 245 daemons/controld/controld_execd.c g_list_length(entry->recurring_op_list), op->rsc_id, entry 247 daemons/controld/controld_execd.c history_free_recurring_ops(entry); entry 399 daemons/controld/controld_execd.c rsc_history_t *entry = NULL; entry 463 daemons/controld/controld_execd.c while (g_hash_table_iter_next(&gIter, NULL, (gpointer*)&entry)) { entry 464 daemons/controld/controld_execd.c if (is_rsc_active(lrm_state, entry->id) == FALSE) { entry 470 daemons/controld/controld_execd.c crm_info("Found %s active at %s", entry->id, when); entry 472 daemons/controld/controld_execd.c crm_trace("Found %s active at %s", entry->id, when); entry 479 daemons/controld/controld_execd.c if (pcmk__str_eq(entry->id, pending->rsc_id, pcmk__str_none)) { entry 499 daemons/controld/controld_execd.c rsc_history_t *entry = NULL; entry 501 daemons/controld/controld_execd.c entry = g_hash_table_lookup(lrm_state->resource_history, rsc_id); entry 502 daemons/controld/controld_execd.c if (entry == NULL || entry->last == NULL) { entry 506 daemons/controld/controld_execd.c crm_trace("Processing %s: %s.%d=%d", rsc_id, entry->last->op_type, entry 507 daemons/controld/controld_execd.c entry->last->interval_ms, entry->last->rc); entry 508 daemons/controld/controld_execd.c if ((entry->last->rc == PCMK_OCF_OK) entry 509 daemons/controld/controld_execd.c && pcmk__str_eq(entry->last->op_type, PCMK_ACTION_STOP, entry 513 daemons/controld/controld_execd.c } else if (entry->last->rc == PCMK_OCF_OK entry 514 daemons/controld/controld_execd.c && pcmk__str_eq(entry->last->op_type, PCMK_ACTION_MIGRATE_TO, entry 519 daemons/controld/controld_execd.c } else if (entry->last->rc == PCMK_OCF_NOT_RUNNING) { entry 522 daemons/controld/controld_execd.c } else if ((entry->last->interval_ms == 0) entry 523 daemons/controld/controld_execd.c && (entry->last->rc == PCMK_OCF_NOT_CONFIGURED)) { entry 535 daemons/controld/controld_execd.c rsc_history_t *entry = NULL; entry 538 daemons/controld/controld_execd.c while (g_hash_table_iter_next(&iter, NULL, (void **)&entry)) { entry 543 daemons/controld/controld_execd.c crm_xml_add(xml_rsc, PCMK_XA_ID, entry->id); entry 544 daemons/controld/controld_execd.c crm_xml_add(xml_rsc, PCMK_XA_TYPE, entry->rsc.type); entry 545 daemons/controld/controld_execd.c crm_xml_add(xml_rsc, PCMK_XA_CLASS, entry->rsc.standard); entry 546 daemons/controld/controld_execd.c crm_xml_add(xml_rsc, PCMK_XA_PROVIDER, entry->rsc.provider); entry 548 daemons/controld/controld_execd.c if (entry->last && entry->last->params) { entry 550 daemons/controld/controld_execd.c const char *container = g_hash_table_lookup(entry->last->params, entry 554 daemons/controld/controld_execd.c crm_trace("Resource %s is a part of container resource %s", entry->id, container); entry 558 daemons/controld/controld_execd.c controld_add_resource_history_xml(xml_rsc, &(entry->rsc), entry->failed, entry 560 daemons/controld/controld_execd.c controld_add_resource_history_xml(xml_rsc, &(entry->rsc), entry->last, entry 562 daemons/controld/controld_execd.c for (gIter = entry->recurring_op_list; gIter != NULL; gIter = gIter->next) { entry 563 daemons/controld/controld_execd.c controld_add_resource_history_xml(xml_rsc, &(entry->rsc), gIter->data, entry 744 daemons/controld/controld_execd.c last_failed_matches_op(rsc_history_t *entry, const char *op, guint interval_ms) entry 746 daemons/controld/controld_execd.c if (entry == NULL) { entry 752 daemons/controld/controld_execd.c return (pcmk__str_eq(op, entry->failed->op_type, pcmk__str_casei) entry 753 daemons/controld/controld_execd.c && (interval_ms == entry->failed->interval_ms)); entry 779 daemons/controld/controld_execd.c rsc_history_t *entry = g_hash_table_lookup(lrm_state->resource_history, entry 782 daemons/controld/controld_execd.c if (last_failed_matches_op(entry, operation, interval_ms)) { entry 783 daemons/controld/controld_execd.c lrmd_free_event(entry->failed); entry 784 daemons/controld/controld_execd.c entry->failed = NULL; entry 1005 daemons/controld/controld_execd.c rsc_history_t *entry = NULL; entry 1008 daemons/controld/controld_execd.c entry = g_hash_table_lookup(lrm_state->resource_history, rsc_id); entry 1014 daemons/controld/controld_execd.c if (entry) { entry 1015 daemons/controld/controld_execd.c call_id = entry->last_callid + 1; entry 1041 daemons/controld/controld_execd.c rsc_history_t *entry = NULL; entry 1045 daemons/controld/controld_execd.c while (g_hash_table_iter_next(&gIter, NULL, (void **)&entry)) { entry 1051 daemons/controld/controld_execd.c if (is_remote_lrmd_ra(NULL, NULL, entry->id)) { entry 1055 daemons/controld/controld_execd.c lrm_state_t *remote_lrm_state = lrm_state_find(entry->id); entry 1070 daemons/controld/controld_execd.c delete_resource(lrm_state, entry->id, &entry->rsc, &gIter, from_sys, entry 1685 daemons/controld/controld_execd.c rsc_history_t *entry = NULL; entry 1688 daemons/controld/controld_execd.c entry = g_hash_table_lookup(lrm_state->resource_history, rsc_id); entry 1693 daemons/controld/controld_execd.c if (!entry || !entry->stop_params) { entry 1701 daemons/controld/controld_execd.c g_hash_table_foreach(entry->stop_params, copy_instance_keys, op->params); entry 2116 daemons/controld/controld_execd.c rsc_history_t *entry = NULL; entry 2122 daemons/controld/controld_execd.c entry = g_hash_table_lookup(lrm_state->resource_history, rsc_id); entry 2123 daemons/controld/controld_execd.c if (entry == NULL || entry->failed == NULL) { entry 2127 daemons/controld/controld_execd.c if (pcmk__str_eq(entry->failed->rsc_id, rsc_id, pcmk__str_none) entry 2128 daemons/controld/controld_execd.c && pcmk__str_eq(entry->failed->op_type, op_type, pcmk__str_casei) entry 2129 daemons/controld/controld_execd.c && entry->failed->interval_ms == interval_ms) { entry 3099 daemons/fenced/fenced_commands.c crm_node_t *entry = NULL; entry 3102 daemons/fenced/fenced_commands.c while (g_hash_table_iter_next(&gIter, NULL, (void **)&entry)) { entry 3103 daemons/fenced/fenced_commands.c if (fencing_peer_active(entry) entry 3104 daemons/fenced/fenced_commands.c && !pcmk__str_eq(entry->uname, target, pcmk__str_casei)) { entry 3106 daemons/fenced/fenced_commands.c entry->uname); entry 3107 daemons/fenced/fenced_commands.c return entry->uname; entry 332 daemons/fenced/fenced_history.c xmlNode *entry = NULL; entry 380 daemons/fenced/fenced_history.c entry = pcmk__xe_create(history, STONITH_OP_EXEC); entry 382 daemons/fenced/fenced_history.c crm_xml_add(entry, PCMK__XA_ST_REMOTE_OP, op->id); entry 384 daemons/fenced/fenced_history.c crm_xml_add(entry, PCMK__XA_ST_TARGET, op->target); entry 385 daemons/fenced/fenced_history.c crm_xml_add(entry, PCMK__XA_ST_DEVICE_ACTION, op->action); entry 386 daemons/fenced/fenced_history.c crm_xml_add(entry, PCMK__XA_ST_ORIGIN, op->originator); entry 387 daemons/fenced/fenced_history.c crm_xml_add(entry, PCMK__XA_ST_DELEGATE, op->delegate); entry 388 daemons/fenced/fenced_history.c crm_xml_add(entry, PCMK__XA_ST_CLIENTNAME, op->client_name); entry 389 daemons/fenced/fenced_history.c crm_xml_add_ll(entry, PCMK__XA_ST_DATE, op->completed); entry 390 daemons/fenced/fenced_history.c crm_xml_add_ll(entry, PCMK__XA_ST_DATE_NSEC, entry 392 daemons/fenced/fenced_history.c crm_xml_add_int(entry, PCMK__XA_ST_STATE, op->state); entry 393 daemons/fenced/fenced_history.c stonith__xe_set_result(entry, &op->result); entry 1087 daemons/fenced/fenced_remote.c crm_node_t *entry; entry 1091 daemons/fenced/fenced_remote.c while (g_hash_table_iter_next(&gIter, NULL, (void **)&entry)) { entry 1092 daemons/fenced/fenced_remote.c if(fencing_peer_active(entry)) { entry 72 include/crm/common/alerts_internal.h pcmk__alert_t *pcmk__dup_alert(const pcmk__alert_t *entry); entry 74 include/crm/common/alerts_internal.h void pcmk__free_alert(pcmk__alert_t *entry); entry 827 lib/cib/cib_utils.c cib_notify_client_t *entry = data; entry 837 lib/cib/cib_utils.c if (entry == NULL) { entry 841 lib/cib/cib_utils.c } else if (entry->callback == NULL) { entry 845 lib/cib/cib_utils.c } else if (!pcmk__str_eq(entry->event, event, pcmk__str_casei)) { entry 846 lib/cib/cib_utils.c crm_trace("Skipping callback - event mismatch %p/%s vs. %s", entry, entry->event, event); entry 850 lib/cib/cib_utils.c crm_trace("Invoking callback for %p/%s event...", entry, event); entry 851 lib/cib/cib_utils.c entry->callback(event, msg); entry 97 lib/common/alerts.c pcmk__alert_t *entry = pcmk__assert_alloc(1, sizeof(pcmk__alert_t)); entry 100 lib/common/alerts.c entry->id = pcmk__str_copy(id); entry 101 lib/common/alerts.c entry->path = pcmk__str_copy(path); entry 102 lib/common/alerts.c entry->timeout = PCMK__ALERT_DEFAULT_TIMEOUT_MS; entry 103 lib/common/alerts.c entry->flags = pcmk__alert_default; entry 104 lib/common/alerts.c return entry; entry 108 lib/common/alerts.c pcmk__free_alert(pcmk__alert_t *entry) entry 110 lib/common/alerts.c if (entry) { entry 111 lib/common/alerts.c free(entry->id); entry 112 lib/common/alerts.c free(entry->path); entry 113 lib/common/alerts.c free(entry->tstamp_format); entry 114 lib/common/alerts.c free(entry->recipient); entry 116 lib/common/alerts.c g_strfreev(entry->select_attribute_name); entry 117 lib/common/alerts.c if (entry->envvars) { entry 118 lib/common/alerts.c g_hash_table_destroy(entry->envvars); entry 120 lib/common/alerts.c free(entry); entry 133 lib/common/alerts.c pcmk__dup_alert(const pcmk__alert_t *entry) entry 135 lib/common/alerts.c pcmk__alert_t *new_entry = pcmk__alert_new(entry->id, entry->path); entry 137 lib/common/alerts.c new_entry->timeout = entry->timeout; entry 138 lib/common/alerts.c new_entry->flags = entry->flags; entry 139 lib/common/alerts.c new_entry->envvars = pcmk__str_table_dup(entry->envvars); entry 140 lib/common/alerts.c new_entry->tstamp_format = pcmk__str_copy(entry->tstamp_format); entry 141 lib/common/alerts.c new_entry->recipient = pcmk__str_copy(entry->recipient); entry 142 lib/common/alerts.c if (entry->select_attribute_name) { entry 143 lib/common/alerts.c new_entry->select_attribute_name = g_strdupv(entry->select_attribute_name); entry 597 lib/common/io.c struct dirent *entry; entry 600 lib/common/io.c while ((entry = readdir(dir)) != NULL) { entry 601 lib/common/io.c int lpc = atoi(entry->d_name); entry 159 lib/common/output.c for (const pcmk__supported_format_t *entry = formats; entry->name != NULL; entry 160 lib/common/output.c entry++) { entry 161 lib/common/output.c pcmk__register_format(group, entry->name, entry->create, entry->options); entry 206 lib/common/output.c for (const pcmk__message_entry_t *entry = table; entry->message_id != NULL; entry 207 lib/common/output.c entry++) { entry 208 lib/common/output.c if (pcmk__strcase_any_of(entry->fmt_name, "default", out->fmt_name, NULL)) { entry 209 lib/common/output.c pcmk__register_message(out, entry->message_id, entry->fn); entry 40 lib/common/procfs.c pcmk__procfs_process_info(const struct dirent *entry, char *name, pid_t *pid) entry 52 lib/common/procfs.c local_pid = atoi(entry->d_name); entry 53 lib/common/procfs.c if ((local_pid <= 0) || (strlen(entry->d_name) > 114)) { entry 62 lib/common/procfs.c strcat(procpath, entry->d_name); entry 114 lib/common/procfs.c struct dirent *entry; entry 124 lib/common/procfs.c while ((entry = readdir(dp)) != NULL) { entry 125 lib/common/procfs.c if ((pcmk__procfs_process_info(entry, entry_name, &pid) == pcmk_rc_ok) entry 84 lib/common/schemas.c GList *entry = pcmk__get_schema("pacemaker-next"); entry 86 lib/common/schemas.c pcmk__assert((entry != NULL) && (entry->prev != NULL)); entry 87 lib/common/schemas.c return entry->prev; entry 99 lib/common/schemas.c GList *entry = get_highest_schema(); entry 101 lib/common/schemas.c return ((pcmk__schema_t *)(entry->data))->name; entry 761 lib/common/schemas.c GList *entry = NULL; entry 775 lib/common/schemas.c for (entry = known_schemas; entry != NULL; entry = entry->next) { entry 776 lib/common/schemas.c schema = entry->data; entry 786 lib/common/schemas.c entry = pcmk__get_schema(validation); entry 787 lib/common/schemas.c if (entry == NULL) { entry 795 lib/common/schemas.c schema = entry->data; entry 1153 lib/common/schemas.c GList *entry = NULL; entry 1175 lib/common/schemas.c entry = get_configured_schema(*xml); entry 1176 lib/common/schemas.c if (entry == NULL) { entry 1178 lib/common/schemas.c entry = known_schemas; entry 1180 lib/common/schemas.c original_schema = entry->data; entry 1186 lib/common/schemas.c for (; entry != NULL; entry = entry->next) { entry 1187 lib/common/schemas.c pcmk__schema_t *current_schema = entry->data; entry 1213 lib/common/schemas.c || validate_with_silent(*xml, entry->next->data)) { entry 1273 lib/common/schemas.c GList *entry = NULL; entry 1279 lib/common/schemas.c entry = pcmk__get_schema(original_schema_name); entry 1280 lib/common/schemas.c if (entry != NULL) { entry 1281 lib/common/schemas.c pcmk__schema_t *original_schema = entry->data; entry 1293 lib/common/schemas.c entry = NULL; entry 1298 lib/common/schemas.c entry = pcmk__get_schema(new_schema_name); entry 1300 lib/common/schemas.c schema = (entry == NULL)? NULL : entry->data; entry 1372 lib/common/schemas.c entry = pcmk__get_schema(PCMK_VALUE_NONE); entry 1373 lib/common/schemas.c pcmk__assert((entry != NULL) && (entry->data != NULL)); entry 1375 lib/common/schemas.c none_schema = entry->data; entry 1745 lib/common/schemas.c GList *entry = pcmk__get_schema(name); entry 1746 lib/common/schemas.c pcmk__schema_t *schema = (entry == NULL)? NULL : entry->data; entry 116 lib/common/tests/schemas/crm_schema_init_test.c GList *entry = NULL; entry 119 lib/common/tests/schemas/crm_schema_init_test.c entry = pcmk__get_schema(schema_name); entry 120 lib/common/tests/schemas/crm_schema_init_test.c assert_non_null(entry); entry 122 lib/common/tests/schemas/crm_schema_init_test.c schema = entry->data; entry 39 lib/common/tests/schemas/pcmk__find_x_0_schema_test.c GList *entry = NULL; entry 42 lib/common/tests/schemas/pcmk__find_x_0_schema_test.c entry = pcmk__find_x_0_schema(); entry 43 lib/common/tests/schemas/pcmk__find_x_0_schema_test.c assert_non_null(entry); entry 45 lib/common/tests/schemas/pcmk__find_x_0_schema_test.c schema = entry->data; entry 1257 lib/fencing/st_client.c stonith_notify_client_t *entry = data; entry 1260 lib/fencing/st_client.c if (!entry->delete) { entry 1261 lib/fencing/st_client.c crm_debug("Removing callback for %s events", entry->event); entry 1262 lib/fencing/st_client.c stonith_api_del_notification(stonith, entry->event); entry 1495 lib/fencing/st_client.c stonith_notify_client_t *entry = data; entry 1506 lib/fencing/st_client.c if (entry == NULL) { entry 1510 lib/fencing/st_client.c } else if (entry->delete) { entry 1514 lib/fencing/st_client.c } else if (entry->notify == NULL) { entry 1518 lib/fencing/st_client.c } else if (!pcmk__str_eq(entry->event, event, pcmk__str_none)) { entry 1519 lib/fencing/st_client.c crm_trace("Skipping callback - event mismatch %p/%s vs. %s", entry, entry->event, event); entry 1525 lib/fencing/st_client.c crm_trace("Invoking callback for %p/%s event...", entry, event); entry 1526 lib/fencing/st_client.c entry->notify(blob->stonith, st_event); entry 2158 lib/fencing/st_client.c char *entry = NULL; entry 2166 lib/fencing/st_client.c entry = pcmk__assert_alloc(i - entry_start + 1, sizeof(char)); entry 2172 lib/fencing/st_client.c rc = sscanf(line + entry_start, "%[a-zA-Z0-9_-.]", entry); entry 2177 lib/fencing/st_client.c free(entry); entry 2179 lib/fencing/st_client.c } else if (pcmk__strcase_any_of(entry, PCMK_ACTION_ON, entry 2189 lib/fencing/st_client.c free(entry); entry 2193 lib/fencing/st_client.c *output = g_list_append(*output, entry); entry 124 lib/fencing/st_lha.c char **entry = NULL; entry 143 lib/fencing/st_lha.c for (entry = type_list; entry != NULL && *entry; ++entry) { entry 144 lib/fencing/st_lha.c crm_trace("Added: %s", *entry); entry 145 lib/fencing/st_lha.c *devices = stonith_key_value_add(*devices, NULL, *entry); entry 77 lib/lrmd/lrmd_alerts.c alert_envvar2params(lrmd_key_value_t *head, const pcmk__alert_t *entry) entry 79 lib/lrmd/lrmd_alerts.c if (entry->envvars) { entry 80 lib/lrmd/lrmd_alerts.c g_hash_table_foreach(entry->envvars, set_ev_kv, &head); entry 144 lib/lrmd/lrmd_alerts.c const pcmk__alert_t *entry = (pcmk__alert_t *) (iter->data); entry 149 lib/lrmd/lrmd_alerts.c if (!pcmk_is_set(entry->flags, kind)) { entry 151 lib/lrmd/lrmd_alerts.c kind_s, entry->recipient, entry->id); entry 156 lib/lrmd/lrmd_alerts.c && !is_target_alert(entry->select_attribute_name, attr_name)) { entry 159 lib/lrmd/lrmd_alerts.c attr_name, entry->recipient, entry->id); entry 167 lib/lrmd/lrmd_alerts.c kind_s, entry->id, entry->recipient); entry 175 lib/lrmd/lrmd_alerts.c entry->recipient); entry 178 lib/lrmd/lrmd_alerts.c char *timestamp = pcmk__time_format_hr(entry->tstamp_format, now); entry 198 lib/lrmd/lrmd_alerts.c copy_params = alert_envvar2params(copy_params, entry); entry 200 lib/lrmd/lrmd_alerts.c rc = lrmd->cmds->exec_alert(lrmd, entry->id, entry->path, entry 201 lib/lrmd/lrmd_alerts.c entry->timeout, copy_params); entry 204 lib/lrmd/lrmd_alerts.c entry->id, pcmk_strerror(rc), rc); entry 96 lib/pengine/pe_notif.c dup_notify_entry(const notify_entry_t *entry) entry 100 lib/pengine/pe_notif.c dup->rsc = entry->rsc; entry 101 lib/pengine/pe_notif.c dup->node = entry->node; entry 194 lib/pengine/pe_notif.c notify_entry_t *entry = (notify_entry_t *) gIter->data; entry 197 lib/pengine/pe_notif.c CRM_LOG_ASSERT((entry != NULL) && (entry->rsc != NULL) entry 198 lib/pengine/pe_notif.c && (entry->rsc->id != NULL)); entry 199 lib/pengine/pe_notif.c if ((entry == NULL) || (entry->rsc == NULL) entry 200 lib/pengine/pe_notif.c || (entry->rsc->id == NULL)) { entry 205 lib/pengine/pe_notif.c CRM_LOG_ASSERT((node_names == NULL) || (entry->node != NULL)); entry 206 lib/pengine/pe_notif.c if ((node_names != NULL) && (entry->node == NULL)) { entry 211 lib/pengine/pe_notif.c if (pcmk__str_eq(entry->rsc->id, last_rsc_id, pcmk__str_none)) { entry 214 lib/pengine/pe_notif.c last_rsc_id = entry->rsc->id; entry 217 lib/pengine/pe_notif.c pcmk__add_word(rsc_names, 1024, entry->rsc->id); entry 219 lib/pengine/pe_notif.c if ((node_names != NULL) && (entry->node->details->uname != NULL)) { entry 220 lib/pengine/pe_notif.c pcmk__add_word(node_names, 1024, entry->node->details->uname); entry 521 lib/pengine/pe_notif.c notify_entry_t *entry = pcmk__assert_alloc(1, sizeof(notify_entry_t)); entry 523 lib/pengine/pe_notif.c entry->rsc = rsc; entry 524 lib/pengine/pe_notif.c entry->node = node; entry 525 lib/pengine/pe_notif.c return entry; entry 541 lib/pengine/pe_notif.c notify_entry_t *entry = NULL; entry 567 lib/pengine/pe_notif.c entry = new_notify_entry(rsc, node); entry 572 lib/pengine/pe_notif.c n_data->inactive = g_list_prepend(n_data->inactive, entry); entry 576 lib/pengine/pe_notif.c n_data->active = g_list_prepend(n_data->active, entry); entry 580 lib/pengine/pe_notif.c n_data->unpromoted = g_list_prepend(n_data->unpromoted, entry); entry 582 lib/pengine/pe_notif.c dup_notify_entry(entry)); entry 586 lib/pengine/pe_notif.c n_data->promoted = g_list_prepend(n_data->promoted, entry); entry 588 lib/pengine/pe_notif.c dup_notify_entry(entry)); entry 596 lib/pengine/pe_notif.c free(entry); entry 618 lib/pengine/pe_notif.c entry = new_notify_entry(rsc, op->node); entry 622 lib/pengine/pe_notif.c n_data->start = g_list_prepend(n_data->start, entry); entry 625 lib/pengine/pe_notif.c n_data->stop = g_list_prepend(n_data->stop, entry); entry 628 lib/pengine/pe_notif.c n_data->promote = g_list_prepend(n_data->promote, entry); entry 631 lib/pengine/pe_notif.c n_data->demote = g_list_prepend(n_data->demote, entry); entry 634 lib/pengine/pe_notif.c free(entry); entry 29 lib/pengine/rules_alerts.c get_meta_attrs_from_cib(xmlNode *basenode, pcmk__alert_t *entry, entry 52 lib/pengine/rules_alerts.c entry->timeout = (int) QB_MIN(timeout_ms, INT_MAX); entry 53 lib/pengine/rules_alerts.c if (entry->timeout <= 0) { entry 54 lib/pengine/rules_alerts.c if (entry->timeout == 0) { entry 56 lib/pengine/rules_alerts.c entry->id, PCMK__ALERT_DEFAULT_TIMEOUT_MS); entry 60 lib/pengine/rules_alerts.c entry->id, value, entry 63 lib/pengine/rules_alerts.c entry->timeout = PCMK__ALERT_DEFAULT_TIMEOUT_MS; entry 66 lib/pengine/rules_alerts.c entry->id, entry->timeout); entry 68 lib/pengine/rules_alerts.c if (entry->timeout > *max_timeout) { entry 69 lib/pengine/rules_alerts.c *max_timeout = entry->timeout; entry 77 lib/pengine/rules_alerts.c entry->tstamp_format = strdup(value); entry 79 lib/pengine/rules_alerts.c entry->id, entry->tstamp_format); entry 88 lib/pengine/rules_alerts.c get_envvars_from_cib(xmlNode *basenode, pcmk__alert_t *entry) entry 92 lib/pengine/rules_alerts.c if ((basenode == NULL) || (entry == NULL)) { entry 102 lib/pengine/rules_alerts.c if (entry->envvars == NULL) { entry 103 lib/pengine/rules_alerts.c entry->envvars = pcmk__strkey_table(free, free); entry 115 lib/pengine/rules_alerts.c pcmk__insert_dup(entry->envvars, name, value); entry 117 lib/pengine/rules_alerts.c entry->id, name, value); entry 122 lib/pengine/rules_alerts.c unpack_alert_filter(xmlNode *basenode, pcmk__alert_t *entry) entry 154 lib/pengine/rules_alerts.c g_strfreev(entry->select_attribute_name); entry 155 lib/pengine/rules_alerts.c entry->select_attribute_name = NULL; entry 158 lib/pengine/rules_alerts.c entry->select_attribute_name = pcmk__realloc(entry->select_attribute_name, entry 160 lib/pengine/rules_alerts.c entry->select_attribute_name[nattrs - 1] = strdup(attr_name); entry 161 lib/pengine/rules_alerts.c entry->select_attribute_name[nattrs] = NULL; entry 168 lib/pengine/rules_alerts.c entry->flags = flags; entry 170 lib/pengine/rules_alerts.c entry->id, entry 172 lib/pengine/rules_alerts.c (entry->select_attribute_name? "some" : "all") : "none"), entry 190 lib/pengine/rules_alerts.c unpack_alert(xmlNode *alert, pcmk__alert_t *entry, guint *max_timeout) entry 194 lib/pengine/rules_alerts.c get_envvars_from_cib(alert, entry); entry 195 lib/pengine/rules_alerts.c rc = get_meta_attrs_from_cib(alert, entry, max_timeout); entry 197 lib/pengine/rules_alerts.c unpack_alert_filter(alert, entry); entry 217 lib/pengine/rules_alerts.c pcmk__alert_t *entry; entry 244 lib/pengine/rules_alerts.c entry = pcmk__alert_new(alert_id, alert_path); entry 246 lib/pengine/rules_alerts.c if (unpack_alert(alert, entry, &max_timeout) != pcmk_rc_ok) { entry 248 lib/pengine/rules_alerts.c crm_debug("Alert %s is disabled", entry->id); entry 249 lib/pengine/rules_alerts.c pcmk__free_alert(entry); entry 253 lib/pengine/rules_alerts.c if (entry->tstamp_format == NULL) { entry 254 lib/pengine/rules_alerts.c entry->tstamp_format = strdup(PCMK__ALERT_DEFAULT_TSTAMP_FORMAT); entry 258 lib/pengine/rules_alerts.c entry->id, entry->path, entry->timeout, entry->tstamp_format, entry 259 lib/pengine/rules_alerts.c (entry->envvars? g_hash_table_size(entry->envvars) : 0)); entry 265 lib/pengine/rules_alerts.c pcmk__alert_t *recipient_entry = pcmk__dup_alert(entry); entry 274 lib/pengine/rules_alerts.c entry->id, recipient_entry->id); entry 280 lib/pengine/rules_alerts.c entry->id, pcmk__xe_id(recipient), entry 287 lib/pengine/rules_alerts.c alert_list = g_list_prepend(alert_list, entry); entry 289 lib/pengine/rules_alerts.c pcmk__free_alert(entry); entry 3214 lib/pengine/unpack.c get_migration_node_names(const xmlNode *entry, const pcmk_node_t *source_node, entry 3218 lib/pengine/unpack.c *source_name = crm_element_value(entry, PCMK__META_MIGRATE_SOURCE); entry 3219 lib/pengine/unpack.c *target_name = crm_element_value(entry, PCMK__META_MIGRATE_TARGET); entry 3223 lib/pengine/unpack.c PCMK__META_MIGRATE_TARGET, pcmk__xe_id(entry)); entry 3232 lib/pengine/unpack.c pcmk__xe_id(entry), *source_name, entry 3242 lib/pengine/unpack.c pcmk__xe_id(entry), *target_name, entry 56 libltdl/libltdl/lt__argz_.h char *before, const char *entry); entry 58 libltdl/libltdl/lt__argz_.h const char *entry); entry 79 libltdl/libltdl/lt__dirent.h LT_SCOPE struct dirent *readdir (DIR *entry); entry 80 libltdl/libltdl/lt__dirent.h LT_SCOPE void closedir (DIR *entry); entry 132 libltdl/lt__argz.c argz_insert (char **pargz, size_t *pargz_len, char *before, const char *entry) entry 136 libltdl/lt__argz.c assert (entry && *entry); entry 141 libltdl/lt__argz.c return argz_append (pargz, pargz_len, entry, 1+ strlen (entry)); entry 150 libltdl/lt__argz.c size_t entry_len = 1+ strlen (entry); entry 166 libltdl/lt__argz.c memcpy (before, entry, entry_len); entry 178 libltdl/lt__argz.c argz_next (char *argz, size_t argz_len, const char *entry) entry 182 libltdl/lt__argz.c if (entry) entry 187 libltdl/lt__argz.c || ((argz <= entry) && (entry < (argz + argz_len)))); entry 191 libltdl/lt__argz.c entry = 1+ strchr (entry, EOS_CHAR); entry 195 libltdl/lt__argz.c return (entry >= argz + argz_len) ? 0 : (char *) entry; entry 40 libltdl/lt__dirent.c closedir (DIR *entry) entry 42 libltdl/lt__dirent.c assert (entry != (DIR *) NULL); entry 43 libltdl/lt__dirent.c FindClose (entry->hSearch); entry 44 libltdl/lt__dirent.c free (entry); entry 52 libltdl/lt__dirent.c DIR *entry; entry 58 libltdl/lt__dirent.c entry = (DIR *) malloc (sizeof(DIR)); entry 59 libltdl/lt__dirent.c if (entry != (DIR *) 0) entry 61 libltdl/lt__dirent.c entry->firsttime = TRUE; entry 62 libltdl/lt__dirent.c entry->hSearch = FindFirstFile (file_spec, &entry->Win32FindData); entry 64 libltdl/lt__dirent.c if (entry->hSearch == INVALID_HANDLE_VALUE) entry 68 libltdl/lt__dirent.c entry->hSearch = FindFirstFile (file_spec, &entry->Win32FindData); entry 71 libltdl/lt__dirent.c if (entry->hSearch == INVALID_HANDLE_VALUE) entry 73 libltdl/lt__dirent.c entry = (free (entry), (DIR *) 0); entry 78 libltdl/lt__dirent.c return entry; entry 83 libltdl/lt__dirent.c readdir (DIR *entry) entry 87 libltdl/lt__dirent.c if (entry == (DIR *) 0) entry 90 libltdl/lt__dirent.c if (!entry->firsttime) entry 92 libltdl/lt__dirent.c status = FindNextFile (entry->hSearch, &entry->Win32FindData); entry 97 libltdl/lt__dirent.c entry->firsttime = FALSE; entry 98 libltdl/lt__dirent.c if (lt_strlcpy (entry->file_info.d_name, entry->Win32FindData.cFileName, entry 99 libltdl/lt__dirent.c sizeof entry->file_info.d_name) >= sizeof entry->file_info.d_name) entry 101 libltdl/lt__dirent.c entry->file_info.d_namlen = strlen (entry->file_info.d_name); entry 103 libltdl/lt__dirent.c return &entry->file_info; entry 142 libltdl/ltdl.c char *before, const char *entry); entry 144 libltdl/ltdl.c const char *entry); entry 1722 libltdl/ltdl.c const char *entry) entry 1729 libltdl/ltdl.c error = argz_insert (pargz, pargz_len, before, entry); entry 1731 libltdl/ltdl.c error = argz_append (pargz, pargz_len, entry, 1 + strlen (entry)); entry 1751 libltdl/ltdl.c lt_argz_insertinorder (char **pargz, size_t *pargz_len, const char *entry) entry 1757 libltdl/ltdl.c assert (entry && *entry); entry 1762 libltdl/ltdl.c int cmp = strcmp (entry, before); entry 1768 libltdl/ltdl.c return lt_argz_insert (pargz, pargz_len, before, entry); entry 99 maint/gnulib/lib/acl-internal.c tag = ace->entry->acl_type; entry 103 maint/gnulib/lib/acl-internal.c perm = ace->entry->acl_perm; entry 446 maint/gnulib/lib/argp-help.c struct hol_entry *entry; entry 480 maint/gnulib/lib/argp-help.c for (o = opts, entry = hol->entries; ! oend (o); entry++) entry 482 maint/gnulib/lib/argp-help.c entry->opt = o; entry 483 maint/gnulib/lib/argp-help.c entry->num = 0; entry 484 maint/gnulib/lib/argp-help.c entry->short_options = so; entry 485 maint/gnulib/lib/argp-help.c entry->group = cur_group = entry 491 maint/gnulib/lib/argp-help.c entry->cluster = cluster; entry 492 maint/gnulib/lib/argp-help.c entry->argp = argp; entry 496 maint/gnulib/lib/argp-help.c entry->num++; entry 560 maint/gnulib/lib/argp-help.c hol_entry_short_iterate (const struct hol_entry *entry, entry 568 maint/gnulib/lib/argp-help.c const struct argp_option *opt, *real = entry->opt; entry 569 maint/gnulib/lib/argp-help.c char *so = entry->short_options; entry 571 maint/gnulib/lib/argp-help.c for (opt = real, nopts = entry->num; nopts > 0 && !val; opt++, nopts--) entry 591 maint/gnulib/lib/argp-help.c hol_entry_long_iterate (const struct hol_entry *entry, entry 599 maint/gnulib/lib/argp-help.c const struct argp_option *opt, *real = entry->opt; entry 601 maint/gnulib/lib/argp-help.c for (opt = real, nopts = entry->num; nopts > 0 && !val; opt++, nopts--) entry 623 maint/gnulib/lib/argp-help.c hol_entry_first_short (const struct hol_entry *entry) entry 625 maint/gnulib/lib/argp-help.c return hol_entry_short_iterate (entry, until_short, entry 626 maint/gnulib/lib/argp-help.c entry->argp->argp_domain, 0); entry 631 maint/gnulib/lib/argp-help.c hol_entry_first_long (const struct hol_entry *entry) entry 635 maint/gnulib/lib/argp-help.c for (opt = entry->opt, num = entry->num; num > 0; opt++, num--) entry 646 maint/gnulib/lib/argp-help.c struct hol_entry *entry = hol->entries; entry 651 maint/gnulib/lib/argp-help.c const struct argp_option *opt = entry->opt; entry 652 maint/gnulib/lib/argp-help.c unsigned num_opts = entry->num; entry 656 maint/gnulib/lib/argp-help.c return entry; entry 660 maint/gnulib/lib/argp-help.c entry++; entry 671 maint/gnulib/lib/argp-help.c struct hol_entry *entry = hol_find_entry (hol, name); entry 672 maint/gnulib/lib/argp-help.c if (entry) entry 673 maint/gnulib/lib/argp-help.c entry->group = group; entry 1114 maint/gnulib/lib/argp-help.c const struct hol_entry *entry; entry 1195 maint/gnulib/lib/argp-help.c const struct hol_cluster *cl = pest->entry->cluster; entry 1197 maint/gnulib/lib/argp-help.c if (pest->hhstate->sep_groups && pe && pest->entry->group != pe->group) entry 1224 maint/gnulib/lib/argp-help.c hol_entry_help (struct hol_entry *entry, const struct argp_state *state, entry 1228 maint/gnulib/lib/argp-help.c const struct argp_option *real = entry->opt, *opt; entry 1229 maint/gnulib/lib/argp-help.c char *so = entry->short_options; entry 1236 maint/gnulib/lib/argp-help.c struct pentry_state pest = { entry, stream, hhstate, 1, state }; entry 1239 maint/gnulib/lib/argp-help.c for (opt = real, num = entry->num; num > 0; opt++, num--) entry 1248 maint/gnulib/lib/argp-help.c for (opt = real, num = entry->num; num > 0; opt++, num--) entry 1272 maint/gnulib/lib/argp-help.c for (opt = real, num = entry->num; num > 0; opt++, num--) entry 1289 maint/gnulib/lib/argp-help.c for (opt = real, num = entry->num; num > 0; opt++, num--) entry 1307 maint/gnulib/lib/argp-help.c print_header (real->doc, entry->argp, &pest); entry 1317 maint/gnulib/lib/argp-help.c const char *fstr = filter_doc (tstr, real->key, entry->argp, state); entry 1342 maint/gnulib/lib/argp-help.c hhstate->prev_entry = entry; entry 1355 maint/gnulib/lib/argp-help.c struct hol_entry *entry; entry 1358 maint/gnulib/lib/argp-help.c for (entry = hol->entries, num = hol->num_entries; num > 0; entry++, num--) entry 1359 maint/gnulib/lib/argp-help.c hol_entry_help (entry, state, stream, &hhstate); entry 1466 maint/gnulib/lib/argp-help.c struct hol_entry *entry; entry 1471 maint/gnulib/lib/argp-help.c for (entry = hol->entries, nentries = hol->num_entries entry 1473 maint/gnulib/lib/argp-help.c ; entry++, nentries--) entry 1474 maint/gnulib/lib/argp-help.c hol_entry_short_iterate (entry, add_argless_short_opt, entry 1475 maint/gnulib/lib/argp-help.c entry->argp->argp_domain, &snao_end); entry 1483 maint/gnulib/lib/argp-help.c for (entry = hol->entries, nentries = hol->num_entries entry 1485 maint/gnulib/lib/argp-help.c ; entry++, nentries--) entry 1486 maint/gnulib/lib/argp-help.c hol_entry_short_iterate (entry, usage_argful_short_opt, entry 1487 maint/gnulib/lib/argp-help.c entry->argp->argp_domain, stream); entry 1490 maint/gnulib/lib/argp-help.c for (entry = hol->entries, nentries = hol->num_entries entry 1492 maint/gnulib/lib/argp-help.c ; entry++, nentries--) entry 1493 maint/gnulib/lib/argp-help.c hol_entry_long_iterate (entry, usage_long_opt, entry 1494 maint/gnulib/lib/argp-help.c entry->argp->argp_domain, stream); entry 145 maint/gnulib/lib/argz.c argz_insert (char **argz, size_t *argz_len, char *before, const char *entry) entry 148 maint/gnulib/lib/argz.c return argz_add (argz, argz_len, entry); entry 160 maint/gnulib/lib/argz.c size_t entry_len = strlen (entry) + 1; entry 168 maint/gnulib/lib/argz.c memmove (before, entry, entry_len); entry 180 maint/gnulib/lib/argz.c argz_next (const char *argz, size_t argz_len, const char *entry) entry 182 maint/gnulib/lib/argz.c if (entry) entry 184 maint/gnulib/lib/argz.c if (entry < argz + argz_len) entry 185 maint/gnulib/lib/argz.c entry = strchr (entry, '\0') + 1; entry 187 maint/gnulib/lib/argz.c return entry >= argz + argz_len ? NULL : (char *) entry; entry 280 maint/gnulib/lib/argz.c argz_delete (char **argz, size_t *argz_len, char *entry) entry 282 maint/gnulib/lib/argz.c if (entry) entry 285 maint/gnulib/lib/argz.c size_t entry_len = strlen (entry) + 1; entry 287 maint/gnulib/lib/argz.c memmove (entry, entry + entry_len, *argz_len - (entry - *argz)); entry 38 maint/gnulib/lib/dirent-private.h WIN32_FIND_DATA entry; entry 208 maint/gnulib/lib/git-merge-changelog.c static struct entry * entry 211 maint/gnulib/lib/git-merge-changelog.c struct entry *result = XMALLOC (struct entry); entry 222 maint/gnulib/lib/git-merge-changelog.c const struct entry *entry1 = (const struct entry *) elt1; entry 223 maint/gnulib/lib/git-merge-changelog.c const struct entry *entry2 = (const struct entry *) elt2; entry 232 maint/gnulib/lib/git-merge-changelog.c struct entry *entry = (struct entry *) elt; entry 233 maint/gnulib/lib/git-merge-changelog.c if (!entry->hashcode_cached) entry 240 maint/gnulib/lib/git-merge-changelog.c for (s = entry->string, n = entry->length; n > 0; s++, n--) entry 243 maint/gnulib/lib/git-merge-changelog.c entry->hashcode = h; entry 244 maint/gnulib/lib/git-merge-changelog.c entry->hashcode_cached = true; entry 246 maint/gnulib/lib/git-merge-changelog.c return entry->hashcode; entry 255 maint/gnulib/lib/git-merge-changelog.c entry_fstrcmp (const struct entry *entry1, const struct entry *entry2, entry 292 maint/gnulib/lib/git-merge-changelog.c struct entry **entries; entry 327 maint/gnulib/lib/git-merge-changelog.c struct entry *curr; entry 356 maint/gnulib/lib/git-merge-changelog.c result->entries = XNMALLOC (result->num_entries, struct entry *); entry 363 maint/gnulib/lib/git-merge-changelog.c result->entries[index++] = (struct entry *) elt; entry 396 maint/gnulib/lib/git-merge-changelog.c struct entry *entry_i = file1->entries[i]; entry 416 maint/gnulib/lib/git-merge-changelog.c struct entry *entry_j = file2->entries[best_j]; entry 459 maint/gnulib/lib/git-merge-changelog.c struct entry *entry_j = file2->entries[j]; entry 479 maint/gnulib/lib/git-merge-changelog.c struct entry *entry_i = file1->entries[best_i]; entry 543 maint/gnulib/lib/git-merge-changelog.c struct entry *entry = file1->entries[i]; entry 545 maint/gnulib/lib/git-merge-changelog.c j = gl_list_indexof (file2->entries_reversed, entry); entry 571 maint/gnulib/lib/git-merge-changelog.c n1 - curr_i, entry); entry 576 maint/gnulib/lib/git-merge-changelog.c n2 - curr_j, entry); entry 641 maint/gnulib/lib/git-merge-changelog.c #define ELEMENT struct entry * entry 810 maint/gnulib/lib/git-merge-changelog.c static struct entry empty_entry = { NULL, 0 }; entry 818 maint/gnulib/lib/git-merge-changelog.c find_paragraph_end (const struct entry *entry, size_t offset) entry 820 maint/gnulib/lib/git-merge-changelog.c const char *string = entry->string; entry 821 maint/gnulib/lib/git-merge-changelog.c size_t length = entry->length; entry 852 maint/gnulib/lib/git-merge-changelog.c try_split_merged_entry (const struct entry *old_entry, entry 853 maint/gnulib/lib/git-merge-changelog.c const struct entry *new_entry, entry 854 maint/gnulib/lib/git-merge-changelog.c struct entry *new_split[2]) entry 858 maint/gnulib/lib/git-merge-changelog.c struct entry old_body; entry 859 maint/gnulib/lib/git-merge-changelog.c struct entry new_body; entry 924 maint/gnulib/lib/git-merge-changelog.c entry_write (FILE *fp, struct entry *entry) entry 926 maint/gnulib/lib/git-merge-changelog.c if (entry->length > 0) entry 927 maint/gnulib/lib/git-merge-changelog.c fwrite (entry->string, 1, entry->length, fp); entry 936 maint/gnulib/lib/git-merge-changelog.c struct entry **old_entries; entry 939 maint/gnulib/lib/git-merge-changelog.c struct entry **modified_entries; entry 1229 maint/gnulib/lib/git-merge-changelog.c struct entry *added_entry = modified_file.entries[j]; entry 1264 maint/gnulib/lib/git-merge-changelog.c struct entry *added_entry = modified_file.entries[j]; entry 1274 maint/gnulib/lib/git-merge-changelog.c struct entry *added_entry = modified_file.entries[j]; entry 1289 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_modified_entries, struct entry *); entry 1302 maint/gnulib/lib/git-merge-changelog.c struct entry *removed_entry = ancestor_file.entries[i]; entry 1321 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_old_entries, struct entry *); entry 1355 maint/gnulib/lib/git-merge-changelog.c struct entry *split[2]; entry 1386 maint/gnulib/lib/git-merge-changelog.c struct entry *added_entry = modified_file.entries[j]; entry 1392 maint/gnulib/lib/git-merge-changelog.c struct entry *changed_entry = entry 1412 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_old_entries, struct entry *); entry 1416 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_modified_entries, struct entry *); entry 1470 maint/gnulib/lib/git-merge-changelog.c struct entry *added_entry = modified_file.entries[j]; entry 1475 maint/gnulib/lib/git-merge-changelog.c struct entry *changed_entry = modified_file.entries[j]; entry 1494 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_old_entries, struct entry *); entry 1498 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_modified_entries, struct entry *); entry 1535 maint/gnulib/lib/git-merge-changelog.c struct entry *added_entry = modified_file.entries[j]; entry 1540 maint/gnulib/lib/git-merge-changelog.c struct entry *changed_entry = modified_file.entries[j]; entry 1559 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_old_entries, struct entry *); entry 1563 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_modified_entries, struct entry *); entry 1607 maint/gnulib/lib/git-merge-changelog.c struct entry *new_entry = modified_file.entries[j]; entry 1630 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_old_entries, struct entry *); entry 1635 maint/gnulib/lib/git-merge-changelog.c XNMALLOC (c->num_modified_entries, struct entry *); entry 1668 maint/gnulib/lib/git-merge-changelog.c entry_write (fp, (struct entry *) elt); entry 114 maint/gnulib/lib/gl_anytreehash_list1.h gl_hash_entry_t entry = *entryp; entry 116 maint/gnulib/lib/gl_anytreehash_list1.h if (entry->hashcode == hashcode) entry 118 maint/gnulib/lib/gl_anytreehash_list1.h if (((struct gl_multiple_nodes *) entry)->magic == MULTIPLE_NODES_MAGIC) entry 121 maint/gnulib/lib/gl_anytreehash_list1.h gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes; entry 134 maint/gnulib/lib/gl_anytreehash_list1.h gl_list_node_t node = (struct gl_list_node_impl *) entry; entry 157 maint/gnulib/lib/gl_anytreehash_list1.h multi_entry->h.hash_next = entry->hash_next; entry 158 maint/gnulib/lib/gl_anytreehash_list1.h multi_entry->h.hashcode = entry->hashcode; entry 201 maint/gnulib/lib/gl_anytreehash_list1.h gl_hash_entry_t entry = *entryp; entry 203 maint/gnulib/lib/gl_anytreehash_list1.h if (entry == &old_node->h) entry 209 maint/gnulib/lib/gl_anytreehash_list1.h if (entry == NULL) entry 213 maint/gnulib/lib/gl_anytreehash_list1.h if (((struct gl_multiple_nodes *) entry)->magic == MULTIPLE_NODES_MAGIC entry 214 maint/gnulib/lib/gl_anytreehash_list1.h && entry->hashcode == hashcode) entry 217 maint/gnulib/lib/gl_anytreehash_list1.h gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes; entry 230 maint/gnulib/lib/gl_anytreehash_list1.h node->h.hash_next = entry->hash_next; entry 233 maint/gnulib/lib/gl_anytreehash_list1.h free (entry); entry 35 maint/gnulib/lib/gl_anytreehash_list2.h gl_hash_entry_t entry; entry 39 maint/gnulib/lib/gl_anytreehash_list2.h for (entry = list->table[bucket]; entry != NULL; entry = entry->hash_next) entry 40 maint/gnulib/lib/gl_anytreehash_list2.h if (entry->hashcode == hashcode) entry 42 maint/gnulib/lib/gl_anytreehash_list2.h if (((struct gl_multiple_nodes *) entry)->magic == MULTIPLE_NODES_MAGIC) entry 45 maint/gnulib/lib/gl_anytreehash_list2.h gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes; entry 82 maint/gnulib/lib/gl_anytreehash_list2.h gl_list_node_t node = (struct gl_list_node_impl *) entry; entry 104 maint/gnulib/lib/gl_anytreehash_list2.h for (entry = list->table[bucket]; entry != NULL; entry = entry->hash_next) entry 105 maint/gnulib/lib/gl_anytreehash_list2.h if (entry->hashcode == hashcode) entry 107 maint/gnulib/lib/gl_anytreehash_list2.h gl_list_node_t node = (struct gl_list_node_impl *) entry; entry 153 maint/gnulib/lib/gl_anytreehash_list2.h gl_hash_entry_t entry = list->table[--i]; entry 155 maint/gnulib/lib/gl_anytreehash_list2.h while (entry != NULL) entry 157 maint/gnulib/lib/gl_anytreehash_list2.h gl_hash_entry_t next = entry->hash_next; entry 159 maint/gnulib/lib/gl_anytreehash_list2.h if (((struct gl_multiple_nodes *) entry)->magic == MULTIPLE_NODES_MAGIC) entry 161 maint/gnulib/lib/gl_anytreehash_list2.h gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes; entry 164 maint/gnulib/lib/gl_anytreehash_list2.h free (entry); entry 167 maint/gnulib/lib/gl_anytreehash_list2.h entry = next; entry 61 maint/gnulib/lib/hamt.c entry_type (const Hamt_entry *entry) entry 63 maint/gnulib/lib/hamt.c return entry->ref_count & 3; entry 234 maint/gnulib/lib/hamt.c is_shared (const Hamt_entry *entry) entry 236 maint/gnulib/lib/hamt.c return entry->ref_count >= 8; entry 261 maint/gnulib/lib/hamt.c copy_entry (Hamt_entry *entry) entry 263 maint/gnulib/lib/hamt.c inc_ref_counter (&entry->ref_count); entry 264 maint/gnulib/lib/hamt.c return entry; entry 283 maint/gnulib/lib/hamt.c replace_entry (struct subtrie *subtrie, int j, Hamt_entry *entry) entry 290 maint/gnulib/lib/hamt.c new_subtrie->nodes[k] = entry; entry 299 maint/gnulib/lib/hamt.c insert_entry (struct subtrie *subtrie, int i, int j, Hamt_entry *entry) entry 311 maint/gnulib/lib/hamt.c new_subtrie->nodes[k] = entry; entry 408 maint/gnulib/lib/hamt.c free_entry (struct function_table const *functions, Hamt_entry *entry) entry 410 maint/gnulib/lib/hamt.c switch (entry_type (entry)) entry 413 maint/gnulib/lib/hamt.c free_element (functions, entry); entry 416 maint/gnulib/lib/hamt.c free_subtrie (functions, (struct subtrie *) entry); entry 419 maint/gnulib/lib/hamt.c free_bucket (functions, (struct bucket *) entry); entry 470 maint/gnulib/lib/hamt.c Hamt_entry *entry, entry 491 maint/gnulib/lib/hamt.c entry_lookup (const struct function_table *functions, Hamt_entry *entry, entry 494 maint/gnulib/lib/hamt.c switch (entry_type (entry)) entry 497 maint/gnulib/lib/hamt.c if (compare_elements (functions, elt, entry)) entry 498 maint/gnulib/lib/hamt.c return entry; entry 501 maint/gnulib/lib/hamt.c return subtrie_lookup (functions, (struct subtrie *) entry, elt, hash); entry 503 maint/gnulib/lib/hamt.c return bucket_lookup (functions, (struct bucket *) entry, elt); entry 630 maint/gnulib/lib/hamt.c Hamt_entry *entry = subtrie->nodes[j]; entry 632 maint/gnulib/lib/hamt.c = entry_insert (functions, entry, elt_ptr, hash >> 5, depth + 1, entry 634 maint/gnulib/lib/hamt.c if (new_entry != entry) entry 638 maint/gnulib/lib/hamt.c free_entry (functions, entry); entry 643 maint/gnulib/lib/hamt.c Hamt_entry *entry = copy_entry (*elt_ptr); entry 646 maint/gnulib/lib/hamt.c return insert_entry (subtrie, i, j, entry); entry 657 maint/gnulib/lib/hamt.c entry_insert (const struct function_table *functions, Hamt_entry *entry, entry 661 maint/gnulib/lib/hamt.c shared |= is_shared (entry); entry 662 maint/gnulib/lib/hamt.c switch (entry_type (entry)) entry 665 maint/gnulib/lib/hamt.c if (compare_elements (functions, *elt_ptr, entry)) entry 672 maint/gnulib/lib/hamt.c *elt_ptr = entry; entry 677 maint/gnulib/lib/hamt.c *elt_ptr = *elt_ptr == entry ? NULL : entry; entry 678 maint/gnulib/lib/hamt.c return entry; entry 683 maint/gnulib/lib/hamt.c return create_populated_subtrie (new_entry, copy_entry (entry), hash, entry 684 maint/gnulib/lib/hamt.c (hash_element (functions, entry) entry 688 maint/gnulib/lib/hamt.c subtrie_insert (functions, (struct subtrie *) entry, elt_ptr, hash, entry 692 maint/gnulib/lib/hamt.c bucket_insert (functions, (struct bucket *) entry, elt_ptr, replace, entry 766 maint/gnulib/lib/hamt.c Hamt_entry *entry, Hamt_entry **elt_ptr, entry 779 maint/gnulib/lib/hamt.c Hamt_entry *entry = subtrie->nodes[j]; entry 781 maint/gnulib/lib/hamt.c = entry_remove (functions, entry, elt_ptr, hash >> 5, depth + 1, entry 785 maint/gnulib/lib/hamt.c if (new_entry != entry) entry 789 maint/gnulib/lib/hamt.c free_entry (functions, entry); entry 804 maint/gnulib/lib/hamt.c entry_remove (const struct function_table *functions, Hamt_entry *entry, entry 807 maint/gnulib/lib/hamt.c shared |= is_shared (entry); entry 808 maint/gnulib/lib/hamt.c switch (entry_type (entry)) entry 811 maint/gnulib/lib/hamt.c if (compare_elements (functions, *elt_ptr, entry)) entry 813 maint/gnulib/lib/hamt.c *elt_ptr = entry; entry 817 maint/gnulib/lib/hamt.c return entry; entry 819 maint/gnulib/lib/hamt.c return subtrie_remove (functions, (struct subtrie *) entry, elt_ptr, hash, entry 822 maint/gnulib/lib/hamt.c return bucket_remove (functions, (struct bucket *) entry, elt_ptr); entry 884 maint/gnulib/lib/hamt.c static size_t entry_do_while (Hamt_entry *entry, Hamt_processor *proc, entry 905 maint/gnulib/lib/hamt.c entry_do_while (Hamt_entry *entry, Hamt_processor *proc, void *data, entry 908 maint/gnulib/lib/hamt.c switch (entry_type (entry)) entry 911 maint/gnulib/lib/hamt.c *success = proc (entry, data); entry 914 maint/gnulib/lib/hamt.c return subtrie_do_while ((struct subtrie *) entry, proc, data, success); entry 916 maint/gnulib/lib/hamt.c return bucket_do_while ((struct bucket *) entry, proc, data, success); entry 948 maint/gnulib/lib/hamt.c Hamt_entry *entry = hamt->root; entry 951 maint/gnulib/lib/hamt.c if (entry == NULL) entry 957 maint/gnulib/lib/hamt.c while (iter.entry[iter.depth] = entry, entry_type (entry) == subtrie_entry) entry 959 maint/gnulib/lib/hamt.c const struct subtrie *subtrie = (const struct subtrie *) entry; entry 961 maint/gnulib/lib/hamt.c entry = subtrie->nodes[0]; entry 1000 maint/gnulib/lib/hamt.c Hamt_entry *entry = iter->entry[depth]; entry 1001 maint/gnulib/lib/hamt.c if (entry_type (entry) == bucket_entry) entry 1003 maint/gnulib/lib/hamt.c struct bucket *bucket = (struct bucket *) entry; entry 1009 maint/gnulib/lib/hamt.c *elt_ptr = entry; entry 1016 maint/gnulib/lib/hamt.c subtrie = (struct subtrie *) iter->entry[iter->depth]; entry 1020 maint/gnulib/lib/hamt.c while (iter->entry[++iter->depth] = subtrie->nodes[j], entry 1021 maint/gnulib/lib/hamt.c entry_type (iter->entry[iter->depth]) == subtrie_entry) entry 1026 maint/gnulib/lib/hamt.c subtrie = (struct subtrie *) iter->entry[iter->depth]; entry 104 maint/gnulib/lib/hamt.h Hamt_entry *entry = elt; entry 105 maint/gnulib/lib/hamt.h entry->ref_count = 0; /* This assumes that element_entry == entry 107 maint/gnulib/lib/hamt.h return entry; entry 216 maint/gnulib/lib/hamt.h Hamt_entry *entry[_GL_HAMT_MAX_DEPTH + 1]; entry 241 maint/gnulib/lib/hash.c hash_lookup (const Hash_table *table, const void *entry) entry 243 maint/gnulib/lib/hash.c struct hash_entry const *bucket = safe_hasher (table, entry); entry 250 maint/gnulib/lib/hash.c if (entry == cursor->data || table->comparator (entry, cursor->data)) entry 274 maint/gnulib/lib/hash.c hash_get_next (const Hash_table *table, const void *entry) entry 276 maint/gnulib/lib/hash.c struct hash_entry const *bucket = safe_hasher (table, entry); entry 283 maint/gnulib/lib/hash.c if (cursor->data == entry && cursor->next) entry 685 maint/gnulib/lib/hash.c free_entry (Hash_table *table, struct hash_entry *entry) entry 687 maint/gnulib/lib/hash.c entry->data = NULL; entry 688 maint/gnulib/lib/hash.c entry->next = table->free_entry_list; entry 689 maint/gnulib/lib/hash.c table->free_entry_list = entry; entry 699 maint/gnulib/lib/hash.c hash_find_entry (Hash_table *table, const void *entry, entry 702 maint/gnulib/lib/hash.c struct hash_entry *bucket = safe_hasher (table, entry); entry 712 maint/gnulib/lib/hash.c if (entry == bucket->data || table->comparator (entry, bucket->data)) entry 739 maint/gnulib/lib/hash.c if (entry == cursor->next->data entry 740 maint/gnulib/lib/hash.c || table->comparator (entry, cursor->next->data)) entry 923 maint/gnulib/lib/hash.c hash_insert_if_absent (Hash_table *table, void const *entry, entry 932 maint/gnulib/lib/hash.c if (! entry) entry 936 maint/gnulib/lib/hash.c if ((data = hash_find_entry (table, entry, &bucket, false)) != NULL) entry 972 maint/gnulib/lib/hash.c if (hash_find_entry (table, entry, &bucket, false) != NULL) entry 988 maint/gnulib/lib/hash.c new_entry->data = (void *) entry; entry 997 maint/gnulib/lib/hash.c bucket->data = (void *) entry; entry 1005 maint/gnulib/lib/hash.c hash_insert (Hash_table *table, void const *entry) entry 1008 maint/gnulib/lib/hash.c int err = hash_insert_if_absent (table, entry, &matched_ent); entry 1011 maint/gnulib/lib/hash.c : (void *) (err == 0 ? matched_ent : entry)); entry 1015 maint/gnulib/lib/hash.c hash_remove (Hash_table *table, const void *entry) entry 1020 maint/gnulib/lib/hash.c data = hash_find_entry (table, entry, &bucket, true); entry 1075 maint/gnulib/lib/hash.c hash_delete (Hash_table *table, const void *entry) entry 1077 maint/gnulib/lib/hash.c return hash_remove (table, entry); entry 87 maint/gnulib/lib/hash.h extern void *hash_lookup (const Hash_table *table, const void *entry); entry 107 maint/gnulib/lib/hash.h extern void *hash_get_next (const Hash_table *table, const void *entry); entry 115 maint/gnulib/lib/hash.h typedef bool (*Hash_processor) (void *entry, void *processor_data); entry 138 maint/gnulib/lib/hash.h typedef size_t (*Hash_hasher) (const void *entry, size_t table_size); entry 140 maint/gnulib/lib/hash.h typedef void (*Hash_data_freer) (void *entry); entry 225 maint/gnulib/lib/hash.h extern void *hash_insert (Hash_table *table, const void *entry); entry 229 maint/gnulib/lib/hash.h extern void *hash_xinsert (Hash_table *table, const void *entry); entry 247 maint/gnulib/lib/hash.h extern int hash_insert_if_absent (Hash_table *table, const void *entry, entry 253 maint/gnulib/lib/hash.h extern void *hash_remove (Hash_table *table, const void *entry); entry 258 maint/gnulib/lib/hash.h extern void *hash_delete (Hash_table *table, const void *entry); entry 1056 maint/gnulib/lib/mountlist.c struct dirent entry; entry 1061 maint/gnulib/lib/mountlist.c if (readdir_r (dirp, &entry, &result) || result == NULL) entry 1065 maint/gnulib/lib/mountlist.c strcat (node, entry.d_name); entry 42 maint/gnulib/lib/mountlist.h void free_mount_entry (struct mount_entry *entry); entry 90 maint/gnulib/lib/opendir.c WIN32_FIND_DATA entry; entry 122 maint/gnulib/lib/opendir.c current = FindFirstFile (dir_name_mask, &entry); entry 160 maint/gnulib/lib/opendir.c memcpy (&dirp->entry, &entry, sizeof (WIN32_FIND_DATA)); entry 54 maint/gnulib/lib/readdir.c if (!FindNextFile (dirp->current, &dirp->entry)) entry 74 maint/gnulib/lib/readdir.c if (dirp->entry.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) entry 76 maint/gnulib/lib/readdir.c else if (dirp->entry.dwFileAttributes & FILE_ATTRIBUTE_REPARSE_POINT) entry 78 maint/gnulib/lib/readdir.c else if ((dirp->entry.dwFileAttributes entry 98 maint/gnulib/lib/readdir.c ((char *) dirp->entry.cFileName - offsetof (struct dirent, d_name[0])); entry 584 maint/gnulib/lib/regcomp.c struct re_state_table_entry *entry = dfa->state_table + i; entry 585 maint/gnulib/lib/regcomp.c for (j = 0; j < entry->num; ++j) entry 587 maint/gnulib/lib/regcomp.c re_dfastate_t *state = entry->array[j]; entry 590 maint/gnulib/lib/regcomp.c re_free (entry->array); entry 2083 maint/gnulib/lib/regexec.c struct re_backref_cache_entry *entry; entry 2092 maint/gnulib/lib/regexec.c entry = mctx->bkref_ents + first_idx; entry 2102 maint/gnulib/lib/regexec.c if (entry->node != node) entry 2104 maint/gnulib/lib/regexec.c subexp_len = entry->subexp_to - entry->subexp_from; entry 2147 maint/gnulib/lib/regexec.c entry = mctx->bkref_ents + enabled_idx; entry 2149 maint/gnulib/lib/regexec.c while (enabled_idx++, entry++->more); entry 2615 maint/gnulib/lib/regexec.c const struct re_backref_cache_entry *entry entry 2618 maint/gnulib/lib/regexec.c if (entry->node == bkref_node) entry 2620 maint/gnulib/lib/regexec.c while (entry++->more); entry 39 maint/gnulib/lib/rewinddir.c dirp->current = FindFirstFile (dirp->dir_name_mask, &dirp->entry); entry 107 maint/gnulib/lib/savedir.c char const *entry; entry 116 maint/gnulib/lib/savedir.c entry = dp->d_name; entry 117 maint/gnulib/lib/savedir.c if (entry[entry[0] != '.' ? 0 : entry[1] != '.' ? 1 : 2] != '\0') entry 125 maint/gnulib/lib/savedir.c entries[entries_used].name = xstrdup (entry); entry 137 maint/gnulib/lib/savedir.c memcpy (name_space + used, entry, entry_size); entry 75 maint/gnulib/lib/uninorm/canonical-decomposition.c unsigned short entry = decomp_index (uc); entry 79 maint/gnulib/lib/uninorm/canonical-decomposition.c if (entry < 0x8000) entry 85 maint/gnulib/lib/uninorm/canonical-decomposition.c p = &gl_uninorm_decomp_chars_table[3 * entry]; entry 82 maint/gnulib/lib/uninorm/decomposition.c unsigned short entry = decomp_index (uc); entry 83 maint/gnulib/lib/uninorm/decomposition.c if (entry != (unsigned short)(-1)) entry 89 maint/gnulib/lib/uninorm/decomposition.c p = &gl_uninorm_decomp_chars_table[3 * (entry & 0x7FFF)]; entry 38 maint/gnulib/lib/xhash.c hash_xinsert (Hash_table *table, void const *entry) entry 40 maint/gnulib/lib/xhash.c void *res = hash_insert (table, entry); entry 27 maint/gnulib/tests/test-hamt.c Hamt_entry entry; entry 61 maint/gnulib/tests/test-hamt.c return hamt_element (&elt->entry); entry 186 maint/gnulib/tests/test-hamt.c find_values_processor (Hamt_entry *entry, void *data) entry 189 maint/gnulib/tests/test-hamt.c int val = entry_value (entry); entry 35 maint/gnulib/tests/test-unsetenv.c char entry[] = "b=2"; entry 39 maint/gnulib/tests/test-unsetenv.c ASSERT (putenv (entry) == 0); entry 40 maint/gnulib/tests/test-unsetenv.c entry[0] = 'a'; /* Unspecified what getenv("a") would be at this point. */ entry 1077 tools/crm_mon.c for (GOptionEntry *entry = display_entries; entry != NULL; entry++) { entry 1078 tools/crm_mon.c if (entry->short_name == c) { entry 1079 tools/crm_mon.c desc = entry->description;