Home
last modified time | relevance | path

Searched refs:expected_start (Results 1 – 4 of 4) sorted by relevance

/linux-6.12.1/tools/testing/memblock/tests/
Dalloc_api.c29 phys_addr_t expected_start; in alloc_top_down_simple_check() local
34 expected_start = memblock_end_of_DRAM() - SMP_CACHE_BYTES; in alloc_top_down_simple_check()
42 ASSERT_EQ(rgn->base, expected_start); in alloc_top_down_simple_check()
81 phys_addr_t expected_start; in alloc_top_down_disjoint_check() local
90 expected_start = memblock_end_of_DRAM() - alignment; in alloc_top_down_disjoint_check()
103 ASSERT_EQ(rgn2->base, expected_start); in alloc_top_down_disjoint_check()
558 phys_addr_t expected_start; in alloc_bottom_up_disjoint_check() local
567 expected_start = memblock_start_of_DRAM() + alignment; in alloc_bottom_up_disjoint_check()
580 ASSERT_EQ(rgn2->base, expected_start); in alloc_bottom_up_disjoint_check()
/linux-6.12.1/tools/tracing/rtla/src/
Dtimerlat_aa.c312 unsigned long long expected_start; in timerlat_aa_irq_handler() local
344 expected_start = taa_data->tlat_irq_timstamp - taa_data->tlat_irq_latency; in timerlat_aa_irq_handler()
362 if (expected_start < taa_data->timer_irq_start_time) in timerlat_aa_irq_handler()
363 taa_data->timer_irq_start_delay = taa_data->timer_irq_start_time - expected_start; in timerlat_aa_irq_handler()
373 if (expected_start > taa_data->prev_irq_timstamp + taa_data->prev_irq_duration) in timerlat_aa_irq_handler()
/linux-6.12.1/fs/bcachefs/
Dcompress.c45 void *expected_start = NULL; in bio_phys_contig() local
48 if (expected_start && in bio_phys_contig()
49 expected_start != page_address(bv.bv_page) + bv.bv_offset) in bio_phys_contig()
52 expected_start = page_address(bv.bv_page) + in bio_phys_contig()
Dbtree_gc.c199 struct bpos expected_start = !prev in btree_check_node_boundaries() local
209 if (bpos_eq(expected_start, cur->data->min_key)) in btree_check_node_boundaries()
224 if (bpos_lt(expected_start, cur->data->min_key)) { /* gap */ in btree_check_node_boundaries()
228 expected_start, in btree_check_node_boundaries()
238 ret = set_node_min(c, cur, expected_start); in btree_check_node_boundaries()
253 if (bpos_ge(expected_start, cur->data->max_key)) { /* fully? */ in btree_check_node_boundaries()
260 ret = set_node_min(c, cur, expected_start); in btree_check_node_boundaries()