+++ /dev/null
-/*
- * GPL HEADER START
- *
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License version 2 only,
- * as published by the Free Software Foundation.
- *
- * This program is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * General Public License version 2 for more details (a copy is included
- * in the LICENSE file that accompanied this code).
- *
- * You should have received a copy of the GNU General Public License
- * version 2 along with this program; If not, see
- * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
- *
- * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
- * CA 95054 USA or visit www.sun.com if you need additional information or
- * have any questions.
- *
- * GPL HEADER END
- */
-/*
- * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
- * Use is subject to license terms.
- *
- * Copyright (c) 2012, Intel Corporation.
- */
-/*
- * This file is part of Lustre, http://www.lustre.org/
- * Lustre is a trademark of Sun Microsystems, Inc.
- *
- * libcfs/include/libcfs/user-bitops.h
- *
- * Author: Nikita Danilov <nikita@clusterfs.com>
- */
-
-#ifndef __LIBCFS_USER_BITOPS_H__
-#define __LIBCFS_USER_BITOPS_H__
-
-/* test if bit nr is set in bitmap addr; returns previous value of bit nr */
-static inline int test_and_set_bit(int nr, unsigned long *addr)
-{
- unsigned long mask;
-
- addr += nr / BITS_PER_LONG;
- mask = 1UL << (nr & (BITS_PER_LONG - 1));
- nr = (mask & *addr) != 0;
- *addr |= mask;
- return nr;
-}
-
-#define set_bit(n, a) test_and_set_bit(n, a)
-
-/* clear bit nr in bitmap addr; returns previous value of bit nr*/
-static inline int test_and_clear_bit(int nr, unsigned long *addr)
-{
- unsigned long mask;
-
- addr += nr / BITS_PER_LONG;
- mask = 1UL << (nr & (BITS_PER_LONG - 1));
- nr = (mask & *addr) != 0;
- *addr &= ~mask;
- return nr;
-}
-
-#define clear_bit(n, a) test_and_clear_bit(n, a)
-
-static inline int test_bit(int nr, const unsigned long *addr)
-{
- return ((1UL << (nr & (BITS_PER_LONG - 1))) &
- ((addr)[nr / BITS_PER_LONG])) != 0;
-}
-
-/* using binary seach */
-static __inline__ unsigned long fls(long data)
-{
- int pos = 32;
-
- if (!data)
- return 0;
-
-#if BITS_PER_LONG == 64
- /* If any bit of the high 32 bits are set, shift the high
- * 32 bits down and pretend like it is a 32-bit value. */
- if ((data & 0xFFFFFFFF00000000llu)) {
- data >>= 32;
- pos += 32;
- }
-#endif
-
- if (!(data & 0xFFFF0000u)) {
- data <<= 16;
- pos -= 16;
- }
- if (!(data & 0xFF000000u)) {
- data <<= 8;
- pos -= 8;
- }
- if (!(data & 0xF0000000u)) {
- data <<= 4;
- pos -= 4;
- }
- if (!(data & 0xC0000000u)) {
- data <<= 2;
- pos -= 2;
- }
- if (!(data & 0x80000000u)) {
- data <<= 1;
- pos -= 1;
- }
- return pos;
-}
-
-static __inline__ unsigned long __cfs_ffs(long data)
-{
- int pos = 0;
-
-#if BITS_PER_LONG == 64
- if ((data & 0xFFFFFFFF) == 0) {
- pos += 32;
- data >>= 32;
- }
-#endif
- if ((data & 0xFFFF) == 0) {
- pos += 16;
- data >>= 16;
- }
- if ((data & 0xFF) == 0) {
- pos += 8;
- data >>= 8;
- }
- if ((data & 0xF) == 0) {
- pos += 4;
- data >>= 4;
- }
- if ((data & 0x3) == 0) {
- pos += 2;
- data >>= 2;
- }
- if ((data & 0x1) == 0)
- pos += 1;
-
- return pos;
-}
-
-#define ffz(x) ffs(~(x))
-#define flz(x) fls(~(x))
-
-unsigned long find_next_bit(unsigned long *addr,
- unsigned long size, unsigned long offset);
-
-unsigned long find_next_zero_bit(unsigned long *addr,
- unsigned long size, unsigned long offset);
-
-#define find_first_bit(addr, size) find_next_bit((addr), (size),0)
-#define find_first_zero_bit(addr, size) find_next_zero_bit((addr), (size),0)
-
-#endif
+++ /dev/null
-/* GPL HEADER START
- *
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License version 2 only,
- * as published by the Free Software Foundation.
- *
- * This program is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * General Public License version 2 for more details (a copy is included
- * in the LICENSE file that accompanied this code).
- *
- * You should have received a copy of the GNU General Public License
- * version 2 along with this program; If not, see http://www.gnu.org/licenses
- *
- * Please visit http://www.xyratex.com/contact if you need additional
- * information or have any questions.
- *
- * GPL HEADER END
- */
-
-/*
- * Copyright 2012 Xyratex Technology Limited
- *
- * Copyright (c) 2012, Intel Corporation.
- *
- */
-
-#if (defined i386) || (defined __amd64__)
-unsigned int crc32_pclmul_le_16(unsigned char const *buffer, size_t len,
- unsigned int crc32) __attribute__((regparm(3)));
-
-unsigned int crc32_pclmul_le(unsigned int crc, unsigned char const *p,
- size_t len);
-
-int crc32_pclmul_init(void);
-#endif
git://git.whamcloud.com / fs / lustre-release.git / commitdiff