Lines Matching refs:degree
61 testable void reedSolomonComputeDivisor(int degree, uint8_t result[]);
63 const uint8_t generator[], int degree, uint8_t result[]);
358 testable void reedSolomonComputeDivisor(int degree, uint8_t result[]) { in reedSolomonComputeDivisor() argument
359 assert(1 <= degree && degree <= qrcodegen_REED_SOLOMON_DEGREE_MAX); in reedSolomonComputeDivisor()
362 memset(result, 0, (size_t)degree * sizeof(result[0])); in reedSolomonComputeDivisor()
363 result[degree - 1] = 1; // Start off with the monomial x^0 in reedSolomonComputeDivisor()
369 for (int i = 0; i < degree; i++) { in reedSolomonComputeDivisor()
371 for (int j = 0; j < degree; j++) { in reedSolomonComputeDivisor()
373 if (j + 1 < degree) in reedSolomonComputeDivisor()
385 const uint8_t generator[], int degree, uint8_t result[]) { in reedSolomonComputeRemainder() argument
386 assert(1 <= degree && degree <= qrcodegen_REED_SOLOMON_DEGREE_MAX); in reedSolomonComputeRemainder()
387 memset(result, 0, (size_t)degree * sizeof(result[0])); in reedSolomonComputeRemainder()
390 memmove(&result[0], &result[1], (size_t)(degree - 1) * sizeof(result[0])); in reedSolomonComputeRemainder()
391 result[degree - 1] = 0; in reedSolomonComputeRemainder()
392 for (int j = 0; j < degree; j++) in reedSolomonComputeRemainder()