#include "string.h" #include "QR_Encode.h" //二维码生成原理详见 http://coolshell.cn/articles/10590.html#jtss-tsina //P28 表9 QR码符号各版本的纠错特效 const QR_VERSIONINFO QR_VersonInfo[] = {{0}, // Ver.0 { 1, // Ver.1 26, 19, 16, 13, 9, 0, 0, 0, 0, 0, 0, 0, 1, 26, 19, 1, 26, 16, 1, 26, 13, 1, 26, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 2, // Ver.2 44, 34, 28, 22, 16, 1, 18, 0, 0, 0, 0, 0, 1, 44, 34, 1, 44, 28, 1, 44, 22, 1, 44, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 3, // Ver.3 70, 55, 44, 34, 26, 1, 22, 0, 0, 0, 0, 0, 1, 70, 55, 1, 70, 44, 2, 35, 17, 2, 35, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 4, // Ver.4 100, 80, 64, 48, 36, 1, 26, 0, 0, 0, 0, 0, 1, 100, 80, 2, 50, 32, 2, 50, 24, 4, 25, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 5, // Ver.5 134, 108, 86, 62, 46, 1, 30, 0, 0, 0, 0, 0, 1, 134, 108, 2, 67, 43, 2, 33, 15, 2, 33, 11, 0, 0, 0, 0, 0, 0, 2, 34, 16, 2, 34, 12}, { 6, // Ver.6 172, 136, 108, 76, 60, 1, 34, 0, 0, 0, 0, 0, 2, 86, 68, 4, 43, 27, 4, 43, 19, 4, 43, 15, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 7, // Ver.7 196, 156, 124, 88, 66, 2, 22, 38, 0, 0, 0, 0, 2, 98, 78, 4, 49, 31, 2, 32, 14, 4, 39, 13, 0, 0, 0, 0, 0, 0, 4, 33, 15, 1, 40, 14}, { 8, // Ver.8 242, 194, 154, 110, 86, 2, 24, 42, 0, 0, 0, 0, 2, 121, 97, 2, 60, 38, 4, 40, 18, 4, 40, 14, 0, 0, 0, 2, 61, 39, 2, 41, 19, 2, 41, 15}, { 9, // Ver.9 292, 232, 182, 132, 100, 2, 26, 46, 0, 0, 0, 0, 2, 146, 116, 3, 58, 36, 4, 36, 16, 4, 36, 12, 0, 0, 0, 2, 59, 37, 4, 37, 17, 4, 37, 13}, {10, // Ver.10 346, 274, 216, 154, 122, 2, 28, 50, 0, 0, 0, 0, 2, 86, 68, 4, 69, 43, 6, 43, 19, 6, 43, 15, 2, 87, 69, 1, 70, 44, 2, 44, 20, 2, 44, 16}, {11, // Ver.11 404, 324, 254, 180, 140, 2, 30, 54, 0, 0, 0, 0, 4, 101, 81, 1, 80, 50, 4, 50, 22, 3, 36, 12, 0, 0, 0, 4, 81, 51, 4, 51, 23, 8, 37, 13}, {12, // Ver.12 466, 370, 290, 206, 158, 2, 32, 58, 0, 0, 0, 0, 2, 116, 92, 6, 58, 36, 4, 46, 20, 7, 42, 14, 2, 117, 93, 2, 59, 37, 6, 47, 21, 4, 43, 15}, {13, // Ver.13 532, 428, 334, 244, 180, 2, 34, 62, 0, 0, 0, 0, 4, 133, 107, 8, 59, 37, 8, 44, 20, 12, 33, 11, 0, 0, 0, 1, 60, 38, 4, 45, 21, 4, 34, 12}, {14, // Ver.14 581, 461, 365, 261, 197, 3, 26, 46, 66, 0, 0, 0, 3, 145, 115, 4, 64, 40, 11, 36, 16, 11, 36, 12, 1, 146, 116, 5, 65, 41, 5, 37, 17, 5, 37, 13}, {15, // Ver.15 655, 523, 415, 295, 223, 3, 26, 48, 70, 0, 0, 0, 5, 109, 87, 5, 65, 41, 5, 54, 24, 11, 36, 12, 1, 110, 88, 5, 66, 42, 7, 55, 25, 7, 37, 13}, {16, // Ver.16 733, 589, 453, 325, 253, 3, 26, 50, 74, 0, 0, 0, 5, 122, 98, 7, 73, 45, 15, 43, 19, 3, 45, 15, 1, 123, 99, 3, 74, 46, 2, 44, 20, 13, 46, 16}, {17, // Ver.17 815, 647, 507, 367, 283, 3, 30, 54, 78, 0, 0, 0, 1, 135, 107, 10, 74, 46, 1, 50, 22, 2, 42, 14, 5, 136, 108, 1, 75, 47, 15, 51, 23, 17, 43, 15}, {18, // Ver.18 901, 721, 563, 397, 313, 3, 30, 56, 82, 0, 0, 0, 5, 150, 120, 9, 69, 43, 17, 50, 22, 2, 42, 14, 1, 151, 121, 4, 70, 44, 1, 51, 23, 19, 43, 15}, {19, // Ver.19 991, 795, 627, 445, 341, 3, 30, 58, 86, 0, 0, 0, 3, 141, 113, 3, 70, 44, 17, 47, 21, 9, 39, 13, 4, 142, 114, 11, 71, 45, 4, 48, 22, 16, 40, 14}, {20, // Ver.20 1085, 861, 669, 485, 385, 3, 34, 62, 90, 0, 0, 0, 3, 135, 107, 3, 67, 41, 15, 54, 24, 15, 43, 15, 5, 136, 108, 13, 68, 42, 5, 55, 25, 10, 44, 16}, {21, // Ver.21 1156, 932, 714, 512, 406, 4, 28, 50, 72, 94, 0, 0, 4, 144, 116, 17, 68, 42, 17, 50, 22, 19, 46, 16, 4, 145, 117, 0, 0, 0, 6, 51, 23, 6, 47, 17}, {22, // Ver.22 1258, 1006, 782, 568, 442, 4, 26, 50, 74, 98, 0, 0, 2, 139, 111, 17, 74, 46, 7, 54, 24, 34, 37, 13, 7, 140, 112, 0, 0, 0, 16, 55, 25, 0, 0, 0}, {23, // Ver.23 1364, 1094, 860, 614, 464, 4, 30, 54, 78, 102, 0, 0, 4, 151, 121, 4, 75, 47, 11, 54, 24, 16, 45, 15, 5, 152, 122, 14, 76, 48, 14, 55, 25, 14, 46, 16}, {24, // Ver.24 1474, 1174, 914, 664, 514, 4, 28, 54, 80, 106, 0, 0, 6, 147, 117, 6, 73, 45, 11, 54, 24, 30, 46, 16, 4, 148, 118, 14, 74, 46, 16, 55, 25, 2, 47, 17}, {25, // Ver.25 1588, 1276, 1000, 718, 538, 4, 32, 58, 84, 110, 0, 0, 8, 132, 106, 8, 75, 47, 7, 54, 24, 22, 45, 15, 4, 133, 107, 13, 76, 48, 22, 55, 25, 13, 46, 16}, {26, // Ver.26 1706, 1370, 1062, 754, 596, 4, 30, 58, 86, 114, 0, 0, 10, 142, 114, 19, 74, 46, 28, 50, 22, 33, 46, 16, 2, 143, 115, 4, 75, 47, 6, 51, 23, 4, 47, 17}, {27, // Ver.27 1828, 1468, 1128, 808, 628, 4, 34, 62, 90, 118, 0, 0, 8, 152, 122, 22, 73, 45, 8, 53, 23, 12, 45, 15, 4, 153, 123, 3, 74, 46, 26, 54, 24, 28, 46, 16}, {28, // Ver.28 1921, 1531, 1193, 871, 661, 5, 26, 50, 74, 98, 122, 0, 3, 147, 117, 3, 73, 45, 4, 54, 24, 11, 45, 15, 10, 148, 118, 23, 74, 46, 31, 55, 25, 31, 46, 16}, {29, // Ver.29 2051, 1631, 1267, 911, 701, 5, 30, 54, 78, 102, 126, 0, 7, 146, 116, 21, 73, 45, 1, 53, 23, 19, 45, 15, 7, 147, 117, 7, 74, 46, 37, 54, 24, 26, 46, 16}, {30, // Ver.30 2185, 1735, 1373, 985, 745, 5, 26, 52, 78, 104, 130, 0, 5, 145, 115, 19, 75, 47, 15, 54, 24, 23, 45, 15, 10, 146, 116, 10, 76, 48, 25, 55, 25, 25, 46, 16}, {31, // Ver.31 2323, 1843, 1455, 1033, 793, 5, 30, 56, 82, 108, 134, 0, 13, 145, 115, 2, 74, 46, 42, 54, 24, 23, 45, 15, 3, 146, 116, 29, 75, 47, 1, 55, 25, 28, 46, 16}, {32, // Ver.32 2465, 1955, 1541, 1115, 845, 5, 34, 60, 86, 112, 138, 0, 17, 145, 115, 10, 74, 46, 10, 54, 24, 19, 45, 15, 0, 0, 0, 23, 75, 47, 35, 55, 25, 35, 46, 16}, {33, // Ver.33 2611, 2071, 1631, 1171, 901, 5, 30, 58, 86, 114, 142, 0, 17, 145, 115, 14, 74, 46, 29, 54, 24, 11, 45, 15, 1, 146, 116, 21, 75, 47, 19, 55, 25, 46, 46, 16}, {34, // Ver.34 2761, 2191, 1725, 1231, 961, 5, 34, 62, 90, 118, 146, 0, 13, 145, 115, 14, 74, 46, 44, 54, 24, 59, 46, 16, 6, 146, 116, 23, 75, 47, 7, 55, 25, 1, 47, 17}, {35, // Ver.35 2876, 2306, 1812, 1286, 986, 6, 30, 54, 78, 102, 126, 150, 12, 151, 121, 12, 75, 47, 39, 54, 24, 22, 45, 15, 7, 152, 122, 26, 76, 48, 14, 55, 25, 41, 46, 16}, {36, // Ver.36 3034, 2434, 1914, 1354, 1054, 6, 24, 50, 76, 102, 128, 154, 6, 151, 121, 6, 75, 47, 46, 54, 24, 2, 45, 15, 14, 152, 122, 34, 76, 48, 10, 55, 25, 64, 46, 16}, {37, // Ver.37 3196, 2566, 1992, 1426, 1096, 6, 28, 54, 80, 106, 132, 158, 17, 152, 122, 29, 74, 46, 49, 54, 24, 24, 45, 15, 4, 153, 123, 14, 75, 47, 10, 55, 25, 46, 46, 16}, {38, // Ver.38 3362, 2702, 2102, 1502, 1142, 6, 32, 58, 84, 110, 136, 162, 4, 152, 122, 13, 74, 46, 48, 54, 24, 42, 45, 15, 18, 153, 123, 32, 75, 47, 14, 55, 25, 32, 46, 16}, {39, // Ver.39 3532, 2812, 2216, 1582, 1222, 6, 26, 54, 82, 110, 138, 166, 20, 147, 117, 40, 75, 47, 43, 54, 24, 10, 45, 15, 4, 148, 118, 7, 76, 48, 22, 55, 25, 67, 46, 16}, {40, // Ver.40 3706, 2956, 2334, 1666, 1276, 6, 30, 58, 86, 114, 142, 170, 19, 148, 118, 18, 75, 47, 34, 54, 24, 20, 45, 15, 6, 149, 119, 31, 76, 48, 34, 55, 25, 61, 46, 16} }; // GF(2^8) 指数2系数——本源多项式 ///////////////////////////////////////////////////////////////////////////// const unsigned char byExpToInt[] = { 1, 2, 4, 8, 16, 32, 64, 128, 29, 58, 116, 232, 205, 135, 19, 38, 76, 152, 45, 90, 180, 117, 234, 201, 143, 3, 6, 12, 24, 48, 96, 192, 157, 39, 78, 156, 37, 74, 148, 53, 106, 212, 181, 119, 238, 193, 159, 35, 70, 140, 5, 10, 20, 40, 80, 160, 93, 186, 105, 210, 185, 111, 222, 161, 95, 190, 97, 194, 153, 47, 94, 188, 101, 202, 137, 15, 30, 60, 120, 240, 253, 231, 211, 187, 107, 214, 177, 127, 254, 225, 223, 163, 91, 182, 113, 226, 217, 175, 67, 134, 17, 34, 68, 136, 13, 26, 52, 104, 208, 189, 103, 206, 129, 31, 62, 124, 248, 237, 199, 147, 59, 118, 236, 197, 151, 51, 102, 204, 133, 23, 46, 92, 184, 109, 218, 169, 79, 158, 33, 66, 132, 21, 42, 84, 168, 77, 154, 41, 82, 164, 85, 170, 73, 146, 57, 114, 228, 213, 183, 115, 230, 209, 191, 99, 198, 145, 63, 126, 252, 229, 215, 179, 123, 246, 241, 255, 227, 219, 171, 75, 150, 49, 98, 196, 149, 55, 110, 220, 165, 87, 174, 65, 130, 25, 50, 100, 200, 141, 7, 14, 28, 56, 112, 224, 221, 167, 83, 166, 81, 162, 89, 178, 121, 242, 249, 239, 195, 155, 43, 86, 172, 69, 138, 9, 18, 36, 72, 144, 61, 122, 244, 245, 247, 243, 251, 235, 203, 139, 11, 22, 44, 88, 176, 125, 250, 233, 207, 131, 27, 54, 108, 216, 173, 71, 142, 1}; // GF(2^8) 系数2指数——本源多项式 ///////////////////////////////////////////////////////////////////////////// const unsigned char byIntToExp[] = { 0, 0, 1, 25, 2, 50, 26, 198, 3, 223, 51, 238, 27, 104, 199, 75, 4, 100, 224, 14, 52, 141, 239, 129, 28, 193, 105, 248, 200, 8, 76, 113, 5, 138, 101, 47, 225, 36, 15, 33, 53, 147, 142, 218, 240, 18, 130, 69, 29, 181, 194, 125, 106, 39, 249, 185, 201, 154, 9, 120, 77, 228, 114, 166, 6, 191, 139, 98, 102, 221, 48, 253, 226, 152, 37, 179, 16, 145, 34, 136, 54, 208, 148, 206, 143, 150, 219, 189, 241, 210, 19, 92, 131, 56, 70, 64, 30, 66, 182, 163, 195, 72, 126, 110, 107, 58, 40, 84, 250, 133, 186, 61, 202, 94, 155, 159, 10, 21, 121, 43, 78, 212, 229, 172, 115, 243, 167, 87, 7, 112, 192, 247, 140, 128, 99, 13, 103, 74, 222, 237, 49, 197, 254, 24, 227, 165, 153, 119, 38, 184, 180, 124, 17, 68, 146, 217, 35, 32, 137, 46, 55, 63, 209, 91, 149, 188, 207, 205, 144, 135, 151, 178, 220, 252, 190, 97, 242, 86, 211, 171, 20, 42, 93, 158, 132, 60, 57, 83, 71, 109, 65, 162, 31, 45, 67, 216, 183, 123, 164, 118, 196, 23, 73, 236, 127, 12, 111, 246, 108, 161, 59, 82, 41, 157, 85, 170, 251, 96, 134, 177, 187, 204, 62, 90, 203, 89, 95, 176, 156, 169, 160, 81, 11, 245, 22, 235, 122, 117, 44, 215, 79, 174, 213, 233, 230, 231, 173, 232, 116, 214, 244, 234, 168, 80, 88, 175}; //纠错码字的生成多项式 //P53 附录A //这是加罗瓦域2^8以 100011101 表示主模块多项式： //X^8+X^4+X^3+X^2+1 ///////////////////////////////////////////////////////////////////////////// const unsigned char byRSExp7[] = {87, 229, 146, 149, 238, 102, 21}; const unsigned char byRSExp10[] = {251, 67, 46, 61, 118, 70, 64, 94, 32, 45}; const unsigned char byRSExp13[] = { 74, 152, 176, 100, 86, 100, 106, 104, 130, 218, 206, 140, 78}; const unsigned char byRSExp15[] = { 8, 183, 61, 91, 202, 37, 51, 58, 58, 237, 140, 124, 5, 99, 105}; const unsigned char byRSExp16[] = {120, 104, 107, 109, 102, 161, 76, 3, 91, 191, 147, 169, 182, 194, 225, 120}; const unsigned char byRSExp17[] = { 43, 139, 206, 78, 43, 239, 123, 206, 214, 147, 24, 99, 150, 39, 243, 163, 136}; const unsigned char byRSExp18[] = {215, 234, 158, 94, 184, 97, 118, 170, 79, 187, 152, 148, 252, 179, 5, 98, 96, 153}; const unsigned char byRSExp20[] = { 17, 60, 79, 50, 61, 163, 26, 187, 202, 180, 221, 225, 83, 239, 156, 164, 212, 212, 188, 190}; const unsigned char byRSExp22[] = {210, 171, 247, 242, 93, 230, 14, 109, 221, 53, 200, 74, 8, 172, 98, 80, 219, 134, 160, 105, 165, 231}; const unsigned char byRSExp24[] = {229, 121, 135, 48, 211, 117, 251, 126, 159, 180, 169, 152, 192, 226, 228, 218, 111, 0, 117, 232, 87, 96, 227, 21}; const unsigned char byRSExp26[] = {173, 125, 158, 2, 103, 182, 118, 17, 145, 201, 111, 28, 165, 53, 161, 21, 245, 142, 13, 102, 48, 227, 153, 145, 218, 70}; const unsigned char byRSExp28[] = {168, 223, 200, 104, 224, 234, 108, 180, 110, 190, 195, 147, 205, 27, 232, 201, 21, 43, 245, 87, 42, 195, 212, 119, 242, 37, 9, 123}; const unsigned char byRSExp30[] = { 41, 173, 145, 152, 216, 31, 179, 182, 50, 48, 110, 86, 239, 96, 222, 125, 42, 173, 226, 193, 224, 130, 156, 37, 251, 216, 238, 40, 192, 180}; const unsigned char byRSExp32[] = { 10, 6, 106, 190, 249, 167, 4, 67, 209, 138, 138, 32, 242, 123, 89, 27, 120, 185, 80, 156, 38, 69, 171, 60, 28, 222, 80, 52, 254, 185, 220, 241}; const unsigned char byRSExp34[] = {111, 77, 146, 94, 26, 21, 108, 19, 105, 94, 113, 193, 86, 140, 163, 125, 58, 158, 229, 239, 218, 103, 56, 70, 114, 61, 183, 129, 167, 13, 98, 62, 129, 51}; const unsigned char byRSExp36[] = {200, 183, 98, 16, 172, 31, 246, 234, 60, 152, 115, 0, 167, 152, 113, 248, 238, 107, 18, 63, 218, 37, 87, 210, 105, 177, 120, 74, 121, 196, 117, 251, 113, 233, 30, 120}; const unsigned char byRSExp38[] = {159, 34, 38, 228, 230, 59, 243, 95, 49, 218, 176, 164, 20, 65, 45, 111, 39, 81, 49, 118, 113, 222, 193, 250, 242, 168, 217, 41, 164, 247, 177, 30, 238, 18, 120, 153, 60, 193}; const unsigned char byRSExp40[] = { 59, 116, 79, 161, 252, 98, 128, 205, 128, 161, 247, 57, 163, 56, 235, 106, 53, 26, 187, 174, 226, 104, 170, 7, 175, 35, 181, 114, 88, 41, 47, 163, 125, 134, 72, 20, 232, 53, 35, 15}; const unsigned char byRSExp42[] = {250, 103, 221, 230, 25, 18, 137, 231, 0, 3, 58, 242, 221, 191, 110, 84, 230, 8, 188, 106, 96, 147, 15, 131, 139, 34, 101, 223, 39, 101, 213, 199, 237, 254, 201, 123, 171, 162, 194, 117, 50, 96}; const unsigned char byRSExp44[] = {190, 7, 61, 121, 71, 246, 69, 55, 168, 188, 89, 243, 191, 25, 72, 123, 9, 145, 14, 247, 1, 238, 44, 78, 143, 62, 224, 126, 118, 114, 68, 163, 52, 194, 217, 147, 204, 169, 37, 130, 113, 102, 73, 181}; const unsigned char byRSExp46[] = {112, 94, 88, 112, 253, 224, 202, 115, 187, 99, 89, 5, 54, 113, 129, 44, 58, 16, 135, 216, 169, 211, 36, 1, 4, 96, 60, 241, 73, 104, 234, 8, 249, 245, 119, 174, 52, 25, 157, 224, 43, 202, 223, 19, 82, 15}; const unsigned char byRSExp48[] = {228, 25, 196, 130, 211, 146, 60, 24, 251, 90, 39, 102, 240, 61, 178, 63, 46, 123, 115, 18, 221, 111, 135, 160, 182, 205, 107, 206, 95, 150, 120, 184, 91, 21, 247, 156, 140, 238, 191, 11, 94, 227, 84, 50, 163, 39, 34, 108}; const unsigned char byRSExp50[] = {232, 125, 157, 161, 164, 9, 118, 46, 209, 99, 203, 193, 35, 3, 209, 111, 195, 242, 203, 225, 46, 13, 32, 160, 126, 209, 130, 160, 242, 215, 242, 75, 77, 42, 189, 32, 113, 65, 124, 69, 228, 114, 235, 175, 124, 170, 215, 232, 133, 205}; const unsigned char byRSExp52[] = {116, 50, 86, 186, 50, 220, 251, 89, 192, 46, 86, 127, 124, 19, 184, 233, 151, 215, 22, 14, 59, 145, 37, 242, 203, 134, 254, 89, 190, 94, 59, 65, 124, 113, 100, 233, 235, 121, 22, 76, 86, 97, 39, 242, 200, 220, 101, 33, 239, 254, 116, 51}; const unsigned char byRSExp54[] = {183, 26, 201, 87, 210, 221, 113, 21, 46, 65, 45, 50, 238, 184, 249, 225, 102, 58, 209, 218, 109, 165, 26, 95, 184, 192, 52, 245, 35, 254, 238, 175, 172, 79, 123, 25, 122, 43, 120, 108, 215, 80, 128, 201, 235, 8, 153, 59, 101, 31, 198, 76, 31, 156}; const unsigned char byRSExp56[] = {106, 120, 107, 157, 164, 216, 112, 116, 2, 91, 248, 163, 36, 201, 202, 229, 6, 144, 254, 155, 135, 208, 170, 209, 12, 139, 127, 142, 182, 249, 177, 174, 190, 28, 10, 85, 239, 184, 101, 124, 152, 206, 96, 23, 163, 61, 27, 196, 247, 151, 154, 202, 207, 20, 61, 10}; const unsigned char byRSExp58[] = { 82, 116, 26, 247, 66, 27, 62, 107, 252, 182, 200, 185, 235, 55, 251, 242, 210, 144, 154, 237, 176, 141, 192, 248, 152, 249, 206, 85, 253, 142, 65, 165, 125, 23, 24, 30, 122, 240, 214, 6, 129, 218, 29, 145, 127, 134, 206, 245, 117, 29, 41, 63, 159, 142, 233, 125, 148, 123}; const unsigned char byRSExp60[] = {107, 140, 26, 12, 9, 141, 243, 197, 226, 197, 219, 45, 211, 101, 219, 120, 28, 181, 127, 6, 100, 247, 2, 205, 198, 57, 115, 219, 101, 109, 160, 82, 37, 38, 238, 49, 160, 209, 121, 86, 11, 124, 30, 181, 84, 25, 194, 87, 65, 102, 190, 220, 70, 27, 209, 16, 89, 7, 33, 240}; const unsigned char byRSExp62[] = { 65, 202, 113, 98, 71, 223, 248, 118, 214, 94, 0, 122, 37, 23, 2, 228, 58, 121, 7, 105, 135, 78, 243, 118, 70, 76, 223, 89, 72, 50, 70, 111, 194, 17, 212, 126, 181, 35, 221, 117, 235, 11, 229, 149, 147, 123, 213, 40, 115, 6, 200, 100, 26, 246, 182, 218, 127, 215, 36, 186, 110, 106}; const unsigned char byRSExp64[] = { 45, 51, 175, 9, 7, 158, 159, 49, 68, 119, 92, 123, 177, 204, 187, 254, 200, 78, 141, 149, 119, 26, 127, 53, 160, 93, 199, 212, 29, 24, 145, 156, 208, 150, 218, 209, 4, 216, 91, 47, 184, 146, 47, 140, 195, 195, 125, 242, 238, 63, 99, 108, 140, 230, 242, 31, 204, 11, 178, 243, 217, 156, 213, 231}; const unsigned char byRSExp66[] = { 5, 118, 222, 180, 136, 136, 162, 51, 46, 117, 13, 215, 81, 17, 139, 247, 197, 171, 95, 173, 65, 137, 178, 68, 111, 95, 101, 41, 72, 214, 169, 197, 95, 7, 44, 154, 77, 111, 236, 40, 121, 143, 63, 87, 80, 253, 240, 126, 217, 77, 34, 232, 106, 50, 168, 82, 76, 146, 67, 106, 171, 25, 132, 93, 45, 105}; const unsigned char byRSExp68[] = {247, 159, 223, 33, 224, 93, 77, 70, 90, 160, 32, 254, 43, 150, 84, 101, 190, 205, 133, 52, 60, 202, 165, 220, 203, 151, 93, 84, 15, 84, 253, 173, 160, 89, 227, 52, 199, 97, 95, 231, 52, 177, 41, 125, 137, 241, 166, 225, 118, 2, 54, 32, 82, 215, 175, 198, 43, 238, 235, 27, 101, 184, 127, 3, 5, 8, 163, 238}; const unsigned char *byRSExp[] = {NULL, NULL, NULL, NULL, NULL, NULL, NULL, byRSExp7, NULL, NULL, byRSExp10, NULL, NULL, byRSExp13, NULL, byRSExp15, byRSExp16, byRSExp17, byRSExp18, NULL, byRSExp20, NULL, byRSExp22, NULL, byRSExp24, NULL, byRSExp26, NULL, byRSExp28, NULL, byRSExp30, NULL, byRSExp32, NULL, byRSExp34, NULL, byRSExp36, NULL, byRSExp38, NULL, byRSExp40, NULL, byRSExp42, NULL, byRSExp44, NULL, byRSExp46, NULL, byRSExp48, NULL, byRSExp50, NULL, byRSExp52, NULL, byRSExp54, NULL, byRSExp56, NULL, byRSExp58, NULL, byRSExp60, NULL, byRSExp62, NULL, byRSExp64, NULL, byRSExp66, NULL, byRSExp68}; const unsigned char nIndicatorLenNumeral[] = {10, 12, 14}; const unsigned char nIndicatorLenAlphabet[] = { 9, 11, 13}; const unsigned char nIndicatorLen8Bit[] = { 8, 16, 16}; const unsigned char nIndicatorLenKanji[] = { 8, 10, 12}; int m_nSymbleSize; unsigned char m_byModuleData[MAX_MODULESIZE][MAX_MODULESIZE]; int m_ncDataCodeWordBit; unsigned char m_byDataCodeWord[MAX_DATACODEWORD]; int m_ncDataBlock; unsigned char m_byBlockMode[MAX_DATACODEWORD]; unsigned char m_nBlockLength[MAX_DATACODEWORD]; int m_ncAllCodeWord; unsigned char m_byAllCodeWord[MAX_ALLCODEWORD]; unsigned char m_byRSWork[MAX_CODEBLOCK]; int m_nLevel; int m_nVersion; bool m_bAutoExtent; int m_nMaskingNo; //编码数据 //lpsSource 源数据 bool EncodeData(char *lpsSource) { int i, j, nVersion=1, bAutoExtent=1, ncSource; int ncLength, nEncodeVersion, ncDataCodeWord, ncTerminater; unsigned char byPaddingCode = 0xec; int nDataCwIndex = 0, ncBlock1, ncBlock2, ncBlockSum; int nBlockNo = 0, ncDataCw1, ncDataCw2; int ncRSCw1, ncRSCw2; ncSource = 0; m_nLevel = 0; m_nMaskingNo = 0; ncLength = ncSource > 0 ? ncSource : strlen(lpsSource);//计算要编码的数据的长度 //uprintf("ncLength = %d\n",ncLength); if (ncLength == 0) return FALSE; nEncodeVersion = GetEncodeVersion(nVersion, lpsSource, ncLength);//计算编码数据需要的版本 //uprintf("nEncodeVersion = %d\n",nEncodeVersion); if (nEncodeVersion == 0) return FALSE; if (nVersion == 0) { m_nVersion = nEncodeVersion; } else { if (nEncodeVersion <= nVersion) { m_nVersion = nVersion; } else { if (bAutoExtent) m_nVersion = nEncodeVersion; else return FALSE; } } //uprintf("m_nVersion = %d\n",m_nVersion); ncDataCodeWord = QR_VersonInfo[m_nVersion].ncDataCodeWord[m_nLevel]; ncTerminater = min(4, (ncDataCodeWord * 8) - m_ncDataCodeWordBit); if (ncTerminater > 0) m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, 0, ncTerminater); for (i = (m_ncDataCodeWordBit + 7) / 8; i < ncDataCodeWord; ++i) { m_byDataCodeWord[i] = byPaddingCode; byPaddingCode = (unsigned char )(byPaddingCode == 0xec ? 0x11 : 0xec); } m_ncAllCodeWord = QR_VersonInfo[m_nVersion].ncAllCodeWord; memset(m_byAllCodeWord, 0, m_ncAllCodeWord); ncBlock1 = QR_VersonInfo[m_nVersion].RS_BlockInfo1[m_nLevel].ncRSBlock; ncBlock2 = QR_VersonInfo[m_nVersion].RS_BlockInfo2[m_nLevel].ncRSBlock; ncBlockSum = ncBlock1 + ncBlock2; ncDataCw1 = QR_VersonInfo[m_nVersion].RS_BlockInfo1[m_nLevel].ncDataCodeWord; ncDataCw2 = QR_VersonInfo[m_nVersion].RS_BlockInfo2[m_nLevel].ncDataCodeWord; for (i = 0; i < ncBlock1; ++i) { for (j = 0; j < ncDataCw1; ++j) { m_byAllCodeWord[(ncBlockSum * j) + nBlockNo] = m_byDataCodeWord[nDataCwIndex++]; } ++nBlockNo; } for (i = 0; i < ncBlock2; ++i) { for (j = 0; j < ncDataCw2; ++j) { if (j < ncDataCw1) { m_byAllCodeWord[(ncBlockSum * j) + nBlockNo] = m_byDataCodeWord[nDataCwIndex++]; } else { m_byAllCodeWord[(ncBlockSum * ncDataCw1) + i] = m_byDataCodeWord[nDataCwIndex++]; } } ++nBlockNo; } ncRSCw1 = QR_VersonInfo[m_nVersion].RS_BlockInfo1[m_nLevel].ncAllCodeWord - ncDataCw1; ncRSCw2 = QR_VersonInfo[m_nVersion].RS_BlockInfo2[m_nLevel].ncAllCodeWord - ncDataCw2; nDataCwIndex = 0; nBlockNo = 0; for (i = 0; i < ncBlock1; ++i) { memset(m_byRSWork, 0, sizeof(m_byRSWork)); memmove(m_byRSWork, m_byDataCodeWord + nDataCwIndex, ncDataCw1); GetRSCodeWord(m_byRSWork, ncDataCw1, ncRSCw1); for (j = 0; j < ncRSCw1; ++j) { m_byAllCodeWord[ncDataCodeWord + (ncBlockSum * j) + nBlockNo] = m_byRSWork[j]; } nDataCwIndex += ncDataCw1; ++nBlockNo; } for (i = 0; i < ncBlock2; ++i) { memset(m_byRSWork, 0, sizeof(m_byRSWork)); memmove(m_byRSWork, m_byDataCodeWord + nDataCwIndex, ncDataCw2); GetRSCodeWord(m_byRSWork, ncDataCw2, ncRSCw2); for (j = 0; j < ncRSCw2; ++j) { m_byAllCodeWord[ncDataCodeWord + (ncBlockSum * j) + nBlockNo] = m_byRSWork[j]; } nDataCwIndex += ncDataCw2; ++nBlockNo; } m_nSymbleSize = m_nVersion * 4 + 17; FormatModule(); return TRUE; } //每个版本长度字段的位数 //nVersion 版本 //lpsSource 源数据 //ncLength 长度 /* Number of bits per length field Encoding Ver.1–9 10–26 27–40 Numeric 10 12 14 Alphanumeric 9 11 13 Byte 8 16 16 Kanji 8 10 12 */ int GetEncodeVersion(int nVersion, char *lpsSource, int ncLength) { int nVerGroup = nVersion >= 27 ? QR_VRESION_L : (nVersion >= 10 ? QR_VRESION_M : QR_VRESION_S); int i, j; for (i = nVerGroup; i <= QR_VRESION_L; ++i) { if (EncodeSourceData(lpsSource, ncLength, i)) { if (i == QR_VRESION_S) { for (j = 1; j <= 9; ++j) { if ((m_ncDataCodeWordBit + 7) / 8 <= QR_VersonInfo[j].ncDataCodeWord[m_nLevel]) return j; } } else if (i == QR_VRESION_M) { for (j = 10; j <= 26; ++j) { if ((m_ncDataCodeWordBit + 7) / 8 <= QR_VersonInfo[j].ncDataCodeWord[m_nLevel]) return j; } } else if (i == QR_VRESION_L) { for (j = 27; j <= 40; ++j) { if ((m_ncDataCodeWordBit + 7) / 8 <= QR_VersonInfo[j].ncDataCodeWord[m_nLevel]) return j; } } } } return 0; } //模式指标，编码模式 //lpsSource 源数据 //ncLength 数据长度 //nVerGroup 版本组 //bool EncodeSourceData(char *lpsSource, int ncLength, int nVerGroup) int EncodeSourceData(char *lpsSource, int ncLength, int nVerGroup) { int i, j; int ncSrcBits, ncDstBits; int nBlock = 0; int ncComplete = 0; unsigned short wBinCode; memset(m_nBlockLength, 0, sizeof(m_nBlockLength)); for (m_ncDataBlock = i = 0; i < ncLength; ++i) { unsigned char byMode; if (i < ncLength - 1 && IsKanjiData(lpsSource[i], lpsSource[i + 1])) byMode = QR_MODE_KANJI; //日文 //else if(i < ncLength - 1 && IsChineseData(lpsSource[i], lpsSource[i + 1])) //byMode = QR_MODE_CHINESE; //中文 else if (IsNumeralData(lpsSource[i])) byMode = QR_MODE_NUMERAL; //数字 else if (IsAlphabetData(lpsSource[i])) byMode = QR_MODE_ALPHABET; //字符 else byMode = QR_MODE_8BIT; //字节 if (i == 0) m_byBlockMode[0] = byMode; // if (m_byBlockMode[m_ncDataBlock] != byMode)//如果前后两个数据的模式不一样 m_byBlockMode[++m_ncDataBlock] = byMode; ++m_nBlockLength[m_ncDataBlock]; if (byMode == QR_MODE_KANJI)//如果是日文模式，那么前后2个字节为一个汉字 { ++m_nBlockLength[m_ncDataBlock]; ++i; } } ++m_ncDataBlock; while (nBlock < m_ncDataBlock - 1) { int ncJoinFront, ncJoinBehind; int nJoinPosition = 0; if ((m_byBlockMode[nBlock] == QR_MODE_NUMERAL && m_byBlockMode[nBlock + 1] == QR_MODE_ALPHABET) || (m_byBlockMode[nBlock] == QR_MODE_ALPHABET && m_byBlockMode[nBlock + 1] == QR_MODE_NUMERAL)) {//如果前后2个数据块为字母和数字，可以合并成字母数字模式(字母模式包含了数字) 计算数据位流 ncSrcBits = GetBitLength(m_byBlockMode[nBlock], m_nBlockLength[nBlock], nVerGroup) + GetBitLength(m_byBlockMode[nBlock + 1], m_nBlockLength[nBlock + 1], nVerGroup); ncDstBits = GetBitLength(QR_MODE_ALPHABET, m_nBlockLength[nBlock] + m_nBlockLength[nBlock + 1], nVerGroup); if (ncSrcBits > ncDstBits) {//如果合并前大于合并后长度 if (nBlock >= 1 && m_byBlockMode[nBlock - 1] == QR_MODE_8BIT) {//判断之前的数据块是不是8bit模式，如果是的话合并数据(必须要有3个数据块以上判断) ncJoinFront = GetBitLength(QR_MODE_8BIT, m_nBlockLength[nBlock - 1] + m_nBlockLength[nBlock], nVerGroup) + GetBitLength(m_byBlockMode[nBlock + 1], m_nBlockLength[nBlock + 1], nVerGroup); if (ncJoinFront > ncDstBits + GetBitLength(QR_MODE_8BIT, m_nBlockLength[nBlock - 1], nVerGroup)) ncJoinFront = 0; //如果合并后的数据超过长度 非法 } else ncJoinFront = 0;//不满足合并的条件 if (nBlock < m_ncDataBlock - 2 && m_byBlockMode[nBlock + 2] == QR_MODE_8BIT) {//如果后面的数据块为8bit模式，合并数据(必须要有3个数据块以上判断) ncJoinBehind = GetBitLength(m_byBlockMode[nBlock], m_nBlockLength[nBlock], nVerGroup) + GetBitLength(QR_MODE_8BIT, m_nBlockLength[nBlock + 1] + m_nBlockLength[nBlock + 2], nVerGroup); if (ncJoinBehind > ncDstBits + GetBitLength(QR_MODE_8BIT, m_nBlockLength[nBlock + 2], nVerGroup)) ncJoinBehind = 0; //如果合并后的数据超过长度 非法 } else ncJoinBehind = 0;//不满足合并的条件 if (ncJoinFront != 0 && ncJoinBehind != 0)//前后的数据块合并后都不为0 { nJoinPosition = (ncJoinFront < ncJoinBehind) ? -1 : 1;//位置的标记，如果前面的小于后面的为-1；大于等于为1 } else {//如果有一个或者都为0 如果前面不为0为-1；后面不为0为1 否则为0 nJoinPosition = (ncJoinFront != 0) ? -1 : ((ncJoinBehind != 0) ? 1 : 0); } if (nJoinPosition != 0) {//如果合并后的数据不为0 if (nJoinPosition == -1)//前面有数据 { m_nBlockLength[nBlock - 1] += m_nBlockLength[nBlock]; for (i = nBlock; i < m_ncDataBlock - 1; ++i) { m_byBlockMode[i] = m_byBlockMode[i + 1]; m_nBlockLength[i] = m_nBlockLength[i + 1]; } } else {//后面有数据 m_byBlockMode[nBlock + 1] = QR_MODE_8BIT;//后面数据块为8BIT模式，将新的数据块模式定义成8BIT m_nBlockLength[nBlock + 1] += m_nBlockLength[nBlock + 2];//长度 for (i = nBlock + 2; i < m_ncDataBlock - 1; ++i) { m_byBlockMode[i] = m_byBlockMode[i + 1]; m_nBlockLength[i] = m_nBlockLength[i + 1]; } } --m_ncDataBlock; } else {//合并后数据异常，或者不满足合并条件 if (nBlock < m_ncDataBlock - 2 && m_byBlockMode[nBlock + 2] == QR_MODE_ALPHABET) {//如果后面一块数据也是字母数字，合并数据 m_nBlockLength[nBlock + 1] += m_nBlockLength[nBlock + 2]; for (i = nBlock + 2; i < m_ncDataBlock - 1; ++i) { m_byBlockMode[i] = m_byBlockMode[i + 1]; m_nBlockLength[i] = m_nBlockLength[i + 1]; } --m_ncDataBlock; } //设置新数据块为字母数字 m_byBlockMode[nBlock] = QR_MODE_ALPHABET; m_nBlockLength[nBlock] += m_nBlockLength[nBlock + 1]; for (i = nBlock + 1; i < m_ncDataBlock - 1; ++i) { m_byBlockMode[i] = m_byBlockMode[i + 1]; m_nBlockLength[i] = m_nBlockLength[i + 1]; } --m_ncDataBlock; //如果前面一块数据也是字母数字，合并数据 if (nBlock >= 1 && m_byBlockMode[nBlock - 1] == QR_MODE_ALPHABET) { m_nBlockLength[nBlock - 1] += m_nBlockLength[nBlock]; for (i = nBlock; i < m_ncDataBlock - 1; ++i) { m_byBlockMode[i] = m_byBlockMode[i + 1]; m_nBlockLength[i] = m_nBlockLength[i + 1]; } --m_ncDataBlock; } } continue; } } ++nBlock; } nBlock = 0; while (nBlock < m_ncDataBlock - 1) {//合并2个部分数据 ncSrcBits = GetBitLength(m_byBlockMode[nBlock], m_nBlockLength[nBlock], nVerGroup) + GetBitLength(m_byBlockMode[nBlock + 1], m_nBlockLength[nBlock + 1], nVerGroup); ncDstBits = GetBitLength(QR_MODE_8BIT, m_nBlockLength[nBlock] + m_nBlockLength[nBlock + 1], nVerGroup); if (nBlock >= 1 && m_byBlockMode[nBlock - 1] == QR_MODE_8BIT)//前一数据块为BIT模式 ncDstBits -= (4 + nIndicatorLen8Bit[nVerGroup]); if (nBlock < m_ncDataBlock - 2 && m_byBlockMode[nBlock + 2] == QR_MODE_8BIT) ncDstBits -= (4 + nIndicatorLen8Bit[nVerGroup]); if (ncSrcBits > ncDstBits) {//如果合并后数据增加，前一块数据是8bit数据 if (nBlock >= 1 && m_byBlockMode[nBlock - 1] == QR_MODE_8BIT) { m_nBlockLength[nBlock - 1] += m_nBlockLength[nBlock]; for (i = nBlock; i < m_ncDataBlock - 1; ++i) { m_byBlockMode[i] = m_byBlockMode[i + 1]; m_nBlockLength[i] = m_nBlockLength[i + 1]; } --m_ncDataBlock; --nBlock; } if (nBlock < m_ncDataBlock - 2 && m_byBlockMode[nBlock + 2] == QR_MODE_8BIT) {//数据块+2也是8bit m_nBlockLength[nBlock + 1] += m_nBlockLength[nBlock + 2]; for (i = nBlock + 2; i < m_ncDataBlock - 1; ++i) { m_byBlockMode[i] = m_byBlockMode[i + 1]; m_nBlockLength[i] = m_nBlockLength[i + 1]; } --m_ncDataBlock; } //设置新的数据块为8BIT模式 m_byBlockMode[nBlock] = QR_MODE_8BIT; m_nBlockLength[nBlock] += m_nBlockLength[nBlock + 1]; for (i = nBlock + 1; i < m_ncDataBlock - 1; ++i) { m_byBlockMode[i] = m_byBlockMode[i + 1]; m_nBlockLength[i] = m_nBlockLength[i + 1]; } --m_ncDataBlock; if (nBlock >= 1) --nBlock; continue; } ++nBlock; } m_ncDataCodeWordBit = 0; memset(m_byDataCodeWord, 0, MAX_DATACODEWORD); for (i = 0; i < m_ncDataBlock && m_ncDataCodeWordBit != -1; ++i) { if (m_byBlockMode[i] == QR_MODE_NUMERAL) {//如果数据块是数字模式 m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, 1, 4); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, (unsigned short)m_nBlockLength[i], nIndicatorLenNumeral[nVerGroup]); for (j = 0; j < m_nBlockLength[i]; j += 3) { if (j < m_nBlockLength[i] - 2) { wBinCode = (unsigned short)(((lpsSource[ncComplete + j] - '0') * 100) + ((lpsSource[ncComplete + j + 1] - '0') * 10) + (lpsSource[ncComplete + j + 2] - '0')); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, wBinCode, 10); } else if (j == m_nBlockLength[i] - 2) { wBinCode = (unsigned short)(((lpsSource[ncComplete + j] - '0') * 10) + (lpsSource[ncComplete + j + 1] - '0')); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, wBinCode, 7); } else if (j == m_nBlockLength[i] - 1) { wBinCode = (unsigned short)(lpsSource[ncComplete + j] - '0'); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, wBinCode, 4); } } ncComplete += m_nBlockLength[i]; } else if (m_byBlockMode[i] == QR_MODE_ALPHABET) { m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, 2, 4); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, (unsigned short)m_nBlockLength[i], nIndicatorLenAlphabet[nVerGroup]); for (j = 0; j < m_nBlockLength[i]; j += 2) { if (j < m_nBlockLength[i] - 1) { wBinCode = (unsigned short)((AlphabetToBinaly(lpsSource[ncComplete + j]) * 45) + AlphabetToBinaly(lpsSource[ncComplete + j + 1])); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, wBinCode, 11); } else { wBinCode = (unsigned short)AlphabetToBinaly(lpsSource[ncComplete + j]); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, wBinCode, 6); } } ncComplete += m_nBlockLength[i]; } else if (m_byBlockMode[i] == QR_MODE_8BIT) { m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, 4, 4); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, (unsigned short)m_nBlockLength[i], nIndicatorLen8Bit[nVerGroup]); for (j = 0; j < m_nBlockLength[i]; ++j) { m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, (unsigned short)lpsSource[ncComplete + j], 8); } ncComplete += m_nBlockLength[i]; } else// if(m_byBlockMode[i] == QR_MODE_KANJI) {//日本模式 m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, 8, 4); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, (unsigned short)(m_nBlockLength[i] / 2), nIndicatorLenKanji[nVerGroup]); for (j = 0; j < m_nBlockLength[i] / 2; ++j) { unsigned short wBinCode = KanjiToBinaly((unsigned short)(((unsigned char)lpsSource[ncComplete + (j * 2)] << 8) + (unsigned char)lpsSource[ncComplete + (j * 2) + 1])); m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, wBinCode, 13); } ncComplete += m_nBlockLength[i]; } // else // {//中文模式 // m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, 8, 4); // m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, (WORD)(m_nBlockLength[i] / 2), nIndicatorLenKanji[nVerGroup]); // for (j = 0; j < m_nBlockLength[i] / 2; ++j) // { // WORD wBinCode = ChineseToBinaly((WORD)(((BYTE)lpsSource[ncComplete + (j * 2)] << 8) + (BYTE)lpsSource[ncComplete + (j * 2) + 1])); // m_ncDataCodeWordBit = SetBitStream(m_ncDataCodeWordBit, wBinCode, 13); // } // ncComplete += m_nBlockLength[i]; // } } return (m_ncDataCodeWordBit != -1); //return TRUE; } //获取bit长度 int GetBitLength(unsigned char nMode, int ncData, int nVerGroup) { int ncBits = 0; switch (nMode) { case QR_MODE_NUMERAL: ncBits = 4 + nIndicatorLenNumeral[nVerGroup] + (10 * (ncData / 3)); switch (ncData % 3) { case 1: ncBits += 4; break; case 2: ncBits += 7; break; default: break; } break; case QR_MODE_ALPHABET: ncBits = 4 + nIndicatorLenAlphabet[nVerGroup] + (11 * (ncData / 2)) + (6 * (ncData % 2)); break; case QR_MODE_8BIT: ncBits = 4 + nIndicatorLen8Bit[nVerGroup] + (8 * ncData); break; default: //ncBits = 4 + nIndicatorLenKanji[nVerGroup] + (13 * (ncData / 2));//本程序写法？ ncBits = 4 + nIndicatorLenKanji[nVerGroup] + (13 * ncData);//文档算法 break; } return ncBits; } //设置bit流 int SetBitStream(int nIndex, unsigned short wData, int ncData) { int i; if (nIndex == -1 || nIndex + ncData > MAX_DATACODEWORD * 8) return -1; for (i = 0; i < ncData; ++i) { if (wData & (1 << (ncData - i - 1))) { m_byDataCodeWord[(nIndex + i) / 8] |= 1 << (7 - ((nIndex + i) % 8)); } } return nIndex + ncData; } //是不是数字编码信息 //是返回TRUE，否返回FALSE bool IsNumeralData(unsigned char c) { if (c >= '0' && c <= '9') return TRUE; return FALSE; } //是否是字符编码信息 //是返回TRUE，否返回FALSE bool IsAlphabetData(unsigned char c) { if (c >= '0' && c <= '9') return TRUE; if (c >= 'A' && c <= 'Z') return TRUE; if (c == ' ' || c == '$' || c == '%' || c == '*' || c == '+' || c == '-' || c == '.' || c == '/' || c == ':') return TRUE; return FALSE; } //是否中文汉字信息 //是返回TRUE，否返回FALSE bool IsKanjiData(unsigned char c1, unsigned char c2) { if (((c1 >= 0x81 && c1 <= 0x9f) || (c1 >= 0xe0 && c1 <= 0xeb)) && (c2 >= 0x40)) { if ((c1 == 0x9f && c2 > 0xfc) || (c1 == 0xeb && c2 > 0xbf)) return FALSE; return TRUE; } return FALSE; } bool IsChineseData(unsigned char c1, unsigned char c2) { //中文模式 if((c1 >= 0xa1 && c1 < 0xaa) || (c1 >= 0xb0 && c1 <= 0xfa)) { if(c2 >= 0xa1 && c2 <= 0xfe) return TRUE; } return FALSE; } //字母表信息转化 unsigned char AlphabetToBinaly(unsigned char c) { if (c >= '0' && c <= '9') return (unsigned char)(c - '0'); if (c >= 'A' && c <= 'Z') return (unsigned char)(c - 'A' + 10); if (c == ' ') return 36; if (c == '$') return 37; if (c == '%') return 38; if (c == '*') return 39; if (c == '+') return 40; if (c == '-') return 41; if (c == '.') return 42; if (c == '/') return 43; return 44; } //日文中文信息转化 //日文和汉字的编码会减去一个值。 //如：在0X8140 to 0X9FFC中的字符会减去8140， //在0XE040到0XEBBF中的字符要减去0XC140， //然后把结果前两个16进制位拿出来乘以0XC0， //然后再加上后两个16进制位，最后转成13bit的编码。 unsigned short KanjiToBinaly(unsigned short wc) { if (wc >= 0x8140 && wc <= 0x9ffc) wc -= 0x8140; else wc -= 0xc140; return (unsigned short)(((wc >> 8) * 0xc0) + (wc & 0x00ff)); } /* 二、中文汉字的与日文汉字转换步骤相似： 1、对于第一字节为0xA1~0xAA之间,第二字节在0xA1~0xFE之间字符： a)第一字节减去0xA1； b)上一步结果乘以0x60; c）第二字节减去0xA1; d)将b)步骤的结果加上c步骤的结果; e)将结果转换为13位二进制串。 1、对于第一字节为0xB0~0xFA之间,第二字节在0xA1~0xFE之间字符： a)第一字节减去0xA6； b)上一步结果乘以0x60; c）第二字节减去0xA1; d)将b)步骤的结果加上c步骤的结果; e)将结果转换为13位二进制串 */ unsigned short ChineseToBinaly(unsigned short wc) { if(wc >= 0xa1a1 && wc <= 0xa9fe) { return (unsigned short)((((wc >> 8)-0xa1) * 0x60) + ((wc & 0x00ff)-0xa1)); } if(wc >= 0xb0a1 && wc <= 0xf9fe) { return (unsigned short)((((wc >> 8)-0xa6) * 0x60) + ((wc & 0x00ff)-0xa1)); } return (unsigned short)((((wc >> 8)-0xa6) * 0x60) + ((wc & 0x00ff)-0xa1)); } //纠错码 void GetRSCodeWord(unsigned char *lpbyRSWork, int ncDataCodeWord, int ncRSCodeWord) { int i, j; for (i = 0; i < ncDataCodeWord ; ++i) { if (lpbyRSWork[0] != 0) { unsigned char nExpFirst = byIntToExp[lpbyRSWork[0]]; for (j = 0; j < ncRSCodeWord; ++j) { unsigned char nExpElement = (unsigned char)(((int)(byRSExp[ncRSCodeWord][j] + nExpFirst)) % 255); lpbyRSWork[j] = (unsigned char)(lpbyRSWork[j + 1] ^ byExpToInt[nExpElement]); } for (j = ncRSCodeWord; j < ncDataCodeWord + ncRSCodeWord - 1; ++j) lpbyRSWork[j] = lpbyRSWork[j + 1]; } else { for (j = 0; j < ncDataCodeWord + ncRSCodeWord - 1; ++j) lpbyRSWork[j] = lpbyRSWork[j + 1]; } } } //格式化数据存放，存在于所有的尺寸中， //详见http://coolshell.cn/articles/10590.html#jtss-tsina void FormatModule(void) { int i, j; int nMinPenalty, nPenalty; memset(m_byModuleData, 0, sizeof(m_byModuleData)); SetFunctionModule(); //首先把回字图案花在三个角上 SetCodeWordPattern(); // if (m_nMaskingNo == -1) { m_nMaskingNo = 0; SetMaskingPattern(m_nMaskingNo); SetFormatInfoPattern(m_nMaskingNo); nMinPenalty = CountPenalty(); for (i = 1; i <= 7; ++i) { SetMaskingPattern(i); SetFormatInfoPattern(i); nPenalty = CountPenalty(); if (nPenalty < nMinPenalty) { nMinPenalty = nPenalty; m_nMaskingNo = i; } } } SetMaskingPattern(m_nMaskingNo); SetFormatInfoPattern(m_nMaskingNo); for (i = 0; i < m_nSymbleSize; ++i) { for (j = 0; j < m_nSymbleSize; ++j) { m_byModuleData[i][j] = (unsigned char)((m_byModuleData[i][j] & 0x11) != 0); } } } //设置功能性模块信息 //Position Detection Pattern 用于标记二维码举行大小 //Separators for Postion Detection Patterns 三个就可以标记一个矩形 //Timing Patterns也是用于定位的。原因是二维码有40种尺寸，尺寸过大了后需要有根标准线，不然扫描的时候可能会扫歪了 //Alignment Patterns 只有Version 2以上（包括Version2）的二维码需要这个东东，同样是为了定位用的。 void SetFunctionModule(void) { int i, j; SetFinderPattern(0, 0); //三个回字坐标 SetFinderPattern(m_nSymbleSize - 7, 0); SetFinderPattern(0, m_nSymbleSize - 7); for (i = 0; i < 8; ++i) { m_byModuleData[i][7] = m_byModuleData[7][i] = '\x20'; m_byModuleData[m_nSymbleSize - 8][i] = m_byModuleData[m_nSymbleSize - 8 + i][7] = '\x20'; m_byModuleData[i][m_nSymbleSize - 8] = m_byModuleData[7][m_nSymbleSize - 8 + i] = '\x20'; } for (i = 0; i < 9; ++i) { m_byModuleData[i][8] = m_byModuleData[8][i] = '\x20'; } for (i = 0; i < 8; ++i) { m_byModuleData[m_nSymbleSize - 8 + i][8] = m_byModuleData[8][m_nSymbleSize - 8 + i] = '\x20'; } SetVersionPattern(); //版本信息 for (i = 0; i < QR_VersonInfo[m_nVersion].ncAlignPoint; ++i) { SetAlignmentPattern(QR_VersonInfo[m_nVersion].nAlignPoint[i], 6);//小回字 SetAlignmentPattern(6, QR_VersonInfo[m_nVersion].nAlignPoint[i]); for (j = 0; j < QR_VersonInfo[m_nVersion].ncAlignPoint; ++j) { SetAlignmentPattern(QR_VersonInfo[m_nVersion].nAlignPoint[i], QR_VersonInfo[m_nVersion].nAlignPoint[j]); } } for (i = 8; i <= m_nSymbleSize - 9; ++i) { m_byModuleData[i][6] = (i % 2) == 0 ? '\x30' : '\x20'; m_byModuleData[6][i] = (i % 2) == 0 ? '\x30' : '\x20'; } } //设置大回字信息 // O X X X X X X X // O X O O O O O X // O X O X X X O X // O X O X X X O X // O X O X X X O X // O X O O O O O X // O X X X X X X X void SetFinderPattern(int x, int y) { static unsigned char byPattern[] = {0x7f, 0x41, 0x5d, 0x5d, 0x5d, 0x41, 0x7f}; int i, j; for (i = 0; i < 7; ++i) { for (j = 0; j < 7; ++j) { m_byModuleData[x + j][y + i] = (byPattern[i] & (1 << (6 - j))) ? '\x30' : '\x20'; } } } //设置小回字信息 //Alignment Patterns 只有Version 2以上（包括Version2）的二维码需要这个东东，同样是为了定位用的。 //Alignment Patterns是除了3个大的回字，较小的回字 // O O O X X X X X // O O O X O O O X // O O O X O X O X // O O O X O O O X // O O O X X X X X void SetAlignmentPattern(int x, int y) { static unsigned char byPattern[] = {0x1f, 0x11, 0x15, 0x11, 0x1f}; int i, j; if (m_byModuleData[x][y] & 0x20) return; x -= 2; y -= 2; for (i = 0; i < 5; ++i) { for (j = 0; j < 5; ++j) { m_byModuleData[x + j][y + i] = (byPattern[i] & (1 << (4 - j))) ? '\x30' : '\x20'; } } } //设置版本，在 >= Version 7以上，需要预留两块3 x 6的区域存放一些版本信息。 void SetVersionPattern(void) { int i, j; int nVerData; if (m_nVersion <= 6)//在 >= Version 7以上，需要预留两块3 x 6的区域存放一些版本信息。 return; nVerData = m_nVersion << 12; for (i = 0; i < 6; ++i) { if (nVerData & (1 << (17 - i))) { nVerData ^= (0x1f25 << (5 - i)); } } nVerData += m_nVersion << 12; for (i = 0; i < 6; ++i) { for (j = 0; j < 3; ++j) { m_byModuleData[m_nSymbleSize - 11 + j][i] = m_byModuleData[i][m_nSymbleSize - 11 + j] = (nVerData & (1 << (i * 3 + j))) ? '\x30' : '\x20'; } } } //如果你以为我们可以开始画图，你就错了。 //二维码的混乱技术还没有玩完，它还要把数据码和纠错码的各个codewords交替放在一起。 //如何交替呢，规则如下： //对于数据码：把每个块的第一个codewords先拿出来按顺度排列好， //然后再取第一块的第二个，如此类推。如：上述示例中的Data Codewords如下 void SetCodeWordPattern(void) { int x = m_nSymbleSize; int y = m_nSymbleSize - 1; int nCoef_x = 1; int nCoef_y = 1; int i, j; for (i = 0; i < m_ncAllCodeWord; ++i) { for (j = 0; j < 8; ++j) { do { x += nCoef_x; nCoef_x *= -1; if (nCoef_x < 0) { y += nCoef_y; if (y < 0 || y == m_nSymbleSize) { y = (y < 0) ? 0 : m_nSymbleSize - 1; nCoef_y *= -1; x -= 2; if (x == 6) --x; } } } while (m_byModuleData[x][y] & 0x20); m_byModuleData[x][y] = (m_byAllCodeWord[i] & (1 << (7 - j))) ? '\x02' : '\x00'; } } } //设置遮蔽信息 void SetMaskingPattern(int nPatternNo) { int i, j; bool bMask; for (i = 0; i < m_nSymbleSize; ++i) { for (j = 0; j < m_nSymbleSize; ++j) { if (! (m_byModuleData[j][i] & 0x20)) { switch (nPatternNo) { case 0: bMask = ((i + j) % 2 == 0)?TRUE:FALSE; break; case 1: bMask = (i % 2 == 0)?TRUE:FALSE; break; case 2: bMask = (j % 3 == 0)?TRUE:FALSE; break; case 3: bMask = ((i + j) % 3 == 0)?TRUE:FALSE; break; case 4: bMask = (((i / 2) + (j / 3)) % 2 == 0)?TRUE:FALSE; break; case 5: bMask = (((i * j) % 2) + ((i * j) % 3) == 0)?TRUE:FALSE; break; case 6: bMask = ((((i * j) % 2) + ((i * j) % 3)) % 2 == 0)?TRUE:FALSE; break; default: bMask = ((((i * j) % 3) + ((i + j) % 2)) % 2 == 0)?TRUE:FALSE; break; } m_byModuleData[j][i] = (unsigned char)((m_byModuleData[j][i] & 0xfe) | (((m_byModuleData[j][i] & 0x02) > 1) ^ bMask)); } } } } //设置格式化信息 void SetFormatInfoPattern(int nPatternNo) { int nFormatInfo; int i; int nFormatData; switch (m_nLevel) { case QR_LEVEL_M: nFormatInfo = 0x00; break; case QR_LEVEL_L: nFormatInfo = 0x08; break; case QR_LEVEL_Q: nFormatInfo = 0x18; break; default: nFormatInfo = 0x10; break; } nFormatInfo += nPatternNo; nFormatData = nFormatInfo << 10; for (i = 0; i < 5; ++i) { if (nFormatData & (1 << (14 - i))) { nFormatData ^= (0x0537 << (4 - i)); } } nFormatData += nFormatInfo << 10; nFormatData ^= 0x5412; for (i = 0; i <= 5; ++i) m_byModuleData[8][i] = (nFormatData & (1 << i)) ? '\x30' : '\x20'; m_byModuleData[8][7] = (nFormatData & (1 << 6)) ? '\x30' : '\x20'; m_byModuleData[8][8] = (nFormatData & (1 << 7)) ? '\x30' : '\x20'; m_byModuleData[7][8] = (nFormatData & (1 << 8)) ? '\x30' : '\x20'; for (i = 9; i <= 14; ++i) m_byModuleData[14 - i][8] = (nFormatData & (1 << i)) ? '\x30' : '\x20'; for (i = 0; i <= 7; ++i) m_byModuleData[m_nSymbleSize - 1 - i][8] = (nFormatData & (1 << i)) ? '\x30' : '\x20'; m_byModuleData[8][m_nSymbleSize - 8] = '\x30'; for (i = 8; i <= 14; ++i) m_byModuleData[8][m_nSymbleSize - 15 + i] = (nFormatData & (1 << i)) ? '\x30' : '\x20'; } int CountPenalty(void) { int nPenalty = 0; int i, j, k; int nCount = 0, s_nCount; for (i = 0; i < m_nSymbleSize; ++i) { for (j = 0; j < m_nSymbleSize - 4; ++j) { int nCount = 1; for (k = j + 1; k < m_nSymbleSize; k++) { if (((m_byModuleData[i][j] & 0x11) == 0) == ((m_byModuleData[i][k] & 0x11) == 0)) ++nCount; else break; } if (nCount >= 5) { nPenalty += 3 + (nCount - 5); } j = k - 1; } } for (i = 0; i < m_nSymbleSize; ++i) { for (j = 0; j < m_nSymbleSize - 4; ++j) { int nCount = 1; for (k = j + 1; k < m_nSymbleSize; k++) { if (((m_byModuleData[j][i] & 0x11) == 0) == ((m_byModuleData[k][i] & 0x11) == 0)) ++nCount; else break; } if (nCount >= 5) { nPenalty += 3 + (nCount - 5); } j = k - 1; } } for (i = 0; i < m_nSymbleSize - 1; ++i) { for (j = 0; j < m_nSymbleSize - 1; ++j) { if ((((m_byModuleData[i][j] & 0x11) == 0) == ((m_byModuleData[i + 1][j] & 0x11) == 0)) && (((m_byModuleData[i][j] & 0x11) == 0) == ((m_byModuleData[i] [j + 1] & 0x11) == 0)) && (((m_byModuleData[i][j] & 0x11) == 0) == ((m_byModuleData[i + 1][j + 1] & 0x11) == 0))) { nPenalty += 3; } } } for (i = 0; i < m_nSymbleSize; ++i) { for (j = 0; j < m_nSymbleSize - 6; ++j) { if (((j == 0) || (! (m_byModuleData[i][j - 1] & 0x11))) && // 柧 傑偨偼 僔儞儃儖奜 ( m_byModuleData[i][j] & 0x11) && // 埫 - 1 (! (m_byModuleData[i][j + 1] & 0x11)) && // 柧 - 1 ( m_byModuleData[i][j + 2] & 0x11) && // 埫 劉 ( m_byModuleData[i][j + 3] & 0x11) && // 埫 劆3 ( m_byModuleData[i][j + 4] & 0x11) && // 埫 劊 (! (m_byModuleData[i][j + 5] & 0x11)) && // 柧 - 1 ( m_byModuleData[i][j + 6] & 0x11) && // 埫 - 1 ((j == m_nSymbleSize - 7) || (! (m_byModuleData[i][j + 7] & 0x11)))) // 柧 傑偨偼 僔儞儃儖奜 { if (((j < 2 || ! (m_byModuleData[i][j - 2] & 0x11)) && (j < 3 || ! (m_byModuleData[i][j - 3] & 0x11)) && (j < 4 || ! (m_byModuleData[i][j - 4] & 0x11))) || ((j >= m_nSymbleSize - 8 || ! (m_byModuleData[i][j + 8] & 0x11)) && (j >= m_nSymbleSize - 9 || ! (m_byModuleData[i][j + 9] & 0x11)) && (j >= m_nSymbleSize - 10 || ! (m_byModuleData[i][j + 10] & 0x11)))) { nPenalty += 40; } } } } for (i = 0; i < m_nSymbleSize; ++i) { for (j = 0; j < m_nSymbleSize - 6; ++j) { if (((j == 0) || (! (m_byModuleData[j - 1][i] & 0x11))) && // 柧 傑偨偼 僔儞儃儖奜 ( m_byModuleData[j] [i] & 0x11) && // 埫 - 1 (! (m_byModuleData[j + 1][i] & 0x11)) && // 柧 - 1 ( m_byModuleData[j + 2][i] & 0x11) && // 埫 劉 ( m_byModuleData[j + 3][i] & 0x11) && // 埫 劆3 ( m_byModuleData[j + 4][i] & 0x11) && // 埫 劊 (! (m_byModuleData[j + 5][i] & 0x11)) && // 柧 - 1 ( m_byModuleData[j + 6][i] & 0x11) && // 埫 - 1 ((j == m_nSymbleSize - 7) || (! (m_byModuleData[j + 7][i] & 0x11)))) // 柧 傑偨偼 僔儞儃儖奜 { if (((j < 2 || ! (m_byModuleData[j - 2][i] & 0x11)) && (j < 3 || ! (m_byModuleData[j - 3][i] & 0x11)) && (j < 4 || ! (m_byModuleData[j - 4][i] & 0x11))) || ((j >= m_nSymbleSize - 8 || ! (m_byModuleData[j + 8][i] & 0x11)) && (j >= m_nSymbleSize - 9 || ! (m_byModuleData[j + 9][i] & 0x11)) && (j >= m_nSymbleSize - 10 || ! (m_byModuleData[j + 10][i] & 0x11)))) { nPenalty += 40; } } } } for (i = 0; i < m_nSymbleSize; ++i) { for (j = 0; j < m_nSymbleSize; ++j) { if (! (m_byModuleData[i][j] & 0x11)) { ++nCount; } } } if( (50 - ((nCount * 100) / (m_nSymbleSize * m_nSymbleSize))) > 0) s_nCount = 50 - ((nCount * 100) / (m_nSymbleSize * m_nSymbleSize)); else s_nCount = 0 - (50 - ((nCount * 100) / (m_nSymbleSize * m_nSymbleSize))); nPenalty += (s_nCount / 5) * 10; return nPenalty; } void Print_2DCode(void) { int i,j,k,x,y,z,size,mod; unsigned char bit_h,bit_v,print_num;//print_buff[1024]; unsigned char print_buff[256]; //-- SendCmd(3, 0x1b, 0x4a, 25); bit_h = 4; bit_v = 2; size = m_nSymbleSize/bit_v; mod = m_nSymbleSize%bit_v; print_num = bit_h * m_nSymbleSize; for(i=0; i