rankofmatrix.c

求矩阵的秩

DWORD gf2rankc(DWORD *A,DWORD *X,DWORD *Y,u32 slice_length_u32,DWORD decmat_M,DWORD decmat_S)

{
	DWORD k;
	DWORD kd;

	DWORD rank;
	DWORD findex,first_dec_not_zero,first_bit_in_dec;
	
	
//	DWORD *Atmp;
//	DWORD *Atest_speed,*Atest_speed1,*Atest_speed2;
//	DWORD *A;
//	DWORD *A_sort_by_weiht;
//	DWORD *ptmp;
//	DWORD *stmp;

	DWORD *row_k;

//	DWORD tmp;
//	DWORD debugn;

	R = decmat_M;
	C = decmat_S;

//	Atmp=(DWORD  *)malloc(R*C*sizeof(DWORD)); 

//	A = Ge;
//	A_sort_by_weiht = Atmp;

	rank =0;
	for (k=0;k<R;k++)
	{	
	
		/*if (k%WSL==WSL-1) 
		{	
			sort_by_weight(	A, A_sort_by_weiht,	k);
			stmp = A;
			A	= A_sort_by_weiht;
			A_sort_by_weiht = stmp;
		}*/	
		
		row_k = A + k;		
		if (row_k_not_empty(row_k)>0)
		{	
			rank++;					
			
			find_one_index(row_k, (long*)(&first_dec_not_zero), (long*)(&first_bit_in_dec));
			findex = first_dec_not_zero;
			
			kd = k/BW;
			
			
			add_row_with_same_firstbit(	A,
										X,
										Y,
										slice_length_u32,
										k,	
										first_dec_not_zero,
										first_bit_in_dec
							   );				

		}

	}//end of for (k=0;k<R;k++)	
	//free(Atmp);
	return rank;
}