linux下文件二级系统设计

本文深入探讨了Linux操作系统下的二级文件系统设计,包括其架构原理、挂载机制以及如何在不同文件系统间进行切换。重点讲解了VFS(虚拟文件系统)在其中的作用,以及EXT4、XFS等常见文件系统的集成方式,为理解Linux内核的文件管理提供了关键信息。
摘要由CSDN通过智能技术生成

#include <iostream>
#include <stdlib.h>
#include<string.h>
#include<curses.h>
using namespace std;
typedef struct User
{
string name[30];
string passwd[30];
int n;
}User,u;
typedef struct Priv
{
char read;
char write;
char execute;
}Priv,priv[3];
typedef struct DataStock
{
int name;
int stock_num;
struct DataStock *next;
}DataStock,*ds;
typedef struct Inode
{
int inode_num;
int type;
float size;
Priv *priv;
char* owneruser;
struct tm *createtime;
struct Inode** childnode;
struct DataStock *datastock;
}Inode;
typedef struct Dentry
{
string name;
struct Inode *inode;
}Dentry;

int number = 1000;
string rootDirect = "/home";
string currentUser=" ";
string currentPath = rootDirect;

User user;
Dentry dentry[1000];
int of_record = 0;
int record = -1;

int disk_record = 0;
int disk_stock = 3;
string *disk =new string[number]; //模拟磁盘存储
int firstempty=0;

int command_number = 10;
int command_record=0;
string *commandsave =new string[command_number];
int umask_direct = 775;
int umask_file = 664;
void test(){
for(int i =0;i<disk_record;i++)
{
cout<<disk[i];
}
}
void showDisk(){
for(int i =0;i<disk_record;i++)
{
cout<<"第"<<i<<"个磁盘块:"<<disk[i]<<endl;
}
}
void output(){
cout<<"["<<currentUser<<"@"<<"localhost"<<currentPath<<"]#";
}
//数据块节点初始化
DataStock *initializeStock()
{
DataStock *head;
head = (DataStock*)malloc(sizeof(DataStock));
head->name = -1;
head->next = NULL;
return head;
}
//inode节点初始化
Inode *initializeInode(int type,string u,int p)
{
Inode *inode=NULL;
inode = (Inode*)malloc(sizeof(Inode));
inode->childnode = (Inode**)malloc(100*sizeof(Inode*));
inode->inode_num = 0;
inode->type = type;
inode->datastock = initializeStock();
inode->size = 0;
if(p==0) inode->owneruser = (char*)u.data();
else inode->owneruser = (char*)currentUser.data();
time_t ctime;
time(&ctime);
inode->createtime=localtime(&ctime);
//权限初始化
Priv *priv = (Priv*)malloc(sizeof(Priv));
if(type==0)
{
priv[0].read='r';priv[0].write='w';priv[0].execute='-';
priv[1].read='r';priv[1].write='w';priv[1].execute='-';
priv[2].read='r';priv[2].write='-';priv[2].execute='-';
}
else
{
priv[0].read='r';priv[0].write='w';priv[0].execute='x';
priv[1].read='r';priv[1].write='w';priv[1].execute='x';
priv[2].read='r';
priv[2].write='-';
priv[2].execute='-';
}
inode->priv = priv;
return inode;
}
//根据目录项名字找对应的目录项
Dentry findDentry(char *dentryname)
{
Dentry temp;
for(int i = 0;i<=record;i++)
{
if(strcmp((char*)dentry[i].name.data(),dentryname)==0)
{
temp = dentry[i];
break;
}
}
return temp;
}
//根据inode节点找相对应的目录项
Dentry searchDentry(Inode *inode){

Dentry temp;
for(int i = 0;i<=record;i++)
{
if(dentry[i].inode==inode)
{
temp = dentry[i];
break;
}
}
return temp;
}
//得到当前路径,如/home/root/sxw,最终返回结果为sxw
int getEndPath(string endname)
{
int i = 0;
for(i = endname.size();i>=0;i--)
{
if(endname[i]!='/')
{
continue;
}
break;
}
return (i+1);
}
int judge(string path)
{
int result &#
  • 5
    点赞
  • 26
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值