OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:coin
(Results
1 - 14
of
14
) sorted by null
/external/clang/test/Analysis/diagnostics/
shortest-path-suppression.c
5
int
coin
();
/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;
temporaries.cpp
118
extern bool
coin
();
123
if (
coin
() && (
coin
() ||
coin
() || check(Dtor()))) {
new.cpp
104
extern bool
coin
();
105
if (
coin
())
/external/clang/test/Analysis/inlining/
false-positive-suppression.c
6
int
coin
();
51
if (
coin
()) {
67
if (
coin
()) {
119
if (
coin
())
false-positive-suppression.cpp
41
extern bool
coin
();
55
if (
coin
()) {
92
if (
coin
()) {
/external/skia/tests/
PathOpsDebug.cpp
154
void SkOpContour::dumpCoincidence(const SkCoincidence&
coin
) const {
155
int thisIndex =
coin
.fSegments[0];
157
int otherIndex =
coin
.fSegments[1];
158
const SkOpSegment& s2 =
coin
.fOther->fSegments[otherIndex];
162
SkDebugf(" {%1.9gf, %1.9gf}",
coin
.fPts[0][index].fX,
coin
.fPts[0][index].fY);
163
if (
coin
.fNearly[index]) {
164
SkDebugf(" {%1.9gf, %1.9gf}",
coin
.fPts[1][index].fX,
coin
.fPts[1][index].fY);
166
SkDebugf(" seg1t=%1.9g seg2t=%1.9g\n",
coin
.fTs[0][index], coin.fTs[1][index])
[
all
...]
PathOpsCubicIntersectionTest.cpp
311
bool
coin
) {
345
REPORTER_ASSERT(reporter, !
coin
|| intersections.used() == 2);
/external/chromium_org/third_party/skia/tests/
PathOpsDebug.cpp
286
void SkOpContour::dumpCoincidence(const SkCoincidence&
coin
) const {
287
int thisIndex =
coin
.fSegments[0];
289
int otherIndex =
coin
.fSegments[1];
290
const SkOpSegment& s2 =
coin
.fOther->fSegments[otherIndex];
294
SkDebugf(" {%1.9gf, %1.9gf}",
coin
.fPts[0][index].fX,
coin
.fPts[0][index].fY);
295
if (
coin
.fNearly[index]) {
296
SkDebugf(" {%1.9gf, %1.9gf}",
coin
.fPts[1][index].fX,
coin
.fPts[1][index].fY);
298
SkDebugf(" seg1t=%1.9g seg2t=%1.9g\n",
coin
.fTs[0][index], coin.fTs[1][index])
[
all
...]
PathOpsCubicIntersectionTest.cpp
311
bool
coin
) {
345
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
;
/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
= &
coin
s[num
coin
s++];
local
819
Coin*
coin
= &
coin
s[i];
local
[
all
...]
Completed in 481 milliseconds