Functions | |
FLA_Error | FLA_Apply_Q_UT (FLA_Side side, FLA_Trans trans, FLA_Store storev, FLA_Obj A, FLA_Obj T, FLA_Obj W, FLA_Obj B) |
void FLA_F2C() | fla_apply_q_ut_f (F_INT *side, F_INT *trans, F_INT *storev, F_INT *A, F_INT *T, F_INT *W, F_INT *B, F_INT *IERROR) |
Variables | |
fla_apqut_t * | fla_apqut_cntl_leaf |
fla_apqut_t * | fla_apqut_cntl |
FLA_Error FLA_Apply_Q_UT | ( | FLA_Side | side, | |
FLA_Trans | trans, | |||
FLA_Store | storev, | |||
FLA_Obj | A, | |||
FLA_Obj | T, | |||
FLA_Obj | W, | |||
FLA_Obj | B | |||
) |
References FLA_Apply_Q_UT_check(), FLA_Apply_Q_UT_internal(), FLA_Blocksize_set(), FLA_Check_error_level(), and FLA_Obj_length().
Referenced by fla_apply_q_ut_f().
00039 { 00040 FLA_Error r_val; 00041 int nb_alg_in; 00042 00043 // Check parameters. 00044 if ( FLA_Check_error_level() >= FLA_MIN_ERROR_CHECKING ) 00045 FLA_Apply_Q_UT_check( side, trans, storev, A, T, W, B ); 00046 00047 // Compute the algorithmic blocksize. 00048 //nb_alg_in = max( FLA_Obj_width( T ) * FLA_QR_INNER_TO_OUTER_B_RATIO, 1 ); 00049 nb_alg_in = FLA_Obj_length( T ); 00050 00051 // Adjust the blocksize of the leaf control tree node. 00052 FLA_Blocksize_set( FLA_Cntl_blocksize( fla_apqut_cntl_leaf ), 00053 nb_alg_in, nb_alg_in, nb_alg_in, nb_alg_in ); 00054 00055 // Invoke FLA_Apply_Q_UT_internal() with the standard control tree. 00056 r_val = FLA_Apply_Q_UT_internal( side, trans, storev, A, T, W, B, fla_apqut_cntl_leaf ); 00057 00058 return r_val; 00059 }
void FLA_F2C() fla_apply_q_ut_f | ( | F_INT * | side, | |
F_INT * | trans, | |||
F_INT * | storev, | |||
F_INT * | A, | |||
F_INT * | T, | |||
F_INT * | W, | |||
F_INT * | B, | |||
F_INT * | IERROR | |||
) |
References FLA_Apply_Q_UT().
00063 { 00064 *IERROR = FLA_Apply_Q_UT( *( ( FLA_Side * ) side ), 00065 *( ( FLA_Trans * ) trans ), 00066 *( ( FLA_Store * ) storev ), 00067 *( ( FLA_Obj * ) A ), 00068 *( ( FLA_Obj * ) T ), 00069 *( ( FLA_Obj * ) W ), 00070 *( ( FLA_Obj * ) B ) ) ; 00071 }