/external/eigen/doc/snippets/ |
H A D | 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/ |
H A D | RegisterCoalescer.h | 60 CoalescerPair(const TargetRegisterInfo &tri) argument 61 : TRI(tri), DstReg(0), SrcReg(0), DstIdx(0), SrcIdx(0), 67 const TargetRegisterInfo &tri) 68 : TRI(tri), DstReg(PhysReg), SrcReg(VirtReg), DstIdx(0), SrcIdx(0), 66 CoalescerPair(unsigned VirtReg, unsigned PhysReg, const TargetRegisterInfo &tri) argument
|
H A D | CalcSpillWeights.cpp | 45 const TargetRegisterInfo &tri, 71 return tri.getMatchingSuperReg(hreg, sub, rc); 98 const TargetRegisterInfo &tri = *MF.getSubtarget().getRegisterInfo(); local 151 unsigned hint = copyHint(mi, li.reg, tri, mri); 44 copyHint(const MachineInstr *mi, unsigned reg, const TargetRegisterInfo &tri, const MachineRegisterInfo &mri) argument
|
/external/mesa3d/src/gallium/drivers/llvmpipe/ |
H A D | lp_rast_tri_tmp.h | 44 const struct lp_rast_triangle *tri, 61 lp_rast_shade_quads_mask(task, &tri->inputs, x, y, mask); 70 const struct lp_rast_triangle *tri, 130 TAG(do_block_4)(task, tri, plane, px, py, cx); 145 block_full_4(task, tri, px, py); 158 const struct lp_rast_triangle *tri = arg.triangle.tri; local 160 const struct lp_rast_plane *tri_plane = GET_PLANES(tri); 167 if (tri->inputs.disable) { 232 TAG(do_block_16)(task, tri, plan 43 do_block_4(struct lp_rasterizer_task *task, const struct lp_rast_triangle *tri, const struct lp_rast_plane *plane, int x, int y, const int *c) argument 69 do_block_16(struct lp_rasterizer_task *task, const struct lp_rast_triangle *tri, const struct lp_rast_plane *plane, int x, int y, const int *c) argument 260 const struct lp_rast_triangle *tri = arg.triangle.tri; local 333 const struct lp_rast_triangle *tri = arg.triangle.tri; local [all...] |
H A D | lp_rast.h | 127 #define GET_PLANES(tri) ((struct lp_rast_plane *)((char *)(&(tri)->inputs + 1) + 3 * (tri)->inputs.stride)) 151 const struct lp_rast_triangle *tri; member in struct:lp_rast_cmd_arg::__anon12061 181 arg.triangle.tri = triangle; 197 arg.triangle.tri = triangle;
|
H A D | lp_setup_tri.c | 89 struct lp_rast_triangle *tri; local 95 tri = lp_scene_alloc_aligned( scene, *tri_size, 16 ); 96 if (tri == NULL) 99 tri->inputs.stride = input_array_sz; 102 char *a = (char *)tri; 103 char *b = (char *)&GET_PLANES(tri)[nr_planes]; 107 return tri; 244 struct lp_rast_triangle *tri; local 301 tri = lp_setup_alloc_triangle(scene, 305 if (!tri) 559 lp_setup_bin_triangle( struct lp_setup_context *setup, struct lp_rast_triangle *tri, const struct u_rect *bbox, int nr_planes ) argument [all...] |
H A D | lp_rast_tri.c | 47 const struct lp_rast_triangle *tri, 50 lp_rast_shade_quads_all(task, &tri->inputs, x, y); 59 const struct lp_rast_triangle *tri, 67 block_full_4(task, tri, x + ix, y + iy); 120 arg2.triangle.tri = arg.triangle.tri; 130 arg2.triangle.tri = arg.triangle.tri; 255 const struct lp_rast_triangle *tri = arg.triangle.tri; local 46 block_full_4(struct lp_rasterizer_task *task, const struct lp_rast_triangle *tri, int x, int y) argument 58 block_full_16(struct lp_rasterizer_task *task, const struct lp_rast_triangle *tri, int x, int y) argument 369 const struct lp_rast_triangle *tri = arg.triangle.tri; local [all...] |
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_wide_line.c | 65 struct prim_header tri; local 139 tri.det = header->det; /* only the sign matters */ 140 tri.v[0] = v0; 141 tri.v[1] = v2; 142 tri.v[2] = v3; 143 stage->next->tri( stage->next, &tri ); 145 tri.v[0] = v0; 146 tri.v[1] = v3; 147 tri [all...] |
H A D | draw_pipe_wide_point.c | 129 struct prim_header tri; local 179 tri.det = header->det; /* only the sign matters */ 180 tri.v[0] = v0; 181 tri.v[1] = v2; 182 tri.v[2] = v3; 183 stage->next->tri( stage->next, &tri ); 185 tri.v[0] = v0; 186 tri.v[1] = v3; 187 tri [all...] |
H A D | draw_pipe_cull.c | 84 stage->next->tri( stage->next, header ); 98 stage->tri = cull_tri; 99 stage->tri( stage, header ); 105 stage->tri = cull_first_tri; 137 cull->stage.tri = cull_first_tri;
|
H A D | draw_pipe_twoside.c | 74 /* Twoside tri: 93 stage->next->tri( stage->next, &tmp ); 96 stage->next->tri( stage->next, header ); 137 stage->tri = twoside_tri; 138 stage->tri( stage, header ); 144 stage->tri = twoside_first_tri; 176 twoside->stage.tri = twoside_first_tri;
|
H A D | draw_pipe_aaline.c | 560 struct prim_header tri; local 651 tri.v[0] = v[2]; tri.v[1] = v[1]; tri.v[2] = v[0]; 652 stage->next->tri( stage->next, &tri ); 654 tri.v[0] = v[3]; tri.v[1] = v[1]; tri.v[2] = v[2]; 655 stage->next->tri( stag [all...] |
H A D | draw_pipe_offset.c | 61 * Offset tri Z. Some hardware can handle this, but not usually when 106 stage->next->tri( stage->next, header ); 135 stage->tri = offset_tri; 136 stage->tri( stage, header ); 145 stage->tri = offset_first_tri; 177 offset->stage.tri = offset_first_tri;
|
H A D | draw_pipe_unfilled.c | 125 /* Unfilled tri: 145 stage->next->tri( stage->next, header ); 168 stage->tri = unfilled_tri; 169 stage->tri( stage, header ); 179 stage->tri = unfilled_first_tri; 211 unfilled->stage.tri = unfilled_first_tri;
|
H A D | draw_pipe_flatshade.c | 109 * Flatshade tri. Required for clipping and when unfilled tris are 126 stage->next->tri( stage->next, &tmp ); 144 stage->next->tri( stage->next, &tmp ); 206 stage->tri = flatshade_tri_0; 210 stage->tri = flatshade_tri_2; 218 stage->tri( stage, header ); 232 stage->tri = flatshade_first_tri; 265 flatshade->stage.tri = flatshade_first_tri;
|
/external/toybox/kconfig/ |
H A D | symbol.c | 126 prop->visible.tri = expr_calc_value(prop->visible.expr); 127 if (prop->visible.tri != no) 138 prop->visible.tri = expr_calc_value(prop->visible.expr); 139 if (prop->visible.tri != no) 197 tristate tri; local 200 tri = no; 202 prop->visible.tri = expr_calc_value(prop->visible.expr); 203 tri = E_OR(tri, prop->visible.tri); [all...] |
H A D | lkc_proto.h | 27 P(sym_tristate_within_range,bool,(struct symbol *sym,tristate tri)); 28 P(sym_set_tristate_value,bool,(struct symbol *sym,tristate tri));
|
/external/jmonkeyengine/engine/src/core/com/jme3/collision/ |
H A D | SweepSphere.java | 109 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/ksoap2/kobjects/org/ksoap2/kobjects/base64/ |
H A D | Base64.java | 142 int tri = 148 os.write((tri >> 16) & 255); 151 os.write((tri >> 8) & 255); 154 os.write(tri & 255);
|
/external/mesa3d/src/gallium/tests/trivial/ |
H A D | Makefile | 20 tri.c \
|
/external/eigen/Eigen/src/Core/products/ |
H A D | 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(); \
|
/external/skia/gm/ |
H A D | convexpolyeffect.cpp | 99 SkPath tri; variable 100 tri.moveTo(5.f, 5.f); 101 tri.lineTo(100.f, 20.f); 102 tri.lineTo(15.f, 100.f); 104 fPaths.addToTail(tri); 105 fPaths.addToTail(SkPath())->reverseAddPath(tri); variable 107 tri.close(); 108 fPaths.addToTail(tri);
|
H A D | multipicturedraw.cpp | 144 SkPath tri; local 145 tri.moveTo(originX, originY); 146 tri.rLineTo(SkScalarHalf(kTriSide), 1.5f * kTriSide / kRoot3); 147 tri.rLineTo(-kTriSide, 0); 148 tri.close(); 149 return tri; 153 SkPath tri = make_tri_path(SkScalarHalf(kTriSide), 0); local 170 SkRect r = tri.getBounds(); 175 canvas->drawPath(tri, fill); 176 canvas->drawPath(tri, strok 182 make_sub_picture(const SkPicture* tri) argument [all...] |
/external/eigen/test/ |
H A D | product_trmm.cpp | 24 TriMatrix mat(rows,cols), tri(rows,cols), triTr(cols,rows); 35 tri = mat.template triangularView<Mode>(); 40 VERIFY_IS_APPROX( ge_xs = mat.template triangularView<Mode>() * ge_right, tri * ge_right); 41 VERIFY_IS_APPROX( ge_sx = ge_left * mat.template triangularView<Mode>(), ge_left * tri); 43 VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right); 44 VERIFY_IS_APPROX( ge_sx.noalias() = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
|
/external/deqp/modules/gles2/functional/ |
H A D | es2fRasterizationTests.cpp | 1330 TriangleSceneSpec::SceneTriangle tri; 1331 tri.positions[0] = v0; tri.sharedEdge[0] = false; 1332 tri.positions[1] = v1; tri.sharedEdge[1] = false; 1333 tri.positions[2] = v2; tri.sharedEdge[2] = false; 1335 outTriangles.push_back(tri); 1351 TriangleSceneSpec::SceneTriangle tri; 1352 tri [all...] |