mfs-1.6.27-1.gz

/* Copyright 2005-2010 Jakub Kruszona-Zawadzki, Gemius SA. This file is part of MooseFS. MooseFS is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 3. MooseFS is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with MooseFS. If not, see <http://www.gnu.org/licenses/>. */ #include "config.h" #include <stdio.h> #include <stdlib.h> #include <string.h> #include <syslog.h> #include <unistd.h> #include <sys/types.h> #ifdef HAVE_PWD_H #include <pwd.h> #endif #include <sys/stat.h> #include <inttypes.h> #include <errno.h> #include "MFSCommunication.h" // #define CACHENOTIFY 1 #ifndef METARESTORE #include "matoclserv.h" #include "matocsserv.h" #endif #include "chunks.h" #include "filesystem.h" #include "datapack.h" #include "slogger.h" #include "massert.h" #ifndef METARESTORE #include "datacachemgr.h" #include "cfg.h" #include "main.h" #include "changelog.h" #endif #define USE_FREENODE_BUCKETS 1 #define USE_CUIDREC_BUCKETS 1 #define EDGEHASH 1 #define NODEHASHBITS (22) #define NODEHASHSIZE (1<<NODEHASHBITS) #define NODEHASHPOS(nodeid) ((nodeid)&(NODEHASHSIZE-1)) #ifdef EDGEHASH #define EDGEHASHBITS (22) #define EDGEHASHSIZE (1<<EDGEHASHBITS) #define EDGEHASHPOS(hash) ((hash)&(EDGEHASHSIZE-1)) #define LOOKUPNOHASHLIMIT 10 #endif #define XATTR_INODE_HASH_SIZE 65536 #define XATTR_DATA_HASH_SIZE 524288 /* #ifdef CACHENOTIFY #define ATTR_CACHE_DISABLE_DELTA 10 #define ATTR_CACHE_ENABLE_DELTA 120 #endif */ //#define GOAL(x) ((x)&0xF) //#define DELETE(x) (((x)>>4)&1) //#define SETGOAL(x,y) ((x)=((x)&0xF0)|((y)&0xF)) //#define SETDELETE(x,y) ((x)=((x)&0xF)|((y)&0x10)) #define DEFAULT_GOAL 1 #define DEFAULT_TRASHTIME 86400 #define MAXFNAMELENG 255 #define MAX_INDEX 0x7FFFFFFF #define CHIDS_NO 0 #define CHIDS_YES 1 #define CHIDS_AUTO 2 #ifndef METARESTORE typedef struct _bstnode { uint32_t val,count; struct _bstnode *left,*right; } bstnode; #endif typedef struct _sessionidrec { uint32_t sessionid; struct _sessionidrec *next; } sessionidrec; struct _fsnode; typedef struct _fsedge { struct _fsnode *child,*parent; struct _fsedge *nextchild,*nextparent; struct _fsedge **prevchild,**prevparent; #ifdef EDGEHASH struct _fsedge *next,**prev; #endif uint16_t nleng; // uint16_t nhash; uint8_t *name; } fsedge; #ifndef METARESTORE typedef struct _statsrecord { uint32_t inodes; uint32_t dirs; uint32_t files; uint32_t chunks; uint64_t length; uint64_t size; uint64_t realsize; } statsrecord; #endif typedef struct _quotanode { uint8_t exceeded; // hard quota exceeded or soft quota reached time limit uint8_t flags; uint32_t stimestamp; // time when soft quota exceeded uint32_t sinodes,hinodes; uint64_t slength,hlength; uint64_t ssize,hsize; uint64_t srealsize,hrealsize; struct _fsnode *node; struct _quotanode *next,**prev; } quotanode; static quotanode *quotahead; typedef struct _xattr_data_entry { uint32_t inode; uint8_t anleng; uint32_t avleng; uint8_t *attrname; uint8_t *attrvalue; struct _xattr_data_entry **previnode,*nextinode; struct _xattr_data_entry **prev,*next; } xattr_data_entry; typedef struct _xattr_inode_entry { uint32_t inode; uint32_t anleng; uint32_t avleng; struct _xattr_data_entry *data_head; struct _xattr_inode_entry *next; } xattr_inode_entry; static xattr_inode_entry **xattr_inode_hash; static xattr_data_entry **xattr_data_hash; #ifndef METARESTORE static uint32_t QuotaTimeLimit; #endif typedef struct _fsnode { uint32_t id; uint32_t ctime,mtime,atime; uint8_t type; uint8_t goal; uint16_t mode; // only 12 lowest bits are used for mode, in unix standard upper 4 are used for object type, but since there is field "type" this bits can be used as extra flags uint32_t uid; uint32_t gid; uint32_t trashtime; union _data { struct _ddata { // type==TYPE_DIRECTORY fsedge *children; uint32_t nlink; uint32_t elements; // uint8_t quotaexceeded:1; // quota exceeded #ifndef METARESTORE statsrecord *stats; #endif quotanode *quota; } ddata; struct _sdata { // type==TYPE_SYMLINK uint32_t pleng; uint8_t *path; /* #ifdef CACHENOTIFY uint32_t lastattrchange; // even - store attr in cache / odd - do not store attr in cache #endif */ } sdata; struct _devdata { uint32_t rdev; // type==TYPE_BLOCKDEV ; type==TYPE_CHARDEV /* #ifdef CACHENOTIFY uint32_t lastattrchange; // even - store attr in cache / odd - do not store attr in cache #endif */ } devdata; struct _fdata { // type==TYPE_FILE ; type==TYPE_TRASH ; type==TYPE_RESERVED uint64_t length; uint64_t *chunktab; uint32_t chunks; /* #ifdef CACHENOTIFY uint32_t lastattrchange; // even - store attr in cache / odd - do not store attr in cache #endif */ sessionidrec *sessionids; } fdata; /* #ifdef CACHENOTIFY struct _odata { uint32_t lastattrchange; // even - store attr in cache / odd - do not store attr in cache } odata; #endif */ } data; fsedge *parents; struct _fsnode *next; } fsnode; typedef struct _freenode { uint32_t id; uint32_t ftime; struct _freenode *next; } freenode; static uint32_t *freebitmask; static uint32_t bitmasksize; static uint32_t searchpos; static freenode *freelist,**freetail; static fsedge *trash; static fsedge *reserved; static fsnode *root; static fsnode* nodehash[NODEHASHSIZE]; #ifdef EDGEHASH static fsedge* edgehash[EDGEHASHSIZE]; #endif static uint32_t maxnodeid; static uint32_t nextsessionid; static uint32_t nodes; static uint64_t metaversion; static uint64_t trashspace; static uint64_t reservedspace; static uint32_t trashnodes; static uint32_t reservednodes; static uint32_t filenodes; static uint32_t dirnodes; #ifndef METARESTORE static uint32_t BackMetaCopies; #define MSGBUFFSIZE 1000000 #define ERRORS_LOG_MAX 500 static uint32_t fsinfo_files=0; static uint32_t fsinfo_ugfiles=0; static uint32_t fsinfo_mfiles=0; static uint32_t fsinfo_chunks=0; static uint32_t fsinfo_ugchunks=0; static uint32_t fsinfo_mchunks=0; static char *fsinfo_msgbuff=NULL; static uint32_t fsinfo_msgbuffleng=0; static uint32_t fsinfo_loopstart=0; static uint32_t fsinfo_loopend=0; static uint32_t test_start_time; static uint32_t stats_statfs=0; static uint32_t stats_getattr=0; static uint32_t stats_setattr=0; static uint32_t stats_lookup=0; static uint32_t stats_mkdir=0; static uint32_t stats_rmdir=0; static uint32_t stats_symlink=0; static uint32_t stats_readlink=0; static uint32_t stats_mknod=0; static uint32_t stats_unlink=0; static uint32_t stats_rename=0; static uint32_t stats_link=0; static uint32_t stats_readdir=0; static uint32_t stats_open=0; static uint32_t stats_read=0; static uint32_t stats_write=0; void fs_stats(uint32_t stats[16]) { stats[0] = stats_statfs; stats[1] = stats_getattr; stats[2] = stats_setattr; stats[3] = stats_lookup; stats[4] = stats_mkdir; stats[5] = stats_rmdir; stats[6] = stats_symlink; stats[7] = stats_readlink; stats[8] = stats_mknod; stats[9] = stats_unlink; stats[10] = stats_rename; stats[11] = stats_link; stats[12] = stats_readdir; stats[13] = stats_open; stats[14] = stats_read; stats[15] = stats_write; stats_statfs=0; stats_getattr=0; stats_setattr=0; stats_lookup=0; stats_mkdir=0; stats_rmdir=0; stats_symlink=0; stats_readlink=0; stats_mknod=0; stats_unlink=0; stats_rename=0; stats_link=0; stats_readdir=0; stats_open=0; stats_read=0; stats_write=0; } #endif #ifdef USE_FREENODE_BUCKETS #define FREENODE_BUCKET_SIZE 5000 typedef struct _freenode_bucket { freenode bucket[FREENODE_BUCKET_SIZE]; uint32_t firstfree; struct _freenode_bucket *next; } freenode_bucket; static freenode_bucket *fnbhead = NULL; static freenod