59                              cs_dis* symbolic_factorization,  in SolveCholesky()  argument
72   csn* numeric_factorization = cs_di_chol(A, symbolic_factorization);  in SolveCholesky()
83   cs_di_ipvec(symbolic_factorization->pinv, b, scratch_, A->n);  in SolveCholesky()
89   cs_di_pvec(symbolic_factorization->pinv, scratch_, b, A->n);  in SolveCholesky()
137   cs_dis* symbolic_factorization =  in BlockAnalyzeCholesky()  local
139   symbolic_factorization->pinv = cs_pinv(&scalar_ordering[0], A->n);  in BlockAnalyzeCholesky()
140   cs* permuted_A = cs_symperm(A, symbolic_factorization->pinv, 0);  in BlockAnalyzeCholesky()
142   symbolic_factorization->parent = cs_etree(permuted_A, 0);  in BlockAnalyzeCholesky()
143   int* postordering = cs_post(symbolic_factorization->parent, A->n);  in BlockAnalyzeCholesky()
145                                  symbolic_factorization->parent,  in BlockAnalyzeCholesky()
151   symbolic_factorization->cp = (int*) cs_malloc(A->n+1, sizeof(int));  in BlockAnalyzeCholesky()
152   symbolic_factorization->lnz = cs_cumsum(symbolic_factorization->cp,  in BlockAnalyzeCholesky()
155   symbolic_factorization->unz = symbolic_factorization->lnz;  in BlockAnalyzeCholesky()
159   if (symbolic_factorization->lnz < 0) {  in BlockAnalyzeCholesky()
160     cs_sfree(symbolic_factorization);  in BlockAnalyzeCholesky()
161     symbolic_factorization = NULL;  in BlockAnalyzeCholesky()
164   return symbolic_factorization;  in BlockAnalyzeCholesky()
210 void CXSparse::Free(cs_dis* symbolic_factorization) {  in Free()  argument
211   cs_di_sfree(symbolic_factorization);  in Free()