Searched defs:coin (Results 1 - 17 of 17) sorted by relevance

/external/clang/test/Analysis/
H A Doperator-calls.cpp81 void test(int coin) { argument
84 clang_analyzer_eval(+(coin ? getSmallOpaque() : getSmallOpaque())); // expected-warning{{UNKNOWN}}
85 clang_analyzer_eval(+(coin ? getLargeOpaque() : getLargeOpaque())); // expected-warning{{UNKNOWN}}
/external/skia/tests/
H A DPathOpsConicIntersectionTest.cpp299 bool coin) {
316 if (coin && intersections.used() != 2) {
319 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2);
298 oneOff(skiatest::Reporter* reporter, const ConicPts& conic1, const ConicPts& conic2, bool coin) argument
H A DPathOpsCubicIntersectionTest.cpp389 bool coin) {
414 if (coin && intersections.used() < 2) {
417 REPORTER_ASSERT(reporter, !coin || intersections.used() >= 2);
388 oneOff(skiatest::Reporter* reporter, const CubicPts& cubic1, const CubicPts& cubic2, bool coin) argument
H A DPathOpsDebug.cpp251 const SkOpAngle* SkPathOpsDebug::DebugCoincidenceAngle(SkOpCoincidence* coin, int id) { argument
252 return coin->debugAngle(id);
255 SkOpContour* SkPathOpsDebug::DebugCoincidenceContour(SkOpCoincidence* coin, int id) { argument
256 return coin->debugContour(id);
259 const SkOpPtT* SkPathOpsDebug::DebugCoincidencePtT(SkOpCoincidence* coin, int id) { argument
260 return coin->debugPtT(id);
263 const SkOpSegment* SkPathOpsDebug::DebugCoincidenceSegment(SkOpCoincidence* coin, int id) { argument
264 return coin->debugSegment(id);
267 const SkOpSpanBase* SkPathOpsDebug::DebugCoincidenceSpan(SkOpCoincidence* coin, int id) { argument
268 return coin
1069 const SkOpSpanBase* coin = this->coinEnd(); local
1105 SkOpSpan* coin = fCoincident; local
[all...]
/external/skqp/tests/
H A DPathOpsConicIntersectionTest.cpp299 bool coin) {
316 if (coin && intersections.used() != 2) {
319 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2);
298 oneOff(skiatest::Reporter* reporter, const ConicPts& conic1, const ConicPts& conic2, bool coin) argument
H A DPathOpsCubicIntersectionTest.cpp388 bool coin) {
413 if (coin && intersections.used() < 2) {
416 REPORTER_ASSERT(reporter, !coin || intersections.used() >= 2);
387 oneOff(skiatest::Reporter* reporter, const CubicPts& cubic1, const CubicPts& cubic2, bool coin) argument
H A DPathOpsDebug.cpp251 const SkOpAngle* SkPathOpsDebug::DebugCoincidenceAngle(SkOpCoincidence* coin, int id) { argument
252 return coin->debugAngle(id);
255 SkOpContour* SkPathOpsDebug::DebugCoincidenceContour(SkOpCoincidence* coin, int id) { argument
256 return coin->debugContour(id);
259 const SkOpPtT* SkPathOpsDebug::DebugCoincidencePtT(SkOpCoincidence* coin, int id) { argument
260 return coin->debugPtT(id);
263 const SkOpSegment* SkPathOpsDebug::DebugCoincidenceSegment(SkOpCoincidence* coin, int id) { argument
264 return coin->debugSegment(id);
267 const SkOpSpanBase* SkPathOpsDebug::DebugCoincidenceSpan(SkOpCoincidence* coin, int id) { argument
268 return coin
1069 const SkOpSpanBase* coin = this->coinEnd(); local
1105 SkOpSpan* coin = fCoincident; local
[all...]
/external/skia/src/pathops/
H A DSkOpSpan.h201 bool containsCoinEnd(const SkOpSpanBase* coin) const {
202 SkASSERT(this != coin);
205 if (next == coin) {
277 void insertCoinEnd(SkOpSpanBase* coin) { argument
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) cons
464 insertCoincidence(SkOpSpan* coin) argument
[all...]
H A DSkOpCoincidence.cpp429 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
922 contains(const SkCoincidentSpans* coin, const SkOpSegment* seg, const SkOpSegment* opp, double oppT) const argument
985 SkCoincidentSpans* coin = fHead; local
997 SkCoincidentSpans* coin = fHead; local
1126 release(SkCoincidentSpans* coin, SkCoincidentSpans* remove) argument
1147 releaseDeleted(SkCoincidentSpans* coin) argument
1202 SkCoincidentSpans* coin = fHead; local
1273 fixUp(SkCoincidentSpans* coin, SkOpPtT* deleted, const SkOpPtT* kept) argument
1311 SkCoincidentSpans* coin = fHead; local
1354 markCollapsed(SkCoincidentSpans* coin, SkOpPtT* test) argument
1409 SkCoincidentSpans* coin = fHead; local
[all...]
H A DSkPathOpsTSect.h1225 // FIXME: incomplete : if we're not at the end, find end of coin
1655 SkTCoincident<TCurve, OppCurve> coin; local
1656 coin.setPerp(fCurve, midT, midPt, sect2->fCurve);
1657 if (coin.isMatch()) {
H A DSkPathOpsDebug.cpp25 #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, argument
138 glitch->fCoinSpan = coin->coinPtTStart();
139 glitch->fEndSpan = coin->coinPtTEnd();
163 void record(GlitchType type, const SkCoincidentSpans* coin, argument
166 glitch->fCoinSpan = coin->coinPtTStart();
167 glitch->fEndSpan = coin->coinPtTEnd();
173 void record(GlitchType type, const SkCoincidentSpans* coin, argument
177 glitch->fCoinSpan = coin
219 record(GlitchType type, const SkCoincidentSpans* coin, const SkOpPtT* ptT) argument
1632 const SkCoincidentSpans* coin = this->fHead; local
1974 debugRelease(SkPathOpsDebug::GlitchLog* log, const SkCoincidentSpans* coin, const SkCoincidentSpans* remove) const argument
1996 const SkCoincidentSpans* coin = fHead; local
2013 const SkCoincidentSpans* coin = fHead; local
2041 const SkCoincidentSpans* coin = fHead; local
2088 debugMarkCollapsed(SkPathOpsDebug::GlitchLog* log, const SkCoincidentSpans* coin, const SkOpPtT* test) const argument
2267 const SkCoincidentSpans* coin = head; local
2307 const SkCoincidentSpans* coin = fHead; local
[all...]
/external/skqp/src/pathops/
H A DSkOpSpan.h201 bool containsCoinEnd(const SkOpSpanBase* coin) const {
202 SkASSERT(this != coin);
205 if (next == coin) {
277 void insertCoinEnd(SkOpSpanBase* coin) { argument
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) cons
464 insertCoincidence(SkOpSpan* coin) argument
[all...]
H A DSkOpCoincidence.cpp429 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
922 contains(const SkCoincidentSpans* coin, const SkOpSegment* seg, const SkOpSegment* opp, double oppT) const argument
985 SkCoincidentSpans* coin = fHead; local
997 SkCoincidentSpans* coin = fHead; local
1126 release(SkCoincidentSpans* coin, SkCoincidentSpans* remove) argument
1147 releaseDeleted(SkCoincidentSpans* coin) argument
1202 SkCoincidentSpans* coin = fHead; local
1273 fixUp(SkCoincidentSpans* coin, SkOpPtT* deleted, const SkOpPtT* kept) argument
1311 SkCoincidentSpans* coin = fHead; local
1354 markCollapsed(SkCoincidentSpans* coin, SkOpPtT* test) argument
1409 SkCoincidentSpans* coin = fHead; local
[all...]
H A DSkPathOpsTSect.h1225 // FIXME: incomplete : if we're not at the end, find end of coin
1655 SkTCoincident<TCurve, OppCurve> coin; local
1656 coin.setPerp(fCurve, midT, midPt, sect2->fCurve);
1657 if (coin.isMatch()) {
H A DSkPathOpsDebug.cpp25 #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, argument
138 glitch->fCoinSpan = coin->coinPtTStart();
139 glitch->fEndSpan = coin->coinPtTEnd();
163 void record(GlitchType type, const SkCoincidentSpans* coin, argument
166 glitch->fCoinSpan = coin->coinPtTStart();
167 glitch->fEndSpan = coin->coinPtTEnd();
173 void record(GlitchType type, const SkCoincidentSpans* coin, argument
177 glitch->fCoinSpan = coin
219 record(GlitchType type, const SkCoincidentSpans* coin, const SkOpPtT* ptT) argument
1632 const SkCoincidentSpans* coin = this->fHead; local
1974 debugRelease(SkPathOpsDebug::GlitchLog* log, const SkCoincidentSpans* coin, const SkCoincidentSpans* remove) const argument
1996 const SkCoincidentSpans* coin = fHead; local
2013 const SkCoincidentSpans* coin = fHead; local
2041 const SkCoincidentSpans* coin = fHead; local
2088 debugMarkCollapsed(SkPathOpsDebug::GlitchLog* log, const SkCoincidentSpans* coin, const SkOpPtT* test) const argument
2267 const SkCoincidentSpans* coin = head; local
2307 const SkCoincidentSpans* coin = fHead; local
[all...]
/external/replicaisland/src/com/replica/replicaisland/
H A DHudSystem.java198 public void setCollectableDrawables(DrawableBitmap coin, DrawableBitmap ruby) { argument
199 mCoinDrawable = coin;
/external/zopfli/src/zopflipng/lodepng/
H A Dlodepng.cpp646 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)
653 float weight; /*the sum of all weights in this coin*/
761 /*Package-Merge algorithm represented by coin collector's problem
799 /*merge prev_row[i] and prev_row[i + 1] into new coin*/
800 Coin* coin = &coins[numcoins++]; local
801 coin_copy(coin, &prev_row[i]);
802 add_coins(coin, &prev_row[i + 1]);
816 /*calculate the lenghts of each symbol, as the amount of times a coin o
819 Coin* coin = &coins[i]; local
[all...]

Completed in 425 milliseconds