Home
last modified time | relevance | path

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

/linux/lib/
H A Dubsan.c162 static s_max get_signed_val(struct type_descriptor *type, void *val) in get_signed_val()
165 unsigned extra_bits = sizeof(s_max)*8 - type_bit_width(type); in get_signed_val()
168 return ((s_max)ulong_val) << extra_bits >> extra_bits; in get_signed_val()
174 return *(s_max *)val; in get_signed_val()
H A Dmaple_tree.c1918 unsigned char start, unsigned char size, unsigned long s_max, in node_copy() argument
1952 d_max = s_max; in node_copy()
2449 unsigned long s_max, d_max; in cp_data_write() local
2461 s_max = cp->src[s].max; in cp_data_write()
2479 d_max = node_copy(mas, src, s_offset, size, s_max, s_mt, in cp_data_write()
2496 s_max = cp->src[s].max; in cp_data_write()
2513 s_max = cp->src[s].max; in cp_data_write()
/linux/tools/testing/radix-tree/
H A Dmaple.c593 unsigned long s_min, s_max; in check_erase2_testset() local
605 s_entry = mas_range_load(&mas_start, &s_min, &s_max); in check_erase2_testset()
610 if ((s_min == set[i+1]) && (s_max == set[i+2])) { in check_erase2_testset()
613 } else if ((s_min != set[i+1]) && (s_max != set[i+2])) { in check_erase2_testset()
631 } else if ((s_min == e_min) && (s_max == e_max)) { in check_erase2_testset()