Tilesinfo struct

All tests works for systolic and hqr

include/libhqr.h

@@ -89,6 +89,19 @@ typedef struct libhqr_tiledesc_s{
     int p;     /**< The number of nodes per column in the data distribution */
 } libhqr_tiledesc_t;
 
+
+/**
+ * @brief Minimal structure to stock the information for each tile
+ */
+typedef struct libhqr_tileinfo_s{
+    int type;          /**< The type of the tile                             */
+    int currpiv;       /**< Number of the time annihilating the current tile */
+    int nextpiv;       /**< The next tile killed by the tile                 */
+    int prevpiv;       /**< The previous tile killed by the tile             */
+    int first_nextpiv; /**< The first next tile killed                       */
+    int first_prevpiv; /**< The first previous tile killed                   */
+} libhqr_tileinfo_t;
+
 struct libhqr_tree_s;
 typedef struct libhqr_tree_s libhqr_tree_t;
 
@@ -172,6 +185,7 @@ struct libhqr_tree_s {
     int a;
     /** Size of highest level tree (distributed one) */
     int p;
+    int domino;
     void *args;
 };
 
@@ -190,6 +204,14 @@ int  libhqr_hqr_init( libhqr_tree_t *qrtree,
                       int a, int p, int domino, int tsrr );
 void libhqr_hqr_finalize( libhqr_tree_t *qrtree );
 
+
+void libhqr_matrix_init(libhqr_tree_t *qrtree, const libhqr_tree_t *qrtree_init);
+int rdmtx_gettype(const libhqr_tree_t *qrtree, int k, int m);
+int rdmtx_currpiv(const libhqr_tree_t *qrtree, int k, int m);
+int rdmtx_nextpiv(const libhqr_tree_t *qrtree, int k, int p, int m);
+int rdmtx_prevpiv(const libhqr_tree_t *qrtree, int k, int p, int m);
+void libhqr_matrix_finalize(libhqr_tree_t *qrtree);
+
 /*
  * function for drawing the tree
  */