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) 2007, 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 * lustre/include/lustre_fid.h
38 * Author: Yury Umanets <umka@clusterfs.com>
41 #ifndef __LUSTRE_FID_H
42 #define __LUSTRE_FID_H
48 * http://wiki.lustre.org/index.php/Architecture_-_Interoperability_fids_zfs
49 * describes the FID namespace and interoperability requirements for FIDs.
50 * The important parts of that document are included here for reference.
53 * File IDentifier generated by client from range allocated by the SEQuence
54 * service and stored in struct lu_fid. The FID is composed of three parts:
55 * SEQuence, ObjectID, and VERsion. The SEQ component is a filesystem
56 * unique 64-bit integer, and only one client is ever assigned any SEQ value.
57 * The first 0x400 FID_SEQ_NORMAL [2^33, 2^33 + 0x400] values are reserved
58 * for system use. The OID component is a 32-bit value generated by the
59 * client on a per-SEQ basis to allow creating many unique FIDs without
60 * communication with the server. The VER component is a 32-bit value that
61 * distinguishes between different FID instantiations, such as snapshots or
62 * separate subtrees within the filesystem. FIDs with the same VER field
63 * are considered part of the same namespace.
65 * OLD filesystems are those upgraded from Lustre 1.x that predate FIDs, and
66 * MDTs use 32-bit ldiskfs internal inode/generation numbers (IGIFs), while
67 * OSTs use 64-bit Lustre object IDs and generation numbers.
69 * NEW filesystems are those formatted since the introduction of FIDs.
72 * Inode and Generation In FID, a surrogate FID used to globally identify
73 * an existing object on OLD formatted MDT file system. This would only be
74 * used on MDT0 in a DNE filesystem, because there cannot be more than one
75 * MDT in an OLD formatted filesystem. Belongs to sequence in [12, 2^32 - 1]
76 * range, where inode number is stored in SEQ, and inode generation is in OID.
77 * NOTE: This assumes no more than 2^32-1 inodes exist in the MDT filesystem,
78 * which is the maximum possible for an ldiskfs backend. It also assumes
79 * that the reserved ext3/ext4/ldiskfs inode numbers [0-11] are never visible
80 * to clients, which has always been true.
83 * object ID In FID, a surrogate FID used to globally identify an existing
84 * OST object on OLD formatted OST file system. Belongs to a sequence in
85 * [2^32, 2^33 - 1]. Sequence number is calculated as:
87 * 1 << 32 | (ost_index << 16) | ((objid >> 32) & 0xffff)
89 * that is, SEQ consists of 16-bit OST index, and higher 16 bits of object
90 * ID. The generation of unique SEQ values per OST allows the IDIF FIDs to
91 * be identified in the FLD correctly. The OID field is calculated as:
95 * that is, it consists of lower 32 bits of object ID. For objects within
96 * the IDIF range, object ID extraction will be:
98 * o_id = (fid->f_seq & 0x7fff) << 16 | fid->f_oid;
99 * o_seq = 0; // formerly group number
101 * NOTE: This assumes that no more than 2^48-1 objects have ever been created
102 * on any OST, and that no more than 65535 OSTs are in use. Both are very
103 * reasonable assumptions, i.e. an IDIF can uniquely map all objects assuming
104 * a maximum creation rate of 1M objects per second for a maximum of 9 years,
105 * or combinations thereof.
108 * Surrogate FID used to identify an existing object on OLD formatted OST
109 * filesystem. Belongs to the reserved SEQuence 0, and is used prior to
110 * the introduction of FID-on-OST, at which point IDIF will be used to
111 * identify objects as residing on a specific OST.
114 * For Lustre Log objects the object sequence 1 is used. This is compatible
115 * with both OLD and NEW namespaces, as this SEQ number is in the
116 * ext3/ldiskfs reserved inode range and does not conflict with IGIF
120 * For testing OST IO performance the object sequence 2 is used. This is
121 * compatible with both OLD and NEW namespaces, as this SEQ number is in
122 * the ext3/ldiskfs reserved inode range and does not conflict with IGIF
125 * OST_MDT1 .. OST_MAX
126 * For testing with multiple MDTs the object sequence 3 through 9 is used,
127 * allowing direct mapping of MDTs 1 through 7 respectively, for a total
128 * of 8 MDTs including OST_MDT0. This matches the legacy CMD project "group"
129 * mappings. However, this SEQ range is only for testing prior to any
130 * production DNE release, as the objects in this range conflict across all
131 * OSTs, as the OST index is not part of the FID. For production DNE usage,
132 * OST objects created by MDT1+ will use FID_SEQ_NORMAL FIDs.
134 * DLM OST objid to IDIF mapping
135 * For compatibility with existing OLD OST network protocol structures, the
136 * FID must map onto the o_id and o_seq in a manner that ensures existing
137 * objects are identified consistently for IO, as well as onto the LDLM
138 * namespace to ensure IDIFs there is only a single resource name for any
139 * object in the DLM. The OLD OST object DLM resource mapping is:
141 * resource[] = {o_id, o_seq, 0, 0}; // o_seq == 0 for production releases
143 * The NEW OST object DLM resource mapping is the same for both MDT and OST:
145 * resource[] = {SEQ, OID, VER, HASH};
147 * NOTE: for mapping IDIF values to DLM resource names the o_id may be
148 * larger than the 2^33 reserved sequence numbers for IDIF, so it is possible
149 * for the o_id numbers to overlap FID SEQ numbers in the resource. However,
150 * in all production releases the OLD o_seq field is always zero, and all
151 * valid FID OID values are non-zero, so the lock resources will not collide.
152 * Even so, the MDT and OST resources are also in different LDLM namespaces.
155 #include <libcfs/libcfs.h>
156 #include <lustre/lustre_idl.h>
164 /* Whole sequences space range and zero range definitions */
165 extern const struct lu_seq_range LUSTRE_SEQ_SPACE_RANGE;
166 extern const struct lu_seq_range LUSTRE_SEQ_ZERO_RANGE;
167 extern const struct lu_fid LUSTRE_BFL_FID;
168 extern const struct lu_fid LU_OBF_FID;
169 extern const struct lu_fid LU_LPF_FID;
170 extern const struct lu_fid LU_DOT_LUSTRE_FID;
174 * This is how may metadata FIDs may be allocated in one sequence(128k)
176 LUSTRE_METADATA_SEQ_MAX_WIDTH = 0x0000000000020000ULL,
179 * This is how many data FIDs could be allocated in one sequence(4B - 1)
181 LUSTRE_DATA_SEQ_MAX_WIDTH = 0x00000000FFFFFFFFULL,
184 * How many sequences to allocate to a client at once.
186 LUSTRE_SEQ_META_WIDTH = 0x0000000000000001ULL,
189 * seq allocation pool size.
191 LUSTRE_SEQ_BATCH_WIDTH = LUSTRE_SEQ_META_WIDTH * 1000,
194 * This is how many sequences may be in one super-sequence allocated to
197 LUSTRE_SEQ_SUPER_WIDTH = ((1ULL << 30ULL) * LUSTRE_SEQ_META_WIDTH)
201 /** 2^6 FIDs for OI containers */
202 OSD_OI_FID_OID_BITS = 6,
203 /** reserve enough FIDs in case we want more in the future */
204 OSD_OI_FID_OID_BITS_MAX = 10,
207 /** special OID for local objects */
209 /** \see fld_mod_init */
211 /** \see fid_mod_init */
212 FID_SEQ_CTL_OID = 4UL,
213 FID_SEQ_SRV_OID = 5UL,
214 /** \see mdd_mod_init */
215 MDD_ROOT_INDEX_OID = 6UL, /* deprecated in 2.4 */
216 MDD_ORPHAN_OID = 7UL, /* deprecated in 2.4 */
217 MDD_LOV_OBJ_OID = 8UL,
218 MDD_CAPA_KEYS_OID = 9UL,
219 /** \see mdt_mod_init */
220 LAST_RECV_OID = 11UL,
221 OSD_FS_ROOT_OID = 13UL,
222 ACCT_USER_OID = 15UL,
223 ACCT_GROUP_OID = 16UL,
224 LFSCK_BOOKMARK_OID = 17UL,
225 OTABLE_IT_OID = 18UL,
226 /* These two definitions are obsolete
227 * OFD_GROUP0_LAST_OID = 20UL,
228 * OFD_GROUP4K_LAST_OID = 20UL+4096,
230 OFD_LAST_GROUP_OID = 4117UL,
231 LLOG_CATALOGS_OID = 4118UL,
232 MGS_CONFIGS_OID = 4119UL,
233 OFD_HEALTH_CHECK_OID = 4120UL,
234 MDD_LOV_OBJ_OSEQ = 4121UL,
235 LFSCK_NAMESPACE_OID = 4122UL,
236 REMOTE_PARENT_DIR_OID = 4123UL,
237 SLAVE_LLOG_CATALOGS_OID = 4124UL,
240 static inline void lu_local_obj_fid(struct lu_fid *fid, __u32 oid)
242 fid->f_seq = FID_SEQ_LOCAL_FILE;
247 static inline void lu_local_name_obj_fid(struct lu_fid *fid, __u32 oid)
249 fid->f_seq = FID_SEQ_LOCAL_NAME;
254 /* For new FS (>= 2.4), the root FID will be changed to
255 * [FID_SEQ_ROOT:1:0], for existing FS, (upgraded to 2.4),
256 * the root FID will still be IGIF */
257 static inline int fid_is_root(const struct lu_fid *fid)
259 return unlikely((fid_seq(fid) == FID_SEQ_ROOT &&
263 static inline int fid_is_dot_lustre(const struct lu_fid *fid)
265 return unlikely(fid_seq(fid) == FID_SEQ_DOT_LUSTRE &&
266 fid_oid(fid) == FID_OID_DOT_LUSTRE);
269 static inline int fid_is_obf(const struct lu_fid *fid)
271 return unlikely(fid_seq(fid) == FID_SEQ_DOT_LUSTRE &&
272 fid_oid(fid) == FID_OID_DOT_LUSTRE_OBF);
275 static inline int fid_is_otable_it(const struct lu_fid *fid)
277 return unlikely(fid_seq(fid) == FID_SEQ_LOCAL_FILE &&
278 fid_oid(fid) == OTABLE_IT_OID);
281 static inline int fid_is_acct(const struct lu_fid *fid)
283 return fid_seq(fid) == FID_SEQ_LOCAL_FILE &&
284 (fid_oid(fid) == ACCT_USER_OID ||
285 fid_oid(fid) == ACCT_GROUP_OID);
288 static inline int fid_is_quota(const struct lu_fid *fid)
290 return fid_seq(fid) == FID_SEQ_QUOTA ||
291 fid_seq(fid) == FID_SEQ_QUOTA_GLB;
294 static inline int fid_is_name_llog(const struct lu_fid *fid)
296 return fid_seq(fid) == FID_SEQ_LLOG_NAME;
299 static inline int fid_is_namespace_visible(const struct lu_fid *fid)
301 const __u64 seq = fid_seq(fid);
303 /* Here, we cannot distinguish whether the normal FID is for OST
304 * object or not. It is caller's duty to check more if needed. */
305 return (!fid_is_last_id(fid) &&
306 (fid_seq_is_norm(seq) || fid_seq_is_igif(seq))) ||
307 fid_is_root(fid) || fid_seq_is_dot(seq);
310 static inline int fid_seq_in_fldb(__u64 seq)
312 return fid_seq_is_igif(seq) || fid_seq_is_norm(seq) ||
313 fid_seq_is_root(seq) || fid_seq_is_dot(seq);
316 static inline void lu_last_id_fid(struct lu_fid *fid, __u64 seq, __u32 ost_idx)
318 if (fid_seq_is_mdt0(seq)) {
319 fid->f_seq = fid_idif_seq(0, ost_idx);
321 LASSERTF(fid_seq_is_norm(seq) || fid_seq_is_echo(seq) ||
322 fid_seq_is_idif(seq), LPX64"\n", seq);
329 static inline bool fid_is_md_operative(const struct lu_fid *fid)
331 return fid_is_mdt0(fid) || fid_is_igif(fid) ||
332 fid_is_norm(fid) || fid_is_root(fid);
335 /* seq client type */
337 LUSTRE_SEQ_METADATA = 1,
343 LUSTRE_SEQ_CONTROLLER
346 struct lu_server_seq;
348 /* Client sequence manager interface. */
349 struct lu_client_seq {
350 /* Sequence-controller export. */
351 struct obd_export *lcs_exp;
352 struct mutex lcs_mutex;
355 * Range of allowed for allocation sequeces. When using lu_client_seq on
356 * clients, this contains meta-sequence range. And for servers this
357 * contains super-sequence range.
359 struct lu_seq_range lcs_space;
361 /* Seq related proc */
362 struct proc_dir_entry *lcs_proc_dir;
364 /* This holds last allocated fid in last obtained seq */
365 struct lu_fid lcs_fid;
367 /* LUSTRE_SEQ_METADATA or LUSTRE_SEQ_DATA */
368 enum lu_cli_type lcs_type;
371 * Service uuid, passed from MDT + seq name to form unique seq name to
372 * use it with procfs.
377 * Sequence width, that is how many objects may be allocated in one
378 * sequence. Default value for it is LUSTRE_SEQ_MAX_WIDTH.
382 /* Seq-server for direct talking */
383 struct lu_server_seq *lcs_srv;
385 /* wait queue for fid allocation and update indicator */
386 wait_queue_head_t lcs_waitq;
390 /* server sequence manager interface */
391 struct lu_server_seq {
392 /* Available sequences space */
393 struct lu_seq_range lss_space;
395 /* keeps highwater in lsr_end for seq allocation algorithm */
396 struct lu_seq_range lss_lowater_set;
397 struct lu_seq_range lss_hiwater_set;
400 * Device for server side seq manager needs (saving sequences to backing
403 struct dt_device *lss_dev;
405 /* /seq file object device */
406 struct dt_object *lss_obj;
408 /* Seq related proc */
409 struct proc_dir_entry *lss_proc_dir;
411 /* LUSTRE_SEQ_SERVER or LUSTRE_SEQ_CONTROLLER */
412 enum lu_mgr_type lss_type;
414 /* Client interafce to request controller */
415 struct lu_client_seq *lss_cli;
417 /* Mutex for protecting allocation */
418 struct mutex lss_mutex;
421 * Service uuid, passed from MDT + seq name to form unique seq name to
422 * use it with procfs.
427 * Allocation chunks for super and meta sequences. Default values are
428 * LUSTRE_SEQ_SUPER_WIDTH and LUSTRE_SEQ_META_WIDTH.
433 * minimum lss_alloc_set size that should be allocated from
438 /* sync is needed for update operation */
442 * Pointer to site object, required to access site fld.
444 struct seq_server_site *lss_site;
449 int seq_server_init(const struct lu_env *env,
450 struct lu_server_seq *seq,
451 struct dt_device *dev,
453 enum lu_mgr_type type,
454 struct seq_server_site *ss);
456 void seq_server_fini(struct lu_server_seq *seq,
457 const struct lu_env *env);
459 int seq_server_alloc_super(struct lu_server_seq *seq,
460 struct lu_seq_range *out,
461 const struct lu_env *env);
463 int seq_server_alloc_meta(struct lu_server_seq *seq,
464 struct lu_seq_range *out,
465 const struct lu_env *env);
467 int seq_server_set_cli(const struct lu_env *env,
468 struct lu_server_seq *seq,
469 struct lu_client_seq *cli);
472 int seq_client_init(struct lu_client_seq *seq,
473 struct obd_export *exp,
474 enum lu_cli_type type,
476 struct lu_server_seq *srv);
478 void seq_client_fini(struct lu_client_seq *seq);
480 void seq_client_flush(struct lu_client_seq *seq);
482 int seq_client_alloc_fid(const struct lu_env *env, struct lu_client_seq *seq,
484 int seq_client_get_seq(const struct lu_env *env, struct lu_client_seq *seq,
486 int seq_site_fini(const struct lu_env *env, struct seq_server_site *ss);
487 /* Fids common stuff */
488 int fid_is_local(const struct lu_env *env,
489 struct lu_site *site, const struct lu_fid *fid);
492 int client_fid_init(struct obd_device *obd, struct obd_export *exp,
493 enum lu_cli_type type);
494 int client_fid_fini(struct obd_device *obd);
498 struct ldlm_namespace;
501 * Build (DLM) resource name from FID.
503 * NOTE: until Lustre 1.8.7/2.1.1 the fid_ver() was packed into name[2],
504 * but was moved into name[1] along with the OID to avoid consuming the
505 * renaming name[2,3] fields that need to be used for the quota identifier.
508 fid_build_reg_res_name(const struct lu_fid *fid, struct ldlm_res_id *res)
510 memset(res, 0, sizeof(*res));
511 res->name[LUSTRE_RES_ID_SEQ_OFF] = fid_seq(fid);
512 res->name[LUSTRE_RES_ID_VER_OID_OFF] = fid_ver_oid(fid);
516 * Return true if resource is for object identified by FID.
518 static inline int fid_res_name_eq(const struct lu_fid *fid,
519 const struct ldlm_res_id *res)
521 return res->name[LUSTRE_RES_ID_SEQ_OFF] == fid_seq(fid) &&
522 res->name[LUSTRE_RES_ID_VER_OID_OFF] == fid_ver_oid(fid);
526 * Extract FID from LDLM resource. Reverse of fid_build_reg_res_name().
529 fid_extract_from_res_name(struct lu_fid *fid, const struct ldlm_res_id *res)
531 fid->f_seq = res->name[LUSTRE_RES_ID_SEQ_OFF];
532 fid->f_oid = (__u32)(res->name[LUSTRE_RES_ID_VER_OID_OFF]);
533 fid->f_ver = (__u32)(res->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
534 LASSERT(fid_res_name_eq(fid, res));
538 * Build (DLM) resource identifier from global quota FID and quota ID.
541 fid_build_quota_res_name(const struct lu_fid *glb_fid, union lquota_id *qid,
542 struct ldlm_res_id *res)
544 fid_build_reg_res_name(glb_fid, res);
545 res->name[LUSTRE_RES_ID_QUOTA_SEQ_OFF] = fid_seq(&qid->qid_fid);
546 res->name[LUSTRE_RES_ID_QUOTA_VER_OID_OFF] = fid_ver_oid(&qid->qid_fid);
550 * Extract global FID and quota ID from resource name
552 static inline void fid_extract_from_quota_res(struct lu_fid *glb_fid,
553 union lquota_id *qid,
554 const struct ldlm_res_id *res)
556 fid_extract_from_res_name(glb_fid, res);
557 qid->qid_fid.f_seq = res->name[LUSTRE_RES_ID_QUOTA_SEQ_OFF];
558 qid->qid_fid.f_oid = (__u32)res->name[LUSTRE_RES_ID_QUOTA_VER_OID_OFF];
560 (__u32)(res->name[LUSTRE_RES_ID_QUOTA_VER_OID_OFF] >> 32);
564 fid_build_pdo_res_name(const struct lu_fid *fid, unsigned int hash,
565 struct ldlm_res_id *res)
567 fid_build_reg_res_name(fid, res);
568 res->name[LUSTRE_RES_ID_HSH_OFF] = hash;
572 * Build DLM resource name from object id & seq, which will be removed
573 * finally, when we replace ost_id with FID in data stack.
575 * Currently, resid from the old client, whose res[0] = object_id,
576 * res[1] = object_seq, is just oposite with Metatdata
577 * resid, where, res[0] = fid->f_seq, res[1] = fid->f_oid.
578 * To unifiy the resid identification, we will reverse the data
579 * resid to keep it same with Metadata resid, i.e.
581 * For resid from the old client,
582 * res[0] = objid, res[1] = 0, still keep the original order,
586 * res will be built from normal FID directly, i.e. res[0] = f_seq,
587 * res[1] = f_oid + f_ver.
589 static inline void ostid_build_res_name(const struct ost_id *oi,
590 struct ldlm_res_id *name)
592 memset(name, 0, sizeof *name);
593 if (fid_seq_is_mdt0(ostid_seq(oi))) {
594 name->name[LUSTRE_RES_ID_SEQ_OFF] = ostid_id(oi);
595 name->name[LUSTRE_RES_ID_VER_OID_OFF] = ostid_seq(oi);
597 fid_build_reg_res_name(&oi->oi_fid, name);
602 * Return true if the resource is for the object identified by this id & group.
604 static inline bool ostid_res_name_eq(const struct ost_id *oi,
605 const struct ldlm_res_id *name)
607 /* Note: it is just a trick here to save some effort, probably the
608 * correct way would be turn them into the FID and compare */
609 if (fid_seq_is_mdt0(ostid_seq(oi))) {
610 return name->name[LUSTRE_RES_ID_SEQ_OFF] == ostid_id(oi) &&
611 name->name[LUSTRE_RES_ID_VER_OID_OFF] == ostid_seq(oi);
613 return name->name[LUSTRE_RES_ID_SEQ_OFF] == ostid_seq(oi) &&
614 name->name[LUSTRE_RES_ID_VER_OID_OFF] == ostid_id(oi);
618 /* The same as osc_build_res_name() */
619 static inline void ost_fid_build_resid(const struct lu_fid *fid,
620 struct ldlm_res_id *resname)
622 if (fid_is_mdt0(fid) || fid_is_idif(fid)) {
624 oi.oi.oi_id = 0; /* gcc 4.7.2 complains otherwise */
625 if (fid_to_ostid(fid, &oi) != 0)
627 ostid_build_res_name(&oi, resname);
629 fid_build_reg_res_name(fid, resname);
633 static inline void ost_fid_from_resid(struct lu_fid *fid,
634 const struct ldlm_res_id *name,
637 if (fid_seq_is_mdt0(name->name[LUSTRE_RES_ID_VER_OID_OFF])) {
640 ostid_set_seq(&oi, name->name[LUSTRE_RES_ID_VER_OID_OFF]);
641 ostid_set_id(&oi, name->name[LUSTRE_RES_ID_SEQ_OFF]);
642 ostid_to_fid(fid, &oi, ost_idx);
645 fid_extract_from_res_name(fid, name);
650 * Flatten 128-bit FID values into a 64-bit value for use as an inode number.
651 * For non-IGIF FIDs this starts just over 2^32, and continues without
652 * conflict until 2^64, at which point we wrap the high 24 bits of the SEQ
653 * into the range where there may not be many OID values in use, to minimize
654 * the risk of conflict.
656 * Suppose LUSTRE_SEQ_MAX_WIDTH less than (1 << 24) which is currently true,
657 * the time between re-used inode numbers is very long - 2^40 SEQ numbers,
658 * or about 2^40 client mounts, if clients create less than 2^24 files/mount.
660 static inline __u64 fid_flatten(const struct lu_fid *fid)
665 if (fid_is_igif(fid)) {
666 ino = lu_igif_ino(fid);
672 ino = (seq << 24) + ((seq >> 24) & 0xffffff0000ULL) + fid_oid(fid);
674 RETURN(ino ? ino : fid_oid(fid));
677 static inline __u32 fid_hash(const struct lu_fid *f, int bits)
679 /* all objects with same id and different versions will belong to same
680 * collisions list. */
681 return hash_long(fid_flatten(f), bits);
685 * map fid to 32 bit value for ino on 32bit systems. */
686 static inline __u32 fid_flatten32(const struct lu_fid *fid)
691 if (fid_is_igif(fid)) {
692 ino = lu_igif_ino(fid);
696 seq = fid_seq(fid) - FID_SEQ_START;
698 /* Map the high bits of the OID into higher bits of the inode number so
699 * that inodes generated at about the same time have a reduced chance
700 * of collisions. This will give a period of 2^12 = 1024 unique clients
701 * (from SEQ) and up to min(LUSTRE_SEQ_MAX_WIDTH, 2^20) = 128k objects
702 * (from OID), or up to 128M inodes without collisions for new files. */
703 ino = ((seq & 0x000fffffULL) << 12) + ((seq >> 8) & 0xfffff000) +
704 (seq >> (64 - (40-8)) & 0xffffff00) +
705 (fid_oid(fid) & 0xff000fff) + ((fid_oid(fid) & 0x00fff000) << 8);
707 RETURN(ino ? ino : fid_oid(fid));
711 lu_fid_diff(const struct lu_fid *fid1, const struct lu_fid *fid2)
713 LASSERTF(fid_seq(fid1) == fid_seq(fid2), "fid1:"DFID", fid2:"DFID"\n",
714 PFID(fid1), PFID(fid2));
716 if (fid_is_idif(fid1) && fid_is_idif(fid2))
717 return fid_idif_id(fid1->f_seq, fid1->f_oid, fid1->f_ver) -
718 fid_idif_id(fid2->f_seq, fid2->f_oid, fid2->f_ver);
720 return fid_oid(fid1) - fid_oid(fid2);
723 #define LUSTRE_SEQ_SRV_NAME "seq_srv"
724 #define LUSTRE_SEQ_CTL_NAME "seq_ctl"
726 /* Range common stuff */
728 range_cpu_to_le(struct lu_seq_range *dst, const struct lu_seq_range *src)
730 dst->lsr_start = cpu_to_le64(src->lsr_start);
731 dst->lsr_end = cpu_to_le64(src->lsr_end);
732 dst->lsr_index = cpu_to_le32(src->lsr_index);
733 dst->lsr_flags = cpu_to_le32(src->lsr_flags);
737 range_le_to_cpu(struct lu_seq_range *dst, const struct lu_seq_range *src)
739 dst->lsr_start = le64_to_cpu(src->lsr_start);
740 dst->lsr_end = le64_to_cpu(src->lsr_end);
741 dst->lsr_index = le32_to_cpu(src->lsr_index);
742 dst->lsr_flags = le32_to_cpu(src->lsr_flags);
746 range_cpu_to_be(struct lu_seq_range *dst, const struct lu_seq_range *src)
748 dst->lsr_start = cpu_to_be64(src->lsr_start);
749 dst->lsr_end = cpu_to_be64(src->lsr_end);
750 dst->lsr_index = cpu_to_be32(src->lsr_index);
751 dst->lsr_flags = cpu_to_be32(src->lsr_flags);
755 range_be_to_cpu(struct lu_seq_range *dst, const struct lu_seq_range *src)
757 dst->lsr_start = be64_to_cpu(src->lsr_start);
758 dst->lsr_end = be64_to_cpu(src->lsr_end);
759 dst->lsr_index = be32_to_cpu(src->lsr_index);
760 dst->lsr_flags = be32_to_cpu(src->lsr_flags);
763 static inline void range_array_cpu_to_le(struct lu_seq_range_array *dst,
764 const struct lu_seq_range_array *src)
768 for (i = 0; i < src->lsra_count; i++)
769 range_cpu_to_le(&dst->lsra_lsr[i], &src->lsra_lsr[i]);
771 dst->lsra_count = cpu_to_le32(src->lsra_count);
774 static inline void range_array_le_to_cpu(struct lu_seq_range_array *dst,
775 const struct lu_seq_range_array *src)
779 dst->lsra_count = le32_to_cpu(src->lsra_count);
780 for (i = 0; i < dst->lsra_count; i++)
781 range_le_to_cpu(&dst->lsra_lsr[i], &src->lsra_lsr[i]);
786 #endif /* __LUSTRE_FID_H */