Reformat jit sources with clang-tidy and format

This change is the result of running clang-tidy and clang-format on jit
sources.

1 files changed, 23 insertions, 19 deletions

diff --git a/src/jit/tinyarray.h b/src/jit/tinyarray.h
index 33f1ba4886..17d7e044b2 100644
--- a/src/jit/tinyarray.h
+++ b/src/jit/tinyarray.h
@@ -11,13 +11,13 @@
 // storagetype is the type (integral) which your array is going to be packed into
 // itemtype is the type of array elements
 // bits_per_element is size of the elements in bits
-template<class storageType, class itemType, int bits_per_element>
+template <class storageType, class itemType, int bits_per_element>
 class TinyArray
 {
 public:
     // operator[] returns a 'ref' (usually a ref to the element type)
-    // This presents a problem if you wanted to implement something like a 
-    // bitvector via this packed array, because you cannot make a ref to 
+    // This presents a problem if you wanted to implement something like a
+    // bitvector via this packed array, because you cannot make a ref to
     // the element type.
     //    The trick is you define something that acts like a ref (TinyArrayRef in this case)
     // which for our purposes means you can assign to and from it and our chosen
@@ -26,19 +26,19 @@ public:
     {
     public:
         // this is really the getter for the array.
-        operator itemType() 
+        operator itemType()
         {
-            storageType mask = ((1 << bits_per_element) - 1);
-            int shift = bits_per_element * index;
+            storageType mask  = ((1 << bits_per_element) - 1);
+            int         shift = bits_per_element * index;
 
             itemType result = (itemType)((*data >> shift) & mask);
             return result;
         }
 
-        void operator =(const itemType b)
+        void operator=(const itemType b)
         {
             storageType mask = ((1 << bits_per_element) - 1);
-            assert(itemType(b&mask) == b);
+            assert(itemType(b & mask) == b);
 
             mask <<= bits_per_element * index;
 
@@ -46,28 +46,32 @@ public:
             *data |= b << (bits_per_element * index);
         }
         friend class TinyArray;
+
     protected:
-        TinyArrayRef(storageType *d, int idx) : data(d), index(idx) {}
+        TinyArrayRef(storageType* d, int idx) : data(d), index(idx)
+        {
+        }
 
-        storageType *data;
-        int index;
-        
+        storageType* data;
+        int          index;
     };
 
-
     storageType data;
 
-    void clear() { data = 0; }
+    void clear()
+    {
+        data = 0;
+    }
 
-    TinyArrayRef operator [](unsigned int n)
+    TinyArrayRef operator[](unsigned int n)
     {
-        assert((n+1) * bits_per_element <= sizeof(itemType) * 8);
+        assert((n + 1) * bits_per_element <= sizeof(itemType) * 8);
         return TinyArrayRef(&data, n);
     }
-    // only use this for clearing it 
-    void operator=(void *rhs)
+    // only use this for clearing it
+    void operator=(void* rhs)
     {
-        assert(rhs==NULL);
+        assert(rhs == NULL);
         data = 0;
     }
 };