| 11 |
|
int mynode; |
| 12 |
|
//int nfiles(char* dirname[MAXPATHLEN + 1]); |
| 13 |
|
|
| 14 |
+ |
int amber_rst(const struct dirent * dir); |
| 15 |
+ |
//int alphasort(struct direct **d1, struct direct **d2); |
| 16 |
|
|
| 15 |
– |
|
| 16 |
– |
|
| 17 |
|
int nfiles(char* dirname[MAXPATHLEN + 1],int extension) |
| 18 |
|
{ |
| 19 |
|
int nfiles; |
| 20 |
|
mydir = (char*)dirname; |
| 21 |
|
mynode = extension; |
| 22 |
< |
nfiles = scandir((char*)dirname, &namelist, amber_rst, alphasort); |
| 22 |
> |
nfiles = scandir(".", &namelist, amber_rst, alphasort); |
| 23 |
|
return(nfiles); |
| 24 |
|
} |
| 25 |
|
|
| 26 |
< |
void getfilename(int which, char* fname) { |
| 27 |
< |
char* filename; |
| 26 |
> |
char* getfilename(int which) { |
| 27 |
> |
char* fname; |
| 28 |
|
int i; |
| 29 |
|
|
| 30 |
< |
filename = namelist[which]->d_name; |
| 30 |
> |
fname = namelist[which]->d_name; |
| 31 |
> |
printf("Getfilename filename is: %s\n",fname); |
| 32 |
> |
return fname; |
| 33 |
|
/* |
| 34 |
|
for (i = 0; i < strlen(filename); i++) { |
| 35 |
|
fname[i] = filename[i]; |
| 46 |
|
|
| 47 |
|
struct stat buf; |
| 48 |
|
char filename[MAXPATHLEN + 1]; |
| 49 |
+ |
|
| 50 |
|
char *base, *exten; |
| 51 |
|
char *dot = "."; |
| 52 |
< |
char *extenpattern; |
| 52 |
> |
char extenpattern[5]; |
| 53 |
|
|
| 54 |
< |
sprintf(filename, "%s/%s", mydir, dir->d_name); |
| 54 |
> |
sprintf(filename, "%s/%s",".", dir->d_name); |
| 55 |
> |
|
| 56 |
|
|
| 57 |
|
if (stat(filename, &buf) != 0) |
| 58 |
|
{ |
| 69 |
|
exten=strtok(NULL,"\0"); |
| 70 |
|
sprintf(extenpattern,"%i",mynode); |
| 71 |
|
|
| 68 |
– |
if (strcasecmp(exten, extenpattern)) |
| 69 |
– |
{ |
| 70 |
– |
return (0); |
| 71 |
– |
} |
| 72 |
– |
return (1); |
| 72 |
|
|
| 73 |
+ |
if (exten!=NULL && !strcasecmp(exten,extenpattern)) |
| 74 |
+ |
{ |
| 75 |
+ |
printf("found extension %s\n",dir->d_name); |
| 76 |
+ |
return (1); |
| 77 |
+ |
} |
| 78 |
+ |
|
| 79 |
+ |
return (0); |
| 80 |
+ |
|
| 81 |
|
} |
| 82 |
|
|
