Added (and normalized) SunSpider's 3bit test.

tests/MANIFEST.json

@@ -135,6 +135,14 @@
 	category: "SunSpider JavaScript Tests",
 	tags: ["looping", "array"]
 },
+"sunspider-bitops-3bit-bits-in-byte": {
+	file: "sunspider-bitops-3bit-bits-in-byte.js",
+	name: "Compute Bits in Byte",
+	origin: ["SunSpider", "http://www2.webkit.org/perf/sunspider-0.9/sunspider.html"],
+	desc: "Compute the number of bits in a number using bitops.",
+	category: "SunSpider JavaScript Tests",
+	tags: ["looping", "bitops"]
+},
 "sunspider-bitops-nsieve-bits": {
 	file: "sunspider-bitops-nsieve-bits.js",
 	name: "Prime Number Computation (2)",

tests/sunspider-bitops-3bit-bits-in-byte.js

@@ -0,0 +1,42 @@
+// Copyright (c) 2004 by Arthur Langereis (arthur_ext at domain xfinitegames, tld com
+
+// 1 op = 6 ANDs, 3 SHRs, 3 SHLs, 4 assigns, 2 ADDs
+// O(1)
+function fast3bitlookup(b) {
+var c, bi3b = 0xE994; // 0b1110 1001 1001 0100; // 3 2 2 1  2 1 1 0
+c  = 3 & (bi3b >> ((b << 1) & 14));
+c += 3 & (bi3b >> ((b >> 2) & 14));
+c += 3 & (bi3b >> ((b >> 5) & 6));
+return c;
+
+/*
+lir4,0xE994; 9 instructions, no memory access, minimal register dependence, 6 shifts, 2 adds, 1 inline assign
+rlwinmr5,r3,1,28,30
+rlwinmr6,r3,30,28,30
+rlwinmr7,r3,27,29,30
+rlwnmr8,r4,r5,30,31
+rlwnmr9,r4,r6,30,31
+rlwnmr10,r4,r7,30,31
+addr3,r8,r9
+addr3,r3,r10
+*/
+}
+
+
+function TimeFunc(func) {
+var x, y, t;
+for(var x=0; x<250; x++)
+for(var y=0; y<256; y++) func(y);
+}
+
+startTest("sunspider-bitops-3bit-bits-in-byte");
+
+for ( var i = 0; i < 4; i++ ) {
+
+test("3bit bits in byte", i, function(){
+	TimeFunc(fast3bitlookup);
+});
+
+}
+
+endTest();