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, 2015, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * lustre/include/lustre_fid.h
34 * Author: Yury Umanets <umka@clusterfs.com>
37 #ifndef __LUSTRE_FID_H
38 #define __LUSTRE_FID_H
44 * http://wiki.lustre.org/index.php/Architecture_-_Interoperability_fids_zfs
45 * describes the FID namespace and interoperability requirements for FIDs.
46 * The important parts of that document are included here for reference.
49 * File IDentifier generated by client from range allocated by the SEQuence
50 * service and stored in struct lu_fid. The FID is composed of three parts:
51 * SEQuence, ObjectID, and VERsion. The SEQ component is a filesystem
52 * unique 64-bit integer, and only one client is ever assigned any SEQ value.
53 * The first 0x400 FID_SEQ_NORMAL [2^33, 2^33 + 0x400] values are reserved
54 * for system use. The OID component is a 32-bit value generated by the
55 * client on a per-SEQ basis to allow creating many unique FIDs without
56 * communication with the server. The VER component is a 32-bit value that
57 * distinguishes between different FID instantiations, such as snapshots or
58 * separate subtrees within the filesystem. FIDs with the same VER field
59 * are considered part of the same namespace.
61 * OLD filesystems are those upgraded from Lustre 1.x that predate FIDs, and
62 * MDTs use 32-bit ldiskfs internal inode/generation numbers (IGIFs), while
63 * OSTs use 64-bit Lustre object IDs and generation numbers.
65 * NEW filesystems are those formatted since the introduction of FIDs.
68 * Inode and Generation In FID, a surrogate FID used to globally identify
69 * an existing object on OLD formatted MDT file system. This would only be
70 * used on MDT0 in a DNE filesystem, because there cannot be more than one
71 * MDT in an OLD formatted filesystem. Belongs to sequence in [12, 2^32 - 1]
72 * range, where inode number is stored in SEQ, and inode generation is in OID.
73 * NOTE: This assumes no more than 2^32-1 inodes exist in the MDT filesystem,
74 * which is the maximum possible for an ldiskfs backend. It also assumes
75 * that the reserved ext3/ext4/ldiskfs inode numbers [0-11] are never visible
76 * to clients, which has always been true.
79 * object ID In FID, a surrogate FID used to globally identify an existing
80 * OST object on OLD formatted OST file system. Belongs to a sequence in
81 * [2^32, 2^33 - 1]. Sequence number is calculated as:
83 * 1 << 32 | (ost_index << 16) | ((objid >> 32) & 0xffff)
85 * that is, SEQ consists of 16-bit OST index, and higher 16 bits of object
86 * ID. The generation of unique SEQ values per OST allows the IDIF FIDs to
87 * be identified in the FLD correctly. The OID field is calculated as:
91 * that is, it consists of lower 32 bits of object ID. For objects within
92 * the IDIF range, object ID extraction will be:
94 * o_id = (fid->f_seq & 0x7fff) << 16 | fid->f_oid;
95 * o_seq = 0; // formerly group number
97 * NOTE: This assumes that no more than 2^48-1 objects have ever been created
98 * on any OST, and that no more than 65535 OSTs are in use. Both are very
99 * reasonable assumptions, i.e. an IDIF can uniquely map all objects assuming
100 * a maximum creation rate of 1M objects per second for a maximum of 9 years,
101 * or combinations thereof.
104 * Surrogate FID used to identify an existing object on OLD formatted OST
105 * filesystem. Belongs to the reserved SEQuence 0, and is used prior to
106 * the introduction of FID-on-OST, at which point IDIF will be used to
107 * identify objects as residing on a specific OST.
110 * For Lustre Log objects the object sequence 1 is used. This is compatible
111 * with both OLD and NEW namespaces, as this SEQ number is in the
112 * ext3/ldiskfs reserved inode range and does not conflict with IGIF
116 * For testing OST IO performance the object sequence 2 is used. This is
117 * compatible with both OLD and NEW namespaces, as this SEQ number is in
118 * the ext3/ldiskfs reserved inode range and does not conflict with IGIF
121 * OST_MDT1 .. OST_MAX
122 * For testing with multiple MDTs the object sequence 3 through 9 is used,
123 * allowing direct mapping of MDTs 1 through 7 respectively, for a total
124 * of 8 MDTs including OST_MDT0. This matches the legacy CMD project "group"
125 * mappings. However, this SEQ range is only for testing prior to any
126 * production DNE release, as the objects in this range conflict across all
127 * OSTs, as the OST index is not part of the FID. For production DNE usage,
128 * OST objects created by MDT1+ will use FID_SEQ_NORMAL FIDs.
130 * DLM OST objid to IDIF mapping
131 * For compatibility with existing OLD OST network protocol structures, the
132 * FID must map onto the o_id and o_seq in a manner that ensures existing
133 * objects are identified consistently for IO, as well as onto the LDLM
134 * namespace to ensure IDIFs there is only a single resource name for any
135 * object in the DLM. The OLD OST object DLM resource mapping is:
137 * resource[] = {o_id, o_seq, 0, 0}; // o_seq == 0 for production releases
139 * The NEW OST object DLM resource mapping is the same for both MDT and OST:
141 * resource[] = {SEQ, OID, VER, HASH};
143 * NOTE: for mapping IDIF values to DLM resource names the o_id may be
144 * larger than the 2^33 reserved sequence numbers for IDIF, so it is possible
145 * for the o_id numbers to overlap FID SEQ numbers in the resource. However,
146 * in all production releases the OLD o_seq field is always zero, and all
147 * valid FID OID values are non-zero, so the lock resources will not collide.
148 * Even so, the MDT and OST resources are also in different LDLM namespaces.
151 #include <linux/libcfs/libcfs.h>
152 #include <uapi/linux/lustre/lustre_fid.h>
153 #include <uapi/linux/lustre/lustre_idl.h>
154 #include <uapi/linux/lustre/lustre_ostid.h>
162 /* Whole sequences space range and zero range definitions */
163 extern const struct lu_seq_range LUSTRE_SEQ_SPACE_RANGE;
164 extern const struct lu_seq_range LUSTRE_SEQ_ZERO_RANGE;
165 extern const struct lu_fid LUSTRE_BFL_FID;
166 extern const struct lu_fid LU_OBF_FID;
167 extern const struct lu_fid LU_DOT_LUSTRE_FID;
171 * This is how may metadata FIDs may be allocated in one sequence(128k)
173 LUSTRE_METADATA_SEQ_MAX_WIDTH = 0x0000000000020000ULL,
176 * This is how many data FIDs could be allocated in one sequence(4B - 1)
178 LUSTRE_DATA_SEQ_MAX_WIDTH = 0x00000000FFFFFFFFULL,
181 * How many sequences to allocate to a client at once.
183 LUSTRE_SEQ_META_WIDTH = 0x0000000000000001ULL,
186 * seq allocation pool size.
188 LUSTRE_SEQ_BATCH_WIDTH = LUSTRE_SEQ_META_WIDTH * 1000,
191 * This is how many sequences may be in one super-sequence allocated to
194 LUSTRE_SEQ_SUPER_WIDTH = ((1ULL << 30ULL) * LUSTRE_SEQ_META_WIDTH)
198 /** 2^6 FIDs for OI containers */
199 OSD_OI_FID_OID_BITS = 6,
200 /** reserve enough FIDs in case we want more in the future */
201 OSD_OI_FID_OID_BITS_MAX = 10,
204 /** special OID for local objects */
206 /** \see fld_mod_init */
208 /** \see fid_mod_init */
209 FID_SEQ_CTL_OID = 4UL,
210 FID_SEQ_SRV_OID = 5UL,
211 /** \see mdd_mod_init */
212 MDD_ROOT_INDEX_OID = 6UL, /* deprecated in 2.4 */
213 MDD_ORPHAN_OID = 7UL, /* deprecated in 2.4 */
214 MDD_LOV_OBJ_OID = 8UL,
215 MDD_CAPA_KEYS_OID = 9UL,
216 /** \see mdt_mod_init */
217 LAST_RECV_OID = 11UL,
218 OSD_FS_ROOT_OID = 13UL,
219 ACCT_USER_OID = 15UL,
220 ACCT_GROUP_OID = 16UL,
221 LFSCK_BOOKMARK_OID = 17UL,
222 OTABLE_IT_OID = 18UL,
223 /* These two definitions are obsolete
224 * OFD_GROUP0_LAST_OID = 20UL,
225 * OFD_GROUP4K_LAST_OID = 20UL+4096,
227 OFD_LAST_GROUP_OID = 4117UL,
228 LLOG_CATALOGS_OID = 4118UL,
229 MGS_CONFIGS_OID = 4119UL,
230 OFD_HEALTH_CHECK_OID = 4120UL,
231 MDD_LOV_OBJ_OSEQ = 4121UL,
232 LFSCK_NAMESPACE_OID = 4122UL,
233 REMOTE_PARENT_DIR_OID = 4123UL,
234 SLAVE_LLOG_CATALOGS_OID = 4124UL,
237 static inline void lu_local_obj_fid(struct lu_fid *fid, __u32 oid)
239 fid->f_seq = FID_SEQ_LOCAL_FILE;
244 static inline void lu_local_name_obj_fid(struct lu_fid *fid, __u32 oid)
246 fid->f_seq = FID_SEQ_LOCAL_NAME;
251 /* For new FS (>= 2.4), the root FID will be changed to
252 * [FID_SEQ_ROOT:1:0], for existing FS, (upgraded to 2.4),
253 * the root FID will still be IGIF
255 static inline int fid_is_root(const struct lu_fid *fid)
257 return unlikely((fid_seq(fid) == FID_SEQ_ROOT &&
261 static inline int fid_is_dot_lustre(const struct lu_fid *fid)
263 return unlikely(fid_seq(fid) == FID_SEQ_DOT_LUSTRE &&
264 fid_oid(fid) == FID_OID_DOT_LUSTRE);
267 static inline int fid_is_obf(const struct lu_fid *fid)
269 return unlikely(fid_seq(fid) == FID_SEQ_DOT_LUSTRE &&
270 fid_oid(fid) == FID_OID_DOT_LUSTRE_OBF);
273 static inline int fid_is_otable_it(const struct lu_fid *fid)
275 return unlikely(fid_seq(fid) == FID_SEQ_LOCAL_FILE &&
276 fid_oid(fid) == OTABLE_IT_OID);
279 static inline int fid_is_acct(const struct lu_fid *fid)
281 return fid_seq(fid) == FID_SEQ_LOCAL_FILE &&
282 (fid_oid(fid) == ACCT_USER_OID ||
283 fid_oid(fid) == ACCT_GROUP_OID);
286 static inline int fid_is_quota(const struct lu_fid *fid)
288 return fid_seq(fid) == FID_SEQ_QUOTA ||
289 fid_seq(fid) == FID_SEQ_QUOTA_GLB;
292 static inline int fid_seq_in_fldb(__u64 seq)
294 return fid_seq_is_igif(seq) || fid_seq_is_norm(seq) ||
295 fid_seq_is_root(seq) || fid_seq_is_dot(seq);
298 static inline void lu_last_id_fid(struct lu_fid *fid, __u64 seq, __u32 ost_idx)
300 if (fid_seq_is_mdt0(seq)) {
301 fid->f_seq = fid_idif_seq(0, ost_idx);
303 LASSERTF(fid_seq_is_norm(seq) || fid_seq_is_echo(seq) ||
304 fid_seq_is_idif(seq), "%#llx\n", seq);
311 /* seq client type */
313 LUSTRE_SEQ_METADATA = 1,
319 LUSTRE_SEQ_CONTROLLER
322 /* Client sequence manager interface. */
323 struct lu_client_seq {
324 /* Sequence-controller export. */
325 struct obd_export *lcs_exp;
326 struct mutex lcs_mutex;
329 * Range of allowed for allocation sequences. When using lu_client_seq on
330 * clients, this contains meta-sequence range. And for servers this
331 * contains super-sequence range.
333 struct lu_seq_range lcs_space;
335 /* Seq related proc */
336 struct dentry *lcs_debugfs_entry;
338 /* This holds last allocated fid in last obtained seq */
339 struct lu_fid lcs_fid;
341 /* LUSTRE_SEQ_METADATA or LUSTRE_SEQ_DATA */
342 enum lu_cli_type lcs_type;
345 * Service uuid, passed from MDT + seq name to form unique seq name to
346 * use it with procfs.
348 char lcs_name[LUSTRE_MDT_MAXNAMELEN];
351 * Sequence width, that is how many objects may be allocated in one
352 * sequence. Default value for it is LUSTRE_SEQ_MAX_WIDTH.
356 /* wait queue for fid allocation and update indicator */
357 wait_queue_head_t lcs_waitq;
362 void seq_client_flush(struct lu_client_seq *seq);
364 int seq_client_alloc_fid(const struct lu_env *env, struct lu_client_seq *seq,
366 /* Fids common stuff */
367 int fid_is_local(const struct lu_env *env,
368 struct lu_site *site, const struct lu_fid *fid);
371 int client_fid_init(struct obd_device *obd, struct obd_export *exp,
372 enum lu_cli_type type);
373 int client_fid_fini(struct obd_device *obd);
377 struct ldlm_namespace;
380 * Build (DLM) resource name from FID.
382 * NOTE: until Lustre 1.8.7/2.1.1 the fid_ver() was packed into name[2],
383 * but was moved into name[1] along with the OID to avoid consuming the
384 * renaming name[2,3] fields that need to be used for the quota identifier.
387 fid_build_reg_res_name(const struct lu_fid *fid, struct ldlm_res_id *res)
389 memset(res, 0, sizeof(*res));
390 res->name[LUSTRE_RES_ID_SEQ_OFF] = fid_seq(fid);
391 res->name[LUSTRE_RES_ID_VER_OID_OFF] = fid_ver_oid(fid);
395 * Return true if resource is for object identified by FID.
397 static inline bool fid_res_name_eq(const struct lu_fid *fid,
398 const struct ldlm_res_id *res)
400 return res->name[LUSTRE_RES_ID_SEQ_OFF] == fid_seq(fid) &&
401 res->name[LUSTRE_RES_ID_VER_OID_OFF] == fid_ver_oid(fid);
405 * Extract FID from LDLM resource. Reverse of fid_build_reg_res_name().
408 fid_extract_from_res_name(struct lu_fid *fid, const struct ldlm_res_id *res)
410 fid->f_seq = res->name[LUSTRE_RES_ID_SEQ_OFF];
411 fid->f_oid = (__u32)(res->name[LUSTRE_RES_ID_VER_OID_OFF]);
412 fid->f_ver = (__u32)(res->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
413 LASSERT(fid_res_name_eq(fid, res));
417 * Build (DLM) resource identifier from global quota FID and quota ID.
420 fid_build_quota_res_name(const struct lu_fid *glb_fid, union lquota_id *qid,
421 struct ldlm_res_id *res)
423 fid_build_reg_res_name(glb_fid, res);
424 res->name[LUSTRE_RES_ID_QUOTA_SEQ_OFF] = fid_seq(&qid->qid_fid);
425 res->name[LUSTRE_RES_ID_QUOTA_VER_OID_OFF] = fid_ver_oid(&qid->qid_fid);
429 * Extract global FID and quota ID from resource name
431 static inline void fid_extract_from_quota_res(struct lu_fid *glb_fid,
432 union lquota_id *qid,
433 const struct ldlm_res_id *res)
435 fid_extract_from_res_name(glb_fid, res);
436 qid->qid_fid.f_seq = res->name[LUSTRE_RES_ID_QUOTA_SEQ_OFF];
437 qid->qid_fid.f_oid = (__u32)res->name[LUSTRE_RES_ID_QUOTA_VER_OID_OFF];
439 (__u32)(res->name[LUSTRE_RES_ID_QUOTA_VER_OID_OFF] >> 32);
443 fid_build_pdo_res_name(const struct lu_fid *fid, unsigned int hash,
444 struct ldlm_res_id *res)
446 fid_build_reg_res_name(fid, res);
447 res->name[LUSTRE_RES_ID_HSH_OFF] = hash;
451 * Build DLM resource name from object id & seq, which will be removed
452 * finally, when we replace ost_id with FID in data stack.
454 * Currently, resid from the old client, whose res[0] = object_id,
455 * res[1] = object_seq, is just opposite with Metatdata
456 * resid, where, res[0] = fid->f_seq, res[1] = fid->f_oid.
457 * To unify the resid identification, we will reverse the data
458 * resid to keep it same with Metadata resid, i.e.
460 * For resid from the old client,
461 * res[0] = objid, res[1] = 0, still keep the original order,
465 * res will be built from normal FID directly, i.e. res[0] = f_seq,
466 * res[1] = f_oid + f_ver.
468 static inline void ostid_build_res_name(const struct ost_id *oi,
469 struct ldlm_res_id *name)
471 memset(name, 0, sizeof(*name));
472 if (fid_seq_is_mdt0(ostid_seq(oi))) {
473 name->name[LUSTRE_RES_ID_SEQ_OFF] = ostid_id(oi);
474 name->name[LUSTRE_RES_ID_VER_OID_OFF] = ostid_seq(oi);
476 fid_build_reg_res_name(&oi->oi_fid, name);
481 * Return true if the resource is for the object identified by this id & group.
483 static inline int ostid_res_name_eq(const struct ost_id *oi,
484 const struct ldlm_res_id *name)
486 /* Note: it is just a trick here to save some effort, probably the
487 * correct way would be turn them into the FID and compare
489 if (fid_seq_is_mdt0(ostid_seq(oi))) {
490 return name->name[LUSTRE_RES_ID_SEQ_OFF] == ostid_id(oi) &&
491 name->name[LUSTRE_RES_ID_VER_OID_OFF] == ostid_seq(oi);
493 return name->name[LUSTRE_RES_ID_SEQ_OFF] == ostid_seq(oi) &&
494 name->name[LUSTRE_RES_ID_VER_OID_OFF] == ostid_id(oi);
499 * Note: we need check oi_seq to decide where to set oi_id,
500 * so oi_seq should always be set ahead of oi_id.
502 static inline int ostid_set_id(struct ost_id *oi, __u64 oid)
504 if (fid_seq_is_mdt0(oi->oi.oi_seq)) {
505 if (oid >= IDIF_MAX_OID)
508 } else if (fid_is_idif(&oi->oi_fid)) {
509 if (oid >= IDIF_MAX_OID)
511 oi->oi_fid.f_seq = fid_idif_seq(oid,
512 fid_idif_ost_idx(&oi->oi_fid));
513 oi->oi_fid.f_oid = oid;
514 oi->oi_fid.f_ver = oid >> 48;
516 if (oid >= OBIF_MAX_OID)
518 oi->oi_fid.f_oid = oid;
523 /* pack any OST FID into an ostid (id/seq) for the wire/disk */
524 static inline int fid_to_ostid(const struct lu_fid *fid, struct ost_id *ostid)
528 if (fid_seq_is_igif(fid->f_seq))
531 if (fid_is_idif(fid)) {
532 u64 objid = fid_idif_id(fid_seq(fid), fid_oid(fid),
535 ostid_set_seq_mdt0(ostid);
536 rc = ostid_set_id(ostid, objid);
538 ostid->oi_fid = *fid;
544 /* The same as osc_build_res_name() */
545 static inline void ost_fid_build_resid(const struct lu_fid *fid,
546 struct ldlm_res_id *resname)
548 if (fid_is_mdt0(fid) || fid_is_idif(fid)) {
551 oi.oi.oi_id = 0; /* gcc 4.7.2 complains otherwise */
552 if (fid_to_ostid(fid, &oi) != 0)
554 ostid_build_res_name(&oi, resname);
556 fid_build_reg_res_name(fid, resname);
561 * Flatten 128-bit FID values into a 64-bit value for use as an inode number.
562 * For non-IGIF FIDs this starts just over 2^32, and continues without
563 * conflict until 2^64, at which point we wrap the high 24 bits of the SEQ
564 * into the range where there may not be many OID values in use, to minimize
565 * the risk of conflict.
567 * Suppose LUSTRE_SEQ_MAX_WIDTH less than (1 << 24) which is currently true,
568 * the time between re-used inode numbers is very long - 2^40 SEQ numbers,
569 * or about 2^40 client mounts, if clients create less than 2^24 files/mount.
571 static inline __u64 fid_flatten(const struct lu_fid *fid)
576 if (fid_is_igif(fid)) {
577 ino = lu_igif_ino(fid);
583 ino = (seq << 24) + ((seq >> 24) & 0xffffff0000ULL) + fid_oid(fid);
585 return ino ? ino : fid_oid(fid);
588 static inline __u32 fid_hash(const struct lu_fid *f, int bits)
590 /* all objects with same id and different versions will belong to same
593 return hash_long(fid_flatten(f), bits);
597 * map fid to 32 bit value for ino on 32bit systems.
599 static inline __u32 fid_flatten32(const struct lu_fid *fid)
604 if (fid_is_igif(fid)) {
605 ino = lu_igif_ino(fid);
609 seq = fid_seq(fid) - FID_SEQ_START;
611 /* Map the high bits of the OID into higher bits of the inode number so
612 * that inodes generated at about the same time have a reduced chance
613 * of collisions. This will give a period of 2^12 = 1024 unique clients
614 * (from SEQ) and up to min(LUSTRE_SEQ_MAX_WIDTH, 2^20) = 128k objects
615 * (from OID), or up to 128M inodes without collisions for new files.
617 ino = ((seq & 0x000fffffULL) << 12) + ((seq >> 8) & 0xfffff000) +
618 (seq >> (64 - (40 - 8)) & 0xffffff00) +
619 (fid_oid(fid) & 0xff000fff) + ((fid_oid(fid) & 0x00fff000) << 8);
621 return ino ? ino : fid_oid(fid);
624 static inline int lu_fid_diff(const struct lu_fid *fid1,
625 const struct lu_fid *fid2)
627 LASSERTF(fid_seq(fid1) == fid_seq(fid2), "fid1:" DFID ", fid2:" DFID "\n",
628 PFID(fid1), PFID(fid2));
630 if (fid_is_idif(fid1) && fid_is_idif(fid2))
631 return fid_idif_id(fid1->f_seq, fid1->f_oid, fid1->f_ver) -
632 fid_idif_id(fid2->f_seq, fid2->f_oid, fid2->f_ver);
634 return fid_oid(fid1) - fid_oid(fid2);
637 #define LUSTRE_SEQ_SRV_NAME "seq_srv"
638 #define LUSTRE_SEQ_CTL_NAME "seq_ctl"
640 /* Range common stuff */
641 static inline void range_cpu_to_le(struct lu_seq_range *dst, const struct lu_seq_range *src)
643 dst->lsr_start = cpu_to_le64(src->lsr_start);
644 dst->lsr_end = cpu_to_le64(src->lsr_end);
645 dst->lsr_index = cpu_to_le32(src->lsr_index);
646 dst->lsr_flags = cpu_to_le32(src->lsr_flags);
649 static inline void range_le_to_cpu(struct lu_seq_range *dst, const struct lu_seq_range *src)
651 dst->lsr_start = le64_to_cpu(src->lsr_start);
652 dst->lsr_end = le64_to_cpu(src->lsr_end);
653 dst->lsr_index = le32_to_cpu(src->lsr_index);
654 dst->lsr_flags = le32_to_cpu(src->lsr_flags);
657 static inline void range_cpu_to_be(struct lu_seq_range *dst, const struct lu_seq_range *src)
659 dst->lsr_start = cpu_to_be64(src->lsr_start);
660 dst->lsr_end = cpu_to_be64(src->lsr_end);
661 dst->lsr_index = cpu_to_be32(src->lsr_index);
662 dst->lsr_flags = cpu_to_be32(src->lsr_flags);
665 static inline void range_be_to_cpu(struct lu_seq_range *dst, const struct lu_seq_range *src)
667 dst->lsr_start = be64_to_cpu(src->lsr_start);
668 dst->lsr_end = be64_to_cpu(src->lsr_end);
669 dst->lsr_index = be32_to_cpu(src->lsr_index);
670 dst->lsr_flags = be32_to_cpu(src->lsr_flags);
675 #endif /* __LUSTRE_FID_H */