Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:nch (Results 1 - 19 of 19) sorted by null

/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Parser/
node.c	81 const int nch = n1->n_nchildren; local 86 if (nch == INT_MAX || nch < 0) 89 current_capacity = XXXROUNDUP(nch); 90 required_capacity = XXXROUNDUP(nch + 1); 143 for (i = NCH(n); --i >= 0; ) 156 for (i = NCH(n); --i >= 0; ) 160 res += XXXROUNDUP(NCH(n)) * sizeof(node);
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Parser/
node.c	81 const int nch = n1->n_nchildren; local 86 if (nch == INT_MAX || nch < 0) 89 current_capacity = XXXROUNDUP(nch); 90 required_capacity = XXXROUNDUP(nch + 1); 132 for (i = NCH(n); --i >= 0; )
/bionic/libc/dns/resolv/
res_comp.c	175 int nch = *dn++; local 182 } else if (periodchar(nch) || nch == '\0') { 189 pch = ch, ch = nch;
/device/linaro/bootloader/edk2/StdLib/BsdSocketLib/
res_comp.c	184 int nch = *dn++; local 191 } else if (periodchar(nch) || nch == '\0') { 199 ch = nch;
/external/opencv/otherlibs/highgui/
grfmt_sunras.cpp	183 int nch = color ? 3 : 1; local 184 int width3 = m_width*nch; 309 while( (max_count -= nch) > 0 ); 319 data += len1*nch; 324 len = (len + 1)*nch;
grfmt_bmp.cpp	197 int nch = color ? 3 : 1; local 198 int width3 = m_width*nch; 272 uchar* end = data + len*nch; 282 while( (data += nch) < end ); 286 if( data + code*nch > line_end ) goto decode_rle4_bad; 300 x_shift3 = m_strm.GetByte()*nch; 353 len *= nch; 372 int code3 = code*nch; 393 x_shift3 = m_strm.GetByte()*nch;
grfmt_pxm.cpp	206 int nch = m_iscolor ? 3 : 1; local 207 int width3 = m_width*nch;
grfmt_jpeg.cpp	1117 int nch = color ? 3 : 1; local     [all...]
/frameworks/av/media/libstagefright/codecs/aacenc/src/
psy_main.c	123 Word32 nch; local 133 for (nch=0; nch<MAX_CHANNELS; nch++){ 134 hPsy->psyData[nch].mdctDelayBuffer = NULL; 135 hPsy->psyData[nch].mdctSpectrum = NULL;
/external/libedit/src/
tty.c	61 Int nch, och; /* Internal and termio rep of chars */ member in struct:ttymap_t 920 for (tp = tty_map; tp->nch != (Int)-1; tp++) { 921 new[0] = t_n[tp->nch];     [all...]
/external/webrtc/webrtc/common_audio/
fft4g.c	679 size_t j, nch; local 684 nch = nc >> 1; 685 delta = atanf(1.0f) / nch; 686 c[0] = (float)cos(delta * nch); 687 c[nch] = 0.5f * c[0]; 688 for (j = 1; j < nch; j++) {     [all...]
/bionic/libc/upstream-netbsd/lib/libc/regex/
regcomp.c	150 static int nch(struct parse *p, cset *cs); 827 if (nch(p, cs) == 1) { /* optimize singleton sets */ 1381 nch( function     [all...]
/external/llvm/lib/Support/
regcomp.c	100 static int nch(struct parse *, cset *); 737 if (nch(p, cs) == 1) { /* optimize singleton sets */ 1193 - nch - number of characters in a set 1196 nch(struct parse *p, cset *cs) function     [all...]
/external/swiftshader/third_party/LLVM/lib/Support/
regcomp.c	92 static int nch(struct parse *, cset *); 701 if (nch(p, cs) == 1) { /* optimize singleton sets */ 1155 - nch - number of characters in a set 1158 nch(struct parse *p, cset *cs) function     [all...]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Python/
ast.c	179 for (i = 0; i < NCH(n); i++) { 190 return NCH(n) / 2; /* Divide by 2 to remove count of semi-colons */ 192 if (NCH(n) == 1) 196 for (i = 2; i < (NCH(n) - 1); i++) 204 TYPE(n), NCH(n)); 247 for (i = 0; i < NCH(n) - 1; i++) { 306 for (i = 0; i < NCH(n); i += 2) { 532 if (NCH(n) == 1) { 558 else if (NCH(n) == 2) { 573 NCH(n)); 3064 const int nch = NCH(n); local     [all...]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Python/
ast.c	179 for (i = 0; i < NCH(n); i++) { 190 return NCH(n) / 2; /* Divide by 2 to remove count of semi-colons */ 192 if (NCH(n) == 1) 196 for (i = 2; i < (NCH(n) - 1); i++) 204 TYPE(n), NCH(n)); 247 for (i = 0; i < NCH(n) - 1; i++) { 306 for (i = 0; i < NCH(n); i += 2) { 532 if (NCH(n) == 1) { 558 else if (NCH(n) == 2) { 573 NCH(n)); 3047 const int nch = NCH(n); local     [all...]
/external/opencv/cxcore/src/
cxdrawing.cpp	308 int nch = CV_MAT_CN( img->type ); local 313 assert( img && (nch == 1 || nch == 3) && CV_MAT_DEPTH(img->type) == CV_8U ); 319 ptr += img->step*2 + 2*nch; 402 if( nch == 3 ) 576 //assert( img && (nch == 1 || nch == 3) && CV_MAT_DEPTH(img->type) == CV_8U );     [all...]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/
parsermodule.c	97 v = mkseq(1 + NCH(n) + (TYPE(n) == encoding_decl)); 106 for (i = 0; i < NCH(n); i++) { 252 if (NCH(left) < NCH(right)) 255 if (NCH(right) < NCH(left)) 258 for (j = 0; j < NCH(left); ++j) { 1033 int nch = NCH(tree); local 1061 int nch = NCH(tree); local 1096 int nch = NCH(tree); local 1138 int nch = NCH(tree); local 1163 int nch = NCH(tree); local 1217 int nch = NCH(tree); local 1263 int nch = NCH(tree); local 1394 int nch = NCH(tree); local 1416 int nch = NCH(tree); local 1438 int nch = NCH(tree); local 1458 int nch = NCH(tree); local 1482 int nch = NCH(tree); local 1534 int nch = NCH(tree); local 1559 int nch = NCH(tree); local 1635 int nch = NCH(tree); local 1681 int nch = NCH(tree); local 1733 int nch = NCH(tree); local 1748 int nch = NCH(tree); local 1779 int nch = NCH(tree); local 1805 int nch = NCH(tree); local 1827 int nch = NCH(tree); local 1846 int nch = NCH(tree); local 1869 int nch = NCH(tree); local 1884 int nch = NCH(tree); local 1924 int nch = NCH(tree); local 1950 int nch = NCH(tree); local 1979 int nch = NCH(tree); local 2004 int nch = NCH(tree); local 2030 int nch = NCH(tree); local 2049 int nch = NCH(tree); local 2069 int nch = NCH(tree); local 2097 int nch = NCH(tree); local 2152 int nch = NCH(tree); local 2173 int nch = NCH(tree); local 2193 int nch = NCH(tree); local 2207 int nch = NCH(tree); local 2225 int nch = NCH(tree); local 2241 int nch = NCH(tree); local 2259 int nch = NCH(tree); local 2276 int nch = NCH(tree); local 2327 int nch = NCH(tree); local 2344 int nch = NCH(tree); local 2361 int nch = NCH(tree); local 2378 int nch = NCH(tree); local 2413 int nch = NCH(tree); local 2436 int nch = NCH(tree); local 2457 int nch = NCH(tree); local 2480 int nch = NCH(tree); local 2544 int nch = NCH(tree); local 2581 int nch = NCH(tree); local 2620 int nch = NCH(tree); local 2644 int i, nch, ok; local 2660 int nch = NCH(tree); local 2678 int nch = NCH(tree); local 2697 int nch = NCH(tree); local 2715 int nch = NCH(tree); local 2729 int nch = NCH(tree); local 2748 int nch = NCH(tree); local 2771 int nch = NCH(tree); local 2855 int nch = NCH(tree); local 2878 int nch = NCH(tree); local 2929 int nch = NCH(tree); local 2979 int nch = NCH(tree); local 3011 int nch = NCH(tree); local 3087 int nch = NCH(tree); local 3103 int nch = 0; \/* num. children on current node *\/ local 3316 int nch = NCH(tree) - 1; local 3339 int nch = NCH(tree); local     [all...]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/
parsermodule.c	97 v = mkseq(1 + NCH(n) + (TYPE(n) == encoding_decl)); 106 for (i = 0; i < NCH(n); i++) { 221 if (NCH(left) < NCH(right)) 224 if (NCH(right) < NCH(left)) 227 for (j = 0; j < NCH(left); ++j) { 1004 int nch = NCH(tree); local 1032 int nch = NCH(tree); local 1067 int nch = NCH(tree); local 1109 int nch = NCH(tree); local 1134 int nch = NCH(tree); local 1188 int nch = NCH(tree); local 1234 int nch = NCH(tree); local 1365 int nch = NCH(tree); local 1387 int nch = NCH(tree); local 1409 int nch = NCH(tree); local 1429 int nch = NCH(tree); local 1453 int nch = NCH(tree); local 1505 int nch = NCH(tree); local 1530 int nch = NCH(tree); local 1606 int nch = NCH(tree); local 1652 int nch = NCH(tree); local 1704 int nch = NCH(tree); local 1719 int nch = NCH(tree); local 1750 int nch = NCH(tree); local 1776 int nch = NCH(tree); local 1798 int nch = NCH(tree); local 1817 int nch = NCH(tree); local 1840 int nch = NCH(tree); local 1855 int nch = NCH(tree); local 1895 int nch = NCH(tree); local 1921 int nch = NCH(tree); local 1950 int nch = NCH(tree); local 1975 int nch = NCH(tree); local 2001 int nch = NCH(tree); local 2020 int nch = NCH(tree); local 2040 int nch = NCH(tree); local 2068 int nch = NCH(tree); local 2123 int nch = NCH(tree); local 2144 int nch = NCH(tree); local 2164 int nch = NCH(tree); local 2178 int nch = NCH(tree); local 2196 int nch = NCH(tree); local 2212 int nch = NCH(tree); local 2230 int nch = NCH(tree); local 2247 int nch = NCH(tree); local 2298 int nch = NCH(tree); local 2315 int nch = NCH(tree); local 2332 int nch = NCH(tree); local 2349 int nch = NCH(tree); local 2384 int nch = NCH(tree); local 2407 int nch = NCH(tree); local 2428 int nch = NCH(tree); local 2451 int nch = NCH(tree); local 2515 int nch = NCH(tree); local 2552 int nch = NCH(tree); local 2591 int nch = NCH(tree); local 2615 int i, nch, ok; local 2631 int nch = NCH(tree); local 2649 int nch = NCH(tree); local 2668 int nch = NCH(tree); local 2686 int nch = NCH(tree); local 2700 int nch = NCH(tree); local 2719 int nch = NCH(tree); local 2742 int nch = NCH(tree); local 2826 int nch = NCH(tree); local 2849 int nch = NCH(tree); local 2900 int nch = NCH(tree); local 2950 int nch = NCH(tree); local 2982 int nch = NCH(tree); local 3058 int nch = NCH(tree); local 3074 int nch = 0; \/* num. children on current node *\/ local 3287 int nch = NCH(tree) - 1; local 3310 int nch = NCH(tree); local     [all...]

Completed in 2141 milliseconds