| /external/swiftshader/third_party/subzero/src/ |
| IceConditionCodesARM32.h | 32 #define X(tag, encode, opp, emit) tag = encode,
|
| IceConditionCodesMIPS32.h | 32 #define X(tag, opp, emit) tag,
|
| IceConditionCodesX8632.h | 32 #define X(val, encode, opp, dump, emit) val = encode,
|
| IceConditionCodesX8664.h | 28 #define X(val, encode, opp, dump, emit) val = encode,
|
| /packages/apps/Bluetooth/src/com/android/bluetooth/opp/ |
| BluetoothOppObexSession.java | 33 package com.android.bluetooth.opp;
|
| BluetoothOppTransferInfo.java | 33 package com.android.bluetooth.opp;
|
| BluetoothOppBtErrorActivity.java | 33 package com.android.bluetooth.opp;
|
| BluetoothOppShareInfo.java | 33 package com.android.bluetooth.opp;
|
| BluetoothShare.java | 33 package com.android.bluetooth.opp;
56 public static final Uri CONTENT_URI = Uri.parse("content://com.android.bluetooth.opp/btopp");
|
| BluetoothOppBtEnableActivity.java | 33 package com.android.bluetooth.opp;
|
| BluetoothOppFileProvider.java | 16 package com.android.bluetooth.opp;
|
| BluetoothOppBatch.java | 33 package com.android.bluetooth.opp;
46 * This class stores information about a batch of OPP shares that should be
|
| BluetoothOppBtEnablingActivity.java | 33 package com.android.bluetooth.opp;
|
| BluetoothOppHandoverReceiver.java | 17 package com.android.bluetooth.opp;
|
| /external/skia/src/pathops/ |
| SkOpSpan.h | 34 void addOpp(SkOpPtT* opp, SkOpPtT* oppPrev) {
36 SkASSERT(this != opp);
37 this->fNext = opp;
54 void debugAddOpp(const SkOpPtT* opp, const SkOpPtT* oppPrev) const;
63 const SkOpPtT* debugOppPrev(const SkOpPtT* opp) const;
103 // returns nullptr if this is already in the opp ptT loop
104 SkOpPtT* oppPrev(const SkOpPtT* opp) const {
105 // find the fOpp ptr to opp
106 SkOpPtT* oppPrev = opp->fNext;
110 while (oppPrev->fNext != opp) {
[all...] |
| SkPathOpsTSect.h | 124 SkTSpan<OppCurve, TCurve>* findOppSpan(const SkTSpan<OppCurve, TCurve>* opp) const;
158 bool onlyEndPointsInCommon(const SkTSpan<OppCurve, TCurve>* opp, bool* start,
166 bool removeBounded(const SkTSpan<OppCurve, TCurve>* opp);
196 int hullCheck(const SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart);
299 int intersects(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp,
301 bool isParallel(const SkDLine& thisLine, const SkTSect<OppCurve, TCurve>* opp) const;
302 int linesIntersect(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp,
310 void removeByPerpendicular(SkTSect<OppCurve, TCurve>* opp);
314 SkTSect<OppCurve, TCurve>* opp);
317 void removeSpans(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp);
426 SkTSpan<TCurve, OppCurve>* opp = this->spanAtT(t, &priorSpan); local
632 double opp = fPart[end].fY - origY; local
710 SkTSpan<OppCurve, TCurve>* opp = bounded->fBounded; local
920 const OppCurve& opp = sect2->fCurve; local
1087 const OppCurve& opp = sect2->fCurve; local
[all...] |
| SkPathOpsQuad.cpp | 51 double opp = endPt[1]->fY - origY; local
52 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp;
59 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp;
90 oddMan opp x=oddMan^opp x=x-oddMan m=x>>2 x&~m
99 for (int opp = 1; opp < kPointCount; ++opp) {
100 int end = (oddMan ^ opp) - oddMan; // choose a value not equal to oddMan
102 endPt[opp - 1] = &fPts[end]
[all...] |
| SkOpSpan.cpp | 153 void SkOpSpanBase::addOpp(SkOpSpanBase* opp) {
154 SkOpPtT* oppPrev = this->ptT()->oppPrev(opp->ptT());
158 this->mergeMatches(opp);
159 this->ptT()->addOpp(opp->ptT(), oppPrev);
304 void SkOpSpanBase::mergeMatches(SkOpSpanBase* opp) {
319 SkOpPtT* inner = opp->ptT();
|
| SkPathOpsCurve.cpp | 13 double SkDCurve::nearPoint(SkPath::Verb verb, const SkDPoint& xy, const SkDPoint& opp) const {
34 SkDLine perp = {{ xy, { xy.fX + opp.fY - xy.fY, xy.fY + xy.fX - opp.fX }}};
|
| SkOpSegment.cpp | 191 const SkOpPtT* SkOpSegment::existing(double t, const SkOpSegment* opp) const {
206 if (!opp) {
219 return opp && !test->contains(opp) ? nullptr : testPtT;
516 The Opp variable name part designates that the value is for the Opposite operator.
809 bool SkOpSegment::isClose(double t, const SkOpSegment* opp) const {
814 (*CurveIntersectRay[opp->verb()])(opp->pts(), opp->weight(), perp, &i);
1090 SkOpSegment* opp = ptT->segment(); local
1120 SkOpSegment* opp = ptT->span()->segment(); local
[all...] |
| SkOpSegment.h | 78 SkOpPtT* addMissing(double t, SkOpSegment* opp, bool* allExist);
186 double distSq(double t, const SkOpAngle* opp) const;
213 const SkOpPtT* existing(double t, const SkOpSegment* opp) const;
248 bool isClose(double t, const SkOpSegment* opp) const;
396 const SkOpSpanBase* spanBase, const SkOpSegment* opp) const;
|
| SkOpCoincidence.h | 237 static bool Ordered(const SkOpSegment* coin, const SkOpSegment* opp);
264 bool contains(const SkOpSegment* seg, const SkOpSegment* opp, double oppT) const;
266 const SkOpSegment* opp, double oppT) const;
|
| SkPathOpsDebug.cpp | 136 const SkCoincidentSpans* opp = NULL) {
140 if (opp) {
141 glitch->fOppSpan = opp->coinPtTStart();
142 glitch->fOppEndSpan = opp->coinPtTEnd();
844 const SkOpSegment* opp = ptT->segment(); local
845 opp->resetDebugVisited();
876 const SkOpSegment* opp = ptT->span()->segment(); local
877 if (opp->done()) {
880 // when opp is encounted the 1st time, continue; on 2nd encounter, look for coincidence
881 if (!opp->debugVisited())
1350 int opp = 0; local
[all...] |
| /external/skia/tests/ |
| PathOpsTSectDebug.h | 64 void SkTSect<TCurve, OppCurve>::dumpBoth(SkTSect<OppCurve, TCurve>* opp) const {
71 opp->dump();
78 if (opp->fHead) {
79 opp->dumpCurves();
|
| /device/linaro/bootloader/OpenPlatformPkg/Platforms/Hisilicon/HiKey/DeviceTree/ |
| hi6220.dtsi | 188 opp-shared;
191 opp-hz = /bits/ 64 <208000000>;
192 opp-microvolt = <1040000>;
196 opp-hz = /bits/ 64 <432000000>;
197 opp-microvolt = <1040000>;
201 opp-hz = /bits/ 64 <729000000>;
202 opp-microvolt = <1090000>;
206 opp-hz = /bits/ 64 <960000000>;
207 opp-microvolt = <1180000>;
211 opp-hz = /bits/ 64 <1200000000>
[all...] |
