Lines Matching defs:banks

73 int sbdp_add_nodes_banks(pnode_t node, sbdp_bank_t **banks);
561 * swap list of banks
609 * Skip invalid banks
1645 * bad banks
1666 * This function compares the list of banks passed with the banks
1670 sbdp_check_seg_with_banks(sbdp_seg_t *seg, sbdp_bank_t *banks)
1675 for (cur_bank = seg->banks; cur_bank; cur_bank = cur_bank->seg_next) {
1676 for (bank = banks; bank; bank = bank->bd_next) {
1686 SBDP_DBG_MEM("banks found = %d total banks = %d\n", i, seg->nbanks);
1688 * If we find the same num of banks that are equal, then this segment
1699 * This routine determines if any of the memory banks on the board
1721 * Get the banks for this board
1731 for (bankp = bdp->banks; bankp; bankp = bankp->bd_next)
1736 * If there are no banks in the board, then the board is
1755 * Make sure that this segment is only composed of the banks
1759 is_interleave = sbdp_check_seg_with_banks(seg, bdp->banks);
1768 * Each node has 4 logical banks. This routine adds all the banks (including
1773 sbdp_add_nodes_banks(pnode_t node, sbdp_bank_t **banks)
1796 bank->bd_next = *banks;
1797 *banks = bank;
1834 * Each bd has the potential of having mem banks on it. The banks
1835 * may be empty or not. This routine gets all the mem banks
1847 if (bdp->banks != NULL) {
1851 bdp->banks = NULL;
1854 (void) sbdp_add_nodes_banks(lists[i], &bdp->banks);
1859 * swap the list of banks for the 2 boards
1869 tmp_ptr = bdp1->banks;
1870 bdp1->banks = bdp2->banks;
1871 bdp2->banks = tmp_ptr;
1875 * free all the banks on the board. Note that a bank node belongs
1885 for (bkp = bdp->banks; bkp; ) {
1897 bdp->banks = NULL;
1909 for (bp = bdp->banks, i = 0; bp; bp = bp->bd_next, i++) {
1934 for (bp = seg->banks, i = 0; bp; bp = bp->seg_next, i++) {
1978 bank->seg_next = cur_seg->banks;
1979 cur_seg->banks = bank;
2034 curpp = &cur_seg->banks;
2053 * No banks left on this segment, remove the segment
2055 SBDP_DBG_MEM("No banks left in this segment, removing it\n");