/external/clang/test/Analysis/diagnostics/ |
shortest-path-suppression.c | 5 int coin();
|
/external/skia/src/pathops/ |
SkOpCoincidence.cpp | 429 SkCoincidentSpans* coin = this->fHead; local 430 if (!coin) { 434 const SkOpPtT* startPtT = coin->coinPtTStart(); 435 const SkOpPtT* oStartPtT = coin->oppPtTStart(); 439 SkOPASSERT(coin->coinPtTEnd()->contains(coin->oppPtTEnd())); 442 const SkOpSpanBase* end = coin->coinPtTEnd()->span(); 443 const SkOpSpanBase* oEnd = coin->oppPtTEnd()->span(); 447 FAIL_IF(!coin->flipped() && !oStart->upCastable()); 448 const SkOpSpanBase* oTest = coin->flipped() ? oStart->prev() : oStart->upCast()->next() 985 SkCoincidentSpans* coin = fHead; local 997 SkCoincidentSpans* coin = fHead; local 1202 SkCoincidentSpans* coin = fHead; local 1311 SkCoincidentSpans* coin = fHead; local 1409 SkCoincidentSpans* coin = fHead; local [all...] |
SkOpSpan.h | 201 bool containsCoinEnd(const SkOpSpanBase* coin) const { 202 SkASSERT(this != coin); 205 if (next == coin) { 277 void insertCoinEnd(SkOpSpanBase* coin) { 278 if (containsCoinEnd(coin)) { 279 SkASSERT(coin->containsCoinEnd(this)); 283 SkASSERT(this != coin); 284 SkOpSpanBase* coinNext = coin->fCoinEnd; 285 coin->fCoinEnd = this->fCoinEnd; 435 bool containsCoincidence(const SkOpSpan* coin) const [all...] |
SkPathOpsDebug.cpp | 25 #define FAIL_IF(cond, coin) \ 26 do { if (cond) log->record(SkPathOpsDebug::kFail_Glitch, coin); } while (false) 135 void record(GlitchType type, const SkCoincidentSpans* coin, 138 glitch->fCoinSpan = coin->coinPtTStart(); 139 glitch->fEndSpan = coin->coinPtTEnd(); 163 void record(GlitchType type, const SkCoincidentSpans* coin, 166 glitch->fCoinSpan = coin->coinPtTStart(); 167 glitch->fEndSpan = coin->coinPtTEnd(); 173 void record(GlitchType type, const SkCoincidentSpans* coin, 177 glitch->fCoinSpan = coin->coinPtTStart() 1632 const SkCoincidentSpans* coin = this->fHead; local 1996 const SkCoincidentSpans* coin = fHead; local 2013 const SkCoincidentSpans* coin = fHead; local 2041 const SkCoincidentSpans* coin = fHead; local 2267 const SkCoincidentSpans* coin = head; local 2307 const SkCoincidentSpans* coin = fHead; local [all...] |
SkOpCoincidence.h | 187 const SkCoincidentSpans* coin, const SkOpPtT* test) const; 237 static bool Ordered(const SkOpSegment* coin, const SkOpSegment* opp); 265 bool contains(const SkCoincidentSpans* coin, const SkOpSegment* seg, 281 void fixUp(SkCoincidentSpans* coin, SkOpPtT* deleted, const SkOpPtT* kept); 286 bool release(SkCoincidentSpans* coin, SkCoincidentSpans* );
|
SkPathOpsTSect.h | 1651 SkTCoincident<TCurve, OppCurve> coin; local [all...] |
/external/clang/test/Analysis/ |
operator-calls.cpp | 81 void test(int coin) { 84 clang_analyzer_eval(+(coin ? getSmallOpaque() : getSmallOpaque())); // expected-warning{{UNKNOWN}} 85 clang_analyzer_eval(+(coin ? getLargeOpaque() : getLargeOpaque())); // expected-warning{{UNKNOWN}}
|
unreachable-code-path.c | 152 extern int coin(); 153 int cond = coin();
|
reference.cpp | 197 extern bool coin(); 199 return coin() ? &x : 0;
|
new.cpp | 104 extern bool coin(); 105 if (coin())
|
temporaries.cpp | 118 extern bool coin(); 124 if (coin() && (coin() || coin() || check(Dtor()))) {
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/representer/ |
RepresentTest.java | 71 CustomBean coin = (CustomBean) data; local 72 String value = coin.getPrefix() + "d" + coin.getSuffix();
|
/external/clang/test/Analysis/inlining/ |
false-positive-suppression.cpp | 41 extern bool coin(); 55 if (coin()) { 92 if (coin()) {
|
false-positive-suppression.c | 6 int coin(); 51 if (coin()) { 67 if (coin()) { 197 if (coin())
|
/external/skia/tests/ |
PathOpsDebug.cpp | 251 const SkOpAngle* SkPathOpsDebug::DebugCoincidenceAngle(SkOpCoincidence* coin, int id) { 252 return coin->debugAngle(id); 255 SkOpContour* SkPathOpsDebug::DebugCoincidenceContour(SkOpCoincidence* coin, int id) { 256 return coin->debugContour(id); 259 const SkOpPtT* SkPathOpsDebug::DebugCoincidencePtT(SkOpCoincidence* coin, int id) { 260 return coin->debugPtT(id); 263 const SkOpSegment* SkPathOpsDebug::DebugCoincidenceSegment(SkOpCoincidence* coin, int id) { 264 return coin->debugSegment(id); 267 const SkOpSpanBase* SkPathOpsDebug::DebugCoincidenceSpan(SkOpCoincidence* coin, int id) { 268 return coin->debugSpan(id) 1069 const SkOpSpanBase* coin = this->coinEnd(); local 1105 SkOpSpan* coin = fCoincident; local [all...] |
PathOpsConicIntersectionTest.cpp | 299 bool coin) { 316 if (coin && intersections.used() != 2) { 319 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2);
|
PathOpsCubicIntersectionTest.cpp | 388 bool coin) { 413 if (coin && intersections.used() < 2) { 416 REPORTER_ASSERT(reporter, !coin || intersections.used() >= 2);
|
/external/replicaisland/src/com/replica/replicaisland/ |
HudSystem.java | 198 public void setCollectableDrawables(DrawableBitmap coin, DrawableBitmap ruby) { 199 mCoinDrawable = coin;
|
/prebuilts/go/darwin-x86/src/runtime/ |
hash_test.go | 447 // each is the sum of REP coin flips. We want to find bounds on the 448 // sum of coin flips such that a truly random experiment would have
|
/prebuilts/go/linux-x86/src/runtime/ |
hash_test.go | 447 // each is the sum of REP coin flips. We want to find bounds on the 448 // sum of coin flips such that a truly random experiment would have
|
/external/zopfli/src/zopflipng/lodepng/ |
lodepng.cpp | 646 A coin, this is the terminology used for the package-merge algorithm and the 647 coin collector's problem. This is used to generate the huffman tree. 648 A coin can be multiple coins (when they're merged) 650 typedef struct Coin 653 float weight; /*the sum of all weights in this coin*/ 654 } Coin; 656 static void coin_init(Coin* c) 664 uivector_cleanup(&((Coin*)c)->symbols); 667 static void coin_copy(Coin* c1, const Coin* c2 800 Coin* coin = &coins[numcoins++]; local 819 Coin* coin = &coins[i]; local [all...] |