Lines Matching defs:resources
29 u8 behind_bridge, struct resource_lists *resources);
31 u8 behind_bridge, struct resource_lists *resources);
391 * do_pre_bridge_resource_split - find node of resources that are unused
469 * do_bridge_resource_split - find one node of resources that aren't in use
711 * @head: the list to search for resources
1248 * This is only used if we don't have resources for hot add.
1636 * resources already. If so, we'll skip the attempt to
2218 * @resources: pointer to set of resource lists
2223 u8 behind_bridge, struct resource_lists *resources)
2250 rc = configure_new_function(ctrl, new_slot, behind_bridge, resources);
2260 cpqhp_return_board_resources(new_slot, resources);
2313 * @resources: pointer to set of resource lists
2320 struct resource_lists *resources)
2366 bus_node = get_max_resource(&(resources->bus_head), 1);
2402 io_node = get_max_resource(&(resources->io_head), 0x1000);
2405 mem_node = get_max_resource(&(resources->mem_head), 0x100000);
2408 p_mem_node = get_max_resource(&(resources->p_mem_head), 0x100000);
2423 if (!resources->irqs) {
2431 irqs.barber_pole = resources->irqs->barber_pole;
2432 irqs.interrupt[0] = resources->irqs->interrupt[0];
2433 irqs.interrupt[1] = resources->irqs->interrupt[1];
2434 irqs.interrupt[2] = resources->irqs->interrupt[2];
2435 irqs.interrupt[3] = resources->irqs->interrupt[3];
2436 irqs.valid_INT = resources->irqs->valid_INT;
2448 * if there is a problem,we can just use these to free resources
2470 /* If we have IO resources copy them and fill in the bridge's
2482 /* Copy the memory resources and fill in the bridge's memory
2543 if (resources->irqs) {
2544 resources->irqs->interrupt[0] = irqs.interrupt[0];
2545 resources->irqs->interrupt[1] = irqs.interrupt[1];
2546 resources->irqs->interrupt[2] = irqs.interrupt[2];
2547 resources->irqs->interrupt[3] = irqs.interrupt[3];
2548 resources->irqs->valid_INT = irqs.valid_INT;
2560 /* Return unused bus resources
2578 return_resource(&(resources->bus_head), temp_resources.bus_head);
2595 return_resource(&(resources->io_head), io_node);
2614 return_resource(&(resources->io_head), io_node);
2620 return_resource(&(resources->io_head), io_node);
2646 return_resource(&(resources->mem_head), mem_node);
2665 /* Return unused resources to the pool */
2666 return_resource(&(resources->mem_head), mem_node);
2672 return_resource(&(resources->mem_head), mem_node);
2698 return_resource(&(resources->p_mem_head), p_mem_node);
2717 return_resource(&(resources->p_mem_head), p_mem_node);
2723 return_resource(&(resources->p_mem_head), p_mem_node);
2781 io_node = get_io_resource(&(resources->io_head), base);
2798 p_mem_node = get_resource(&(resources->p_mem_head), base);
2814 mem_node = get_resource(&(resources->mem_head), base);
2852 if (temp_byte && resources->irqs &&
2853 (resources->irqs->valid_INT &
2854 (0x01 << ((temp_byte + resources->irqs->barber_pole - 1) & 0x03)))) {
2856 IRQ = resources->irqs->interrupt[(temp_byte +
2857 resources->irqs->barber_pole - 1) & 0x03];
2879 resources->irqs->interrupt[(temp_byte + resources->irqs->barber_pole - 1) & 0x03] = IRQ;
2880 resources->irqs->valid_INT |= 0x01 << (temp_byte + resources->irqs->barber_pole - 1) & 0x03;
2918 return_resource(&(resources->bus_head), hold_bus_node);
2919 return_resource(&(resources->io_head), hold_IO_node);
2920 return_resource(&(resources->mem_head), hold_mem_node);
2921 return_resource(&(resources->p_mem_head), hold_p_mem_node);