Home
last modified time | relevance | path

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

/hal_espressif-latest/components/efuse/private_include/
Desp_efuse_utility.h50 … efuse_block, int starting_bit_num_in_reg, int num_bits_used_in_reg, void* arr, int* bits_counter);
71 …um_reg, esp_efuse_block_t efuse_block, int bit_start, int bit_count, void* cnt, int* bits_counter);
77 …reg, esp_efuse_block_t efuse_block, int bit_start, int bit_count, void* arr_in, int* bits_counter);
83 …eg, esp_efuse_block_t efuse_block, int bit_start, int bit_count, void* out_cnt, int* bits_counter);
89 …eg, esp_efuse_block_t efuse_block, int bit_start, int bit_count, void* arr_out, int* bits_counter);
/hal_espressif-latest/components/efuse/src/
Desp_efuse_utility.c52 int bits_counter = 0; in esp_efuse_utility_process() local
60 while (err == ESP_OK && req_size > bits_counter && field[i] != NULL) { in esp_efuse_utility_process()
67 while (err == ESP_OK && req_size > bits_counter && in esp_efuse_utility_process()
72 if ((bits_counter + num_bits) > req_size) { // Limits the length of the field. in esp_efuse_utility_process()
73 num_bits = req_size - bits_counter; in esp_efuse_utility_process()
77 … err = func_proc(num_reg, field[i]->efuse_block, start_bit, num_bits, ptr, &bits_counter); in esp_efuse_utility_process()
88 assert(bits_counter <= req_size); in esp_efuse_utility_process()
94 …reg, esp_efuse_block_t efuse_block, int bit_start, int bit_count, void* arr_out, int* bits_counter) in esp_efuse_utility_fill_buff() argument
100 int shift_bit = (*bits_counter) % 8; in esp_efuse_utility_fill_buff()
102 blob[(*bits_counter) / 8] |= (uint8_t)(reg_of_aligned_bits << shift_bit); in esp_efuse_utility_fill_buff()
[all …]
Desp_efuse_api.c164 int bits_counter = 0; in esp_efuse_get_field_size() local
168 bits_counter += field[i]->bit_count; in esp_efuse_get_field_size()
172 return bits_counter; in esp_efuse_get_field_size()