Remove trailing whitespaces

kernel/cellhelp.py

@@ -19,7 +19,7 @@ class SimHelper:
     def __init__(self) -> None:
         self.desc = []
         self.tags = []
-    
+
     def __str__(self) -> str:
         printed_fields = [
             "name", "title", "ports", "source", "desc", "code", "group", "ver",
@@ -65,7 +65,7 @@ for line in fileinput.input():
     elif line.startswith("//* "):
         _, key, val = line.split(maxsplit=2)
         setattr(simHelper, key, val)
-    
+
     # code parsing
     if line.startswith("module "):
         clean_line = line[7:].replace("\\", "").replace(";", "")

kernel/compressor_tree.cc

@@ -99,7 +99,7 @@ std::vector<DepthSig> generate_partial_products(Module *module, SigSpec a, SigSp
 
 	// Correction constants
 	auto push_one_at = [&](int col) {
-		if (col < 0 || col >= width) 
+		if (col < 0 || col >= width)
 			return;
 		std::vector<RTLIL::State> v(width, RTLIL::State::S0);
 		v[col] = RTLIL::State::S1;

kernel/functional.h

@@ -33,7 +33,7 @@ YOSYS_NAMESPACE_BEGIN
 namespace Functional {
 	// each function is documented with a short pseudocode declaration or definition
 	// standard C/Verilog operators are used to describe the result
-	// 
+	//
 	// the sorts used in this are:
 	// - bit[N]: a bitvector of N bits
 	//   bit[N] can be indicated as signed or unsigned. this is not tracked by the functional backend
@@ -345,9 +345,9 @@ namespace Functional {
 			case Fn::reduce_xor: return v.reduce_xor(*this, arg(0)); break;
 			case Fn::equal: return v.equal(*this, arg(0), arg(1)); break;
 			case Fn::not_equal: return v.not_equal(*this, arg(0), arg(1)); break;
-			case Fn::signed_greater_than: return v.signed_greater_than(*this, arg(0), arg(1)); break; 
+			case Fn::signed_greater_than: return v.signed_greater_than(*this, arg(0), arg(1)); break;
 			case Fn::signed_greater_equal: return v.signed_greater_equal(*this, arg(0), arg(1)); break;
-			case Fn::unsigned_greater_than: return v.unsigned_greater_than(*this, arg(0), arg(1)); break; 
+			case Fn::unsigned_greater_than: return v.unsigned_greater_than(*this, arg(0), arg(1)); break;
 			case Fn::unsigned_greater_equal: return v.unsigned_greater_equal(*this, arg(0), arg(1)); break;
 			case Fn::logical_shift_left: return v.logical_shift_left(*this, arg(0), arg(1)); break;
 			case Fn::logical_shift_right: return v.logical_shift_right(*this, arg(0), arg(1)); break;
@@ -510,7 +510,7 @@ namespace Functional {
 				return a;
 			return add(Fn::reduce_or, Sort(1), {a});
 		}
-		Node reduce_xor(Node a) { 
+		Node reduce_xor(Node a) {
 			check_unary(a);
 			if(a.width() == 1)
 				return a;

kernel/io.h

@@ -202,7 +202,7 @@ static auto has_name_member_imp(int)
 	-> decltype(static_cast<const RTLIL::IdString>(std::declval<T>().name), std::true_type{});
 
 template <class T>
-static auto has_name_member_imp(long) 
+static auto has_name_member_imp(long)
 	-> std::false_type;
 
 template <class T>
@@ -213,7 +213,7 @@ static auto ptr_has_name_member_imp(int)
 	-> decltype(static_cast<const RTLIL::IdString>(std::declval<T>()->name), std::true_type{});
 
 template <class T>
-static auto ptr_has_name_member_imp(long) 
+static auto ptr_has_name_member_imp(long)
 	-> std::false_type;
 
 template <class T>
@@ -475,7 +475,7 @@ public:
 private:
 	std::string_view fmt;
 	bool has_escapes = false;
-	// Making array at least size of one to make MSVC happy and strict to standards 
+	// Making array at least size of one to make MSVC happy and strict to standards
 	FoundFormatSpec specs[sizeof...(Args) ? sizeof...(Args) : 1] = {};
 };
 

kernel/tclapi.cc

@@ -567,7 +567,7 @@ int yosys_tcl_interp_init(Tcl_Interp *interp)
 	// unpack
 	// pack
 
-	// Note (dev jf 24-12-02): Make log_id escape everything that’s not a valid 
+	// Note (dev jf 24-12-02): Make log_id escape everything that’s not a valid
 	// verilog identifier before adding any tcl API that returns IdString values
 	// to avoid -option injection
 

kernel/topo_scc.h

@@ -241,7 +241,7 @@ public:
     }
 
     // process all remaining nodes in the graph
-    TopoSortedSccs &process_all() {   
+    TopoSortedSccs &process_all() {
         node_enumerator nodes = graph.enumerate_nodes();
         // iterate over all nodes to ensure we process the whole graph
         while (!nodes.finished())