HomeSort by relevance Sort by last modified time
    Searched full:possible (Results 251 - 275 of 11328) sorted by null

<<11121314151617181920>>

  /frameworks/opt/telephony/src/java/com/android/internal/telephony/cdma/
CallFailCause.java 20 * CDMA Call fail causes covering all the possible failures that are
22 * are derived from the possible call failure scenarios described
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/
iconv.h 36 This function is a possible cancellation points and therefore not
50 This function is a possible cancellation points and therefore not
grp.h 61 This function is a possible cancellation point and therefore not
67 This function is a possible cancellation point and therefore not
73 This function is a possible cancellation point and therefore not
101 This function is a possible cancellation point and therefore not
107 This function is a possible cancellation point and therefore not
140 This function is a possible cancellation point and therefore not
148 This function is a possible cancellation point and therefore not
pwd.h 71 This function is a possible cancellation point and therefore not
77 This function is a possible cancellation point and therefore not
83 This function is a possible cancellation point and therefore not
109 This function is a possible cancellation point and therefore not
115 This function is a possible cancellation point and therefore not
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/
iconv.h 36 This function is a possible cancellation point and therefore not
50 This function is a possible cancellation point and therefore not
grp.h 62 This function is a possible cancellation point and therefore not
71 This function is a possible cancellation point and therefore not
77 This function is a possible cancellation point and therefore not
105 This function is a possible cancellation point and therefore not
111 This function is a possible cancellation point and therefore not
144 This function is a possible cancellation point and therefore not
152 This function is a possible cancellation point and therefore not
pwd.h 71 This function is a possible cancellation point and therefore not
77 This function is a possible cancellation point and therefore not
83 This function is a possible cancellation point and therefore not
109 This function is a possible cancellation point and therefore not
115 This function is a possible cancellation point and therefore not
  /prebuilts/tools/common/proguard/proguard4.7/docs/manual/
optimizations.html 67 <dd>Marks classes as final, whenever possible.</dd>
70 <dd>Merges classes vertically in the class hierarchy, whenever possible.</dd>
73 <dd>Merges classes horizontally in the class hierarchy, whenever possible.</dd>
80 <dd>Marks fields as private, whenever possible.</dd>
87 <dd>Marks methods as private, whenever possible (<i>devirtualization</i>).</dd>
91 <dd>Marks methods as static, whenever possible (<i>devirtualization</i>).</dd>
94 <dd>Marks methods as final, whenever possible.</dd>
117 <dd>Simplifies tail recursion calls, whenever possible.</dd>
  /external/clang/lib/StaticAnalyzer/Checkers/
BoolAssignmentChecker.cpp 101 // Is it possible for the value to be less than zero?
103 // It is possible for the value to be less than zero. We only
105 // If it it possible for the value to be >= 0, then essentially the
137 // Is it possible for the value to be greater than one?
139 // It is possible for the value to be greater than one. We only
141 // If it is possible for the value to be <= 1, then essentially the
  /external/pcre/dist/doc/
pcrematching.3 24 When there is only one possible way in which a given subject string can match a
34 there are three possible answers. The standard algorithm finds only one of
64 the algorithm stops. Thus, if there is more than one possible match, this
94 Thus, if there is more than one possible match, this algorithm finds all of
113 DFA matching, this means that only one possible match is found. If you really
120 1. Because the algorithm finds all possible matches, the greedy or ungreedy
165 1. All possible matches (at a single point in the subject) are automatically
171 never needs to backtrack (except for lookbehinds), it is possible to pass very
173 partial matching each time. Although it is possible to do multi-segment
189 because it has to search for all possible matches, but is also because it i
    [all...]
  /external/clang/test/CXX/over/over.over/
p2-resolve-single-template-id.cpp 30 void two() { } // expected-note 2 {{possible target for call}}
31 void two(int) { } // expected-note 2 {{possible target for call}}
32 template<class T> void twoT() { } // expected-note 2 {{possible target for call}}
33 template<class T> void twoT(T) { } // expected-note 2 {{possible target for call}}
128 template <typename T> bool f(T) { return false; } // expected-note 4 {{possible target for call}}
131 template <typename T> bool h(T) { return false; } // expected-note 3 {{possible target for call}}
132 template <int N> static bool h(int) { return false; } // expected-note 3 {{possible target for call}}
  /external/valgrind/docs/internals/
3_7_BUGSTATUS.txt 36 **possible 3.8.0
49 **possible 3.8.0 (redundant REX prefix)
129 **possible 3.8.0 (easy to fix?)
132 **possible 3.8.0 ? see also 301011 (32 bit)
142 **possible 3.8.0; has low risk patch
177 **possible 3.8.0; see also 295808 (64 bit)
183 **possible 3.8.0. OP queried; is this the same as 287175 ?
  /external/clang/test/SemaCXX/
