7 if (!
CS_CSC (L) || !x)
return (0) ;
8 n = L->n ; Lp = L->p ; Li = L->i ; Lx = L->x ;
9 for (j = 0 ; j < n ; j++)
11 x [j] /= Lx [Lp [j]] ;
12 for (p = Lp [j]+1 ; p < Lp [j+1] ; p++)
14 x [Li [p]] -= Lx [p] * x [j] ;
CS_INT cs_lsolve(const cs *L, CS_ENTRY *x)