| 
 | 1 | +/*  | 
 | 2 | + * SPDX-FileCopyrightText: 2024 Binsparse Developers  | 
 | 3 | + *  | 
 | 4 | + * SPDX-License-Identifier: BSD-3-Clause  | 
 | 5 | + */  | 
 | 6 | + | 
 | 7 | +#pragma once  | 
 | 8 | + | 
 | 9 | +#include <binsparse/array.h>  | 
 | 10 | +#include <binsparse/structure.h>  | 
 | 11 | + | 
 | 12 | +typedef enum {  | 
 | 13 | +  BSP_TENSOR_SPARSE = 0,  | 
 | 14 | +  BSP_TENSOR_DENSE = 1,  | 
 | 15 | +  BSP_TENSOR_ELEMENT = 2,  | 
 | 16 | +} bsp_level_kind_t;  | 
 | 17 | + | 
 | 18 | +typedef struct {  | 
 | 19 | +  bsp_level_kind_t kind;  | 
 | 20 | +  // data here should be bsp_element_t*, bsp_sparse_t*, or bsp_dense_t*  | 
 | 21 | +  void* data;  | 
 | 22 | +} bsp_level_t;  | 
 | 23 | + | 
 | 24 | +// corresponds to BSP_TENSOR_ELEMENT  | 
 | 25 | +typedef struct {  | 
 | 26 | +  bsp_array_t values;  | 
 | 27 | +} bsp_element_t;  | 
 | 28 | + | 
 | 29 | +// corresponds to BSP_TENSOR_SPARSE  | 
 | 30 | +typedef struct {  | 
 | 31 | +  int rank;  | 
 | 32 | +  // pointers_to, while it will only ever point to one bsp_array_t, must be kept  | 
 | 33 | +  // as a pointer (rather than a struct) because there are cases where it MUST  | 
 | 34 | +  // be null.  | 
 | 35 | +  bsp_array_t* pointers_to;  | 
 | 36 | +  // indices is supposed to be an array of bsp_array_t's.  | 
 | 37 | +  bsp_array_t* indices;  | 
 | 38 | +  bsp_level_t* child;  | 
 | 39 | +} bsp_sparse_t;  | 
 | 40 | + | 
 | 41 | +// corresponds to BSP_TENSOR_DENSE  | 
 | 42 | +typedef struct {  | 
 | 43 | +  int rank;  | 
 | 44 | +  bsp_level_t* child;  | 
 | 45 | +} bsp_dense_t;  | 
 | 46 | + | 
 | 47 | +typedef struct {  | 
 | 48 | +  int rank;  | 
 | 49 | +  size_t* dims;  | 
 | 50 | +  size_t* transpose;  | 
 | 51 | +  size_t nnz;  | 
 | 52 | +  bool is_iso;  | 
 | 53 | + | 
 | 54 | +  bsp_level_t* level;  | 
 | 55 | +  // don't think too much about this at the moment.  | 
 | 56 | +  bsp_structure_t structure;  | 
 | 57 | +} bsp_tensor_t;  | 
 | 58 | + | 
 | 59 | +static inline bsp_tensor_t bsp_construct_default_tensor_t() {  | 
 | 60 | +  bsp_tensor_t tensor;  | 
 | 61 | +  tensor.structure = BSP_GENERAL;  | 
 | 62 | +  tensor.is_iso = false;  | 
 | 63 | +  tensor.nnz = tensor.rank = 0;  | 
 | 64 | +  tensor.dims = NULL;  | 
 | 65 | +  tensor.transpose = NULL;  | 
 | 66 | + | 
 | 67 | +  tensor.level = NULL;  | 
 | 68 | +  return tensor;  | 
 | 69 | +}  | 
 | 70 | + | 
 | 71 | +static void bsp_destroy_level_t(bsp_level_t* level) {  | 
 | 72 | +  if (level == NULL)  | 
 | 73 | +    return;  | 
 | 74 | +  switch (level->kind) {  | 
 | 75 | +  case BSP_TENSOR_ELEMENT: {  | 
 | 76 | +    bsp_element_t* element = (bsp_element_t*) level->data;  | 
 | 77 | +    bsp_destroy_array_t(element->values);  | 
 | 78 | +    free(element);  | 
 | 79 | +    break;  | 
 | 80 | +  }  | 
 | 81 | +  case BSP_TENSOR_DENSE: {  | 
 | 82 | +    bsp_dense_t* dense = (bsp_dense_t*) level->data;  | 
 | 83 | +    bsp_destroy_level_t(dense->child);  | 
 | 84 | +    free(dense);  | 
 | 85 | +    break;  | 
 | 86 | +  }  | 
 | 87 | +  case BSP_TENSOR_SPARSE: {  | 
 | 88 | +    bsp_sparse_t* sparse = (bsp_sparse_t*) level->data;  | 
 | 89 | + | 
 | 90 | +    if (sparse->pointers_to != NULL)  | 
 | 91 | +      bsp_destroy_array_t(*sparse->pointers_to);  | 
 | 92 | +    if (sparse->indices != NULL) {  | 
 | 93 | +      for (int i = 0; i < sparse->rank; i++) {  | 
 | 94 | +        bsp_destroy_array_t(sparse->indices[i]);  | 
 | 95 | +      }  | 
 | 96 | +    }  | 
 | 97 | +    bsp_destroy_level_t(sparse->child);  | 
 | 98 | +    free(sparse);  | 
 | 99 | +    break;  | 
 | 100 | +  }  | 
 | 101 | +  default:;  | 
 | 102 | +  }  | 
 | 103 | +}  | 
 | 104 | + | 
 | 105 | +static bsp_array_t bsp_get_tensor_values(bsp_tensor_t tensor) {  | 
 | 106 | +  bsp_level_t* level = tensor.level;  | 
 | 107 | +  while (level != NULL) {  | 
 | 108 | +    switch (level->kind) {  | 
 | 109 | +    case BSP_TENSOR_ELEMENT: {  | 
 | 110 | +      bsp_element_t* element = (bsp_element_t*) level->data;  | 
 | 111 | +      return element->values;  | 
 | 112 | +      break;  | 
 | 113 | +    }  | 
 | 114 | +    case BSP_TENSOR_SPARSE: {  | 
 | 115 | +      bsp_sparse_t* sparse = (bsp_sparse_t*) level->data;  | 
 | 116 | +      level = sparse->child;  | 
 | 117 | +      break;  | 
 | 118 | +    }  | 
 | 119 | +    case BSP_TENSOR_DENSE: {  | 
 | 120 | +      bsp_dense_t* dense = (bsp_dense_t*) level->data;  | 
 | 121 | +      level = dense->child;  | 
 | 122 | +      break;  | 
 | 123 | +    }  | 
 | 124 | +    default:;  | 
 | 125 | +    }  | 
 | 126 | +  }  | 
 | 127 | +  // this should never happen!  | 
 | 128 | +  assert(false);  | 
 | 129 | +}  | 
 | 130 | + | 
 | 131 | +static inline void bsp_destroy_tensor_t(bsp_tensor_t tensor) {  | 
 | 132 | +  bsp_destroy_level_t(tensor.level);  | 
 | 133 | +  if (tensor.dims != NULL)  | 
 | 134 | +    free(tensor.dims);  | 
 | 135 | +  if (tensor.transpose != NULL)  | 
 | 136 | +    free(tensor.transpose);  | 
 | 137 | +}  | 
0 commit comments