archives/pebble
2
0
Fork 0
mirror of https://github.com/google/pebble.git synced 2025-04-30 23:31:40 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

spelling: potential

Browse source 
Signed-off-by: Josh Soref <2119212+jsoref@users.noreply.github.com>
This commit is contained in:
Josh Soref 2025-01-28 15:29:24 -05:00
parent ed1e3c836b
commit e3602b52fc
2 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
src/fw/services/common/accel_manager.c
View file

@ -171,7 +171,7 @@ static void prv_double_tap_remove_subscriber_cb(PebbleTask task) {
//! 200ms, and subscriber B at 250ms, new samples will become available every //! 200ms, and subscriber B at 250ms, new samples will become available every
//! 200ms, so subscriber B's data buffer would not fill until 400ms, resulting //! 200ms, so subscriber B's data buffer would not fill until 400ms, resulting
//! in a 150ms latency. This is how the legacy implementation worked as well //! in a 150ms latency. This is how the legacy implementation worked as well
//! but is potentionally something we could improve in the future if it becomes //! but is potentially something we could improve in the future if it becomes
//! a problem. //! a problem.
static uint32_t prv_get_sample_interval_info(uint32_t *lowest_interval_us, static uint32_t prv_get_sample_interval_info(uint32_t *lowest_interval_us,
uint32_t *max_n_samples) { uint32_t *max_n_samples) {

2
tools/mpu_calc.py
View file

@ -63,7 +63,7 @@ def find_subregions_for_region(address, size):
smallest_block_size = max(round_up_to_power_of_two(size), MIN_REGION_SIZE) smallest_block_size = max(round_up_to_power_of_two(size), MIN_REGION_SIZE)
largest_block_size = min(round_up_to_power_of_two(size * NUM_SUBREGIONS), MAX_REGION_SIZE) largest_block_size = min(round_up_to_power_of_two(size * NUM_SUBREGIONS), MAX_REGION_SIZE)
# Iterate over the potentional candidates from smallest to largest # Iterate over the potential candidates from smallest to largest
current_block_size = smallest_block_size current_block_size = smallest_block_size
while current_block_size <= largest_block_size: while current_block_size <= largest_block_size:
subregion_size = current_block_size // NUM_SUBREGIONS subregion_size = current_block_size // NUM_SUBREGIONS