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.
28 * Copyright 2016 Cray Inc, all rights reserved.
31 * all fid manipulation functions go here
33 * FIDS are globally unique within a Lustre filessytem, and are made up
34 * of three parts: sequence, Object ID, and version.
37 #ifndef _UAPI_LUSTRE_FID_H_
38 #define _UAPI_LUSTRE_FID_H_
40 #include <linux/types.h>
41 #include <linux/lustre/lustre_idl.h>
43 /** Special fid for root directory */
44 static const struct lu_fid LU_ROOT_FID = {
45 .f_seq = FID_SEQ_ROOT,
46 .f_oid = FID_OID_ROOT,
47 .f_ver = 0x0000000000000000
50 /** Special fid for ".lustre" directory */
51 static const struct lu_fid LU_DOT_LUSTRE_FID = {
52 .f_seq = FID_SEQ_DOT_LUSTRE,
53 .f_oid = FID_OID_DOT_LUSTRE,
54 .f_ver = 0x0000000000000000
57 /** Special fid for "fid" special object in .lustre */
58 static const struct lu_fid LU_OBF_FID = {
59 .f_seq = FID_SEQ_DOT_LUSTRE,
60 .f_oid = FID_OID_DOT_LUSTRE_OBF,
61 .f_ver = 0x0000000000000000
64 /** returns fid object sequence */
65 static inline __u64 fid_seq(const struct lu_fid *fid)
70 /** returns fid object id */
71 static inline __u32 fid_oid(const struct lu_fid *fid)
76 /** returns fid object version */
77 static inline __u32 fid_ver(const struct lu_fid *fid)
82 static inline void fid_zero(struct lu_fid *fid)
84 memset(fid, 0, sizeof(*fid));
87 static inline __u64 fid_ver_oid(const struct lu_fid *fid)
89 return (__u64)fid_ver(fid) << 32 | fid_oid(fid);
92 static inline bool fid_seq_is_mdt0(__u64 seq)
94 return seq == FID_SEQ_OST_MDT0;
97 static inline bool fid_seq_is_mdt(__u64 seq)
99 return seq == FID_SEQ_OST_MDT0 || seq >= FID_SEQ_NORMAL;
102 static inline bool fid_seq_is_echo(__u64 seq)
104 return seq == FID_SEQ_ECHO;
107 static inline bool fid_is_echo(const struct lu_fid *fid)
109 return fid_seq_is_echo(fid_seq(fid));
112 static inline bool fid_seq_is_llog(__u64 seq)
114 return seq == FID_SEQ_LLOG;
117 static inline bool fid_is_llog(const struct lu_fid *fid)
119 /* file with OID == 0 is not llog but contains last oid */
120 return fid_seq_is_llog(fid_seq(fid)) && fid_oid(fid) > 0;
123 static inline bool fid_seq_is_rsvd(__u64 seq)
125 return seq > FID_SEQ_OST_MDT0 && seq <= FID_SEQ_RSVD;
128 static inline bool fid_seq_is_special(__u64 seq)
130 return seq == FID_SEQ_SPECIAL;
133 static inline bool fid_seq_is_local_file(__u64 seq)
135 return seq == FID_SEQ_LOCAL_FILE ||
136 seq == FID_SEQ_LOCAL_NAME;
139 static inline bool fid_seq_is_root(__u64 seq)
141 return seq == FID_SEQ_ROOT;
144 static inline bool fid_seq_is_dot(__u64 seq)
146 return seq == FID_SEQ_DOT_LUSTRE;
149 static inline bool fid_seq_is_default(__u64 seq)
151 return seq == FID_SEQ_LOV_DEFAULT;
154 static inline bool fid_is_mdt0(const struct lu_fid *fid)
156 return fid_seq_is_mdt0(fid_seq(fid));
159 static inline void lu_root_fid(struct lu_fid *fid)
161 fid->f_seq = FID_SEQ_ROOT;
162 fid->f_oid = FID_OID_ROOT;
166 static inline void lu_echo_root_fid(struct lu_fid *fid)
168 fid->f_seq = FID_SEQ_ROOT;
169 fid->f_oid = FID_OID_ECHO_ROOT;
173 static inline void lu_update_log_fid(struct lu_fid *fid, __u32 index)
175 fid->f_seq = FID_SEQ_UPDATE_LOG;
180 static inline void lu_update_log_dir_fid(struct lu_fid *fid, __u32 index)
182 fid->f_seq = FID_SEQ_UPDATE_LOG_DIR;
188 * Check if a fid is igif or not.
189 * \param fid the fid to be tested.
190 * \return true if the fid is an igif; otherwise false.
192 static inline bool fid_seq_is_igif(__u64 seq)
194 return seq >= FID_SEQ_IGIF && seq <= FID_SEQ_IGIF_MAX;
197 static inline bool fid_is_igif(const struct lu_fid *fid)
199 return fid_seq_is_igif(fid_seq(fid));
203 * Check if a fid is idif or not.
204 * \param fid the fid to be tested.
205 * \return true if the fid is an idif; otherwise false.
207 static inline bool fid_seq_is_idif(__u64 seq)
209 return seq >= FID_SEQ_IDIF && seq <= FID_SEQ_IDIF_MAX;
212 static inline bool fid_is_idif(const struct lu_fid *fid)
214 return fid_seq_is_idif(fid_seq(fid));
217 static inline bool fid_is_local_file(const struct lu_fid *fid)
219 return fid_seq_is_local_file(fid_seq(fid));
222 static inline bool fid_seq_is_norm(__u64 seq)
224 return (seq >= FID_SEQ_NORMAL);
227 static inline bool fid_is_norm(const struct lu_fid *fid)
229 return fid_seq_is_norm(fid_seq(fid));
232 static inline int fid_is_layout_rbtree(const struct lu_fid *fid)
234 return fid_seq(fid) == FID_SEQ_LAYOUT_RBTREE;
237 static inline bool fid_seq_is_update_log(__u64 seq)
239 return seq == FID_SEQ_UPDATE_LOG;
242 static inline bool fid_is_update_log(const struct lu_fid *fid)
244 return fid_seq_is_update_log(fid_seq(fid));
247 static inline bool fid_seq_is_update_log_dir(__u64 seq)
249 return seq == FID_SEQ_UPDATE_LOG_DIR;
252 static inline bool fid_is_update_log_dir(const struct lu_fid *fid)
254 return fid_seq_is_update_log_dir(fid_seq(fid));
257 /* convert an OST objid into an IDIF FID SEQ number */
258 static inline __u64 fid_idif_seq(__u64 id, __u32 ost_idx)
260 return FID_SEQ_IDIF | (ost_idx << 16) | ((id >> 32) & 0xffff);
263 /* convert a packed IDIF FID into an OST objid */
264 static inline __u64 fid_idif_id(__u64 seq, __u32 oid, __u32 ver)
266 return ((__u64)ver << 48) | ((seq & 0xffff) << 32) | oid;
269 static inline __u32 idif_ost_idx(__u64 seq)
271 return (seq >> 16) & 0xffff;
274 /* extract ost index from IDIF FID */
275 static inline __u32 fid_idif_ost_idx(const struct lu_fid *fid)
277 return idif_ost_idx(fid_seq(fid));
280 /* Check whether the fid is for LAST_ID */
281 static inline bool fid_is_last_id(const struct lu_fid *fid)
283 if (fid_oid(fid) != 0)
286 if (fid_is_idif(fid) && ((fid_seq(fid) & 0xFFFF) != 0))
289 if (fid_seq(fid) == FID_SEQ_UPDATE_LOG ||
290 fid_seq(fid) == FID_SEQ_UPDATE_LOG_DIR ||
291 fid_seq_is_igif(fid_seq(fid)))
298 * Get inode number from an igif.
299 * \param fid an igif to get inode number from.
300 * \return inode number for the igif.
302 static inline __kernel_ino_t lu_igif_ino(const struct lu_fid *fid)
308 * Get inode generation from an igif.
309 * \param fid an igif to get inode generation from.
310 * \return inode generation for the igif.
312 static inline __u32 lu_igif_gen(const struct lu_fid *fid)
318 * Build igif from the inode number/generation.
320 static inline void lu_igif_build(struct lu_fid *fid, __u32 ino, __u32 gen)
328 * Fids are transmitted across network (in the sender byte-ordering),
329 * and stored on disk in big-endian order.
331 static inline void fid_cpu_to_le(struct lu_fid *dst, const struct lu_fid *src)
333 dst->f_seq = __cpu_to_le64(fid_seq(src));
334 dst->f_oid = __cpu_to_le32(fid_oid(src));
335 dst->f_ver = __cpu_to_le32(fid_ver(src));
338 static inline void fid_le_to_cpu(struct lu_fid *dst, const struct lu_fid *src)
340 dst->f_seq = __le64_to_cpu(fid_seq(src));
341 dst->f_oid = __le32_to_cpu(fid_oid(src));
342 dst->f_ver = __le32_to_cpu(fid_ver(src));
345 static inline void fid_cpu_to_be(struct lu_fid *dst, const struct lu_fid *src)
347 dst->f_seq = __cpu_to_be64(fid_seq(src));
348 dst->f_oid = __cpu_to_be32(fid_oid(src));
349 dst->f_ver = __cpu_to_be32(fid_ver(src));
352 static inline void fid_be_to_cpu(struct lu_fid *dst, const struct lu_fid *src)
354 dst->f_seq = __be64_to_cpu(fid_seq(src));
355 dst->f_oid = __be32_to_cpu(fid_oid(src));
356 dst->f_ver = __be32_to_cpu(fid_ver(src));
359 static inline bool fid_is_sane(const struct lu_fid *fid)
361 return fid && ((fid_seq(fid) >= FID_SEQ_START && !fid_ver(fid)) ||
362 fid_is_igif(fid) || fid_is_idif(fid) ||
363 fid_seq_is_rsvd(fid_seq(fid)));
366 static inline bool lu_fid_eq(const struct lu_fid *f0, const struct lu_fid *f1)
368 return !memcmp(f0, f1, sizeof(*f0));
371 static inline int lu_fid_cmp(const struct lu_fid *f0,
372 const struct lu_fid *f1)
374 if (fid_seq(f0) != fid_seq(f1))
375 return fid_seq(f0) > fid_seq(f1) ? 1 : -1;
377 if (fid_oid(f0) != fid_oid(f1))
378 return fid_oid(f0) > fid_oid(f1) ? 1 : -1;
380 if (fid_ver(f0) != fid_ver(f1))
381 return fid_ver(f0) > fid_ver(f1) ? 1 : -1;
387 * Flatten 128-bit FID values into a 64-bit value for use as an inode number.
388 * For non-IGIF FIDs this starts just over 2^32, and continues without
389 * conflict until 2^64, at which point we wrap the high 24 bits of the SEQ
390 * into the range where there may not be many OID values in use, to minimize
391 * the risk of conflict.
393 * Suppose LUSTRE_SEQ_MAX_WIDTH less than (1 << 24) which is currently true,
394 * the time between re-used inode numbers is very long - 2^40 SEQ numbers,
395 * or about 2^40 client mounts, if clients create less than 2^24 files/mount.
397 static inline __u64 fid_flatten64(const struct lu_fid *fid)
402 if (fid_is_igif(fid)) {
403 ino = lu_igif_ino(fid);
409 ino = (seq << 24) + ((seq >> 24) & 0xffffff0000ULL) + fid_oid(fid);
411 return ino ?: fid_oid(fid);
415 * map fid to 32 bit value for ino on 32bit systems.
417 static inline __u32 fid_flatten32(const struct lu_fid *fid)
422 if (fid_is_igif(fid)) {
423 ino = lu_igif_ino(fid);
427 seq = fid_seq(fid) - FID_SEQ_START;
429 /* Map the high bits of the OID into higher bits of the inode number so
430 * that inodes generated at about the same time have a reduced chance
431 * of collisions. This will give a period of 2^12 = 1024 unique clients
432 * (from SEQ) and up to min(LUSTRE_SEQ_MAX_WIDTH, 2^20) = 128k objects
433 * (from OID), or up to 128M inodes without collisions for new files.
435 ino = ((seq & 0x000fffffULL) << 12) + ((seq >> 8) & 0xfffff000) +
436 (seq >> (64 - (40-8)) & 0xffffff00) +
437 (fid_oid(fid) & 0xff000fff) + ((fid_oid(fid) & 0x00fff000) << 8);
439 return ino ?: fid_oid(fid);
442 #if __BITS_PER_LONG == 32
443 #define fid_flatten_long fid_flatten32
444 #elif __BITS_PER_LONG == 64
445 #define fid_flatten_long fid_flatten64
447 #error "Wordsize not 32 or 64"