| /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;
|
| 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;
|
| BluetoothOppPreference.java | 33 package com.android.bluetooth.opp;
|
| BluetoothOppRfcommListener.java | 33 package com.android.bluetooth.opp;
|
| BluetoothOppSendFileInfo.java | 33 package com.android.bluetooth.opp;
|
| BluetoothOppTransferAdapter.java | 33 package com.android.bluetooth.opp;
|
| Constants.java | 33 package com.android.bluetooth.opp;
47 * Bluetooth OPP internal constants definition
|
| /external/boringssl/src/crypto/asn1/ |
| asn1_par.c | 116 const unsigned char *p,*ep,*tot,*op,*opp; local
230 opp=op;
231 if (d2i_ASN1_OBJECT(&o,&opp,len+hl) != NULL)
246 opp=op;
247 ii=d2i_ASN1_BOOLEAN(NULL,&opp,len+hl);
263 opp=op;
264 os=d2i_ASN1_OCTET_STRING(NULL,&opp,len+hl);
267 opp = os->data;
272 if (( (opp[i] < ' ') &&
273 (opp[i] != '\n') &
[all...] |
| /external/skia/src/pathops/ |
| SkPathOpsQuad.cpp | 29 double opp = endPt[1]->fY - origY; local
30 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp;
37 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp;
60 oddMan opp x=oddMan^opp x=x-oddMan m=x>>2 x&~m
69 for (int opp = 1; opp < kPointCount; ++opp) {
70 int end = (oddMan ^ opp) - oddMan; // choose a value not equal to oddMan
72 endPt[opp - 1] = &fPts[end]
[all...] |
| SkPathOpsTSect.h | 115 SkTSpan<OppCurve, TCurve>* findOppSpan(const SkTSpan<OppCurve, TCurve>* opp) const;
147 bool onlyEndPointsInCommon(const SkTSpan<OppCurve, TCurve>* opp, bool* start,
155 bool removeBounded(const SkTSpan<OppCurve, TCurve>* opp);
185 int hullCheck(const SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart);
286 int intersects(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp,
288 bool isParallel(const SkDLine& thisLine, const SkTSect<OppCurve, TCurve>* opp) const;
289 int linesIntersect(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp,
297 void removeByPerpendicular(SkTSect<OppCurve, TCurve>* opp);
301 SkTSect<OppCurve, TCurve>* opp);
304 void removeSpans(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp);
403 SkTSpan<TCurve, OppCurve>* opp = this->spanAtT(t, &priorSpan); local
608 double opp = fPart[end].fY - origY; local
686 SkTSpan<OppCurve, TCurve>* opp = bounded->fBounded; local
884 const OppCurve& opp = sect2->fCurve; local
1034 const OppCurve& opp = sect2->fCurve; local
[all...] |
| SkOpSegment.h | 87 SkOpPtT* addMissing(double t, SkOpSegment* opp, SkChunkAlloc* );
143 bool debugAddMissing(double t, const SkOpSegment* opp) const;
177 double distSq(double t, const SkOpAngle* opp) const;
236 bool isClose(double t, const SkOpSegment* opp) const;
372 const SkOpSpanBase* spanBase, const SkOpSegment* opp, SkScalar flatnessLimit) const;
|
| SkOpSpan.h | 30 void addOpp(SkOpPtT* opp) {
31 // find the fOpp ptr to opp
32 SkOpPtT* oppPrev = opp->fNext;
36 while (oppPrev->fNext != opp) {
44 SkASSERT(this != opp);
45 this->fNext = opp;
514 int fOppValue; // normally 0 -- when binary coincident edges combine, opp value goes here
|
| SkOpSegment.cpp | 301 SkOpPtT* SkOpSegment::addMissing(double t, SkOpSegment* opp, SkChunkAlloc* allocator) {
314 if (existing && existing->contains(opp)) {
617 The Opp variable name part designates that the value is for the Opposite operator.
912 bool SkOpSegment::isClose(double t, const SkOpSegment* opp) const {
917 (*CurveIntersectRay[opp->verb()])(opp->pts(), opp->weight(), perp, &i);
1181 SkOpSegment* opp = ptT->segment(); local
1208 SkOpSegment* opp = ptT->span()->segment(); local
[all...] |
| SkDCubicLineIntersection.cpp | 122 double opp = fLine[1].fY - fLine[0].fY; local
125 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp;
134 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp
|
| SkPathOpsDebug.cpp | 494 bool SkOpSegment::debugAddMissing(double t, const SkOpSegment* opp) const {
506 return !existing || !existing->debugContains(opp);
627 SkOpSegment* opp = ptT->span()->segment(); local
628 // if (opp->verb() == SkPath::kLine_Verb) {
631 if (opp->done()) {
634 // when opp is encounted the 1st time, continue; on 2nd encounter, look for coincidence
635 if (!opp->visited()) {
644 if (span && span->segment() != opp && span->containsCoincidence(opp)) {
647 if (spanBase->segment() != opp && spanBase->containsCoinEnd(opp))
1053 int opp = 0; local
[all...] |
| SkDConicLineIntersection.cpp | 121 double opp = (*fLine)[1].fY - (*fLine)[0].fY; local
124 r[n] = (fConic[n].fY - (*fLine)[0].fY) * adj - (fConic[n].fX - (*fLine)[0].fX) * opp;
|
| SkDQuadLineIntersection.cpp | 155 double opp = (*fLine)[1].fY - (*fLine)[0].fY; local
158 r[n] = (fQuad[n].fY - (*fLine)[0].fY) * adj - (fQuad[n].fX - (*fLine)[0].fX) * opp;
|
| /external/skia/tests/ |
| PathOpsTSectDebug.h | 62 void SkTSect<TCurve, OppCurve>::dumpBoth(SkTSect<OppCurve, TCurve>* opp) const {
69 opp->dump();
76 if (opp->fHead) {
77 opp->dumpCurves();
|
