Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:possible (Results 1226 - 1250 of 7007) sorted by null

<<41424344454647484950>>

/external/chromium/net/url_request/
url_request_job.cc	182 // It is also possible that FollowRedirect will drop the last reference to 363 // With async IO, it's quite possible to have a few outstanding 556 // TODO(mbelshe): is it possible that the filter needs *MORE* data
/external/chromium/sdch/open-vcdiff/src/
decodetable_test.cc	134 // Eight combinations of inst and mode, times two possible size values, 136 // exactly 256 possible instruction combinations, which fits kCodeTableSize 144 // A code table that exercises as many combinations as possible:
encodetable_test.cc	135 // Eight combinations of inst and mode, times two possible size values, 137 // exactly 256 possible instruction combinations, which fits kCodeTableSize 141 // A code table that exercises as many combinations as possible:
/external/chromium/testing/gmock/include/gmock/
gmock-generated-nice-strict.h	71 // we have to avoid a possible clash with members of MockClass. 167 // we have to avoid a possible clash with members of MockClass. 259 // all possible errors.
/external/clang/www/
get_started.html	71 <p>It is also possible to use CMake instead of the makefiles. With CMake it 72 is also possible to generate project files for several IDEs: Eclipse CDT4, 203 <p>The 'clang' driver is designed to work as closely to GCC as possible to
/external/dbus/
HACKING	103 (if possible, add a new test to check the fix you're 193 This should be possible if you're in group "dbus" 220 not done immediately, instead it's possible to wait until someone has
/external/e2fsprogs/ext2ed/
main.c	452 * The state variable is an index which tells us how many possible 455 * We return only one possible completion or (char *) NULL if there 459 * While scanning for possible completions, we use the same priority
/external/grub/stage2/
xfs.h	238 * There are 4 possible formats: 411 * Small directories are packed as tightly as possible so as to 442 * Entries are packed toward the top as tightly as possible. The header
/external/kernel-headers/original/asm-x86/
voyager.h	52 /* the range of possible CAT module ids in the system */ 77 /* the biggest possible register size (in bytes) */ 80 /* Total number of possible modules (including submodules) */
/external/libphonenumber/java/
release_notes.txt	108 for that country code are possible. 210 possible carrier prefixes 231 - Allowed reg-exes for national and possible number patterns to have white space in them in the
/external/libpng/
README	55 do not have the PNG file signature. As well, it is now possible to set 56 the library action on the detection of chunk CRC errors. It is possible 102 possible), so I can consider supporting the transformation.
/external/llvm/lib/Analysis/
LoopInfo.cpp	200 /// normal unsigned value, if possible. Returns 0 if the trip count is unknown 217 /// trip count of this loop as a normal unsigned value, if possible. This 352 // then it is possible that there are multiple edges from current block
/external/oprofile/opjitconv/
jitsymbol.c	256 /* Check for max. length to avoid possible integer overflow. */ 285 /* Check for max. length to avoid possible integer overflow. */ 447 * E.g. possible cases to be handled could be:
/external/qemu/distrib/sdl-1.2.12/src/audio/ums/
SDL_umsaudio.c	385 /* possible PCM, A_LAW or MU_LAW */ 393 /* possible SIGNED, UNSIGNED, or TWOS_COMPLEMENT */ 415 * possible UMSAudioTypes_Msecs, UMSAudioTypes_Bytes or UMSAudioTypes_Samples
/external/qemu/distrib/sdl-1.2.12/src/cdrom/linux/
SDL_syscdrom.c	326 /* Finally check possible mountable drives in /etc/fstab */ 349 fprintf(stderr, "Checking possible CD-ROM drive: %s\n", drive); 368 fprintf(stderr, "Checking possible CD-ROM drive: %s\n", drive);
/external/qemu/distrib/zlib-1.2.3/
zlib.h	200 /* Possible values of the data_type field (though see inflate()) */ 244 deflate compresses as much data as possible, and stops when the input 264 one of the actions is possible, by providing more input and/or consuming 301 deflate has returned Z_STREAM_END, the only possible operations on the 321 if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible 365 inflate decompresses as much data as possible, and stops when the input 379 accordingly. inflate() provides as much output as possible, until there 384 one of the actions is possible, by providing more input and/or consuming 394 output as possible to the output buffer. Z_BLOCK requests that inflate() stop 425 possible to the output buffer, and always uses the faster approach on th     [all...]
/external/v8/src/
strtod.cc	134 // Since 2^64 = 18446744073709551616 it would still be possible read another 193 // This is possible because IEEE guarantees that floating-point operations 194 // return the best possible approximation.
/external/valgrind/main/coregrind/m_initimg/
simple_huffman.c	15 * size of 32 bits). If I'm not mistaking, this should not be possible 27 * Possible improvements (probably not worth it): 30 * possible to find locally optimal Huffman trees, which in turn could
/external/wpa_supplicant_6/wpa_supplicant/src/wps/
wps_upnp_event.c	279 * It is also possible that we are called because the connect has failed; 280 * it is possible to test for this, or we can just go ahead and then 477 * -- Possible stack depth or infinite recursion issues.
/external/zlib/
algorithm.txt	35 possible match but generally finds a match which is long enough. 83 For inflate, which has 286 possible codes for the literal/length tree, the size 84 of the first table is nine bits. Also the distance trees have 30 possible
/external/zlib/contrib/amd64/
amd64-match.S	7 * parafernalia is prohibited, where possible, and highly discouraged 390 /* then automatically accept it as the best possible match and leave. */ 426 /* Accept the current string, with the maximum possible length. */
/external/zlib/doc/
algorithm.txt	35 possible match but generally finds a match which is long enough. 83 For inflate, which has 286 possible codes for the literal/length tree, the size 84 of the first table is nine bits. Also the distance trees have 30 possible
/frameworks/base/core/java/android/view/inputmethod/
InputConnection.java	172 * the text you are providing so it is not possible to correctly 212 * the text you are providing so it is not possible to correctly 222 * Commit a completion the user has selected from the possible ones
/frameworks/base/include/media/stagefright/openmax/
OMX_Other.h	63 * Enumeration of possible data types which match to multiple domains or no 137 /** Enumeration of possible reference clocks to the media time. */ 147 /** Enumeration of possible reference clocks to the media time. */
/frameworks/base/media/java/android/media/
MediaMetadataRetriever.java	193 * the given option if possible, and returns it as a bitmap. This is 230 * representative frame close to the given time position if possible, 254 * representative frame at any time position if possible,

Completed in 1590 milliseconds

<<41424344454647484950>>