/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/llvm/lib/CodeGen/ |
RegisterCoalescer.h | 29 const TargetRegisterInfo &TRI; 62 CoalescerPair(const TargetRegisterInfo &tri) 63 : TRI(tri), DstReg(0), SrcReg(0), DstIdx(0), SrcIdx(0), 69 const TargetRegisterInfo &tri) 70 : TRI(tri), DstReg(PhysReg), SrcReg(VirtReg), DstIdx(0), SrcIdx(0),
|
Spiller.cpp | 59 const TargetRegisterInfo *tri; member in class:__anon11495::SpillerBase 69 tri = mf.getTarget().getRegisterInfo(); 137 tri); 150 true, ss, trc, tri);
|
RegAllocPBQP.cpp | 130 const TargetRegisterInfo *tri; member in class:__anon11466::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...] |
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);
|
BranchFolding.h | 30 const TargetRegisterInfo *tri, 91 const TargetRegisterInfo *TRI;
|
InterferenceCache.cpp | 29 const TargetRegisterInfo *tri) { 32 TRI = tri; 33 PhysRegEntries.assign(TRI->getNumRegs(), 0); 41 if (!Entries[E].valid(LIUArray, TRI)) 42 Entries[E].revalidate(LIUArray, TRI); 56 Entries[E].reset(PhysReg, LIUArray, TRI, MF); 65 const TargetRegisterInfo *TRI) { 71 for (MCRegUnitIterator Units(PhysReg, TRI); Units.isValid(); ++Units, ++i) 77 const TargetRegisterInfo *TRI, [all...] |
LiveRangeEdit.cpp | 146 const TargetRegisterInfo &tri, 149 TII.reMaterialize(MBB, MI, DestReg, 0, RM.OrigMI, tri);
|
/external/llvm/lib/Target/ARM/ |
ARMHazardRecognizer.h | 32 const ARMBaseRegisterInfo &TRI; 41 const ARMBaseRegisterInfo &tri, 45 TRI(tri), STI(sti), LastMI(0) {}
|
/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/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/eigen/Eigen/src/Core/products/ |
TriangularSolverMatrix_MKL.h | 72 Map<const MatrixTri, 0, OuterStride<> > tri(_tri,size,size,OuterStride<>(triStride)); \ 76 a_tmp = tri.conjugate(); \ 127 Map<const MatrixTri, 0, OuterStride<> > tri(_tri,size,size,OuterStride<>(triStride)); \ 131 a_tmp = tri.conjugate(); \
|
TriangularSolverMatrix.h | 23 const Scalar* tri, Index triStride, 32 ::run(size, cols, tri, triStride, _other, otherStride, blocking); 48 const_blas_data_mapper<Scalar, Index, TriStorageOrder> tri(_tri,triStride); 114 Scalar a = (Mode & UnitDiag) ? Scalar(1) : Scalar(1)/conj(tri(i,i)); 120 const Scalar* l = &tri(i,s); 132 const Scalar* l = &tri(s,i); 151 pack_lhs(blockA, &tri(startTarget,startBlock), triStride, actualPanelWidth, lengthTarget); 168 pack_lhs(blockA, &tri(i2, IsLower ? k2 : k2-kc), triStride, actual_kc, actual_mc);
|
/external/eigen/test/ |
product_trmm.cpp | 26 TriMatrix mat(rows,cols), tri(rows,cols), triTr(cols,rows); 37 tri = mat.template triangularView<Mode>(); 42 VERIFY_IS_APPROX( ge_xs = mat.template triangularView<Mode>() * ge_right, tri * ge_right); 43 VERIFY_IS_APPROX( ge_sx = ge_left * mat.template triangularView<Mode>(), ge_left * tri); 45 VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right); 46 VERIFY_IS_APPROX( ge_sx.noalias() = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
|
/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/llvm/include/llvm/Target/ |
TargetRegisterInfo.h | 404 /// The mask is an array containing (TRI::getNumRegs()+31)/32 entries. [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/util/ |
TempVars.java | 176 public final Vector3f[] tri = {new Vector3f(),
field in class:TempVars
|
/external/llvm/include/llvm/CodeGen/ |
RegAllocPBQP.h | 138 const TargetRegisterInfo *tri);
|
/external/jmonkeyengine/engine/src/core/com/jme3/scene/ |
BatchNode.java | 477 for (int tri = 0; tri < geomTriCount; tri++) { 479 int idx = inIdx.get(tri * components + comp) + globalVertIndex; 480 outIdx.put((globalTriIndex + tri) * components + comp, idx);
|
Mesh.java | 785 * @param tri The triangle to store the positions in 787 public void getTriangle(int index, Triangle tri){ 788 getTriangle(index, tri.get1(), tri.get2(), tri.get3()); 789 tri.setIndex(index); 790 tri.setNormal(null); [all...] |
/external/jmonkeyengine/engine/src/tools/jme3tools/optimize/ |
GeometryBatchFactory.java | 198 for (int tri = 0; tri < geomTriCount; tri++) { 200 int idx = inIdx.get(tri * components + comp) + globalVertIndex; 201 outIdx.put((globalTriIndex + tri) * components + comp, idx);
|
/external/eigen/Eigen/src/Core/ |
SolveTriangular.h | 237 triangular_solve_retval(const TriangularType& tri, const Rhs& rhs) 238 : m_triangularMatrix(tri), m_rhs(rhs)
|
/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...] |
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/ |
LODGeomap.java | 942 Triangle tri = getTriangleAtPoint(x, z); local [all...] |