Searched refs:nN (Results 1 – 25 of 54) sorted by relevance
123
142 size_t nN = n / sizeof(Ty); \ in main()193 for (i = 0; i < nN-1; i++) { aNb[i] = undefN_Ty[0]; } \ in main()199 for (i = 0; i < nN-1; i++) { bNb[i] = aNb[i]; } \ in main()200 for (i = 0; i < nN-1; i++) { aNb[i] = bNb[i]; } \ in main()
33 [lL][iI][nN][kK] { yylval->i = TCF_LAYER_LINK; return LAYER; }34 [nN][eE][tT] { yylval->i = TCF_LAYER_NETWORK; return LAYER; }
132 [aA][nN][dD] return AND;134 [nN][oO][tT] return NOT;
12 nN
13 nN
14 nN
15 nN
16 nN
1661 const int nN = m_nN; in pN_equals_ANC_times_qC() local1662 for (int i=0; i<nN; ++i) { in pN_equals_ANC_times_qC()1674 const int nN = m_nN; in pN_plusequals_ANi() local1675 for (int j=0; j<nN; ++j) ptgt[j] += aptr[j]; in pN_plusequals_ANi()1678 const int nN = m_nN; in pN_plusequals_ANi() local1679 for (int j=0; j<nN; ++j) ptgt[j] -= aptr[j]; in pN_plusequals_ANi()1695 const int nN = m_nN; in pN_plusequals_s_times_qN() local1696 for (int i=0; i<nN; ++i) { in pN_plusequals_s_times_qN()
20 \x821\x9c\x9e\xbc\xa2\xb5N\x81\xd6\xc4\nN\xccUS\x99\x02\xa2\xf2\x00ax\xc1\