token和md5
引言:
token 和 md5 是两种不同的验证方式
定义：token 是用户登录后由服务器生成的、具有时效性的身份认证字符串。
定义：md5 是对文件内容进行 MD5 哈希算法计算后得到的唯一指纹值（32位十六进制字符串）。
token 代表“用户是谁”，用于身份认证和权限校验。
md5 代表“文件内容是什么”，用于文件唯一性判断和秒传。
业务场景中使用到的token和md5
①秒传的入口函数
// 秒传接口主流程
int ApiMd5(string &url, string &post_data, string &str_json)
{UNUSED(url);// 解析json中信息/** {user:xxxx,token: xxxx,md5:xxx,fileName: xxx}*/string user;string md5;string token;string filename;int ret = 0;ret = decodeMd5Json(post_data, user, token, md5, filename); //解析json中信息if (ret < 0){LOG_ERROR << "decodeMd5Json() err";encodeMd5Json((int)Md5Failed, str_json); return 0;}// 验证登陆token，成返回0，失败-1ret = VerifyToken(user, token); // if (ret == 0){ handleDealMd5(user.c_str(), md5.c_str(), filename.c_str(), str_json); //秒传处理return 0;}else{LOG_ERROR << "VerifyToken failed";encodeMd5Json(HTTP_RESP_TOKEN_ERR, str_json); // token验证失败错误码return 0;}
}② 解析MD5相关的json，提取用户名、token、md5、文件名
// 解析MD5相关的json，提取用户名、token、md5、文件名
int decodeMd5Json(string &str_json, string &user_name, string &token, string &md5, string &filename)
{bool res;Json::Value root;Json::Reader jsonReader;res = jsonReader.parse(str_json, root);if (!res){LOG_ERROR << "parse md5 json failed ";return -1;}if (root["user"].isNull()){LOG_ERROR << "user null\n";return -1;}user_name = root["user"].asString();if (root["token"].isNull()){LOG_ERROR << "token null\n";return -1;}token = root["token"].asString();if (root["md5"].isNull()){LOG_ERROR << "md5 null\n";return -1;}md5 = root["md5"].asString();if (root["filename"].isNull()){LOG_ERROR << "filename null\n";return -1;}filename = root["filename"].asString();return 0;
}③如果ret<0 说明 token 或md5 验证失败 则进行注册封装,如果成功则跳过这步
// 封装MD5处理结果为json字符串
int encodeMd5Json(int ret, string &str_json)
{Json::Value root;root["code"] = ret;Json::FastWriter writer;str_json = writer.write(root);return 0;
}④在redis中验证登录token
int VerifyToken(string &user_name, string &token)
{ int ret = 0;CacheManager *pCacheManager = CacheManager::getInstance();// increase message countCacheConn *pCacheConn = pCacheManager->GetCacheConn("token");AUTO_REAL_CACHECONN(pCacheManager, pCacheConn);if (pCacheConn){string tmp_token = pCacheConn->get(user_name);if (tmp_token == token){ret = 0;}else{ret = -1;}}else{ret = -1;}return ret;
}⑤验证成功返回0则执行秒传处理主流程 验证失败返回-1 失败则跳过
// 秒传处理主流程
void handleDealMd5(const char *user, const char *md5, const char *filename, string &str_json)
{Md5State md5_state = Md5Failed;int ret = 0;int file_ref_count = 0;int user_file_count = 0;char sql_cmd[SQL_MAX_LEN] = {0};CDBManager *pDBManager = CDBManager::getInstance();CDBConn *pDBConn = pDBManager->GetDBConn("tuchuang_slave");AUTO_REAL_DBCONN(pDBManager, pDBConn);// 1. 查询 file_info 表，获取该md5文件的引用计数sprintf(sql_cmd, "select count from file_info where md5 = '%s'", md5);LOG_INFO << "执行: " << sql_cmd;file_ref_count = 0;ret = GetResultOneCount(pDBConn, sql_cmd, file_ref_count); //执行sql语句LOG_INFO << "ret: " << ret << ", file_ref_count: " << file_ref_count;if (ret == 0) //有结果, 并且返回 file_info被引用的计数 file_ref_count{// 2. 检查用户是否已经拥有该文件sprintf(sql_cmd, "select * from user_file_list where user = '%s' and md5 = '%s' and file_name = '%s'", user, md5, filename);LOG_INFO << "执行: " << sql_cmd;ret = CheckwhetherHaveRecord(pDBConn, sql_cmd); // 检测个人是否有记录if (ret == 1) // 已存在{LOG_WARN << "user: " << user << "-> filename: " << filename << ", md5: " << md5 << "已存在";md5_state = Md5FileExit; // 此用户已经有该文件了，不能重复上传goto END;}// 3. 更新 file_info 的 count 字段 +1sprintf(sql_cmd, "update file_info set count = %d where md5 = '%s'", file_ref_count + 1, md5); LOG_INFO << "执行: " << sql_cmd;if (!pDBConn->ExecutePassQuery(sql_cmd)){LOG_ERROR << sql_cmd << "操作失败";md5_state = Md5Failed; // 更新文件引用计数失败goto END;}// 4. 向 user_file_list 插入一条新记录struct timeval tv;struct tm *ptm;char time_str[128];gettimeofday(&tv, NULL);ptm = localtime(&tv.tv_sec);strftime(time_str, sizeof(time_str), "%Y-%m-%d %H:%M:%S", ptm);sprintf(sql_cmd, "insert into user_file_list(user, md5, create_time, file_name, shared_status, pv) values ('%s', '%s', '%s', '%s', %d, %d)", user, md5, time_str, filename, 0, 0);LOG_INFO << "执行: " << sql_cmd;if (!pDBConn->ExecuteCreate(sql_cmd)){LOG_ERROR << sql_cmd << "操作失败";md5_state = Md5Failed;// 恢复引用计数sprintf(sql_cmd, "update file_info set count = %d where md5 = '%s'", file_ref_count, md5); LOG_INFO << "执行: " << sql_cmd;if (!pDBConn->ExecutePassQuery(sql_cmd)){LOG_ERROR << sql_cmd << "操作失败";}goto END;}// 5. 查询用户文件数量sprintf(sql_cmd, "select count from user_file_count where user = '%s'", user);LOG_INFO << "执行: " << sql_cmd;user_file_count = 0;ret = GetResultOneCount(pDBConn, sql_cmd, user_file_count);if (ret == 1) // 没有记录{// 6. 插入用户文件数量记录sprintf(sql_cmd, " insert into user_file_count (user, count) values('%s', %d)", user, 1);}else if (ret == 0){// 7. 更新用户文件数量 count 字段sprintf(sql_cmd, "update user_file_count set count = %d where user = '%s'", user_file_count + 1, user);} else{LOG_ERROR << sql_cmd << " 操作失败";md5_state = Md5Failed; // 如果这里还是失败，还是要恢复文件的引用计数// 恢复引用计数sprintf(sql_cmd, "update file_info set count = %d where md5 = '%s'", file_ref_count, md5); LOG_INFO << "执行: " << sql_cmd;if (!pDBConn->ExecutePassQuery(sql_cmd)){LOG_ERROR << sql_cmd << "操作失败";}goto END;}LOG_INFO << "执行: " << sql_cmd;if (pDBConn->ExecutePassQuery(sql_cmd) != 0){LOG_ERROR << sql_cmd << " 操作失败";md5_state = Md5Failed; // 如果这里还是失败，还是要恢复文件的引用计数// 恢复引用计数sprintf(sql_cmd, "update file_info set count = %d where md5 = '%s'", file_ref_count, md5); LOG_INFO << "执行: " << sql_cmd;if (!pDBConn->ExecutePassQuery(sql_cmd)){LOG_ERROR << sql_cmd << "操作失败";}goto END;}md5_state = Md5Ok;}else //没有结果，秒传失败{LOG_INFO << "秒传失败";md5_state = Md5Failed;goto END;}END:/*秒传文件：秒传成功： {"code": 0}秒传失败： {"code":1}文件已存在：{"code": 5}*/int code = (int)md5_state;encodeMd5Json(code, str_json);
}handleDealMd5 用于实现文件秒传的数据库操作和业务判断，让用户无需重复上传已存在的文件，只需登记引用关系即可
⑥token和md5整体的业务流程图
开始|v
解析 JSON（decodeMd5Json）||-- 失败 --> 记录日志，返回 {"code": 1}（Md5Failed），结束|v
验证 token（VerifyToken）||-- 失败 --> 记录日志，返回 {"code": 4}（HTTP_RESP_TOKEN_ERR），结束|v
调用 handleDealMd5 处理秒传||-- 秒传成功 --> 返回 {"code": 0}（Md5Ok），结束|-- 文件已存在 --> 返回 {"code": 5}（Md5FileExit），结束|-- 秒传失败 --> 返回 {"code": 1}（Md5Failed），结束md5算法——给文件加密
.h
//
// Created by kanekiken on 2024/11/30.
//#ifndef UNTITLED1_MD5_H
#define UNTITLED1_MD5_H#endif // UNTITLED1_MD5_H
#pragma once/* typedef a 32 bit type */
typedef unsigned long int UINT4;/* Data structure for MD5 (Message Digest) computation */
typedef struct
{UINT4 i[2]; /* number of _bits_ handled mod 2^64 */UINT4 buf[4]; /* scratch buffer */unsigned char in[64]; /* input buffer */unsigned char digest[16]; /* actual digest after MD5Final call */
} MD5_CTX;void MD5Init(MD5_CTX *mdContext);
void MD5Update(MD5_CTX *mdContext, unsigned char *inBuf, unsigned int inLen);
void MD5Final(MD5_CTX *mdContext);
static void Transform(UINT4 *buf, UINT4 *in);
// 指定一个文件的路径path，根据文件内容计算出一个md5加密串
char *MD5_file(const char *path, int md5_len = 32);
// 从原始的字符串，得到加密后的md5串
char *MD5(const char *buf, int md5_len = 32);
// 把32位的md5串，处理成unsigned int返回
unsigned int getMD5(const char *buf);
.cpp
//
// Created by kanekiken on 2024/12/1.
//#include "md5.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>#if 1/* forward declaration */
static void Transform();static unsigned char PADDING[64] = {0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};/* F, G and H are basic MD5 functions: selection, majority, parity */
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
#define H(x, y, z) ((x) ^ (y) ^ (z))
#define I(x, y, z) ((y) ^ ((x) | (~z)))/* ROTATE_LEFT rotates x left n bits */
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))/* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
/* Rotation is separate from addition to prevent recomputation */
#define FF(a, b, c, d, x, s, ac) \{ \(a) += F((b), (c), (d)) + (x) + (UINT4)(ac); \(a) = ROTATE_LEFT((a), (s)); \(a) += (b); \}
#define GG(a, b, c, d, x, s, ac) \{ \(a) += G((b), (c), (d)) + (x) + (UINT4)(ac); \(a) = ROTATE_LEFT((a), (s)); \(a) += (b); \}
#define HH(a, b, c, d, x, s, ac) \{ \(a) += H((b), (c), (d)) + (x) + (UINT4)(ac); \(a) = ROTATE_LEFT((a), (s)); \(a) += (b); \}
#define II(a, b, c, d, x, s, ac) \{ \(a) += I((b), (c), (d)) + (x) + (UINT4)(ac); \(a) = ROTATE_LEFT((a), (s)); \(a) += (b); \}void MD5Init(MD5_CTX *mdContext)
{mdContext->i[0] = mdContext->i[1] = (UINT4)0;/* Load magic initialization constants.*/mdContext->buf[0] = (UINT4)0x67452301;mdContext->buf[1] = (UINT4)0xefcdab89;mdContext->buf[2] = (UINT4)0x98badcfe;mdContext->buf[3] = (UINT4)0x10325476;
}void MD5Update(MD5_CTX *mdContext, unsigned char *inBuf, unsigned int inLen)
{UINT4 in[16];int mdi;unsigned int i, ii;/* compute number of bytes mod 64 */mdi = (int)((mdContext->i[0] >> 3) & 0x3F);/* update number of bits */if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0])mdContext->i[1]++;mdContext->i[0] += ((UINT4)inLen << 3);mdContext->i[1] += ((UINT4)inLen >> 29);while (inLen--){/* add new character to buffer, increment mdi */mdContext->in[mdi++] = *inBuf++;/* transform if necessary */if (mdi == 0x40){for (i = 0, ii = 0; i < 16; i++, ii += 4)in[i] = (((UINT4)mdContext->in[ii + 3]) << 24) |(((UINT4)mdContext->in[ii + 2]) << 16) |(((UINT4)mdContext->in[ii + 1]) << 8) |((UINT4)mdContext->in[ii]);Transform(mdContext->buf, in);mdi = 0;}}
}void MD5Final(MD5_CTX *mdContext)
{UINT4 in[16];int mdi;unsigned int i, ii;unsigned int padLen;/* save number of bits */in[14] = mdContext->i[0];in[15] = mdContext->i[1];/* compute number of bytes mod 64 */mdi = (int)((mdContext->i[0] >> 3) & 0x3F);/* pad out to 56 mod 64 */padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);MD5Update(mdContext, PADDING, padLen);/* append length in bits and transform */for (i = 0, ii = 0; i < 14; i++, ii += 4)in[i] = (((UINT4)mdContext->in[ii + 3]) << 24) |(((UINT4)mdContext->in[ii + 2]) << 16) |(((UINT4)mdContext->in[ii + 1]) << 8) |((UINT4)mdContext->in[ii]);Transform(mdContext->buf, in);/* store buffer in digest */for (i = 0, ii = 0; i < 4; i++, ii += 4){mdContext->digest[ii] = (unsigned char)(mdContext->buf[i] & 0xFF);mdContext->digest[ii + 1] =(unsigned char)((mdContext->buf[i] >> 8) & 0xFF);mdContext->digest[ii + 2] =(unsigned char)((mdContext->buf[i] >> 16) & 0xFF);mdContext->digest[ii + 3] =(unsigned char)((mdContext->buf[i] >> 24) & 0xFF);}
}/* Basic MD5 step. Transform buf based on in.*/
static void Transform(UINT4 *buf, UINT4 *in)
{UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];/* Round 1 */
#define S11 7
#define S12 12
#define S13 17
#define S14 22FF(a, b, c, d, in[0], S11, 3614090360); /* 1 */FF(d, a, b, c, in[1], S12, 3905402710); /* 2 */FF(c, d, a, b, in[2], S13, 606105819); /* 3 */FF(b, c, d, a, in[3], S14, 3250441966); /* 4 */FF(a, b, c, d, in[4], S11, 4118548399); /* 5 */FF(d, a, b, c, in[5], S12, 1200080426); /* 6 */FF(c, d, a, b, in[6], S13, 2821735955); /* 7 */FF(b, c, d, a, in[7], S14, 4249261313); /* 8 */FF(a, b, c, d, in[8], S11, 1770035416); /* 9 */FF(d, a, b, c, in[9], S12, 2336552879); /* 10 */FF(c, d, a, b, in[10], S13, 4294925233); /* 11 */FF(b, c, d, a, in[11], S14, 2304563134); /* 12 */FF(a, b, c, d, in[12], S11, 1804603682); /* 13 */FF(d, a, b, c, in[13], S12, 4254626195); /* 14 */FF(c, d, a, b, in[14], S13, 2792965006); /* 15 */FF(b, c, d, a, in[15], S14, 1236535329); /* 16 *//* Round 2 */
#define S21 5
#define S22 9
#define S23 14
#define S24 20GG(a, b, c, d, in[1], S21, 4129170786); /* 17 */GG(d, a, b, c, in[6], S22, 3225465664); /* 18 */GG(c, d, a, b, in[11], S23, 643717713); /* 19 */GG(b, c, d, a, in[0], S24, 3921069994); /* 20 */GG(a, b, c, d, in[5], S21, 3593408605); /* 21 */GG(d, a, b, c, in[10], S22, 38016083); /* 22 */GG(c, d, a, b, in[15], S23, 3634488961); /* 23 */GG(b, c, d, a, in[4], S24, 3889429448); /* 24 */GG(a, b, c, d, in[9], S21, 568446438); /* 25 */GG(d, a, b, c, in[14], S22, 3275163606); /* 26 */GG(c, d, a, b, in[3], S23, 4107603335); /* 27 */GG(b, c, d, a, in[8], S24, 1163531501); /* 28 */GG(a, b, c, d, in[13], S21, 2850285829); /* 29 */GG(d, a, b, c, in[2], S22, 4243563512); /* 30 */GG(c, d, a, b, in[7], S23, 1735328473); /* 31 */GG(b, c, d, a, in[12], S24, 2368359562); /* 32 *//* Round 3 */
#define S31 4
#define S32 11
#define S33 16
#define S34 23HH(a, b, c, d, in[5], S31, 4294588738); /* 33 */HH(d, a, b, c, in[8], S32, 2272392833); /* 34 */HH(c, d, a, b, in[11], S33, 1839030562); /* 35 */HH(b, c, d, a, in[14], S34, 4259657740); /* 36 */HH(a, b, c, d, in[1], S31, 2763975236); /* 37 */HH(d, a, b, c, in[4], S32, 1272893353); /* 38 */HH(c, d, a, b, in[7], S33, 4139469664); /* 39 */HH(b, c, d, a, in[10], S34, 3200236656); /* 40 */HH(a, b, c, d, in[13], S31, 681279174); /* 41 */HH(d, a, b, c, in[0], S32, 3936430074); /* 42 */HH(c, d, a, b, in[3], S33, 3572445317); /* 43 */HH(b, c, d, a, in[6], S34, 76029189); /* 44 */HH(a, b, c, d, in[9], S31, 3654602809); /* 45 */HH(d, a, b, c, in[12], S32, 3873151461); /* 46 */HH(c, d, a, b, in[15], S33, 530742520); /* 47 */HH(b, c, d, a, in[2], S34, 3299628645); /* 48 *//* Round 4 */
#define S41 6
#define S42 10
#define S43 15
#define S44 21II(a, b, c, d, in[0], S41, 4096336452); /* 49 */II(d, a, b, c, in[7], S42, 1126891415); /* 50 */II(c, d, a, b, in[14], S43, 2878612391); /* 51 */II(b, c, d, a, in[5], S44, 4237533241); /* 52 */II(a, b, c, d, in[12], S41, 1700485571); /* 53 */II(d, a, b, c, in[3], S42, 2399980690); /* 54 */II(c, d, a, b, in[10], S43, 4293915773); /* 55 */II(b, c, d, a, in[1], S44, 2240044497); /* 56 */II(a, b, c, d, in[8], S41, 1873313359); /* 57 */II(d, a, b, c, in[15], S42, 4264355552); /* 58 */II(c, d, a, b, in[6], S43, 2734768916); /* 59 */II(b, c, d, a, in[13], S44, 1309151649); /* 60 */II(a, b, c, d, in[4], S41, 4149444226); /* 61 */II(d, a, b, c, in[11], S42, 3174756917); /* 62 */II(c, d, a, b, in[2], S43, 718787259); /* 63 */II(b, c, d, a, in[9], S44, 3951481745); /* 64 */buf[0] += a;buf[1] += b;buf[2] += c;buf[3] += d;
}char *MD5_file(const char *path, int md5_len)
{FILE *fp = fopen(path, "rb");MD5_CTX mdContext;int bytes;unsigned char data[1024];char *file_md5;int i;if (fp == NULL){fprintf(stderr, "fopen %s failed\n", path);return NULL;}MD5Init(&mdContext);while ((bytes = fread(data, 1, 1024, fp)) != 0){MD5Update(&mdContext, data, bytes);}MD5Final(&mdContext);file_md5 = (char *)malloc((md5_len + 1) * sizeof(char));if (file_md5 == NULL){fprintf(stderr, "malloc failed.\n");return NULL;}memset(file_md5, 0, (md5_len + 1));if (md5_len == 16){for (i = 4; i < 12; i++){sprintf(&file_md5[(i - 4) * 2], "%02x", mdContext.digest[i]);}}else if (md5_len == 32){for (i = 0; i < 16; i++){sprintf(&file_md5[i * 2], "%02x", mdContext.digest[i]);}}else{fclose(fp);free(file_md5);return NULL;}fclose(fp);return file_md5;
}char *MD5(const char *buf, int md5_len)
{MD5_CTX mdContext;int bytes;unsigned char data[1024];char *file_md5;int i;MD5Init(&mdContext);MD5Update(&mdContext, (unsigned char *)buf, strlen(buf));MD5Final(&mdContext);file_md5 = (char *)malloc((md5_len + 1) * sizeof(char));if (file_md5 == NULL){fprintf(stderr, "malloc failed.\n");return NULL;}memset(file_md5, 0, (md5_len + 1));if (md5_len == 16){for (i = 4; i < 12; i++){sprintf(&file_md5[(i - 4) * 2], "%02x", mdContext.digest[i]);}}else if (md5_len == 32){for (i = 0; i < 16; i++){sprintf(&file_md5[i * 2], "%02x", mdContext.digest[i]);}}else{free(file_md5);return NULL;}return file_md5;
}unsigned int getMD5(const char *buf)
{char *b = MD5(buf);unsigned int hash = 0;// 共32位的加密串 8个字符 4组// 5f93f983524def3dca464469d2cf9f3efor (int i = 0; i < 8; i++){hash += ((int)(b[i * 4 + 3] & 0xFF) << 24) |((int)(b[i * 4 + 2] & 0xFF) << 16) |((int)(b[i * 4 + 1] & 0xFF) << 8) |((int)(b[i * 4 + 0] & 0xFF));}return hash;
}#endifmd5简单来说就是一个加密算法,不是我们研究的重点，了解即可