summaryrefslogtreecommitdiff
path: root/include/mach/proc_ops.h
diff options
context:
space:
mode:
authorThomas Bushnell <thomas@gnu.org>1997-02-25 21:28:37 +0000
committerThomas Bushnell <thomas@gnu.org>1997-02-25 21:28:37 +0000
commitf07a4c844da9f0ecae5bbee1ab94be56505f26f7 (patch)
tree12b07c7e578fc1a5f53dbfde2632408491ff2a70 /include/mach/proc_ops.h
Initial source
Diffstat (limited to 'include/mach/proc_ops.h')
-rw-r--r--include/mach/proc_ops.h51
1 files changed, 51 insertions, 0 deletions
diff --git a/include/mach/proc_ops.h b/include/mach/proc_ops.h
new file mode 100644
index 0000000..a453ec8
--- /dev/null
+++ b/include/mach/proc_ops.h
@@ -0,0 +1,51 @@
+/*
+ * Copyright (c) 1994 The University of Utah and
+ * the Center for Software Science (CSS). All rights reserved.
+ *
+ * Permission to use, copy, modify and distribute this software and its
+ * documentation is hereby granted, provided that both the copyright
+ * notice and this permission notice appear in all copies of the
+ * software, derivative works or modified versions, and any portions
+ * thereof, and that both notices appear in supporting documentation.
+ *
+ * THE UNIVERSITY OF UTAH AND CSS ALLOW FREE USE OF THIS SOFTWARE IN ITS "AS
+ * IS" CONDITION. THE UNIVERSITY OF UTAH AND CSS DISCLAIM ANY LIABILITY OF
+ * ANY KIND FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
+ *
+ * CSS requests users of this software to return to css-dist@cs.utah.edu any
+ * improvements that they make and grant CSS redistribution rights.
+ *
+ * Author: Bryan Ford, University of Utah CSS
+ */
+/*
+ * Simple operations that don't exist as primitives in C,
+ * but which processors often implement directly.
+ * This file contains default, "dumb" implementations;
+ * machine-independent code can override these with smarter implementations.
+ */
+#ifndef _MACH_PROC_OPS_H_
+#define _MACH_PROC_OPS_H_
+
+#include <mach/machine/vm_types.h>
+#include <mach/inline.h>
+
+/* Returns the bit number of the most-significant set bit in `val',
+ e.g. 0 for 1, 1 for 2-3, 2 for 4-7, etc.
+ If `val' is 0 (i.e. no bits are set), the behavior is undefined. */
+MACH_INLINE int find_msb_set(natural_t val)
+{
+ int msb;
+ for (msb = sizeof(val)*8-1; (val & ((natural_t)1 << msb)) == 0; msb--);
+ return msb;
+}
+
+/* Returns the bit number of the least-significant set bit in `val'.
+ If `val' is 0 (i.e. no bits are set), the behavior is undefined. */
+MACH_INLINE int find_lsb_set(natural_t val)
+{
+ int lsb;
+ for (lsb = 0; (val & ((natural_t)1 << lsb)) == 0; lsb++);
+ return lsb;
+}
+
+#endif _MACH_PROC_OPS_H_