lib/maple_tree.c

1918

unsigned char start, unsigned char size, unsigned long s_max,

lib/maple_tree.c

1952

d_max = s_max;

lib/maple_tree.c

2449

unsigned long s_max, d_max;

lib/maple_tree.c

2461

s_max = cp->src[s].max;

lib/maple_tree.c

2479

d_max = node_copy(mas, src, s_offset, size, s_max, s_mt,

lib/maple_tree.c

2496

s_max = cp->src[s].max;

lib/maple_tree.c

2513

s_max = cp->src[s].max;

lib/ubsan.c

162

static s_max get_signed_val(struct type_descriptor *type, void *val)

lib/ubsan.c

165

unsigned extra_bits = sizeof(s_max)*8 - type_bit_width(type);

lib/ubsan.c

168

return ((s_max)ulong_val) << extra_bits >> extra_bits;

lib/ubsan.c

174

return *(s_max *)val;

tools/testing/radix-tree/maple.c

593

unsigned long s_min, s_max;

tools/testing/radix-tree/maple.c

605

s_entry = mas_range_load(&mas_start, &s_min, &s_max);

tools/testing/radix-tree/maple.c

610

if ((s_min == set[i+1]) && (s_max == set[i+2])) {

tools/testing/radix-tree/maple.c

613

} else if ((s_min != set[i+1]) && (s_max != set[i+2])) {

tools/testing/radix-tree/maple.c

631

} else if ((s_min == e_min) && (s_max == e_max)) {