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.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2011, 2017, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
33 #ifndef __LUSTRE_LU_OBJECT_H
34 #define __LUSTRE_LU_OBJECT_H
37 #include <libcfs/libcfs.h>
38 #include <uapi/linux/lustre/lustre_idl.h>
40 #include <linux/percpu_counter.h>
41 #include <linux/ctype.h>
42 #include <obd_target.h>
45 struct proc_dir_entry;
51 * lu_* data-types represent server-side entities shared by data and meta-data
56 * -# support for layering.
58 * Server side object is split into layers, one per device in the
59 * corresponding device stack. Individual layer is represented by struct
60 * lu_object. Compound layered object --- by struct lu_object_header. Most
61 * interface functions take lu_object as an argument and operate on the
62 * whole compound object. This decision was made due to the following
65 * - it's envisaged that lu_object will be used much more often than
68 * - we want lower (non-top) layers to be able to initiate operations
69 * on the whole object.
71 * Generic code supports layering more complex than simple stacking, e.g.,
72 * it is possible that at some layer object "spawns" multiple sub-objects
75 * -# fid-based identification.
77 * Compound object is uniquely identified by its fid. Objects are indexed
78 * by their fids (hash table is used for index).
80 * -# caching and life-cycle management.
82 * Object's life-time is controlled by reference counting. When reference
83 * count drops to 0, object is returned to cache. Cached objects still
84 * retain their identity (i.e., fid), and can be recovered from cache.
86 * Objects are kept in the global LRU list, and lu_site_purge() function
87 * can be used to reclaim given number of unused objects from the tail of
90 * -# avoiding recursion.
92 * Generic code tries to replace recursion through layers by iterations
93 * where possible. Additionally to the end of reducing stack consumption,
94 * data, when practically possible, are allocated through lu_context_key
95 * interface rather than on stack.
102 struct lu_object_header;
108 * Operations common for data and meta-data devices.
110 struct lu_device_operations {
112 * Allocate object for the given device (without lower-layer
113 * parts). This is called by lu_object_operations::loo_object_init()
114 * from the parent layer, and should setup at least lu_object::lo_dev
115 * and lu_object::lo_ops fields of resulting lu_object.
117 * Object creation protocol.
119 * Due to design goal of avoiding recursion, object creation (see
120 * lu_object_alloc()) is somewhat involved:
122 * - first, lu_device_operations::ldo_object_alloc() method of the
123 * top-level device in the stack is called. It should allocate top
124 * level object (including lu_object_header), but without any
125 * lower-layer sub-object(s).
127 * - then lu_object_alloc() sets fid in the header of newly created
130 * - then lu_object_operations::loo_object_init() is called. It has
131 * to allocate lower-layer object(s). To do this,
132 * lu_object_operations::loo_object_init() calls ldo_object_alloc()
133 * of the lower-layer device(s).
135 * - for all new objects allocated by
136 * lu_object_operations::loo_object_init() (and inserted into object
137 * stack), lu_object_operations::loo_object_init() is called again
138 * repeatedly, until no new objects are created.
140 * \post ergo(!IS_ERR(result), result->lo_dev == d &&
141 * result->lo_ops != NULL);
143 struct lu_object *(*ldo_object_alloc)(const struct lu_env *env,
144 const struct lu_object_header *h,
145 struct lu_device *d);
147 * process config specific for device.
149 int (*ldo_process_config)(const struct lu_env *env,
150 struct lu_device *, struct lustre_cfg *);
151 int (*ldo_recovery_complete)(const struct lu_env *,
155 * initialize local objects for device. this method called after layer has
156 * been initialized (after LCFG_SETUP stage) and before it starts serving
160 int (*ldo_prepare)(const struct lu_env *,
161 struct lu_device *parent,
162 struct lu_device *dev);
166 * Allocate new FID for file with @name under @parent
168 * \param[in] env execution environment for this thread
169 * \param[in] dev dt device
170 * \param[out] fid new FID allocated
171 * \param[in] parent parent object
172 * \param[in] name lu_name
174 * \retval 0 on success
175 * \retval 0 0 FID allocated successfully.
176 * \retval 1 1 FID allocated successfully and new sequence
177 * requested from seq meta server
178 * \retval negative negative errno if FID allocation failed.
180 int (*ldo_fid_alloc)(const struct lu_env *env,
181 struct lu_device *dev,
183 struct lu_object *parent,
184 const struct lu_name *name);
188 * For lu_object_conf flags
191 /* This is a new object to be allocated, or the file
192 * corresponding to the object does not exists. */
193 LOC_F_NEW = 0x00000001,
197 * Object configuration, describing particulars of object being created. On
198 * server this is not used, as server objects are full identified by fid. On
199 * client configuration contains struct lustre_md.
201 struct lu_object_conf {
203 * Some hints for obj find and alloc.
205 loc_flags_t loc_flags;
209 * Type of "printer" function used by lu_object_operations::loo_object_print()
212 * Printer function is needed to provide some flexibility in (semi-)debugging
213 * output: possible implementations: printk, CDEBUG, sysfs/seq_file
215 typedef int (*lu_printer_t)(const struct lu_env *env,
216 void *cookie, const char *format, ...)
217 __attribute__ ((format (printf, 3, 4)));
220 * Operations specific for particular lu_object.
222 struct lu_object_operations {
225 * Allocate lower-layer parts of the object by calling
226 * lu_device_operations::ldo_object_alloc() of the corresponding
229 * This method is called once for each object inserted into object
230 * stack. It's responsibility of this method to insert lower-layer
231 * object(s) it create into appropriate places of object stack.
233 int (*loo_object_init)(const struct lu_env *env,
235 const struct lu_object_conf *conf);
237 * Called (in top-to-bottom order) during object allocation after all
238 * layers were allocated and initialized. Can be used to perform
239 * initialization depending on lower layers.
241 int (*loo_object_start)(const struct lu_env *env,
242 struct lu_object *o);
244 * Called before lu_object_operations::loo_object_free() to signal
245 * that object is being destroyed. Dual to
246 * lu_object_operations::loo_object_init().
248 void (*loo_object_delete)(const struct lu_env *env,
249 struct lu_object *o);
251 * Dual to lu_device_operations::ldo_object_alloc(). Called when
252 * object is removed from memory. Must use call_rcu or kfree_rcu
253 * if the object contains an lu_object_header.
255 void (*loo_object_free)(const struct lu_env *env,
256 struct lu_object *o);
258 * Called when last active reference to the object is released (and
259 * object returns to the cache). This method is optional.
261 void (*loo_object_release)(const struct lu_env *env,
262 struct lu_object *o);
264 * Optional debugging helper. Print given object.
266 int (*loo_object_print)(const struct lu_env *env, void *cookie,
267 lu_printer_t p, const struct lu_object *o);
269 * Optional debugging method. Returns true iff method is internally
272 int (*loo_object_invariant)(const struct lu_object *o);
278 struct lu_device_type;
281 * Device: a layer in the server side abstraction stacking.
285 * reference count. This is incremented, in particular, on each object
286 * created at this layer.
288 * \todo XXX which means that atomic_t is probably too small.
292 * Pointer to device type. Never modified once set.
294 struct lu_device_type *ld_type;
296 * Operation vector for this device.
298 const struct lu_device_operations *ld_ops;
300 * Stack this device belongs to.
302 struct lu_site *ld_site;
303 struct proc_dir_entry *ld_proc_entry;
305 /** \todo XXX: temporary back pointer into obd. */
306 struct obd_device *ld_obd;
308 * A list of references to this object, for debugging.
310 struct lu_ref ld_reference;
312 * Link the device to the site.
314 struct list_head ld_linkage;
317 struct lu_device_type_operations;
320 * Tag bits for device type. They are used to distinguish certain groups of
324 /** this is meta-data device */
325 LU_DEVICE_MD = (1 << 0),
326 /** this is data device */
327 LU_DEVICE_DT = (1 << 1),
328 /** data device in the client stack */
329 LU_DEVICE_CL = (1 << 2)
335 struct lu_device_type {
337 * Tag bits. Taken from enum lu_device_tag. Never modified once set.
341 * Name of this class. Unique system-wide. Never modified once set.
345 * Operations for this type.
347 const struct lu_device_type_operations *ldt_ops;
349 * \todo XXX: temporary: context tags used by obd_*() calls.
353 * Number of existing device type instances.
355 atomic_t ldt_device_nr;
359 * Operations on a device type.
361 struct lu_device_type_operations {
363 * Allocate new device.
365 struct lu_device *(*ldto_device_alloc)(const struct lu_env *env,
366 struct lu_device_type *t,
367 struct lustre_cfg *lcfg);
369 * Free device. Dual to
370 * lu_device_type_operations::ldto_device_alloc(). Returns pointer to
371 * the next device in the stack.
373 struct lu_device *(*ldto_device_free)(const struct lu_env *,
377 * Initialize the devices after allocation
379 int (*ldto_device_init)(const struct lu_env *env,
380 struct lu_device *, const char *,
383 * Finalize device. Dual to
384 * lu_device_type_operations::ldto_device_init(). Returns pointer to
385 * the next device in the stack.
387 struct lu_device *(*ldto_device_fini)(const struct lu_env *env,
390 * Initialize device type. This is called on module load.
392 int (*ldto_init)(struct lu_device_type *t);
394 * Finalize device type. Dual to
395 * lu_device_type_operations::ldto_init(). Called on module unload.
397 void (*ldto_fini)(struct lu_device_type *t);
399 * Called when the first device is created.
401 void (*ldto_start)(struct lu_device_type *t);
403 * Called when number of devices drops to 0.
405 void (*ldto_stop)(struct lu_device_type *t);
408 static inline int lu_device_is_md(const struct lu_device *d)
410 return ergo(d != NULL, d->ld_type->ldt_tags & LU_DEVICE_MD);
414 * Common object attributes.
425 /** modification time in seconds since Epoch */
427 /** access time in seconds since Epoch */
429 /** change time in seconds since Epoch */
431 /** create time in seconds since Epoch */
433 /** 512-byte blocks allocated to object */
435 /** permission bits and file type */
443 /** number of persistent references to this object */
445 /** blk bits of the object*/
447 /** blk size of the object*/
453 /** set layout version to OST objects. */
454 __u32 la_layout_version;
456 __u64 la_dirent_count;
459 #define LU_DIRENT_COUNT_UNSET ~0ULL
462 * Layer in the layered object.
466 * Header for this object.
468 struct lu_object_header *lo_header;
470 * Device for this layer.
472 struct lu_device *lo_dev;
474 * Operations for this object.
476 const struct lu_object_operations *lo_ops;
478 * Linkage into list of all layers.
480 struct list_head lo_linkage;
482 * Link to the device, for debugging.
484 struct lu_ref_link lo_dev_ref;
487 enum lu_object_header_flags {
489 * Don't keep this object in cache. Object will be destroyed as soon
490 * as last reference to it is released. This flag cannot be cleared
493 LU_OBJECT_HEARD_BANSHEE = 0,
495 * Mark this object has already been taken out of cache.
497 LU_OBJECT_UNHASHED = 1,
499 * Object is initialized, when object is found in cache, it may not be
500 * intialized yet, the object allocator will initialize it.
502 LU_OBJECT_INITED = 2,
504 * Object is being purged, so mustn't be returned by
507 LU_OBJECT_PURGING = 3,
510 enum lu_object_header_attr {
511 LOHA_EXISTS = 1 << 0,
512 LOHA_REMOTE = 1 << 1,
513 LOHA_HAS_AGENT_ENTRY = 1 << 2,
515 * UNIX file type is stored in S_IFMT bits.
517 LOHA_FT_START = 001 << 12, /**< S_IFIFO */
518 LOHA_FT_END = 017 << 12, /**< S_IFMT */
522 * "Compound" object, consisting of multiple layers.
524 * Compound object with given fid is unique with given lu_site.
526 * Note, that object does *not* necessary correspond to the real object in the
527 * persistent storage: object is an anchor for locking and method calling, so
528 * it is created for things like not-yet-existing child created by mkdir or
529 * create calls. lu_object_operations::loo_exists() can be used to check
530 * whether object is backed by persistent storage entity.
532 struct lu_object_header {
534 * Fid, uniquely identifying this object.
536 struct lu_fid loh_fid;
538 * Object flags from enum lu_object_header_flags. Set and checked
541 unsigned long loh_flags;
543 * Object reference count. Protected by lu_site::ls_guard.
547 * Common object attributes, cached for efficiency. From enum
548 * lu_object_header_attr.
552 * Linkage into per-site hash table. Protected by lu_site::ls_guard.
554 struct hlist_node loh_hash;
556 * Linkage into per-site LRU list. Protected by lu_site::ls_guard.
558 struct list_head loh_lru;
560 * Linkage into list of layers. Never modified once set (except lately
561 * during object destruction). No locking is necessary.
563 struct list_head loh_layers;
565 * A list of references to this object, for debugging.
567 struct lu_ref loh_reference;
569 * Handle used for kfree_rcu() or similar.
571 struct rcu_head loh_rcu;
581 LU_SS_CACHE_DEATH_RACE,
587 * lu_site is a "compartment" within which objects are unique, and LRU
588 * discipline is maintained.
590 * lu_site exists so that multiple layered stacks can co-exist in the same
593 * lu_site has the same relation to lu_device as lu_object_header to
600 struct cfs_hash *ls_obj_hash;
602 * buckets for summary data
604 struct lu_site_bkt_data *ls_bkts;
608 * index of bucket on hash table while purging
610 unsigned int ls_purge_start;
612 * Top-level device for this stack.
614 struct lu_device *ls_top_dev;
616 * Bottom-level device for this stack
618 struct lu_device *ls_bottom_dev;
620 * Linkage into global list of sites.
622 struct list_head ls_linkage;
624 * List for lu device for this site, protected
627 struct list_head ls_ld_linkage;
628 spinlock_t ls_ld_lock;
630 * Lock to serialize site purge.
632 struct mutex ls_purge_mutex;
636 struct lprocfs_stats *ls_stats;
638 * XXX: a hack! fld has to find md_site via site, remove when possible
640 struct seq_server_site *ld_seq_site;
642 * Pointer to the lu_target for this site.
644 struct lu_target *ls_tgt;
647 * Number of objects in lsb_lru_lists - used for shrinking
649 struct percpu_counter ls_lru_len_counter;
653 lu_site_wq_from_fid(struct lu_site *site, struct lu_fid *fid);
655 static inline struct seq_server_site *lu_site2seq(const struct lu_site *s)
657 return s->ld_seq_site;
661 * Constructors/destructors.
665 int lu_site_init (struct lu_site *s, struct lu_device *d);
666 void lu_site_fini (struct lu_site *s);
667 int lu_site_init_finish (struct lu_site *s);
668 void lu_stack_fini (const struct lu_env *env, struct lu_device *top);
669 void lu_device_get (struct lu_device *d);
670 void lu_device_put (struct lu_device *d);
671 int lu_device_init (struct lu_device *d, struct lu_device_type *t);
672 void lu_device_fini (struct lu_device *d);
673 int lu_object_header_init(struct lu_object_header *h);
674 void lu_object_header_fini(struct lu_object_header *h);
675 int lu_object_init (struct lu_object *o,
676 struct lu_object_header *h, struct lu_device *d);
677 void lu_object_fini (struct lu_object *o);
678 void lu_object_add_top (struct lu_object_header *h, struct lu_object *o);
679 void lu_object_add (struct lu_object *before, struct lu_object *o);
681 void lu_dev_add_linkage(struct lu_site *s, struct lu_device *d);
682 void lu_dev_del_linkage(struct lu_site *s, struct lu_device *d);
685 * Helpers to initialize and finalize device types.
688 int lu_device_type_init(struct lu_device_type *ldt);
689 void lu_device_type_fini(struct lu_device_type *ldt);
694 * Caching and reference counting.
699 * Acquire additional reference to the given object. This function is used to
700 * attain additional reference. To acquire initial reference use
703 static inline void lu_object_get(struct lu_object *o)
705 LASSERT(atomic_read(&o->lo_header->loh_ref) > 0);
706 atomic_inc(&o->lo_header->loh_ref);
710 * Return true if object will not be cached after last reference to it is
713 static inline int lu_object_is_dying(const struct lu_object_header *h)
715 return test_bit(LU_OBJECT_HEARD_BANSHEE, &h->loh_flags);
719 * Return true if object is initialized.
721 static inline int lu_object_is_inited(const struct lu_object_header *h)
723 return test_bit(LU_OBJECT_INITED, &h->loh_flags);
726 void lu_object_put(const struct lu_env *env, struct lu_object *o);
727 void lu_object_put_nocache(const struct lu_env *env, struct lu_object *o);
728 void lu_object_unhash(const struct lu_env *env, struct lu_object *o);
729 int lu_site_purge_objects(const struct lu_env *env, struct lu_site *s, int nr,
732 static inline int lu_site_purge(const struct lu_env *env, struct lu_site *s,
735 return lu_site_purge_objects(env, s, nr, 1);
738 void lu_site_print(const struct lu_env *env, struct lu_site *s, void *cookie,
739 lu_printer_t printer);
740 struct lu_object *lu_object_find(const struct lu_env *env,
741 struct lu_device *dev, const struct lu_fid *f,
742 const struct lu_object_conf *conf);
743 struct lu_object *lu_object_find_at(const struct lu_env *env,
744 struct lu_device *dev,
745 const struct lu_fid *f,
746 const struct lu_object_conf *conf);
747 struct lu_object *lu_object_find_slice(const struct lu_env *env,
748 struct lu_device *dev,
749 const struct lu_fid *f,
750 const struct lu_object_conf *conf);
759 * First (topmost) sub-object of given compound object
761 static inline struct lu_object *lu_object_top(struct lu_object_header *h)
763 LASSERT(!list_empty(&h->loh_layers));
764 return container_of0(h->loh_layers.next, struct lu_object, lo_linkage);
768 * Next sub-object in the layering
770 static inline struct lu_object *lu_object_next(const struct lu_object *o)
772 return container_of0(o->lo_linkage.next, struct lu_object, lo_linkage);
776 * Pointer to the fid of this object.
778 static inline const struct lu_fid *lu_object_fid(const struct lu_object *o)
780 return &o->lo_header->loh_fid;
784 * return device operations vector for this object
786 static const inline struct lu_device_operations *
787 lu_object_ops(const struct lu_object *o)
789 return o->lo_dev->ld_ops;
793 * Given a compound object, find its slice, corresponding to the device type
796 struct lu_object *lu_object_locate(struct lu_object_header *h,
797 const struct lu_device_type *dtype);
800 * Printer function emitting messages through libcfs_debug_msg().
802 int lu_cdebug_printer(const struct lu_env *env,
803 void *cookie, const char *format, ...);
806 * Print object description followed by a user-supplied message.
808 #define LU_OBJECT_DEBUG(mask, env, object, format, ...) \
810 if (cfs_cdebug_show(mask, DEBUG_SUBSYSTEM)) { \
811 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, mask, NULL); \
812 lu_object_print(env, &msgdata, lu_cdebug_printer, object);\
813 CDEBUG(mask, format "\n", ## __VA_ARGS__); \
818 * Print short object description followed by a user-supplied message.
820 #define LU_OBJECT_HEADER(mask, env, object, format, ...) \
822 if (cfs_cdebug_show(mask, DEBUG_SUBSYSTEM)) { \
823 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, mask, NULL); \
824 lu_object_header_print(env, &msgdata, lu_cdebug_printer,\
825 (object)->lo_header); \
826 lu_cdebug_printer(env, &msgdata, "\n"); \
827 CDEBUG(mask, format , ## __VA_ARGS__); \
831 void lu_object_print (const struct lu_env *env, void *cookie,
832 lu_printer_t printer, const struct lu_object *o);
833 void lu_object_header_print(const struct lu_env *env, void *cookie,
834 lu_printer_t printer,
835 const struct lu_object_header *hdr);
838 * Check object consistency.
840 int lu_object_invariant(const struct lu_object *o);
844 * Check whether object exists, no matter on local or remote storage.
845 * Note: LOHA_EXISTS will be set once some one created the object,
846 * and it does not needs to be committed to storage.
848 #define lu_object_exists(o) ((o)->lo_header->loh_attr & LOHA_EXISTS)
851 * Check whether object on the remote storage.
853 #define lu_object_remote(o) unlikely((o)->lo_header->loh_attr & LOHA_REMOTE)
856 * Check whether the object as agent entry on current target
858 #define lu_object_has_agent_entry(o) \
859 unlikely((o)->lo_header->loh_attr & LOHA_HAS_AGENT_ENTRY)
861 static inline void lu_object_set_agent_entry(struct lu_object *o)
863 o->lo_header->loh_attr |= LOHA_HAS_AGENT_ENTRY;
866 static inline void lu_object_clear_agent_entry(struct lu_object *o)
868 o->lo_header->loh_attr &= ~LOHA_HAS_AGENT_ENTRY;
871 static inline int lu_object_assert_exists(const struct lu_object *o)
873 return lu_object_exists(o);
876 static inline int lu_object_assert_not_exists(const struct lu_object *o)
878 return !lu_object_exists(o);
882 * Attr of this object.
884 static inline __u32 lu_object_attr(const struct lu_object *o)
886 LASSERT(lu_object_exists(o) != 0);
888 return o->lo_header->loh_attr & S_IFMT;
891 static inline void lu_object_ref_add(struct lu_object *o,
895 lu_ref_add(&o->lo_header->loh_reference, scope, source);
898 static inline void lu_object_ref_add_at(struct lu_object *o,
899 struct lu_ref_link *link,
903 lu_ref_add_at(&o->lo_header->loh_reference, link, scope, source);
906 static inline void lu_object_ref_del(struct lu_object *o,
907 const char *scope, const void *source)
909 lu_ref_del(&o->lo_header->loh_reference, scope, source);
912 static inline void lu_object_ref_del_at(struct lu_object *o,
913 struct lu_ref_link *link,
914 const char *scope, const void *source)
916 lu_ref_del_at(&o->lo_header->loh_reference, link, scope, source);
919 /** input params, should be filled out by mdt */
923 /** count in bytes */
924 unsigned int rp_count;
925 /** number of pages */
926 unsigned int rp_npages;
927 /** requested attr */
929 /** pointers to pages */
930 struct page **rp_pages;
933 enum lu_xattr_flags {
934 LU_XATTR_REPLACE = (1 << 0),
935 LU_XATTR_CREATE = (1 << 1),
936 LU_XATTR_MERGE = (1 << 2),
937 LU_XATTR_SPLIT = (1 << 3),
945 /** For lu_context health-checks */
946 enum lu_context_state {
955 * lu_context. Execution context for lu_object methods. Currently associated
958 * All lu_object methods, except device and device type methods (called during
959 * system initialization and shutdown) are executed "within" some
960 * lu_context. This means, that pointer to some "current" lu_context is passed
961 * as an argument to all methods.
963 * All service ptlrpc threads create lu_context as part of their
964 * initialization. It is possible to create "stand-alone" context for other
965 * execution environments (like system calls).
967 * lu_object methods mainly use lu_context through lu_context_key interface
968 * that allows each layer to associate arbitrary pieces of data with each
969 * context (see pthread_key_create(3) for similar interface).
971 * On a client, lu_context is bound to a thread, see cl_env_get().
973 * \see lu_context_key
977 * lu_context is used on the client side too. Yet we don't want to
978 * allocate values of server-side keys for the client contexts and
981 * To achieve this, set of tags in introduced. Contexts and keys are
982 * marked with tags. Key value are created only for context whose set
983 * of tags has non-empty intersection with one for key. Tags are taken
984 * from enum lu_context_tag.
987 enum lu_context_state lc_state;
989 * Pointer to the home service thread. NULL for other execution
992 struct ptlrpc_thread *lc_thread;
994 * Pointer to an array with key values. Internal implementation
999 * Linkage into a list of all remembered contexts. Only
1000 * `non-transient' contexts, i.e., ones created for service threads
1003 struct list_head lc_remember;
1005 * Version counter used to skip calls to lu_context_refill() when no
1006 * keys were registered.
1008 unsigned lc_version;
1016 * lu_context_key interface. Similar to pthread_key.
1019 enum lu_context_tag {
1021 * Thread on md server
1023 LCT_MD_THREAD = 1 << 0,
1025 * Thread on dt server
1027 LCT_DT_THREAD = 1 << 1,
1031 LCT_CL_THREAD = 1 << 3,
1033 * A per-request session on a server, and a per-system-call session on
1036 LCT_SESSION = 1 << 4,
1038 * A per-request data on OSP device
1040 LCT_OSP_THREAD = 1 << 5,
1044 LCT_MG_THREAD = 1 << 6,
1046 * Context for local operations
1050 * session for server thread
1052 LCT_SERVER_SESSION = 1 << 8,
1054 * Set when at least one of keys, having values in this context has
1055 * non-NULL lu_context_key::lct_exit() method. This is used to
1056 * optimize lu_context_exit() call.
1058 LCT_HAS_EXIT = 1 << 28,
1060 * Don't add references for modules creating key values in that context.
1061 * This is only for contexts used internally by lu_object framework.
1063 LCT_NOREF = 1 << 29,
1065 * Key is being prepared for retiring, don't create new values for it.
1067 LCT_QUIESCENT = 1 << 30,
1069 * Context should be remembered.
1071 LCT_REMEMBER = 1 << 31,
1073 * Contexts usable in cache shrinker thread.
1075 LCT_SHRINKER = LCT_MD_THREAD|LCT_DT_THREAD|LCT_CL_THREAD|LCT_NOREF
1079 * Key. Represents per-context value slot.
1081 * Keys are usually registered when module owning the key is initialized, and
1082 * de-registered when module is unloaded. Once key is registered, all new
1083 * contexts with matching tags, will get key value. "Old" contexts, already
1084 * initialized at the time of key registration, can be forced to get key value
1085 * by calling lu_context_refill().
1087 * Every key value is counted in lu_context_key::lct_used and acquires a
1088 * reference on an owning module. This means, that all key values have to be
1089 * destroyed before module can be unloaded. This is usually achieved by
1090 * stopping threads started by the module, that created contexts in their
1091 * entry functions. Situation is complicated by the threads shared by multiple
1092 * modules, like ptlrpcd daemon on a client. To work around this problem,
1093 * contexts, created in such threads, are `remembered' (see
1094 * LCT_REMEMBER)---i.e., added into a global list. When module is preparing
1095 * for unloading it does the following:
1097 * - marks its keys as `quiescent' (lu_context_tag::LCT_QUIESCENT)
1098 * preventing new key values from being allocated in the new contexts,
1101 * - scans a list of remembered contexts, destroying values of module
1102 * keys, thus releasing references to the module.
1104 * This is done by lu_context_key_quiesce(). If module is re-activated
1105 * before key has been de-registered, lu_context_key_revive() call clears
1106 * `quiescent' marker.
1108 * lu_context code doesn't provide any internal synchronization for these
1109 * activities---it's assumed that startup (including threads start-up) and
1110 * shutdown are serialized by some external means.
1114 struct lu_context_key {
1116 * Set of tags for which values of this key are to be instantiated.
1120 * Value constructor. This is called when new value is created for a
1121 * context. Returns pointer to new value of error pointer.
1123 void *(*lct_init)(const struct lu_context *ctx,
1124 struct lu_context_key *key);
1126 * Value destructor. Called when context with previously allocated
1127 * value of this slot is destroyed. \a data is a value that was returned
1128 * by a matching call to lu_context_key::lct_init().
1130 void (*lct_fini)(const struct lu_context *ctx,
1131 struct lu_context_key *key, void *data);
1133 * Optional method called on lu_context_exit() for all allocated
1134 * keys. Can be used by debugging code checking that locks are
1137 void (*lct_exit)(const struct lu_context *ctx,
1138 struct lu_context_key *key, void *data);
1140 * Internal implementation detail: index within lu_context::lc_value[]
1141 * reserved for this key.
1145 * Internal implementation detail: number of values created for this
1150 * Internal implementation detail: module for this key.
1152 struct module *lct_owner;
1154 * References to this key. For debugging.
1156 struct lu_ref lct_reference;
1159 #define LU_KEY_INIT(mod, type) \
1160 static void *mod##_key_init(const struct lu_context *ctx, \
1161 struct lu_context_key *key) \
1165 BUILD_BUG_ON(PAGE_SIZE < sizeof(*value)); \
1167 OBD_ALLOC_PTR(value); \
1168 if (value == NULL) \
1169 value = ERR_PTR(-ENOMEM); \
1173 struct __##mod##__dummy_init { ; } /* semicolon catcher */
1175 #define LU_KEY_FINI(mod, type) \
1176 static void mod##_key_fini(const struct lu_context *ctx, \
1177 struct lu_context_key *key, void* data) \
1179 type *info = data; \
1181 OBD_FREE_PTR(info); \
1183 struct __##mod##__dummy_fini {;} /* semicolon catcher */
1185 #define LU_KEY_INIT_FINI(mod, type) \
1186 LU_KEY_INIT(mod,type); \
1187 LU_KEY_FINI(mod,type)
1189 #define LU_CONTEXT_KEY_DEFINE(mod, tags) \
1190 struct lu_context_key mod##_thread_key = { \
1192 .lct_init = mod##_key_init, \
1193 .lct_fini = mod##_key_fini \
1196 #define LU_CONTEXT_KEY_INIT(key) \
1198 (key)->lct_owner = THIS_MODULE; \
1201 int lu_context_key_register(struct lu_context_key *key);
1202 void lu_context_key_degister(struct lu_context_key *key);
1203 void *lu_context_key_get (const struct lu_context *ctx,
1204 const struct lu_context_key *key);
1205 void lu_context_key_quiesce (struct lu_context_key *key);
1206 void lu_context_key_revive (struct lu_context_key *key);
1210 * LU_KEY_INIT_GENERIC() has to be a macro to correctly determine an
1214 #define LU_KEY_INIT_GENERIC(mod) \
1215 static void mod##_key_init_generic(struct lu_context_key *k, ...) \
1217 struct lu_context_key *key = k; \
1220 va_start(args, k); \
1222 LU_CONTEXT_KEY_INIT(key); \
1223 key = va_arg(args, struct lu_context_key *); \
1224 } while (key != NULL); \
1228 #define LU_TYPE_INIT(mod, ...) \
1229 LU_KEY_INIT_GENERIC(mod) \
1230 static int mod##_type_init(struct lu_device_type *t) \
1232 mod##_key_init_generic(__VA_ARGS__, NULL); \
1233 return lu_context_key_register_many(__VA_ARGS__, NULL); \
1235 struct __##mod##_dummy_type_init {;}
1237 #define LU_TYPE_FINI(mod, ...) \
1238 static void mod##_type_fini(struct lu_device_type *t) \
1240 lu_context_key_degister_many(__VA_ARGS__, NULL); \
1242 struct __##mod##_dummy_type_fini {;}
1244 #define LU_TYPE_START(mod, ...) \
1245 static void mod##_type_start(struct lu_device_type *t) \
1247 lu_context_key_revive_many(__VA_ARGS__, NULL); \
1249 struct __##mod##_dummy_type_start {;}
1251 #define LU_TYPE_STOP(mod, ...) \
1252 static void mod##_type_stop(struct lu_device_type *t) \
1254 lu_context_key_quiesce_many(__VA_ARGS__, NULL); \
1256 struct __##mod##_dummy_type_stop {;}
1260 #define LU_TYPE_INIT_FINI(mod, ...) \
1261 LU_TYPE_INIT(mod, __VA_ARGS__); \
1262 LU_TYPE_FINI(mod, __VA_ARGS__); \
1263 LU_TYPE_START(mod, __VA_ARGS__); \
1264 LU_TYPE_STOP(mod, __VA_ARGS__)
1266 int lu_context_init (struct lu_context *ctx, __u32 tags);
1267 void lu_context_fini (struct lu_context *ctx);
1268 void lu_context_enter (struct lu_context *ctx);
1269 void lu_context_exit (struct lu_context *ctx);
1270 int lu_context_refill(struct lu_context *ctx);
1273 * Helper functions to operate on multiple keys. These are used by the default
1274 * device type operations, defined by LU_TYPE_INIT_FINI().
1277 int lu_context_key_register_many(struct lu_context_key *k, ...);
1278 void lu_context_key_degister_many(struct lu_context_key *k, ...);
1279 void lu_context_key_revive_many (struct lu_context_key *k, ...);
1280 void lu_context_key_quiesce_many (struct lu_context_key *k, ...);
1283 * update/clear ctx/ses tags.
1285 void lu_context_tags_update(__u32 tags);
1286 void lu_context_tags_clear(__u32 tags);
1287 void lu_session_tags_update(__u32 tags);
1288 void lu_session_tags_clear(__u32 tags);
1295 * "Local" context, used to store data instead of stack.
1297 struct lu_context le_ctx;
1299 * "Session" context for per-request data.
1301 struct lu_context *le_ses;
1304 int lu_env_init (struct lu_env *env, __u32 tags);
1305 void lu_env_fini (struct lu_env *env);
1306 int lu_env_refill(struct lu_env *env);
1307 int lu_env_refill_by_tags(struct lu_env *env, __u32 ctags, __u32 stags);
1309 static inline void* lu_env_info(const struct lu_env *env,
1310 const struct lu_context_key *key)
1313 info = lu_context_key_get(&env->le_ctx, key);
1315 if (!lu_env_refill((struct lu_env *)env))
1316 info = lu_context_key_get(&env->le_ctx, key);
1322 struct lu_env *lu_env_find(void);
1323 int lu_env_add(struct lu_env *env);
1324 int lu_env_add_task(struct lu_env *env, struct task_struct *task);
1325 void lu_env_remove(struct lu_env *env);
1327 /** @} lu_context */
1330 * Output site statistical counters into a buffer. Suitable for
1331 * ll_rd_*()-style functions.
1333 int lu_site_stats_seq_print(const struct lu_site *s, struct seq_file *m);
1336 * Common name structure to be passed around for various name related methods.
1339 const char *ln_name;
1343 static inline bool name_is_dot_or_dotdot(const char *name, int namelen)
1345 return name[0] == '.' &&
1346 (namelen == 1 || (namelen == 2 && name[1] == '.'));
1349 static inline bool lu_name_is_dot_or_dotdot(const struct lu_name *lname)
1351 return name_is_dot_or_dotdot(lname->ln_name, lname->ln_namelen);
1354 static inline bool lu_name_is_temp_file(const char *name, int namelen,
1355 bool dot_prefix, int suffixlen)
1360 int len = suffixlen;
1362 if (dot_prefix && name[0] != '.')
1365 if (namelen < dot_prefix + suffixlen + 2 ||
1366 name[namelen - suffixlen - 1] != '.')
1370 lower += islower(name[namelen - len]);
1371 upper += isupper(name[namelen - len]);
1372 digit += isdigit(name[namelen - len]);
1375 /* mktemp() filename suffixes will have a mix of upper- and lower-case
1376 * letters and/or numbers, not all numbers, or all upper or lower-case.
1377 * About 0.07% of randomly-generated names will slip through,
1378 * but this avoids 99.93% of cross-MDT renames for those files.
1380 if ((digit >= suffixlen - 1 && !isdigit(name[namelen - suffixlen])) ||
1381 upper == suffixlen || lower == suffixlen)
1387 static inline bool lu_name_is_backup_file(const char *name, int namelen,
1391 name[namelen - 2] != '.' && name[namelen - 1] == '~') {
1397 if (namelen > 4 && name[namelen - 4] == '.' &&
1398 (!strncasecmp(name + namelen - 3, "bak", 3) ||
1399 !strncasecmp(name + namelen - 3, "sav", 3))) {
1405 if (namelen > 5 && name[namelen - 5] == '.' &&
1406 !strncasecmp(name + namelen - 4, "orig", 4)) {
1415 static inline bool lu_name_is_valid_len(const char *name, size_t name_len)
1417 return name != NULL &&
1419 name_len < INT_MAX &&
1420 strlen(name) == name_len &&
1421 memchr(name, '/', name_len) == NULL;
1425 * Validate names (path components)
1427 * To be valid \a name must be non-empty, '\0' terminated of length \a
1428 * name_len, and not contain '/'. The maximum length of a name (before
1429 * say -ENAMETOOLONG will be returned) is really controlled by llite
1430 * and the server. We only check for something insane coming from bad
1431 * integer handling here.
1433 static inline bool lu_name_is_valid_2(const char *name, size_t name_len)
1435 return lu_name_is_valid_len(name, name_len) && name[name_len] == '\0';
1438 static inline bool lu_name_is_valid(const struct lu_name *ln)
1440 return lu_name_is_valid_2(ln->ln_name, ln->ln_namelen);
1443 #define DNAME "%.*s"
1445 (lu_name_is_valid(ln) ? (ln)->ln_namelen : 0), \
1446 (lu_name_is_valid(ln) ? (ln)->ln_name : "")
1449 * Common buffer structure to be passed around for various xattr_{s,g}et()
1457 #define DLUBUF "(%p %zu)"
1458 #define PLUBUF(buf) (buf)->lb_buf, (buf)->lb_len
1460 /* read buffer params, should be filled out by out */
1462 /** number of buffers */
1463 unsigned int rb_nbufs;
1464 /** pointers to buffers */
1465 struct lu_buf rb_bufs[];
1469 * One-time initializers, called at obdclass module initialization, not
1474 * Initialization of global lu_* data.
1476 int lu_global_init(void);
1479 * Dual to lu_global_init().
1481 void lu_global_fini(void);
1483 struct lu_kmem_descr {
1484 struct kmem_cache **ckd_cache;
1485 const char *ckd_name;
1486 const size_t ckd_size;
1489 int lu_kmem_init(struct lu_kmem_descr *caches);
1490 void lu_kmem_fini(struct lu_kmem_descr *caches);
1492 void lu_object_assign_fid(const struct lu_env *env, struct lu_object *o,
1493 const struct lu_fid *fid);
1494 struct lu_object *lu_object_anon(const struct lu_env *env,
1495 struct lu_device *dev,
1496 const struct lu_object_conf *conf);
1499 extern struct lu_buf LU_BUF_NULL;
1501 void lu_buf_free(struct lu_buf *buf);
1502 void lu_buf_alloc(struct lu_buf *buf, size_t size);
1503 void lu_buf_realloc(struct lu_buf *buf, size_t size);
1505 int lu_buf_check_and_grow(struct lu_buf *buf, size_t len);
1506 struct lu_buf *lu_buf_check_and_alloc(struct lu_buf *buf, size_t len);
1508 extern __u32 lu_context_tags_default;
1509 extern __u32 lu_session_tags_default;
1511 static inline bool lu_device_is_cl(const struct lu_device *d)
1513 return d->ld_type->ldt_tags & LU_DEVICE_CL;
1516 static inline bool lu_object_is_cl(const struct lu_object *o)
1518 return lu_device_is_cl(o->lo_dev);
1521 /* round-robin QoS data for LOD/LMV */
1523 spinlock_t lqr_alloc; /* protect allocation index */
1524 __u32 lqr_start_idx; /* start index of new inode */
1525 __u32 lqr_offset_idx;/* aliasing for start_idx */
1526 int lqr_start_count;/* reseed counter */
1527 struct lu_tgt_pool lqr_pool; /* round-robin optimized list */
1528 unsigned long lqr_dirty:1; /* recalc round-robin list */
1531 /* QoS data per MDS/OSS */
1533 struct obd_uuid lsq_uuid; /* ptlrpc's c_remote_uuid */
1534 struct list_head lsq_svr_list; /* link to lq_svr_list */
1535 __u64 lsq_bavail; /* total bytes avail on svr */
1536 __u64 lsq_iavail; /* tital inode avail on svr */
1537 __u64 lsq_penalty; /* current penalty */
1538 __u64 lsq_penalty_per_obj; /* penalty decrease
1540 time64_t lsq_used; /* last used time, seconds */
1541 __u32 lsq_tgt_count; /* number of tgts on this svr */
1542 __u32 lsq_id; /* unique svr id */
1545 /* QoS data per MDT/OST */
1547 struct lu_svr_qos *ltq_svr; /* svr info */
1548 __u64 ltq_penalty; /* current penalty */
1549 __u64 ltq_penalty_per_obj; /* penalty decrease
1551 __u64 ltq_weight; /* net weighting */
1552 time64_t ltq_used; /* last used time, seconds */
1553 bool ltq_usable:1; /* usable for striping */
1556 /* target descriptor */
1557 struct lu_tgt_desc {
1559 struct dt_device *ltd_tgt;
1560 struct obd_device *ltd_obd;
1562 struct obd_export *ltd_exp;
1563 struct obd_uuid ltd_uuid;
1566 struct list_head ltd_kill;
1567 struct task_struct *ltd_recovery_task;
1568 struct mutex ltd_fid_mutex;
1569 struct lu_tgt_qos ltd_qos; /* qos info per target */
1570 struct obd_statfs ltd_statfs;
1571 time64_t ltd_statfs_age;
1572 unsigned long ltd_active:1,/* is this target up for requests */
1573 ltd_activate:1,/* should target be activated */
1574 ltd_reap:1, /* should this target be deleted */
1575 ltd_got_update_log:1, /* Already got update log */
1576 ltd_connecting:1; /* target is connecting */
1579 /* number of pointers at 1st level */
1580 #define TGT_PTRS (PAGE_SIZE / sizeof(void *))
1581 /* number of pointers at 2nd level */
1582 #define TGT_PTRS_PER_BLOCK (PAGE_SIZE / sizeof(void *))
1584 struct lu_tgt_desc_idx {
1585 struct lu_tgt_desc *ldi_tgt[TGT_PTRS_PER_BLOCK];
1588 /* QoS data for LOD/LMV */
1590 struct list_head lq_svr_list; /* lu_svr_qos list */
1591 struct rw_semaphore lq_rw_sem;
1592 __u32 lq_active_svr_count;
1593 unsigned int lq_prio_free; /* priority for free space */
1594 unsigned int lq_threshold_rr;/* priority for rr */
1595 struct lu_qos_rr lq_rr; /* round robin qos data */
1596 unsigned long lq_dirty:1, /* recalc qos data */
1597 lq_same_space:1,/* the servers all have approx.
1598 * the same space avail */
1599 lq_reset:1; /* zero current penalties */
1602 struct lu_tgt_descs {
1604 struct lov_desc ltd_lov_desc;
1605 struct lmv_desc ltd_lmv_desc;
1607 /* list of known TGTs */
1608 struct lu_tgt_desc_idx *ltd_tgt_idx[TGT_PTRS];
1609 /* Size of the lu_tgts array, granted to be a power of 2 */
1610 __u32 ltd_tgts_size;
1611 /* bitmap of TGTs available */
1612 struct cfs_bitmap *ltd_tgt_bitmap;
1613 /* TGTs scheduled to be deleted */
1614 __u32 ltd_death_row;
1615 /* Table refcount used for delayed deletion */
1617 /* mutex to serialize concurrent updates to the tgt table */
1618 struct mutex ltd_mutex;
1619 /* read/write semaphore used for array relocation */
1620 struct rw_semaphore ltd_rw_sem;
1622 struct lu_qos ltd_qos;
1623 /* all tgts in a packed array */
1624 struct lu_tgt_pool ltd_tgt_pool;
1625 /* true if tgt is MDT */
1629 #define LTD_TGT(ltd, index) \
1630 (ltd)->ltd_tgt_idx[(index) / \
1631 TGT_PTRS_PER_BLOCK]->ldi_tgt[(index) % TGT_PTRS_PER_BLOCK]
1633 u64 lu_prandom_u64_max(u64 ep_ro);
1634 void lu_qos_rr_init(struct lu_qos_rr *lqr);
1635 int lu_qos_add_tgt(struct lu_qos *qos, struct lu_tgt_desc *ltd);
1636 void lu_tgt_qos_weight_calc(struct lu_tgt_desc *tgt);
1638 int lu_tgt_descs_init(struct lu_tgt_descs *ltd, bool is_mdt);
1639 void lu_tgt_descs_fini(struct lu_tgt_descs *ltd);
1640 int ltd_add_tgt(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt);
1641 void ltd_del_tgt(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt);
1642 bool ltd_qos_is_usable(struct lu_tgt_descs *ltd);
1643 int ltd_qos_penalties_calc(struct lu_tgt_descs *ltd);
1644 int ltd_qos_update(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt,
1647 static inline struct lu_tgt_desc *ltd_first_tgt(struct lu_tgt_descs *ltd)
1651 index = find_first_bit(ltd->ltd_tgt_bitmap->data,
1652 ltd->ltd_tgt_bitmap->size);
1653 return (index < ltd->ltd_tgt_bitmap->size) ? LTD_TGT(ltd, index) : NULL;
1656 static inline struct lu_tgt_desc *ltd_next_tgt(struct lu_tgt_descs *ltd,
1657 struct lu_tgt_desc *tgt)
1664 index = tgt->ltd_index;
1665 LASSERT(index < ltd->ltd_tgt_bitmap->size);
1666 index = find_next_bit(ltd->ltd_tgt_bitmap->data,
1667 ltd->ltd_tgt_bitmap->size, index + 1);
1668 return (index < ltd->ltd_tgt_bitmap->size) ? LTD_TGT(ltd, index) : NULL;
1671 #define ltd_foreach_tgt(ltd, tgt) \
1672 for (tgt = ltd_first_tgt(ltd); tgt; tgt = ltd_next_tgt(ltd, tgt))
1674 #define ltd_foreach_tgt_safe(ltd, tgt, tmp) \
1675 for (tgt = ltd_first_tgt(ltd), tmp = ltd_next_tgt(ltd, tgt); tgt; \
1676 tgt = tmp, tmp = ltd_next_tgt(ltd, tgt))
1679 #endif /* __LUSTRE_LU_OBJECT_H */