Home
last modified time | relevance | path

Searched refs:t2_p (Results 1 – 2 of 2) sorted by relevance

/dports/math/yices/yices-2.6.2/src/mcsat/nra/
H A Dpoly_constraint.c393 lp_polynomial_t* t2_p = lp_polynomial_from_term(db->nra, terms, t2, &t2_c); in poly_constraint_db_add() local
398 lp_polynomial_mul_integer(t2_p, t2_p, &t1_c); in poly_constraint_db_add()
401 lp_polynomial_add(cstr_polynomial, t1_p, t2_p); in poly_constraint_db_add()
406 lp_polynomial_delete(t2_p); in poly_constraint_db_add()
452 lp_polynomial_t* t2_p = lp_polynomial_from_term(db->nra, terms, constraint_var_term, &t2_c); in poly_constraint_db_add() local
456 lp_polynomial_mul_integer(t2_p, t2_p, &t1_c); in poly_constraint_db_add()
460 lp_polynomial_add(cstr_polynomial, t1_p, t2_p); in poly_constraint_db_add()
465 lp_polynomial_delete(t2_p); in poly_constraint_db_add()
/dports/graphics/embree/embree-3.13.2/kernels/subdiv/
H A Dcatmullclark_patch.h531 const Vertex t2_p = ring[i2].getLimitTangent(); in getLimitBorder() local
544 const Vertex b22 = madd(1.0/3.0f,t2_p,b33); in getLimitBorder()