10.11作业

#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <dirent.h>
#include <errno.h>
#include <sys/stat.h>
#include <unistd.h>
#include <time.h>
#include <pwd.h>
#include <grp.h>
//提取文件权限
int get_file(mode_t mode)
{
	int a=256;
	char p[64]="";
	for(int i=0;i<3;i++)
	{
       if((mode & a) !=0)
		   putchar('r');

	   else
		   putchar('-');

	   a=a/2;
       if((mode & a) !=0)
		   putchar('w');

	   else
		   putchar('-');

	   a=a/2;
       if((mode & a) !=0)
		   putchar('x');

	   else
		   putchar('-');

	   a=a/2;
	}

}
//提取文件类型
int get_filetype(mode_t m)
{
   switch(m &S_IFMT)
   {
    case S_IFSOCK: putchar('s');break;
    case S_IFLNK: putchar('l');break;
    case S_IFREG: putchar('-');break;
    case S_IFBLK: putchar('b');break;
    case S_IFDIR: putchar('d');break;
    case S_IFCHR: putchar('c');break;
    case S_IFIFO: putchar('p');break;
   }
  return 0;
}

int main(int argc, const char *argv[])
{
	DIR*dirp=opendir("./");
	if(NULL==dirp)
	{
	  perror("opendir");
	  return -1;
	}
	printf("opendir success\n");
	struct dirent* rp=NULL;
	while(1)
	{
	   rp=readdir(dirp);
	   if(NULL==rp)
	   {
	     if(0==errno)
		 {
		 printf("目录读取完毕");
		 break;
		 }
		 else
		 {
		   perror("readdir");
		   return -1;
		 }
	   }
	   //打印除影藏文件外所有文件
	   
	   if(rp->d_name[0]!='.')
	   {
	   printf("%s",rp->d_name);
	   }
	struct stat buf;//定义一个结构体
	char arr[128]="./";
	strcat(arr,rp->d_name);
	if(stat(arr,&buf)<0)
	{
	 perror("stat");
	 return -1;
	}

     get_filetype(buf.st_mode);
    get_file(buf.st_mode);
	

	printf("\t%lu\t",buf.st_nlink);

	struct passwd* pwd=getpwuid(buf.st_uid);
	if(NULL == pwd)
	{
	  perror("getpwuid");
	  return -1;
	}
	printf("%s\t",pwd->pw_name);
	struct group* grp=getgrgid(buf.st_gid);
	if(NULL == grp)
	{
	  perror("getpwuid");
	  return -1;
	}
	printf("%s\t", grp->gr_name);

	printf("size:%ld\t",buf.st_size);
	struct tm*  info=localtime(&buf.st_ctime);
		printf("time:%02d-%02d:%02d:%02d\n",\
		info->tm_mon+1,info->tm_mday,info->tm_hour,info->tm_min);
	}
	


	return 0;
}