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
|
/* Copyright (c) 1994 Sun Wu, Udi Manber, Burra Gopal. All Rights Reserved. */
/* simple tests which don't need to access indexing data structures */
#include <stdio.h>
#include "glimpse.h"
#define b_sample_size 2048 /* the number of bytes sampled to determine
whether a file is binary */
#define u_sample_size 1024 /* the number of bytes sampled to determine
whether a file is uuencoded */
extern UseFilters;
#if 0
/* ---------------------------------------------------------------------
check for binary stream
--------------------------------------------------------------------- */
test_binary(buffer, length)
unsigned char *buffer;
int length;
{
int i=0;
int b_count=0;
if(length > b_sample_size) length = b_sample_size;
for(i=0; i<length; i++) {
if(buffer[i] > 127) b_count++;
}
if(b_count*10 >= length) return(1);
return(0);
}
#else /*0*/
/* Lets try this one instead: Chris Dalton */
test_binary(buffer, length)
unsigned char *buffer;
int length;
{
int permitted_errors;
if (length > b_sample_size) { length= b_sample_size; }
permitted_errors= length/10;
while (permitted_errors && length--) {
if (!(isgraph(*buffer) || isspace(*buffer))) --permitted_errors;
buffer ++;
}
/* printf("\t\t\tpermerr=%d in %d\n", permitted_errors, length); */
return (permitted_errors == 0);
}
#endif /*0*/
/* ---------------------------------------------------------------------
check for uuencoded stream
--------------------------------------------------------------------- */
test_uuencode(buffer, length)
unsigned char *buffer;
int length;
{
int i=0;
int j;
if(length > u_sample_size) length = u_sample_size;
if(strncmp((char *)buffer, "begin", 5) == 0) {
i=5;
goto CONT;
}
i = memlook("\nbegin", buffer, length);
if(i < 0) return(0);
CONT:
while(buffer[i] != '\n' && i<length) i++;
if(i == length) return(0);
i++;
if(buffer[i] == 'M') {
if((j=memlook("\nM", &buffer[i], length-i)) < 80) return(1);
}
else return(0);
}
int
test_postscript(buffer, length)
unsigned char *buffer;
int length;
{
int i=0;
char *first;
while((i<length) && (buffer[i] != '\n')) i++;
if (i>=length) return 0;
buffer[i] = '\0';
if ((first = (char *)strstr((char *)buffer, "PS-Adobe")) == NULL) {
buffer[i] = '\n';
return 0;
}
buffer[i] = '\n';
return 1;
}
char *suffixlist[NUM_SUFFIXES] = IGNORED_SUFFIXES;
int
test_special_suffix(name)
char *name;
{
int len = strlen(name);
int j, i = len-1;
char *suffix;
#if SFS_COMPAT
while(i>=0) if (name[i] == '/') break; else i--;
if (i<0) return 0; /* no suffix: can be directory... */
else suffix = &name[i+1];
for (j=0; j<NUM_SUFFIXES; j++)
if (!strcmp(suffix, suffixlist[j])) break;
if (j >= NUM_SUFFIXES) return 0;
return 1;
#else
while(i>=0) if (name[i] == '.') break; else i--;
if (i<0) return 0; /* no suffix: can be directory... */
else suffix = &name[i+1];
for (j=0; j<NUM_SUFFIXES; j++)
if (!strcmp(suffix, suffixlist[j])) break;
if (j >= NUM_SUFFIXES) return 0;
return 1;
#endif
}
|
