n 875 daemons/fenced/pacemaker-fenced.c int n; n 884 daemons/fenced/pacemaker-fenced.c n = snprintf(xpath, XPATH_MAX, "//" XML_CIB_TAG_NODES n 890 daemons/fenced/pacemaker-fenced.c CRM_CHECK(n < XPATH_MAX, return FALSE); n 149 include/crm/common/mainloop.h void pcmk_quit_main_loop(GMainLoop *mloop, unsigned int n); n 1388 lib/common/mainloop.c pcmk_quit_main_loop(GMainLoop *mloop, unsigned int n) n 1396 lib/common/mainloop.c for (int i = 0; (i < n) && g_main_context_pending(ctx); ++i) { n 57 lib/common/md5.c # define SWAP(n) bswap_32 (n) n 59 lib/common/md5.c # define SWAP(n) (n) n 167 lib/common/md5.c size_t n; n 181 lib/common/md5.c n = fread (buffer + sum, 1, BLOCKSIZE - sum, stream); n 183 lib/common/md5.c sum += n; n 188 lib/common/md5.c if (n == 0) n 480 lib/common/xml.c #define attr_matches(c, n, v) pcmk__str_eq(crm_element_value((c), (n)), \ n 57 lib/gnu/md5.c # define SWAP(n) bswap_32 (n) n 59 lib/gnu/md5.c # define SWAP(n) (n) n 167 lib/gnu/md5.c size_t n; n 181 lib/gnu/md5.c n = fread (buffer + sum, 1, BLOCKSIZE - sum, stream); n 183 lib/gnu/md5.c sum += n; n 188 lib/gnu/md5.c if (n == 0) n 223 lib/pacemaker/pcmk_sched_clone.c pe_node_t *n = NULL; n 232 lib/pacemaker/pcmk_sched_clone.c n = pe__copy_node(current_node1); n 233 lib/pacemaker/pcmk_sched_clone.c g_hash_table_insert(hash1, (gpointer) n->details->id, n); n 235 lib/pacemaker/pcmk_sched_clone.c n = pe__copy_node(current_node2); n 236 lib/pacemaker/pcmk_sched_clone.c g_hash_table_insert(hash2, (gpointer) n->details->id, n); n 702 lib/pengine/native.c pe_node_t *n = (pe_node_t *) iter->data; n 704 lib/pengine/native.c have_nodes = add_output_node(outstr, n->details->uname, have_nodes); n 783 lib/pengine/native.c pe_node_t *n = NULL; n 787 lib/pengine/native.c while (g_hash_table_iter_next(&iter, NULL, (void **)&n)) { n 788 lib/pengine/native.c out->list_item(out, NULL, "%s %d", n->details->uname, n->weight); n 795 lib/pengine/native.c pe_node_t *n = NULL; n 799 lib/pengine/native.c while (g_hash_table_iter_next(&iter, NULL, (void **)&n)) { n 800 lib/pengine/native.c pe__output_node(n, FALSE, out); n 850 lib/pengine/native.c pe_node_t *n = NULL; n 854 lib/pengine/native.c while (g_hash_table_iter_next(&iter, NULL, (void **)&n)) { n 855 lib/pengine/native.c out->list_item(out, NULL, "%s %d", n->details->uname, n->weight); n 862 lib/pengine/native.c pe_node_t *n = NULL; n 866 lib/pengine/native.c while (g_hash_table_iter_next(&iter, NULL, (void **)&n)) { n 867 lib/pengine/native.c pe__output_node(n, FALSE, out); n 959 lib/pengine/native.c pe_node_t *n = (pe_node_t *) gIter->data; n 964 lib/pengine/native.c status_print("<li>\n%s", n->details->uname); n 968 lib/pengine/native.c status_print(" %s", n->details->uname); n 971 lib/pengine/native.c status_print("\t%d : %s", counter, n->details->uname); n 974 lib/pengine/native.c status_print("%s", n->details->uname); n 1008 lib/pengine/native.c pe_node_t *n = NULL; n 1012 lib/pengine/native.c while (g_hash_table_iter_next(&iter, NULL, (void **)&n)) { n 1013 lib/pengine/native.c status_print("%s\t * %s %d", pre_text, n->details->uname, n->weight); n 1019 lib/pengine/native.c pe_node_t *n = NULL; n 1023 lib/pengine/native.c while (g_hash_table_iter_next(&iter, NULL, (void **)&n)) { n 1024 lib/pengine/native.c print_node("\t", n, FALSE); n 1908 lib/pengine/unpack.c pe_node_t *n = pe__copy_node(node); n 1911 lib/pengine/unpack.c n->details->uname); n 1912 lib/pengine/unpack.c g_hash_table_insert(iter->known_on, (gpointer) n->details->id, n); n 95 lib/pengine/utils.c for (GList *n = rsc->running_on; n != NULL; n = n->next) { n 96 lib/pengine/utils.c pe_node_t *container_node = n->data; n 2401 lib/pengine/utils.c pe_node_t *n = gIter->data; n 2403 lib/pengine/utils.c if (n->details->type != node_member) { n 2409 lib/pengine/utils.c if (n->details->online) { n 2414 lib/pengine/utils.c || n->details->priority > top_priority) { n 2415 lib/pengine/utils.c top_priority = n->details->priority; n 2419 lib/pengine/utils.c || n->details->priority < lowest_priority) { n 2420 lib/pengine/utils.c lowest_priority = n->details->priority; n 38 libltdl/libltdl/lt__alloc.h #define MALLOC(tp, n) (tp*) lt__malloc((n) * sizeof(tp)) n 39 libltdl/libltdl/lt__alloc.h #define REALLOC(tp, mem, n) (tp*) lt__realloc((mem), (n) * sizeof(tp)) n 49 libltdl/libltdl/lt__alloc.h LT_SCOPE void *lt__malloc (size_t n); n 50 libltdl/libltdl/lt__alloc.h LT_SCOPE void *lt__zalloc (size_t n); n 51 libltdl/libltdl/lt__alloc.h LT_SCOPE void *lt__realloc (void *mem, size_t n); n 52 libltdl/libltdl/lt__alloc.h LT_SCOPE void *lt__memdup (void const *mem, size_t n); n 78 libltdl/libltdl/slist.h LT_SCOPE SList *slist_nth (SList *slist, size_t n); n 51 libltdl/lt__alloc.c lt__malloc (size_t n) n 55 libltdl/lt__alloc.c if (! (mem = malloc (n))) n 62 libltdl/lt__alloc.c lt__zalloc (size_t n) n 66 libltdl/lt__alloc.c if ((mem = lt__malloc (n))) n 67 libltdl/lt__alloc.c memset (mem, 0, n); n 73 libltdl/lt__alloc.c lt__realloc (void *mem, size_t n) n 75 libltdl/lt__alloc.c if (! (mem = realloc (mem, n))) n 82 libltdl/lt__alloc.c lt__memdup (void const *mem, size_t n) n 86 libltdl/lt__alloc.c if ((newmem = lt__malloc (n))) n 87 libltdl/lt__alloc.c return memcpy (newmem, mem, n); n 194 libltdl/slist.c slist_nth (SList *slist, size_t n) n 196 libltdl/slist.c for (;n > 1 && slist; n--) n 207 libltdl/slist.c size_t n; n 209 libltdl/slist.c for (n = 0; slist; ++n) n 212 libltdl/slist.c return n; n 29 replace/strndup.c size_t n = strnlen(str, len); n 36 replace/strndup.c new[n] = '\0'; n 1638 tools/crm_mon.c xmlNode *n = xml; n 1676 tools/crm_mon.c while (n != NULL && !pcmk__str_eq(XML_CIB_TAG_STATE, TYPE(n), pcmk__str_casei)) { n 1677 tools/crm_mon.c n = n->parent; n 1680 tools/crm_mon.c if(node == NULL && n) { n 1681 tools/crm_mon.c node = crm_element_value(n, XML_ATTR_UNAME); n 1684 tools/crm_mon.c if (node == NULL && n) { n 1685 tools/crm_mon.c node = ID(n); n 71 tools/crm_resource_ban.c GListPtr n = allnodes; n 72 tools/crm_resource_ban.c for(; n && rc == pcmk_rc_ok; n = n->next) { n 73 tools/crm_resource_ban.c pe_node_t *target = n->data; n 309 tools/crm_resource_ban.c GListPtr n = allnodes; n 314 tools/crm_resource_ban.c for(; n; n = n->next) { n 315 tools/crm_resource_ban.c pe_node_t *target = n->data;