n 907 fencing/main.c int n; n 916 fencing/main.c n = snprintf(xpath, XPATH_MAX, "//" XML_CIB_TAG_NODES n 922 fencing/main.c CRM_CHECK(n < XPATH_MAX, return FALSE); n 53 lib/gnu/md5.c # define SWAP(n) \ n 54 lib/gnu/md5.c (((n) << 24) | (((n) & 0xff00) << 8) | (((n) >> 8) & 0xff00) | ((n) >> 24)) n 56 lib/gnu/md5.c # define SWAP(n) (n) n 154 lib/gnu/md5.c size_t n; n 160 lib/gnu/md5.c n = fread (buffer + sum, 1, BLOCKSIZE - sum, stream); n 162 lib/gnu/md5.c sum += n; n 167 lib/gnu/md5.c if (n == 0) n 652 lib/pengine/native.c node_t *n = (node_t *) gIter->data; n 657 lib/pengine/native.c status_print("<li>\n%s", n->details->uname); n 661 lib/pengine/native.c status_print(" %s", n->details->uname); n 664 lib/pengine/native.c status_print("\t%d : %s", counter, n->details->uname); n 667 lib/pengine/native.c status_print("%s", n->details->uname); n 701 lib/pengine/native.c node_t *n = NULL; n 709 lib/pengine/native.c while (g_hash_table_iter_next(&iter, NULL, (void **)&n)) { n 710 lib/pengine/native.c status_print("%s\t * %s %d", pre_text, n->details->uname, n->weight); n 716 lib/pengine/native.c node_t *n = NULL; n 720 lib/pengine/native.c while (g_hash_table_iter_next(&iter, NULL, (void **)&n)) { n 721 lib/pengine/native.c print_node("\t", n, FALSE); n 1877 lib/pengine/unpack.c node_t *n = node_copy(node); n 1880 lib/pengine/unpack.c n->details->uname); n 1881 lib/pengine/unpack.c g_hash_table_insert(iter->known_on, (gpointer) n->details->id, n); n 190 lib/pengine/utils.c node_t *n = node_copy(node); n 192 lib/pengine/utils.c g_hash_table_insert(result, (gpointer) n->details->id, n); 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 77 libltdl/libltdl/slist.h LT_SCOPE SList *slist_nth (SList *slist, size_t n); n 50 libltdl/lt__alloc.c lt__malloc (size_t n) n 54 libltdl/lt__alloc.c if (! (mem = malloc (n))) n 61 libltdl/lt__alloc.c lt__zalloc (size_t n) n 65 libltdl/lt__alloc.c if ((mem = lt__malloc (n))) n 66 libltdl/lt__alloc.c memset (mem, 0, n); n 72 libltdl/lt__alloc.c lt__realloc (void *mem, size_t n) n 74 libltdl/lt__alloc.c if (! (mem = realloc (mem, n))) n 81 libltdl/lt__alloc.c lt__memdup (void const *mem, size_t n) n 85 libltdl/lt__alloc.c if ((newmem = lt__malloc (n))) n 86 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 221 pengine/clone.c node_t *n = NULL; n 230 pengine/clone.c n = node_copy(resource1->running_on->data); n 231 pengine/clone.c g_hash_table_insert(hash1, (gpointer) n->details->id, n); n 233 pengine/clone.c n = node_copy(resource2->running_on->data); n 234 pengine/clone.c g_hash_table_insert(hash2, (gpointer) n->details->id, n); n 1174 pengine/native.c node_t *n = (node_t *) gIter->data; n 1176 pengine/native.c (n->details == rsc->partial_migration_source->details)) { n 29 replace/strndup.c size_t n = strnlen(str, len); n 36 replace/strndup.c new[n] = '\0'; n 317 replace/uuid_parse.c int i, n = nbytes, fd = get_random_fd(); n 322 replace/uuid_parse.c while (n > 0) { n 323 replace/uuid_parse.c i = read(fd, cp, n); n 329 replace/uuid_parse.c n -= i; n 355 replace/uuid_parse.c int n, i; n 385 replace/uuid_parse.c n = ifc.ifc_len; n 386 replace/uuid_parse.c for (i = 0; i < n; i += ifreq_size(*ifr)) { n 3809 tools/crm_mon.c xmlNode *n = xml; n 3847 tools/crm_mon.c while (n != NULL && safe_str_neq(XML_CIB_TAG_STATE, TYPE(n))) { n 3848 tools/crm_mon.c n = n->parent; n 3851 tools/crm_mon.c if(node == NULL && n) { n 3852 tools/crm_mon.c node = crm_element_value(n, XML_ATTR_UNAME); n 3855 tools/crm_mon.c if (node == NULL && n) { n 3856 tools/crm_mon.c node = ID(n); n 133 tools/crm_node.c int n = 0; n 167 tools/crm_node.c n = strtol(node, &endptr, 10); n 170 tools/crm_node.c n = 0; n 173 tools/crm_node.c name = get_node_name(n); n 176 tools/crm_node.c crm_trace("Removing %s aka. %s (%u) from the membership cache", name, node, n); n 187 tools/crm_node.c if (n) { n 189 tools/crm_node.c if(snprintf(buffer, 63, "%u", n) > 0) { n 197 tools/crm_node.c if (n) { n 198 tools/crm_node.c crm_xml_set_id(cmd, "%u", n); n 204 tools/crm_node.c crm_debug("%s peer cache cleanup for %s (%u): %d", target, name, n, rc); n 207 tools/crm_node.c rc = cib_remove_node(n, name); n 69 tools/crm_resource_ban.c GListPtr n = allnodes; n 70 tools/crm_resource_ban.c for(; n && rc == pcmk_ok; n = n->next) { n 71 tools/crm_resource_ban.c node_t *target = n->data; n 222 tools/crm_resource_ban.c GListPtr n = allnodes; n 223 tools/crm_resource_ban.c for(; n; n = n->next) { n 224 tools/crm_resource_ban.c node_t *target = n->data;