Searched refs:rx (Results 251 - 275 of 346) sorted by relevance

<<11121314

/external/wpa_supplicant_8/wpa_supplicant/src/pae/
H A Dieee802_1x_kay_i.h63 Boolean rx; member in struct:key_conf
/external/bluetooth/bluedroid/stack/l2cap/
H A Dl2c_api.c1049 ** Description Sets the tx/rx data rate for a channel.
1054 BOOLEAN L2CA_SetChnlDataRate (UINT16 cid, tL2CAP_CHNL_DATA_RATE tx, tL2CAP_CHNL_DATA_RATE rx) argument
1058 L2CAP_TRACE_API ("L2CA_SetChnlDataRate() CID: 0x%04x, tx:%d, rx:%d", cid, tx, rx);
1068 p_ccb->rx_data_rate = rx;
/external/chromium_org/third_party/skia/bench/
H A DPathBench.cpp654 SkScalar rx = SkMinScalar(rect.width(), xIn); local
658 arcRect.set(-rx, -ry, rx, ry);
/external/chromium_org/third_party/skia/src/gpu/
H A DGrAARectRenderer.cpp770 const SkScalar rx = SkScalarMul(dx, SK_ScalarHalf); local
789 devOutside.outset(rx, ry);
805 devInside.inset(rx, ry);
/external/skia/bench/
H A DPathBench.cpp654 SkScalar rx = SkMinScalar(rect.width(), xIn); local
658 arcRect.set(-rx, -ry, rx, ry);
/external/skia/src/gpu/
H A DGrAARectRenderer.cpp743 const SkScalar rx = SkScalarMul(dx, SK_ScalarHalf); local
762 devOutside.outset(rx, ry);
777 devInside.inset(rx, ry);
/external/chromium_org/third_party/WebKit/Source/platform/transforms/
H A DTransformationMatrix.cpp419 // easier to recompose with) or Euler angles (rx, ry, rz), which
846 TransformationMatrix& TransformationMatrix::rotate3d(double rx, double ry, double rz) argument
849 rx = deg2rad(rx);
891 sinTheta = std::sin(rx);
892 cosTheta = std::cos(rx);
H A DTransformationMatrix.h217 TransformationMatrix& rotate3d(double rx, double ry, double rz);
/external/chromium_org/third_party/angle/src/libGLESv2/
H A DContext.cpp40 Context::Context(int clientVersion, const gl::Context *shareContext, rx::Renderer *renderer, bool notifyResets, bool robustAccess)
194 rx::SwapChain *swapchain = surface->getSwapChain();
1716 const rx::RangeUI &indexRange)
1734 rx::TranslatedIndexData indexInfo;
2293 gl::Context *glCreateContext(int clientVersion, const gl::Context *shareContext, rx::Renderer *renderer, bool notifyResets, bool robustAccess)
H A DProgram.cpp139 Program::Program(rx::Renderer *renderer, ResourceManager *manager, GLuint handle) : mResourceManager(manager), mHandle(handle)
/external/wpa_supplicant_8/wpa_supplicant/
H A Devents.c3192 struct rx_mgmt *rx = &data->rx_mgmt; local
3193 size_t hex_len = 2 * rx->frame_len + 1;
3197 rx->frame, rx->frame_len);
3199 rx->freq, rx->datarate, rx->ssi_signal,
/external/chromium_org/third_party/skia/src/pathops/
H A DSkOpAngle.cpp221 bool SkOpAngle::calcSlop(double x, double y, double rx, double ry, bool* result) const {
237 double rx_y1 = rx * y1;
242 double rx_y2 = rx * y2;
146 SkASSERT(trOrder < 0); SkDEBUGCODE(bool lrOpposite = lh.oppositePlanes(rh)); bool ltOpposite = lh.oppositePlanes(*this); SkASSERT(lrOpposite != ltOpposite); return COMPARE_RESULT(8, ltOpposite); } else if (ltOrder == 1 && trOrder == 0) { SkASSERT(lrOrder < 0); SkDEBUGCODE(bool ltOpposite = lh.oppositePlanes(*this)); bool trOpposite = oppositePlanes(rh); SkASSERT(ltOpposite != trOpposite); return COMPARE_RESULT(9, trOpposite); } else if (lrOrder == 1 && trOrder == 1) { SkASSERT(ltOrder < 0); SkDEBUGCODE(bool trOpposite = oppositePlanes(rh)); bool lrOpposite = lh.oppositePlanes(rh); SkASSERT(lrOpposite != trOpposite); return COMPARE_RESULT(10, lrOpposite); } if (lrOrder < 0) { if (ltOrder < 0) { return COMPARE_RESULT(11, trOrder); } return COMPARE_RESULT(12, ltOrder); } return COMPARE_RESULT(13, !lrOrder); } int SkOpAngle::allOnOneSide(const SkOpAngle& test) const { SkASSERT(!fIsCurve); SkASSERT(test.fIsCurve); const SkDPoint& origin = test.fCurvePart[0]; SkVector line; if (fSegment->verb() == SkPath::kLine_Verb) { const SkPoint* linePts = fSegment->pts(); int lineStart = fStart < fEnd ? 0 : 1; line = linePts[lineStart ^ 1] - linePts[lineStart]; } else { SkPoint shortPts[2] = { fCurvePart[0].asSkPoint(), fCurvePart[1].asSkPoint() }; line = shortPts[1] - shortPts[0]; } float crosses[3]; SkPath::Verb testVerb = test.fSegment->verb(); int iMax = SkPathOpsVerbToPoints(testVerb); const SkDCubic& testCurve = test.fCurvePart; for (int index = 1; index <= iMax; ++index) { float xy1 = (float) (line.fX * (testCurve[index].fY - origin.fY)); float xy2 = (float) (line.fY * (testCurve[index].fX - origin.fX)); crosses[index - 1] = AlmostEqualUlps(xy1, xy2) ? 0 : xy1 - xy2; } if (crosses[0] * crosses[1] < 0) { return -1; } if (SkPath::kCubic_Verb == testVerb) { if (crosses[0] * crosses[2] < 0 || crosses[1] * crosses[2] < 0) { return -1; } } if (crosses[0]) { return crosses[0] < 0; } if (crosses[1]) { return crosses[1] < 0; } if (SkPath::kCubic_Verb == testVerb && crosses[2]) { return crosses[2] < 0; } fUnorderable = true; return -1; } bool SkOpAngle::calcSlop(double x, double y, double rx, double ry, bool* result) const { double absX = fabs(x); double absY = fabs(y); double length = absX < absY ? absX / 2 + absY : absX + absY / 2; int exponent; (void) frexp(length, &exponent); double epsilon = ldexp(FLT_EPSILON, exponent); SkPath::Verb verb = fSegment->verb(); SkASSERT(verb == SkPath::kQuad_Verb || verb == SkPath::kCubic_Verb); double slop = verb == SkPath::kQuad_Verb ? 4 * epsilon : 512 * epsilon; double xSlop = slop; double ySlop = x * y < 0 ? -xSlop : xSlop; double x1 = x - xSlop; double y1 = y + ySlop; double x_ry1 = x1 * ry; double rx_y1 = rx * y1; *result = x_ry1 < rx_y1; double x2 = x + xSlop; double y2 = y - ySlop; double x_ry2 = x2 * ry; double rx_y2 = rx * y2; bool less2 = x_ry2 < rx_y2; return *result == less2; } bool SkOpAngle::checkCrossesZero() const { int start = SkTMin(fSectorStart, fSectorEnd); int end = SkTMax(fSectorStart, fSectorEnd); bool crossesZero = end - start > 16; return crossesZero; } bool SkOpAngle::checkParallel(const SkOpAngle& rh) const { SkDVector scratch[2]; const SkDVector* sweep, * tweep; if (!fUnorderedSweep) { sweep = fSweep; } else { scratch[0] = fCurvePart[1] - fCurvePart[0]; sweep = &scratch[0]; } if (!rh.fUnorderedSweep) { tweep = rh.fSweep; } else { scratch[1] = rh.fCurvePart[1] - rh.fCurvePart[0]; tweep = &scratch[1]; } double s0xt0 = sweep->crossCheck(*tweep); if (tangentsDiverge(rh, s0xt0)) { return s0xt0 < 0; } SkDVector m0 = fSegment->dPtAtT(midT()) - fCurvePart[0]; SkDVector m1 = rh.fSegment->dPtAtT(rh.midT()) - rh.fCurvePart[0]; double m0xm1 = m0.crossCheck(m1); if (m0xm1 == 0) { fUnorderable = true; rh.fUnorderable = true; return true; } return m0xm1 < 0; } bool SkOpAngle::computeSector() { if (fComputedSector) { return !fUnorderable; } fComputedSector = true; int step = fStart < fEnd ? 1 : -1; int limit = step > 0 ? fSegment->count() : -1; int checkEnd = fEnd; do { const SkOpSpan& span = fSegment->span(checkEnd); const SkOpSegment* other = span.fOther; int oCount = other->count(); for (int oIndex = 0; oIndex < oCount; ++oIndex) { const SkOpSpan& oSpan = other->span(oIndex); if (oSpan.fOther != fSegment) { continue; } if (oSpan.fOtherIndex == checkEnd) { continue; } if (!approximately_equal(oSpan.fOtherT, span.fT)) { continue; } goto recomputeSector; } checkEnd += step; } while (checkEnd != limit); recomputeSector: if (checkEnd == fEnd || checkEnd - step == fEnd) { fUnorderable = true; return false; } int saveEnd = fEnd; fComputedEnd = fEnd = checkEnd - step; setSpans(); setSector(); fEnd = saveEnd; return !fUnorderable; } int SkOpAngle::convexHullOverlaps(const SkOpAngle& rh) const { const SkDVector* sweep = fSweep; const SkDVector* tweep = rh.fSweep; double s0xs1 = sweep[0].crossCheck(sweep[1]); double s0xt0 = sweep[0].crossCheck(tweep[0]); double s1xt0 = sweep[1].crossCheck(tweep[0]); bool tBetweenS = s0xs1 > 0 ? s0xt0 > 0 && s1xt0 < 0 : s0xt0 < 0 && s1xt0 > 0; double s0xt1 = sweep[0].crossCheck(tweep[1]); double s1xt1 = sweep[1].crossCheck(tweep[1]); tBetweenS |= s0xs1 > 0 ? s0xt1 > 0 && s1xt1 < 0 : s0xt1 < 0 && s1xt1 > 0; double t0xt1 = tweep[0].crossCheck(tweep[1]); if (tBetweenS) { return -1; } if ((s0xt0 == 0 && s1xt1 == 0) || (s1xt0 == 0 && s0xt1 == 0)) { return -1; } bool sBetweenT = t0xt1 > 0 ? s0xt0 < 0 && s0xt1 > 0 : s0xt0 > 0 && s0xt1 < 0; sBetweenT |= t0xt1 > 0 ? s1xt0 < 0 && s1xt1 > 0 : s1xt0 > 0 && s1xt1 < 0; if (sBetweenT) { return -1; } if (s0xt0 >= 0 && s0xt1 >= 0 && s1xt0 >= 0 && s1xt1 >= 0) argument
/external/chromium_org/third_party/skia/tests/
H A DClipStackTest.cpp810 SkScalar rx = rect.width() / 10;
814 path.addRoundRect(rect, rx, ry);
819 rrect.setRectXY(rect, rx, ry);
/external/deqp/modules/gles31/functional/
H A Des31fStencilTexturingTests.cpp99 const int rx = rects[rectNdx].x(); local
104 const float x0 = float(rx*2)/w - 1.0f;
105 const float x1 = float((rx+rw)*2)/w - 1.0f;
/external/skia/src/pathops/
H A DSkOpAngle.cpp221 bool SkOpAngle::calcSlop(double x, double y, double rx, double ry, bool* result) const {
237 double rx_y1 = rx * y1;
242 double rx_y2 = rx * y2;
146 SkASSERT(trOrder < 0); SkDEBUGCODE(bool lrOpposite = lh.oppositePlanes(rh)); bool ltOpposite = lh.oppositePlanes(*this); SkASSERT(lrOpposite != ltOpposite); return COMPARE_RESULT(8, ltOpposite); } else if (ltOrder == 1 && trOrder == 0) { SkASSERT(lrOrder < 0); SkDEBUGCODE(bool ltOpposite = lh.oppositePlanes(*this)); bool trOpposite = oppositePlanes(rh); SkASSERT(ltOpposite != trOpposite); return COMPARE_RESULT(9, trOpposite); } else if (lrOrder == 1 && trOrder == 1) { SkASSERT(ltOrder < 0); SkDEBUGCODE(bool trOpposite = oppositePlanes(rh)); bool lrOpposite = lh.oppositePlanes(rh); SkASSERT(lrOpposite != trOpposite); return COMPARE_RESULT(10, lrOpposite); } if (lrOrder < 0) { if (ltOrder < 0) { return COMPARE_RESULT(11, trOrder); } return COMPARE_RESULT(12, ltOrder); } return COMPARE_RESULT(13, !lrOrder); } int SkOpAngle::allOnOneSide(const SkOpAngle& test) const { SkASSERT(!fIsCurve); SkASSERT(test.fIsCurve); const SkDPoint& origin = test.fCurvePart[0]; SkVector line; if (fSegment->verb() == SkPath::kLine_Verb) { const SkPoint* linePts = fSegment->pts(); int lineStart = fStart < fEnd ? 0 : 1; line = linePts[lineStart ^ 1] - linePts[lineStart]; } else { SkPoint shortPts[2] = { fCurvePart[0].asSkPoint(), fCurvePart[1].asSkPoint() }; line = shortPts[1] - shortPts[0]; } float crosses[3]; SkPath::Verb testVerb = test.fSegment->verb(); int iMax = SkPathOpsVerbToPoints(testVerb); const SkDCubic& testCurve = test.fCurvePart; for (int index = 1; index <= iMax; ++index) { float xy1 = (float) (line.fX * (testCurve[index].fY - origin.fY)); float xy2 = (float) (line.fY * (testCurve[index].fX - origin.fX)); crosses[index - 1] = AlmostEqualUlps(xy1, xy2) ? 0 : xy1 - xy2; } if (crosses[0] * crosses[1] < 0) { return -1; } if (SkPath::kCubic_Verb == testVerb) { if (crosses[0] * crosses[2] < 0 || crosses[1] * crosses[2] < 0) { return -1; } } if (crosses[0]) { return crosses[0] < 0; } if (crosses[1]) { return crosses[1] < 0; } if (SkPath::kCubic_Verb == testVerb && crosses[2]) { return crosses[2] < 0; } fUnorderable = true; return -1; } bool SkOpAngle::calcSlop(double x, double y, double rx, double ry, bool* result) const { double absX = fabs(x); double absY = fabs(y); double length = absX < absY ? absX / 2 + absY : absX + absY / 2; int exponent; (void) frexp(length, &exponent); double epsilon = ldexp(FLT_EPSILON, exponent); SkPath::Verb verb = fSegment->verb(); SkASSERT(verb == SkPath::kQuad_Verb || verb == SkPath::kCubic_Verb); double slop = verb == SkPath::kQuad_Verb ? 4 * epsilon : 512 * epsilon; double xSlop = slop; double ySlop = x * y < 0 ? -xSlop : xSlop; double x1 = x - xSlop; double y1 = y + ySlop; double x_ry1 = x1 * ry; double rx_y1 = rx * y1; *result = x_ry1 < rx_y1; double x2 = x + xSlop; double y2 = y - ySlop; double x_ry2 = x2 * ry; double rx_y2 = rx * y2; bool less2 = x_ry2 < rx_y2; return *result == less2; } bool SkOpAngle::checkCrossesZero() const { int start = SkTMin(fSectorStart, fSectorEnd); int end = SkTMax(fSectorStart, fSectorEnd); bool crossesZero = end - start > 16; return crossesZero; } bool SkOpAngle::checkParallel(const SkOpAngle& rh) const { SkDVector scratch[2]; const SkDVector* sweep, * tweep; if (!fUnorderedSweep) { sweep = fSweep; } else { scratch[0] = fCurvePart[1] - fCurvePart[0]; sweep = &scratch[0]; } if (!rh.fUnorderedSweep) { tweep = rh.fSweep; } else { scratch[1] = rh.fCurvePart[1] - rh.fCurvePart[0]; tweep = &scratch[1]; } double s0xt0 = sweep->crossCheck(*tweep); if (tangentsDiverge(rh, s0xt0)) { return s0xt0 < 0; } SkDVector m0 = fSegment->dPtAtT(midT()) - fCurvePart[0]; SkDVector m1 = rh.fSegment->dPtAtT(rh.midT()) - rh.fCurvePart[0]; double m0xm1 = m0.crossCheck(m1); if (m0xm1 == 0) { fUnorderable = true; rh.fUnorderable = true; return true; } return m0xm1 < 0; } bool SkOpAngle::computeSector() { if (fComputedSector) { return !fUnorderable; } SkASSERT(fSegment->verb() != SkPath::kLine_Verb && small()); fComputedSector = true; int step = fStart < fEnd ? 1 : -1; int limit = step > 0 ? fSegment->count() : -1; int checkEnd = fEnd; do { const SkOpSpan& span = fSegment->span(checkEnd); const SkOpSegment* other = span.fOther; int oCount = other->count(); for (int oIndex = 0; oIndex < oCount; ++oIndex) { const SkOpSpan& oSpan = other->span(oIndex); if (oSpan.fOther != fSegment) { continue; } if (oSpan.fOtherIndex == checkEnd) { continue; } if (!approximately_equal(oSpan.fOtherT, span.fT)) { continue; } goto recomputeSector; } checkEnd += step; } while (checkEnd != limit); recomputeSector: if (checkEnd == fEnd || checkEnd - step == fEnd) { fUnorderable = true; return false; } int saveEnd = fEnd; fComputedEnd = fEnd = checkEnd - step; setSpans(); setSector(); fEnd = saveEnd; return !fUnorderable; } int SkOpAngle::convexHullOverlaps(const SkOpAngle& rh) const { const SkDVector* sweep = fSweep; const SkDVector* tweep = rh.fSweep; double s0xs1 = sweep[0].crossCheck(sweep[1]); double s0xt0 = sweep[0].crossCheck(tweep[0]); double s1xt0 = sweep[1].crossCheck(tweep[0]); bool tBetweenS = s0xs1 > 0 ? s0xt0 > 0 && s1xt0 < 0 : s0xt0 < 0 && s1xt0 > 0; double s0xt1 = sweep[0].crossCheck(tweep[1]); double s1xt1 = sweep[1].crossCheck(tweep[1]); tBetweenS |= s0xs1 > 0 ? s0xt1 > 0 && s1xt1 < 0 : s0xt1 < 0 && s1xt1 > 0; double t0xt1 = tweep[0].crossCheck(tweep[1]); if (tBetweenS) { return -1; } if ((s0xt0 == 0 && s1xt1 == 0) || (s1xt0 == 0 && s0xt1 == 0)) { return -1; } bool sBetweenT = t0xt1 > 0 ? s0xt0 < 0 && s0xt1 > 0 : s0xt0 > 0 && s0xt1 < 0; sBetweenT |= t0xt1 > 0 ? s1xt0 < 0 && s1xt1 > 0 : s1xt0 > 0 && s1xt1 < 0; if (sBetweenT) { return -1; } if (s0xt0 >= 0 && s0xt1 >= 0 && s1xt0 >= 0 && s1xt1 >= 0) argument
/external/skia/tests/
H A DClipStackTest.cpp810 SkScalar rx = rect.width() / 10;
814 path.addRoundRect(rect, rx, ry);
819 rrect.setRectXY(rect, rx, ry);
/external/bluetooth/bluedroid/stack/include/
H A Dl2c_api.h682 ** Description Sets the tx/rx data rate for a channel.
687 L2C_API extern BOOLEAN L2CA_SetChnlDataRate (UINT16 cid, tL2CAP_CHNL_DATA_RATE tx, tL2CAP_CHNL_DATA_RATE rx);
/external/chromium_org/third_party/angle/src/common/
H A Dmathutil.h503 namespace rx
/external/chromium_org/third_party/angle/src/libEGL/
H A DDisplay.cpp92 rx::ConfigDesc *descList;
/external/chromium_org/third_party/angle/src/libGLESv2/renderer/d3d/d3d11/
H A DTextureStorage11.h7 // TextureStorage11.h: Defines the abstract rx::TextureStorage11 class and its concrete derived
23 namespace rx namespace
/external/chromium_org/third_party/angle/src/libGLESv2/renderer/
H A Dloadimage.h16 namespace rx namespace
/external/chromium_org/third_party/skia/include/core/
H A DSkPath.h662 * @param rx The x-radius of the rounded corners on the round-rectangle
667 void addRoundRect(const SkRect& rect, SkScalar rx, SkScalar ry,
/external/skia/include/core/
H A DSkPath.h661 * @param rx The x-radius of the rounded corners on the round-rectangle
666 void addRoundRect(const SkRect& rect, SkScalar rx, SkScalar ry,
/external/valgrind/main/coregrind/m_debuginfo/
H A Dpriv_storage.h479 or rx mapping for one binary.
502 Bool rx, rw, ro; /* memory access flags for this mapping */ member in struct:_DebugInfoMapping
591 either (size of all rx maps == 0 && cfsi == NULL) (the degenerate case)
594 (0) size of at least one rx mapping > 0
595 (1) no two DebugInfos with some rx mapping of size > 0
596 have overlapping rx mappings
598 [avma,+size) of one rx mapping; that is, the former
601 [avma,+size) of that rx mapping.
856 /* Cached last rx mapping matched and returned by ML_(find_rx_mapping).
933 /* Helper function for the most often needed searching for an rx
[all...]
/external/chromium_org/ppapi/examples/ime/
H A Dime.cc193 int rx = font_.MeasureSimpleText(str.substr(0, r)); local
196 rx - lx - 4, 2,

Completed in 957 milliseconds

<<11121314