From 8fc61aeab7c50a5bf2ff6f6f8ab46e960cce2adf Mon Sep 17 00:00:00 2001
From: Andrew Waterman
Date: Fri, 15 Jul 2016 00:09:05 -0700
Subject: Improve PopCount implementation

Clean up Scala code, and use +& to generate a lot less FIRRTL
---
 chiselFrontend/src/main/scala/chisel3/core/SeqUtils.scala | 12 ++++--------
 1 file changed, 4 insertions(+), 8 deletions(-)

(limited to 'chiselFrontend/src/main/scala/chisel3/core')

diff --git a/chiselFrontend/src/main/scala/chisel3/core/SeqUtils.scala b/chiselFrontend/src/main/scala/chisel3/core/SeqUtils.scala
index 91cb9e89..0872ec41 100644
--- a/chiselFrontend/src/main/scala/chisel3/core/SeqUtils.scala
+++ b/chiselFrontend/src/main/scala/chisel3/core/SeqUtils.scala
@@ -23,14 +23,10 @@ private[chisel3] object SeqUtils {
   /** Counts the number of true Bools in a Seq */
   def count(in: Seq[Bool]): UInt = macro SourceInfoTransform.inArg
 
-  def do_count(in: Seq[Bool])(implicit sourceInfo: SourceInfo): UInt = {
-    if (in.size == 0) {
-      UInt(0)
-    } else if (in.size == 1) {
-      in.head
-    } else {
-      count(in.slice(0, in.size/2)) + (UInt(0) ## count(in.slice(in.size/2, in.size)))
-    }
+  def do_count(in: Seq[Bool])(implicit sourceInfo: SourceInfo): UInt = in.size match {
+    case 0 => UInt(0)
+    case 1 => in.head
+    case n => count(in take n/2) +& count(in drop n/2)
   }
 
   /** Returns data value corresponding to first true predicate */
-- 
cgit v1.2.3