scope-check.cpp 84 lbl1: // expected-note {{possible target of indirect goto}}
100 lbl1: // expected-note {{possible target of indirect goto}}
226 l0: // expected-note {{possible target of indirect goto}}
240 l0: // expected-note {{possible target of indirect goto}}
255 l0: // expected-note {{possible target of indirect goto}}
322 x: // expected-note {{possible target of indirect goto}}
343 x: // expected-note {{possible target of indirect goto}}
368 x: // expected-note {{possible target of indirect goto}}
607 goto *ip; // expected-error {{cannot jump from this indirect goto statement to one of its possible targets}}
614 goto *ip; // expected-error {{cannot jump from this indirect goto statement to one of its possible targets}
    [all...]
  /external/proguard/docs/manual/
optimizations.html 69 <dd>Marks classes as final, whenever possible.</dd>
72 <dd>Simplifies enum types to integer constants, whenever possible.</dd>
75 <dd>Merges classes vertically in the class hierarchy, whenever possible.</dd>
78 <dd>Merges classes horizontally in the class hierarchy, whenever possible.</dd>
85 <dd>Marks fields as private, whenever possible.</dd>
92 <dd>Marks methods as private, whenever possible (<i>devirtualization</i>).</dd>
96 <dd>Marks methods as static, whenever possible (<i>devirtualization</i>).</dd>
99 <dd>Marks methods as final, whenever possible.</dd>
122 <dd>Simplifies tail recursion calls, whenever possible.</dd>
  /external/v8/src/
effects.h 20 // or 'possible', if it was optional. The difference is relevant when composing
25 // effect cancels out any previous effect upon sequencing. A possible effect
27 // composition always merges bounds. It yields a possible effect if at least
28 // one was only possible.
30 enum Modality { POSSIBLE, DEFINITE };
40 return Effect(Bounds::Unbounded(zone), POSSIBLE);
57 e1.modality == POSSIBLE ? POSSIBLE : e2.modality);
152 effect.modality = Effect::POSSIBLE;
  /external/clang/test/SemaTemplate/
resolve-single-template-id.cpp 8 void two() { } // expected-note 4{{possible target for call}}
9 void two(int) { } // expected-note 4{{possible target for call}}
11 template<class T> void twoT() { } // expected-note 5{{possible target for call}}
12 template<class T> void twoT(int) { } // expected-note 5{{possible target for call}}
85 template<typename> void f(); // expected-note{{possible target for call}}
  /external/skia/tests/
SwizzlerTest.cpp 24 // Calculate the total size of the image in bytes. Use the smallest possible size.
28 // still allocating the smallest possible size.
82 // Test on the smallest possible height and representative heights
109 // Test all possible start rows with all possible end rows
  /frameworks/av/media/libeffects/lvm/lib/SpectrumAnalyzer/src/
LVPSA_Private.h 54 #define LVPSA_MAXCENTERFREQ 20000 /* Maximum possible center frequency */
55 #define LVPSA_MINPOSTGAIN -15 /* Minimum possible post gain */
56 #define LVPSA_MAXPOSTGAIN 15 /* Maximum possible post gain */
57 #define LVPSA_MINQFACTOR 25 /* Minimum possible Q factor */
58 #define LVPSA_MAXQFACTOR 1200 /* Maximum possible Q factor */
  /packages/apps/DeskClock/src/com/android/deskclock/widget/sgv/
GridAdapter.java 39 * For a view at the specified position, return the region around the view that is a possible
49 * Possible return values are a combination of
59 * @return int The allowed direction for drag to reorder. Possible return values are a
144 * @param scrap The old view to reuse, if possible. Note: You should check
146 * using. If it is not possible to convert this view to display
  /external/deqp/doc/testspecs/GLES31/
functional.compute.basic.txt 47 + This excludes all but a couple of possible variants of
56 The objective of basic compute tests is to provide a simplest possible test
58 test all possible variants, such as data types. Separate targeted test sets
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/html/
components.html 50 The warning icon means that some warnings occur for some results. The current possible warning are:
68 displayed masking lower possible icons.
73 There are several possible filters in this view:
  /external/fio/
parse.h 25 * Match a possible value string with the integer option.
44 const char *alias; /* possible old allowed name */
63 struct value_pair posval[PARSE_MAX_VP];/* possible values */
  /external/ipsec-tools/src/racoon/missing/crypto/rijndael/
rijndael-api-fst.h 31 /* Error Codes - CHANGE POSSIBLE: inclusion of additional error codes */
42 /* CHANGE POSSIBLE: inclusion of algorithm specific defines */
70 u_int8_t IV[MAX_IV_SIZE]; /* A possible Initialization Vector for ciphering */
  /external/libxml2/include/libxml/
relaxng.h 63 * List of possible Relax NG validation errors
111 * List of possible Relax NG Parser flags
192 * Interfaces for progressive validation when possible
  /frameworks/base/core/java/android/os/
TransactionTooLargeException.java 33 * There are two possible outcomes when a remote procedure call throws
38 * in the transaction buffer). It is not possible to tell which of these outcomes
45 * If possible, try to break up big requests into smaller pieces.

Completed in 253 milliseconds

<<11121314151617181920>>