disksim_cachemem.h

来自「disksim是一个非常优秀的磁盘仿真工具」· C头文件 代码 · 共 285 行

H
285
字号
/* * DiskSim Storage Subsystem Simulation Environment (Version 4.0) * Revision Authors: John Bucy, Greg Ganger * Contributors: John Griffin, Jiri Schindler, Steve Schlosser * * Copyright (c) of Carnegie Mellon University, 2001-2008. * * This software is being provided by the copyright holders under the * following license. By obtaining, using and/or copying this software, * you agree that you have read, understood, and will comply with the * following terms and conditions: * * Permission to reproduce, use, and prepare derivative works of this * software is granted provided the copyright and "No Warranty" statements * are included with all reproductions and derivative works and associated * documentation. This software may also be redistributed without charge * provided that the copyright and "No Warranty" statements are included * in all redistributions. * * NO WARRANTY. THIS SOFTWARE IS FURNISHED ON AN "AS IS" BASIS. * CARNEGIE MELLON UNIVERSITY MAKES NO WARRANTIES OF ANY KIND, EITHER * EXPRESSED OR IMPLIED AS TO THE MATTER INCLUDING, BUT NOT LIMITED * TO: WARRANTY OF FITNESS FOR PURPOSE OR MERCHANTABILITY, EXCLUSIVITY * OF RESULTS OR RESULTS OBTAINED FROM USE OF THIS SOFTWARE. CARNEGIE * MELLON UNIVERSITY DOES NOT MAKE ANY WARRANTY OF ANY KIND WITH RESPECT * TO FREEDOM FROM PATENT, TRADEMARK, OR COPYRIGHT INFRINGEMENT. * COPYRIGHT HOLDERS WILL BEAR NO LIABILITY FOR ANY USE OF THIS SOFTWARE * OR DOCUMENTATION. * *//* * DiskSim Storage Subsystem Simulation Environment (Version 2.0) * Revision Authors: Greg Ganger * Contributors: Ross Cohen, John Griffin, Steve Schlosser * * Copyright (c) of Carnegie Mellon University, 1999. * * Permission to reproduce, use, and prepare derivative works of * this software for internal use is granted provided the copyright * and "No Warranty" statements are included with all reproductions * and derivative works. This software may also be redistributed * without charge provided that the copyright and "No Warranty" * statements are included in all redistributions. * * NO WARRANTY. THIS SOFTWARE IS FURNISHED ON AN "AS IS" BASIS. * CARNEGIE MELLON UNIVERSITY MAKES NO WARRANTIES OF ANY KIND, EITHER * EXPRESSED OR IMPLIED AS TO THE MATTER INCLUDING, BUT NOT LIMITED * TO: WARRANTY OF FITNESS FOR PURPOSE OR MERCHANTABILITY, EXCLUSIVITY * OF RESULTS OR RESULTS OBTAINED FROM USE OF THIS SOFTWARE. CARNEGIE * MELLON UNIVERSITY DOES NOT MAKE ANY WARRANTY OF ANY KIND WITH RESPECT * TO FREEDOM FROM PATENT, TRADEMARK, OR COPYRIGHT INFRINGEMENT. *//* * DiskSim Storage Subsystem Simulation Environment * Authors: Greg Ganger, Bruce Worthington, Yale Patt * * Copyright (C) 1993, 1995, 1997 The Regents of the University of Michigan  * * This software is being provided by the copyright holders under the * following license. By obtaining, using and/or copying this software, * you agree that you have read, understood, and will comply with the * following terms and conditions: * * Permission to use, copy, modify, distribute, and sell this software * and its documentation for any purpose and without fee or royalty is * hereby granted, provided that the full text of this NOTICE appears on * ALL copies of the software and documentation or portions thereof, * including modifications, that you make. * * THIS SOFTWARE IS PROVIDED "AS IS," AND COPYRIGHT HOLDERS MAKE NO * REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF EXAMPLE, * BUT NOT LIMITATION, COPYRIGHT HOLDERS MAKE NO REPRESENTATIONS OR * WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR * THAT THE USE OF THE SOFTWARE OR DOCUMENTATION WILL NOT INFRINGE ANY * THIRD PARTY PATENTS, COPYRIGHTS, TRADEMARKS OR OTHER RIGHTS. COPYRIGHT * HOLDERS WILL BEAR NO LIABILITY FOR ANY USE OF THIS SOFTWARE OR * DOCUMENTATION. * *  This software is provided AS IS, WITHOUT REPRESENTATION FROM THE * UNIVERSITY OF MICHIGAN AS TO ITS FITNESS FOR ANY PURPOSE, AND * WITHOUT WARRANTY BY THE UNIVERSITY OF MICHIGAN OF ANY KIND, EITHER * EXPRESSED OR IMPLIED, INCLUDING WITHOUT LIMITATION THE IMPLIED * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE REGENTS * OF THE UNIVERSITY OF MICHIGAN SHALL NOT BE LIABLE FOR ANY DAMAGES, * INCLUDING SPECIAL , INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, * WITH RESPECT TO ANY CLAIM ARISING OUT OF OR IN CONNECTION WITH THE * USE OF OR IN CONNECTION WITH THE USE OF THE SOFTWARE, EVEN IF IT HAS * BEEN OR IS HEREAFTER ADVISED OF THE POSSIBILITY OF SUCH DAMAGES * * The names and trademarks of copyright holders or authors may NOT be * used in advertising or publicity pertaining to the software without * specific, written prior permission. Title to copyright in this software * and any associated documentation will at all times remain with copyright * holders. */#ifndef DISKSIM_CACHEMEM_H#define DISKSIM_CACHEMEM_H#include "disksim_global.h"#include "disksim_iosim.h"#include "disksim_ioqueue.h"#include "config.h"#include "disksim_cache.h"#define CACHE_MAXSEGMENTS	10		/* For S-LRU */#define CACHE_LOCKSPERSTRUCT	15#define CACHE_HASHSIZE		(ALLOCSIZE/sizeof(int))#define CACHE_HASHMASK		(0x00000000 | (CACHE_HASHSIZE - 1))typedef struct cachelockh {   struct ioreq_ev *entry[CACHE_LOCKSPERSTRUCT];   struct cachelockh *next;} cache_lockholders;typedef struct cachelockw {   struct cache_mem_event *entry[CACHE_LOCKSPERSTRUCT];   struct cachelockw *next;} cache_lockwaiters;typedef struct cacheatom {   struct cacheatom *hash_next;   struct cacheatom *hash_prev;   struct cacheatom *line_next;   struct cacheatom *line_prev;   int devno;   int lbn;   int state;   struct cacheatom *lru_next;   struct cacheatom *lru_prev;   cache_lockholders *readlocks;   ioreq_event *writelock;   cache_lockwaiters *lockwaiters;   int busno;   int slotno;} cache_atom;struct cache_mem_event {   double time;   int type;   struct cache_mem_event *next;   struct cache_mem_event *prev;   void (**donefunc)(void *,ioreq_event *);	/* Function to call when complete */   void *doneparam;		/* parameter for donefunc */   int flags;   ioreq_event *req;   int accblkno;		/* start blkno of waited for ioacc */   cache_atom *cleaned;   cache_atom *lineprev;   int locktype;   int lockstop;   int allocstop;   struct cache_mem_event *waitees;   int validpoint;};struct cache_mem_stats {    int reads;   int readatoms;   int readhitsfull;   int readhitsfront;   int readhitsback;   int readhitsmiddle;   int readmisses;   int fillreads;   int fillreadatoms;   int writes;   int writeatoms;   int writehitsclean;   int writehitsdirty;   int writemisses;   int writeinducedfills;   int writeinducedfillatoms;   int destagewrites;   int destagewriteatoms;   int getblockreadstarts;   int getblockreaddones;   int getblockwritestarts;   int getblockwritedones;   int freeblockcleans;   int freeblockdirtys;};typedef struct {                    /* per-set structure for set-associative */   cache_atom *freelist;   int space;   cache_atom *lru[CACHE_MAXSEGMENTS];   int numactive[CACHE_MAXSEGMENTS];   int maxactive[CACHE_MAXSEGMENTS];} cache_mapentry;struct cache_mem {  struct cache_if hdr;   cache_atom *hash[CACHE_HASHSIZE];   void (**issuefunc)(void *,ioreq_event *);	/* to issue a disk access    */   void *issueparam;				/* first param for issuefunc */   struct ioq * (**queuefind)(void *,int);	/* to get ioqueue ptr for dev*/   void *queuefindparam;			/* first param for queuefind */   //void (**wakeupfunc)(void *, void *);	/* to re-activate slept proc */   void (**wakeupfunc)(void *, struct cacheevent *);	/* to re-activate slept proc */   void *wakeupparam;				/* first param for wakeupfunc */   int size;					/* in 512B blks  */   int atomsize;   int numsegs;					/* for S-LRU */   int linesize;   int atomsperbit;   int lockgran;   int sharedreadlocks;   int maxreqsize;   int replacepolicy;   int mapmask;   int writescheme;   int read_prefetch_type;   int writefill_prefetch_type;   int prefetch_waitfor_locks;   int startallflushes;   int allocatepolicy;   int read_line_by_line;   int write_line_by_line;   int maxscatgath;   int no_write_allocate;   int flush_policy;   double flush_period;   double flush_idledelay;   int flush_maxlinecluster;   cache_mapentry *map;   int linebylinetmp;   struct cache_mem_event *IOwaiters;   struct cache_mem_event *partwrites;   struct cache_mem_event *linewaiters;   struct cache_mem_stats stat;   char *name;};/* cache replacement policies */#define CACHE_REPLACE_MIN	1#define CACHE_REPLACE_FIFO	1#define CACHE_REPLACE_SLRU	2#define CACHE_REPLACE_RANDOM	3#define CACHE_REPLACE_LIFO	4#define CACHE_REPLACE_MAX	4/* cache write schemes */#define CACHE_WRITE_MIN		1#define CACHE_WRITE_SYNCONLY	1#define CACHE_WRITE_THRU	2#define CACHE_WRITE_BACK	3#define CACHE_WRITE_MAX		3/* cache allocate policy flags */#define CACHE_ALLOCATE_MIN		0#define CACHE_ALLOCATE_NONDIRTY		1#define CACHE_ALLOCATE_MAX		1/* cache prefetch types */#define CACHE_PREFETCH_MIN		0#define CACHE_PREFETCH_NONE		0#define CACHE_PREFETCH_FRONTOFLINE	1#define CACHE_PREFETCH_RESTOFLINE	2#define CACHE_PREFETCH_ALLOFLINE	3#define CACHE_PREFETCH_MAX		3/* cache background flush types */#define CACHE_FLUSH_MIN		0#define CACHE_FLUSH_DEMANDONLY	0#define CACHE_FLUSH_PERIODIC	1#define CACHE_FLUSH_MAX		1void cachemem_setcallbacks(void);#endif // DISKSIM_CACHEMEM_H

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?