1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 only,
10 * as published by the Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License version 2 for more details (a copy is included
16 * in the LICENSE file that accompanied this code).
18 * You should have received a copy of the GNU General Public License
19 * version 2 along with this program; If not, see
20 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
22 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23 * CA 95054 USA or visit www.sun.com if you need additional information or
29 * Copyright 2008 Sun Microsystems, Inc. All rights reserved
30 * Use is subject to license terms.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 #ifndef _LUSTRE_CL_OBJECT_H
37 #define _LUSTRE_CL_OBJECT_H
39 /** \defgroup clio clio
41 * Client objects implement io operations and cache pages.
43 * Examples: lov and osc are implementations of cl interface.
45 * Big Theory Statement.
49 * Client implementation is based on the following data-types:
55 * - cl_lock represents an extent lock on an object.
57 * - cl_io represents high-level i/o activity such as whole read/write
58 * system call, or write-out of pages from under the lock being
59 * canceled. cl_io has sub-ios that can be stopped and resumed
60 * independently, thus achieving high degree of transfer
61 * parallelism. Single cl_io can be advanced forward by
62 * the multiple threads (although in the most usual case of
63 * read/write system call it is associated with the single user
64 * thread, that issued the system call).
66 * - cl_req represents a collection of pages for a transfer. cl_req is
67 * constructed by req-forming engine that tries to saturate
68 * transport with large and continuous transfers.
72 * - to avoid confusion high-level I/O operation like read or write system
73 * call is referred to as "an io", whereas low-level I/O operation, like
74 * RPC, is referred to as "a transfer"
76 * - "generic code" means generic (not file system specific) code in the
77 * hosting environment. "cl-code" means code (mostly in cl_*.c files) that
78 * is not layer specific.
84 * - cl_object_header::coh_page_guard
85 * - cl_object_header::coh_lock_guard
88 * See the top comment in cl_object.c for the description of overall locking and
89 * reference-counting design.
91 * See comments below for the description of i/o, page, and dlm-locking
98 * super-class definitions.
100 #include <lu_object.h>
103 # include <linux/mutex.h>
104 # include <linux/radix-tree.h>
110 struct cl_device_operations;
113 struct cl_object_page_operations;
114 struct cl_object_lock_operations;
117 struct cl_page_slice;
119 struct cl_lock_slice;
121 struct cl_lock_operations;
122 struct cl_page_operations;
131 * Operations for each data device in the client stack.
133 * \see vvp_cl_ops, lov_cl_ops, lovsub_cl_ops, osc_cl_ops
135 struct cl_device_operations {
137 * Initialize cl_req. This method is called top-to-bottom on all
138 * devices in the stack to get them a chance to allocate layer-private
139 * data, and to attach them to the cl_req by calling
140 * cl_req_slice_add().
142 * \see osc_req_init(), lov_req_init(), lovsub_req_init()
143 * \see ccc_req_init()
145 int (*cdo_req_init)(const struct lu_env *env, struct cl_device *dev,
150 * Device in the client stack.
152 * \see ccc_device, lov_device, lovsub_device, osc_device
156 struct lu_device cd_lu_dev;
157 /** Per-layer operation vector. */
158 const struct cl_device_operations *cd_ops;
161 /** \addtogroup cl_object cl_object
164 * "Data attributes" of cl_object. Data attributes can be updated
165 * independently for a sub-object, and top-object's attributes are calculated
166 * from sub-objects' ones.
169 /** Object size, in bytes */
172 * Known minimal size, in bytes.
174 * This is only valid when at least one DLM lock is held.
177 /** Modification time. Measured in seconds since epoch. */
179 /** Access time. Measured in seconds since epoch. */
181 /** Change time. Measured in seconds since epoch. */
184 * Blocks allocated to this cl_object on the server file system.
186 * \todo XXX An interface for block size is needed.
190 * User identifier for quota purposes.
194 * Group identifier for quota purposes.
200 * Fields in cl_attr that are being set.
214 * Sub-class of lu_object with methods common for objects on the client
217 * cl_object: represents a regular file system object, both a file and a
218 * stripe. cl_object is based on lu_object: it is identified by a fid,
219 * layered, cached, hashed, and lrued. Important distinction with the server
220 * side, where md_object and dt_object are used, is that cl_object "fans out"
221 * at the lov/sns level: depending on the file layout, single file is
222 * represented as a set of "sub-objects" (stripes). At the implementation
223 * level, struct lov_object contains an array of cl_objects. Each sub-object
224 * is a full-fledged cl_object, having its fid, living in the lru and hash
227 * This leads to the next important difference with the server side: on the
228 * client, it's quite usual to have objects with the different sequence of
229 * layers. For example, typical top-object is composed of the following
235 * whereas its sub-objects are composed of
240 * layers. Here "lovsub" is a mostly dummy layer, whose purpose is to keep
241 * track of the object-subobject relationship.
243 * Sub-objects are not cached independently: when top-object is about to
244 * be discarded from the memory, all its sub-objects are torn-down and
247 * \see ccc_object, lov_object, lovsub_object, osc_object
251 struct lu_object co_lu;
252 /** per-object-layer operations */
253 const struct cl_object_operations *co_ops;
257 * Description of the client object configuration. This is used for the
258 * creation of a new client object that is identified by a more state than
261 struct cl_object_conf {
263 struct lu_object_conf coc_lu;
266 * Object layout. This is consumed by lov.
268 struct lustre_md *coc_md;
270 * Description of particular stripe location in the
271 * cluster. This is consumed by osc.
273 struct lov_oinfo *coc_oinfo;
276 * VFS inode. This is consumed by vvp.
278 struct inode *coc_inode;
282 * Operations implemented for each cl object layer.
284 * \see vvp_ops, lov_ops, lovsub_ops, osc_ops
286 struct cl_object_operations {
288 * Initialize page slice for this layer. Called top-to-bottom through
289 * every object layer when a new cl_page is instantiated. Layer
290 * keeping private per-page data, or requiring its own page operations
291 * vector should allocate these data here, and attach then to the page
292 * by calling cl_page_slice_add(). \a vmpage is locked (in the VM
295 * \retval NULL success.
297 * \retval ERR_PTR(errno) failure code.
299 * \retval valid-pointer pointer to already existing referenced page
300 * to be used instead of newly created.
302 struct cl_page *(*coo_page_init)(const struct lu_env *env,
303 struct cl_object *obj,
304 struct cl_page *page,
307 * Initialize lock slice for this layer. Called top-to-bottom through
308 * every object layer when a new cl_lock is instantiated. Layer
309 * keeping private per-lock data, or requiring its own lock operations
310 * vector should allocate these data here, and attach then to the lock
311 * by calling cl_lock_slice_add(). Mandatory.
313 int (*coo_lock_init)(const struct lu_env *env,
314 struct cl_object *obj, struct cl_lock *lock,
315 const struct cl_io *io);
317 * Initialize io state for a given layer.
319 * called top-to-bottom once per io existence to initialize io
320 * state. If layer wants to keep some state for this type of io, it
321 * has to embed struct cl_io_slice in lu_env::le_ses, and register
322 * slice with cl_io_slice_add(). It is guaranteed that all threads
323 * participating in this io share the same session.
325 int (*coo_io_init)(const struct lu_env *env,
326 struct cl_object *obj, struct cl_io *io);
328 * Fill portion of \a attr that this layer controls. This method is
329 * called top-to-bottom through all object layers.
331 * \pre cl_object_header::coh_attr_guard of the top-object is locked.
333 * \return 0: to continue
334 * \return +ve: to stop iterating through layers (but 0 is returned
335 * from enclosing cl_object_attr_get())
336 * \return -ve: to signal error
338 int (*coo_attr_get)(const struct lu_env *env, struct cl_object *obj,
339 struct cl_attr *attr);
343 * \a valid is a bitmask composed from enum #cl_attr_valid, and
344 * indicating what attributes are to be set.
346 * \pre cl_object_header::coh_attr_guard of the top-object is locked.
348 * \return the same convention as for
349 * cl_object_operations::coo_attr_get() is used.
351 int (*coo_attr_set)(const struct lu_env *env, struct cl_object *obj,
352 const struct cl_attr *attr, unsigned valid);
354 * Update object configuration. Called top-to-bottom to modify object
357 * XXX error conditions and handling.
359 int (*coo_conf_set)(const struct lu_env *env, struct cl_object *obj,
360 const struct cl_object_conf *conf);
362 * Glimpse ast. Executed when glimpse ast arrives for a lock on this
363 * object. Layers are supposed to fill parts of \a lvb that will be
364 * shipped to the glimpse originator as a glimpse result.
366 * \see ccc_object_glimpse(), lovsub_object_glimpse(),
367 * \see osc_object_glimpse()
369 int (*coo_glimpse)(const struct lu_env *env,
370 const struct cl_object *obj, struct ost_lvb *lvb);
374 * Extended header for client object.
376 struct cl_object_header {
377 /** Standard lu_object_header. cl_object::co_lu::lo_header points
379 struct lu_object_header coh_lu;
381 * \todo XXX move locks below to the separate cache-lines, they are
382 * mostly useless otherwise.
385 /** Lock protecting page tree. */
386 spinlock_t coh_page_guard;
387 /** Lock protecting lock list. */
388 spinlock_t coh_lock_guard;
390 /** Radix tree of cl_page's, cached for this object. */
391 struct radix_tree_root coh_tree;
392 /** # of pages in radix tree. */
393 unsigned long coh_pages;
394 /** List of cl_lock's granted for this object. */
395 struct list_head coh_locks;
398 * Parent object. It is assumed that an object has a well-defined
399 * parent, but not a well-defined child (there may be multiple
400 * sub-objects, for the same top-object). cl_object_header::coh_parent
401 * field allows certain code to be written generically, without
402 * limiting possible cl_object layouts unduly.
404 struct cl_object_header *coh_parent;
406 * Protects consistency between cl_attr of parent object and
407 * attributes of sub-objects, that the former is calculated ("merged")
410 * \todo XXX this can be read/write lock if needed.
412 spinlock_t coh_attr_guard;
414 * Number of objects above this one: 0 for a top-object, 1 for its
417 unsigned coh_nesting;
421 * Helper macro: iterate over all layers of the object \a obj, assigning every
422 * layer top-to-bottom to \a slice.
424 #define cl_object_for_each(slice, obj) \
425 list_for_each_entry((slice), \
426 &(obj)->co_lu.lo_header->loh_layers, \
429 * Helper macro: iterate over all layers of the object \a obj, assigning every
430 * layer bottom-to-top to \a slice.
432 #define cl_object_for_each_reverse(slice, obj) \
433 list_for_each_entry_reverse((slice), \
434 &(obj)->co_lu.lo_header->loh_layers, \
439 #define pgoff_t unsigned long
442 #define CL_PAGE_EOF ((pgoff_t)~0ull)
444 /** \addtogroup cl_page cl_page
448 * Layered client page.
450 * cl_page: represents a portion of a file, cached in the memory. All pages
451 * of the given file are of the same size, and are kept in the radix tree
452 * hanging off the cl_object. cl_page doesn't fan out, but as sub-objects
453 * of the top-level file object are first class cl_objects, they have their
454 * own radix trees of pages and hence page is implemented as a sequence of
455 * struct cl_pages's, linked into double-linked list through
456 * cl_page::cp_parent and cl_page::cp_child pointers, each residing in the
457 * corresponding radix tree at the corresponding logical offset.
459 * cl_page is associated with VM page of the hosting environment (struct
460 * page in Linux kernel, for example), cfs_page_t. It is assumed, that this
461 * association is implemented by one of cl_page layers (top layer in the
462 * current design) that
464 * - intercepts per-VM-page call-backs made by the environment (e.g.,
467 * - translates state (page flag bits) and locking between lustre and
470 * The association between cl_page and cfs_page_t is immutable and
471 * established when cl_page is created.
473 * cl_page can be "owned" by a particular cl_io (see below), guaranteeing
474 * this io an exclusive access to this page w.r.t. other io attempts and
475 * various events changing page state (such as transfer completion, or
476 * eviction of the page from the memory). Note, that in general cl_io
477 * cannot be identified with a particular thread, and page ownership is not
478 * exactly equal to the current thread holding a lock on the page. Layer
479 * implementing association between cl_page and cfs_page_t has to implement
480 * ownership on top of available synchronization mechanisms.
482 * While lustre client maintains the notion of an page ownership by io,
483 * hosting MM/VM usually has its own page concurrency control
484 * mechanisms. For example, in Linux, page access is synchronized by the
485 * per-page PG_locked bit-lock, and generic kernel code (generic_file_*())
486 * takes care to acquire and release such locks as necessary around the
487 * calls to the file system methods (->readpage(), ->prepare_write(),
488 * ->commit_write(), etc.). This leads to the situation when there are two
489 * different ways to own a page in the client:
491 * - client code explicitly and voluntary owns the page (cl_page_own());
493 * - VM locks a page and then calls the client, that has "to assume"
494 * the ownership from the VM (cl_page_assume()).
496 * Dual methods to release ownership are cl_page_disown() and
497 * cl_page_unassume().
499 * cl_page is reference counted (cl_page::cp_ref). When reference counter
500 * drops to 0, the page is returned to the cache, unless it is in
501 * cl_page_state::CPS_FREEING state, in which case it is immediately
504 * The general logic guaranteeing the absence of "existential races" for
505 * pages is the following:
507 * - there are fixed known ways for a thread to obtain a new reference
510 * - by doing a lookup in the cl_object radix tree, protected by the
513 * - by starting from VM-locked cfs_page_t and following some
514 * hosting environment method (e.g., following ->private pointer in
515 * the case of Linux kernel), see cl_vmpage_page();
517 * - when the page enters cl_page_state::CPS_FREEING state, all these
518 * ways are severed with the proper synchronization
519 * (cl_page_delete());
521 * - entry into cl_page_state::CPS_FREEING is serialized by the VM page
524 * - no new references to the page in cl_page_state::CPS_FREEING state
525 * are allowed (checked in cl_page_get()).
527 * Together this guarantees that when last reference to a
528 * cl_page_state::CPS_FREEING page is released, it is safe to destroy the
529 * page, as neither references to it can be acquired at that point, nor
532 * cl_page is a state machine. States are enumerated in enum
533 * cl_page_state. Possible state transitions are enumerated in
534 * cl_page_state_set(). State transition process (i.e., actual changing of
535 * cl_page::cp_state field) is protected by the lock on the underlying VM
538 * Linux Kernel implementation.
540 * Binding between cl_page and cfs_page_t (which is a typedef for
541 * struct page) is implemented in the vvp layer. cl_page is attached to the
542 * ->private pointer of the struct page, together with the setting of
543 * PG_private bit in page->flags, and acquiring additional reference on the
544 * struct page (much like struct buffer_head, or any similar file system
545 * private data structures).
547 * PG_locked lock is used to implement both ownership and transfer
548 * synchronization, that is, page is VM-locked in CPS_{OWNED,PAGE{IN,OUT}}
549 * states. No additional references are acquired for the duration of the
552 * \warning *THIS IS NOT* the behavior expected by the Linux kernel, where
553 * write-out is "protected" by the special PG_writeback bit.
557 * States of cl_page. cl_page.c assumes particular order here.
559 * The page state machine is rather crude, as it doesn't recognize finer page
560 * states like "dirty" or "up to date". This is because such states are not
561 * always well defined for the whole stack (see, for example, the
562 * implementation of the read-ahead, that hides page up-to-dateness to track
563 * cache hits accurately). Such sub-states are maintained by the layers that
564 * are interested in them.
568 * Page is in the cache, un-owned. Page leaves cached state in the
571 * - [cl_page_state::CPS_OWNED] io comes across the page and
574 * - [cl_page_state::CPS_PAGEOUT] page is dirty, the
575 * req-formation engine decides that it wants to include this page
576 * into an cl_req being constructed, and yanks it from the cache;
578 * - [cl_page_state::CPS_FREEING] VM callback is executed to
579 * evict the page form the memory;
581 * \invariant cl_page::cp_owner == NULL && cl_page::cp_req == NULL
585 * Page is exclusively owned by some cl_io. Page may end up in this
586 * state as a result of
588 * - io creating new page and immediately owning it;
590 * - [cl_page_state::CPS_CACHED] io finding existing cached page
593 * - [cl_page_state::CPS_OWNED] io finding existing owned page
594 * and waiting for owner to release the page;
596 * Page leaves owned state in the following cases:
598 * - [cl_page_state::CPS_CACHED] io decides to leave the page in
599 * the cache, doing nothing;
601 * - [cl_page_state::CPS_PAGEIN] io starts read transfer for
604 * - [cl_page_state::CPS_PAGEOUT] io starts immediate write
605 * transfer for this page;
607 * - [cl_page_state::CPS_FREEING] io decides to destroy this
608 * page (e.g., as part of truncate or extent lock cancellation).
610 * \invariant cl_page::cp_owner != NULL && cl_page::cp_req == NULL
614 * Page is being written out, as a part of a transfer. This state is
615 * entered when req-formation logic decided that it wants this page to
616 * be sent through the wire _now_. Specifically, it means that once
617 * this state is achieved, transfer completion handler (with either
618 * success or failure indication) is guaranteed to be executed against
619 * this page independently of any locks and any scheduling decisions
620 * made by the hosting environment (that effectively means that the
621 * page is never put into cl_page_state::CPS_PAGEOUT state "in
622 * advance". This property is mentioned, because it is important when
623 * reasoning about possible dead-locks in the system). The page can
624 * enter this state as a result of
626 * - [cl_page_state::CPS_OWNED] an io requesting an immediate
627 * write-out of this page, or
629 * - [cl_page_state::CPS_CACHED] req-forming engine deciding
630 * that it has enough dirty pages cached to issue a "good"
633 * The page leaves cl_page_state::CPS_PAGEOUT state when the transfer
634 * is completed---it is moved into cl_page_state::CPS_CACHED state.
636 * Underlying VM page is locked for the duration of transfer.
638 * \invariant: cl_page::cp_owner == NULL && cl_page::cp_req != NULL
642 * Page is being read in, as a part of a transfer. This is quite
643 * similar to the cl_page_state::CPS_PAGEOUT state, except that
644 * read-in is always "immediate"---there is no such thing a sudden
645 * construction of read cl_req from cached, presumably not up to date,
648 * Underlying VM page is locked for the duration of transfer.
650 * \invariant: cl_page::cp_owner == NULL && cl_page::cp_req != NULL
654 * Page is being destroyed. This state is entered when client decides
655 * that page has to be deleted from its host object, as, e.g., a part
658 * Once this state is reached, there is no way to escape it.
660 * \invariant: cl_page::cp_owner == NULL && cl_page::cp_req == NULL
667 /** Host page, the page is from the host inode which the cl_page
671 /** Transient page, the transient cl_page is used to bind a cl_page
672 * to vmpage which is not belonging to the same object of cl_page.
673 * it is used in DirectIO, lockless IO and liblustre. */
678 * Flags maintained for every cl_page.
682 * Set when pagein completes. Used for debugging (read completes at
683 * most once for a page).
685 CPF_READ_COMPLETED = 1 << 0
689 * Fields are protected by the lock on cfs_page_t, except for atomics and
692 * \invariant Data type invariants are in cl_page_invariant(). Basically:
693 * cl_page::cp_parent and cl_page::cp_child are a well-formed double-linked
694 * list, consistent with the parent/child pointers in the cl_page::cp_obj and
695 * cl_page::cp_owner (when set).
698 /** Reference counter. */
700 /** An object this page is a part of. Immutable after creation. */
701 struct cl_object *cp_obj;
702 /** Logical page index within the object. Immutable after creation. */
704 /** List of slices. Immutable after creation. */
705 struct list_head cp_layers;
706 /** Parent page, NULL for top-level page. Immutable after creation. */
707 struct cl_page *cp_parent;
708 /** Lower-layer page. NULL for bottommost page. Immutable after
710 struct cl_page *cp_child;
712 * Page state. This field is const to avoid accidental update, it is
713 * modified only internally within cl_page.c. Protected by a VM lock.
715 const enum cl_page_state cp_state;
717 * Linkage of pages within some group. Protected by
718 * cl_page::cp_mutex. */
719 struct list_head cp_batch;
720 /** Mutex serializing membership of a page in a batch. */
721 struct mutex cp_mutex;
722 /** Linkage of pages within cl_req. */
723 struct list_head cp_flight;
724 /** Transfer error. */
728 * Page type. Only CPT_TRANSIENT is used so far. Immutable after
731 enum cl_page_type cp_type;
734 * Owning IO in cl_page_state::CPS_OWNED state. Sub-page can be owned
735 * by sub-io. Protected by a VM lock.
737 struct cl_io *cp_owner;
739 * Debug information, the task is owning the page.
743 * Owning IO request in cl_page_state::CPS_PAGEOUT and
744 * cl_page_state::CPS_PAGEIN states. This field is maintained only in
745 * the top-level pages. Protected by a VM lock.
747 struct cl_req *cp_req;
748 /** List of references to this page, for debugging. */
749 struct lu_ref cp_reference;
750 /** Link to an object, for debugging. */
751 struct lu_ref_link *cp_obj_ref;
752 /** Link to a queue, for debugging. */
753 struct lu_ref_link *cp_queue_ref;
754 /** Per-page flags from enum cl_page_flags. Protected by a VM lock. */
759 * Per-layer part of cl_page.
761 * \see ccc_page, lov_page, osc_page
763 struct cl_page_slice {
764 struct cl_page *cpl_page;
766 * Object slice corresponding to this page slice. Immutable after
769 struct cl_object *cpl_obj;
770 const struct cl_page_operations *cpl_ops;
771 /** Linkage into cl_page::cp_layers. Immutable after creation. */
772 struct list_head cpl_linkage;
776 * Lock mode. For the client extent locks.
778 * \warning: cl_lock_mode_match() assumes particular ordering here.
783 * Mode of a lock that protects no data, and exists only as a
784 * placeholder. This is used for `glimpse' requests. A phantom lock
785 * might get promoted to real lock at some point.
794 * Requested transfer type.
804 * Per-layer page operations.
806 * Methods taking an \a io argument are for the activity happening in the
807 * context of given \a io. Page is assumed to be owned by that io, except for
808 * the obvious cases (like cl_page_operations::cpo_own()).
810 * \see vvp_page_ops, lov_page_ops, osc_page_ops
812 struct cl_page_operations {
814 * cl_page<->cfs_page_t methods. Only one layer in the stack has to
815 * implement these. Current code assumes that this functionality is
816 * provided by the topmost layer, see cl_page_disown0() as an example.
820 * \return the underlying VM page. Optional.
822 cfs_page_t *(*cpo_vmpage)(const struct lu_env *env,
823 const struct cl_page_slice *slice);
825 * Called when \a io acquires this page into the exclusive
826 * ownership. When this method returns, it is guaranteed that the is
827 * not owned by other io, and no transfer is going on against
831 * \see vvp_page_own(), lov_page_own()
833 void (*cpo_own)(const struct lu_env *env,
834 const struct cl_page_slice *slice, struct cl_io *io);
835 /** Called when ownership it yielded. Optional.
837 * \see cl_page_disown()
838 * \see vvp_page_disown()
840 void (*cpo_disown)(const struct lu_env *env,
841 const struct cl_page_slice *slice, struct cl_io *io);
843 * Called for a page that is already "owned" by \a io from VM point of
846 * \see cl_page_assume()
847 * \see vvp_page_assume(), lov_page_assume()
849 void (*cpo_assume)(const struct lu_env *env,
850 const struct cl_page_slice *slice, struct cl_io *io);
851 /** Dual to cl_page_operations::cpo_assume(). Optional. Called
852 * bottom-to-top when IO releases a page without actually unlocking
855 * \see cl_page_unassume()
856 * \see vvp_page_unassume()
858 void (*cpo_unassume)(const struct lu_env *env,
859 const struct cl_page_slice *slice,
862 * Announces whether the page contains valid data or not by @uptodate.
864 * \see cl_page_export()
865 * \see vvp_page_export()
867 void (*cpo_export)(const struct lu_env *env,
868 const struct cl_page_slice *slice, int uptodate);
870 * Unmaps page from the user space (if it is mapped).
872 * \see cl_page_unmap()
873 * \see vvp_page_unmap()
875 int (*cpo_unmap)(const struct lu_env *env,
876 const struct cl_page_slice *slice, struct cl_io *io);
878 * Checks whether underlying VM page is locked (in the suitable
879 * sense). Used for assertions.
881 * \retval -EBUSY: page is protected by a lock of a given mode;
882 * \retval -ENODATA: page is not protected by a lock;
883 * \retval 0: this layer cannot decide. (Should never happen.)
885 int (*cpo_is_vmlocked)(const struct lu_env *env,
886 const struct cl_page_slice *slice);
892 * Called when page is truncated from the object. Optional.
894 * \see cl_page_discard()
895 * \see vvp_page_discard(), osc_page_discard()
897 void (*cpo_discard)(const struct lu_env *env,
898 const struct cl_page_slice *slice,
901 * Called when page is removed from the cache, and is about to being
902 * destroyed. Optional.
904 * \see cl_page_delete()
905 * \see vvp_page_delete(), osc_page_delete()
907 void (*cpo_delete)(const struct lu_env *env,
908 const struct cl_page_slice *slice);
909 /** Destructor. Frees resources and slice itself. */
910 void (*cpo_fini)(const struct lu_env *env,
911 struct cl_page_slice *slice);
914 * Checks whether the page is protected by a cl_lock. This is a
915 * per-layer method, because certain layers have ways to check for the
916 * lock much more efficiently than through the generic locks scan, or
917 * implement locking mechanisms separate from cl_lock, e.g.,
918 * LL_FILE_GROUP_LOCKED in vvp. If \a pending is true, check for locks
919 * being canceled, or scheduled for cancellation as soon as the last
920 * user goes away, too.
922 * \retval -EBUSY: page is protected by a lock of a given mode;
923 * \retval -ENODATA: page is not protected by a lock;
924 * \retval 0: this layer cannot decide.
926 * \see cl_page_is_under_lock()
928 int (*cpo_is_under_lock)(const struct lu_env *env,
929 const struct cl_page_slice *slice,
933 * Optional debugging helper. Prints given page slice.
935 * \see cl_page_print()
937 int (*cpo_print)(const struct lu_env *env,
938 const struct cl_page_slice *slice,
939 void *cookie, lu_printer_t p);
943 * Transfer methods. See comment on cl_req for a description of
944 * transfer formation and life-cycle.
949 * Request type dependent vector of operations.
951 * Transfer operations depend on transfer mode (cl_req_type). To avoid
952 * passing transfer mode to each and every of these methods, and to
953 * avoid branching on request type inside of the methods, separate
954 * methods for cl_req_type:CRT_READ and cl_req_type:CRT_WRITE are
955 * provided. That is, method invocation usually looks like
957 * slice->cp_ops.io[req->crq_type].cpo_method(env, slice, ...);
961 * Called when a page is submitted for a transfer as a part of
964 * \return 0 : page is eligible for submission;
965 * \return -EALREADY : skip this page;
966 * \return -ve : error.
968 * \see cl_page_prep()
970 int (*cpo_prep)(const struct lu_env *env,
971 const struct cl_page_slice *slice,
974 * Completion handler. This is guaranteed to be eventually
975 * fired after cl_page_operations::cpo_prep() or
976 * cl_page_operations::cpo_make_ready() call.
978 * This method can be called in a non-blocking context. It is
979 * guaranteed however, that the page involved and its object
980 * are pinned in memory (and, hence, calling cl_page_put() is
983 * \see cl_page_completion()
985 void (*cpo_completion)(const struct lu_env *env,
986 const struct cl_page_slice *slice,
989 * Called when cached page is about to be added to the
990 * cl_req as a part of req formation.
992 * \return 0 : proceed with this page;
993 * \return -EAGAIN : skip this page;
994 * \return -ve : error.
996 * \see cl_page_make_ready()
998 int (*cpo_make_ready)(const struct lu_env *env,
999 const struct cl_page_slice *slice);
1001 * Announce that this page is to be written out
1002 * opportunistically, that is, page is dirty, it is not
1003 * necessary to start write-out transfer right now, but
1004 * eventually page has to be written out.
1006 * Main caller of this is the write path (see
1007 * vvp_io_commit_write()), using this method to build a
1008 * "transfer cache" from which large transfers are then
1009 * constructed by the req-formation engine.
1011 * \todo XXX it would make sense to add page-age tracking
1012 * semantics here, and to oblige the req-formation engine to
1013 * send the page out not later than it is too old.
1015 * \see cl_page_cache_add()
1017 int (*cpo_cache_add)(const struct lu_env *env,
1018 const struct cl_page_slice *slice,
1022 * Tell transfer engine that only [to, from] part of a page should be
1025 * This is used for immediate transfers.
1027 * \todo XXX this is not very good interface. It would be much better
1028 * if all transfer parameters were supplied as arguments to
1029 * cl_io_operations::cio_submit() call, but it is not clear how to do
1030 * this for page queues.
1032 * \see cl_page_clip()
1034 void (*cpo_clip)(const struct lu_env *env,
1035 const struct cl_page_slice *slice,
1038 * \pre the page was queued for transferring.
1039 * \post page is removed from client's pending list, or -EBUSY
1040 * is returned if it has already been in transferring.
1042 * This is one of seldom page operation which is:
1043 * 0. called from top level;
1044 * 1. don't have vmpage locked;
1045 * 2. every layer should synchronize execution of its ->cpo_cancel()
1046 * with completion handlers. Osc uses client obd lock for this
1047 * purpose. Based on there is no vvp_page_cancel and
1048 * lov_page_cancel(), cpo_cancel is defacto protected by client lock.
1050 * \see osc_page_cancel().
1052 int (*cpo_cancel)(const struct lu_env *env,
1053 const struct cl_page_slice *slice);
1058 * Helper macro, dumping detailed information about \a page into a log.
1060 #define CL_PAGE_DEBUG(mask, env, page, format, ...) \
1062 static DECLARE_LU_CDEBUG_PRINT_INFO(__info, mask); \
1064 if (cdebug_show(mask, DEBUG_SUBSYSTEM)) { \
1065 cl_page_print(env, &__info, lu_cdebug_printer, page); \
1066 CDEBUG(mask, format , ## __VA_ARGS__); \
1071 * Helper macro, dumping shorter information about \a page into a log.
1073 #define CL_PAGE_HEADER(mask, env, page, format, ...) \
1075 static DECLARE_LU_CDEBUG_PRINT_INFO(__info, mask); \
1077 if (cdebug_show(mask, DEBUG_SUBSYSTEM)) { \
1078 cl_page_header_print(env, &__info, lu_cdebug_printer, page); \
1079 CDEBUG(mask, format , ## __VA_ARGS__); \
1085 /** \addtogroup cl_lock cl_lock
1089 * Extent locking on the client.
1093 * The locking model of the new client code is built around
1097 * data-type representing an extent lock on a regular file. cl_lock is a
1098 * layered object (much like cl_object and cl_page), it consists of a header
1099 * (struct cl_lock) and a list of layers (struct cl_lock_slice), linked to
1100 * cl_lock::cll_layers list through cl_lock_slice::cls_linkage.
1102 * All locks for a given object are linked into cl_object_header::coh_locks
1103 * list (protected by cl_object_header::coh_lock_guard spin-lock) through
1104 * cl_lock::cll_linkage. Currently this list is not sorted in any way. We can
1105 * sort it in starting lock offset, or use altogether different data structure
1108 * Typical cl_lock consists of the two layers:
1110 * - vvp_lock (vvp specific data), and
1111 * - lov_lock (lov specific data).
1113 * lov_lock contains an array of sub-locks. Each of these sub-locks is a
1114 * normal cl_lock: it has a header (struct cl_lock) and a list of layers:
1116 * - lovsub_lock, and
1119 * Each sub-lock is associated with a cl_object (representing stripe
1120 * sub-object or the file to which top-level cl_lock is associated to), and is
1121 * linked into that cl_object::coh_locks. In this respect cl_lock is similar to
1122 * cl_object (that at lov layer also fans out into multiple sub-objects), and
1123 * is different from cl_page, that doesn't fan out (there is usually exactly
1124 * one osc_page for every vvp_page). We shall call vvp-lov portion of the lock
1125 * a "top-lock" and its lovsub-osc portion a "sub-lock".
1129 * cl_lock is reference counted. When reference counter drops to 0, lock is
1130 * placed in the cache, except when lock is in CLS_FREEING state. CLS_FREEING
1131 * lock is destroyed when last reference is released. Referencing between
1132 * top-lock and its sub-locks is described in the lov documentation module.
1136 * Also, cl_lock is a state machine. This requires some clarification. One of
1137 * the goals of client IO re-write was to make IO path non-blocking, or at
1138 * least to make it easier to make it non-blocking in the future. Here
1139 * `non-blocking' means that when a system call (read, write, truncate)
1140 * reaches a situation where it has to wait for a communication with the
1141 * server, it should --instead of waiting-- remember its current state and
1142 * switch to some other work. E.g,. instead of waiting for a lock enqueue,
1143 * client should proceed doing IO on the next stripe, etc. Obviously this is
1144 * rather radical redesign, and it is not planned to be fully implemented at
1145 * this time, instead we are putting some infrastructure in place, that would
1146 * make it easier to do asynchronous non-blocking IO easier in the
1147 * future. Specifically, where old locking code goes to sleep (waiting for
1148 * enqueue, for example), new code returns cl_lock_transition::CLO_WAIT. When
1149 * enqueue reply comes, its completion handler signals that lock state-machine
1150 * is ready to transit to the next state. There is some generic code in
1151 * cl_lock.c that sleeps, waiting for these signals. As a result, for users of
1152 * this cl_lock.c code, it looks like locking is done in normal blocking
1153 * fashion, and it the same time it is possible to switch to the non-blocking
1154 * locking (simply by returning cl_lock_transition::CLO_WAIT from cl_lock.c
1157 * For a description of state machine states and transitions see enum
1160 * There are two ways to restrict a set of states which lock might move to:
1162 * - placing a "hold" on a lock guarantees that lock will not be moved
1163 * into cl_lock_state::CLS_FREEING state until hold is released. Hold
1164 * can be only acquired on a lock that is not in
1165 * cl_lock_state::CLS_FREEING. All holds on a lock are counted in
1166 * cl_lock::cll_holds. Hold protects lock from cancellation and
1167 * destruction. Requests to cancel and destroy a lock on hold will be
1168 * recorded, but only honored when last hold on a lock is released;
1170 * - placing a "user" on a lock guarantees that lock will not leave
1171 * cl_lock_state::CLS_NEW, cl_lock_state::CLS_QUEUING,
1172 * cl_lock_state::CLS_ENQUEUED and cl_lock_state::CLS_HELD set of
1173 * states, once it enters this set. That is, if a user is added onto a
1174 * lock in a state not from this set, it doesn't immediately enforce
1175 * lock to move to this set, but once lock enters this set it will
1176 * remain there until all users are removed. Lock users are counted in
1177 * cl_lock::cll_users.
1179 * User is used to assure that lock is not canceled or destroyed while
1180 * it is being enqueued, or actively used by some IO.
1182 * Currently, a user always comes with a hold (cl_lock_invariant()
1183 * checks that a number of holds is not less than a number of users).
1187 * This is how lock state-machine operates. struct cl_lock contains a mutex
1188 * cl_lock::cll_guard that protects struct fields.
1190 * - mutex is taken, and cl_lock::cll_state is examined.
1192 * - for every state there are possible target states where lock can move
1193 * into. They are tried in order. Attempts to move into next state are
1194 * done by _try() functions in cl_lock.c:cl_{enqueue,unlock,wait}_try().
1196 * - if the transition can be performed immediately, state is changed,
1197 * and mutex is released.
1199 * - if the transition requires blocking, _try() function returns
1200 * cl_lock_transition::CLO_WAIT. Caller unlocks mutex and goes to
1201 * sleep, waiting for possibility of lock state change. It is woken
1202 * up when some event occurs, that makes lock state change possible
1203 * (e.g., the reception of the reply from the server), and repeats
1206 * Top-lock and sub-lock has separate mutexes and the latter has to be taken
1207 * first to avoid dead-lock.
1209 * To see an example of interaction of all these issues, take a look at the
1210 * lov_cl.c:lov_lock_enqueue() function. It is called as a part of
1211 * cl_enqueue_try(), and tries to advance top-lock to ENQUEUED state, by
1212 * advancing state-machines of its sub-locks (lov_lock_enqueue_one()). Note
1213 * also, that it uses trylock to grab sub-lock mutex to avoid dead-lock. It
1214 * also has to handle CEF_ASYNC enqueue, when sub-locks enqueues have to be
1215 * done in parallel, rather than one after another (this is used for glimpse
1216 * locks, that cannot dead-lock).
1218 * INTERFACE AND USAGE
1220 * struct cl_lock_operations provide a number of call-backs that are invoked
1221 * when events of interest occurs. Layers can intercept and handle glimpse,
1222 * blocking, cancel ASTs and a reception of the reply from the server.
1224 * One important difference with the old client locking model is that new
1225 * client has a representation for the top-lock, whereas in the old code only
1226 * sub-locks existed as real data structures and file-level locks are
1227 * represented by "request sets" that are created and destroyed on each and
1228 * every lock creation.
1230 * Top-locks are cached, and can be found in the cache by the system calls. It
1231 * is possible that top-lock is in cache, but some of its sub-locks were
1232 * canceled and destroyed. In that case top-lock has to be enqueued again
1233 * before it can be used.
1235 * Overall process of the locking during IO operation is as following:
1237 * - once parameters for IO are setup in cl_io, cl_io_operations::cio_lock()
1238 * is called on each layer. Responsibility of this method is to add locks,
1239 * needed by a given layer into cl_io.ci_lockset.
1241 * - once locks for all layers were collected, they are sorted to avoid
1242 * dead-locks (cl_io_locks_sort()), and enqueued.
1244 * - when all locks are acquired, IO is performed;
1246 * - locks are released into cache.
1248 * Striping introduces major additional complexity into locking. The
1249 * fundamental problem is that it is generally unsafe to actively use (hold)
1250 * two locks on the different OST servers at the same time, as this introduces
1251 * inter-server dependency and can lead to cascading evictions.
1253 * Basic solution is to sub-divide large read/write IOs into smaller pieces so
1254 * that no multi-stripe locks are taken (note that this design abandons POSIX
1255 * read/write semantics). Such pieces ideally can be executed concurrently. At
1256 * the same time, certain types of IO cannot be sub-divived, without
1257 * sacrificing correctness. This includes:
1259 * - O_APPEND write, where [0, EOF] lock has to be taken, to guarantee
1262 * - ftruncate(fd, offset), where [offset, EOF] lock has to be taken.
1264 * Also, in the case of read(fd, buf, count) or write(fd, buf, count), where
1265 * buf is a part of memory mapped Lustre file, a lock or locks protecting buf
1266 * has to be held together with the usual lock on [offset, offset + count].
1268 * As multi-stripe locks have to be allowed, it makes sense to cache them, so
1269 * that, for example, a sequence of O_APPEND writes can proceed quickly
1270 * without going down to the individual stripes to do lock matching. On the
1271 * other hand, multi-stripe locks shouldn't be used by normal read/write
1272 * calls. To achieve this, every layer can implement ->clo_fits_into() method,
1273 * that is called by lock matching code (cl_lock_lookup()), and that can be
1274 * used to selectively disable matching of certain locks for certain IOs. For
1275 * exmaple, lov layer implements lov_lock_fits_into() that allow multi-stripe
1276 * locks to be matched only for truncates and O_APPEND writes.
1278 * Interaction with DLM
1280 * In the expected setup, cl_lock is ultimately backed up by a collection of
1281 * DLM locks (struct ldlm_lock). Association between cl_lock and DLM lock is
1282 * implemented in osc layer, that also matches DLM events (ASTs, cancellation,
1283 * etc.) into cl_lock_operation calls. See struct osc_lock for a more detailed
1284 * description of interaction with DLM.
1290 struct cl_lock_descr {
1291 /** Object this lock is granted for. */
1292 struct cl_object *cld_obj;
1293 /** Index of the first page protected by this lock. */
1295 /** Index of the last page (inclusive) protected by this lock. */
1297 /** Group ID, for group lock */
1300 enum cl_lock_mode cld_mode;
1303 #define DDESCR "%s(%d):[%lu, %lu]"
1304 #define PDESCR(descr) \
1305 cl_lock_mode_name((descr)->cld_mode), (descr)->cld_mode, \
1306 (descr)->cld_start, (descr)->cld_end
1308 const char *cl_lock_mode_name(const enum cl_lock_mode mode);
1311 * Lock state-machine states.
1316 * Possible state transitions:
1318 * +------------------>NEW
1320 * | | cl_enqueue_try()
1322 * | cl_unuse_try() V
1323 * | +--------------QUEUING (*)
1325 * | | | cl_enqueue_try()
1327 * | | cl_unuse_try() V
1328 * sub-lock | +-------------ENQUEUED (*)
1330 * | | | cl_wait_try()
1335 * | | HELD<---------+
1338 * | | cl_unuse_try() | |
1341 * | +------------>UNLOCKING (*) | lock found
1343 * | cl_unuse_try() | |
1345 * | | | cl_use_try()
1347 * +------------------CACHED---------+
1356 * In states marked with (*) transition to the same state (i.e., a loop
1357 * in the diagram) is possible.
1359 * (R) is the point where Receive call-back is invoked: it allows layers
1360 * to handle arrival of lock reply.
1362 * (C) is the point where Cancellation call-back is invoked.
1364 * Transition to FREEING state is possible from any other state in the
1365 * diagram in case of unrecoverable error.
1369 * These states are for individual cl_lock object. Top-lock and its sub-locks
1370 * can be in the different states. Another way to say this is that we have
1371 * nested state-machines.
1373 * Separate QUEUING and ENQUEUED states are needed to support non-blocking
1374 * operation for locks with multiple sub-locks. Imagine lock on a file F, that
1375 * intersects 3 stripes S0, S1, and S2. To enqueue F client has to send
1376 * enqueue to S0, wait for its completion, then send enqueue for S1, wait for
1377 * its completion and at last enqueue lock for S2, and wait for its
1378 * completion. In that case, top-lock is in QUEUING state while S0, S1 are
1379 * handled, and is in ENQUEUED state after enqueue to S2 has been sent (note
1380 * that in this case, sub-locks move from state to state, and top-lock remains
1381 * in the same state).
1383 * Separate UNLOCKING state is needed to maintain an invariant that in HELD
1384 * state lock is immediately ready for use.
1386 enum cl_lock_state {
1388 * Lock that wasn't yet enqueued
1392 * Enqueue is in progress, blocking for some intermediate interaction
1393 * with the other side.
1397 * Lock is fully enqueued, waiting for server to reply when it is
1402 * Lock granted, actively used by some IO.
1406 * Lock is in the transition from CLS_HELD to CLS_CACHED. Lock is in
1407 * this state only while cl_unuse() is executing against it.
1411 * Lock granted, not used.
1415 * Lock is being destroyed.
1421 enum cl_lock_flags {
1423 * lock has been cancelled. This flag is never cleared once set (by
1424 * cl_lock_cancel0()).
1426 CLF_CANCELLED = 1 << 0,
1427 /** cancellation is pending for this lock. */
1428 CLF_CANCELPEND = 1 << 1,
1429 /** destruction is pending for this lock. */
1430 CLF_DOOMED = 1 << 2,
1431 /** State update is pending. */
1438 * Lock closure is a collection of locks (both top-locks and sub-locks) that
1439 * might be updated in a result of an operation on a certain lock (which lock
1440 * this is a closure of).
1442 * Closures are needed to guarantee dead-lock freedom in the presence of
1444 * - nested state-machines (top-lock state-machine composed of sub-lock
1445 * state-machines), and
1447 * - shared sub-locks.
1449 * Specifically, many operations, such as lock enqueue, wait, unlock,
1450 * etc. start from a top-lock, and then operate on a sub-locks of this
1451 * top-lock, holding a top-lock mutex. When sub-lock state changes as a result
1452 * of such operation, this change has to be propagated to all top-locks that
1453 * share this sub-lock. Obviously, no natural lock ordering (e.g.,
1454 * top-to-bottom or bottom-to-top) captures this scenario, so try-locking has
1455 * to be used. Lock closure systematizes this try-and-repeat logic.
1457 struct cl_lock_closure {
1459 * Lock that is mutexed when closure construction is started. When
1460 * closure in is `wait' mode (cl_lock_closure::clc_wait), mutex on
1461 * origin is released before waiting.
1463 struct cl_lock *clc_origin;
1465 * List of enclosed locks, so far. Locks are linked here through
1466 * cl_lock::cll_inclosure.
1468 struct list_head clc_list;
1470 * True iff closure is in a `wait' mode. This determines what
1471 * cl_lock_enclosure() does when a lock L to be added to the closure
1472 * is currently mutexed by some other thread.
1474 * If cl_lock_closure::clc_wait is not set, then closure construction
1475 * fails with CLO_REPEAT immediately.
1477 * In wait mode, cl_lock_enclosure() waits until next attempt to build
1478 * a closure might succeed. To this end it releases an origin mutex
1479 * (cl_lock_closure::clc_origin), that has to be the only lock mutex
1480 * owned by the current thread, and then waits on L mutex (by grabbing
1481 * it and immediately releasing), before returning CLO_REPEAT to the
1485 /** Number of locks in the closure. */
1490 * Layered client lock.
1493 /** Reference counter. */
1495 /** List of slices. Immutable after creation. */
1496 struct list_head cll_layers;
1498 * Linkage into cl_lock::cll_descr::cld_obj::coh_locks list. Protected
1499 * by cl_lock::cll_descr::cld_obj::coh_lock_guard.
1501 struct list_head cll_linkage;
1503 * Parameters of this lock. Protected by
1504 * cl_lock::cll_descr::cld_obj::coh_lock_guard nested within
1505 * cl_lock::cll_guard. Modified only on lock creation and in
1508 struct cl_lock_descr cll_descr;
1509 /** Protected by cl_lock::cll_guard. */
1510 enum cl_lock_state cll_state;
1511 /** signals state changes. */
1514 * Recursive lock, most fields in cl_lock{} are protected by this.
1516 * Locking rules: this mutex is never held across network
1517 * communication, except when lock is being canceled.
1519 * Lock ordering: a mutex of a sub-lock is taken first, then a mutex
1520 * on a top-lock. Other direction is implemented through a
1521 * try-lock-repeat loop. Mutices of unrelated locks can be taken only
1524 * \see osc_lock_enqueue_wait(), lov_lock_cancel(), lov_sublock_wait().
1526 struct mutex cll_guard;
1527 cfs_task_t *cll_guarder;
1532 * Number of holds on a lock. A hold prevents a lock from being
1533 * canceled and destroyed. Protected by cl_lock::cll_guard.
1535 * \see cl_lock_hold(), cl_lock_unhold(), cl_lock_release()
1539 * Number of lock users. Valid in cl_lock_state::CLS_HELD state
1540 * only. Lock user pins lock in CLS_HELD state. Protected by
1541 * cl_lock::cll_guard.
1543 * \see cl_wait(), cl_unuse().
1547 * Flag bit-mask. Values from enum cl_lock_flags. Updates are
1548 * protected by cl_lock::cll_guard.
1550 unsigned long cll_flags;
1552 * A linkage into a list of locks in a closure.
1554 * \see cl_lock_closure
1556 struct list_head cll_inclosure;
1558 * A list of references to this lock, for debugging.
1560 struct lu_ref cll_reference;
1562 * A list of holds on this lock, for debugging.
1564 struct lu_ref cll_holders;
1566 * A reference for cl_lock::cll_descr::cld_obj. For debugging.
1568 struct lu_ref_link *cll_obj_ref;
1569 #ifdef CONFIG_LOCKDEP
1570 /* "dep_map" name is assumed by lockdep.h macros. */
1571 struct lockdep_map dep_map;
1576 * Per-layer part of cl_lock
1578 * \see ccc_lock, lov_lock, lovsub_lock, osc_lock
1580 struct cl_lock_slice {
1581 struct cl_lock *cls_lock;
1582 /** Object slice corresponding to this lock slice. Immutable after
1584 struct cl_object *cls_obj;
1585 const struct cl_lock_operations *cls_ops;
1586 /** Linkage into cl_lock::cll_layers. Immutable after creation. */
1587 struct list_head cls_linkage;
1591 * Possible (non-error) return values of ->clo_{enqueue,wait,unlock}().
1593 * NOTE: lov_subresult() depends on ordering here.
1595 enum cl_lock_transition {
1596 /** operation cannot be completed immediately. Wait for state change. */
1598 /** operation had to release lock mutex, restart. */
1604 * \see vvp_lock_ops, lov_lock_ops, lovsub_lock_ops, osc_lock_ops
1606 struct cl_lock_operations {
1608 * \name statemachine
1610 * State machine transitions. These 3 methods are called to transfer
1611 * lock from one state to another, as described in the commentary
1612 * above enum #cl_lock_state.
1614 * \retval 0 this layer has nothing more to do to before
1615 * transition to the target state happens;
1617 * \retval CLO_REPEAT method had to release and re-acquire cl_lock
1618 * mutex, repeat invocation of transition method
1619 * across all layers;
1621 * \retval CLO_WAIT this layer cannot move to the target state
1622 * immediately, as it has to wait for certain event
1623 * (e.g., the communication with the server). It
1624 * is guaranteed, that when the state transfer
1625 * becomes possible, cl_lock::cll_wq wait-queue
1626 * is signaled. Caller can wait for this event by
1627 * calling cl_lock_state_wait();
1629 * \retval -ve failure, abort state transition, move the lock
1630 * into cl_lock_state::CLS_FREEING state, and set
1631 * cl_lock::cll_error.
1633 * Once all layers voted to agree to transition (by returning 0), lock
1634 * is moved into corresponding target state. All state transition
1635 * methods are optional.
1639 * Attempts to enqueue the lock. Called top-to-bottom.
1641 * \see ccc_lock_enqueue(), lov_lock_enqueue(), lovsub_lock_enqueue(),
1642 * \see osc_lock_enqueue()
1644 int (*clo_enqueue)(const struct lu_env *env,
1645 const struct cl_lock_slice *slice,
1646 struct cl_io *io, __u32 enqflags);
1648 * Attempts to wait for enqueue result. Called top-to-bottom.
1650 * \see ccc_lock_wait(), lov_lock_wait(), osc_lock_wait()
1652 int (*clo_wait)(const struct lu_env *env,
1653 const struct cl_lock_slice *slice);
1655 * Attempts to unlock the lock. Called bottom-to-top. In addition to
1656 * usual return values of lock state-machine methods, this can return
1657 * -ESTALE to indicate that lock cannot be returned to the cache, and
1658 * has to be re-initialized.
1660 * \see ccc_lock_unlock(), lov_lock_unlock(), osc_lock_unlock()
1662 int (*clo_unuse)(const struct lu_env *env,
1663 const struct cl_lock_slice *slice);
1665 * Notifies layer that cached lock is started being used.
1667 * \pre lock->cll_state == CLS_CACHED
1669 * \see lov_lock_use(), osc_lock_use()
1671 int (*clo_use)(const struct lu_env *env,
1672 const struct cl_lock_slice *slice);
1673 /** @} statemachine */
1675 * A method invoked when lock state is changed (as a result of state
1676 * transition). This is used, for example, to track when the state of
1677 * a sub-lock changes, to propagate this change to the corresponding
1678 * top-lock. Optional
1680 * \see lovsub_lock_state()
1682 void (*clo_state)(const struct lu_env *env,
1683 const struct cl_lock_slice *slice,
1684 enum cl_lock_state st);
1686 * Returns true, iff given lock is suitable for the given io, idea
1687 * being, that there are certain "unsafe" locks, e.g., ones acquired
1688 * for O_APPEND writes, that we don't want to re-use for a normal
1689 * write, to avoid the danger of cascading evictions. Optional. Runs
1690 * under cl_object_header::coh_lock_guard.
1692 * XXX this should take more information about lock needed by
1693 * io. Probably lock description or something similar.
1695 * \see lov_fits_into()
1697 int (*clo_fits_into)(const struct lu_env *env,
1698 const struct cl_lock_slice *slice,
1699 const struct cl_lock_descr *need,
1700 const struct cl_io *io);
1703 * Asynchronous System Traps. All of then are optional, all are
1704 * executed bottom-to-top.
1709 * Cancellation callback. Cancel a lock voluntarily, or under
1710 * the request of server.
1712 void (*clo_cancel)(const struct lu_env *env,
1713 const struct cl_lock_slice *slice);
1715 * Lock weighting ast. Executed to estimate how precious this lock
1716 * is. The sum of results across all layers is used to determine
1717 * whether lock worth keeping in cache given present memory usage.
1719 * \see osc_lock_weigh(), vvp_lock_weigh(), lovsub_lock_weigh().
1721 unsigned long (*clo_weigh)(const struct lu_env *env,
1722 const struct cl_lock_slice *slice);
1726 * \see lovsub_lock_closure()
1728 int (*clo_closure)(const struct lu_env *env,
1729 const struct cl_lock_slice *slice,
1730 struct cl_lock_closure *closure);
1732 * Executed top-to-bottom when lock description changes (e.g., as a
1733 * result of server granting more generous lock than was requested).
1735 * \see lovsub_lock_modify()
1737 int (*clo_modify)(const struct lu_env *env,
1738 const struct cl_lock_slice *slice,
1739 const struct cl_lock_descr *updated);
1741 * Notifies layers (bottom-to-top) that lock is going to be
1742 * destroyed. Responsibility of layers is to prevent new references on
1743 * this lock from being acquired once this method returns.
1745 * This can be called multiple times due to the races.
1747 * \see cl_lock_delete()
1748 * \see osc_lock_delete(), lovsub_lock_delete()
1750 void (*clo_delete)(const struct lu_env *env,
1751 const struct cl_lock_slice *slice);
1753 * Destructor. Frees resources and the slice.
1755 * \see ccc_lock_fini(), lov_lock_fini(), lovsub_lock_fini(),
1756 * \see osc_lock_fini()
1758 void (*clo_fini)(const struct lu_env *env, struct cl_lock_slice *slice);
1760 * Optional debugging helper. Prints given lock slice.
1762 int (*clo_print)(const struct lu_env *env,
1763 void *cookie, lu_printer_t p,
1764 const struct cl_lock_slice *slice);
1767 #define CL_LOCK_DEBUG(mask, env, lock, format, ...) \
1769 static DECLARE_LU_CDEBUG_PRINT_INFO(__info, mask); \
1771 if (cdebug_show(mask, DEBUG_SUBSYSTEM)) { \
1772 cl_lock_print(env, &__info, lu_cdebug_printer, lock); \
1773 CDEBUG(mask, format , ## __VA_ARGS__); \
1779 /** \addtogroup cl_page_list cl_page_list
1780 * Page list used to perform collective operations on a group of pages.
1782 * Pages are added to the list one by one. cl_page_list acquires a reference
1783 * for every page in it. Page list is used to perform collective operations on
1786 * - submit pages for an immediate transfer,
1788 * - own pages on behalf of certain io (waiting for each page in turn),
1792 * When list is finalized, it releases references on all pages it still has.
1794 * \todo XXX concurrency control.
1798 struct cl_page_list {
1800 struct list_head pl_pages;
1801 cfs_task_t *pl_owner;
1804 /** \addtogroup cl_page_list cl_page_list
1805 * A 2-queue of pages. A convenience data-type for common use case, 2-queue
1806 * contains an incoming page list and an outgoing page list.
1809 struct cl_page_list c2_qin;
1810 struct cl_page_list c2_qout;
1813 /** @} cl_page_list */
1815 /** \addtogroup cl_io cl_io
1820 * cl_io represents a high level I/O activity like
1821 * read(2)/write(2)/truncate(2) system call, or cancellation of an extent
1824 * cl_io is a layered object, much like cl_{object,page,lock} but with one
1825 * important distinction. We want to minimize number of calls to the allocator
1826 * in the fast path, e.g., in the case of read(2) when everything is cached:
1827 * client already owns the lock over region being read, and data are cached
1828 * due to read-ahead. To avoid allocation of cl_io layers in such situations,
1829 * per-layer io state is stored in the session, associated with the io, see
1830 * struct {vvp,lov,osc}_io for example. Sessions allocation is amortized
1831 * by using free-lists, see cl_env_get().
1833 * There is a small predefined number of possible io types, enumerated in enum
1836 * cl_io is a state machine, that can be advanced concurrently by the multiple
1837 * threads. It is up to these threads to control the concurrency and,
1838 * specifically, to detect when io is done, and its state can be safely
1841 * For read/write io overall execution plan is as following:
1843 * (0) initialize io state through all layers;
1845 * (1) loop: prepare chunk of work to do
1847 * (2) call all layers to collect locks they need to process current chunk
1849 * (3) sort all locks to avoid dead-locks, and acquire them
1851 * (4) process the chunk: call per-page methods
1852 * (cl_io_operations::cio_read_page() for read,
1853 * cl_io_operations::cio_prepare_write(),
1854 * cl_io_operations::cio_commit_write() for write)
1860 * To implement the "parallel IO mode", lov layer creates sub-io's (lazily to
1861 * address allocation efficiency issues mentioned above), and returns with the
1862 * special error condition from per-page method when current sub-io has to
1863 * block. This causes io loop to be repeated, and lov switches to the next
1864 * sub-io in its cl_io_operations::cio_iter_init() implementation.
1869 /** read system call */
1871 /** write system call */
1873 /** truncate system call */
1876 * page fault handling
1880 * Miscellaneous io. This is used for occasional io activity that
1881 * doesn't fit into other types. Currently this is used for:
1883 * - cancellation of an extent lock. This io exists as a context
1884 * to write dirty pages from under the lock being canceled back
1887 * - VM induced page write-out. An io context for writing page out
1888 * for memory cleansing;
1890 * - glimpse. An io context to acquire glimpse lock.
1892 * - grouplock. An io context to acquire group lock.
1894 * CIT_MISC io is used simply as a context in which locks and pages
1895 * are manipulated. Such io has no internal "process", that is,
1896 * cl_io_loop() is never called for it.
1903 * States of cl_io state machine
1906 /** Not initialized. */
1910 /** IO iteration started. */
1914 /** Actual IO is in progress. */
1916 /** IO for the current iteration finished. */
1918 /** Locks released. */
1920 /** Iteration completed. */
1922 /** cl_io finalized. */
1926 enum cl_req_priority {
1932 * IO state private for a layer.
1934 * This is usually embedded into layer session data, rather than allocated
1937 * \see vvp_io, lov_io, osc_io, ccc_io
1939 struct cl_io_slice {
1940 struct cl_io *cis_io;
1941 /** corresponding object slice. Immutable after creation. */
1942 struct cl_object *cis_obj;
1943 /** io operations. Immutable after creation. */
1944 const struct cl_io_operations *cis_iop;
1946 * linkage into a list of all slices for a given cl_io, hanging off
1947 * cl_io::ci_layers. Immutable after creation.
1949 struct list_head cis_linkage;
1954 * Per-layer io operations.
1955 * \see vvp_io_ops, lov_io_ops, lovsub_io_ops, osc_io_ops
1957 struct cl_io_operations {
1959 * Vector of io state transition methods for every io type.
1961 * \see cl_page_operations::io
1965 * Prepare io iteration at a given layer.
1967 * Called top-to-bottom at the beginning of each iteration of
1968 * "io loop" (if it makes sense for this type of io). Here
1969 * layer selects what work it will do during this iteration.
1971 * \see cl_io_operations::cio_iter_fini()
1973 int (*cio_iter_init) (const struct lu_env *env,
1974 const struct cl_io_slice *slice);
1976 * Finalize io iteration.
1978 * Called bottom-to-top at the end of each iteration of "io
1979 * loop". Here layers can decide whether IO has to be
1982 * \see cl_io_operations::cio_iter_init()
1984 void (*cio_iter_fini) (const struct lu_env *env,
1985 const struct cl_io_slice *slice);
1987 * Collect locks for the current iteration of io.
1989 * Called top-to-bottom to collect all locks necessary for
1990 * this iteration. This methods shouldn't actually enqueue
1991 * anything, instead it should post a lock through
1992 * cl_io_lock_add(). Once all locks are collected, they are
1993 * sorted and enqueued in the proper order.
1995 int (*cio_lock) (const struct lu_env *env,
1996 const struct cl_io_slice *slice);
1998 * Finalize unlocking.
2000 * Called bottom-to-top to finish layer specific unlocking
2001 * functionality, after generic code released all locks
2002 * acquired by cl_io_operations::cio_lock().
2004 void (*cio_unlock)(const struct lu_env *env,
2005 const struct cl_io_slice *slice);
2007 * Start io iteration.
2009 * Once all locks are acquired, called top-to-bottom to
2010 * commence actual IO. In the current implementation,
2011 * top-level vvp_io_{read,write}_start() does all the work
2012 * synchronously by calling generic_file_*(), so other layers
2013 * are called when everything is done.
2015 int (*cio_start)(const struct lu_env *env,
2016 const struct cl_io_slice *slice);
2018 * Called top-to-bottom at the end of io loop. Here layer
2019 * might wait for an unfinished asynchronous io.
2021 void (*cio_end) (const struct lu_env *env,
2022 const struct cl_io_slice *slice);
2024 * Called bottom-to-top to notify layers that read/write IO
2025 * iteration finished, with \a nob bytes transferred.
2027 void (*cio_advance)(const struct lu_env *env,
2028 const struct cl_io_slice *slice,
2031 * Called once per io, bottom-to-top to release io resources.
2033 void (*cio_fini) (const struct lu_env *env,
2034 const struct cl_io_slice *slice);
2038 * Submit pages from \a queue->c2_qin for IO, and move
2039 * successfully submitted pages into \a queue->c2_qout. Return
2040 * non-zero if failed to submit even the single page. If
2041 * submission failed after some pages were moved into \a
2042 * queue->c2_qout, completion callback with non-zero ioret is
2045 int (*cio_submit)(const struct lu_env *env,
2046 const struct cl_io_slice *slice,
2047 enum cl_req_type crt,
2048 struct cl_2queue *queue,
2049 enum cl_req_priority priority);
2052 * Read missing page.
2054 * Called by a top-level cl_io_operations::op[CIT_READ]::cio_start()
2055 * method, when it hits not-up-to-date page in the range. Optional.
2057 * \pre io->ci_type == CIT_READ
2059 int (*cio_read_page)(const struct lu_env *env,
2060 const struct cl_io_slice *slice,
2061 const struct cl_page_slice *page);
2063 * Prepare write of a \a page. Called bottom-to-top by a top-level
2064 * cl_io_operations::op[CIT_WRITE]::cio_start() to prepare page for
2065 * get data from user-level buffer.
2067 * \pre io->ci_type == CIT_WRITE
2069 * \see vvp_io_prepare_write(), lov_io_prepare_write(),
2070 * osc_io_prepare_write().
2072 int (*cio_prepare_write)(const struct lu_env *env,
2073 const struct cl_io_slice *slice,
2074 const struct cl_page_slice *page,
2075 unsigned from, unsigned to);
2078 * \pre io->ci_type == CIT_WRITE
2080 * \see vvp_io_commit_write(), lov_io_commit_write(),
2081 * osc_io_commit_write().
2083 int (*cio_commit_write)(const struct lu_env *env,
2084 const struct cl_io_slice *slice,
2085 const struct cl_page_slice *page,
2086 unsigned from, unsigned to);
2088 * Optional debugging helper. Print given io slice.
2090 int (*cio_print)(const struct lu_env *env, void *cookie,
2091 lu_printer_t p, const struct cl_io_slice *slice);
2095 * Flags to lock enqueue procedure.
2100 * instruct server to not block, if conflicting lock is found. Instead
2101 * -EWOULDBLOCK is returned immediately.
2103 CEF_NONBLOCK = 0x00000001,
2105 * take lock asynchronously (out of order), as it cannot
2106 * deadlock. This is for LDLM_FL_HAS_INTENT locks used for glimpsing.
2108 CEF_ASYNC = 0x00000002,
2110 * tell the server to instruct (though a flag in the blocking ast) an
2111 * owner of the conflicting lock, that it can drop dirty pages
2112 * protected by this lock, without sending them to the server.
2114 CEF_DISCARD_DATA = 0x00000004,
2116 * tell the sub layers that it must be a `real' lock. This is used for
2117 * mmapped-buffer locks and glimpse locks that must be never converted
2118 * into lockless mode.
2120 * \see vvp_mmap_locks(), cl_glimpse_lock().
2122 CEF_MUST = 0x00000008,
2124 * tell the sub layers that never request a `real' lock. This flag is
2125 * not used currently.
2127 * cl_io::ci_lockreq and CEF_{MUST,NEVER} flags specify lockless
2128 * conversion policy: ci_lockreq describes generic information of lock
2129 * requirement for this IO, especially for locks which belong to the
2130 * object doing IO; however, lock itself may have precise requirements
2131 * that are described by the enqueue flags.
2133 CEF_NEVER = 0x00000010,
2135 * mask of enq_flags.
2137 CEF_MASK = 0x0000001f
2141 * Link between lock and io. Intermediate structure is needed, because the
2142 * same lock can be part of multiple io's simultaneously.
2144 struct cl_io_lock_link {
2145 /** linkage into one of cl_lockset lists. */
2146 struct list_head cill_linkage;
2147 struct cl_lock_descr cill_descr;
2148 struct cl_lock *cill_lock;
2150 * flags to enqueue lock for this IO. A combination of bit-flags from
2151 * enum cl_enq_flags.
2153 __u32 cill_enq_flags;
2154 /** optional destructor */
2155 void (*cill_fini)(const struct lu_env *env,
2156 struct cl_io_lock_link *link);
2160 * Lock-set represents a collection of locks, that io needs at a
2161 * time. Generally speaking, client tries to avoid holding multiple locks when
2164 * - holding extent locks over multiple ost's introduces the danger of
2165 * "cascading timeouts";
2167 * - holding multiple locks over the same ost is still dead-lock prone,
2168 * see comment in osc_lock_enqueue(),
2170 * but there are certain situations where this is unavoidable:
2172 * - O_APPEND writes have to take [0, EOF] lock for correctness;
2174 * - truncate has to take [new-size, EOF] lock for correctness;
2176 * - SNS has to take locks across full stripe for correctness;
2178 * - in the case when user level buffer, supplied to {read,write}(file0),
2179 * is a part of a memory mapped lustre file, client has to take a dlm
2180 * locks on file0, and all files that back up the buffer (or a part of
2181 * the buffer, that is being processed in the current chunk, in any
2182 * case, there are situations where at least 2 locks are necessary).
2184 * In such cases we at least try to take locks in the same consistent
2185 * order. To this end, all locks are first collected, then sorted, and then
2189 /** locks to be acquired. */
2190 struct list_head cls_todo;
2191 /** locks currently being processed. */
2192 struct list_head cls_curr;
2193 /** locks acquired. */
2194 struct list_head cls_done;
2198 * Lock requirements(demand) for IO. It should be cl_io_lock_req,
2199 * but 'req' is always to be thought as 'request' :-)
2201 enum cl_io_lock_dmd {
2202 /** Always lock data (e.g., O_APPEND). */
2204 /** Layers are free to decide between local and global locking. */
2206 /** Never lock: there is no cache (e.g., liblustre). */
2210 struct cl_io_rw_common {
2219 * cl_io is shared by all threads participating in this IO (in current
2220 * implementation only one thread advances IO, but parallel IO design and
2221 * concurrent copy_*_user() require multiple threads acting on the same IO. It
2222 * is up to these threads to serialize their activities, including updates to
2223 * mutable cl_io fields.
2226 /** type of this IO. Immutable after creation. */
2227 enum cl_io_type ci_type;
2228 /** current state of cl_io state machine. */
2229 enum cl_io_state ci_state;
2230 /** main object this io is against. Immutable after creation. */
2231 struct cl_object *ci_obj;
2233 * Upper layer io, of which this io is a part of. Immutable after
2236 struct cl_io *ci_parent;
2237 /** List of slices. Immutable after creation. */
2238 struct list_head ci_layers;
2239 /** list of locks (to be) acquired by this io. */
2240 struct cl_lockset ci_lockset;
2241 /** lock requirements, this is just a help info for sublayers. */
2242 enum cl_io_lock_dmd ci_lockreq;
2244 * This io has held grouplock, to inform sublayers that
2245 * don't do lockless i/o.
2250 struct cl_io_rw_common rd;
2254 struct cl_io_rw_common wr;
2257 struct cl_io_rw_common ci_rw;
2258 struct cl_truncate_io {
2259 /** new size to which file is truncated */
2261 struct obd_capa *tr_capa;
2263 struct cl_fault_io {
2264 /** page index within file. */
2266 /** bytes valid byte on a faulted page. */
2268 /** writable page? */
2270 /** page of an executable? */
2272 /** resulting page */
2273 struct cl_page *ft_page;
2276 struct cl_2queue ci_queue;
2281 * Number of pages owned by this IO. For invariant checking.
2283 unsigned ci_owned_nr;
2288 /** \addtogroup cl_req cl_req
2293 * There are two possible modes of transfer initiation on the client:
2295 * - immediate transfer: this is started when a high level io wants a page
2296 * or a collection of pages to be transferred right away. Examples:
2297 * read-ahead, synchronous read in the case of non-page aligned write,
2298 * page write-out as a part of extent lock cancellation, page write-out
2299 * as a part of memory cleansing. Immediate transfer can be both
2300 * cl_req_type::CRT_READ and cl_req_type::CRT_WRITE;
2302 * - opportunistic transfer (cl_req_type::CRT_WRITE only), that happens
2303 * when io wants to transfer a page to the server some time later, when
2304 * it can be done efficiently. Example: pages dirtied by the write(2)
2307 * In any case, transfer takes place in the form of a cl_req, which is a
2308 * representation for a network RPC.
2310 * Pages queued for an opportunistic transfer are cached until it is decided
2311 * that efficient RPC can be composed of them. This decision is made by "a
2312 * req-formation engine", currently implemented as a part of osc
2313 * layer. Req-formation depends on many factors: the size of the resulting
2314 * RPC, whether or not multi-object RPCs are supported by the server,
2315 * max-rpc-in-flight limitations, size of the dirty cache, etc.
2317 * For the immediate transfer io submits a cl_page_list, that req-formation
2318 * engine slices into cl_req's, possibly adding cached pages to some of
2319 * the resulting req's.
2321 * Whenever a page from cl_page_list is added to a newly constructed req, its
2322 * cl_page_operations::cpo_prep() layer methods are called. At that moment,
2323 * page state is atomically changed from cl_page_state::CPS_OWNED to
2324 * cl_page_state::CPS_PAGEOUT or cl_page_state::CPS_PAGEIN, cl_page::cp_owner
2325 * is zeroed, and cl_page::cp_req is set to the
2326 * req. cl_page_operations::cpo_prep() method at the particular layer might
2327 * return -EALREADY to indicate that it does not need to submit this page
2328 * at all. This is possible, for example, if page, submitted for read,
2329 * became up-to-date in the meantime; and for write, the page don't have
2330 * dirty bit marked. \see cl_io_submit_rw()
2332 * Whenever a cached page is added to a newly constructed req, its
2333 * cl_page_operations::cpo_make_ready() layer methods are called. At that
2334 * moment, page state is atomically changed from cl_page_state::CPS_CACHED to
2335 * cl_page_state::CPS_PAGEOUT, and cl_page::cp_req is set to
2336 * req. cl_page_operations::cpo_make_ready() method at the particular layer
2337 * might return -EAGAIN to indicate that this page is not eligible for the
2338 * transfer right now.
2342 * Plan is to divide transfers into "priority bands" (indicated when
2343 * submitting cl_page_list, and queuing a page for the opportunistic transfer)
2344 * and allow glueing of cached pages to immediate transfers only within single
2345 * band. This would make high priority transfers (like lock cancellation or
2346 * memory pressure induced write-out) really high priority.
2351 * Per-transfer attributes.
2353 struct cl_req_attr {
2354 /** Generic attributes for the server consumption. */
2355 struct obdo *cra_oa;
2357 struct obd_capa *cra_capa;
2361 * Transfer request operations definable at every layer.
2363 * Concurrency: transfer formation engine synchronizes calls to all transfer
2366 struct cl_req_operations {
2368 * Invoked top-to-bottom by cl_req_prep() when transfer formation is
2369 * complete (all pages are added).
2371 * \see osc_req_prep()
2373 int (*cro_prep)(const struct lu_env *env,
2374 const struct cl_req_slice *slice);
2376 * Called top-to-bottom to fill in \a oa fields. This is called twice
2377 * with different flags, see bug 10150 and osc_build_req().
2379 * \param obj an object from cl_req which attributes are to be set in
2382 * \param oa struct obdo where attributes are placed
2384 * \param flags \a oa fields to be filled.
2386 void (*cro_attr_set)(const struct lu_env *env,
2387 const struct cl_req_slice *slice,
2388 const struct cl_object *obj,
2389 struct cl_req_attr *attr, obd_valid flags);
2391 * Called top-to-bottom from cl_req_completion() to notify layers that
2392 * transfer completed. Has to free all state allocated by
2393 * cl_device_operations::cdo_req_init().
2395 void (*cro_completion)(const struct lu_env *env,
2396 const struct cl_req_slice *slice, int ioret);
2400 * A per-object state that (potentially multi-object) transfer request keeps.
2403 /** object itself */
2404 struct cl_object *ro_obj;
2405 /** reference to cl_req_obj::ro_obj. For debugging. */
2406 struct lu_ref_link *ro_obj_ref;
2407 /* something else? Number of pages for a given object? */
2413 * Transfer requests are not reference counted, because IO sub-system owns
2414 * them exclusively and knows when to free them.
2418 * cl_req is created by cl_req_alloc() that calls
2419 * cl_device_operations::cdo_req_init() device methods to allocate per-req
2420 * state in every layer.
2422 * Then pages are added (cl_req_page_add()), req keeps track of all objects it
2423 * contains pages for.
2425 * Once all pages were collected, cl_page_operations::cpo_prep() method is
2426 * called top-to-bottom. At that point layers can modify req, let it pass, or
2427 * deny it completely. This is to support things like SNS that have transfer
2428 * ordering requirements invisible to the individual req-formation engine.
2430 * On transfer completion (or transfer timeout, or failure to initiate the
2431 * transfer of an allocated req), cl_req_operations::cro_completion() method
2432 * is called, after execution of cl_page_operations::cpo_completion() of all
2436 enum cl_req_type crq_type;
2437 /** A list of pages being transfered */
2438 struct list_head crq_pages;
2439 /** Number of pages in cl_req::crq_pages */
2440 unsigned crq_nrpages;
2441 /** An array of objects which pages are in ->crq_pages */
2442 struct cl_req_obj *crq_o;
2443 /** Number of elements in cl_req::crq_objs[] */
2444 unsigned crq_nrobjs;
2445 struct list_head crq_layers;
2449 * Per-layer state for request.
2451 struct cl_req_slice {
2452 struct cl_req *crs_req;
2453 struct cl_device *crs_dev;
2454 struct list_head crs_linkage;
2455 const struct cl_req_operations *crs_ops;
2461 * Stats for a generic cache (similar to inode, lu_object, etc. caches).
2463 struct cache_stats {
2464 const char *cs_name;
2465 /** how many entities were created at all */
2466 atomic_t cs_created;
2467 /** how many cache lookups were performed */
2469 /** how many times cache lookup resulted in a hit */
2471 /** how many entities are in the cache right now */
2473 /** how many entities in the cache are actively used (and cannot be
2474 * evicted) right now */
2478 /** These are not exported so far */
2479 void cache_stats_init (struct cache_stats *cs, const char *name);
2480 int cache_stats_print(const struct cache_stats *cs,
2481 char *page, int count, int header);
2484 * Client-side site. This represents particular client stack. "Global"
2485 * variables should (directly or indirectly) be added here to allow multiple
2486 * clients to co-exist in the single address space.
2489 struct lu_site cs_lu;
2491 * Statistical counters. Atomics do not scale, something better like
2492 * per-cpu counters is needed.
2494 * These are exported as /proc/fs/lustre/llite/.../site
2496 * When interpreting keep in mind that both sub-locks (and sub-pages)
2497 * and top-locks (and top-pages) are accounted here.
2499 struct cache_stats cs_pages;
2500 struct cache_stats cs_locks;
2501 atomic_t cs_pages_state[CPS_NR];
2502 atomic_t cs_locks_state[CLS_NR];
2505 int cl_site_init (struct cl_site *s, struct cl_device *top);
2506 void cl_site_fini (struct cl_site *s);
2507 void cl_stack_fini(const struct lu_env *env, struct cl_device *cl);
2510 * Output client site statistical counters into a buffer. Suitable for
2511 * ll_rd_*()-style functions.
2513 int cl_site_stats_print(const struct cl_site *s, char *page, int count);
2518 * Type conversion and accessory functions.
2522 static inline struct cl_site *lu2cl_site(const struct lu_site *site)
2524 return container_of(site, struct cl_site, cs_lu);
2527 static inline int lu_device_is_cl(const struct lu_device *d)
2529 return d->ld_type->ldt_tags & LU_DEVICE_CL;
2532 static inline struct cl_device *lu2cl_dev(const struct lu_device *d)
2534 LASSERT(d == NULL || IS_ERR(d) || lu_device_is_cl(d));
2535 return container_of0(d, struct cl_device, cd_lu_dev);
2538 static inline struct lu_device *cl2lu_dev(struct cl_device *d)
2540 return &d->cd_lu_dev;
2543 static inline struct cl_object *lu2cl(const struct lu_object *o)
2545 LASSERT(o == NULL || IS_ERR(o) || lu_device_is_cl(o->lo_dev));
2546 return container_of0(o, struct cl_object, co_lu);
2549 static inline const struct cl_object_conf *
2550 lu2cl_conf(const struct lu_object_conf *conf)
2552 return container_of0(conf, struct cl_object_conf, coc_lu);
2555 static inline struct cl_object *cl_object_next(const struct cl_object *obj)
2557 return obj ? lu2cl(lu_object_next(&obj->co_lu)) : NULL;
2560 static inline struct cl_device *cl_object_device(const struct cl_object *o)
2562 LASSERT(o == NULL || IS_ERR(o) || lu_device_is_cl(o->co_lu.lo_dev));
2563 return container_of0(o->co_lu.lo_dev, struct cl_device, cd_lu_dev);
2566 static inline struct cl_object_header *luh2coh(const struct lu_object_header *h)
2568 return container_of0(h, struct cl_object_header, coh_lu);
2571 static inline struct cl_site *cl_object_site(const struct cl_object *obj)
2573 return lu2cl_site(obj->co_lu.lo_dev->ld_site);
2577 struct cl_object_header *cl_object_header(const struct cl_object *obj)
2579 return luh2coh(obj->co_lu.lo_header);
2582 static inline int cl_device_init(struct cl_device *d, struct lu_device_type *t)
2584 return lu_device_init(&d->cd_lu_dev, t);
2587 static inline void cl_device_fini(struct cl_device *d)
2589 lu_device_fini(&d->cd_lu_dev);
2592 void cl_page_slice_add(struct cl_page *page, struct cl_page_slice *slice,
2593 struct cl_object *obj,
2594 const struct cl_page_operations *ops);
2595 void cl_lock_slice_add(struct cl_lock *lock, struct cl_lock_slice *slice,
2596 struct cl_object *obj,
2597 const struct cl_lock_operations *ops);
2598 void cl_io_slice_add(struct cl_io *io, struct cl_io_slice *slice,
2599 struct cl_object *obj, const struct cl_io_operations *ops);
2600 void cl_req_slice_add(struct cl_req *req, struct cl_req_slice *slice,
2601 struct cl_device *dev,
2602 const struct cl_req_operations *ops);
2605 /** \defgroup cl_object cl_object
2607 struct cl_object *cl_object_top (struct cl_object *o);
2608 struct cl_object *cl_object_find(const struct lu_env *env, struct cl_device *cd,
2609 const struct lu_fid *fid,
2610 const struct cl_object_conf *c);
2612 int cl_object_header_init(struct cl_object_header *h);
2613 void cl_object_header_fini(struct cl_object_header *h);
2614 void cl_object_put (const struct lu_env *env, struct cl_object *o);
2615 void cl_object_get (struct cl_object *o);
2616 void cl_object_attr_lock (struct cl_object *o);
2617 void cl_object_attr_unlock(struct cl_object *o);
2618 int cl_object_attr_get (const struct lu_env *env, struct cl_object *obj,
2619 struct cl_attr *attr);
2620 int cl_object_attr_set (const struct lu_env *env, struct cl_object *obj,
2621 const struct cl_attr *attr, unsigned valid);
2622 int cl_object_glimpse (const struct lu_env *env, struct cl_object *obj,
2623 struct ost_lvb *lvb);
2624 int cl_conf_set (const struct lu_env *env, struct cl_object *obj,
2625 const struct cl_object_conf *conf);
2626 void cl_object_prune (const struct lu_env *env, struct cl_object *obj);
2627 void cl_object_kill (const struct lu_env *env, struct cl_object *obj);
2630 * Returns true, iff \a o0 and \a o1 are slices of the same object.
2632 static inline int cl_object_same(struct cl_object *o0, struct cl_object *o1)
2634 return cl_object_header(o0) == cl_object_header(o1);
2639 /** \defgroup cl_page cl_page
2641 struct cl_page *cl_page_lookup(struct cl_object_header *hdr,
2643 void cl_page_gang_lookup(const struct lu_env *env,
2644 struct cl_object *obj,
2646 pgoff_t start, pgoff_t end,
2647 struct cl_page_list *plist);
2648 struct cl_page *cl_page_find (const struct lu_env *env,
2649 struct cl_object *obj,
2650 pgoff_t idx, struct page *vmpage,
2651 enum cl_page_type type);
2652 void cl_page_get (struct cl_page *page);
2653 void cl_page_put (const struct lu_env *env,
2654 struct cl_page *page);
2655 void cl_page_print (const struct lu_env *env, void *cookie,
2656 lu_printer_t printer,
2657 const struct cl_page *pg);
2658 void cl_page_header_print(const struct lu_env *env, void *cookie,
2659 lu_printer_t printer,
2660 const struct cl_page *pg);
2661 cfs_page_t *cl_page_vmpage (const struct lu_env *env,
2662 struct cl_page *page);
2663 struct cl_page *cl_vmpage_page (cfs_page_t *vmpage, struct cl_object *obj);
2664 struct cl_page *cl_page_top (struct cl_page *page);
2665 int cl_is_page (const void *addr);
2667 const struct cl_page_slice *cl_page_at(const struct cl_page *page,
2668 const struct lu_device_type *dtype);
2673 * Functions dealing with the ownership of page by io.
2677 int cl_page_own (const struct lu_env *env,
2678 struct cl_io *io, struct cl_page *page);
2679 void cl_page_assume (const struct lu_env *env,
2680 struct cl_io *io, struct cl_page *page);
2681 void cl_page_unassume (const struct lu_env *env,
2682 struct cl_io *io, struct cl_page *pg);
2683 void cl_page_disown (const struct lu_env *env,
2684 struct cl_io *io, struct cl_page *page);
2685 int cl_page_is_owned (const struct cl_page *pg, const struct cl_io *io);
2692 * Functions dealing with the preparation of a page for a transfer, and
2693 * tracking transfer state.
2696 int cl_page_prep (const struct lu_env *env, struct cl_io *io,
2697 struct cl_page *pg, enum cl_req_type crt);
2698 void cl_page_completion (const struct lu_env *env,
2699 struct cl_page *pg, enum cl_req_type crt, int ioret);
2700 int cl_page_make_ready (const struct lu_env *env, struct cl_page *pg,
2701 enum cl_req_type crt);
2702 int cl_page_cache_add (const struct lu_env *env, struct cl_io *io,
2703 struct cl_page *pg, enum cl_req_type crt);
2704 void cl_page_clip (const struct lu_env *env, struct cl_page *pg,
2706 int cl_page_cancel (const struct lu_env *env, struct cl_page *page);
2712 * \name helper routines
2713 * Functions to discard, delete and export a cl_page.
2716 void cl_page_discard (const struct lu_env *env, struct cl_io *io,
2717 struct cl_page *pg);
2718 void cl_page_delete (const struct lu_env *env, struct cl_page *pg);
2719 int cl_page_unmap (const struct lu_env *env, struct cl_io *io,
2720 struct cl_page *pg);
2721 int cl_page_is_vmlocked (const struct lu_env *env,
2722 const struct cl_page *pg);
2723 void cl_page_export (const struct lu_env *env,
2724 struct cl_page *pg, int uptodate);
2725 int cl_page_is_under_lock(const struct lu_env *env, struct cl_io *io,
2726 struct cl_page *page);
2727 loff_t cl_offset (const struct cl_object *obj, pgoff_t idx);
2728 pgoff_t cl_index (const struct cl_object *obj, loff_t offset);
2729 int cl_page_size (const struct cl_object *obj);
2730 int cl_pages_prune (const struct lu_env *env, struct cl_object *obj);
2732 void cl_lock_print (const struct lu_env *env, void *cookie,
2733 lu_printer_t printer, const struct cl_lock *lock);
2734 void cl_lock_descr_print(const struct lu_env *env, void *cookie,
2735 lu_printer_t printer,
2736 const struct cl_lock_descr *descr);
2741 /** \defgroup cl_lock cl_lock
2744 struct cl_lock *cl_lock_hold(const struct lu_env *env, const struct cl_io *io,
2745 const struct cl_lock_descr *need,
2746 const char *scope, const void *source);
2747 struct cl_lock *cl_lock_peek(const struct lu_env *env, const struct cl_io *io,
2748 const struct cl_lock_descr *need,
2749 const char *scope, const void *source);
2750 struct cl_lock *cl_lock_request(const struct lu_env *env, struct cl_io *io,
2751 const struct cl_lock_descr *need,
2753 const char *scope, const void *source);
2754 struct cl_lock *cl_lock_at_page(const struct lu_env *env, struct cl_object *obj,
2755 struct cl_page *page, struct cl_lock *except,
2756 int pending, int canceld);
2758 const struct cl_lock_slice *cl_lock_at(const struct cl_lock *lock,
2759 const struct lu_device_type *dtype);
2761 void cl_lock_get (struct cl_lock *lock);
2762 void cl_lock_get_trust (struct cl_lock *lock);
2763 void cl_lock_put (const struct lu_env *env, struct cl_lock *lock);
2764 void cl_lock_hold_add (const struct lu_env *env, struct cl_lock *lock,
2765 const char *scope, const void *source);
2766 void cl_lock_unhold (const struct lu_env *env, struct cl_lock *lock,
2767 const char *scope, const void *source);
2768 void cl_lock_release (const struct lu_env *env, struct cl_lock *lock,
2769 const char *scope, const void *source);
2770 void cl_lock_user_add (const struct lu_env *env, struct cl_lock *lock);
2771 int cl_lock_user_del (const struct lu_env *env, struct cl_lock *lock);
2772 int cl_lock_compatible(const struct cl_lock *lock1,
2773 const struct cl_lock *lock2);
2775 /** \name statemachine statemachine
2776 * Interface to lock state machine consists of 3 parts:
2778 * - "try" functions that attempt to effect a state transition. If state
2779 * transition is not possible right now (e.g., if it has to wait for some
2780 * asynchronous event to occur), these functions return
2781 * cl_lock_transition::CLO_WAIT.
2783 * - "non-try" functions that implement synchronous blocking interface on
2784 * top of non-blocking "try" functions. These functions repeatedly call
2785 * corresponding "try" versions, and if state transition is not possible
2786 * immediately, wait for lock state change.
2788 * - methods from cl_lock_operations, called by "try" functions. Lock can
2789 * be advanced to the target state only when all layers voted that they
2790 * are ready for this transition. "Try" functions call methods under lock
2791 * mutex. If a layer had to release a mutex, it re-acquires it and returns
2792 * cl_lock_transition::CLO_REPEAT, causing "try" function to call all
2795 * TRY NON-TRY METHOD FINAL STATE
2797 * cl_enqueue_try() cl_enqueue() cl_lock_operations::clo_enqueue() CLS_ENQUEUED
2799 * cl_wait_try() cl_wait() cl_lock_operations::clo_wait() CLS_HELD
2801 * cl_unuse_try() cl_unuse() cl_lock_operations::clo_unuse() CLS_CACHED
2803 * cl_use_try() NONE cl_lock_operations::clo_use() CLS_HELD
2807 int cl_enqueue (const struct lu_env *env, struct cl_lock *lock,
2808 struct cl_io *io, __u32 flags);
2809 int cl_wait (const struct lu_env *env, struct cl_lock *lock);
2810 void cl_unuse (const struct lu_env *env, struct cl_lock *lock);
2811 int cl_enqueue_try(const struct lu_env *env, struct cl_lock *lock,
2812 struct cl_io *io, __u32 flags);
2813 int cl_unuse_try (const struct lu_env *env, struct cl_lock *lock);
2814 int cl_wait_try (const struct lu_env *env, struct cl_lock *lock);
2815 int cl_use_try (const struct lu_env *env, struct cl_lock *lock);
2816 /** @} statemachine */
2818 void cl_lock_signal (const struct lu_env *env, struct cl_lock *lock);
2819 int cl_lock_state_wait (const struct lu_env *env, struct cl_lock *lock);
2820 void cl_lock_state_set (const struct lu_env *env, struct cl_lock *lock,
2821 enum cl_lock_state state);
2822 int cl_queue_match (const struct list_head *queue,
2823 const struct cl_lock_descr *need);
2825 void cl_lock_mutex_get (const struct lu_env *env, struct cl_lock *lock);
2826 int cl_lock_mutex_try (const struct lu_env *env, struct cl_lock *lock);
2827 void cl_lock_mutex_put (const struct lu_env *env, struct cl_lock *lock);
2828 int cl_lock_is_mutexed (struct cl_lock *lock);
2829 int cl_lock_nr_mutexed (const struct lu_env *env);
2830 int cl_lock_page_out (const struct lu_env *env, struct cl_lock *lock,
2832 int cl_lock_ext_match (const struct cl_lock_descr *has,
2833 const struct cl_lock_descr *need);
2834 int cl_lock_descr_match(const struct cl_lock_descr *has,
2835 const struct cl_lock_descr *need);
2836 int cl_lock_mode_match (enum cl_lock_mode has, enum cl_lock_mode need);
2837 int cl_lock_modify (const struct lu_env *env, struct cl_lock *lock,
2838 const struct cl_lock_descr *desc);
2840 void cl_lock_closure_init (const struct lu_env *env,
2841 struct cl_lock_closure *closure,
2842 struct cl_lock *origin, int wait);
2843 void cl_lock_closure_fini (struct cl_lock_closure *closure);
2844 int cl_lock_closure_build(const struct lu_env *env, struct cl_lock *lock,
2845 struct cl_lock_closure *closure);
2846 void cl_lock_disclosure (const struct lu_env *env,
2847 struct cl_lock_closure *closure);
2848 int cl_lock_enclosure (const struct lu_env *env, struct cl_lock *lock,
2849 struct cl_lock_closure *closure);
2851 void cl_lock_cancel(const struct lu_env *env, struct cl_lock *lock);
2852 void cl_lock_delete(const struct lu_env *env, struct cl_lock *lock);
2853 void cl_lock_error (const struct lu_env *env, struct cl_lock *lock, int error);
2854 void cl_locks_prune(const struct lu_env *env, struct cl_object *obj, int wait);
2855 int cl_is_lock (const void *addr);
2857 unsigned long cl_lock_weigh(const struct lu_env *env, struct cl_lock *lock);
2861 /** \defgroup cl_io cl_io
2864 int cl_io_init (const struct lu_env *env, struct cl_io *io,
2865 enum cl_io_type iot, struct cl_object *obj);
2866 int cl_io_sub_init (const struct lu_env *env, struct cl_io *io,
2867 enum cl_io_type iot, struct cl_object *obj);
2868 int cl_io_rw_init (const struct lu_env *env, struct cl_io *io,
2869 enum cl_io_type iot, loff_t pos, size_t count);
2870 int cl_io_loop (const struct lu_env *env, struct cl_io *io);
2872 void cl_io_fini (const struct lu_env *env, struct cl_io *io);
2873 int cl_io_iter_init (const struct lu_env *env, struct cl_io *io);
2874 void cl_io_iter_fini (const struct lu_env *env, struct cl_io *io);
2875 int cl_io_lock (const struct lu_env *env, struct cl_io *io);
2876 void cl_io_unlock (const struct lu_env *env, struct cl_io *io);
2877 int cl_io_start (const struct lu_env *env, struct cl_io *io);
2878 void cl_io_end (const struct lu_env *env, struct cl_io *io);
2879 int cl_io_lock_add (const struct lu_env *env, struct cl_io *io,
2880 struct cl_io_lock_link *link);
2881 int cl_io_lock_alloc_add(const struct lu_env *env, struct cl_io *io,
2882 struct cl_lock_descr *descr, int enqflags);
2883 int cl_io_read_page (const struct lu_env *env, struct cl_io *io,
2884 struct cl_page *page);
2885 int cl_io_prepare_write(const struct lu_env *env, struct cl_io *io,
2886 struct cl_page *page, unsigned from, unsigned to);
2887 int cl_io_commit_write (const struct lu_env *env, struct cl_io *io,
2888 struct cl_page *page, unsigned from, unsigned to);
2889 int cl_io_submit_rw (const struct lu_env *env, struct cl_io *io,
2890 enum cl_req_type iot, struct cl_2queue *queue,
2891 enum cl_req_priority priority);
2892 void cl_io_rw_advance (const struct lu_env *env, struct cl_io *io,
2894 int cl_io_cancel (const struct lu_env *env, struct cl_io *io,
2895 struct cl_page_list *queue);
2896 int cl_io_is_going (const struct lu_env *env);
2899 * True, iff \a io is an O_APPEND write(2).
2901 static inline int cl_io_is_append(const struct cl_io *io)
2903 return io->ci_type == CIT_WRITE && io->u.ci_wr.wr_append;
2906 int cl_io_is_sendfile(const struct cl_io *io);
2908 struct cl_io *cl_io_top(struct cl_io *io);
2910 void cl_io_print(const struct lu_env *env, void *cookie,
2911 lu_printer_t printer, const struct cl_io *io);
2913 #define CL_IO_SLICE_CLEAN(foo_io, base) \
2915 typeof(foo_io) __foo_io = (foo_io); \
2917 CLASSERT(offsetof(typeof(*__foo_io), base) == 0); \
2918 memset(&__foo_io->base + 1, 0, \
2919 (sizeof *__foo_io) - sizeof __foo_io->base); \
2924 /** \defgroup cl_page_list cl_page_list
2928 * Iterate over pages in a page list.
2930 #define cl_page_list_for_each(page, list) \
2931 list_for_each_entry((page), &(list)->pl_pages, cp_batch)
2934 * Iterate over pages in a page list, taking possible removals into account.
2936 #define cl_page_list_for_each_safe(page, temp, list) \
2937 list_for_each_entry_safe((page), (temp), &(list)->pl_pages, cp_batch)
2939 void cl_page_list_init (struct cl_page_list *plist);
2940 void cl_page_list_add (struct cl_page_list *plist, struct cl_page *page);
2941 void cl_page_list_move (struct cl_page_list *dst, struct cl_page_list *src,
2942 struct cl_page *page);
2943 void cl_page_list_splice (struct cl_page_list *list,
2944 struct cl_page_list *head);
2945 void cl_page_list_del (const struct lu_env *env,
2946 struct cl_page_list *plist, struct cl_page *page);
2947 void cl_page_list_disown (const struct lu_env *env,
2948 struct cl_io *io, struct cl_page_list *plist);
2949 int cl_page_list_own (const struct lu_env *env,
2950 struct cl_io *io, struct cl_page_list *plist);
2951 void cl_page_list_assume (const struct lu_env *env,
2952 struct cl_io *io, struct cl_page_list *plist);
2953 void cl_page_list_discard(const struct lu_env *env,
2954 struct cl_io *io, struct cl_page_list *plist);
2955 int cl_page_list_unmap (const struct lu_env *env,
2956 struct cl_io *io, struct cl_page_list *plist);
2957 void cl_page_list_fini (const struct lu_env *env, struct cl_page_list *plist);
2959 void cl_2queue_init (struct cl_2queue *queue);
2960 void cl_2queue_add (struct cl_2queue *queue, struct cl_page *page);
2961 void cl_2queue_disown (const struct lu_env *env,
2962 struct cl_io *io, struct cl_2queue *queue);
2963 void cl_2queue_assume (const struct lu_env *env,
2964 struct cl_io *io, struct cl_2queue *queue);
2965 void cl_2queue_discard (const struct lu_env *env,
2966 struct cl_io *io, struct cl_2queue *queue);
2967 void cl_2queue_fini (const struct lu_env *env, struct cl_2queue *queue);
2968 void cl_2queue_init_page(struct cl_2queue *queue, struct cl_page *page);
2970 /** @} cl_page_list */
2972 /** \defgroup cl_req cl_req
2974 struct cl_req *cl_req_alloc(const struct lu_env *env, struct cl_page *page,
2975 enum cl_req_type crt, int nr_objects);
2977 void cl_req_page_add (const struct lu_env *env, struct cl_req *req,
2978 struct cl_page *page);
2979 void cl_req_page_done (const struct lu_env *env, struct cl_page *page);
2980 int cl_req_prep (const struct lu_env *env, struct cl_req *req);
2981 void cl_req_attr_set (const struct lu_env *env, struct cl_req *req,
2982 struct cl_req_attr *attr, obd_valid flags);
2983 void cl_req_completion(const struct lu_env *env, struct cl_req *req, int ioret);
2985 /** \defgroup cl_sync_io cl_sync_io
2989 * Anchor for synchronous transfer. This is allocated on a stack by thread
2990 * doing synchronous transfer, and a pointer to this structure is set up in
2991 * every page submitted for transfer. Transfer completion routine updates
2992 * anchor and wakes up waiting thread when transfer is complete.
2995 /** number of pages yet to be transferred. */
2996 atomic_t csi_sync_nr;
2997 /** completion to be signaled when transfer is complete. */
2998 struct completion csi_sync_completion;
3003 void cl_sync_io_init(struct cl_sync_io *anchor, int nrpages);
3004 int cl_sync_io_wait(const struct lu_env *env, struct cl_io *io,
3005 struct cl_page_list *queue, struct cl_sync_io *anchor);
3006 void cl_sync_io_note(struct cl_sync_io *anchor, int ioret);
3008 /** @} cl_sync_io */
3012 /** \defgroup cl_env cl_env
3014 * lu_env handling for a client.
3016 * lu_env is an environment within which lustre code executes. Its major part
3017 * is lu_context---a fast memory allocation mechanism that is used to conserve
3018 * precious kernel stack space. Originally lu_env was designed for a server,
3021 * - there is a (mostly) fixed number of threads, and
3023 * - call chains have no non-lustre portions inserted between lustre code.
3025 * On a client both these assumtpion fails, because every user thread can
3026 * potentially execute lustre code as part of a system call, and lustre calls
3027 * into VFS or MM that call back into lustre.
3029 * To deal with that, cl_env wrapper functions implement the following
3032 * - allocation and destruction of environment is amortized by caching no
3033 * longer used environments instead of destroying them;
3035 * - there is a notion of "current" environment, attached to the kernel
3036 * data structure representing current thread (current->journal_info in
3037 * Linux kernel). Top-level lustre code allocates an environment and makes
3038 * it current, then calls into non-lustre code, that in turn calls lustre
3039 * back. Low-level lustre code thus called can fetch environment created
3040 * by the top-level code and reuse it, avoiding additional environment
3043 * \see lu_env, lu_context, lu_context_key
3046 struct cl_env_nest {
3051 struct lu_env *cl_env_peek (int *refcheck);
3052 struct lu_env *cl_env_get (int *refcheck);
3053 struct lu_env *cl_env_alloc (int *refcheck, __u32 tags);
3054 struct lu_env *cl_env_nested_get (struct cl_env_nest *nest);
3055 void cl_env_put (struct lu_env *env, int *refcheck);
3056 void cl_env_nested_put (struct cl_env_nest *nest, struct lu_env *env);
3057 void *cl_env_reenter (void);
3058 void cl_env_reexit (void *cookie);
3059 void cl_env_implant (struct lu_env *env, int *refcheck);
3060 void cl_env_unplant (struct lu_env *env, int *refcheck);
3061 unsigned cl_env_cache_purge(unsigned nr);
3068 void cl_attr2lvb(struct ost_lvb *lvb, const struct cl_attr *attr);
3069 void cl_lvb2attr(struct cl_attr *attr, const struct ost_lvb *lvb);
3071 struct cl_device *cl_type_setup(const struct lu_env *env, struct lu_site *site,
3072 struct lu_device_type *ldt,
3073 struct lu_device *next);
3076 #endif /* _LINUX_CL_OBJECT_H */