1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
4 * Copyright (c) 2003 Cluster File Systems, Inc.
6 * This file is part of Lustre, http://www.lustre.org.
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.
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.
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.
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
32 #include <libcfs/linux/portals_compat25.h>
35 * groups_info related staff
37 #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,4)
39 #define NGROUPS_SMALL NGROUPS
40 #define NGROUPS_PER_BLOCK ((int)(EXEC_PAGESIZE / sizeof(gid_t)))
44 gid_t small_block[NGROUPS_SMALL];
48 #define current_ngroups current->ngroups
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);
54 #define get_group_info(group_info) \
56 atomic_inc(&(group_info)->usage); \
59 #define put_group_info(group_info) \
61 if (atomic_dec_and_test(&(group_info)->usage)) \
62 groups_free(group_info); \
65 #define groups_sort(gi) do {} while (0)
66 #define GROUP_AT(gi, i) ((gi)->small_block[(i)])
68 static inline int cleanup_group_info(void)
70 /* Get rid of unneeded supplementary groups */
72 memset(current->groups, 0, sizeof(current->groups));
78 #define current_ngroups current->group_info->ngroups
80 void groups_sort(struct group_info *ginfo);
81 int groups_search(struct group_info *ginfo, gid_t grp);
83 static inline int cleanup_group_info(void)
85 struct group_info *ginfo;
87 ginfo = groups_alloc(0);
91 set_current_groups(ginfo);
92 put_group_info(ginfo);
96 #endif /* end of groups_info stuff */
99 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,5,0)
101 /* New (actually old) intent naming */
102 #define lookup_intent open_intent
105 #define it_flags flags
107 #define it_magic magic
108 #define it_op_release op_release
109 #define it_create_mode create_mode
112 * OBD need working random driver, thus all our
113 * initialization routines must be called after device
114 * driver initialization
118 #define module_init(a) late_initcall(a)
121 /* XXX our code should be using the 2.6 calls, not the other way around */
122 #define TryLockPage(page) TestSetPageLocked(page)
123 #define Page_Uptodate(page) PageUptodate(page)
125 #define KDEVT_INIT(val) (val)
127 #define LTIME_S(time) (time.tv_sec)
128 #define ll_path_lookup path_lookup
129 #define ll_permission(inode,mask,nd) permission(inode,mask,nd)
131 #define ll_pgcache_lock(mapping) spin_lock(&mapping->page_lock)
132 #define ll_pgcache_unlock(mapping) spin_unlock(&mapping->page_lock)
133 #define ll_call_writepage(inode, page) \
134 (inode)->i_mapping->a_ops->writepage(page, NULL)
135 #define ll_invalidate_inode_pages(inode) \
136 invalidate_inode_pages((inode)->i_mapping)
137 #define ll_truncate_complete_page(page) \
138 truncate_complete_page(page->mapping, page)
140 #define ll_vfs_create(a,b,c,d) vfs_create(a,b,c,d)
142 #define ll_dev_t dev_t
144 #define to_kdev_t(dev) (dev)
145 #define kdev_t_to_nr(dev) (dev)
146 #define val_to_kdev(dev) (dev)
147 #define ILOOKUP(sb, ino, test, data) ilookup5(sb, ino, test, data);
149 #include <linux/writeback.h>
151 static inline void lustre_daemonize_helper(void)
153 LASSERT(current->signal != NULL);
154 current->signal->session = 1;
155 if (current->group_leader)
156 current->group_leader->signal->pgrp = 1;
158 CERROR("we aren't group leader\n");
159 current->signal->tty = NULL;
162 #define __set_page_ll_data(page, llap) \
164 page_cache_get(page); \
165 SetPagePrivate(page); \
166 page->private = (unsigned long)llap; \
168 #define __clear_page_ll_data(page) \
170 ClearPagePrivate(page); \
171 page_cache_release(page); \
176 #define smp_num_cpus num_online_cpus()
181 #include <linux/proc_fs.h>
185 #define ll_vfs_create(a,b,c,d) vfs_create(a,b,c)
186 #define ll_permission(inode,mask,nd) permission(inode,mask)
187 #define ILOOKUP(sb, ino, test, data) ilookup4(sb, ino, test, data);
188 #define DCACHE_DISCONNECTED DCACHE_NFSD_DISCONNECTED
191 static inline void clear_page_dirty(struct page *page)
194 ClearPageDirty(page);
197 /* 2.5 uses hlists for some things, like the d_hash. we'll treat them
198 * as 2.5 and let macros drop back.. */
199 #ifndef HLIST_HEAD /* until we get a kernel newer than l28 */
200 #define hlist_entry list_entry
201 #define hlist_head list_head
202 #define hlist_node list_head
203 #define HLIST_HEAD LIST_HEAD
204 #define INIT_HLIST_HEAD INIT_LIST_HEAD
205 #define hlist_del_init list_del_init
206 #define hlist_add_head list_add
207 #define hlist_for_each_safe list_for_each_safe
209 #define KDEVT_INIT(val) (val)
210 #define ext3_xattr_set_handle ext3_xattr_set
211 #define extN_xattr_set_handle extN_xattr_set
212 #define try_module_get __MOD_INC_USE_COUNT
213 #define module_put __MOD_DEC_USE_COUNT
214 #define LTIME_S(time) (time)
215 #if !defined(CONFIG_RH_2_4_20) && !defined(cpu_online)
216 #define cpu_online(cpu) (cpu_online_map & (1<<cpu))
219 static inline int ll_path_lookup(const char *path, unsigned flags,
220 struct nameidata *nd)
223 if (path_init(path, flags, nd))
224 error = path_walk(path, nd);
227 #define ll_permission(inode,mask,nd) permission(inode,mask)
228 typedef long sector_t;
230 #define ll_pgcache_lock(mapping) spin_lock(&pagecache_lock)
231 #define ll_pgcache_unlock(mapping) spin_unlock(&pagecache_lock)
232 #define ll_call_writepage(inode, page) \
233 (inode)->i_mapping->a_ops->writepage(page)
234 #define filemap_fdatawrite(mapping) filemap_fdatasync(mapping)
235 #define ll_invalidate_inode_pages(inode) invalidate_inode_pages(inode)
236 #define ll_truncate_complete_page(page) truncate_complete_page(page)
238 static inline void __d_drop(struct dentry *dentry)
240 list_del(&dentry->d_hash);
241 INIT_LIST_HEAD(&dentry->d_hash);
244 static inline void lustre_daemonize_helper(void)
246 current->session = 1;
251 #ifndef HAVE_COND_RESCHED
252 static inline void cond_resched(void)
254 if (unlikely(need_resched())) {
255 set_current_state(TASK_RUNNING);
261 static inline int mapping_mapped(struct address_space *mapping)
263 if (mapping->i_mmap_shared)
270 /* to find proc_dir_entry from inode. 2.6 has native one -bzzz */
272 #define PDE(ii) ((ii)->u.generic_ip)
275 #define __set_page_ll_data(page, llap) page->private = (unsigned long)llap
276 #define __clear_page_ll_data(page) page->private = 0
277 #define PageWriteback(page) 0
278 #define set_page_writeback(page) do {} while (0)
279 #define end_page_writeback(page) do {} while (0)
281 #define end_page_writeback(page)
283 #ifdef ZAP_PAGE_RANGE_VMA
284 #define ll_zap_page_range(vma, addr, len) zap_page_range(vma, addr, len)
286 #define ll_zap_page_range(vma, addr, len) zap_page_range(vma->vm_mm, addr, len)
289 #endif /* end of 2.4 compat macros */
291 #ifdef HAVE_PAGE_LIST
292 static inline int mapping_has_pages(struct address_space *mapping)
296 ll_pgcache_lock(mapping);
297 if (list_empty(&mapping->dirty_pages) &&
298 list_empty(&mapping->clean_pages) &&
299 list_empty(&mapping->locked_pages)) {
302 ll_pgcache_unlock(mapping);
307 static inline int clear_page_dirty_for_io(struct page *page)
309 struct address_space *mapping = page->mapping;
311 if (page->mapping && PageDirty(page)) {
312 ClearPageDirty(page);
313 ll_pgcache_lock(mapping);
314 list_del(&page->list);
315 list_add(&page->list, &mapping->locked_pages);
316 ll_pgcache_unlock(mapping);
322 static inline int mapping_has_pages(struct address_space *mapping)
324 return mapping->nrpages > 0;
328 #if (LINUX_VERSION_CODE < KERNEL_VERSION(2,6,7))
329 #define ll_set_dflags(dentry, flags) do { dentry->d_vfs_flags |= flags; } while(0)
330 #define ll_vfs_symlink(dir, dentry, path, mode) vfs_symlink(dir, dentry, path)
332 #define ll_set_dflags(dentry, flags) do { \
333 spin_lock(&dentry->d_lock); \
334 dentry->d_flags |= flags; \
335 spin_unlock(&dentry->d_lock); \
337 #define ll_vfs_symlink(dir, dentry, path, mode) vfs_symlink(dir, dentry, path, mode)
341 #define container_of(ptr, type, member) ({ \
342 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
343 (type *)( (char *)__mptr - offsetof(type,member) );})
346 #ifdef HAVE_I_ALLOC_SEM
347 #define UP_WRITE_I_ALLOC_SEM(i) do { up_write(&(i)->i_alloc_sem); } while (0)
348 #define DOWN_WRITE_I_ALLOC_SEM(i) do { down_write(&(i)->i_alloc_sem); } while(0)
349 #define LASSERT_MDS_ORPHAN_WRITE_LOCKED(i) LASSERT(down_read_trylock(&(i)->i_alloc_sem) == 0)
351 #define UP_READ_I_ALLOC_SEM(i) do { up_read(&(i)->i_alloc_sem); } while (0)
352 #define DOWN_READ_I_ALLOC_SEM(i) do { down_read(&(i)->i_alloc_sem); } while (0)
353 #define LASSERT_MDS_ORPHAN_READ_LOCKED(i) LASSERT(down_write_trylock(&(i)->i_alloc_sem) == 0)
354 #define MDS_PACK_MD_LOCK 1
356 #define UP_READ_I_ALLOC_SEM(i) do { up(&(i)->i_sem); } while (0)
357 #define DOWN_READ_I_ALLOC_SEM(i) do { down(&(i)->i_sem); } while (0)
358 #define LASSERT_MDS_ORPHAN_READ_LOCKED(i) LASSERT(down_trylock(&(i)->i_sem) != 0)
360 #define UP_WRITE_I_ALLOC_SEM(i) do { up(&(i)->i_sem); } while (0)
361 #define DOWN_WRITE_I_ALLOC_SEM(i) do { down(&(i)->i_sem); } while (0)
362 #define LASSERT_MDS_ORPHAN_WRITE_LOCKED(i) LASSERT(down_trylock(&(i)->i_sem) != 0)
363 #define MDS_PACK_MD_LOCK 0
366 #endif /* __KERNEL__ */
367 #endif /* _COMPAT25_H */