110 	struct resource_map *p, *q;  in add_interval()  local
112 	for (p = map; ; p = p->next) {  in add_interval()
113 		if ((p != map) && (p->base+p->num >= base)) {  in add_interval()
114 			p->num = max(num + base - p->base, p->num);  in add_interval()
117 		if ((p->next == map) || (p->next->base > base+num-1))  in add_interval()
126 	q->next = p->next; p->next = q;  in add_interval()
134 	struct resource_map *p, *q;  in sub_interval()  local
136 	for (p = map; ; p = q) {  in sub_interval()
137 		q = p->next;  in sub_interval()
144 					p->next = q->next;  in sub_interval()
147 					q = p;  in sub_interval()
158 				p = kmalloc(sizeof(struct resource_map),  in sub_interval()
160 				if (!p) {  in sub_interval()
164 				p->base = base+num;  in sub_interval()
165 				p->num = q->base+q->num - p->base;  in sub_interval()
167 				p->next = q->next ; q->next = p;  in sub_interval()
1042 	struct resource_map *p, *q;  local
1044 	for (p = data->mem_db_valid.next; p != &data->mem_db_valid; p = q) {
1045 		q = p->next;
1046 		kfree(p);
1048 	for (p = data->mem_db.next; p != &data->mem_db; p = q) {
1049 		q = p->next;
1050 		kfree(p);
1052 	for (p = data->io_db.next; p != &data->io_db; p = q) {
1053 		q = p->next;
1054 		kfree(p);
1078 	struct resource_map *p;  local
1084 	for (p = data->io_db.next; p != &data->io_db; p = p->next) {
1089 				((unsigned long) p->base),
1090 				((unsigned long) p->base + p->num - 1));
1134 	struct resource_map *p;  local
1140 	for (p = data->mem_db_valid.next; p != &data->mem_db_valid;
1141 	     p = p->next) {
1146 				((unsigned long) p->base),
1147 				((unsigned long) p->base + p->num - 1));
1150 	for (p = data->mem_db.next; p != &data->mem_db; p = p->next) {
1155 				((unsigned long) p->base),
1156 				((unsigned long) p->base + p->num - 1));