vmalloc: walk vmap_areas by sorted list instead of rb_next()
[linux/fpc-iii.git] / arch / mn10300 / lib / bitops.c
blob37309cdb7584094de33d29f87ab805e8b9ee0c7d
1 /* MN10300 Non-trivial bit operations
3 * Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
4 * Written by David Howells (dhowells@redhat.com)
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public Licence
8 * as published by the Free Software Foundation; either version
9 * 2 of the Licence, or (at your option) any later version.
11 #include <linux/module.h>
12 #include <asm/bitops.h>
15 * try flipping a bit using BSET and BCLR
17 void change_bit(unsigned long nr, volatile void *addr)
19 if (test_bit(nr, addr))
20 goto try_clear_bit;
22 try_set_bit:
23 if (!test_and_set_bit(nr, addr))
24 return;
26 try_clear_bit:
27 if (test_and_clear_bit(nr, addr))
28 return;
30 goto try_set_bit;
34 * try flipping a bit using BSET and BCLR and returning the old value
36 int test_and_change_bit(unsigned long nr, volatile void *addr)
38 if (test_bit(nr, addr))
39 goto try_clear_bit;
41 try_set_bit:
42 if (!test_and_set_bit(nr, addr))
43 return 0;
45 try_clear_bit:
46 if (test_and_clear_bit(nr, addr))
47 return 1;
49 goto try_set_bit;