Home
last modified time | relevance | path

Searched refs:coor_best_bit (Results 1 – 3 of 3) sorted by relevance

/third_party/mindspore/mindspore/lite/tools/common/
Dgraph_util.h166 … size_t nz_cnt, size_t coor_best_bit, size_t bit_num, schema::TensorT *tensor) { in SparsityCompress() argument
179 bits[index++] = (coor_best_bit >> (8 - i - 1)) & 0x1; in SparsityCompress()
203 if (nz_value != zp || (di - prev_index) >= (size_t)(1 << coor_best_bit)) { in SparsityCompress()
214 for (size_t i = 0; i < coor_best_bit; i++) { in SparsityCompress()
215 bits[index++] = (coor >> (coor_best_bit - i - 1)) & 0x1; in SparsityCompress()
238 size_t *coor_best_bit) { in CalCoorBestBit() argument
259 *coor_best_bit = bit; in CalCoorBestBit()
296 size_t coor_best_bit = 0; in PackRepetition() local
297 …o nz_cnt = CalCoorBestBit<T>(quant_data, elem_cnt, quant_params, unique_value_bit, &coor_best_bit); in PackRepetition()
300 … 4 * 8 + bit_num + bit_num * unique_value_cnt + unique_value_bit * nz_cnt + nz_cnt * coor_best_bit; in PackRepetition()
[all …]
/third_party/mindspore/mindspore/lite/src/
Dweight_decoder.cc111 size_t coor_best_bit = 0; in SparseDecompress() local
114 coor_best_bit |= bit << static_cast<size_t>((kBit8 - i - 1)); in SparseDecompress()
159 for (size_t j = 0; j < coor_best_bit; j++) { in SparseDecompress()
161 coor |= bit << static_cast<size_t>((coor_best_bit - j - 1)); in SparseDecompress()
179 elem_cnt, coor_best_bit, dst_data, dst_tensor->Size()); in SparseDecompress()
182 elem_cnt, coor_best_bit, dst_data, dst_tensor->Size()); in SparseDecompress()
Dweight_decoder.h70 … size_t elem_cnt, size_t coor_best_bit, void *dst_data, size_t dst_data_size) { in UnSparseTensorData() argument
106 (un_sparsed_data.size() + (1 << coor_best_bit) - 1) * sizeof(T) < dst_data_size) { in UnSparseTensorData()
108 << " coor_best_bit: " << coor_best_bit; in UnSparseTensorData()