b 64 cib/callbacks.c gint cib_GCompareFunc(gconstpointer a, gconstpointer b); b 1406 cib/callbacks.c cib_GCompareFunc(gconstpointer a, gconstpointer b) b 1409 cib/callbacks.c const xmlNode *b_msg = b; b 158 cib/io.c static int cib_archive_sort(const struct dirent ** a, const struct dirent **b) b 168 cib/io.c char *b_path = crm_strdup_printf("%s/%s", cib_root, b[0]->d_name); b 188 cib/io.c b[0]->d_name, (unsigned long)b_age, rc); b 2221 fencing/commands.c sort_device_priority(gconstpointer a, gconstpointer b) b 2224 fencing/commands.c const stonith_device_t *dev_b = b; b 96 fencing/remote.c sort_strings(gconstpointer a, gconstpointer b) b 98 fencing/remote.c return strcmp(a, b); b 1598 fencing/remote.c sort_peers(gconstpointer a, gconstpointer b) b 1601 fencing/remote.c const st_query_result_t *peer_b = b; b 72 include/crm/common/internal.h gint crm_alpha_sort(gconstpointer a, gconstpointer b); b 67 include/crm/common/util.h gboolean crm_str_eq(const char *a, const char *b, gboolean use_case); b 68 include/crm/common/util.h gboolean safe_str_neq(const char *a, const char *b); b 72 include/crm/common/util.h # define safe_str_eq(a, b) crm_str_eq(a, b, FALSE) b 77 include/crm/common/util.h crm_strcase_equal(gconstpointer a, gconstpointer b) b 79 include/crm/common/util.h return crm_str_eq((const char *) a, (const char *) b, FALSE); b 172 include/crm/pengine/internal.h extern gint sort_rsc_priority(gconstpointer a, gconstpointer b); b 173 include/crm/pengine/internal.h extern gint sort_rsc_index(gconstpointer a, gconstpointer b); b 243 include/crm/pengine/internal.h extern gint sort_op_by_callid(gconstpointer a, gconstpointer b); b 271 include/crm/pengine/internal.h gint sort_node_uname(gconstpointer a, gconstpointer b); b 208 lib/ais/utils.h ais_str_eq(const char *a, const char *b) b 210 lib/ais/utils.h if (a == NULL || b == NULL) { b 213 lib/ais/utils.h } else if (a == b) { b 216 lib/ais/utils.h } else if (strcasecmp(a, b) == 0) { b 48 lib/cib/cib_client.c gint ciblib_GCompareFunc(gconstpointer a, gconstpointer b); b 556 lib/cib/cib_client.c ciblib_GCompareFunc(gconstpointer a, gconstpointer b) b 560 lib/cib/cib_client.c const cib_notify_client_t *b_client = b; b 1150 lib/common/iso8601.c crm_time_compare(crm_time_t * a, crm_time_t * b) b 1156 lib/common/iso8601.c if (a == NULL && b == NULL) { b 1160 lib/common/iso8601.c } else if (b == NULL) { b 1165 lib/common/iso8601.c t2 = crm_get_utc_time(b); b 188 lib/common/schemas.c schema_sort(const struct dirent **a, const struct dirent **b) b 194 lib/common/schemas.c || !version_from_filename(b[0]->d_name, &b_version)) { b 150 lib/common/strings.c safe_str_neq(const char *a, const char *b) b 152 lib/common/strings.c if (a == b) { b 155 lib/common/strings.c } else if (a == NULL || b == NULL) { b 158 lib/common/strings.c } else if (strcasecmp(a, b) == 0) { b 213 lib/common/strings.c crm_str_eq(const char *a, const char *b, gboolean use_case) b 216 lib/common/strings.c return g_strcmp0(a, b) == 0; b 219 lib/common/strings.c } else if (a == b) { b 222 lib/common/strings.c } else if (a == NULL || b == NULL) { b 226 lib/common/strings.c } else if (strcasecmp(a, b) == 0) { b 472 lib/common/strings.c crm_alpha_sort(gconstpointer a, gconstpointer b) b 474 lib/common/strings.c if (!a && !b) { b 478 lib/common/strings.c } else if (!b) { b 481 lib/common/strings.c return strcasecmp(a, b); b 4978 lib/common/xml.c sort_pairs(gconstpointer a, gconstpointer b) b 4982 lib/common/xml.c const name_value_t *pair_b = b; b 4987 lib/common/xml.c CRM_ASSERT(b != NULL); b 1642 lib/fencing/st_client.c stonithlib_GCompareFunc(gconstpointer a, gconstpointer b) b 1646 lib/fencing/st_client.c const stonith_notify_client_t *b_client = b; b 296 lib/gnu/md5.c #define FF(b, c, d) (d ^ (b & (c ^ d))) b 297 lib/gnu/md5.c #define FG(b, c, d) FF (d, b, c) b 298 lib/gnu/md5.c #define FH(b, c, d) (b ^ c ^ d) b 299 lib/gnu/md5.c #define FI(b, c, d) (c ^ (b | ~d)) b 340 lib/gnu/md5.c #define OP(a, b, c, d, s, T) \ b 343 lib/gnu/md5.c a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \ b 346 lib/gnu/md5.c a += b; \ b 386 lib/gnu/md5.c #define OP(f, a, b, c, d, k, s, T) \ b 389 lib/gnu/md5.c a += f (b, c, d) + correct_words[k] + T; \ b 391 lib/gnu/md5.c a += b; \ b 683 lib/pengine/rules.c sort_pairs(gconstpointer a, gconstpointer b) b 686 lib/pengine/rules.c const sorted_set_t *pair_b = b; b 688 lib/pengine/rules.c if (a == NULL && b == NULL) { b 692 lib/pengine/rules.c } else if (b == NULL) { b 35 lib/pengine/unpack.h extern gint sort_op_by_callid(gconstpointer a, gconstpointer b); b 225 lib/pengine/utils.c sort_node_uname(gconstpointer a, gconstpointer b) b 228 lib/pengine/utils.c const node_t *node_b = b; b 365 lib/pengine/utils.c sort_rsc_index(gconstpointer a, gconstpointer b) b 368 lib/pengine/utils.c const resource_t *resource2 = (const resource_t *)b; b 370 lib/pengine/utils.c if (a == NULL && b == NULL) { b 376 lib/pengine/utils.c if (b == NULL) { b 392 lib/pengine/utils.c sort_rsc_priority(gconstpointer a, gconstpointer b) b 395 lib/pengine/utils.c const resource_t *resource2 = (const resource_t *)b; b 397 lib/pengine/utils.c if (a == NULL && b == NULL) { b 403 lib/pengine/utils.c if (b == NULL) { b 1560 lib/pengine/utils.c sort_op_by_callid(gconstpointer a, gconstpointer b) b 1569 lib/pengine/utils.c const xmlNode *xml_b = b; b 158 libltdl/libltdl/lt_system.h # define LT__CONC(a, b) a##b b 159 libltdl/libltdl/lt_system.h # define LT_CONC(a, b) LT__CONC(a, b) b 162 libltdl/libltdl/lt_system.h # define LT__CONC3(a, b, c) a##b##c b 163 libltdl/libltdl/lt_system.h # define LT_CONC3(a, b, c) LT__CONC3(a, b, c) b 1034 pengine/allocate.c sort_rsc_process_order(gconstpointer a, gconstpointer b, gpointer data) b 1044 pengine/allocate.c resource_t *resource2 = (resource_t *) convert_const_pointer(b); b 1052 pengine/allocate.c if (a == NULL && b == NULL) { b 1058 pengine/allocate.c if (b == NULL) { b 30 pengine/clone.c gint sort_clone_instance(gconstpointer a, gconstpointer b, gpointer data_set); b 34 pengine/clone.c sort_rsc_id(gconstpointer a, gconstpointer b) b 37 pengine/clone.c const resource_t *resource2 = (const resource_t *)b; b 78 pengine/clone.c sort_clone_instance(gconstpointer a, gconstpointer b, gpointer data_set) b 88 pengine/clone.c const resource_t *resource2 = (const resource_t *)b; b 1123 pengine/constraints.c sort_cons_priority_lh(gconstpointer a, gconstpointer b) b 1126 pengine/constraints.c const rsc_colocation_t *rsc_constraint2 = (const rsc_colocation_t *)b; b 1131 pengine/constraints.c if (b == NULL) { b 1157 pengine/constraints.c sort_cons_priority_rh(gconstpointer a, gconstpointer b) b 1160 pengine/constraints.c const rsc_colocation_t *rsc_constraint2 = (const rsc_colocation_t *)b; b 1165 pengine/constraints.c if (b == NULL) { b 41 pengine/container.c gint sort_clone_instance(gconstpointer a, gconstpointer b, gpointer data_set); b 1390 pengine/graph.c sort_action_id(gconstpointer a, gconstpointer b) b 1393 pengine/graph.c const action_wrapper_t *action_wrapper1 = (const action_wrapper_t *)b; b 1398 pengine/graph.c if (b == NULL) { b 29 pengine/master.c extern gint sort_clone_instance(gconstpointer a, gconstpointer b, gpointer data_set); b 232 pengine/master.c sort_master_instance(gconstpointer a, gconstpointer b, gpointer data_set) b 239 pengine/master.c const resource_t *resource2 = (const resource_t *)b; b 247 pengine/master.c rc = sort_rsc_index(a, b); b 262 pengine/master.c return sort_clone_instance(a, b, data_set); b 31 pengine/notif.c sort_notify_entries(gconstpointer a, gconstpointer b) b 35 pengine/notif.c const notify_entry_t *entry_b = b; b 138 pengine/utils.c sort_node_weight(gconstpointer a, gconstpointer b, gpointer data) b 141 pengine/utils.c const node_t *node2 = (const node_t *)b; b 152 pengine/utils.c if (b == NULL) { b 42 pengine/utils.h extern gint sort_node_weight(gconstpointer a, gconstpointer b, gpointer data_set); b 366 replace/uuid_parse.c # define max(a,b) ((a) > (b) ? (a) : (b)) b 1693 tools/crm_mon.c compare_attribute(gconstpointer a, gconstpointer b) b 1697 tools/crm_mon.c rc = strcmp((const char *)a, (const char *)b); b 221 tools/crm_node.c compare_node_uname(gconstpointer a, gconstpointer b) b 224 tools/crm_node.c const crm_node_t *b_node = b; b 671 tools/crm_node.c member_sort(gconstpointer a, gconstpointer b) b 674 tools/crm_node.c const crm_node_t *node_b = b;