119 #define COL_IS_DEAD(c)      (Col [c].start < ALIVE)
120 #define COL_IS_ALIVE(c)     (Col [c].start >= ALIVE)
121 #define COL_IS_DEAD_PRINCIPAL(c)  (Col [c].start == DEAD_PRINCIPAL)
123 #define KILL_PRINCIPAL_COL(c)   { Col [c].start = DEAD_PRINCIPAL ; }
124 #define KILL_NON_PRINCIPAL_COL(c) { Col [c].start = DEAD_NON_PRINCIPAL ; }
214 …_row, IndexType n_col, Colamd_Row<IndexType> Row [], colamd_col<IndexType> Col [], IndexType A [],…
217 …n_col, IndexType Alen, Colamd_Row<IndexType> Row [], colamd_col<IndexType> Col [], IndexType A [],…
220 static void order_children (IndexType n_col, colamd_col<IndexType> Col [], IndexType p []);
223 static void detect_super_cols (colamd_col<IndexType> Col [], IndexType A [], IndexType head [], Ind…
226 …_row, IndexType n_col, Colamd_Row<IndexType> Row [], colamd_col<IndexType> Col [], IndexType A [],…
332   colamd_col<IndexType> *Col ;   /* pointer into A of Col [0..n_col] array */  in colamd()  local
427   Col = (colamd_col<IndexType> *) &A [Alen] ;  in colamd()
432   if (!Eigen::internal::init_rows_cols (n_row, n_col, Row, Col, A, p, stats))  in colamd()
441   Eigen::internal::init_scoring (n_row, n_col, Row, Col, A, p, knobs,  in colamd()
446   ngarbage = Eigen::internal::find_ordering (n_row, n_col, Alen, Row, Col, A, p,  in colamd()
451   Eigen::internal::order_children (n_col, Col, p) ;  in colamd()
489     colamd_col<IndexType> Col [],    /* of size n_col+1 */  in init_rows_cols()
509     Col [col].start = p [col] ;  in init_rows_cols()
510     Col [col].length = p [col+1] - p [col] ;  in init_rows_cols()
512     if ((Col [col].length) < 0) // extra parentheses to work-around gcc bug 10200  in init_rows_cols()
517       stats [COLAMD_INFO2] = Col [col].length ;  in init_rows_cols()
518       COLAMD_DEBUG0 (("colamd: col %d length %d < 0\n", col, Col [col].length)) ;  in init_rows_cols()
522     Col [col].shared1.thickness = 1 ;  in init_rows_cols()
523     Col [col].shared2.score = 0 ;  in init_rows_cols()
524     Col [col].shared3.prev = COLAMD_EMPTY ;  in init_rows_cols()
525     Col [col].shared4.degree_next = COLAMD_EMPTY ;  in init_rows_cols()
581 	Col [col].length-- ;  in init_rows_cols()
660     Col [0].start = 0 ;  in init_rows_cols()
661     p [0] = Col [0].start ;  in init_rows_cols()
666       Col [col].start = Col [col-1].start + Col [col-1].length ;  in init_rows_cols()
667       p [col] = Col [col].start ;  in init_rows_cols()
705     colamd_col<IndexType> Col [],    /* of size n_col+1 */  in init_scoring()
748     deg = Col [c].length ;  in init_scoring()
752       Col [c].shared2.order = --n_col2 ;  in init_scoring()
768     deg = Col [c].length ;  in init_scoring()
772       Col [c].shared2.order = --n_col2 ;  in init_scoring()
774       cp = &A [Col [c].start] ;  in init_scoring()
775       cp_end = cp + Col [c].length ;  in init_scoring()
821     cp = &A [Col [c].start] ;  in init_scoring()
823     cp_end = cp + Col [c].length ;  in init_scoring()
841     col_length = (IndexType) (new_cp - &A [Col [c].start]) ;  in init_scoring()
847       Col [c].shared2.order = --n_col2 ;  in init_scoring()
855       Col [c].length = col_length ;  in init_scoring()
856       Col [c].shared2.score = score ;  in init_scoring()
884 		      c, Col [c].shared2.score, min_score, n_col)) ;  in init_scoring()
888       score = Col [c].shared2.score ;  in init_scoring()
898       Col [c].shared3.prev = COLAMD_EMPTY ;  in init_scoring()
899       Col [c].shared4.degree_next = next_col ;  in init_scoring()
905 	Col [next_col].shared3.prev = c ;  in init_scoring()
943     colamd_col<IndexType> Col [],    /* of size n_col+1 */  in find_ordering()
1013     next_col = Col [pivot_col].shared4.degree_next ;  in find_ordering()
1017       Col [next_col].shared3.prev = COLAMD_EMPTY ;  in find_ordering()
1024     pivot_col_score = Col [pivot_col].shared2.score ;  in find_ordering()
1027     Col [pivot_col].shared2.order = k ;  in find_ordering()
1030     pivot_col_thickness = Col [pivot_col].shared1.thickness ;  in find_ordering()
1039       pfree = Eigen::internal::garbage_collection (n_row, n_col, Row, Col, A, &A [pfree]) ;  in find_ordering()
1058     Col [pivot_col].shared1.thickness = -pivot_col_thickness ;  in find_ordering()
1061     cp = &A [Col [pivot_col].start] ;  in find_ordering()
1062     cp_end = cp + Col [pivot_col].length ;  in find_ordering()
1080 	col_thickness = Col [col].shared1.thickness ;  in find_ordering()
1084 	  Col [col].shared1.thickness = -col_thickness ;  in find_ordering()
1094     Col [pivot_col].shared1.thickness = pivot_col_thickness ;  in find_ordering()
1101     cp = &A [Col [pivot_col].start] ;  in find_ordering()
1102     cp_end = cp + Col [pivot_col].length ;  in find_ordering()
1117       pivot_row = A [Col [pivot_col].start] ;  in find_ordering()
1126     COLAMD_ASSERT (Col [pivot_col].length > 0 || pivot_row_length == 0) ;  in find_ordering()
1164       col_thickness = -Col [col].shared1.thickness ;  in find_ordering()
1166       Col [col].shared1.thickness = col_thickness ;  in find_ordering()
1170       cur_score = Col [col].shared2.score ;  in find_ordering()
1171       prev_col = Col [col].shared3.prev ;  in find_ordering()
1172       next_col = Col [col].shared4.degree_next ;  in find_ordering()
1182 	Col [prev_col].shared4.degree_next = next_col ;  in find_ordering()
1186 	Col [next_col].shared3.prev = prev_col ;  in find_ordering()
1191       cp = &A [Col [col].start] ;  in find_ordering()
1192       cp_end = cp + Col [col].length ;  in find_ordering()
1243       cp = &A [Col [col].start] ;  in find_ordering()
1246       cp_end = cp + Col [col].length ;  in find_ordering()
1273       Col [col].length = (IndexType) (new_cp - &A [Col [col].start]) ;  in find_ordering()
1277       if (Col [col].length == 0)  in find_ordering()
1282 	pivot_row_degree -= Col [col].shared1.thickness ;  in find_ordering()
1285 	Col [col].shared2.order = k ;  in find_ordering()
1287 	k += Col [col].shared1.thickness ;  in find_ordering()
1296 	Col [col].shared2.score = cur_score ;  in find_ordering()
1309 	  first_col = Col [head_column].shared3.headhash ;  in find_ordering()
1310 	  Col [head_column].shared3.headhash = col ;  in find_ordering()
1318 	Col [col].shared4.hash_next = first_col ;  in find_ordering()
1321 	Col [col].shared3.hash = (IndexType) hash ;  in find_ordering()
1332     Eigen::internal::detect_super_cols (Col, A, head, pivot_row_start, pivot_row_length) ;  in find_ordering()
1366       A [Col [col].start + (Col [col].length++)] = pivot_row ;  in find_ordering()
1371       cur_score = Col [col].shared2.score + pivot_row_degree ;  in find_ordering()
1376       max_score = n_col - k - Col [col].shared1.thickness ;  in find_ordering()
1379       cur_score -= Col [col].shared1.thickness ;  in find_ordering()
1386       Col [col].shared2.score = cur_score ;  in find_ordering()
1396       Col [col].shared4.degree_next = next_col ;  in find_ordering()
1397       Col [col].shared3.prev = COLAMD_EMPTY ;  in find_ordering()
1400 	Col [next_col].shared3.prev = col ;  in find_ordering()
1451   colamd_col<IndexType> Col [],    /* of size n_col+1 */  in order_children()
1468     if (!COL_IS_DEAD_PRINCIPAL (i) && Col [i].shared2.order == COLAMD_EMPTY)  in order_children()
1474 	parent = Col [parent].shared1.parent ;  in order_children()
1481       order = Col [parent].shared2.order ;  in order_children()
1485 	COLAMD_ASSERT (Col [c].shared2.order == COLAMD_EMPTY) ;  in order_children()
1488 	Col [c].shared2.order = order++ ;  in order_children()
1490 	Col [c].shared1.parent = parent ;  in order_children()
1493 	c = Col [c].shared1.parent ;  in order_children()
1498       } while (Col [c].shared2.order == COLAMD_EMPTY) ;  in order_children()
1501       Col [parent].shared2.order = order ;  in order_children()
1509     p [Col [c].shared2.order] = c ;  in order_children()
1551   colamd_col<IndexType> Col [],    /* of size n_col+1 */  in detect_super_cols()
1587     hash = Col [col].shared3.hash ;  in detect_super_cols()
1595       first_col = Col [head_column].shared3.headhash ;  in detect_super_cols()
1605 	 super_c = Col [super_c].shared4.hash_next)  in detect_super_cols()
1608       COLAMD_ASSERT (Col [super_c].shared3.hash == hash) ;  in detect_super_cols()
1609       length = Col [super_c].length ;  in detect_super_cols()
1616       for (c = Col [super_c].shared4.hash_next ;  in detect_super_cols()
1617 	   c != COLAMD_EMPTY ; c = Col [c].shared4.hash_next)  in detect_super_cols()
1621 	COLAMD_ASSERT (Col [c].shared3.hash == hash) ;  in detect_super_cols()
1624 	if (Col [c].length != length ||  in detect_super_cols()
1625 	    Col [c].shared2.score != Col [super_c].shared2.score)  in detect_super_cols()
1632 	cp1 = &A [Col [super_c].start] ;  in detect_super_cols()
1633 	cp2 = &A [Col [c].start] ;  in detect_super_cols()
1657 	COLAMD_ASSERT (Col [c].shared2.score == Col [super_c].shared2.score) ;  in detect_super_cols()
1659 	Col [super_c].shared1.thickness += Col [c].shared1.thickness ;  in detect_super_cols()
1660 	Col [c].shared1.parent = super_c ;  in detect_super_cols()
1663 	Col [c].shared2.order = COLAMD_EMPTY ;  in detect_super_cols()
1665 	Col [prev_c].shared4.hash_next = Col [c].shared4.hash_next ;  in detect_super_cols()
1674       Col [head_column].shared3.headhash = COLAMD_EMPTY ;  in detect_super_cols()
1705     colamd_col<IndexType> Col [],    /* column info */  in garbage_collection()
1726       psrc = &A [Col [c].start] ;  in garbage_collection()
1730       Col [c].start = (IndexType) (pdest - &A [0]) ;  in garbage_collection()
1731       length = Col [c].length ;  in garbage_collection()
1740       Col [c].length = (IndexType) (pdest - &A [Col [c].start]) ;  in garbage_collection()