shim_fs.h 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624
  1. /* -*- mode:c; c-file-style:"k&r"; c-basic-offset: 4; tab-width:4; indent-tabs-mode:nil; mode:auto-fill; fill-column:78; -*- */
  2. /* vim: set ts=4 sw=4 et tw=78 fo=cqt wm=0: */
  3. /* Copyright (C) 2014 Stony Brook University
  4. This file is part of Graphene Library OS.
  5. Graphene Library OS is free software: you can redistribute it and/or
  6. modify it under the terms of the GNU Lesser General Public License
  7. as published by the Free Software Foundation, either version 3 of the
  8. License, or (at your option) any later version.
  9. Graphene Library OS is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public License
  14. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  15. /*
  16. * shim_fs.h
  17. *
  18. * Definitions of types and functions for file system bookkeeping.
  19. */
  20. #ifndef _SHIM_FS_H_
  21. #define _SHIM_FS_H_
  22. #include <stdbool.h>
  23. #include <shim_types.h>
  24. #include <shim_defs.h>
  25. #include <shim_handle.h>
  26. #include <shim_utils.h>
  27. #include <pal.h>
  28. #include <list.h>
  29. struct shim_handle;
  30. #define FS_POLL_RD 0x01
  31. #define FS_POLL_WR 0x02
  32. #define FS_POLL_ER 0x04
  33. #define FS_POLL_SZ 0x08
  34. struct shim_fs_ops {
  35. /* mount: moun an uri to the certain location */
  36. int (*mount) (const char * uri, const char * root, void ** mount_data);
  37. int (*unmount) (void * mount_data);
  38. /* close: clean up the file state inside the handle */
  39. int (*close) (struct shim_handle * hdl);
  40. /* read: the content from the file opened as handle */
  41. int (*read) (struct shim_handle * hdl, void * buf, size_t count);
  42. /* write: the content from the file opened as handle */
  43. int (*write) (struct shim_handle * hdl, const void * buf, size_t count);
  44. /* mmap: mmap handle to address */
  45. int (*mmap) (struct shim_handle * hdl, void ** addr, size_t size,
  46. int prot, int flags, off_t offset);
  47. /* flush: flush out user buffer */
  48. int (*flush) (struct shim_handle * hdl);
  49. /* seek: the content from the file opened as handle */
  50. int (*seek) (struct shim_handle * hdl, off_t offset, int wence);
  51. /* move, copy: rename or duplicate the file */
  52. int (*move) (const char * trim_old_name, const char * trim_new_name);
  53. int (*copy) (const char * trim_old_name, const char * trim_new_name);
  54. int (*truncate) (struct shim_handle * hdl, uint64_t len);
  55. /* hstat: get status of the file */
  56. int (*hstat) (struct shim_handle * hdl, struct stat * buf);
  57. /* setflags: set flags of the file */
  58. int (*setflags) (struct shim_handle * hdl, int flags);
  59. /* hput: delete the handle and close the PAL handle. */
  60. void (*hput) (struct shim_handle * hdl);
  61. /* lock and unlock the file */
  62. int (*lock) (const char * trim_name);
  63. int (*unlock) (const char * trim_name);
  64. /* lock and unlock the file system */
  65. int (*lockfs) (void);
  66. int (*unlockfs) (void);
  67. /* checkout/reowned/checkin a single handle for migration */
  68. int (*checkout) (struct shim_handle * hdl);
  69. int (*checkin) (struct shim_handle * hdl);
  70. /* poll a single handle */
  71. /* POLL_RD|POLL_WR: return POLL_RD|POLL_WR for readable|writeable,
  72. POLL_ER for failure, -EAGAIN for unknown. */
  73. /* POLL_SZ: return total size */
  74. int (*poll) (struct shim_handle * hdl, int poll_type);
  75. /* checkpoint/migrate the filesystem */
  76. int (*checkpoint) (void ** checkpoint, void * mount_data);
  77. int (*migrate) (void * checkpoint, void ** mount_data);
  78. };
  79. #define DENTRY_VALID 0x0001 /* this dentry is verified to be valid */
  80. #define DENTRY_NEGATIVE 0x0002 /* negative, recently deleted */
  81. #define DENTRY_RECENTLY 0x0004 /* recently used */
  82. #define DENTRY_PERSIST 0x0008 /* added as a persistent dentry */
  83. #define DENTRY_HASHED 0x0010 /* added in the dcache */
  84. #define DENTRY_MOUNTPOINT 0x0040 /* this dentry is a mount point */
  85. #define DENTRY_ISLINK 0x0080 /* this dentry is a link */
  86. #define DENTRY_ISDIRECTORY 0x0100 /* this dentry is a directory */
  87. #define DENTRY_LOCKED 0x0200 /* locked by mountpoints at children */
  88. /* These flags are not used */
  89. //#define DENTRY_REACHABLE 0x0400 /* permission checked to be reachable */
  90. //#define DENTRY_UNREACHABLE 0x0800 /* permission checked to be unreachable */
  91. #define DENTRY_LISTED 0x1000 /* children in directory listed */
  92. #define DENTRY_INO_UPDATED 0x2000 /* ino updated */
  93. #define DENTRY_ANCESTOR 0x4000 /* Auto-generated dentry to connect a mount
  94. * point in the manifest to the root, when
  95. * one or more intermediate directories do
  96. * not exist on the underlying FS. The
  97. * semantics of subsequent changes to such
  98. * directories (or attempts to really
  99. * create them) are not currently
  100. * well-defined. */
  101. // Catch memory corruption issues by checking for invalid state values
  102. #define DENTRY_INVALID_FLAGS ~0x7FFF
  103. #define DCACHE_HASH_SIZE 1024
  104. #define DCACHE_HASH(hash) ((hash) & (DCACHE_HASH_SIZE - 1))
  105. DEFINE_LIST(shim_dentry);
  106. DEFINE_LISTP(shim_dentry);
  107. struct shim_dentry {
  108. int state; /* flags for managing state */
  109. struct shim_mount * fs; /* this dentry's mounted fs */
  110. struct shim_qstr rel_path; /* the path is relative to
  111. its mount point */
  112. struct shim_qstr name; /* caching the file's name. */
  113. /* DEP 6/16/17: For now, let's try not hashing; I suspect it is
  114. * overkill for most purposes. I'll leave the field here for now,
  115. * but propose we move to a per-directory table to accelerate lookups,
  116. * rather than a global table, since this just supports one process.
  117. */
  118. LIST_TYPE(shim_dentry) hlist; /* to resolve collisions in
  119. the hash table */
  120. LIST_TYPE(shim_dentry) list; /* put dentry to different list
  121. according to its availability,
  122. persistent or freeable */
  123. struct shim_dentry * parent;
  124. int nchildren;
  125. LISTP_TYPE(shim_dentry) children; /* These children and siblings link */
  126. LIST_TYPE(shim_dentry) siblings;
  127. struct shim_mount * mounted;
  128. void * data;
  129. unsigned long ino;
  130. mode_t type;
  131. mode_t mode;
  132. LOCKTYPE lock;
  133. REFTYPE ref_count;
  134. };
  135. struct shim_d_ops {
  136. /* open: provide a filename relative to the mount point and flags,
  137. modify the shim handle, file_data is "inode" equivalent */
  138. int (*open) (struct shim_handle * hdl, struct shim_dentry * dent,
  139. int flags);
  140. /* look up dentry and allocate internal data.
  141. *
  142. * On a successful lookup (non-error, can be negative),
  143. * this function should call get_new_dentry(), populating additional fields,
  144. * and storing the new dentry in dent.
  145. *
  146. * Maybe drop force?
  147. */
  148. int (*lookup) (struct shim_dentry * dent, bool force);
  149. /* this is to check file type and access, returning the stat.st_mode */
  150. int (*mode) (struct shim_dentry * dent, mode_t * mode, bool force);
  151. /* detach internal data from dentry */
  152. int (*dput) (struct shim_dentry * dent);
  153. /* create a dentry inside a directory */
  154. int (*creat) (struct shim_handle * hdl, struct shim_dentry * dir,
  155. struct shim_dentry * dent, int flags, mode_t mode);
  156. /* unlink a dentry inside a directory */
  157. int (*unlink) (struct shim_dentry * dir, struct shim_dentry * dent);
  158. /* create a directory inside a directory */
  159. int (*mkdir) (struct shim_dentry * dir, struct shim_dentry * dent,
  160. mode_t mode);
  161. /* stat: get status of the file */
  162. int (*stat) (struct shim_dentry * dent, struct stat * buf);
  163. /* extracts the symlink name and saves in link */
  164. int (*follow_link) (struct shim_dentry * dent, struct shim_qstr * link);
  165. /* set up symlink name to a dentry */
  166. int (*set_link) (struct shim_dentry * dent, const char * link);
  167. /* change the mode or owner of a dentry */
  168. int (*chmod) (struct shim_dentry * dent, mode_t mode);
  169. int (*chown) (struct shim_dentry * dent, int uid, int gid);
  170. /* change the name of a dentry */
  171. int (*rename) (struct shim_dentry * old, struct shim_dentry * new);
  172. /* readdir: given the path relative to the mount point, read the childs
  173. into the the buffer. This call always returns everything under
  174. the directory in one big buffer; you do not need to try again
  175. or keep a cursor in the directory. You do need to free the
  176. returned buffer. */
  177. int (*readdir) (struct shim_dentry * dent, struct shim_dirent ** dirent);
  178. };
  179. #define MAX_PATH 4096
  180. #define MAX_FILENAME 255
  181. DEFINE_LIST(shim_mount);
  182. struct shim_mount {
  183. char type[8]; // Null-terminated.
  184. struct shim_dentry * mount_point;
  185. struct shim_qstr path;
  186. struct shim_qstr uri;
  187. struct shim_fs_ops * fs_ops;
  188. struct shim_d_ops * d_ops;
  189. struct shim_dentry * root;
  190. void * data;
  191. void * cpdata;
  192. size_t cpsize;
  193. REFTYPE ref_count;
  194. LIST_TYPE(shim_mount) hlist;
  195. LIST_TYPE(shim_mount) list;
  196. };
  197. extern struct shim_dentry * dentry_root;
  198. #define LOOKUP_FOLLOW 001
  199. #define LOOKUP_DIRECTORY 002
  200. #define LOOKUP_CONTINUE 004 // No longer needed
  201. #define LOOKUP_PARENT 010 // Not sure we need this
  202. #define F_OK 0
  203. // XXX: Duplicate definition; should probably weed out includes of host system
  204. //include of unistd.h in future work
  205. //#define R_OK 001
  206. //#define W_OK 002
  207. //#define X_OK 004
  208. #define MAY_EXEC 001
  209. #define MAY_WRITE 002
  210. #define MAY_READ 004
  211. #if 0
  212. #define MAY_APPEND 010
  213. #endif
  214. #define NO_MODE ((mode_t) -1)
  215. #define ACC_MODE(x) ((((x) == O_RDONLY || (x) == O_RDWR) ? MAY_READ : 0) | \
  216. (((x) == O_WRONLY || (x) == O_RDWR) ? MAY_WRITE : 0))
  217. #define LOOKUP_OPEN 0100 // Appears to be ignored
  218. #define LOOKUP_CREATE 0200
  219. #define LOOKUP_ACCESS 0400 // Appears to be ignored
  220. #define LOOKUP_SYNC (LOOKUP_OPEN|LOOKUP_CREATE|LOOKUP_ACCESS)
  221. enum lookup_type {
  222. LAST_NORM,
  223. LAST_ROOT,
  224. LAST_DOT,
  225. LAST_DOTDOT,
  226. LAST_BIND
  227. };
  228. struct lookup {
  229. struct shim_dentry * dentry;
  230. struct shim_mount * mount;
  231. const char * last;
  232. int depth;
  233. int flags;
  234. enum lookup_type last_type;
  235. };
  236. /* initialization for fs and mounts */
  237. int init_fs (void);
  238. int init_mount_root (void);
  239. int init_mount (void);
  240. /* path utilities */
  241. const char * get_file_name (const char * path, size_t len);
  242. /* file system operations */
  243. int mount_fs (const char * mount_type, const char * mount_uri,
  244. const char * mount_point, struct shim_dentry *parent,
  245. struct shim_dentry **dentp, bool make_ancestor);
  246. int unmount_fs (const char * mount_point);
  247. int search_builtin_fs (const char * type, struct shim_mount ** fs);
  248. void get_mount (struct shim_mount * mount);
  249. void put_mount (struct shim_mount * mount);
  250. struct shim_mount * find_mount_from_uri (const char * uri);
  251. #include <shim_utils.h>
  252. static inline void set_handle_fs (struct shim_handle * hdl,
  253. struct shim_mount * fs)
  254. {
  255. get_mount(fs);
  256. hdl->fs = fs;
  257. memcpy(hdl->fs_type, fs->type, sizeof(hdl->fs_type));
  258. }
  259. int walk_mounts (int (*walk) (struct shim_mount * mount, void * arg),
  260. void * arg);
  261. /* functions for dcache supports */
  262. int init_dcache (void);
  263. extern LOCKTYPE dcache_lock;
  264. /* check permission (specified by mask) of a dentry. If force is not set,
  265. * permission is considered granted on invalid dentries */
  266. /* Assume caller has acquired dcache_lock */
  267. int permission (struct shim_dentry * dent, int mask, bool force);
  268. /* This function looks up a single dentry based on its parent dentry pointer
  269. * and the name. Namelen is the length of char * name.
  270. * The dentry is returned in pointer *new.
  271. *
  272. * The force flag causes the libOS to query the underlying file system for the
  273. * existence of the dentry, whereas without force, a negative dentry is
  274. * treated as definitive. In some cases, this can be elided as an
  275. * optimization.
  276. *
  277. * The caller should hold the dcache_lock.
  278. */
  279. int lookup_dentry (struct shim_dentry * parent, const char * name, int namelen,
  280. bool force, struct shim_dentry ** new, struct shim_mount * fs);
  281. /* Looks up path under start dentry. Saves in dent.
  282. *
  283. * Assumes dcache_lock is held; main difference from path_lookupat is that
  284. * dcache_lock is not released on return.
  285. *
  286. * The refcount is dropped by one on the returned dentry.
  287. *
  288. * The make_ancestor flag creates pseudo-dentries for any parent paths that
  289. * are not in cache and do not exist on the underlying file system. This is
  290. * intended for use only in setting up the file system view specified in the manifest.
  291. *
  292. * If the file isnt' found, returns -ENOENT.
  293. *
  294. * If the LOOKUP_DIRECTORY flag is set, and the found file isn't a directory,
  295. * returns -ENOTDIR.
  296. */
  297. int __path_lookupat (struct shim_dentry * start, const char * path, int flags,
  298. struct shim_dentry ** dent, int link_depth,
  299. struct shim_mount *fs, bool make_ancestor);
  300. /* Just wraps __path_lookupat, but also acquires and releases the dcache_lock.
  301. */
  302. int path_lookupat (struct shim_dentry * start, const char * name, int flags,
  303. struct shim_dentry ** dent, struct shim_mount *fs);
  304. /* This function initializes dir to before a search, to either point
  305. * to the current working directory (if dfd == AT_FDCWD), or to the handle pointed to by dfd,
  306. * depending on the argument.
  307. *
  308. * Returns -EBADF if dfd is <0 or not a valid handle.
  309. * Returns -ENOTDIR if dfd is not a directory.
  310. */
  311. int path_startat (int dfd, struct shim_dentry ** dir);
  312. /* Open path with given flags, in mode, similar to Unix open.
  313. *
  314. * The start dentry specifies where to begin the search.
  315. * hdl is an optional argument; if passed in, it is initialized to
  316. * refer to the opened path.
  317. *
  318. * The result is stored in dent.
  319. */
  320. int open_namei (struct shim_handle * hdl, struct shim_dentry * start,
  321. const char * path, int flags, int mode,
  322. struct shim_dentry ** dent);
  323. /* This function calls the low-level file system to do the work
  324. * of opening file indicated by dent, and initializing it in hdl.
  325. * Flags are standard open flags.
  326. *
  327. * If O_TRUNC is specified, this function is responsible for calling
  328. * the underlying truncate function.
  329. */
  330. int dentry_open (struct shim_handle * hdl, struct shim_dentry * dent,
  331. int flags);
  332. /* This function enumerates a directory and caches the results in the dentry.
  333. *
  334. * Input: A dentry for a directory in the DENTRY_ISDIRECTORY and not in the
  335. * DENTRY_LISTED state. The dentry DENTRY_LISTED flag is set upon success.
  336. *
  337. * Return value: 0 on success, <0 on error
  338. */
  339. int list_directory_dentry (struct shim_dentry *dir);
  340. /* This function caches the contents of a directory (dent), already
  341. * in the listed state, in a buffer associated with a handle (hdl).
  342. *
  343. * This function should only be called once on a handle.
  344. *
  345. * Returns 0 on success, <0 on failure.
  346. */
  347. int list_directory_handle (struct shim_dentry *dent, struct shim_handle *hdl );
  348. /* Increment the reference count on dent */
  349. void get_dentry (struct shim_dentry * dent);
  350. /* Decrement the reference count on dent */
  351. void put_dentry (struct shim_dentry * dent);
  352. static_always_inline
  353. void fast_pathcpy (char * dst, const char * src, int size, char ** ptr)
  354. {
  355. char * d = dst;
  356. const char * s = src;
  357. for (int i = 0 ; i < size ; i++, s++, d++)
  358. *d = *s;
  359. *ptr = d;
  360. }
  361. static_always_inline
  362. char * dentry_get_path (struct shim_dentry * dent, bool on_stack,
  363. int * sizeptr)
  364. {
  365. struct shim_mount * fs = dent->fs;
  366. char * buffer, * c;
  367. int bufsize = dent->rel_path.len + 1;
  368. if (fs)
  369. bufsize += fs->path.len + 1;
  370. if (on_stack) {
  371. c = buffer = __alloca(bufsize);
  372. } else {
  373. if (!(c = buffer = malloc(bufsize)))
  374. return NULL;
  375. }
  376. if (fs && !qstrempty(&fs->path))
  377. fast_pathcpy(c, qstrgetstr(&fs->path), fs->path.len, &c);
  378. if (dent->rel_path.len) {
  379. const char * path = qstrgetstr(&dent->rel_path);
  380. int len = dent->rel_path.len;
  381. if (c > buffer && *(c - 1) == '/') {
  382. if (*path == '/')
  383. path++;
  384. } else {
  385. if (*path != '/')
  386. *(c++) = '/';
  387. }
  388. fast_pathcpy(c, path, len, &c);
  389. }
  390. if (sizeptr)
  391. *sizeptr = c - buffer;
  392. *c = 0;
  393. return buffer;
  394. }
  395. static_always_inline
  396. const char * dentry_get_name (struct shim_dentry * dent)
  397. {
  398. return qstrgetstr(&dent->name);
  399. }
  400. /* Allocate and initialize a new dentry for path name, under
  401. * parent. Return the dentry.
  402. *
  403. * mount is the mountpoint the dentry is under; this is typically
  404. * the parent->fs, but is passed explicitly for initializing
  405. * the dentry of a mountpoint.
  406. *
  407. * If hashptr is passed (as an optimization), this is a hash
  408. * of the name.
  409. *
  410. * If parent is non-null, the ref count is 1; else it is zero.
  411. *
  412. * This function also sets up both a name and a relative path
  413. */
  414. struct shim_dentry * get_new_dentry (struct shim_mount *mount,
  415. struct shim_dentry * parent,
  416. const char * name, int namelen,
  417. HASHTYPE * hashptr);
  418. /* This function searches for name/namelen (as the relative path;
  419. * path/pathlen is the fully-qualified path),
  420. * under parent dentry (start).
  421. *
  422. * If requested, the expected hash of the dentry is returned in hashptr,
  423. * primarily so that the hashing can be reused to add the dentry later.
  424. *
  425. * The reference count on the found dentry is incremented by one.
  426. *
  427. * Used only by shim_namei.c
  428. */
  429. struct shim_dentry *
  430. __lookup_dcache (struct shim_dentry * start, const char * name, int namelen,
  431. const char * path, int pathlen, HASHTYPE * hashptr);
  432. /* This function recursively deletes and frees all dentries under root
  433. *
  434. * XXX: Current code doesn't do a free..
  435. */
  436. int __del_dentry_tree(struct shim_dentry * root);
  437. /* XXX: Future work: current dcache never shrinks. Would be nice
  438. * to be able to do something like LRU under space pressure, although
  439. * for a single app, this may be over-kill. */
  440. /* hashing utilities */
  441. #define MOUNT_HASH_BYTE 1
  442. #define MOUNT_HASH_WIDTH 8
  443. #define MOUNT_HASH_SIZE 256
  444. #define MOUNT_HASH(hash) ((hash) & (MOUNT_HASH_SIZE - 1))
  445. HASHTYPE hash_path (const char * path, int size,
  446. const char * sep);
  447. HASHTYPE hash_parent_path (HASHTYPE hbuf, const char * name,
  448. int * size, const char * sep);
  449. HASHTYPE rehash_name (HASHTYPE parent_hbuf,
  450. const char * name, int size);
  451. HASHTYPE rehash_path (HASHTYPE ancester_hbuf,
  452. const char * path, int size, const char * sep);
  453. extern struct shim_fs_ops chroot_fs_ops;
  454. extern struct shim_d_ops chroot_d_ops;
  455. extern struct shim_fs_ops str_fs_ops;
  456. extern struct shim_d_ops str_d_ops;
  457. extern struct shim_fs_ops dev_fs_ops;
  458. extern struct shim_d_ops dev_d_ops;
  459. extern struct shim_fs_ops config_fs_ops;
  460. extern struct shim_d_ops config_d_ops;
  461. extern struct shim_fs_ops proc_fs_ops;
  462. extern struct shim_d_ops proc_d_ops;
  463. extern struct shim_mount chroot_builtin_fs;
  464. extern struct shim_mount pipe_builtin_fs;
  465. extern struct shim_mount socket_builtin_fs;
  466. extern struct shim_mount epoll_builtin_fs;
  467. /* proc file system */
  468. struct proc_nm_ops {
  469. int (*match_name) (const char * name);
  470. int (*list_name) (const char * name, struct shim_dirent ** buf,
  471. int count);
  472. };
  473. struct proc_fs_ops {
  474. int (*open) (struct shim_handle * hdl, const char * name, int flags);
  475. int (*mode) (const char * name, mode_t * mode);
  476. int (*stat) (const char * name, struct stat * buf);
  477. int (*follow_link) (const char * name, struct shim_qstr * link);
  478. };
  479. struct proc_dir;
  480. struct proc_ent {
  481. const char * name; /* a proc_callback should at least
  482. have a name or nm_ops.
  483. Otherwise, it is a NULL-end. */
  484. const struct proc_nm_ops * nm_ops;
  485. const struct proc_fs_ops * fs_ops;
  486. const struct proc_dir * dir;
  487. };
  488. struct proc_dir {
  489. int size;
  490. const struct proc_ent ent[];
  491. };
  492. /* string-type file system */
  493. int str_add_dir (const char * path, mode_t mode, struct shim_dentry ** dent);
  494. int str_add_file (const char * path, mode_t mode, struct shim_dentry ** dent);
  495. int str_open (struct shim_handle * hdl, struct shim_dentry * dent, int flags);
  496. int str_dput (struct shim_dentry * dent);
  497. int str_close (struct shim_handle * hdl);
  498. int str_read (struct shim_handle * hdl, void * buf, size_t count);
  499. int str_write (struct shim_handle * hdl, const void * buf, size_t count);
  500. int str_seek (struct shim_handle * hdl, off_t offset, int whence);
  501. int str_flush (struct shim_handle * hdl);
  502. #endif /* _SHIM_FS_H_ */