linux中怎么增量增量傳輸mysql binlog日志

這篇文章將為大家詳細講解有關linux中怎么增量增量傳輸mysql binlog日志，文章內容質量較高，因此小編分享給大家做個參考，希望大家閱讀完這篇文章后對相關知識有一定的了解。

在實際的工作中我們遇到了一個問題，MYSQL 5.5 我們備份使用的mysqldump，然后每天傳輸的備份到備份機器，但是binlog卻不好傳輸主要要考慮幾個問題：
1、binlog 沒法取時間，按照什么規則來傳？
2、binlog的傳輸并不是每次都全部傳輸過去，而是需要增量的。
3、binlog的最后一個日志是在使用的是不能傳輸的。
4、為了更通用需要使用一個前綴，因為每個數據庫的binlog前綴是可以自己指定的
如 mysqlbin.000001

那么有了上面的問題，如何解決？也許shell腳本能夠完成，但是我選擇使用C/C++ 和LINUX系統函數 opendir readdir lstat來完成
這是我最后掛載的腳本
#!/bin/sh
TIME_TAG=`date +%Y%m%d`
/root/ftptool/tool  /dbdata/data/  /root/ftptool/ mysql-bin > tool_${TIME_TAG}.log
if [ $? != 0  ]; then
    echo "tool failed"
    exit
else
    echo "tool sucess!"
fi
cat /root/ftptool/ftphead > /root/ftptool/ftp_${TIME_TAG}.sh
cat /root/ftptool/${TIME_TAG} >> /root/ftptool/ftp_${TIME_TAG}.sh
cat /root/ftptool/ftptail >> /root/ftptool/ftp_${TIME_TAG}.sh


chmod 755 /root/ftptool/ftp_${TIME_TAG}.sh
sh /root/ftptool/ftp_${TIME_TAG}.sh
實際上ftp_${TIME_TAG}.sh來自3個部分
1、ftphead --這個很簡單自己寫明白ip 用戶名密碼就好了，如下：
#!/bin/sh

ftp -i -v -n<< EOF
open 192.168.*.*
user mysql ****
cd /backup/mysql
bin
2、 ftptail  這個更簡單
quit
EOF
就這點
3、cat ${TIME_TAG}
這部分是我自己寫的工具tool 生成的
工具使用如下：
Usage:./tool binlogdir ftpdir binlogprefix
需要一個binlog目錄 一個ftp目錄和binlong的前綴
binlog目錄不用多說是binlog的所在目錄，需要以/結尾比如 /mysql/data/不能是/mysql/data 否則拋錯error 20 binlogdir Must End With /

ftp目錄下存放兩個東西一個tmp文件和生成的ftp腳本，ftp腳本生成和當前時間一致比如20160713
tmp文件用于存放當前取到的最大的binlog序號,如果不存在可以新建一個，如果不新建拋錯error 15 tmp file not found
如果想再次全部傳輸刪除tmp文件新建一個空的就可以比如touch tmp
這個ftp目錄同樣必須使用/結尾 否則拋錯error 21 ftpdir Must End With /

binlogprefix 就是你的前綴比如mysql-bin

使用就是這么簡單，有了這3部分就能夠通過shell
cat ftphead > ftp_${TIME_TAG}.sh
cat ${TIME_TAG} >> ftp_${TIME_TAG}.sh
cat ftptail >> ftp_${TIME_TAG}.sh
生成一個全部的腳本。然后運行了。
另外tool工具會輸出一些信息，當然可以關閉，這些輸出信息我重定向到了 tool_${TIME_TAG}.log
可以查看下面就是一份：
WARNING:Ftpdir Less Than 1000 Char!
PROCESS:Create Chain Now:
INFO:Current Binog Dir Is :/dbdata/
PROCESS:Checkbin Binlogprefix: mysql-bin
................. 這里省略很多
PROCESS:Print chain info
................. 這里省略很多
PROCESS:Now Acc Ftpdir:
INFO:Ftp_scirpt fun time:
Wed Jul 13 14:44:13 2016
20160713
INFO:Ftp_scirpt Fun Tmpfile :/root/ftptool/tmp
INFO:Tmpfile Write Mode Succ!
INFO:Ftp_Scirpt Fun Tmp_max_st:0 Max_st_1:2028:
INFO:Scan Put Counter :163
INFO:Current Max Binlog-1 is:2028
PROCESS:Free Node Is:164

可以清楚看到將會生成163個put腳本信息，最高的傳輸是2028，實際最大是2029，我在編碼的時候做了-1操作,目的在于不要傳輸當前的binlog，
因為當前的binlog正在使用
最后釋放了鏈表節點164個.同事你的tmp文件目錄也會輸出,binglog 的目錄也會輸出.

下面是全部分出錯碼：
error 10 open bindbr error
error 11 argv parameter error
eroor 12 not find binlog
error 14 fptdir open error
error 15 tmp file not found
error 16 lstat tmp file error
error 18 tmp file write error
error 20 binlogdir Must End With /
error 21 ftpdir Must End With /
當然成功放回 0

編譯好的我放到了百度云盤
http://pan.baidu.com/s/1i4WuBB3
下面是全部的源代碼
編譯使用 g++ main.cpp mybin.cpp -o tool 即可 注意本工具使用了LINUX系統函數所以必須是LINUX系統或者其他滿足posix標準的系統不包含windows
在LINUX下編譯沒有問題。有什么問題可以聯系QQ 22389860.

點擊(此處)折疊或打開

1. /*************************************************************************
   

2.   > File Name: mbin.h
   

3.   > Author: gaopeng
   

4.   > Mail: gaopp_200217@163.com
   

5.   > Created Time: Tue 02 Aug 2016 05:57:27 PM CST
   

6.  ************************************************************************/
   

7. 
   

8. #include<iostream>
   

9. #define _DEG
   

10. using namespace std;
    

11. typedef unsigned char uchar;
    

12. typedef unsigned long ulong;
    

13. typedef unsigned int uint;
    

14. typedef unsigned short ushort;
    

15. 
    

16. 
    

17. typedef struct data
    

18. {
    

19. 
    

20.     char* file_name;
    

21.     char* path_name;
    

22.     char* full_name;
    

23.     ulong file_st;
    

24.     uint  nuse;
    

25. } DATA;
    

26. 
    

27. typedef struct f_node
    

28. {
    

29. 
    

30.     struct f_node *next;
    

31.     DATA* data;
    

32. } F_NODE;
    

33. 
    

34. typedef struct quence
    

35. {
    

36. 
    

37.     F_NODE* first;
    

38.     F_NODE* last;
    

39.     int items;
    

40. } QUE;
    

41. 
    

42. uint checkbin(const char* file_name,const char* binprefix);
    

43. F_NODE* create_que(const char *bindir,const char* binprefix);
    

44. QUE* ini_que(void);
    

45. void show( F_NODE* const frs_nd);
    

46. void ins_chan(const char* f_name,const char* p_name,const char* ful_name,QUE * que);
    

47. ulong  char_to_num(const char* file_name);
    

48. void time_to_time(char* ltime,char* mytime);
    

49. void ftp_script(const char* ftp_dir,F_NODE* frs_nd);
    

50. int get_max_st(F_NODE* const frs_nd);
    

51. ulong readtmp(FILE *fd,const char* tmpdir);
    

52. int myfree(F_NODE* const frs_nd);
    

53. uint checkdir(const char* mychar);

點擊(此處)折疊或打開

1. /*************************************************************************
   

2.   > File Name: main.cpp
   

3.   > Author: gaopeng
   

4.   > Mail: gaopp_200217@163.com
   

5.   > Created Time: Tue 02 Aug 2016 05:58:15 PM CST
   

6.  ************************************************************************/
   

7. 
   

8. #include<iostream>
   

9. #include<iostream>
   

10. #include<stdio.h>
    

11. #include <sys/types.h>
    

12. #include <dirent.h>
    

13. #include <string.h>
    

14. #include"mbin.h"
    

15. #include <stdlib.h>
    

16. 
    

17. using namespace std;
    

18. 
    

19. 
    

20. 
    

21. int main(int argc,char *argv[])
    

22. {
    

23.     F_NODE* frs_nd=0;
    

24.     int freeno =0;
    

25.     printf("%s\n","Usage:./tool binlogdir ftpdir binlogprefix");
    

26.     if(argc<4)
    

27.     {
    

28.         cout<<"ERROR(9):Parameter Error Like:"<<endl;
    

29.         printf("%s\n","Usage:./tool binlogdir ftpdir binlogprefix");
    

30.         exit(9);
    

31.     }
    

32.     if(checkdir(argv[1]) == 1)
    

33.     {
    

34.         cout<<"ERROR(20):binlogdir Must End With /"<<endl;
    

35.         exit(20);
    

36.     }
    

37.     if(checkdir(argv[2]) == 1)
    

38.     {
    

39.         cout<<"ERROR(21):ftpdir Must End With /"<<endl;
    

40.         exit(21);
    

41.     }
    

42.     printf("WARNING:Ftpdir Less Than 1000 Char!\n");
    

43.     printf("PROCESS:Create Chain Now:\n");
    

44.     frs_nd = create_que(argv[1],argv[3]);
    

45.     cout<<"PROCESS:Print chain info"<<endl;
    

46.     show(frs_nd);
    

47.     cout<<"PROCESS:Now Acc Ftpdir:"<<endl;
    

48.     ftp_script(argv[2], frs_nd);
    

49.     
    

50.     freeno = myfree(frs_nd);
    

51.     cout<<"PROCESS:Free Node Is:"<<freeno<<endl;
    

52. 
    

53. return 0;
    

54. }

點擊(此處)折疊或打開

1. /*************************************************************************
   

2.   > File Name: mybin.cpp
   

3.   > Author: gaopeng
   

4.   > Mail: gaopp_200217@163.com
   

5.   > Created Time: Tue 02 Aug 2016 05:57:34 PM CST
   

6.  ************************************************************************/
   

7. 
   

8. #include<iostream>
   

9. #include "mbin.h"
   

10. #include <sys/types.h>
    

11. #include <sys/stat.h>
    

12. #include <unistd.h>
    

13. #include <time.h>
    

14. #include <stdio.h>
    

15. #include <stdlib.h>
    

16. #include <string.h>
    

17. #include <dirent.h>
    

18. #include <math.h>
    

19. 
    

20. using namespace std;
    

21. 
    

22. QUE* ini_que(void)
    

23. {
    

24.     QUE* que = new QUE;
    

25.     que->first =0;
    

26.     que->last =0;
    

27.     que->items =0;
    

28.     return que;
    

29. }
    

30. 
    

31. void ins_chan(const char* f_name,const char* p_name,const char* ful_name,QUE * que)
    

32. {
    

33.     F_NODE *add = new F_NODE; //inital node pointer
    

34.     DATA *name = new DATA; //inital data pointer
    

35.     name->file_name = new char[strlen(f_name)+5];
    

36.     name->path_name = new char[strlen(p_name)+5];
    

37.     name->full_name = new char[strlen(ful_name)+5];
    

38. 
    

39.     //init mem
    

40. 
    

41.     memset(name->file_name,0,strlen(f_name)+5);
    

42.     memset(name->path_name,0,strlen(p_name)+5);
    

43.     memset(name->full_name,0,strlen(ful_name)+5);
    

44. 
    

45.     name->file_st = char_to_num(f_name);
    

46.     name->nuse = 0;
    

47.     strcpy(name->file_name,f_name);
    

48.     strcpy(name->path_name,p_name);
    

49.     strcpy(name->full_name,ful_name);
    

50. 
    

51.     add->next =0;
    

52.     add->data = name;
    

53. 
    

54.     if( que->items==0)
    

55.     {
    

56.         que->first =add;
    

57.         que->last =add;
    

58.         que->items++;
    

59.     }
    

60.     else
    

61.     {
    

62.         que->last->next = add;
    

63.         que->last = add;
    

64.         que->items++;
    

65.     }
    

66. }
    

67. 
    

68. F_NODE* create_que(const char *bindir,const char* binprefix)
    

69. {
    

70.     struct dirent *DirEntry=0;
    

71.     DIR* Dir=0;
    

72.     QUE* myq=0;
    

73.     uint nob=0; //check if binlog find
    

74. 
    

75.     myq = ini_que();
    

76.     F_NODE* frs_nd =0;
    

77. 
    

78.     if( !(Dir = opendir(bindir)))
    

79.     {
    

80.         perror("ERROR(10):Open Binlog Dir Error:");
    

81.         exit(10);
    

82.     }
    

83.     else
    

84.     {
    

85.         printf("INFO:Current Binog Dir Is :%s\n",bindir);
    

86.         while( DirEntry = readdir(Dir))
    

87.         {
    

88.             if(DirEntry->d_type == DT_REG && checkbin(DirEntry->d_name,binprefix) == 1)            
    

89.             {
    

90.                 nob++;
    

91. 
    

92. #ifdef _DEG
    

93.                 printf("%s%s\n",bindir,DirEntry->d_name);
    

94. #endif
    

95.                 char *tloop = new char[strlen(bindir) + strlen(DirEntry->d_name)+5];
    

96.                 strcat(strcat(tloop,bindir),DirEntry->d_name); //bindir like /test/test/test/ last / is must
    

97.                 ins_chan(DirEntry->d_name,bindir,tloop,myq);
    

98.                 delete [] tloop;
    

99.             }
    

100.         }
     

101.         closedir(Dir);
     

102.         if(nob == 0)
     

103.         {
     

104.             printf("WARNING:No Bin Log Find!!\n");
     

105.             delete myq;
     

106.             exit(12);
     

107.         }
     

108.     }
     

109.     frs_nd = myq->first;
     

110.     delete myq;
     

111.     return frs_nd;
     

112. }
     

113. 
     

114. uint checkbin(const char* file_name,const char* binprefix)
     

115. {
     

116.     uint lenprefix = strlen(binprefix); //exp 5
     

117.     uint filelen = strlen(file_name);
     

118.     uint i;
     

119.     uint t;
     

120.     char tmpfix[strlen(binprefix)+1]; //exp strlen(binprefix)+1 =6
     

121.     memset(tmpfix,0,strlen(binprefix)+1);
     

122.     for(i=0;i<=lenprefix-1;i++) //exp lenprefix-1=4
     

123.     {
     

124.         tmpfix[i]=file_name[i]; //5 char copy tmpfix[0-4]
     

125.     }
     

126.     tmpfix[lenprefix]='\0'; //tmpfix[5] = '\0'
     

127. #ifdef _DEG
     

128.     cout<<"PROCESS:Checkbin Binlogprefix: "<<tmpfix<<endl;
     

129. #endif
     

130.     if(!strcmp(tmpfix,binprefix)) //check prefix eq tmpfix
     

131.     {
     

132.         for(t=(filelen-1);t>=(filelen-6);t--) //exp filelen-1=10 filelen-6=5
     

133.         {
     

134.             if(file_name[t]<48 || file_name[t]>57 ) //check 000000
     

135.             {
     

136.                 return 0;
     

137.             }
     

138.         }
     

139.         if(file_name[filelen-7] !='.') //check . of .000000
     

140.         {
     

141.             return 0;
     

142.         }
     

143.     }
     

144.     else
     

145.     {
     

146.         return 0;
     

147.     }
     

148.     return 1;
     

149. }
     

150. 
     

151. void show( F_NODE* const frs_nd)
     

152. {
     

153.     F_NODE* scan_nd = frs_nd;
     

154.     do {
     

155.         if(!scan_nd->next)
     

156.         {
     

157.             break;
     

158.         }
     

159.         printf("INFO:%s,%s,%s,%lu,%u\n",scan_nd->data->file_name,scan_nd->data->path_name,scan_nd->data->full_name,scan_nd->data->file_st,scan_nd->data->nuse);
     

160.         scan_nd = scan_nd->next;
     

161.     } while(scan_nd->next);
     

162.     printf("INFO:%s,%s,%s,%lu,%u\n",scan_nd->data->file_name,scan_nd->data->path_name,scan_nd->data->full_name,scan_nd->data->file_st,scan_nd->data->nuse);
     

163. }
     

164. 
     

165. 
     

166. 
     

167. ulong  char_to_num(const char* file_name)
     

168. {
     

169.     uint len = strlen(file_name);
     

170.     uint i;
     

171.     ulong num=0;
     

172.     uint chk=0;
     

173. 
     

174.     for(i=(len-1);i>0;i--)
     

175.     {
     

176.         if(file_name[i]>=48 && file_name[i]<=57)
     

177.         {
     

178.             num = (ulong)(file_name[i] - 48)*(ulong)pow(10,chk)+num;
     

179.             chk++;
     

180.         }
     

181.     }
     

182.     return num;
     

183. }
     

184. 
     

185. 
     

186. void time_to_time(char* ltime,char* mytime)
     

187. {
     

188.     char buffer[10];
     

189.     buffer[0] = ltime[4];
     

190.     buffer[1] = ltime[5];
     

191.     buffer[2] = ltime[6];
     

192.     buffer[3] = '\0';
     

193. 
     

194.     mytime[0]=ltime[20];
     

195.     mytime[1]=ltime[21];
     

196.     mytime[2]=ltime[22];
     

197.     mytime[3]=ltime[23];
     

198.     if(!strcmp(buffer,"Jan"))
     

199.     {
     

200. 
     

201.         mytime[4]='0';
     

202.         mytime[5]='1';
     

203.     }
     

204.     if(!strcmp(buffer,"Feb"))
     

205.     {
     

206. 
     

207.         mytime[4]='0';
     

208.         mytime[5]='2';
     

209.     }
     

210.     if(!strcmp(buffer,"Mar"))
     

211.     {
     

212. 
     

213.         mytime[4]='0';
     

214.         mytime[5]='3';
     

215.     }
     

216.     if(!strcmp(buffer,"Apr"))
     

217.     {
     

218. 
     

219.         mytime[4]='0';
     

220.         mytime[5]='4';
     

221.     }
     

222.     if(!strcmp(buffer,"May"))
     

223.     {
     

224. 
     

225.         mytime[4]='0';
     

226.         mytime[5]='5';
     

227.     }
     

228.     if(!strcmp(buffer,"Jun"))
     

229.     {
     

230. 
     

231.         mytime[4]='0';
     

232.         mytime[5]='6';
     

233.     }
     

234.     if(!strcmp(buffer,"Jul"))
     

235.     {
     

236. 
     

237.         mytime[4]='0';
     

238.         mytime[5]='7';
     

239.     }
     

240.     if(!strcmp(buffer,"Aug"))
     

241.     {
     

242. 
     

243.         mytime[4]='0';
     

244.         mytime[5]='8';
     

245.     }
     

246.     if(!strcmp(buffer,"Sep"))
     

247.     {
     

248. 
     

249.         mytime[4]='0';
     

250.         mytime[5]='9';
     

251.     }
     

252.     if(!strcmp(buffer,"Oct"))
     

253.     {
     

254. 
     

255.         mytime[4]='1';
     

256.         mytime[5]='0';
     

257.     }
     

258.     if(!strcmp(buffer,"Nov"))
     

259.     {
     

260. 
     

261.         mytime[4]='1';
     

262.         mytime[5]='1';
     

263.     }
     

264.     if(!strcmp(buffer,"Dec"))
     

265.     {
     

266. 
     

267.         mytime[4]='1';
     

268.         mytime[5]='2';
     

269.     }
     

270. 
     

271.     if(ltime[8]<48 ||ltime[8]>57)
     

272.     {
     

273. 
     

274.         mytime[6]=48;
     

275.     }
     

276.     else
     

277.     {
     

278. 
     

279.         mytime[6]=ltime[8];
     

280.     }
     

281.     mytime[7]=ltime[9];
     

282.     mytime[8]='\0';
     

283. }
     

284. 
     

285. 
     

286. 
     

287. void ftp_script(const char* ftp_dir,F_NODE* frs_nd)
     

288. {
     

289.     time_t now;
     

290.     F_NODE* scan_nd = frs_nd;
     

291.     struct tm* nowtm;
     

292.     FILE* ftp=0;
     

293.     FILE* tmp=0;
     

294.     char timebuf[40];
     

295.     char mytime[25];
     

296.     char myftpdir[1000];
     

297.     char tmpdir[1000];
     

298.     ulong tmp_max_st;
     

299.     ulong max_st_1;
     

300.     int i=0;
     

301.     int freeno=0;
     

302. 
     

303.     memset(timebuf,0,40);
     

304.     memset(mytime,0,40);
     

305.     time(&now);
     

306.     nowtm = localtime(&now);
     

307.     asctime_r(nowtm,timebuf);
     

308.     time_to_time(timebuf,mytime);
     

309. #ifdef _DEG
     

310.     printf("INFO:Ftp_scirpt fun time:\n%s%s\n",timebuf,mytime);
     

311. #endif
     

312.     memset(myftpdir,0,1000);
     

313.     if((ftp=fopen(strcat(strcat(myftpdir,ftp_dir),mytime),"w"))==NULL)
     

314.     {
     

315. 
     

316.         perror("ERROR(14):Ftpdir open error:");
     

317.         freeno=myfree(frs_nd);
     

318.         cout<<"PROCESS:Free Mem:Free Node Is:"<<freeno<<endl;
     

319.         exit(14);
     

320.     }
     

321.     memset(tmpdir,0,1000);
     

322.     if((tmp=fopen(strcat(strcat(tmpdir,ftp_dir),"tmp"),"r"))==NULL)
     

323.     {
     

324.         printf("ERROR(15):No Tmp File Found,Please Create it frist!\n");
     

325.         freeno=myfree(frs_nd);
     

326.         cout<<"PROCESS:Free Mem:Free Node Is:"<<freeno<<endl;
     

327.         exit(15);
     

328.     }
     

329.     else
     

330.     {
     

331. #ifdef _DEG
     

332.         printf("INFO:Ftp_scirpt Fun Tmpfile :%s\n",tmpdir);
     

333. #endif
     

334.         tmp_max_st=readtmp(tmp,tmpdir);    
     

335.     }
     

336.     memset(tmpdir,0,1000);
     

337.     if((tmp=fopen(strcat(strcat(tmpdir,ftp_dir),"tmp"),"w"))==NULL)
     

338.     {
     

339. 
     

340.         printf("ERROR:Have No Write Privi In %s?\n",tmpdir);
     

341.         perror("ERROR(18):Tmpfile Open W Error:");
     

342.         freeno=myfree(frs_nd);
     

343.         cout<<"PROCESS:Free Mem:Free Node Is:"<<freeno<<endl;
     

344.         exit(18);
     

345.     }
     

346.     else
     

347.     {
     

348.         printf("INFO:Tmpfile Write Mode Succ!\n");
     

349.     }
     

350. 
     

351.     max_st_1 = get_max_st(frs_nd) - 1;
     

352.     printf("INFO:Ftp_Scirpt Fun Tmp_max_st:%lu Max_st_1:%lu:\n",tmp_max_st,max_st_1);    
     

353.     do{
     

354.         if(!scan_nd->next)
     

355.         {
     

356.             break;
     

357.         }
     

358.         if(scan_nd->data->file_st > tmp_max_st && scan_nd->data->file_st <= max_st_1)
     

359.         {
     

360.             i++;
     

361.             fputs("put ",ftp);
     

362.             fputs(scan_nd->data->full_name,ftp);
     

363.             fputs(" ",ftp);
     

364.             fputs(scan_nd->data->file_name,ftp);
     

365.             fputs("\n",ftp);
     

366.         }
     

367.         scan_nd = scan_nd->next;
     

368.     }while(scan_nd->next);
     

369.     if(scan_nd->data->file_st > tmp_max_st && scan_nd->data->file_st <= max_st_1)
     

370.     {
     

371.         i++;
     

372.         fputs("put ",ftp);
     

373.         fputs(scan_nd->data->full_name,ftp);
     

374.         fputs(" ",ftp);
     

375.         fputs(scan_nd->data->file_name,ftp);
     

376.         fputs("\n",ftp);
     

377.     }
     

378. 
     

379.     printf("INFO:Scan Put Counter :%d\n",i);
     

380.     if(i == 0)
     

381.     {
     

382.         printf("INFO:Read Max Binlog From Temp is :%lu\n",tmp_max_st);
     

383.         fprintf(tmp,"%lu",tmp_max_st);
     

384.         fputs("\n",tmp);
     

385.     }
     

386.     else
     

387.     {
     

388.         printf("INFO:Current Max Binlog-1 is:%lu\n",max_st_1);
     

389.         fprintf(tmp,"%lu",max_st_1);
     

390.         fputs("\n",tmp);
     

391.     }
     

392. 
     

393.     fclose(ftp);
     

394.     fclose(tmp);
     

395. }
     

396. 
     

397. int get_max_st(F_NODE* const frs_nd)
     

398. {
     

399.     F_NODE* scan_nd = frs_nd;    
     

400.     ulong max_st=0;
     

401.     do {
     

402.         if(!scan_nd->next)
     

403.         {
     

404.             break;
     

405.         }
     

406.         if(scan_nd->data->file_st > max_st)
     

407.         {
     

408.             max_st = scan_nd->data->file_st;
     

409.         }
     

410.         scan_nd = scan_nd->next;
     

411.     }while(scan_nd->next);
     

412.     if(scan_nd->data->file_st > max_st)
     

413.     {
     

414.         max_st = scan_nd->data->file_st;
     

415.     }
     

416.     return max_st;
     

417. }
     

418. 
     

419. 
     

420. 
     

421. 
     

422. ulong readtmp(FILE *fd,const char* tmpdir)
     

423. {
     

424.     struct stat buf;
     

425.     ulong max_st = 0;
     

426. 
     

427.     if(lstat(tmpdir, &buf) < 0)
     

428.     {
     

429.         perror("ERROR(16):Lstat Error:");
     

430.         exit(16);
     

431.     }
     

432.     if(buf.st_size == 0)
     

433.     {
     

434.         max_st = 0;
     

435.     }
     

436.     else
     

437.     {
     

438.         fscanf(fd,"%lu",&max_st);
     

439.         /*
     

440.          if(max_st == 0)
     

441.          {
     

442.            printf("Tmp File Is Bad ?\n");
     

443.          exit(17);
     

444.          }
     

445.          */
     

446.     }
     

447.     return max_st;
     

448. }
     

449. 
     

450. 
     

451. 
     

452. int myfree(F_NODE* const frs_nd)
     

453. {
     

454. 
     

455.     F_NODE* scan_nd = frs_nd;
     

456.     F_NODE* cur_nd = 0;
     

457.     int i = 0;
     

458.     do{
     

459.         cur_nd = scan_nd;
     

460.         if(!scan_nd->next)
     

461.         {
     

462.             free(cur_nd->data->file_name);
     

463.             free(cur_nd->data->path_name);
     

464.             free(cur_nd->data->full_name);
     

465.             free(cur_nd->data);
     

466.             free(cur_nd);
     

467.             i++;
     

468.             return i;
     

469.         }
     

470.         scan_nd = scan_nd->next;
     

471.         free(cur_nd->data->file_name);
     

472.         free(cur_nd->data->path_name);
     

473.         free(cur_nd->data->full_name);
     

474.         free(cur_nd->data);
     

475.         free(cur_nd);
     

476.         i++;
     

477.     }while(scan_nd->next);
     

478.     free(scan_nd->data->file_name);
     

479.     free(scan_nd->data->path_name);
     

480.     free(scan_nd->data->full_name);
     

481.     free(scan_nd->data);
     

482.     free(scan_nd);
     

483.     i++;
     

484.     return i;
     

485. }
     

486. 
     

487. uint checkdir(const char* mychar)
     

488. {
     

489.     uint len = strlen(mychar);
     

490.     if(mychar[len-1] == '/' )
     

491.     {
     

492.         return 0;
     

493.     }
     

494.     else
     

495.     {
     

496.         return 1;
     

497.     }
     

498. }

關于linux中怎么增量增量傳輸mysql binlog日志就分享到這里了，希望以上內容可以對大家有一定的幫助，可以學到更多知識。如果覺得文章不錯，可以把它分享出去讓更多的人看到。