--- /dev/null
+/* ----------------------------------------------------------------------- *
+ *
+ * Copyright 2010 Intel Corporation; author: H. Peter Anvin
+ *
+ * Permission is hereby granted, free of charge, to any person
+ * obtaining a copy of this software and associated documentation
+ * files (the "Software"), to deal in the Software without
+ * restriction, including without limitation the rights to use,
+ * copy, modify, merge, publish, distribute, sublicense, and/or
+ * sell copies of the Software, and to permit persons to whom
+ * the Software is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice shall
+ * be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+ * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+ * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+ * OTHER DEALINGS IN THE SOFTWARE.
+ *
+ * ----------------------------------------------------------------------- */
+
+/*
+ * bitops.h
+ *
+ * Simple bitwise operations
+ */
+
+#ifndef _BITOPS_H
+#define _BITOPS_H
+
+#include <klibc/compiler.h>
+
+static inline void set_bit(long __bit, void *__bitmap)
+{
+ asm volatile("btsl %1,%0" : "+m" (__bitmap) : "Ir" (__bit) : "memory");
+}
+
+static inline void clr_bit(long __bit, void *__bitmap)
+{
+ asm volatile("btcl %1,%0" : "+m" (__bitmap) : "Ir" (__bit) : "memory");
+}
+
+static inline int __purefunc test_bit(long __bit, const void *__bitmap)
+{
+ unsigned char __r;
+ asm("btl %2,%1; setnz %0"
+ : "=r" (__r)
+ : "m" (__bitmap), "Ir" (__bit));
+ return __r;
+}
+
+#endif /* _BITOPS_H */
#include <string.h>
#include <limits.h>
#include <stdio.h>
+#include <sys/bitops.h>
#ifndef LONG_BIT
#define LONG_BIT (CHAR_BIT*sizeof(long))
bail_err /* Conversion mismatch */
};
-static inline const char *skipspace(const char *p)
+static const char *skipspace(const char *p)
{
while (isspace((unsigned char)*p))
p++;
return p;
}
-#undef set_bit
-static inline void set_bit(unsigned long *bitmap, unsigned int bit)
-{
- bitmap[bit / LONG_BIT] |= 1UL << (bit % LONG_BIT);
-}
-
-#undef test_bit
-static inline int test_bit(unsigned long *bitmap, unsigned int bit)
-{
- return (int)(bitmap[bit / LONG_BIT] >> (bit % LONG_BIT)) & 1;
-}
-
int vsscanf(const char *buffer, const char *format, va_list ap)
{
const char *p = format;
if (ch == '^' && !(flags & FL_INV)) {
matchinv = 1;
} else {
- set_bit(matchmap, (unsigned char)ch);
+ set_bit((unsigned char)ch, matchmap);
state = st_match;
}
break;
range_start = (unsigned char)ch;
state = st_match_range;
} else {
- set_bit(matchmap, (unsigned char)ch);
+ set_bit((unsigned char)ch, matchmap);
}
break;
case st_match_range: /* %[ match after - */
if (ch == ']') {
- set_bit(matchmap, (unsigned char)'-'); /* - was last character */
+ set_bit((unsigned char)'-', matchmap); /* - was last character */
goto match_run;
} else {
int i;
for (i = range_start; i < (unsigned char)ch; i++)
- set_bit(matchmap, i);
+ set_bit(i, matchmap);
state = st_match;
}
break;
match_run: /* Match expression finished */
qq = q;
while (width && *q
- && test_bit(matchmap, (unsigned char)*q) ^ matchinv) {
+ && test_bit((unsigned char)*q, matchmap) ^ matchinv) {
*sarg++ = *q++;
}
if (q != qq) {