lustre/include/linux/lustre_compat25.h

   1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
   2  * vim:expandtab:shiftwidth=8:tabstop=8:
   3  *
   4  *  Copyright (c) 2003 Cluster File Systems, Inc.
   5  *
   6  *   This file is part of Lustre, http://www.lustre.org.
   7  *
   8  *   Lustre is free software; you can redistribute it and/or
   9  *   modify it under the terms of version 2 of the GNU General Public
  10  *   License as published by the Free Software Foundation.
  11  *
  12  *   Lustre is distributed in the hope that it will be useful,
  13  *   but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15  *   GNU General Public License for more details.
  16  *
  17  *   You should have received a copy of the GNU General Public License
  18  *   along with Lustre; if not, write to the Free Software
  19  *   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  20  *
  21  */
  22
  23 #ifndef _COMPAT25_H
  24 #define _COMPAT25_H
  25
  26 #ifdef __KERNEL__
  27
  28 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,5,0) && LINUX_VERSION_CODE < KERNEL_VERSION(2,5,69)
  29 #error sorry, lustre requires at least 2.5.69
  30 #endif
  31
  32 #include <libcfs/linux/portals_compat25.h>
  33
  34 /*
  35  * groups_info related staff
  36  */
  37 #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,4)
  38
  39 #define NGROUPS_SMALL           NGROUPS
  40 #define NGROUPS_PER_BLOCK       ((int)(EXEC_PAGESIZE / sizeof(gid_t)))
  41 struct group_info {
  42         int        ngroups;
  43         atomic_t   usage;
  44         gid_t      small_block[NGROUPS_SMALL];
  45         int        nblocks;
  46         gid_t     *blocks[0];
  47 };
  48 #define current_ngroups current->ngroups
  49
  50 struct group_info *groups_alloc(int gidsetsize);
  51 void groups_free(struct group_info *ginfo);
  52 int groups_search(struct group_info *ginfo, gid_t grp);
  53
  54 #define get_group_info(group_info)                              \
  55         do {                                                    \
  56                 atomic_inc(&(group_info)->usage);               \
  57         } while (0)
  58
  59 #define put_group_info(group_info)                              \
  60         do {                                                    \
  61                 if (atomic_dec_and_test(&(group_info)->usage))  \
  62                         groups_free(group_info);                \
  63         } while (0)
  64
  65 #define groups_sort(gi) do {} while (0)
  66
  67 #define GROUP_AT(gi, i) ((gi)->small_block[(i)])
  68
  69 static inline int cleanup_group_info(void)
  70 {
  71         /* Get rid of unneeded supplementary groups */
  72         current->ngroups = 0;
  73         memset(current->groups, 0, sizeof(current->groups));
  74         return 0;
  75 }
  76
  77 #else /* >= 2.6.4 */
  78
  79 #define current_ngroups current->group_info->ngroups
  80
  81 void groups_sort(struct group_info *ginfo);
  82 int groups_search(struct group_info *ginfo, gid_t grp);
  83
  84 static inline int cleanup_group_info(void)
  85 {
  86         struct group_info *ginfo;
  87
  88         ginfo = groups_alloc(0);
  89         if (!ginfo)
  90                 return -ENOMEM;
  91
  92         set_current_groups(ginfo);
  93         put_group_info(ginfo);
  94
  95         return 0;
  96 }
  97 #endif /* end of groups_info stuff */
  98
  99
 100 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,5,0)
 101
 102 /* New (actually old) intent naming */
 103 #define lookup_intent open_intent
 104
 105 /* And internals */
 106 #define it_flags flags
 107 #define it_op op
 108 #define it_magic magic
 109 #define it_op_release op_release
 110 #define it_create_mode create_mode
 111
 112 /*
 113  * OBD need working random driver, thus all our
 114  * initialization routines must be called after device
 115  * driver initialization
 116  */
 117 #ifndef MODULE
 118 #undef module_init
 119 #define module_init(a)     late_initcall(a)
 120 #endif
 121
 122 /* XXX our code should be using the 2.6 calls, not the other way around */
 123 #define TryLockPage(page)                TestSetPageLocked(page)
 124 #define filemap_fdatasync(mapping)       filemap_fdatawrite(mapping)
 125 #define Page_Uptodate(page)              PageUptodate(page)
 126
 127 #define KDEVT_INIT(val)                 (val)
 128
 129 #define LTIME_S(time)                   (time.tv_sec)
 130 #define ll_path_lookup                  path_lookup
 131 #define ll_permission(inode,mask,nd)    permission(inode,mask,nd)
 132
 133 #define ll_pgcache_lock(mapping)          spin_lock(&mapping->page_lock)
 134 #define ll_pgcache_unlock(mapping)        spin_unlock(&mapping->page_lock)
 135 #define ll_call_writepage(inode, page)  \
 136                                 (inode)->i_mapping->a_ops->writepage(page, NULL)
 137 #define ll_invalidate_inode_pages(inode) \
 138                                 invalidate_inode_pages((inode)->i_mapping)
 139 #define ll_truncate_complete_page(page) \
 140                                 truncate_complete_page(page->mapping, page)
 141
 142 #define ll_vfs_create(a,b,c,d)              vfs_create(a,b,c,d)
 143
 144 #define ll_dev_t                        dev_t
 145 #define kdev_t                          dev_t
 146 #define to_kdev_t(dev)                  (dev)
 147 #define kdev_t_to_nr(dev)               (dev)
 148 #define val_to_kdev(dev)                (dev)
 149 #define ILOOKUP(sb, ino, test, data)    ilookup5(sb, ino, test, data);
 150
 151 #include <linux/writeback.h>
 152
 153 static inline void lustre_daemonize_helper(void)
 154 {
 155         LASSERT(current->signal != NULL);
 156         current->signal->session = 1;
 157         if (current->group_leader)
 158                 current->group_leader->signal->pgrp = 1;
 159         else
 160                 CERROR("we aren't group leader\n");
 161         current->signal->tty = NULL;
 162 }
 163
 164 #define __set_page_ll_data(page, llap) \
 165         do {       \
 166                 page_cache_get(page); \
 167                 SetPagePrivate(page); \
 168                 page->private = (unsigned long)llap; \
 169         } while (0)
 170 #define __clear_page_ll_data(page) \
 171         do {       \
 172                 ClearPagePrivate(page); \
 173                 page_cache_release(page); \
 174                 page->private = 0; \
 175         } while(0)
 176
 177 #define kiobuf bio
 178
 179 #include <linux/proc_fs.h>
 180
 181 #else /* 2.4.. */
 182
 183 #define ll_vfs_create(a,b,c,d)              vfs_create(a,b,c)
 184 #define ll_permission(inode,mask,nd)        permission(inode,mask)
 185 #define ILOOKUP(sb, ino, test, data)        ilookup4(sb, ino, test, data);
 186 #define DCACHE_DISCONNECTED                 DCACHE_NFSD_DISCONNECTED
 187 #define ll_dev_t                            int
 188
 189 static inline void clear_page_dirty(struct page *page)
 190 {
 191         if (PageDirty(page))
 192                 ClearPageDirty(page);
 193 }
 194
 195 /* 2.5 uses hlists for some things, like the d_hash.  we'll treat them
 196  * as 2.5 and let macros drop back.. */
 197 #ifndef HLIST_HEAD /* until we get a kernel newer than l28 */
 198 #define hlist_entry                     list_entry
 199 #define hlist_head                      list_head
 200 #define hlist_node                      list_head
 201 #define HLIST_HEAD                      LIST_HEAD
 202 #define INIT_HLIST_HEAD                 INIT_LIST_HEAD
 203 #define hlist_del_init                  list_del_init
 204 #define hlist_add_head                  list_add
 205 #define hlist_for_each_safe             list_for_each_safe
 206 #endif
 207 #define KDEVT_INIT(val)                 (val)
 208 #define ext3_xattr_set_handle           ext3_xattr_set
 209 #define extN_xattr_set_handle           extN_xattr_set
 210 #define try_module_get                  __MOD_INC_USE_COUNT
 211 #define module_put                      __MOD_DEC_USE_COUNT
 212 #define LTIME_S(time)                   (time)
 213 #if !defined(CONFIG_RH_2_4_20) && !defined(cpu_online)
 214 #define cpu_online(cpu)                 (cpu_online_map & (1<<cpu))
 215 #endif
 216
 217 static inline int ll_path_lookup(const char *path, unsigned flags,
 218                                  struct nameidata *nd)
 219 {
 220         int error = 0;
 221         if (path_init(path, flags, nd))
 222                 error = path_walk(path, nd);
 223         return error;
 224 }
 225 #define ll_permission(inode,mask,nd)    permission(inode,mask)
 226 typedef long sector_t;
 227
 228 #define ll_pgcache_lock(mapping)        spin_lock(&pagecache_lock)
 229 #define ll_pgcache_unlock(mapping)      spin_unlock(&pagecache_lock)
 230 #define ll_call_writepage(inode, page)  \
 231                                (inode)->i_mapping->a_ops->writepage(page)
 232 #define ll_invalidate_inode_pages(inode) invalidate_inode_pages(inode)
 233 #define ll_truncate_complete_page(page) truncate_complete_page(page)
 234
 235 static inline void __d_drop(struct dentry *dentry)
 236 {
 237         list_del(&dentry->d_hash);
 238         INIT_LIST_HEAD(&dentry->d_hash);
 239 }
 240
 241 static inline void lustre_daemonize_helper(void)
 242 {
 243         current->session = 1;
 244         current->pgrp = 1;
 245         current->tty = NULL;
 246 }
 247
 248 #ifndef HAVE_COND_RESCHED
 249 static inline void cond_resched(void)
 250 {
 251         if (unlikely(need_resched())) {
 252                 set_current_state(TASK_RUNNING);
 253                 schedule();
 254         }
 255 }
 256 #endif
 257
 258 static inline int mapping_mapped(struct address_space *mapping)
 259 {
 260         return mapping->i_mmap_shared ? 1 : 0;
 261 }
 262
 263 /* to find proc_dir_entry from inode. 2.6 has native one -bzzz */
 264 #ifndef HAVE_PDE
 265 #define PDE(ii)         ((ii)->u.generic_ip)
 266 #endif
 267
 268 #define __set_page_ll_data(page, llap) page->private = (unsigned long)llap
 269 #define __clear_page_ll_data(page) page->private = 0
 270 #define PageWriteback(page) 0
 271 #define end_page_writeback(page)
 272
 273 #ifdef ZAP_PAGE_RANGE_VMA
 274 #define ll_zap_page_range(vma, addr, len)  zap_page_range(vma, addr, len)
 275 #else
 276 #define ll_zap_page_range(vma, addr, len)  zap_page_range(vma->vm_mm, addr, len)
 277 #endif
 278
 279 #endif /* end of 2.4 compat macros */
 280
 281 #ifdef HAVE_PAGE_LIST
 282 static inline int mapping_has_pages(struct address_space *mapping)
 283 {
 284         int rc = 1;
 285
 286         ll_pgcache_lock(mapping);
 287         if (list_empty(&mapping->dirty_pages) &&
 288             list_empty(&mapping->clean_pages) &&
 289             list_empty(&mapping->locked_pages)) {
 290                 rc = 0;
 291         }
 292         ll_pgcache_unlock(mapping);
 293
 294         return rc;
 295 }
 296
 297 static inline int clear_page_dirty_for_io(struct page *page)
 298 {
 299         struct address_space *mapping = page->mapping;
 300
 301         if (page->mapping && PageDirty(page)) {
 302                 ClearPageDirty(page);
 303                 ll_pgcache_lock(mapping);
 304                 list_del(&page->list);
 305                 list_add(&page->list, &mapping->locked_pages);
 306                 ll_pgcache_unlock(mapping);
 307                 return 1;
 308         }
 309         return 0;
 310 }
 311 #else
 312 static inline int mapping_has_pages(struct address_space *mapping)
 313 {
 314         return mapping->nrpages > 0;
 315 }
 316 #endif
 317
 318 #if (LINUX_VERSION_CODE < KERNEL_VERSION(2,6,7))
 319 #define ll_set_dflags(dentry, flags) do { dentry->d_vfs_flags |= flags; } while(0)
 320 #define ll_vfs_symlink(dir, dentry, path, mode) vfs_symlink(dir, dentry, path)
 321 #else
 322 #define ll_set_dflags(dentry, flags) do { \
 323                 spin_lock(&dentry->d_lock); \
 324                 dentry->d_flags |= flags; \
 325                 spin_unlock(&dentry->d_lock); \
 326         } while(0)
 327 #define ll_vfs_symlink(dir, dentry, path, mode) vfs_symlink(dir, dentry, path, mode)
 328 #endif
 329
 330 #ifdef HAVE_I_ALLOC_SEM
 331 #define UP_WRITE_I_ALLOC_SEM(i) do { up_write(&(i)->i_alloc_sem); } while (0)
 332 #define DOWN_WRITE_I_ALLOC_SEM(i) do { down_write(&(i)->i_alloc_sem); } while(0)
 333 #define LASSERT_MDS_ORPHAN_WRITE_LOCKED(i) LASSERT(down_read_trylock(&(i)->i_alloc_sem) == 0)
 334
 335 #define UP_READ_I_ALLOC_SEM(i) do { up_read(&(i)->i_alloc_sem); } while (0)
 336 #define DOWN_READ_I_ALLOC_SEM(i) do { down_read(&(i)->i_alloc_sem); } while (0)
 337 #define LASSERT_MDS_ORPHAN_READ_LOCKED(i) LASSERT(down_write_trylock(&(i)->i_alloc_sem) == 0)
 338 #define MDS_PACK_MD_LOCK 1
 339 #else
 340 #define UP_READ_I_ALLOC_SEM(i) do { up(&(i)->i_sem); } while (0)
 341 #define DOWN_READ_I_ALLOC_SEM(i) do { down(&(i)->i_sem); } while (0)
 342 #define LASSERT_MDS_ORPHAN_READ_LOCKED(i) LASSERT(down_trylock(&(i)->i_sem) != 0)
 343
 344 #define UP_WRITE_I_ALLOC_SEM(i) do { up(&(i)->i_sem); } while (0)
 345 #define DOWN_WRITE_I_ALLOC_SEM(i) do { down(&(i)->i_sem); } while (0)
 346 #define LASSERT_MDS_ORPHAN_WRITE_LOCKED(i) LASSERT(down_trylock(&(i)->i_sem) != 0)
 347 #define MDS_PACK_MD_LOCK 0
 348 #endif
 349
 350 #endif /* __KERNEL__ */
 351 #endif /* _COMPAT25_H */