2  * QEMU 64-bit address ranges
4  * Copyright (c) 2015-2016 Red Hat, Inc.
28     if (b->lob && b->lob - 1 > a->upb) {  in range_compare()
29         return -1;  in range_compare()
31     if (a->lob && a->lob - 1 > b->upb) {  in range_compare()
40     GList *l;  in range_list_insert()  local
45     for (l = list; l && range_compare(l->data, data) < 0; l = l->next) {  in range_list_insert()
48     if (!l || range_compare(l->data, data) > 0) {  in range_list_insert()
50         return g_list_insert_before(list, l, data);  in range_list_insert()
54     range_extend(l->data, data);  in range_list_insert()
58     while (l->next && range_compare(l->data, l->next->data) == 0) {  in range_list_insert()
61         range_extend(l->data, l->next->data);  in range_list_insert()
62         g_free(l->next->data);  in range_list_insert()
63         new_l = g_list_delete_link(list, l->next);  in range_list_insert()
84     GList *l = in, *out = *rev;  in range_inverse_array()  local
86     for (l = in; l && range_upb(l->data) < low; l = l->next) {  in range_inverse_array()
90     if (!l) {  in range_inverse_array()
94     r = (Range *)l->data;  in range_inverse_array()
98         out = append_new_range(out, low, MIN(range_lob(r) - 1, high));  in range_inverse_array()
102     for (; l->next; l = l->next) {  in range_inverse_array()
103         r = (Range *)l->data;  in range_inverse_array()
104         rn = (Range *)l->next->data;  in range_inverse_array()
110                                    MIN(range_lob(rn) - 1, high));  in range_inverse_array()
115     r = (Range *)l->data;  in range_inverse_array()