n                 190 include/crm/common/mainloop.h void pcmk_quit_main_loop(GMainLoop *mloop, unsigned int n);
n                 169 include/gettext.h                const char *msgid_plural, unsigned long int n,
n                 173 include/gettext.h     dcngettext (domain, msg_ctxt_id, msgid_plural, n, category);
n                 175 include/gettext.h     return (n == 1 ? msgid : msgid_plural);
n                 259 include/gettext.h                   const char *msgid_plural, unsigned long int n,
n                 280 include/gettext.h       translation = dcngettext (domain, msg_ctxt_id, msgid_plural, n, category);
n                 289 include/gettext.h   return (n == 1 ? msgid : msgid_plural);
n                1415 lib/common/mainloop.c pcmk_quit_main_loop(GMainLoop *mloop, unsigned int n)
n                1423 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                 189 lib/common/xml_element.c         const char *n = name;
n                 193 lib/common/xml_element.c         for (; (*n == *v) && (*n != '\0'); n++, v++);
n                 196 lib/common/xml_element.c         if ((*n == '\0')
n                 651 lib/pengine/native.c             pcmk_node_t *n = (pcmk_node_t *) iter->data;
n                 653 lib/pengine/native.c             have_nodes = add_output_node(outstr, n->priv->name, have_nodes);
n                1203 lib/pengine/pe_actions.c         pcmk_node_t *n = gIter->data;
n                1205 lib/pengine/pe_actions.c         if (n->priv->variant != pcmk__node_variant_cluster) {
n                1211 lib/pengine/pe_actions.c         if (n->details->online) {
n                1216 lib/pengine/pe_actions.c             || n->priv->priority > top_priority) {
n                1217 lib/pengine/pe_actions.c             top_priority = n->priv->priority;
n                1221 lib/pengine/pe_actions.c             || n->priv->priority < lowest_priority) {
n                1222 lib/pengine/pe_actions.c             lowest_priority = n->priv->priority;
n                2313 lib/pengine/unpack.c                 pcmk_node_t *n = pe__copy_node(node);
n                2318 lib/pengine/unpack.c                                 pcmk__node_name(n));
n                2320 lib/pengine/unpack.c                                     (gpointer) n->priv->id, n);
n                  44 lib/pengine/utils.c         for (GList *n = rsc->priv->active_nodes; n != NULL; n = n->next) {
n                  45 lib/pengine/utils.c             pcmk_node_t *launcher_node = n->data;
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                1729 tools/crm_mon.c     xmlNode *n = xml;
n                1758 tools/crm_mon.c     while ((n != NULL) && !pcmk__xe_is(n, PCMK__XE_NODE_STATE)) {
n                1759 tools/crm_mon.c         n = n->parent;
n                1762 tools/crm_mon.c     if(node == NULL && n) {
n                1763 tools/crm_mon.c         node = crm_element_value(n, PCMK_XA_UNAME);
n                1766 tools/crm_mon.c     if (node == NULL && n) {
n                1767 tools/crm_mon.c         node = pcmk__xe_id(n);
n                 336 tools/crm_resource_ban.c         GList *n = allnodes;
n                 341 tools/crm_resource_ban.c         for(; n; n = n->next) {
n                 342 tools/crm_resource_ban.c             pcmk_node_t *target = n->data;