7 if (!
CS_CSC (U) || !x)
return (0) ;
8 n = U->n ; Up = U->p ; Ui = U->i ; Ux = U->x ;
9 for (j = n-1 ; j >= 0 ; j--)
11 x [j] /= Ux [Up [j+1]-1] ;
12 for (p = Up [j] ; p < Up [j+1]-1 ; p++)
14 x [Ui [p]] -= Ux [p] * x [j] ;
CS_INT cs_usolve(const cs *U, CS_ENTRY *x)