Searched refs:tri (Results 1 - 25 of 29) sorted by relevance

12

/external/eigen/doc/snippets/
H A DTridiagonalization_compute.cpp1 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/
H A DRegisterCoalescer.h62 CoalescerPair(const TargetRegisterInfo &tri) argument
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),
68 CoalescerPair(unsigned VirtReg, unsigned PhysReg, const TargetRegisterInfo &tri) argument
H A DSpiller.cpp59 const TargetRegisterInfo *tri; member in class:__anon9327::SpillerBase
69 tri = mf.getTarget().getRegisterInfo();
137 tri);
150 true, ss, trc, tri);
H A DRegAllocPBQP.cpp131 const TargetRegisterInfo *tri; member in class:__anon9301::RegAllocPBQP
197 const TargetRegisterInfo *tri = mf->getTarget().getRegisterInfo(); local
204 for (unsigned Reg = 1, e = tri->getNumRegs(); Reg != e; ++Reg) {
211 BitVector reservedRegs = tri->getReservedRegs(*mf);
221 BitVector regMaskOverlaps(tri->getNumRegs());
239 for (MCRegUnitIterator Units(preg, tri); Units.isValid(); ++Units) {
283 addInterferenceCosts(g.getEdgeCosts(edge), vr1Allowed, vr2Allowed, tri);
300 const TargetRegisterInfo *tri) {
310 if (tri->regsOverlap(preg1, preg2)) {
488 DEBUG(dbgs() << "VREG " << PrintReg(vreg, tri) << "
296 addInterferenceCosts( PBQP::Matrix &costMat, const PBQPRAProblem::AllowedSet &vr1Allowed, const PBQPRAProblem::AllowedSet &vr2Allowed, const TargetRegisterInfo *tri) argument
[all...]
H A DCalcSpillWeights.cpp60 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);
59 copyHint(const MachineInstr *mi, unsigned reg, const TargetRegisterInfo &tri, const MachineRegisterInfo &mri) argument
H A DBranchFolding.h30 const TargetRegisterInfo *tri,
H A DInterferenceCache.cpp29 const TargetRegisterInfo *tri) {
32 TRI = tri;
25 init(MachineFunction *mf, LiveIntervalUnion *liuarray, SlotIndexes *indexes, LiveIntervals *lis, const TargetRegisterInfo *tri) argument
H A DLiveRangeEdit.cpp139 const TargetRegisterInfo &tri,
142 TII.reMaterialize(MBB, MI, DestReg, 0, RM.OrigMI, tri);
135 rematerializeAt(MachineBasicBlock &MBB, MachineBasicBlock::iterator MI, unsigned DestReg, const Remat &RM, const TargetRegisterInfo &tri, bool Late) argument
H A DRegisterCoalescer.cpp196 static unsigned compose(const TargetRegisterInfo &tri, unsigned a, unsigned b) { argument
199 return tri.composeSubRegIndices(a, b);
202 static bool isMoveInstr(const TargetRegisterInfo &tri, const MachineInstr *MI, argument
212 DstSub = compose(tri, MI->getOperand(0).getSubReg(),
1168 const TargetRegisterInfo &tri,
1167 RegistersDefinedFromSameValue(LiveIntervals &li, const TargetRegisterInfo &tri, CoalescerPair &CP, VNInfo *VNI, VNInfo *OtherVNI, SmallVector<MachineInstr*, 8> &DupCopies) argument
/external/llvm/lib/Target/ARM/
H A DARMHazardRecognizer.h41 const ARMBaseRegisterInfo &tri,
45 TRI(tri), STI(sti), LastMI(0) {}
39 ARMHazardRecognizer(const InstrItineraryData *ItinData, const ARMBaseInstrInfo &tii, const ARMBaseRegisterInfo &tri, const ARMSubtarget &sti, const ScheduleDAG *DAG) argument
/external/jmonkeyengine/engine/src/core/com/jme3/collision/
H A DSweepSphere.java109 private boolean isPointInTriangle(Vector3f point, AbstractTriangle tri) { argument
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
198 collideWithTriangle(AbstractTriangle tri) argument
[all...]
/external/webkit/Source/WebCore/platform/graphics/gpu/
H A DLoopBlinnLocalTriangulator.cpp120 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/
H A DTriangularSolverMatrix_MKL.h72 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(); \
H A DTriangularSolverMatrix.h23 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);
21 run( Index size, Index cols, const Scalar* tri, Index triStride, Scalar* _other, Index otherStride, level3_blocking<Scalar,Scalar>& blocking) argument
/external/eigen/test/
H A Dproduct_trmm.cpp26 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/
H A DRay.java390 AbstractTriangle tri = (AbstractTriangle) other;
391 float d = intersects(tri.get1(), tri.get2(), tri.get3());
/external/jmonkeyengine/engine/src/core/com/jme3/util/
H A DTempVars.java176 public final Vector3f[] tri = {new Vector3f(), field in class:TempVars
/external/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h138 const TargetRegisterInfo *tri);
/external/llvm/include/llvm/Target/
H A DTargetRegisterInfo.h851 PrintReg(unsigned reg, const TargetRegisterInfo *tri = 0, unsigned subidx = 0)
852 : TRI(tri), Reg(reg), SubIdx(subidx) {}
874 PrintRegUnit(unsigned unit, const TargetRegisterInfo *tri) argument
875 : TRI(tri), Unit(unit) {}
/external/jmonkeyengine/engine/src/core/com/jme3/scene/
H A DBatchNode.java477 for (int tri = 0; tri < geomTriCount; tri++) {
479 int idx = inIdx.get(tri * components + comp) + globalVertIndex;
480 outIdx.put((globalTriIndex + tri) * components + comp, idx);
H A DMesh.java785 * @param tri The triangle to store the positions in
787 public void getTriangle(int index, Triangle tri){ argument
788 getTriangle(index, tri.get1(), tri.get2(), tri.get3());
789 tri.setIndex(index);
790 tri.setNormal(null);
/external/jmonkeyengine/engine/src/tools/jme3tools/optimize/
H A DGeometryBatchFactory.java198 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/
H A DSolveTriangular.h237 triangular_solve_retval(const TriangularType& tri, const Rhs& rhs) argument
238 : m_triangularMatrix(tri), m_rhs(rhs)
/external/webkit/Source/WebCore/platform/android/
H A DRenderThemeAndroid.cpp645 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);
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/
H A DLODGeomap.java942 Triangle tri = getTriangleAtPoint(x, z);
943 if (tri != null) {
944 tri.get1().multLocal(scale).addLocal(translation);
945 tri.get2().multLocal(scale).addLocal(translation);
946 tri.get3().multLocal(scale).addLocal(translation);
948 return tri;

Completed in 477 milliseconds

12