Lines Matching defs:bre
27 struct badrange_entry *bre, u64 addr, u64 length)
30 bre->start = addr;
31 bre->length = length;
32 list_add_tail(&bre->list, &badrange->list);
38 struct badrange_entry *bre;
40 bre = kzalloc(sizeof(*bre), flags);
41 if (!bre)
44 append_badrange_entry(badrange, bre, addr, length);
50 struct badrange_entry *bre, *bre_new;
68 list_for_each_entry(bre, &badrange->list, list)
69 if (bre->start == addr) {
71 if (bre->length != length)
72 bre->length = length;
106 struct badrange_entry *bre, *next;
112 * [bre->start, bre_end] is the badrange_list entry we're comparing
118 list_for_each_entry_safe(bre, next, badrange_list, list) {
119 u64 bre_end = bre->start + bre->length - 1;
124 if (bre->start > clr_end)
127 if ((bre->start >= start) && (bre_end <= clr_end)) {
128 list_del(&bre->list);
129 kfree(bre);
133 if ((start <= bre->start) && (clr_end > bre->start)) {
134 bre->length -= clr_end - bre->start + 1;
135 bre->start = clr_end + 1;
138 /* Adjust bre->length for partial clearing at the tail end */
139 if ((bre->start < start) && (bre_end <= clr_end)) {
140 /* bre->start remains the same */
141 bre->length = start - bre->start;
149 if ((bre->start < start) && (bre_end > clr_end)) {
157 bre->length = start - bre->start;
216 struct badrange_entry *bre;
221 list_for_each_entry(bre, &badrange->list, list) {
222 u64 bre_end = bre->start + bre->length - 1;
227 if (bre->start > range->end)
230 if (bre->start >= range->start) {
231 u64 start = bre->start;
235 len = bre->length;
238 - bre->start;
246 if (bre->start < range->start) {
250 len = bre->start + bre->length - range->start;