HomeSort by relevance Sort by last modified time
    Searched defs:tri (Results 1 - 11 of 11) sorted by null

  /external/eigen/doc/snippets/
Tridiagonalization_compute.cpp 1 Tridiagonalization<MatrixXf> tri; variable
4 tri.compute(A);
6 cout << tri.matrixT() << endl;
7 tri.compute(2*A); // re-use tri to compute eigenvalues of 2A
9 cout << tri.matrixT() << endl;
  /external/webkit/Source/WebCore/platform/graphics/gpu/
LoopBlinnLocalTriangulator.cpp 120 Triangle* tri = getTriangle(i); local
121 if (tri->contains(v)) {
122 Vertex* next = tri->nextVertex(v, sideToFill == LoopBlinnConstants::RightSide);
268 Triangle* tri = getTriangle(i);
269 if (tri->contains(v0) && tri->nextVertex(v0, true) == v1)
271 if (tri->contains(v1) && tri->nextVertex(v1, true) == v0)
  /external/llvm/lib/CodeGen/
CalcSpillWeights.cpp 60 const TargetRegisterInfo &tri,
86 return tri.getMatchingSuperReg(hreg, sub, rc);
112 const TargetRegisterInfo &tri = *MF.getTarget().getRegisterInfo(); local
162 unsigned hint = copyHint(mi, li.reg, tri, mri);
Spiller.cpp 59 const TargetRegisterInfo *tri; member in class:__anon11493::SpillerBase
69 tri = mf.getTarget().getRegisterInfo();
137 tri);
150 true, ss, trc, tri);
RegAllocPBQP.cpp 130 const TargetRegisterInfo *tri; member in class:__anon11464::RegAllocPBQP
196 const TargetRegisterInfo *tri = mf->getTarget().getRegisterInfo(); local
203 for (unsigned Reg = 1, e = tri->getNumRegs(); Reg != e; ++Reg) {
236 for (MCRegUnitIterator Units(preg, tri); Units.isValid(); ++Units) {
280 addInterferenceCosts(g.getEdgeCosts(edge), vr1Allowed, vr2Allowed, tri);
297 const TargetRegisterInfo *tri) {
307 if (tri->regsOverlap(preg1, preg2)) {
487 DEBUG(dbgs() << "VREG " << PrintReg(vreg, tri) << " -> "
488 << tri->getName(preg) << "\n");
497 DEBUG(dbgs() << "VREG " << PrintReg(vreg, tri) << " -> SPILLED (Cost:
    [all...]
  /external/jmonkeyengine/engine/src/core/com/jme3/util/
TempVars.java 176 public final Vector3f[] tri = {new Vector3f(), field in class:TempVars
  /external/jmonkeyengine/engine/src/core/com/jme3/collision/
SweepSphere.java 109 private boolean isPointInTriangle(Vector3f point, AbstractTriangle tri) {
110 if (pointsOnSameSide(point, tri.get1(), tri.get2(), tri.get3())
111 && pointsOnSameSide(point, tri.get2(), tri.get1(), tri.get3())
112 && pointsOnSameSide(point, tri.get3(), tri.get1(), tri.get2())
419 AbstractTriangle tri = (AbstractTriangle) other; local
    [all...]
  /external/jmonkeyengine/engine/src/core/com/jme3/math/
Ray.java 390 AbstractTriangle tri = (AbstractTriangle) other; local
391 float d = intersects(tri.get1(), tri.get2(), tri.get3());
  /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/
LODGeomap.java 942 Triangle tri = getTriangleAtPoint(x, z); local
    [all...]
  /external/webkit/Source/WebCore/platform/android/
RenderThemeAndroid.cpp 645 Path tri = Path(); local
646 tri.clear();
649 tri.moveTo(br);
650 tri.addLineTo(FloatPoint(br.x() - aw, br.y()));
651 tri.addLineTo(FloatPoint(br.x(), br.y() - aw));
652 context->fillPath(tri);
  /system/core/libpixelflinger/
trap.cpp 99 float tri = 1.0f / TRI_ONE; local
103 v0[0]*tri, v0[1]*tri, v0[0], v0[1],
104 v1[0]*tri, v1[1]*tri, v1[0], v1[1],
105 v2[0]*tri, v2[1]*tri, v2[0], v2[1] );
835 float tri = 1.0f / TRI_ONE; local
844 y_top, y_top*tri,
845 y_bot, y_bot*tri );
    [all...]

Completed in 458 milliseconds