113 	struct resource_map *p, *q;  in add_interval()  local
123 	q = kmalloc(sizeof(struct resource_map), GFP_KERNEL);  in add_interval()
124 	if (!q) {  in add_interval()
128 	q->base = base; q->num = num;  in add_interval()
129 	q->next = p->next; p->next = q;  in add_interval()
137 	struct resource_map *p, *q;  in sub_interval()  local
139 	for (p = map; ; p = q) {  in sub_interval()
140 		q = p->next;  in sub_interval()
141 		if (q == map)  in sub_interval()
143 		if ((q->base+q->num > base) && (base+num > q->base)) {  in sub_interval()
144 			if (q->base >= base) {  in sub_interval()
145 				if (q->base+q->num <= base+num) {  in sub_interval()
147 					p->next = q->next;  in sub_interval()
148 					kfree(q);  in sub_interval()
150 					q = p;  in sub_interval()
153 					q->num = q->base + q->num - base - num;  in sub_interval()
154 					q->base = base + num;  in sub_interval()
156 			} else if (q->base+q->num <= base+num) {  in sub_interval()
158 				q->num = base - q->base;  in sub_interval()
168 				p->num = q->base+q->num - p->base;  in sub_interval()
169 				q->num = base - q->base;  in sub_interval()
170 				p->next = q->next ; q->next = p;  in sub_interval()
1041 	struct resource_map *p, *q;  local
1043 	for (p = data->mem_db_valid.next; p != &data->mem_db_valid; p = q) {
1044 		q = p->next;
1047 	for (p = data->mem_db.next; p != &data->mem_db; p = q) {
1048 		q = p->next;
1051 	for (p = data->io_db.next; p != &data->io_db; p = q) {
1052 		q = p->next;