/external/mdnsresponder/mDNSCore/ |
H A D | DNSCommon.c | 519 { // If three decimal digits, 655 // and have as interior characters only letters, digits, and hyphen. 752 // Letters and digits are allowed anywhere 769 errormsg = "Application protocol name must contain only letters, digits, and hyphens"; 898 while (l > 2 && mDNSIsDigit(name->c[l])) l--; // Strip off digits 906 while (l > 2 && mDNSIsDigit(name->c[l])) l--; // Strip off digits 2890 char *s = mDNS_VACB_Lim, *digits; local 3015 case 'X' : digits = "0123456789ABCDEF"; 3017 case 'x' : digits = "0123456789abcdef"; 3032 for (i = 0; n; n /= 16, i++) *--s = digits[ [all...] |
/external/valgrind/main/VEX/switchback/ |
H A D | test_ppc_jm1.c | 413 HChar *digits = "0123456789ABCDEF"; local 435 buf[ind++] = digits[p % base];
|
H A D | test_bzip2.c | 1064 HChar *digits = "0123456789ABCDEF"; local 1086 buf[ind++] = digits[p % base];
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/Getopt/ |
H A D | Mixed.pm | 670 '^[-+]?\d+$', which matches a string of digits preceded by an
|
/external/dropbear/libtommath/pre_gen/ |
H A D | mpi.c | 245 /* first we have to get the digits of the input into 255 /* alias for the digits of x*/ 258 /* copy the digits of a into W[0..a->used-1] */ 269 /* now we proceed to zero successive digits 290 * column since the Montgomery reduction requires digits of the 301 /* alias for the digits of the modulus */ 319 * significant digits we zeroed]. 354 /* zero oldused digits, if the input a was larger than 355 * m->used+1 we'll have to clear the digits 407 * digits o 6324 mp_rand(mp_int * a, int digits) argument [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.equinox.preferences_3.3.0.v20100503.jar | ... lang.Object {
private static final byte equalSign static char[] digits static void " href="/4.2_r1/s?defs= ... |
H A D | org.eclipse.jface.text_3.6.1.r361_v20100825-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.mortbay.jetty.util_6.1.23.v201004211559.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | com.ibm.icu_4.2.1.v20100412.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.osgi_3.6.1.R36x_v20100806.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.osgi_3.6.2.R36x_v20101103.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.ui.workbench_3.6.1.M20101117-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/valgrind/main/exp-sgcheck/tests/ |
H A D | hackedbz2.c | 1086 HChar *digits = "0123456789ABCDEF"; local 1108 buf[ind++] = digits[p % base];
|
/external/valgrind/main/memcheck/tests/ |
H A D | origin5-bz2.c | 1079 HChar *digits = "0123456789ABCDEF"; local 1101 buf[ind++] = digits[p % base];
|
H A D | varinfo6.c | 1117 HChar *digits = "0123456789ABCDEF"; local 1139 buf[ind++] = digits[p % base];
|
/external/valgrind/main/perf/ |
H A D | bz2.c | 1079 HChar *digits = "0123456789ABCDEF"; local 1101 buf[ind++] = digits[p % base];
|
H A D | test_input_for_tinycc.c | 1319 HChar *digits = "0123456789ABCDEF"; local 1341 buf[ind++] = digits[p % base];
|
H A D | tinycc.c | 8765 /* at most three octal digits */ 8904 /* parse all digits. cannot check octal numbers at this stage 8986 expect("exponent digits"); 9039 expect("exponent digits"); 9350 /* after the first digit, accept digits, alpha, '.' or sign if
|
/external/libxml2/ |
H A D | xmlschemastypes.c | 1212 /* year must be at least 4 digits (CCYY); over 4 1213 * digits cannot have a leading zero. */ 1233 * Parses a 2-digits integer and updates @num with the value. @cur is 1254 * 2-digits integer part and may or may not have a decimal part. 1489 * Parses a digits integer and updates @num with the value. @cur is 2065 * Returns the number of significant digits in the number or 2330 * Now evaluate the significant digits of the number 2358 * Set the total digits to 1 if a zero value. 3445 * If the number of integral digits differ, then we have our 3487 * If the number of integral digits i [all...] |
/external/dropbear/libtomcrypt/ |
H A D | crypt.tex | 6030 /** Get the number of digits that represent the number 6032 @return The number of digits used to represent the number 6405 then partition your digits. Normally this does not matter as \textit{unsigned long} will be the same size as your register size. Note that if your digit is smaller
|
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |