-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathinteger arithmetic overflow.cpp
More file actions
612 lines (578 loc) · 16.8 KB
/
integer arithmetic overflow.cpp
File metadata and controls
612 lines (578 loc) · 16.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
//
// main.cpp
// B_3
//
// Created by 郭倜维 on 2018/10/25.
// Copyright © 2018 郭倜维. All rights reserved.
//
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#define MAX 200
//结构体定义
//定义普通变量结构体
typedef struct Variate
{
char type[20];
char name[20];
int type_flag;
struct Variate* v_next;
}Variate;
//定义敏感函数结构体
typedef struct Func_m
{
int row;
char name[10];
char des[20];
char sou[20];
int n;
struct Func_m* m_next;
}Func_m;
//定义缓冲区变量结构体
typedef struct Buffer
{
char type[20];
char name[20];
int size;
struct Buffer* buf_next;
}Buffer;
//定义运算语句结构体
typedef struct Operation
{
int row;
char sou_1[20];
char sou_2[20];
char des[20];
struct Operation* o_next;
}Operation;
//定义函数体结构体
typedef struct Func
{
int start_row;
int end_row;
struct Variate* va_chain;
struct Func_m* mf_chain;
struct Buffer* buf_chain;
struct Operation* op_chain;
struct Func* func_next;
}Func;
//函数list
void Pre_Func_deal(FILE* F_In,FILE* F_Out,char In_name[30],char Out_name[20]);//预处理函数
bool Judge_body(char str[MAX]);
int Count_char(char str_1[200],char str_2[]);
bool Judge_func_m(char str[MAX]);
void Func_m_analyze(char str[MAX],struct Func_m* m_func);
void Buffer_analyze(char str[MAX],struct Buffer* buf);
void Operation_analyze(char str[MAX],struct Operation* op);
bool Judge_operation(char str[MAX]);
void Variate_analyze(char str[MAX],struct Variate* var);
struct Func* funcchain(FILE *pf);
void Show(FILE* pf,int row,char buf[MAX]);
int main(int argc, const char * argv[])
{
FILE *pf1,*pf2;
int des_type_flag;
int flag_op=0,flag_m=0;
int over_flow;
char str_output[MAX];
char In_name[30]={0};
char Out_name[30]={0};
char str_des[20]={0};
char op_des[20]={0};
struct Func *f;
struct Variate *v;
struct Func_m *m;
struct Buffer *b;
struct Operation *op;
printf("请输入要检查的文件名:\n");
scanf("%s",In_name);
printf("请输入要存入的文件名:\n");
scanf("%s",Out_name);
pf1=fopen(In_name,"r");
pf2=fopen(Out_name,"w");
Pre_Func_deal(pf1,pf2,In_name,Out_name);
fclose(pf1);
fclose(pf2);
pf2=fopen(Out_name,"r");
f=(struct Func*)malloc(sizeof(struct Func));
v=(struct Variate*)malloc(sizeof(struct Variate));
m=(struct Func_m*)malloc(sizeof(struct Func_m));
b=(struct Buffer*)malloc(sizeof(struct Buffer));
op=(struct Operation*)malloc(sizeof(struct Operation));
f=funcchain(pf2);
rewind(pf2);
while(f->func_next != NULL)
{
f=f->func_next;
v=f->va_chain;
m=f->mf_chain;
b=f->buf_chain;
op=f->op_chain;
printf("In function starts in line %d and ends in %d\n",f->start_row,f->end_row);
while(op->o_next!=NULL)
{
flag_op=1;
op=op->o_next;
strcpy(op_des,op->des);
while(v->v_next!=NULL)
{
v=v->v_next;
if(!strcmp(op_des,v->name))
des_type_flag=v->type_flag;
}
if(des_type_flag<5)
flag_op=2;
}
while(m->m_next!=NULL)
{
flag_m=1;
m=m->m_next;
strcpy(str_des,m->des);
while(b->buf_next!=NULL)
{
b=b->buf_next;
if(!strcmp(b->name,str_des))
flag_m=2;
}
}
if(flag_op==2 && flag_m==2)
over_flow=2;
else
over_flow=3;
if(over_flow==2)
{
printf("Possibility of arithmetic overflow in line %d caused by line %d:\n",m->row,op->row);
Show(pf2,op->row,str_output);
Show(pf2,m->row,str_output);
printf("\n");
}
else
printf("No arithmetic overflow!\n");
}
return 0;
}
void Pre_Func_deal(FILE* F_In,FILE* F_Out,char In_name[30],char Out_name[20])
{
char line[MAX];
char line_temp[MAX];
char *pc;
char *Left_flag,*Right_flag; //注释符检测左标志与右标志
F_In=fopen(In_name,"r"); //打开输入文件
F_Out=fopen(Out_name,"w"); //打开输出文件
while(!feof(F_In)) //判断文件尾
{
while(fgets(line,MAX,F_In)) //逐行读取文件 遇到换行符结束
{
Left_flag=strstr(line,"/*"); //是否存在 /*
if(Left_flag) //找到左标志
{
*Left_flag='\n'; //去掉注释内容
*(Left_flag+1)='\0';
strcpy(line_temp,line);
Right_flag=strstr(Left_flag+2,"*/"); //是否存在 */
while(Right_flag == NULL) //该行不存在右标志,继续读取下一行,直到找到为止
{
fgets(line,MAX,F_In);
Right_flag=strstr(line,"*/");
}
strcpy(line,line_temp);
}
pc=strstr(line,"#"); //预编译语句判断
if(pc)
{
*pc='\n'; //去掉预编译语句
*(pc+1)='\0';
}
pc=strstr(line,"//"); //注释符判断
if(pc)
{
*pc='\n'; //去掉注释内容
*(pc+1)='\0';
}
pc=line;
while(isspace(*pc)) //去掉字符串开头的空格
pc++;
fputs(pc,F_Out); //逐行写入文件
}
}
fclose(F_In);
fclose(F_Out);
}
bool Judge_body(char str[MAX])
{
bool flag;
if(strstr(str,"(")!=NULL)
{
if(strstr(str,"char")!=NULL || strstr(str,"int")!=NULL || strstr(str,"long")!=NULL || strstr(str,"float")!=NULL || strstr(str,"double")!=NULL || strstr(str,"void")!=NULL)
{
if(strstr(str,";")==NULL)
flag = true;
else
flag = false;
}
else
flag = false;
}
else
flag = false;
return flag;
}
int Count_char(char str_1[200], char str_2[])
{
int n = 0;
unsigned long len = strlen(str_2);
do
{
str_1=strstr(str_1,str_2);
if(str_1!=NULL)
{
n++;
str_1=str_1+len;
}
else
break;
}
while(*str_1!='\0');
return n;
}
bool Judge_func_m(char str[MAX])
{
bool flag;
if(strstr(str,"strcpy")!=NULL || strstr(str,"strncpy")!=NULL || strstr(str,"memcpy")!=NULL ||strstr(str,"strcat")!=NULL || strstr(str,"strncpy")!=NULL || strstr(str,"sscacnf")!=NULL)
flag = true;
else
flag = false;
return flag;
}
void Func_m_analyze(char str[MAX],struct Func_m* m_func)
{
char temp[20] = {0};
if(strstr(str,"strcpy")!=NULL || strstr(str,"strncpy")!=NULL || strstr(str,"memcpy")!=NULL ||strstr(str,"strcat")!=NULL || strstr(str,"sscanf")!=NULL)
{
sscanf(str,"%[^(]",m_func->name);
if(!strcmp(m_func->name,"strcpy") || !strcmp(m_func->name,"strcat"))
{
str=strstr(str,"(");
str++;
sscanf(str,"%[^,]",m_func->des); //目的参数
str=strstr(str,",");
str++;
sscanf(str,"%[^)]",m_func->sou); //源参数
}
else
{
if(!strcmp(m_func->name,"strncpy") || !strcmp(m_func->name,"memcpy"))
{
str=strstr(str,"(");
str++;
sscanf(str,"%[^,]",m_func->des);
str=strstr(str,",");
str++;
sscanf(str,"%[^,]",m_func->sou);
str=strstr(str,",");
str++;
sscanf(str,"%[^)]",temp);
m_func->n=atoi(temp);
}
else
{
if(!strcmp(m_func->name,"sscanf"))
{
str=strstr(str,"(");
str++;
sscanf(str,"%[^,]",m_func->sou);
str=strstr(str,",");
str++;
str=strstr(str,",");
str++;
sscanf(str,"%[^)]",m_func->des);
}
}
}
}
}
void Buffer_analyze(char str[MAX],struct Buffer* buf)
{
char temp[MAX]={0};
if(strstr(str,"[")!=NULL) //数组变量
{
if(strstr(str,"char ")!=NULL || strstr(str,"int ")!=NULL || strstr(str,"long ")!=NULL)
{
sscanf(str,"%[^ ]",buf->type);
str=strstr(str," ");
str++;
sscanf(str,"%[^[]",buf->name);
str=strstr(str,"[");
str++;
}
if(*str!=']') //直接给出数组定义
{
sscanf(str,"%[^]]",temp);
buf->size=atoi(temp);
}
else //初始化数组
{
str=strstr(str,"=");
sscanf(str,"%[^;]",temp);
buf->size=strlen(temp)-2;
}
}
if(strstr(str,"char* ")!=NULL || strstr(str,"short* ")!=NULL || strstr(str,"int* ") || strstr(str,"long* ")!=NULL)
{
if(strstr(str,"malloc")!=NULL)
{
sscanf(str,"%[^*]",buf->type);
str=strstr(str,"* ");
str++;str++;
sscanf(str,"%[^=]",buf->name);
}
else
{
sscanf(str,"%[^*]",buf->type);
str=strstr(str,"* ");
str++;str++;
sscanf(str,"%[^;]",buf->name);
}
}
}
void Variate_analyze(char str[MAX],struct Variate* var)
{
char temp[10]={0};
if(strstr(str,"short ")!=NULL ||strstr(str,"int ")!=NULL || strstr(str,"long ")!=NULL)
{
if(strstr(str,"unsigned ")!=NULL)
{
sscanf(str,"%[^ ]",var->type);
strcat(var->type," ");
str=strstr(str," ");
str++;
sscanf(str,"%[^ ]",temp);
strcat(var->type,temp);
str=strstr(str," ");
str++;
sscanf(str,"%[^;]",var->name);
}
else
{
sscanf(str,"%[^ ]",var->type);
str=strstr(str," ");
str++;
sscanf(str,"%[^;]",var->name);
}
if(strstr(var->type,"short")!=NULL)
{
if(strstr(var->type,"unsigned ")!=NULL)
{
var->type_flag=2;
}
else
{
var->type_flag=1;
}
}
if(strstr(var->type,"int")!=NULL)
{
if(strstr(var->type,"unsigned ")!=NULL)
{
var->type_flag=4;
}
else
{
var->type_flag=3;
}
}
if(strstr(var->type,"long")!=NULL)
{
if(strstr(var->type,"unsigned ")!=NULL)
{
var->type_flag=6;
}
else
{
var->type_flag=5;
}
}
}
}
bool Judge_operation(char str[MAX])
{
bool flag = false;
if(strstr(str, "+") != NULL)
{
flag = true;
}
else
{
if(strstr(str, "*") != NULL)
{
if(strstr(str, "malloc") != NULL)
{
flag = true;
}
else
{
if(strstr(str, "=") != NULL)
{
flag = true;
}
else
flag = false;
}
}
}
return flag;
}
void Operation_analyze(char str[MAX],struct Operation* op)
{
if(strstr(str, "+") != NULL)
{
sscanf(str, "%[^=]", op->des);
str = strstr(str, "=");
str++;
sscanf(str, "%[^+]", op->sou_1);
str = strstr(str, "+");
str++;
sscanf(str, "%[^;]", op->sou_2);
}
else
{
if(strstr(str,"*")!=NULL &&strstr(str,"malloc")==NULL && strstr(str,"short*")==NULL && strstr(str,"int*")==NULL && strstr(str,"long*")==NULL)
{
//乘法计算语句
sscanf(str,"%[^=]",op->des);
str=strstr(str,"=");
str++;
sscanf(str,"%[^*]",op->sou_1);
str=strstr(str,"*");
str++;
sscanf(str,"%[^;]",op->sou_2);
}
else
{
if(strstr(str,"*")!=NULL &&strstr(str,"malloc")!=NULL)
{
str=strstr(str,"(");
str++;
sscanf(str,"%[^*]",op->des);
strcpy(op->sou_1,op->des);
str=strstr(str,"*");
str++;
sscanf(str,"%[^;]",op->sou_2);
}
}
}
}
struct Func* funcchain(FILE *pf)
{
int row=0;
int brace_l=0, brace_r=0, brace=0;
char buf_1[MAX]={0};
char buf_2[MAX]={0};
struct Func *func_head,*func_tail,*func_new;
struct Variate *v_head,*v_tail,*v_new;
struct Func_m *m_head,*m_tail,*m_new;
struct Buffer *buf_head,*buf_tail,*buf_new;
struct Operation *op_head,*op_tail,*op_new;
func_head = (struct Func*)malloc(sizeof(struct Func));
func_tail = func_head;
func_tail->func_next = NULL;
while(!feof(pf))
{
fgets(buf_1, MAX, pf);
row++;
if(Judge_body(buf_1))
{
func_new = (struct Func*)malloc(sizeof(struct Func));
func_new->start_row = row;
buf_head = (struct Buffer*)malloc(sizeof(struct Buffer));
buf_tail = buf_head;
buf_tail->buf_next = NULL;
v_head = (struct Variate*)malloc(sizeof(struct Variate));
v_tail = v_head;
v_tail->v_next = NULL;
m_head = (struct Func_m*)malloc(sizeof(struct Func_m));
m_tail = m_head;
m_tail->m_next = NULL;
op_head = (struct Operation*)malloc(sizeof(struct Operation));
op_tail = op_head;
op_tail->o_next = NULL;
func_new->va_chain = v_head;
func_new->mf_chain = m_head;
func_new->buf_chain = buf_head;
func_new->op_chain = op_head;
func_tail->func_next=func_new;
func_tail=func_new;
func_tail->func_next=NULL;
brace_l = Count_char(buf_1,"{");
brace = brace + brace_l;
brace_r = Count_char(buf_1,"}");
brace = brace - brace_r;
do
{
fgets(buf_2,MAX,pf);
row++;
brace_l = Count_char(buf_2,"{");
brace = brace + brace_l;
brace_r = Count_char(buf_2,"}");
brace = brace - brace_r;
if(strstr(buf_2,"char")!=NULL || strstr(buf_2,"short")!=NULL || strstr(buf_2,"int")!=NULL || strstr(buf_2,"long")!=NULL)
{
if(strstr(buf_2,"(")==NULL)
{
if(strstr(buf_2,"*")!=NULL || strstr(buf_2,"[")!=NULL)
{
buf_new = (struct Buffer*)malloc(sizeof(struct Buffer));
Buffer_analyze(buf_2, buf_new);
buf_tail->buf_next = buf_new;
buf_tail = buf_new;
buf_tail->buf_next = NULL;
}
else
{
v_new = (struct Variate*)malloc(sizeof(struct Variate));
Variate_analyze(buf_2, v_new);
v_tail->v_next = v_new;
v_tail = v_new;
v_tail->v_next = NULL;
}
}
}
if(Judge_func_m(buf_2))
{
m_new = (struct Func_m*)malloc(sizeof(struct Func_m));
m_new->row = row;
Func_m_analyze(buf_2, m_new);
m_tail->m_next = m_new;
m_tail = m_new;
m_tail->m_next = NULL;
}
if(Judge_operation(buf_2)) //扫描有无运算语句
{
op_new=(struct Operation*)malloc(sizeof(struct Operation));
op_new->row=row;
Operation_analyze(buf_2, op_new);
op_tail->o_next=op_new;
op_tail=op_new;
op_tail->o_next=NULL;
}
}
while(brace);
func_new->end_row = row;
}
}
return func_head;
}
void Show(FILE* pf,int row,char buf[MAX])
{
int i=0;
char buf_1[MAX];
while(i!=row)
{
fgets(buf,MAX,pf);
i++;
}
strcpy(buf_1,buf);
printf("%s",buf_1);
rewind(pf);
}