4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2011, 2013, Intel Corporation.
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
87 * See the top comment in cl_object.c for the description of overall locking and
88 * reference-counting design.
90 * See comments below for the description of i/o, page, and dlm-locking
97 * super-class definitions.
99 #include <libcfs/libcfs.h>
100 #include <lu_object.h>
101 #include <linux/mutex.h>
102 #include <linux/radix-tree.h>
107 struct cl_device_operations;
110 struct cl_object_page_operations;
111 struct cl_object_lock_operations;
114 struct cl_page_slice;
116 struct cl_lock_slice;
118 struct cl_lock_operations;
119 struct cl_page_operations;
128 * Operations for each data device in the client stack.
130 * \see vvp_cl_ops, lov_cl_ops, lovsub_cl_ops, osc_cl_ops
132 struct cl_device_operations {
134 * Initialize cl_req. This method is called top-to-bottom on all
135 * devices in the stack to get them a chance to allocate layer-private
136 * data, and to attach them to the cl_req by calling
137 * cl_req_slice_add().
139 * \see osc_req_init(), lov_req_init(), lovsub_req_init()
140 * \see ccc_req_init()
142 int (*cdo_req_init)(const struct lu_env *env, struct cl_device *dev,
147 * Device in the client stack.
149 * \see ccc_device, lov_device, lovsub_device, osc_device
153 struct lu_device cd_lu_dev;
154 /** Per-layer operation vector. */
155 const struct cl_device_operations *cd_ops;
158 /** \addtogroup cl_object cl_object
161 * "Data attributes" of cl_object. Data attributes can be updated
162 * independently for a sub-object, and top-object's attributes are calculated
163 * from sub-objects' ones.
166 /** Object size, in bytes */
169 * Known minimal size, in bytes.
171 * This is only valid when at least one DLM lock is held.
174 /** Modification time. Measured in seconds since epoch. */
176 /** Access time. Measured in seconds since epoch. */
178 /** Change time. Measured in seconds since epoch. */
181 * Blocks allocated to this cl_object on the server file system.
183 * \todo XXX An interface for block size is needed.
187 * User identifier for quota purposes.
191 * Group identifier for quota purposes.
195 /* nlink of the directory */
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;
254 /** offset of page slice in cl_page buffer */
259 * Description of the client object configuration. This is used for the
260 * creation of a new client object that is identified by a more state than
263 struct cl_object_conf {
265 struct lu_object_conf coc_lu;
268 * Object layout. This is consumed by lov.
270 struct lustre_md *coc_md;
272 * Description of particular stripe location in the
273 * cluster. This is consumed by osc.
275 struct lov_oinfo *coc_oinfo;
278 * VFS inode. This is consumed by vvp.
280 struct inode *coc_inode;
282 * Layout lock handle.
284 struct ldlm_lock *coc_lock;
286 * Operation to handle layout, OBJECT_CONF_XYZ.
292 /** configure layout, set up a new stripe, must be called while
293 * holding layout lock. */
295 /** invalidate the current stripe configuration due to losing
297 OBJECT_CONF_INVALIDATE = 1,
298 /** wait for old layout to go away so that new layout can be
304 * Operations implemented for each cl object layer.
306 * \see vvp_ops, lov_ops, lovsub_ops, osc_ops
308 struct cl_object_operations {
310 * Initialize page slice for this layer. Called top-to-bottom through
311 * every object layer when a new cl_page is instantiated. Layer
312 * keeping private per-page data, or requiring its own page operations
313 * vector should allocate these data here, and attach then to the page
314 * by calling cl_page_slice_add(). \a vmpage is locked (in the VM
317 * \retval NULL success.
319 * \retval ERR_PTR(errno) failure code.
321 * \retval valid-pointer pointer to already existing referenced page
322 * to be used instead of newly created.
324 int (*coo_page_init)(const struct lu_env *env, struct cl_object *obj,
325 struct cl_page *page, pgoff_t index);
327 * Initialize lock slice for this layer. Called top-to-bottom through
328 * every object layer when a new cl_lock is instantiated. Layer
329 * keeping private per-lock data, or requiring its own lock operations
330 * vector should allocate these data here, and attach then to the lock
331 * by calling cl_lock_slice_add(). Mandatory.
333 int (*coo_lock_init)(const struct lu_env *env,
334 struct cl_object *obj, struct cl_lock *lock,
335 const struct cl_io *io);
337 * Initialize io state for a given layer.
339 * called top-to-bottom once per io existence to initialize io
340 * state. If layer wants to keep some state for this type of io, it
341 * has to embed struct cl_io_slice in lu_env::le_ses, and register
342 * slice with cl_io_slice_add(). It is guaranteed that all threads
343 * participating in this io share the same session.
345 int (*coo_io_init)(const struct lu_env *env,
346 struct cl_object *obj, struct cl_io *io);
348 * Fill portion of \a attr that this layer controls. This method is
349 * called top-to-bottom through all object layers.
351 * \pre cl_object_header::coh_attr_guard of the top-object is locked.
353 * \return 0: to continue
354 * \return +ve: to stop iterating through layers (but 0 is returned
355 * from enclosing cl_object_attr_get())
356 * \return -ve: to signal error
358 int (*coo_attr_get)(const struct lu_env *env, struct cl_object *obj,
359 struct cl_attr *attr);
363 * \a valid is a bitmask composed from enum #cl_attr_valid, and
364 * indicating what attributes are to be set.
366 * \pre cl_object_header::coh_attr_guard of the top-object is locked.
368 * \return the same convention as for
369 * cl_object_operations::coo_attr_get() is used.
371 int (*coo_attr_set)(const struct lu_env *env, struct cl_object *obj,
372 const struct cl_attr *attr, unsigned valid);
374 * Update object configuration. Called top-to-bottom to modify object
377 * XXX error conditions and handling.
379 int (*coo_conf_set)(const struct lu_env *env, struct cl_object *obj,
380 const struct cl_object_conf *conf);
382 * Glimpse ast. Executed when glimpse ast arrives for a lock on this
383 * object. Layers are supposed to fill parts of \a lvb that will be
384 * shipped to the glimpse originator as a glimpse result.
386 * \see ccc_object_glimpse(), lovsub_object_glimpse(),
387 * \see osc_object_glimpse()
389 int (*coo_glimpse)(const struct lu_env *env,
390 const struct cl_object *obj, struct ost_lvb *lvb);
392 * Object prune method. Called when the layout is going to change on
393 * this object, therefore each layer has to clean up their cache,
394 * mainly pages and locks.
396 int (*coo_prune)(const struct lu_env *env, struct cl_object *obj);
400 * Extended header for client object.
402 struct cl_object_header {
403 /** Standard lu_object_header. cl_object::co_lu::lo_header points
405 struct lu_object_header coh_lu;
408 * Parent object. It is assumed that an object has a well-defined
409 * parent, but not a well-defined child (there may be multiple
410 * sub-objects, for the same top-object). cl_object_header::coh_parent
411 * field allows certain code to be written generically, without
412 * limiting possible cl_object layouts unduly.
414 struct cl_object_header *coh_parent;
416 * Protects consistency between cl_attr of parent object and
417 * attributes of sub-objects, that the former is calculated ("merged")
420 * \todo XXX this can be read/write lock if needed.
422 spinlock_t coh_attr_guard;
424 * Size of cl_page + page slices
426 unsigned short coh_page_bufsize;
428 * Number of objects above this one: 0 for a top-object, 1 for its
431 unsigned char coh_nesting;
435 * Helper macro: iterate over all layers of the object \a obj, assigning every
436 * layer top-to-bottom to \a slice.
438 #define cl_object_for_each(slice, obj) \
439 list_for_each_entry((slice), \
440 &(obj)->co_lu.lo_header->loh_layers,\
444 * Helper macro: iterate over all layers of the object \a obj, assigning every
445 * layer bottom-to-top to \a slice.
447 #define cl_object_for_each_reverse(slice, obj) \
448 list_for_each_entry_reverse((slice), \
449 &(obj)->co_lu.lo_header->loh_layers,\
453 #define CL_PAGE_EOF ((pgoff_t)~0ull)
455 /** \addtogroup cl_page cl_page
459 * Layered client page.
461 * cl_page: represents a portion of a file, cached in the memory. All pages
462 * of the given file are of the same size, and are kept in the radix tree
463 * hanging off the cl_object. cl_page doesn't fan out, but as sub-objects
464 * of the top-level file object are first class cl_objects, they have their
465 * own radix trees of pages and hence page is implemented as a sequence of
466 * struct cl_pages's, linked into double-linked list through
467 * cl_page::cp_parent and cl_page::cp_child pointers, each residing in the
468 * corresponding radix tree at the corresponding logical offset.
470 * cl_page is associated with VM page of the hosting environment (struct
471 * page in Linux kernel, for example), struct page. It is assumed, that this
472 * association is implemented by one of cl_page layers (top layer in the
473 * current design) that
475 * - intercepts per-VM-page call-backs made by the environment (e.g.,
478 * - translates state (page flag bits) and locking between lustre and
481 * The association between cl_page and struct page is immutable and
482 * established when cl_page is created.
484 * cl_page can be "owned" by a particular cl_io (see below), guaranteeing
485 * this io an exclusive access to this page w.r.t. other io attempts and
486 * various events changing page state (such as transfer completion, or
487 * eviction of the page from the memory). Note, that in general cl_io
488 * cannot be identified with a particular thread, and page ownership is not
489 * exactly equal to the current thread holding a lock on the page. Layer
490 * implementing association between cl_page and struct page has to implement
491 * ownership on top of available synchronization mechanisms.
493 * While lustre client maintains the notion of an page ownership by io,
494 * hosting MM/VM usually has its own page concurrency control
495 * mechanisms. For example, in Linux, page access is synchronized by the
496 * per-page PG_locked bit-lock, and generic kernel code (generic_file_*())
497 * takes care to acquire and release such locks as necessary around the
498 * calls to the file system methods (->readpage(), ->prepare_write(),
499 * ->commit_write(), etc.). This leads to the situation when there are two
500 * different ways to own a page in the client:
502 * - client code explicitly and voluntary owns the page (cl_page_own());
504 * - VM locks a page and then calls the client, that has "to assume"
505 * the ownership from the VM (cl_page_assume()).
507 * Dual methods to release ownership are cl_page_disown() and
508 * cl_page_unassume().
510 * cl_page is reference counted (cl_page::cp_ref). When reference counter
511 * drops to 0, the page is returned to the cache, unless it is in
512 * cl_page_state::CPS_FREEING state, in which case it is immediately
515 * The general logic guaranteeing the absence of "existential races" for
516 * pages is the following:
518 * - there are fixed known ways for a thread to obtain a new reference
521 * - by doing a lookup in the cl_object radix tree, protected by the
524 * - by starting from VM-locked struct page and following some
525 * hosting environment method (e.g., following ->private pointer in
526 * the case of Linux kernel), see cl_vmpage_page();
528 * - when the page enters cl_page_state::CPS_FREEING state, all these
529 * ways are severed with the proper synchronization
530 * (cl_page_delete());
532 * - entry into cl_page_state::CPS_FREEING is serialized by the VM page
535 * - no new references to the page in cl_page_state::CPS_FREEING state
536 * are allowed (checked in cl_page_get()).
538 * Together this guarantees that when last reference to a
539 * cl_page_state::CPS_FREEING page is released, it is safe to destroy the
540 * page, as neither references to it can be acquired at that point, nor
543 * cl_page is a state machine. States are enumerated in enum
544 * cl_page_state. Possible state transitions are enumerated in
545 * cl_page_state_set(). State transition process (i.e., actual changing of
546 * cl_page::cp_state field) is protected by the lock on the underlying VM
549 * Linux Kernel implementation.
551 * Binding between cl_page and struct page (which is a typedef for
552 * struct page) is implemented in the vvp layer. cl_page is attached to the
553 * ->private pointer of the struct page, together with the setting of
554 * PG_private bit in page->flags, and acquiring additional reference on the
555 * struct page (much like struct buffer_head, or any similar file system
556 * private data structures).
558 * PG_locked lock is used to implement both ownership and transfer
559 * synchronization, that is, page is VM-locked in CPS_{OWNED,PAGE{IN,OUT}}
560 * states. No additional references are acquired for the duration of the
563 * \warning *THIS IS NOT* the behavior expected by the Linux kernel, where
564 * write-out is "protected" by the special PG_writeback bit.
568 * States of cl_page. cl_page.c assumes particular order here.
570 * The page state machine is rather crude, as it doesn't recognize finer page
571 * states like "dirty" or "up to date". This is because such states are not
572 * always well defined for the whole stack (see, for example, the
573 * implementation of the read-ahead, that hides page up-to-dateness to track
574 * cache hits accurately). Such sub-states are maintained by the layers that
575 * are interested in them.
579 * Page is in the cache, un-owned. Page leaves cached state in the
582 * - [cl_page_state::CPS_OWNED] io comes across the page and
585 * - [cl_page_state::CPS_PAGEOUT] page is dirty, the
586 * req-formation engine decides that it wants to include this page
587 * into an cl_req being constructed, and yanks it from the cache;
589 * - [cl_page_state::CPS_FREEING] VM callback is executed to
590 * evict the page form the memory;
592 * \invariant cl_page::cp_owner == NULL && cl_page::cp_req == NULL
596 * Page is exclusively owned by some cl_io. Page may end up in this
597 * state as a result of
599 * - io creating new page and immediately owning it;
601 * - [cl_page_state::CPS_CACHED] io finding existing cached page
604 * - [cl_page_state::CPS_OWNED] io finding existing owned page
605 * and waiting for owner to release the page;
607 * Page leaves owned state in the following cases:
609 * - [cl_page_state::CPS_CACHED] io decides to leave the page in
610 * the cache, doing nothing;
612 * - [cl_page_state::CPS_PAGEIN] io starts read transfer for
615 * - [cl_page_state::CPS_PAGEOUT] io starts immediate write
616 * transfer for this page;
618 * - [cl_page_state::CPS_FREEING] io decides to destroy this
619 * page (e.g., as part of truncate or extent lock cancellation).
621 * \invariant cl_page::cp_owner != NULL && cl_page::cp_req == NULL
625 * Page is being written out, as a part of a transfer. This state is
626 * entered when req-formation logic decided that it wants this page to
627 * be sent through the wire _now_. Specifically, it means that once
628 * this state is achieved, transfer completion handler (with either
629 * success or failure indication) is guaranteed to be executed against
630 * this page independently of any locks and any scheduling decisions
631 * made by the hosting environment (that effectively means that the
632 * page is never put into cl_page_state::CPS_PAGEOUT state "in
633 * advance". This property is mentioned, because it is important when
634 * reasoning about possible dead-locks in the system). The page can
635 * enter this state as a result of
637 * - [cl_page_state::CPS_OWNED] an io requesting an immediate
638 * write-out of this page, or
640 * - [cl_page_state::CPS_CACHED] req-forming engine deciding
641 * that it has enough dirty pages cached to issue a "good"
644 * The page leaves cl_page_state::CPS_PAGEOUT state when the transfer
645 * is completed---it is moved into cl_page_state::CPS_CACHED state.
647 * Underlying VM page is locked for the duration of transfer.
649 * \invariant: cl_page::cp_owner == NULL && cl_page::cp_req != NULL
653 * Page is being read in, as a part of a transfer. This is quite
654 * similar to the cl_page_state::CPS_PAGEOUT state, except that
655 * read-in is always "immediate"---there is no such thing a sudden
656 * construction of read cl_req from cached, presumably not up to date,
659 * Underlying VM page is locked for the duration of transfer.
661 * \invariant: cl_page::cp_owner == NULL && cl_page::cp_req != NULL
665 * Page is being destroyed. This state is entered when client decides
666 * that page has to be deleted from its host object, as, e.g., a part
669 * Once this state is reached, there is no way to escape it.
671 * \invariant: cl_page::cp_owner == NULL && cl_page::cp_req == NULL
678 /** Host page, the page is from the host inode which the cl_page
682 /** Transient page, the transient cl_page is used to bind a cl_page
683 * to vmpage which is not belonging to the same object of cl_page.
684 * it is used in DirectIO, lockless IO and liblustre. */
689 * Fields are protected by the lock on struct page, 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 /** Transfer error. */
702 /** An object this page is a part of. Immutable after creation. */
703 struct cl_object *cp_obj;
705 struct page *cp_vmpage;
706 /** Linkage of pages within group. Pages must be owned */
707 struct list_head cp_batch;
708 /** List of slices. Immutable after creation. */
709 struct list_head cp_layers;
710 /** Linkage of pages within cl_req. */
711 struct list_head cp_flight;
713 * Page state. This field is const to avoid accidental update, it is
714 * modified only internally within cl_page.c. Protected by a VM lock.
716 const enum cl_page_state cp_state;
718 * Page type. Only CPT_TRANSIENT is used so far. Immutable after
721 enum cl_page_type cp_type;
724 * Owning IO in cl_page_state::CPS_OWNED state. Sub-page can be owned
725 * by sub-io. Protected by a VM lock.
727 struct cl_io *cp_owner;
729 * Owning IO request in cl_page_state::CPS_PAGEOUT and
730 * cl_page_state::CPS_PAGEIN states. This field is maintained only in
731 * the top-level pages. Protected by a VM lock.
733 struct cl_req *cp_req;
734 /** List of references to this page, for debugging. */
735 struct lu_ref cp_reference;
736 /** Link to an object, for debugging. */
737 struct lu_ref_link cp_obj_ref;
738 /** Link to a queue, for debugging. */
739 struct lu_ref_link cp_queue_ref;
740 /** Assigned if doing a sync_io */
741 struct cl_sync_io *cp_sync_io;
745 * Per-layer part of cl_page.
747 * \see ccc_page, lov_page, osc_page
749 struct cl_page_slice {
750 struct cl_page *cpl_page;
753 * Object slice corresponding to this page slice. Immutable after
756 struct cl_object *cpl_obj;
757 const struct cl_page_operations *cpl_ops;
758 /** Linkage into cl_page::cp_layers. Immutable after creation. */
759 struct list_head cpl_linkage;
763 * Lock mode. For the client extent locks.
775 * Requested transfer type.
785 * Per-layer page operations.
787 * Methods taking an \a io argument are for the activity happening in the
788 * context of given \a io. Page is assumed to be owned by that io, except for
789 * the obvious cases (like cl_page_operations::cpo_own()).
791 * \see vvp_page_ops, lov_page_ops, osc_page_ops
793 struct cl_page_operations {
795 * cl_page<->struct page methods. Only one layer in the stack has to
796 * implement these. Current code assumes that this functionality is
797 * provided by the topmost layer, see cl_page_disown0() as an example.
801 * Called when \a io acquires this page into the exclusive
802 * ownership. When this method returns, it is guaranteed that the is
803 * not owned by other io, and no transfer is going on against
807 * \see vvp_page_own(), lov_page_own()
809 int (*cpo_own)(const struct lu_env *env,
810 const struct cl_page_slice *slice,
811 struct cl_io *io, int nonblock);
812 /** Called when ownership it yielded. Optional.
814 * \see cl_page_disown()
815 * \see vvp_page_disown()
817 void (*cpo_disown)(const struct lu_env *env,
818 const struct cl_page_slice *slice, struct cl_io *io);
820 * Called for a page that is already "owned" by \a io from VM point of
823 * \see cl_page_assume()
824 * \see vvp_page_assume(), lov_page_assume()
826 void (*cpo_assume)(const struct lu_env *env,
827 const struct cl_page_slice *slice, struct cl_io *io);
828 /** Dual to cl_page_operations::cpo_assume(). Optional. Called
829 * bottom-to-top when IO releases a page without actually unlocking
832 * \see cl_page_unassume()
833 * \see vvp_page_unassume()
835 void (*cpo_unassume)(const struct lu_env *env,
836 const struct cl_page_slice *slice,
839 * Announces whether the page contains valid data or not by \a uptodate.
841 * \see cl_page_export()
842 * \see vvp_page_export()
844 void (*cpo_export)(const struct lu_env *env,
845 const struct cl_page_slice *slice, int uptodate);
847 * Checks whether underlying VM page is locked (in the suitable
848 * sense). Used for assertions.
850 * \retval -EBUSY: page is protected by a lock of a given mode;
851 * \retval -ENODATA: page is not protected by a lock;
852 * \retval 0: this layer cannot decide. (Should never happen.)
854 int (*cpo_is_vmlocked)(const struct lu_env *env,
855 const struct cl_page_slice *slice);
861 * Called when page is truncated from the object. Optional.
863 * \see cl_page_discard()
864 * \see vvp_page_discard(), osc_page_discard()
866 void (*cpo_discard)(const struct lu_env *env,
867 const struct cl_page_slice *slice,
870 * Called when page is removed from the cache, and is about to being
871 * destroyed. Optional.
873 * \see cl_page_delete()
874 * \see vvp_page_delete(), osc_page_delete()
876 void (*cpo_delete)(const struct lu_env *env,
877 const struct cl_page_slice *slice);
878 /** Destructor. Frees resources and slice itself. */
879 void (*cpo_fini)(const struct lu_env *env,
880 struct cl_page_slice *slice);
883 * Checks whether the page is protected by a cl_lock. This is a
884 * per-layer method, because certain layers have ways to check for the
885 * lock much more efficiently than through the generic locks scan, or
886 * implement locking mechanisms separate from cl_lock, e.g.,
887 * LL_FILE_GROUP_LOCKED in vvp. If \a pending is true, check for locks
888 * being canceled, or scheduled for cancellation as soon as the last
889 * user goes away, too.
891 * \retval -EBUSY: page is protected by a lock of a given mode;
892 * \retval -ENODATA: page is not protected by a lock;
893 * \retval 0: this layer cannot decide.
895 * \see cl_page_is_under_lock()
897 int (*cpo_is_under_lock)(const struct lu_env *env,
898 const struct cl_page_slice *slice,
899 struct cl_io *io, pgoff_t *max);
902 * Optional debugging helper. Prints given page slice.
904 * \see cl_page_print()
906 int (*cpo_print)(const struct lu_env *env,
907 const struct cl_page_slice *slice,
908 void *cookie, lu_printer_t p);
912 * Transfer methods. See comment on cl_req for a description of
913 * transfer formation and life-cycle.
918 * Request type dependent vector of operations.
920 * Transfer operations depend on transfer mode (cl_req_type). To avoid
921 * passing transfer mode to each and every of these methods, and to
922 * avoid branching on request type inside of the methods, separate
923 * methods for cl_req_type:CRT_READ and cl_req_type:CRT_WRITE are
924 * provided. That is, method invocation usually looks like
926 * slice->cp_ops.io[req->crq_type].cpo_method(env, slice, ...);
930 * Called when a page is submitted for a transfer as a part of
933 * \return 0 : page is eligible for submission;
934 * \return -EALREADY : skip this page;
935 * \return -ve : error.
937 * \see cl_page_prep()
939 int (*cpo_prep)(const struct lu_env *env,
940 const struct cl_page_slice *slice,
943 * Completion handler. This is guaranteed to be eventually
944 * fired after cl_page_operations::cpo_prep() or
945 * cl_page_operations::cpo_make_ready() call.
947 * This method can be called in a non-blocking context. It is
948 * guaranteed however, that the page involved and its object
949 * are pinned in memory (and, hence, calling cl_page_put() is
952 * \see cl_page_completion()
954 void (*cpo_completion)(const struct lu_env *env,
955 const struct cl_page_slice *slice,
958 * Called when cached page is about to be added to the
959 * cl_req as a part of req formation.
961 * \return 0 : proceed with this page;
962 * \return -EAGAIN : skip this page;
963 * \return -ve : error.
965 * \see cl_page_make_ready()
967 int (*cpo_make_ready)(const struct lu_env *env,
968 const struct cl_page_slice *slice);
971 * Tell transfer engine that only [to, from] part of a page should be
974 * This is used for immediate transfers.
976 * \todo XXX this is not very good interface. It would be much better
977 * if all transfer parameters were supplied as arguments to
978 * cl_io_operations::cio_submit() call, but it is not clear how to do
979 * this for page queues.
981 * \see cl_page_clip()
983 void (*cpo_clip)(const struct lu_env *env,
984 const struct cl_page_slice *slice,
987 * \pre the page was queued for transferring.
988 * \post page is removed from client's pending list, or -EBUSY
989 * is returned if it has already been in transferring.
991 * This is one of seldom page operation which is:
992 * 0. called from top level;
993 * 1. don't have vmpage locked;
994 * 2. every layer should synchronize execution of its ->cpo_cancel()
995 * with completion handlers. Osc uses client obd lock for this
996 * purpose. Based on there is no vvp_page_cancel and
997 * lov_page_cancel(), cpo_cancel is defacto protected by client lock.
999 * \see osc_page_cancel().
1001 int (*cpo_cancel)(const struct lu_env *env,
1002 const struct cl_page_slice *slice);
1004 * Write out a page by kernel. This is only called by ll_writepage
1007 * \see cl_page_flush()
1009 int (*cpo_flush)(const struct lu_env *env,
1010 const struct cl_page_slice *slice,
1016 * Helper macro, dumping detailed information about \a page into a log.
1018 #define CL_PAGE_DEBUG(mask, env, page, format, ...) \
1020 if (cfs_cdebug_show(mask, DEBUG_SUBSYSTEM)) { \
1021 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, mask, NULL); \
1022 cl_page_print(env, &msgdata, lu_cdebug_printer, page); \
1023 CDEBUG(mask, format , ## __VA_ARGS__); \
1028 * Helper macro, dumping shorter information about \a page into a log.
1030 #define CL_PAGE_HEADER(mask, env, page, format, ...) \
1032 if (cfs_cdebug_show(mask, DEBUG_SUBSYSTEM)) { \
1033 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, mask, NULL); \
1034 cl_page_header_print(env, &msgdata, lu_cdebug_printer, page); \
1035 CDEBUG(mask, format , ## __VA_ARGS__); \
1039 static inline struct page *cl_page_vmpage(const struct cl_page *page)
1041 LASSERT(page->cp_vmpage != NULL);
1042 return page->cp_vmpage;
1046 * Check if a cl_page is in use.
1048 * Client cache holds a refcount, this refcount will be dropped when
1049 * the page is taken out of cache, see vvp_page_delete().
1051 static inline bool __page_in_use(const struct cl_page *page, int refc)
1053 return (atomic_read(&page->cp_ref) > refc + 1);
1057 * Caller itself holds a refcount of cl_page.
1059 #define cl_page_in_use(pg) __page_in_use(pg, 1)
1061 * Caller doesn't hold a refcount.
1063 #define cl_page_in_use_noref(pg) __page_in_use(pg, 0)
1067 /** \addtogroup cl_lock cl_lock
1071 * Extent locking on the client.
1075 * The locking model of the new client code is built around
1079 * data-type representing an extent lock on a regular file. cl_lock is a
1080 * layered object (much like cl_object and cl_page), it consists of a header
1081 * (struct cl_lock) and a list of layers (struct cl_lock_slice), linked to
1082 * cl_lock::cll_layers list through cl_lock_slice::cls_linkage.
1084 * Typical cl_lock consists of the two layers:
1086 * - vvp_lock (vvp specific data), and
1087 * - lov_lock (lov specific data).
1089 * lov_lock contains an array of sub-locks. Each of these sub-locks is a
1090 * normal cl_lock: it has a header (struct cl_lock) and a list of layers:
1092 * - lovsub_lock, and
1095 * Each sub-lock is associated with a cl_object (representing stripe
1096 * sub-object or the file to which top-level cl_lock is associated to), and is
1097 * linked into that cl_object::coh_locks. In this respect cl_lock is similar to
1098 * cl_object (that at lov layer also fans out into multiple sub-objects), and
1099 * is different from cl_page, that doesn't fan out (there is usually exactly
1100 * one osc_page for every vvp_page). We shall call vvp-lov portion of the lock
1101 * a "top-lock" and its lovsub-osc portion a "sub-lock".
1105 * cl_lock is reference counted. When reference counter drops to 0, lock is
1106 * placed in the cache, except when lock is in CLS_FREEING state. CLS_FREEING
1107 * lock is destroyed when last reference is released. Referencing between
1108 * top-lock and its sub-locks is described in the lov documentation module.
1112 * Also, cl_lock is a state machine. This requires some clarification. One of
1113 * the goals of client IO re-write was to make IO path non-blocking, or at
1114 * least to make it easier to make it non-blocking in the future. Here
1115 * `non-blocking' means that when a system call (read, write, truncate)
1116 * reaches a situation where it has to wait for a communication with the
1117 * server, it should --instead of waiting-- remember its current state and
1118 * switch to some other work. E.g,. instead of waiting for a lock enqueue,
1119 * client should proceed doing IO on the next stripe, etc. Obviously this is
1120 * rather radical redesign, and it is not planned to be fully implemented at
1121 * this time, instead we are putting some infrastructure in place, that would
1122 * make it easier to do asynchronous non-blocking IO easier in the
1123 * future. Specifically, where old locking code goes to sleep (waiting for
1124 * enqueue, for example), new code returns cl_lock_transition::CLO_WAIT. When
1125 * enqueue reply comes, its completion handler signals that lock state-machine
1126 * is ready to transit to the next state. There is some generic code in
1127 * cl_lock.c that sleeps, waiting for these signals. As a result, for users of
1128 * this cl_lock.c code, it looks like locking is done in normal blocking
1129 * fashion, and it the same time it is possible to switch to the non-blocking
1130 * locking (simply by returning cl_lock_transition::CLO_WAIT from cl_lock.c
1133 * For a description of state machine states and transitions see enum
1136 * There are two ways to restrict a set of states which lock might move to:
1138 * - placing a "hold" on a lock guarantees that lock will not be moved
1139 * into cl_lock_state::CLS_FREEING state until hold is released. Hold
1140 * can be only acquired on a lock that is not in
1141 * cl_lock_state::CLS_FREEING. All holds on a lock are counted in
1142 * cl_lock::cll_holds. Hold protects lock from cancellation and
1143 * destruction. Requests to cancel and destroy a lock on hold will be
1144 * recorded, but only honored when last hold on a lock is released;
1146 * - placing a "user" on a lock guarantees that lock will not leave
1147 * cl_lock_state::CLS_NEW, cl_lock_state::CLS_QUEUING,
1148 * cl_lock_state::CLS_ENQUEUED and cl_lock_state::CLS_HELD set of
1149 * states, once it enters this set. That is, if a user is added onto a
1150 * lock in a state not from this set, it doesn't immediately enforce
1151 * lock to move to this set, but once lock enters this set it will
1152 * remain there until all users are removed. Lock users are counted in
1153 * cl_lock::cll_users.
1155 * User is used to assure that lock is not canceled or destroyed while
1156 * it is being enqueued, or actively used by some IO.
1158 * Currently, a user always comes with a hold (cl_lock_invariant()
1159 * checks that a number of holds is not less than a number of users).
1163 * This is how lock state-machine operates. struct cl_lock contains a mutex
1164 * cl_lock::cll_guard that protects struct fields.
1166 * - mutex is taken, and cl_lock::cll_state is examined.
1168 * - for every state there are possible target states where lock can move
1169 * into. They are tried in order. Attempts to move into next state are
1170 * done by _try() functions in cl_lock.c:cl_{enqueue,unlock,wait}_try().
1172 * - if the transition can be performed immediately, state is changed,
1173 * and mutex is released.
1175 * - if the transition requires blocking, _try() function returns
1176 * cl_lock_transition::CLO_WAIT. Caller unlocks mutex and goes to
1177 * sleep, waiting for possibility of lock state change. It is woken
1178 * up when some event occurs, that makes lock state change possible
1179 * (e.g., the reception of the reply from the server), and repeats
1182 * Top-lock and sub-lock has separate mutexes and the latter has to be taken
1183 * first to avoid dead-lock.
1185 * To see an example of interaction of all these issues, take a look at the
1186 * lov_cl.c:lov_lock_enqueue() function. It is called as a part of
1187 * cl_enqueue_try(), and tries to advance top-lock to ENQUEUED state, by
1188 * advancing state-machines of its sub-locks (lov_lock_enqueue_one()). Note
1189 * also, that it uses trylock to grab sub-lock mutex to avoid dead-lock. It
1190 * also has to handle CEF_ASYNC enqueue, when sub-locks enqueues have to be
1191 * done in parallel, rather than one after another (this is used for glimpse
1192 * locks, that cannot dead-lock).
1194 * INTERFACE AND USAGE
1196 * struct cl_lock_operations provide a number of call-backs that are invoked
1197 * when events of interest occurs. Layers can intercept and handle glimpse,
1198 * blocking, cancel ASTs and a reception of the reply from the server.
1200 * One important difference with the old client locking model is that new
1201 * client has a representation for the top-lock, whereas in the old code only
1202 * sub-locks existed as real data structures and file-level locks are
1203 * represented by "request sets" that are created and destroyed on each and
1204 * every lock creation.
1206 * Top-locks are cached, and can be found in the cache by the system calls. It
1207 * is possible that top-lock is in cache, but some of its sub-locks were
1208 * canceled and destroyed. In that case top-lock has to be enqueued again
1209 * before it can be used.
1211 * Overall process of the locking during IO operation is as following:
1213 * - once parameters for IO are setup in cl_io, cl_io_operations::cio_lock()
1214 * is called on each layer. Responsibility of this method is to add locks,
1215 * needed by a given layer into cl_io.ci_lockset.
1217 * - once locks for all layers were collected, they are sorted to avoid
1218 * dead-locks (cl_io_locks_sort()), and enqueued.
1220 * - when all locks are acquired, IO is performed;
1222 * - locks are released into cache.
1224 * Striping introduces major additional complexity into locking. The
1225 * fundamental problem is that it is generally unsafe to actively use (hold)
1226 * two locks on the different OST servers at the same time, as this introduces
1227 * inter-server dependency and can lead to cascading evictions.
1229 * Basic solution is to sub-divide large read/write IOs into smaller pieces so
1230 * that no multi-stripe locks are taken (note that this design abandons POSIX
1231 * read/write semantics). Such pieces ideally can be executed concurrently. At
1232 * the same time, certain types of IO cannot be sub-divived, without
1233 * sacrificing correctness. This includes:
1235 * - O_APPEND write, where [0, EOF] lock has to be taken, to guarantee
1238 * - ftruncate(fd, offset), where [offset, EOF] lock has to be taken.
1240 * Also, in the case of read(fd, buf, count) or write(fd, buf, count), where
1241 * buf is a part of memory mapped Lustre file, a lock or locks protecting buf
1242 * has to be held together with the usual lock on [offset, offset + count].
1244 * As multi-stripe locks have to be allowed, it makes sense to cache them, so
1245 * that, for example, a sequence of O_APPEND writes can proceed quickly
1246 * without going down to the individual stripes to do lock matching. On the
1247 * other hand, multi-stripe locks shouldn't be used by normal read/write
1248 * calls. To achieve this, every layer can implement ->clo_fits_into() method,
1249 * that is called by lock matching code (cl_lock_lookup()), and that can be
1250 * used to selectively disable matching of certain locks for certain IOs. For
1251 * exmaple, lov layer implements lov_lock_fits_into() that allow multi-stripe
1252 * locks to be matched only for truncates and O_APPEND writes.
1254 * Interaction with DLM
1256 * In the expected setup, cl_lock is ultimately backed up by a collection of
1257 * DLM locks (struct ldlm_lock). Association between cl_lock and DLM lock is
1258 * implemented in osc layer, that also matches DLM events (ASTs, cancellation,
1259 * etc.) into cl_lock_operation calls. See struct osc_lock for a more detailed
1260 * description of interaction with DLM.
1266 struct cl_lock_descr {
1267 /** Object this lock is granted for. */
1268 struct cl_object *cld_obj;
1269 /** Index of the first page protected by this lock. */
1271 /** Index of the last page (inclusive) protected by this lock. */
1273 /** Group ID, for group lock */
1276 enum cl_lock_mode cld_mode;
1278 * flags to enqueue lock. A combination of bit-flags from
1279 * enum cl_enq_flags.
1281 __u32 cld_enq_flags;
1284 #define DDESCR "%s(%d):[%lu, %lu]:%x"
1285 #define PDESCR(descr) \
1286 cl_lock_mode_name((descr)->cld_mode), (descr)->cld_mode, \
1287 (descr)->cld_start, (descr)->cld_end, (descr)->cld_enq_flags
1289 const char *cl_lock_mode_name(const enum cl_lock_mode mode);
1292 * Layered client lock.
1295 /** List of slices. Immutable after creation. */
1296 struct list_head cll_layers;
1297 /** lock attribute, extent, cl_object, etc. */
1298 struct cl_lock_descr cll_descr;
1302 * Per-layer part of cl_lock
1304 * \see ccc_lock, lov_lock, lovsub_lock, osc_lock
1306 struct cl_lock_slice {
1307 struct cl_lock *cls_lock;
1308 /** Object slice corresponding to this lock slice. Immutable after
1310 struct cl_object *cls_obj;
1311 const struct cl_lock_operations *cls_ops;
1312 /** Linkage into cl_lock::cll_layers. Immutable after creation. */
1313 struct list_head cls_linkage;
1318 * \see vvp_lock_ops, lov_lock_ops, lovsub_lock_ops, osc_lock_ops
1320 struct cl_lock_operations {
1323 * Attempts to enqueue the lock. Called top-to-bottom.
1325 * \retval 0 this layer has enqueued the lock successfully
1326 * \retval >0 this layer has enqueued the lock, but need to wait on
1327 * @anchor for resources
1328 * \retval -ve failure
1330 * \see ccc_lock_enqueue(), lov_lock_enqueue(), lovsub_lock_enqueue(),
1331 * \see osc_lock_enqueue()
1333 int (*clo_enqueue)(const struct lu_env *env,
1334 const struct cl_lock_slice *slice,
1335 struct cl_io *io, struct cl_sync_io *anchor);
1337 * Cancel a lock, release its DLM lock ref, while does not cancel the
1340 void (*clo_cancel)(const struct lu_env *env,
1341 const struct cl_lock_slice *slice);
1344 * Destructor. Frees resources and the slice.
1346 * \see ccc_lock_fini(), lov_lock_fini(), lovsub_lock_fini(),
1347 * \see osc_lock_fini()
1349 void (*clo_fini)(const struct lu_env *env, struct cl_lock_slice *slice);
1351 * Optional debugging helper. Prints given lock slice.
1353 int (*clo_print)(const struct lu_env *env,
1354 void *cookie, lu_printer_t p,
1355 const struct cl_lock_slice *slice);
1358 #define CL_LOCK_DEBUG(mask, env, lock, format, ...) \
1360 if (cfs_cdebug_show(mask, DEBUG_SUBSYSTEM)) { \
1361 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, mask, NULL); \
1362 cl_lock_print(env, &msgdata, lu_cdebug_printer, lock); \
1363 CDEBUG(mask, format , ## __VA_ARGS__); \
1367 #define CL_LOCK_ASSERT(expr, env, lock) do { \
1371 CL_LOCK_DEBUG(D_ERROR, env, lock, "failed at %s.\n", #expr); \
1377 /** \addtogroup cl_page_list cl_page_list
1378 * Page list used to perform collective operations on a group of pages.
1380 * Pages are added to the list one by one. cl_page_list acquires a reference
1381 * for every page in it. Page list is used to perform collective operations on
1384 * - submit pages for an immediate transfer,
1386 * - own pages on behalf of certain io (waiting for each page in turn),
1390 * When list is finalized, it releases references on all pages it still has.
1392 * \todo XXX concurrency control.
1396 struct cl_page_list {
1398 struct list_head pl_pages;
1399 struct task_struct *pl_owner;
1403 * A 2-queue of pages. A convenience data-type for common use case, 2-queue
1404 * contains an incoming page list and an outgoing page list.
1407 struct cl_page_list c2_qin;
1408 struct cl_page_list c2_qout;
1411 /** @} cl_page_list */
1413 /** \addtogroup cl_io cl_io
1418 * cl_io represents a high level I/O activity like
1419 * read(2)/write(2)/truncate(2) system call, or cancellation of an extent
1422 * cl_io is a layered object, much like cl_{object,page,lock} but with one
1423 * important distinction. We want to minimize number of calls to the allocator
1424 * in the fast path, e.g., in the case of read(2) when everything is cached:
1425 * client already owns the lock over region being read, and data are cached
1426 * due to read-ahead. To avoid allocation of cl_io layers in such situations,
1427 * per-layer io state is stored in the session, associated with the io, see
1428 * struct {vvp,lov,osc}_io for example. Sessions allocation is amortized
1429 * by using free-lists, see cl_env_get().
1431 * There is a small predefined number of possible io types, enumerated in enum
1434 * cl_io is a state machine, that can be advanced concurrently by the multiple
1435 * threads. It is up to these threads to control the concurrency and,
1436 * specifically, to detect when io is done, and its state can be safely
1439 * For read/write io overall execution plan is as following:
1441 * (0) initialize io state through all layers;
1443 * (1) loop: prepare chunk of work to do
1445 * (2) call all layers to collect locks they need to process current chunk
1447 * (3) sort all locks to avoid dead-locks, and acquire them
1449 * (4) process the chunk: call per-page methods
1450 * (cl_io_operations::cio_read_page() for read,
1451 * cl_io_operations::cio_prepare_write(),
1452 * cl_io_operations::cio_commit_write() for write)
1458 * To implement the "parallel IO mode", lov layer creates sub-io's (lazily to
1459 * address allocation efficiency issues mentioned above), and returns with the
1460 * special error condition from per-page method when current sub-io has to
1461 * block. This causes io loop to be repeated, and lov switches to the next
1462 * sub-io in its cl_io_operations::cio_iter_init() implementation.
1467 /** read system call */
1469 /** write system call */
1471 /** truncate, utime system calls */
1474 * page fault handling
1478 * fsync system call handling
1479 * To write out a range of file
1483 * Miscellaneous io. This is used for occasional io activity that
1484 * doesn't fit into other types. Currently this is used for:
1486 * - cancellation of an extent lock. This io exists as a context
1487 * to write dirty pages from under the lock being canceled back
1490 * - VM induced page write-out. An io context for writing page out
1491 * for memory cleansing;
1493 * - glimpse. An io context to acquire glimpse lock.
1495 * - grouplock. An io context to acquire group lock.
1497 * CIT_MISC io is used simply as a context in which locks and pages
1498 * are manipulated. Such io has no internal "process", that is,
1499 * cl_io_loop() is never called for it.
1506 * States of cl_io state machine
1509 /** Not initialized. */
1513 /** IO iteration started. */
1517 /** Actual IO is in progress. */
1519 /** IO for the current iteration finished. */
1521 /** Locks released. */
1523 /** Iteration completed. */
1525 /** cl_io finalized. */
1530 * IO state private for a layer.
1532 * This is usually embedded into layer session data, rather than allocated
1535 * \see vvp_io, lov_io, osc_io, ccc_io
1537 struct cl_io_slice {
1538 struct cl_io *cis_io;
1539 /** corresponding object slice. Immutable after creation. */
1540 struct cl_object *cis_obj;
1541 /** io operations. Immutable after creation. */
1542 const struct cl_io_operations *cis_iop;
1544 * linkage into a list of all slices for a given cl_io, hanging off
1545 * cl_io::ci_layers. Immutable after creation.
1547 struct list_head cis_linkage;
1550 typedef void (*cl_commit_cbt)(const struct lu_env *, struct cl_io *,
1554 * Per-layer io operations.
1555 * \see vvp_io_ops, lov_io_ops, lovsub_io_ops, osc_io_ops
1557 struct cl_io_operations {
1559 * Vector of io state transition methods for every io type.
1561 * \see cl_page_operations::io
1565 * Prepare io iteration at a given layer.
1567 * Called top-to-bottom at the beginning of each iteration of
1568 * "io loop" (if it makes sense for this type of io). Here
1569 * layer selects what work it will do during this iteration.
1571 * \see cl_io_operations::cio_iter_fini()
1573 int (*cio_iter_init) (const struct lu_env *env,
1574 const struct cl_io_slice *slice);
1576 * Finalize io iteration.
1578 * Called bottom-to-top at the end of each iteration of "io
1579 * loop". Here layers can decide whether IO has to be
1582 * \see cl_io_operations::cio_iter_init()
1584 void (*cio_iter_fini) (const struct lu_env *env,
1585 const struct cl_io_slice *slice);
1587 * Collect locks for the current iteration of io.
1589 * Called top-to-bottom to collect all locks necessary for
1590 * this iteration. This methods shouldn't actually enqueue
1591 * anything, instead it should post a lock through
1592 * cl_io_lock_add(). Once all locks are collected, they are
1593 * sorted and enqueued in the proper order.
1595 int (*cio_lock) (const struct lu_env *env,
1596 const struct cl_io_slice *slice);
1598 * Finalize unlocking.
1600 * Called bottom-to-top to finish layer specific unlocking
1601 * functionality, after generic code released all locks
1602 * acquired by cl_io_operations::cio_lock().
1604 void (*cio_unlock)(const struct lu_env *env,
1605 const struct cl_io_slice *slice);
1607 * Start io iteration.
1609 * Once all locks are acquired, called top-to-bottom to
1610 * commence actual IO. In the current implementation,
1611 * top-level vvp_io_{read,write}_start() does all the work
1612 * synchronously by calling generic_file_*(), so other layers
1613 * are called when everything is done.
1615 int (*cio_start)(const struct lu_env *env,
1616 const struct cl_io_slice *slice);
1618 * Called top-to-bottom at the end of io loop. Here layer
1619 * might wait for an unfinished asynchronous io.
1621 void (*cio_end) (const struct lu_env *env,
1622 const struct cl_io_slice *slice);
1624 * Called bottom-to-top to notify layers that read/write IO
1625 * iteration finished, with \a nob bytes transferred.
1627 void (*cio_advance)(const struct lu_env *env,
1628 const struct cl_io_slice *slice,
1631 * Called once per io, bottom-to-top to release io resources.
1633 void (*cio_fini) (const struct lu_env *env,
1634 const struct cl_io_slice *slice);
1638 * Submit pages from \a queue->c2_qin for IO, and move
1639 * successfully submitted pages into \a queue->c2_qout. Return
1640 * non-zero if failed to submit even the single page. If
1641 * submission failed after some pages were moved into \a
1642 * queue->c2_qout, completion callback with non-zero ioret is
1645 int (*cio_submit)(const struct lu_env *env,
1646 const struct cl_io_slice *slice,
1647 enum cl_req_type crt,
1648 struct cl_2queue *queue);
1650 * Queue async page for write.
1651 * The difference between cio_submit and cio_queue is that
1652 * cio_submit is for urgent request.
1654 int (*cio_commit_async)(const struct lu_env *env,
1655 const struct cl_io_slice *slice,
1656 struct cl_page_list *queue, int from, int to,
1659 * Read missing page.
1661 * Called by a top-level cl_io_operations::op[CIT_READ]::cio_start()
1662 * method, when it hits not-up-to-date page in the range. Optional.
1664 * \pre io->ci_type == CIT_READ
1666 int (*cio_read_page)(const struct lu_env *env,
1667 const struct cl_io_slice *slice,
1668 const struct cl_page_slice *page);
1670 * Optional debugging helper. Print given io slice.
1672 int (*cio_print)(const struct lu_env *env, void *cookie,
1673 lu_printer_t p, const struct cl_io_slice *slice);
1677 * Flags to lock enqueue procedure.
1682 * instruct server to not block, if conflicting lock is found. Instead
1683 * -EWOULDBLOCK is returned immediately.
1685 CEF_NONBLOCK = 0x00000001,
1687 * take lock asynchronously (out of order), as it cannot
1688 * deadlock. This is for LDLM_FL_HAS_INTENT locks used for glimpsing.
1690 CEF_ASYNC = 0x00000002,
1692 * tell the server to instruct (though a flag in the blocking ast) an
1693 * owner of the conflicting lock, that it can drop dirty pages
1694 * protected by this lock, without sending them to the server.
1696 CEF_DISCARD_DATA = 0x00000004,
1698 * tell the sub layers that it must be a `real' lock. This is used for
1699 * mmapped-buffer locks and glimpse locks that must be never converted
1700 * into lockless mode.
1702 * \see vvp_mmap_locks(), cl_glimpse_lock().
1704 CEF_MUST = 0x00000008,
1706 * tell the sub layers that never request a `real' lock. This flag is
1707 * not used currently.
1709 * cl_io::ci_lockreq and CEF_{MUST,NEVER} flags specify lockless
1710 * conversion policy: ci_lockreq describes generic information of lock
1711 * requirement for this IO, especially for locks which belong to the
1712 * object doing IO; however, lock itself may have precise requirements
1713 * that are described by the enqueue flags.
1715 CEF_NEVER = 0x00000010,
1717 * for async glimpse lock.
1719 CEF_AGL = 0x00000020,
1721 * enqueue a lock to test DLM lock existence.
1723 CEF_PEEK = 0x00000040,
1725 * mask of enq_flags.
1727 CEF_MASK = 0x0000007f,
1731 * Link between lock and io. Intermediate structure is needed, because the
1732 * same lock can be part of multiple io's simultaneously.
1734 struct cl_io_lock_link {
1735 /** linkage into one of cl_lockset lists. */
1736 struct list_head cill_linkage;
1737 struct cl_lock cill_lock;
1738 /** optional destructor */
1739 void (*cill_fini)(const struct lu_env *env,
1740 struct cl_io_lock_link *link);
1742 #define cill_descr cill_lock.cll_descr
1745 * Lock-set represents a collection of locks, that io needs at a
1746 * time. Generally speaking, client tries to avoid holding multiple locks when
1749 * - holding extent locks over multiple ost's introduces the danger of
1750 * "cascading timeouts";
1752 * - holding multiple locks over the same ost is still dead-lock prone,
1753 * see comment in osc_lock_enqueue(),
1755 * but there are certain situations where this is unavoidable:
1757 * - O_APPEND writes have to take [0, EOF] lock for correctness;
1759 * - truncate has to take [new-size, EOF] lock for correctness;
1761 * - SNS has to take locks across full stripe for correctness;
1763 * - in the case when user level buffer, supplied to {read,write}(file0),
1764 * is a part of a memory mapped lustre file, client has to take a dlm
1765 * locks on file0, and all files that back up the buffer (or a part of
1766 * the buffer, that is being processed in the current chunk, in any
1767 * case, there are situations where at least 2 locks are necessary).
1769 * In such cases we at least try to take locks in the same consistent
1770 * order. To this end, all locks are first collected, then sorted, and then
1774 /** locks to be acquired. */
1775 struct list_head cls_todo;
1776 /** locks acquired. */
1777 struct list_head cls_done;
1781 * Lock requirements(demand) for IO. It should be cl_io_lock_req,
1782 * but 'req' is always to be thought as 'request' :-)
1784 enum cl_io_lock_dmd {
1785 /** Always lock data (e.g., O_APPEND). */
1787 /** Layers are free to decide between local and global locking. */
1789 /** Never lock: there is no cache (e.g., liblustre). */
1793 enum cl_fsync_mode {
1794 /** start writeback, do not wait for them to finish */
1796 /** start writeback and wait for them to finish */
1798 /** discard all of dirty pages in a specific file range */
1799 CL_FSYNC_DISCARD = 2,
1800 /** start writeback and make sure they have reached storage before
1801 * return. OST_SYNC RPC must be issued and finished */
1805 struct cl_io_rw_common {
1815 * cl_io is shared by all threads participating in this IO (in current
1816 * implementation only one thread advances IO, but parallel IO design and
1817 * concurrent copy_*_user() require multiple threads acting on the same IO. It
1818 * is up to these threads to serialize their activities, including updates to
1819 * mutable cl_io fields.
1822 /** type of this IO. Immutable after creation. */
1823 enum cl_io_type ci_type;
1824 /** current state of cl_io state machine. */
1825 enum cl_io_state ci_state;
1826 /** main object this io is against. Immutable after creation. */
1827 struct cl_object *ci_obj;
1829 * Upper layer io, of which this io is a part of. Immutable after
1832 struct cl_io *ci_parent;
1833 /** List of slices. Immutable after creation. */
1834 struct list_head ci_layers;
1835 /** list of locks (to be) acquired by this io. */
1836 struct cl_lockset ci_lockset;
1837 /** lock requirements, this is just a help info for sublayers. */
1838 enum cl_io_lock_dmd ci_lockreq;
1841 struct cl_io_rw_common rd;
1844 struct cl_io_rw_common wr;
1848 struct cl_io_rw_common ci_rw;
1849 struct cl_setattr_io {
1850 struct ost_lvb sa_attr;
1851 unsigned int sa_valid;
1852 struct obd_capa *sa_capa;
1854 struct cl_fault_io {
1855 /** page index within file. */
1857 /** bytes valid byte on a faulted page. */
1859 /** writable page? for nopage() only */
1861 /** page of an executable? */
1863 /** page_mkwrite() */
1865 /** resulting page */
1866 struct cl_page *ft_page;
1868 struct cl_fsync_io {
1871 struct obd_capa *fi_capa;
1872 /** file system level fid */
1873 struct lu_fid *fi_fid;
1874 enum cl_fsync_mode fi_mode;
1875 /* how many pages were written/discarded */
1876 unsigned int fi_nr_written;
1879 struct cl_2queue ci_queue;
1882 unsigned int ci_continue:1,
1884 * This io has held grouplock, to inform sublayers that
1885 * don't do lockless i/o.
1889 * The whole IO need to be restarted because layout has been changed
1893 * to not refresh layout - the IO issuer knows that the layout won't
1894 * change(page operations, layout change causes all page to be
1895 * discarded), or it doesn't matter if it changes(sync).
1899 * Check if layout changed after the IO finishes. Mainly for HSM
1900 * requirement. If IO occurs to openning files, it doesn't need to
1901 * verify layout because HSM won't release openning files.
1902 * Right now, only two opertaions need to verify layout: glimpse
1907 * file is released, restore has to to be triggered by vvp layer
1909 ci_restore_needed:1,
1915 * Number of pages owned by this IO. For invariant checking.
1917 unsigned ci_owned_nr;
1922 /** \addtogroup cl_req cl_req
1927 * There are two possible modes of transfer initiation on the client:
1929 * - immediate transfer: this is started when a high level io wants a page
1930 * or a collection of pages to be transferred right away. Examples:
1931 * read-ahead, synchronous read in the case of non-page aligned write,
1932 * page write-out as a part of extent lock cancellation, page write-out
1933 * as a part of memory cleansing. Immediate transfer can be both
1934 * cl_req_type::CRT_READ and cl_req_type::CRT_WRITE;
1936 * - opportunistic transfer (cl_req_type::CRT_WRITE only), that happens
1937 * when io wants to transfer a page to the server some time later, when
1938 * it can be done efficiently. Example: pages dirtied by the write(2)
1941 * In any case, transfer takes place in the form of a cl_req, which is a
1942 * representation for a network RPC.
1944 * Pages queued for an opportunistic transfer are cached until it is decided
1945 * that efficient RPC can be composed of them. This decision is made by "a
1946 * req-formation engine", currently implemented as a part of osc
1947 * layer. Req-formation depends on many factors: the size of the resulting
1948 * RPC, whether or not multi-object RPCs are supported by the server,
1949 * max-rpc-in-flight limitations, size of the dirty cache, etc.
1951 * For the immediate transfer io submits a cl_page_list, that req-formation
1952 * engine slices into cl_req's, possibly adding cached pages to some of
1953 * the resulting req's.
1955 * Whenever a page from cl_page_list is added to a newly constructed req, its
1956 * cl_page_operations::cpo_prep() layer methods are called. At that moment,
1957 * page state is atomically changed from cl_page_state::CPS_OWNED to
1958 * cl_page_state::CPS_PAGEOUT or cl_page_state::CPS_PAGEIN, cl_page::cp_owner
1959 * is zeroed, and cl_page::cp_req is set to the
1960 * req. cl_page_operations::cpo_prep() method at the particular layer might
1961 * return -EALREADY to indicate that it does not need to submit this page
1962 * at all. This is possible, for example, if page, submitted for read,
1963 * became up-to-date in the meantime; and for write, the page don't have
1964 * dirty bit marked. \see cl_io_submit_rw()
1966 * Whenever a cached page is added to a newly constructed req, its
1967 * cl_page_operations::cpo_make_ready() layer methods are called. At that
1968 * moment, page state is atomically changed from cl_page_state::CPS_CACHED to
1969 * cl_page_state::CPS_PAGEOUT, and cl_page::cp_req is set to
1970 * req. cl_page_operations::cpo_make_ready() method at the particular layer
1971 * might return -EAGAIN to indicate that this page is not eligible for the
1972 * transfer right now.
1976 * Plan is to divide transfers into "priority bands" (indicated when
1977 * submitting cl_page_list, and queuing a page for the opportunistic transfer)
1978 * and allow glueing of cached pages to immediate transfers only within single
1979 * band. This would make high priority transfers (like lock cancellation or
1980 * memory pressure induced write-out) really high priority.
1985 * Per-transfer attributes.
1987 struct cl_req_attr {
1988 /** Generic attributes for the server consumption. */
1989 struct obdo *cra_oa;
1991 struct obd_capa *cra_capa;
1993 char cra_jobid[LUSTRE_JOBID_SIZE];
1997 * Transfer request operations definable at every layer.
1999 * Concurrency: transfer formation engine synchronizes calls to all transfer
2002 struct cl_req_operations {
2004 * Invoked top-to-bottom by cl_req_prep() when transfer formation is
2005 * complete (all pages are added).
2007 * \see osc_req_prep()
2009 int (*cro_prep)(const struct lu_env *env,
2010 const struct cl_req_slice *slice);
2012 * Called top-to-bottom to fill in \a oa fields. This is called twice
2013 * with different flags, see bug 10150 and osc_build_req().
2015 * \param obj an object from cl_req which attributes are to be set in
2018 * \param oa struct obdo where attributes are placed
2020 * \param flags \a oa fields to be filled.
2022 void (*cro_attr_set)(const struct lu_env *env,
2023 const struct cl_req_slice *slice,
2024 const struct cl_object *obj,
2025 struct cl_req_attr *attr, obd_valid flags);
2027 * Called top-to-bottom from cl_req_completion() to notify layers that
2028 * transfer completed. Has to free all state allocated by
2029 * cl_device_operations::cdo_req_init().
2031 void (*cro_completion)(const struct lu_env *env,
2032 const struct cl_req_slice *slice, int ioret);
2036 * A per-object state that (potentially multi-object) transfer request keeps.
2039 /** object itself */
2040 struct cl_object *ro_obj;
2041 /** reference to cl_req_obj::ro_obj. For debugging. */
2042 struct lu_ref_link ro_obj_ref;
2043 /* something else? Number of pages for a given object? */
2049 * Transfer requests are not reference counted, because IO sub-system owns
2050 * them exclusively and knows when to free them.
2054 * cl_req is created by cl_req_alloc() that calls
2055 * cl_device_operations::cdo_req_init() device methods to allocate per-req
2056 * state in every layer.
2058 * Then pages are added (cl_req_page_add()), req keeps track of all objects it
2059 * contains pages for.
2061 * Once all pages were collected, cl_page_operations::cpo_prep() method is
2062 * called top-to-bottom. At that point layers can modify req, let it pass, or
2063 * deny it completely. This is to support things like SNS that have transfer
2064 * ordering requirements invisible to the individual req-formation engine.
2066 * On transfer completion (or transfer timeout, or failure to initiate the
2067 * transfer of an allocated req), cl_req_operations::cro_completion() method
2068 * is called, after execution of cl_page_operations::cpo_completion() of all
2072 enum cl_req_type crq_type;
2073 /** A list of pages being transfered */
2074 struct list_head crq_pages;
2075 /** Number of pages in cl_req::crq_pages */
2076 unsigned crq_nrpages;
2077 /** An array of objects which pages are in ->crq_pages */
2078 struct cl_req_obj *crq_o;
2079 /** Number of elements in cl_req::crq_objs[] */
2080 unsigned crq_nrobjs;
2081 struct list_head crq_layers;
2085 * Per-layer state for request.
2087 struct cl_req_slice {
2088 struct cl_req *crs_req;
2089 struct cl_device *crs_dev;
2090 struct list_head crs_linkage;
2091 const struct cl_req_operations *crs_ops;
2096 enum cache_stats_item {
2097 /** how many cache lookups were performed */
2099 /** how many times cache lookup resulted in a hit */
2101 /** how many entities are in the cache right now */
2103 /** how many entities in the cache are actively used (and cannot be
2104 * evicted) right now */
2106 /** how many entities were created at all */
2111 #define CS_NAMES { "lookup", "hit", "total", "busy", "create" }
2114 * Stats for a generic cache (similar to inode, lu_object, etc. caches).
2116 struct cache_stats {
2117 const char *cs_name;
2118 atomic_t cs_stats[CS_NR];
2121 /** These are not exported so far */
2122 void cache_stats_init (struct cache_stats *cs, const char *name);
2125 * Client-side site. This represents particular client stack. "Global"
2126 * variables should (directly or indirectly) be added here to allow multiple
2127 * clients to co-exist in the single address space.
2130 struct lu_site cs_lu;
2132 * Statistical counters. Atomics do not scale, something better like
2133 * per-cpu counters is needed.
2135 * These are exported as /proc/fs/lustre/llite/.../site
2137 * When interpreting keep in mind that both sub-locks (and sub-pages)
2138 * and top-locks (and top-pages) are accounted here.
2140 struct cache_stats cs_pages;
2141 atomic_t cs_pages_state[CPS_NR];
2144 int cl_site_init(struct cl_site *s, struct cl_device *top);
2145 void cl_site_fini(struct cl_site *s);
2146 void cl_stack_fini(const struct lu_env *env, struct cl_device *cl);
2149 * Output client site statistical counters into a buffer. Suitable for
2150 * ll_rd_*()-style functions.
2152 int cl_site_stats_print(const struct cl_site *site, struct seq_file *m);
2157 * Type conversion and accessory functions.
2161 static inline struct cl_site *lu2cl_site(const struct lu_site *site)
2163 return container_of(site, struct cl_site, cs_lu);
2166 static inline int lu_device_is_cl(const struct lu_device *d)
2168 return d->ld_type->ldt_tags & LU_DEVICE_CL;
2171 static inline struct cl_device *lu2cl_dev(const struct lu_device *d)
2173 LASSERT(d == NULL || IS_ERR(d) || lu_device_is_cl(d));
2174 return container_of0(d, struct cl_device, cd_lu_dev);
2177 static inline struct lu_device *cl2lu_dev(struct cl_device *d)
2179 return &d->cd_lu_dev;
2182 static inline struct cl_object *lu2cl(const struct lu_object *o)
2184 LASSERT(o == NULL || IS_ERR(o) || lu_device_is_cl(o->lo_dev));
2185 return container_of0(o, struct cl_object, co_lu);
2188 static inline const struct cl_object_conf *
2189 lu2cl_conf(const struct lu_object_conf *conf)
2191 return container_of0(conf, struct cl_object_conf, coc_lu);
2194 static inline struct cl_object *cl_object_next(const struct cl_object *obj)
2196 return obj ? lu2cl(lu_object_next(&obj->co_lu)) : NULL;
2199 static inline struct cl_object_header *luh2coh(const struct lu_object_header *h)
2201 return container_of0(h, struct cl_object_header, coh_lu);
2204 static inline struct cl_site *cl_object_site(const struct cl_object *obj)
2206 return lu2cl_site(obj->co_lu.lo_dev->ld_site);
2210 struct cl_object_header *cl_object_header(const struct cl_object *obj)
2212 return luh2coh(obj->co_lu.lo_header);
2215 static inline int cl_device_init(struct cl_device *d, struct lu_device_type *t)
2217 return lu_device_init(&d->cd_lu_dev, t);
2220 static inline void cl_device_fini(struct cl_device *d)
2222 lu_device_fini(&d->cd_lu_dev);
2225 void cl_page_slice_add(struct cl_page *page, struct cl_page_slice *slice,
2226 struct cl_object *obj, pgoff_t index,
2227 const struct cl_page_operations *ops);
2228 void cl_lock_slice_add(struct cl_lock *lock, struct cl_lock_slice *slice,
2229 struct cl_object *obj,
2230 const struct cl_lock_operations *ops);
2231 void cl_io_slice_add(struct cl_io *io, struct cl_io_slice *slice,
2232 struct cl_object *obj, const struct cl_io_operations *ops);
2233 void cl_req_slice_add(struct cl_req *req, struct cl_req_slice *slice,
2234 struct cl_device *dev,
2235 const struct cl_req_operations *ops);
2238 /** \defgroup cl_object cl_object
2240 struct cl_object *cl_object_top (struct cl_object *o);
2241 struct cl_object *cl_object_find(const struct lu_env *env, struct cl_device *cd,
2242 const struct lu_fid *fid,
2243 const struct cl_object_conf *c);
2245 int cl_object_header_init(struct cl_object_header *h);
2246 void cl_object_header_fini(struct cl_object_header *h);
2247 void cl_object_put (const struct lu_env *env, struct cl_object *o);
2248 void cl_object_get (struct cl_object *o);
2249 void cl_object_attr_lock (struct cl_object *o);
2250 void cl_object_attr_unlock(struct cl_object *o);
2251 int cl_object_attr_get (const struct lu_env *env, struct cl_object *obj,
2252 struct cl_attr *attr);
2253 int cl_object_attr_set (const struct lu_env *env, struct cl_object *obj,
2254 const struct cl_attr *attr, unsigned valid);
2255 int cl_object_glimpse (const struct lu_env *env, struct cl_object *obj,
2256 struct ost_lvb *lvb);
2257 int cl_conf_set (const struct lu_env *env, struct cl_object *obj,
2258 const struct cl_object_conf *conf);
2259 int cl_object_prune (const struct lu_env *env, struct cl_object *obj);
2260 void cl_object_kill (const struct lu_env *env, struct cl_object *obj);
2263 * Returns true, iff \a o0 and \a o1 are slices of the same object.
2265 static inline int cl_object_same(struct cl_object *o0, struct cl_object *o1)
2267 return cl_object_header(o0) == cl_object_header(o1);
2270 static inline void cl_object_page_init(struct cl_object *clob, int size)
2272 clob->co_slice_off = cl_object_header(clob)->coh_page_bufsize;
2273 cl_object_header(clob)->coh_page_bufsize += cfs_size_round(size);
2274 WARN_ON(cl_object_header(clob)->coh_page_bufsize > 512);
2277 static inline void *cl_object_page_slice(struct cl_object *clob,
2278 struct cl_page *page)
2280 return (void *)((char *)page + clob->co_slice_off);
2284 * Return refcount of cl_object.
2286 static inline int cl_object_refc(struct cl_object *clob)
2288 struct lu_object_header *header = clob->co_lu.lo_header;
2289 return atomic_read(&header->loh_ref);
2294 /** \defgroup cl_page cl_page
2302 /* callback of cl_page_gang_lookup() */
2304 struct cl_page *cl_page_find (const struct lu_env *env,
2305 struct cl_object *obj,
2306 pgoff_t idx, struct page *vmpage,
2307 enum cl_page_type type);
2308 struct cl_page *cl_page_alloc (const struct lu_env *env,
2309 struct cl_object *o, pgoff_t ind,
2310 struct page *vmpage,
2311 enum cl_page_type type);
2312 void cl_page_get (struct cl_page *page);
2313 void cl_page_put (const struct lu_env *env,
2314 struct cl_page *page);
2315 void cl_page_print (const struct lu_env *env, void *cookie,
2316 lu_printer_t printer,
2317 const struct cl_page *pg);
2318 void cl_page_header_print(const struct lu_env *env, void *cookie,
2319 lu_printer_t printer,
2320 const struct cl_page *pg);
2321 struct cl_page *cl_vmpage_page (struct page *vmpage, struct cl_object *obj);
2322 struct cl_page *cl_page_top (struct cl_page *page);
2324 const struct cl_page_slice *cl_page_at(const struct cl_page *page,
2325 const struct lu_device_type *dtype);
2330 * Functions dealing with the ownership of page by io.
2334 int cl_page_own (const struct lu_env *env,
2335 struct cl_io *io, struct cl_page *page);
2336 int cl_page_own_try (const struct lu_env *env,
2337 struct cl_io *io, struct cl_page *page);
2338 void cl_page_assume (const struct lu_env *env,
2339 struct cl_io *io, struct cl_page *page);
2340 void cl_page_unassume (const struct lu_env *env,
2341 struct cl_io *io, struct cl_page *pg);
2342 void cl_page_disown (const struct lu_env *env,
2343 struct cl_io *io, struct cl_page *page);
2344 int cl_page_is_owned (const struct cl_page *pg, const struct cl_io *io);
2351 * Functions dealing with the preparation of a page for a transfer, and
2352 * tracking transfer state.
2355 int cl_page_prep (const struct lu_env *env, struct cl_io *io,
2356 struct cl_page *pg, enum cl_req_type crt);
2357 void cl_page_completion (const struct lu_env *env,
2358 struct cl_page *pg, enum cl_req_type crt, int ioret);
2359 int cl_page_make_ready (const struct lu_env *env, struct cl_page *pg,
2360 enum cl_req_type crt);
2361 int cl_page_cache_add (const struct lu_env *env, struct cl_io *io,
2362 struct cl_page *pg, enum cl_req_type crt);
2363 void cl_page_clip (const struct lu_env *env, struct cl_page *pg,
2365 int cl_page_cancel (const struct lu_env *env, struct cl_page *page);
2366 int cl_page_flush (const struct lu_env *env, struct cl_io *io,
2367 struct cl_page *pg);
2373 * \name helper routines
2374 * Functions to discard, delete and export a cl_page.
2377 void cl_page_discard (const struct lu_env *env, struct cl_io *io,
2378 struct cl_page *pg);
2379 void cl_page_delete (const struct lu_env *env, struct cl_page *pg);
2380 int cl_page_is_vmlocked (const struct lu_env *env,
2381 const struct cl_page *pg);
2382 void cl_page_export (const struct lu_env *env,
2383 struct cl_page *pg, int uptodate);
2384 int cl_page_is_under_lock(const struct lu_env *env, struct cl_io *io,
2385 struct cl_page *page, pgoff_t *max_index);
2386 loff_t cl_offset (const struct cl_object *obj, pgoff_t idx);
2387 pgoff_t cl_index (const struct cl_object *obj, loff_t offset);
2388 int cl_page_size (const struct cl_object *obj);
2389 int cl_pages_prune (const struct lu_env *env, struct cl_object *obj);
2391 void cl_lock_print (const struct lu_env *env, void *cookie,
2392 lu_printer_t printer, const struct cl_lock *lock);
2393 void cl_lock_descr_print(const struct lu_env *env, void *cookie,
2394 lu_printer_t printer,
2395 const struct cl_lock_descr *descr);
2400 /** \defgroup cl_lock cl_lock
2402 int cl_lock_request(const struct lu_env *env, struct cl_io *io,
2403 struct cl_lock *lock);
2404 int cl_lock_init(const struct lu_env *env, struct cl_lock *lock,
2405 const struct cl_io *io);
2406 void cl_lock_fini(const struct lu_env *env, struct cl_lock *lock);
2407 const struct cl_lock_slice *cl_lock_at(const struct cl_lock *lock,
2408 const struct lu_device_type *dtype);
2409 void cl_lock_release(const struct lu_env *env, struct cl_lock *lock);
2411 int cl_lock_enqueue(const struct lu_env *env, struct cl_io *io,
2412 struct cl_lock *lock, struct cl_sync_io *anchor);
2413 void cl_lock_cancel(const struct lu_env *env, struct cl_lock *lock);
2417 /** \defgroup cl_io cl_io
2420 int cl_io_init (const struct lu_env *env, struct cl_io *io,
2421 enum cl_io_type iot, struct cl_object *obj);
2422 int cl_io_sub_init (const struct lu_env *env, struct cl_io *io,
2423 enum cl_io_type iot, struct cl_object *obj);
2424 int cl_io_rw_init (const struct lu_env *env, struct cl_io *io,
2425 enum cl_io_type iot, loff_t pos, size_t count);
2426 int cl_io_loop (const struct lu_env *env, struct cl_io *io);
2428 void cl_io_fini (const struct lu_env *env, struct cl_io *io);
2429 int cl_io_iter_init (const struct lu_env *env, struct cl_io *io);
2430 void cl_io_iter_fini (const struct lu_env *env, struct cl_io *io);
2431 int cl_io_lock (const struct lu_env *env, struct cl_io *io);
2432 void cl_io_unlock (const struct lu_env *env, struct cl_io *io);
2433 int cl_io_start (const struct lu_env *env, struct cl_io *io);
2434 void cl_io_end (const struct lu_env *env, struct cl_io *io);
2435 int cl_io_lock_add (const struct lu_env *env, struct cl_io *io,
2436 struct cl_io_lock_link *link);
2437 int cl_io_lock_alloc_add(const struct lu_env *env, struct cl_io *io,
2438 struct cl_lock_descr *descr);
2439 int cl_io_read_page (const struct lu_env *env, struct cl_io *io,
2440 struct cl_page *page);
2441 int cl_io_submit_rw (const struct lu_env *env, struct cl_io *io,
2442 enum cl_req_type iot, struct cl_2queue *queue);
2443 int cl_io_submit_sync (const struct lu_env *env, struct cl_io *io,
2444 enum cl_req_type iot, struct cl_2queue *queue,
2446 int cl_io_commit_async (const struct lu_env *env, struct cl_io *io,
2447 struct cl_page_list *queue, int from, int to,
2449 void cl_io_rw_advance (const struct lu_env *env, struct cl_io *io,
2451 int cl_io_cancel (const struct lu_env *env, struct cl_io *io,
2452 struct cl_page_list *queue);
2453 int cl_io_is_going (const struct lu_env *env);
2456 * True, iff \a io is an O_APPEND write(2).
2458 static inline int cl_io_is_append(const struct cl_io *io)
2460 return io->ci_type == CIT_WRITE && io->u.ci_wr.wr_append;
2463 static inline int cl_io_is_sync_write(const struct cl_io *io)
2465 return io->ci_type == CIT_WRITE && io->u.ci_wr.wr_sync;
2468 static inline int cl_io_is_mkwrite(const struct cl_io *io)
2470 return io->ci_type == CIT_FAULT && io->u.ci_fault.ft_mkwrite;
2474 * True, iff \a io is a truncate(2).
2476 static inline int cl_io_is_trunc(const struct cl_io *io)
2478 return io->ci_type == CIT_SETATTR &&
2479 (io->u.ci_setattr.sa_valid & ATTR_SIZE);
2482 struct cl_io *cl_io_top(struct cl_io *io);
2484 void cl_io_print(const struct lu_env *env, void *cookie,
2485 lu_printer_t printer, const struct cl_io *io);
2487 #define CL_IO_SLICE_CLEAN(foo_io, base) \
2489 typeof(foo_io) __foo_io = (foo_io); \
2491 CLASSERT(offsetof(typeof(*__foo_io), base) == 0); \
2492 memset(&__foo_io->base + 1, 0, \
2493 (sizeof *__foo_io) - sizeof __foo_io->base); \
2498 /** \defgroup cl_page_list cl_page_list
2502 * Last page in the page list.
2504 static inline struct cl_page *cl_page_list_last(struct cl_page_list *plist)
2506 LASSERT(plist->pl_nr > 0);
2507 return list_entry(plist->pl_pages.prev, struct cl_page, cp_batch);
2510 static inline struct cl_page *cl_page_list_first(struct cl_page_list *plist)
2512 LASSERT(plist->pl_nr > 0);
2513 return list_entry(plist->pl_pages.next, struct cl_page, cp_batch);
2517 * Iterate over pages in a page list.
2519 #define cl_page_list_for_each(page, list) \
2520 list_for_each_entry((page), &(list)->pl_pages, cp_batch)
2523 * Iterate over pages in a page list, taking possible removals into account.
2525 #define cl_page_list_for_each_safe(page, temp, list) \
2526 list_for_each_entry_safe((page), (temp), &(list)->pl_pages, cp_batch)
2528 void cl_page_list_init (struct cl_page_list *plist);
2529 void cl_page_list_add (struct cl_page_list *plist, struct cl_page *page);
2530 void cl_page_list_move (struct cl_page_list *dst, struct cl_page_list *src,
2531 struct cl_page *page);
2532 void cl_page_list_move_head(struct cl_page_list *dst, struct cl_page_list *src,
2533 struct cl_page *page);
2534 void cl_page_list_splice (struct cl_page_list *list,
2535 struct cl_page_list *head);
2536 void cl_page_list_del (const struct lu_env *env,
2537 struct cl_page_list *plist, struct cl_page *page);
2538 void cl_page_list_disown (const struct lu_env *env,
2539 struct cl_io *io, struct cl_page_list *plist);
2540 int cl_page_list_own (const struct lu_env *env,
2541 struct cl_io *io, struct cl_page_list *plist);
2542 void cl_page_list_assume (const struct lu_env *env,
2543 struct cl_io *io, struct cl_page_list *plist);
2544 void cl_page_list_discard(const struct lu_env *env,
2545 struct cl_io *io, struct cl_page_list *plist);
2546 void cl_page_list_fini (const struct lu_env *env, struct cl_page_list *plist);
2548 void cl_2queue_init (struct cl_2queue *queue);
2549 void cl_2queue_add (struct cl_2queue *queue, struct cl_page *page);
2550 void cl_2queue_disown (const struct lu_env *env,
2551 struct cl_io *io, struct cl_2queue *queue);
2552 void cl_2queue_assume (const struct lu_env *env,
2553 struct cl_io *io, struct cl_2queue *queue);
2554 void cl_2queue_discard (const struct lu_env *env,
2555 struct cl_io *io, struct cl_2queue *queue);
2556 void cl_2queue_fini (const struct lu_env *env, struct cl_2queue *queue);
2557 void cl_2queue_init_page(struct cl_2queue *queue, struct cl_page *page);
2559 /** @} cl_page_list */
2561 /** \defgroup cl_req cl_req
2563 struct cl_req *cl_req_alloc(const struct lu_env *env, struct cl_page *page,
2564 enum cl_req_type crt, int nr_objects);
2566 void cl_req_page_add (const struct lu_env *env, struct cl_req *req,
2567 struct cl_page *page);
2568 void cl_req_page_done (const struct lu_env *env, struct cl_page *page);
2569 int cl_req_prep (const struct lu_env *env, struct cl_req *req);
2570 void cl_req_attr_set (const struct lu_env *env, struct cl_req *req,
2571 struct cl_req_attr *attr, obd_valid flags);
2572 void cl_req_completion(const struct lu_env *env, struct cl_req *req, int ioret);
2574 /** \defgroup cl_sync_io cl_sync_io
2578 * Anchor for synchronous transfer. This is allocated on a stack by thread
2579 * doing synchronous transfer, and a pointer to this structure is set up in
2580 * every page submitted for transfer. Transfer completion routine updates
2581 * anchor and wakes up waiting thread when transfer is complete.
2584 /** number of pages yet to be transferred. */
2585 atomic_t csi_sync_nr;
2588 /** barrier of destroy this structure */
2589 atomic_t csi_barrier;
2590 /** completion to be signaled when transfer is complete. */
2591 wait_queue_head_t csi_waitq;
2592 /** callback to invoke when this IO is finished */
2593 void (*csi_end_io)(const struct lu_env *,
2594 struct cl_sync_io *);
2597 void cl_sync_io_init(struct cl_sync_io *anchor, int nr,
2598 void (*end)(const struct lu_env *, struct cl_sync_io *));
2599 int cl_sync_io_wait(const struct lu_env *env, struct cl_sync_io *anchor,
2601 void cl_sync_io_note(const struct lu_env *env, struct cl_sync_io *anchor,
2603 void cl_sync_io_end(const struct lu_env *env, struct cl_sync_io *anchor);
2605 /** @} cl_sync_io */
2609 /** \defgroup cl_env cl_env
2611 * lu_env handling for a client.
2613 * lu_env is an environment within which lustre code executes. Its major part
2614 * is lu_context---a fast memory allocation mechanism that is used to conserve
2615 * precious kernel stack space. Originally lu_env was designed for a server,
2618 * - there is a (mostly) fixed number of threads, and
2620 * - call chains have no non-lustre portions inserted between lustre code.
2622 * On a client both these assumtpion fails, because every user thread can
2623 * potentially execute lustre code as part of a system call, and lustre calls
2624 * into VFS or MM that call back into lustre.
2626 * To deal with that, cl_env wrapper functions implement the following
2629 * - allocation and destruction of environment is amortized by caching no
2630 * longer used environments instead of destroying them;
2632 * - there is a notion of "current" environment, attached to the kernel
2633 * data structure representing current thread Top-level lustre code
2634 * allocates an environment and makes it current, then calls into
2635 * non-lustre code, that in turn calls lustre back. Low-level lustre
2636 * code thus called can fetch environment created by the top-level code
2637 * and reuse it, avoiding additional environment allocation.
2638 * Right now, three interfaces can attach the cl_env to running thread:
2641 * - cl_env_reexit(cl_env_reenter had to be called priorly)
2643 * \see lu_env, lu_context, lu_context_key
2646 struct cl_env_nest {
2651 struct lu_env *cl_env_peek (int *refcheck);
2652 struct lu_env *cl_env_get (int *refcheck);
2653 struct lu_env *cl_env_alloc (int *refcheck, __u32 tags);
2654 struct lu_env *cl_env_nested_get (struct cl_env_nest *nest);
2655 void cl_env_put (struct lu_env *env, int *refcheck);
2656 void cl_env_nested_put (struct cl_env_nest *nest, struct lu_env *env);
2657 void *cl_env_reenter (void);
2658 void cl_env_reexit (void *cookie);
2659 void cl_env_implant (struct lu_env *env, int *refcheck);
2660 void cl_env_unplant (struct lu_env *env, int *refcheck);
2661 unsigned cl_env_cache_purge(unsigned nr);
2662 struct lu_env *cl_env_percpu_get (void);
2663 void cl_env_percpu_put (struct lu_env *env);
2670 void cl_attr2lvb(struct ost_lvb *lvb, const struct cl_attr *attr);
2671 void cl_lvb2attr(struct cl_attr *attr, const struct ost_lvb *lvb);
2673 struct cl_device *cl_type_setup(const struct lu_env *env, struct lu_site *site,
2674 struct lu_device_type *ldt,
2675 struct lu_device *next);
2678 int cl_global_init(void);
2679 void cl_global_fini(void);
2681 #endif /* _LINUX_CL_OBJECT_H */