Lines Matching defs:qrsize
75 static int finderPenaltyCountPatterns(const int runHistory[7], int qrsize);
76 static int finderPenaltyTerminateAndCount(bool currentRunColor, int currentRunLength, int runHistory[7], int qrsize);
77 static void finderPenaltyAddHistory(int currentRunLength, int runHistory[7], int qrsize);
420 int qrsize = version * 4 + 17;
421 memset(qrcode, 0, (size_t)((qrsize * qrsize + 7) / 8 + 1) * sizeof(qrcode[0]));
422 qrcode[0] = (uint8_t)qrsize;
425 fillRectangle(6, 0, 1, qrsize, qrcode);
426 fillRectangle(0, 6, qrsize, 1, qrcode);
430 fillRectangle(qrsize - 8, 0, 8, 9, qrcode);
431 fillRectangle(0, qrsize - 8, 9, 8, qrcode);
446 fillRectangle(qrsize - 11, 0, 3, 6, qrcode);
447 fillRectangle(0, qrsize - 11, 6, 3, qrcode);
457 int qrsize = qrcodegen_getSize(qrcode);
458 for (int i = 7; i < qrsize - 7; i += 2) {
471 setModuleUnbounded(qrcode, qrsize - 4 + dx, 3 + dy, false);
472 setModuleUnbounded(qrcode, 3 + dx, qrsize - 4 + dy, false);
503 int k = qrsize - 11 + j;
537 int qrsize = qrcodegen_getSize(qrcode);
539 setModuleBounded(qrcode, qrsize - 1 - i, 8, getBit(bits, i));
541 setModuleBounded(qrcode, 8, qrsize - 15 + i, getBit(bits, i));
542 setModuleBounded(qrcode, 8, qrsize - 8, true); // Always dark
578 int qrsize = qrcodegen_getSize(qrcode);
581 for (int right = qrsize - 1; right >= 1; right -= 2) { // Index of right column in each column pair
584 for (int vert = 0; vert < qrsize; vert++) { // Vertical counter
588 int y = upward ? qrsize - 1 - vert : vert; // Actual y coordinate
610 int qrsize = qrcodegen_getSize(qrcode);
611 for (int y = 0; y < qrsize; y++) {
612 for (int x = 0; x < qrsize; x++) {
637 int qrsize = qrcodegen_getSize(qrcode);
641 for (int y = 0; y < qrsize; y++) {
645 for (int x = 0; x < qrsize; x++) {
653 finderPenaltyAddHistory(runX, runHistory, qrsize);
655 result += finderPenaltyCountPatterns(runHistory, qrsize) * PENALTY_N3;
660 result += finderPenaltyTerminateAndCount(runColor, runX, runHistory, qrsize) * PENALTY_N3;
663 for (int x = 0; x < qrsize; x++) {
667 for (int y = 0; y < qrsize; y++) {
675 finderPenaltyAddHistory(runY, runHistory, qrsize);
677 result += finderPenaltyCountPatterns(runHistory, qrsize) * PENALTY_N3;
682 result += finderPenaltyTerminateAndCount(runColor, runY, runHistory, qrsize) * PENALTY_N3;
686 for (int y = 0; y < qrsize - 1; y++) {
687 for (int x = 0; x < qrsize - 1; x++) {
698 for (int y = 0; y < qrsize; y++) {
699 for (int x = 0; x < qrsize; x++) {
704 int total = qrsize * qrsize; // Note that size is odd, so dark/total != 1/2
716 static int finderPenaltyCountPatterns(const int runHistory[7], int qrsize) {
718 assert(n <= qrsize * 3); (void)qrsize;
728 static int finderPenaltyTerminateAndCount(bool currentRunColor, int currentRunLength, int runHistory[7], int qrsize) {
730 finderPenaltyAddHistory(currentRunLength, runHistory, qrsize);
733 currentRunLength += qrsize; // Add light border to final run
734 finderPenaltyAddHistory(currentRunLength, runHistory, qrsize);
735 return finderPenaltyCountPatterns(runHistory, qrsize);
740 static void finderPenaltyAddHistory(int currentRunLength, int runHistory[7], int qrsize) {
742 currentRunLength += qrsize; // Add light border to initial run
764 int qrsize = qrcode[0];
765 return (0 <= x && x < qrsize && 0 <= y && y < qrsize) && getModuleBounded(qrcode, x, y);
771 int qrsize = qrcode[0];
772 assert(21 <= qrsize && qrsize <= 177 && 0 <= x && x < qrsize && 0 <= y && y < qrsize);
773 int index = y * qrsize + x;
780 int qrsize = qrcode[0];
781 assert(21 <= qrsize && qrsize <= 177 && 0 <= x && x < qrsize && 0 <= y && y < qrsize);
782 int index = y * qrsize + x;
794 int qrsize = qrcode[0];
795 if (0 <= x && x < qrsize && 0 <= y && y < qrsize)