N                 117 lib/c-ctype.h  #define _C_CTYPE_LOWER_A_THRU_F_N(N) \
N                 118 lib/c-ctype.h     case 'a' + (N): case 'b' + (N): case 'c' + (N): case 'd' + (N): \
N                 119 lib/c-ctype.h     case 'e' + (N): case 'f' + (N)
N                 120 lib/c-ctype.h  #define _C_CTYPE_LOWER_N(N) \
N                 121 lib/c-ctype.h     _C_CTYPE_LOWER_A_THRU_F_N(N): \
N                 122 lib/c-ctype.h     case 'g' + (N): case 'h' + (N): case 'i' + (N): case 'j' + (N): \
N                 123 lib/c-ctype.h     case 'k' + (N): case 'l' + (N): case 'm' + (N): case 'n' + (N): \
N                 124 lib/c-ctype.h     case 'o' + (N): case 'p' + (N): case 'q' + (N): case 'r' + (N): \
N                 125 lib/c-ctype.h     case 's' + (N): case 't' + (N): case 'u' + (N): case 'v' + (N): \
N                 126 lib/c-ctype.h     case 'w' + (N): case 'x' + (N): case 'y' + (N): case 'z' + (N)
N                  36 lib/gettext.h  #  define ngettext(Msgid1, Msgid2, N) \
N                  37 lib/gettext.h       dngettext (DEFAULT_TEXT_DOMAIN, Msgid1, Msgid2, N)
N                  75 lib/gettext.h  # define ngettext(Msgid1, Msgid2, N) \
N                  76 lib/gettext.h      ((N) == 1 \
N                  80 lib/gettext.h  # define dngettext(Domainname, Msgid1, Msgid2, N) \
N                  81 lib/gettext.h      ((void) (Domainname), ngettext (Msgid1, Msgid2, N))
N                  83 lib/gettext.h  # define dcngettext(Domainname, Msgid1, Msgid2, N, Category) \
N                  84 lib/gettext.h      ((void) (Category), dngettext (Domainname, Msgid1, Msgid2, N))
N                 130 lib/gettext.h  # define npgettext(Msgctxt, Msgid, MsgidPlural, N) \
N                 131 lib/gettext.h     npgettext_aux (DEFAULT_TEXT_DOMAIN, Msgctxt GETTEXT_CONTEXT_GLUE Msgid, Msgid, MsgidPlural, N, LC_MESSAGES)
N                 133 lib/gettext.h  # define npgettext(Msgctxt, Msgid, MsgidPlural, N) \
N                 134 lib/gettext.h     npgettext_aux (NULL, Msgctxt GETTEXT_CONTEXT_GLUE Msgid, Msgid, MsgidPlural, N, LC_MESSAGES)
N                 136 lib/gettext.h  #define dnpgettext(Domainname, Msgctxt, Msgid, MsgidPlural, N) \
N                 137 lib/gettext.h    npgettext_aux (Domainname, Msgctxt GETTEXT_CONTEXT_GLUE Msgid, Msgid, MsgidPlural, N, LC_MESSAGES)
N                 138 lib/gettext.h  #define dcnpgettext(Domainname, Msgctxt, Msgid, MsgidPlural, N, Category) \
N                 139 lib/gettext.h    npgettext_aux (Domainname, Msgctxt GETTEXT_CONTEXT_GLUE Msgid, Msgid, MsgidPlural, N, Category)
N                 252 lib/gettext.h  #define npgettext_expr(Msgctxt, Msgid, MsgidPlural, N) \
N                 253 lib/gettext.h    dcnpgettext_expr (NULL, Msgctxt, Msgid, MsgidPlural, N, LC_MESSAGES)
N                 254 lib/gettext.h  #define dnpgettext_expr(Domainname, Msgctxt, Msgid, MsgidPlural, N) \
N                 255 lib/gettext.h    dcnpgettext_expr (Domainname, Msgctxt, Msgid, MsgidPlural, N, LC_MESSAGES)
N                 151 lib/nstrftime.c # define advance(P, N)
N                 153 lib/nstrftime.c # define advance(P, N) ((P) += (N))
N                4225 src/buffer.c   #define ROUND(X, N)	(((X) + (N) - 1) / (N) * (N))
N                1071 src/font.c     #define INTERN_FIELD(N) font_intern_prop (f[N], f[(N) + 1] - 1 - f[N], 0)
N                1072 src/font.c     #define INTERN_FIELD_SYM(N) font_intern_prop (f[N], f[(N) + 1] - 1 - f[N], 1)
N                  44 test/lisp/cedet/semantic-utest-ia-resources/testsubclass.cpp   fFeet = N// -15-
N                 417 test/manual/etags/y-src/cccp.c #  define YYSTACK_BYTES(N) \
N                 418 test/manual/etags/y-src/cccp.c      ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE))	\
N                 421 test/manual/etags/y-src/cccp.c #  define YYSTACK_BYTES(N) \
N                 422 test/manual/etags/y-src/cccp.c      ((N) * (sizeof (short) + sizeof (YYSTYPE))				\
N                 508 test/manual/etags/y-src/cccp.c # define YYLLOC_DEFAULT(Current, Rhs, N)       	\
N                 509 test/manual/etags/y-src/cccp.c    Current.last_line   = Rhs[N].last_line;	\
N                 510 test/manual/etags/y-src/cccp.c    Current.last_column = Rhs[N].last_column;
N                 496 test/manual/etags/y-src/parse.c #  define YYSTACK_BYTES(N) \
N                 497 test/manual/etags/y-src/parse.c      ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE))	\
N                 500 test/manual/etags/y-src/parse.c #  define YYSTACK_BYTES(N) \
N                 501 test/manual/etags/y-src/parse.c      ((N) * (sizeof (short) + sizeof (YYSTYPE))				\
N                 587 test/manual/etags/y-src/parse.c # define YYLLOC_DEFAULT(Current, Rhs, N)       	\
N                 588 test/manual/etags/y-src/parse.c    Current.last_line   = Rhs[N].last_line;	\
N                 589 test/manual/etags/y-src/parse.c    Current.last_column = Rhs[N].last_column;
N                  54 test/manual/noverlay/itree-tests.c   const int values[N] = {50, 30, 20, 10, 15, 5};
N                  55 test/manual/noverlay/itree-tests.c   struct itree_node *nodes[N] = {&N_50, &N_30, &N_20, &N_10, &N_15, &N_05};
N                  57 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 240 test/manual/noverlay/itree-tests.c   struct itree_node *nodes[N] = {&N_50, &N_70, &N_80, &N_90, &N_85, &N_95};
N                 242 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 420 test/manual/noverlay/itree-tests.c   const int values[N] = {10, 20, 30, 40};
N                 421 test/manual/noverlay/itree-tests.c   struct itree_node *nodes[N] = {&N_10, &N_20, &N_30, &N_40};
N                 423 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 440 test/manual/noverlay/itree-tests.c   struct itree_node nodes[N];
N                 443 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 445 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 677 test/manual/noverlay/itree-tests.c   const int values[N] = {10, 20, 30, 40};
N                 678 test/manual/noverlay/itree-tests.c   struct itree_node *nodes[N] = {&N_10, &N_20, &N_30, &N_40};
N                 680 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 719 test/manual/noverlay/itree-tests.c   int index[N];
N                 720 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 723 test/manual/noverlay/itree-tests.c   shuffle (index, N);
N                 726 test/manual/noverlay/itree-tests.c   struct itree_node nodes[N];
N                 727 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 733 test/manual/noverlay/itree-tests.c   shuffle (index, N);
N                 734 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 845 test/manual/noverlay/itree-tests.c   struct itree_node nodes[N] = {{.begin = 10, .end = 10},
N                 848 test/manual/noverlay/itree-tests.c   test_create_tree (nodes, N, true);
N                 860 test/manual/noverlay/itree-tests.c   struct itree_node nodes[N] = {{.begin = 10, .end = 30},
N                 864 test/manual/noverlay/itree-tests.c   test_create_tree (nodes, N, false);
N                 867 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 886 test/manual/noverlay/itree-tests.c   struct itree_node nodes[N] = {{.begin = 10, .end = 30},
N                 890 test/manual/noverlay/itree-tests.c   test_create_tree (nodes, N, true);
N                 893 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 912 test/manual/noverlay/itree-tests.c   struct itree_node nodes[N] = {{.begin = 10, .end = 30},
N                 916 test/manual/noverlay/itree-tests.c   test_create_tree (nodes, N, true);
N                 919 test/manual/noverlay/itree-tests.c   for (int i = 0; i < N; ++i)
N                 938 test/manual/noverlay/itree-tests.c   struct itree_node nodes[N] = {{.begin = 20, .end = 30},
N                 940 test/manual/noverlay/itree-tests.c   test_create_tree (nodes, N, false);
N                 955 test/manual/noverlay/itree-tests.c   struct itree_node nodes[N] = {{.begin = 25, .end = 25},
N                 957 test/manual/noverlay/itree-tests.c   test_create_tree (nodes, N, false);