Changeset 19 for trunk/kernel/kern/dqdt.c

Timestamp:

Jun 3, 2017, 4:46:59 PM (7 years ago)

Author:

max@…

Message:

cosmetic, and a few typos

File:

• trunk/kernel/kern/dqdt.c (modified) (11 diffs)

trunk/kernel/kern/dqdt.c

@@ -1 +1 @@
 /*
  * dqdt.c - Distributed Quaternary Decision Tree implementation.
- * 
+ *
  * Author : Alain Greiner (2016)
  *
@@ -63 +63 @@
         }
     }
-}  
-    
+}
+
 ////////////////////////////////////
 uint32_t dqdt_init( uint32_t x_size,
@@ -113 +113 @@
         node->children[2] = XPTR_NULL;
         node->children[3] = XPTR_NULL;
- 
+
         // compute masks depending on level : 0x1, 0x3, 0x7, 0xF, 0x1F etc.
         mask  = (1<<level)-1;
@@ -121 +121 @@
         if( ((x & mask) == 0) && ((y & mask) == 0) );
         {
-            // set parent extended pointer 
+            // set parent extended pointer
             p_cxy = ((x & ~pmask)<<y_width) + (y & ~pmask);
             node->parent = XPTR( p_cxy , &cluster->dqdt_tbl[level+1] );
 
-            // set child[0] extended pointer (same [x,y] coordinates) 
+            // set child[0] extended pointer (same [x,y] coordinates)
             if ( level > 0 )
             {
@@ -188 +188 @@
     if ( parent != XPTR_NULL )
     {
-        dqdt_propagate( parent, threads_var, pages_var );          
+        dqdt_propagate( parent, threads_var, pages_var );
     }
 }
@@ -217 +217 @@
 {
         cluster_t * cluster = LOCAL_CLUSTER;
-    
-    // register change for future propagation in DQDT 
+
+    // register change for future propagation in DQDT
     hal_atomic_add( &cluster->threads_var , increment );
 
@@ -229 +229 @@
 {
         cluster_t * cluster = LOCAL_CLUSTER;
-    
-    // register change for future propagation in DQDT 
+
+    // register change for future propagation in DQDT
     hal_atomic_add( &cluster->pages_var , increment );
 
@@ -270 +270 @@
         {
             cxy  = (cxy_t)GET_CXY( child );
-            ptr  = (dqdt_node_t *)GET_PTR( child ); 
+            ptr  = (dqdt_node_t *)GET_PTR( child );
             if( for_memory ) load = hal_remote_lw( XPTR( cxy , &ptr->pages ) );
             else             load = hal_remote_lw( XPTR( cxy , &ptr->threads ) );
@@ -276 +276 @@
             {
                 load_min = load;
-                select   = i; 
-            }      
+                select   = i;
+            }
         }
     }
 
     // select the child with the lowest load
-    return dqdt_select_cluster( node_copy.children[select], for_memory ); 
+    return dqdt_select_cluster( node_copy.children[select], for_memory );
 }
 
@@ -294 +294 @@
 
     // call recursive function
-    return dqdt_select_cluster( root , false ); 
+    return dqdt_select_cluster( root , false );
 }
 
@@ -306 +306 @@
 
     // call recursive function
-    return dqdt_select_cluster( root , true ); 
-}
-
+    return dqdt_select_cluster( root , true );
+}
+