Searched refs:nFullRankMatrices (Results 1 – 4 of 4) sorted by relevance
79 packedG.nMatrices = packedG.nFullRankMatrices = 0; in mindist_gf2()95 if (rank == G.rows) packedG.nFullRankMatrices++; in mindist_gf2()120 info.lower_bound = 2 * packedG.nFullRankMatrices; in mindist_gf2()121 for (i=packedG.nFullRankMatrices; i<packedG.nMatrices; i++) { in mindist_gf2()197 packedG.nFullRankMatrices = 1 + ((G.cols - G.rows)/G.rows); in cyclic_mindist_gf2()561 w = (i+1) * G->nFullRankMatrices; in update_info_gf2()562 info->matrices_req = G->nFullRankMatrices; in update_info_gf2()563 for (j=G->nFullRankMatrices; j<G->nMatrices; j++) { in update_info_gf2()583 for (j=G->nFullRankMatrices; j<G->nMatrices; j++) { in update_info_gf2()589 if (j < G->nFullRankMatrices) info->lower_bound++; in update_info_gf2()[all …]
100 packedG.nMatrices = packedG.nFullRankMatrices = 0; in mindist_gf3()116 if (rank == G.rows) packedG.nFullRankMatrices++; in mindist_gf3()132 info.lower_bound = 2 * packedG.nFullRankMatrices; in mindist_gf3()133 for (i=packedG.nFullRankMatrices; i<packedG.nMatrices; i++) { in mindist_gf3()214 packedG.nFullRankMatrices = 1 + ((G.cols - G.rows)/G.rows); in cyclic_mindist_gf3()598 w = (i+1) * G->nFullRankMatrices; in update_info_gf3()599 info->matrices_req = G->nFullRankMatrices; in update_info_gf3()600 for (j=G->nFullRankMatrices; j<G->nMatrices; j++) { in update_info_gf3()617 for (j=G->nFullRankMatrices; j<G->nMatrices; j++) { in update_info_gf3()623 if (j < G->nFullRankMatrices) info->lower_bound++; in update_info_gf3()[all …]
24 unsigned short nMatrices, nFullRankMatrices; member
58 unsigned short nMatrices, nFullRankMatrices; member