projects / deliverable / linux.git / blame
| Commit | Line | Data |
|---|---|---|
| 88278ca2 | 1 | /* |
| 1da177e4 LT |
2 | * ranges.c: Handle ranges in newer proms for obio/sbus. |
| 3 | * | |
| 4 | * Copyright (C) 1995 David S. Miller (davem@caip.rutgers.edu) | |
| 5 | * Copyright (C) 1997 Jakub Jelinek (jj@sunsite.mff.cuni.cz) | |
| 6 | */ | |
| 7 | ||
| 8 | #include <linux/init.h> | |
| 6943f3da SR |
9 | #include <linux/module.h> |
| 10 | ||
| 1da177e4 LT |
11 | #include <asm/openprom.h> |
| 12 | #include <asm/oplib.h> | |
| 13 | #include <asm/types.h> | |
| 1da177e4 LT |
14 | #include <asm/system.h> |
| 15 | ||
| 16 | struct linux_prom_ranges promlib_obio_ranges[PROMREG_MAX]; | |
| 17 | int num_obio_ranges; | |
| 18 | ||
| 19 | /* Adjust register values based upon the ranges parameters. */ | |
| 20 | static void | |
| 21 | prom_adjust_regs(struct linux_prom_registers *regp, int nregs, | |
| 22 | struct linux_prom_ranges *rangep, int nranges) | |
| 23 | { | |
| 24 | int regc, rngc; | |
| 25 | ||
| 26 | for (regc = 0; regc < nregs; regc++) { | |
| 27 | for (rngc = 0; rngc < nranges; rngc++) | |
| 28 | if (regp[regc].which_io == rangep[rngc].ot_child_space) | |
| 29 | break; /* Fount it */ | |
| 30 | if (rngc == nranges) /* oops */ | |
| 31 | prom_printf("adjust_regs: Could not find range with matching bus type...\n"); | |
| 32 | regp[regc].which_io = rangep[rngc].ot_parent_space; | |
| 33 | regp[regc].phys_addr -= rangep[rngc].ot_child_base; | |
| 34 | regp[regc].phys_addr += rangep[rngc].ot_parent_base; | |
| 35 | } | |
| 36 | } | |
| 37 | ||
| 38 | void | |
| 39 | prom_adjust_ranges(struct linux_prom_ranges *ranges1, int nranges1, | |
| 40 | struct linux_prom_ranges *ranges2, int nranges2) | |
| 41 | { | |
| 42 | int rng1c, rng2c; | |
| 43 | ||
| 44 | for(rng1c=0; rng1c < nranges1; rng1c++) { | |
| 45 | for(rng2c=0; rng2c < nranges2; rng2c++) | |
| 46 | if(ranges1[rng1c].ot_parent_space == ranges2[rng2c].ot_child_space && | |
| 47 | ranges1[rng1c].ot_parent_base >= ranges2[rng2c].ot_child_base && | |
| 48 | ranges2[rng2c].ot_child_base + ranges2[rng2c].or_size - ranges1[rng1c].ot_parent_base > 0U) | |
| 49 | break; | |
| 50 | if(rng2c == nranges2) /* oops */ | |
| 51 | prom_printf("adjust_ranges: Could not find matching bus type...\n"); | |
| 52 | else if (ranges1[rng1c].ot_parent_base + ranges1[rng1c].or_size > ranges2[rng2c].ot_child_base + ranges2[rng2c].or_size) | |
| 53 | ranges1[rng1c].or_size = | |
| 54 | ranges2[rng2c].ot_child_base + ranges2[rng2c].or_size - ranges1[rng1c].ot_parent_base; | |
| 55 | ranges1[rng1c].ot_parent_space = ranges2[rng2c].ot_parent_space; | |
| 56 | ranges1[rng1c].ot_parent_base += ranges2[rng2c].ot_parent_base; | |
| 57 | } | |
| 58 | } | |
| 59 | ||
| 60 | /* Apply probed obio ranges to registers passed, if no ranges return. */ | |
| 61 | void | |
| 62 | prom_apply_obio_ranges(struct linux_prom_registers *regs, int nregs) | |
| 63 | { | |
| 64 | if(num_obio_ranges) | |
| 65 | prom_adjust_regs(regs, nregs, promlib_obio_ranges, num_obio_ranges); | |
| 66 | } | |
| 6943f3da | 67 | EXPORT_SYMBOL(prom_apply_obio_ranges); |
| 1da177e4 LT |
68 | |
| 69 | void __init prom_ranges_init(void) | |
| 70 | { | |
| 71 | int node, obio_node; | |
| 72 | int success; | |
| 73 | ||
| 74 | num_obio_ranges = 0; | |
| 75 | ||
| 76 | /* Check for obio and sbus ranges. */ | |
| 77 | node = prom_getchild(prom_root_node); | |
| 78 | obio_node = prom_searchsiblings(node, "obio"); | |
| 79 | ||
| 80 | if(obio_node) { | |
| 81 | success = prom_getproperty(obio_node, "ranges", | |
| 82 | (char *) promlib_obio_ranges, | |
| 83 | sizeof(promlib_obio_ranges)); | |
| 84 | if(success != -1) | |
| 85 | num_obio_ranges = (success/sizeof(struct linux_prom_ranges)); | |
| 86 | } | |
| 87 | ||
| 88 | if(num_obio_ranges) | |
| 89 | prom_printf("PROMLIB: obio_ranges %d\n", num_obio_ranges); | |
| 90 | ||
| 91 | return; | |
| 92 | } | |
| 93 | ||
| 94 | void | |
| 95 | prom_apply_generic_ranges (int node, int parent, struct linux_prom_registers *regs, int nregs) | |
| 96 | { | |
| 97 | int success; | |
| 98 | int num_ranges; | |
| 99 | struct linux_prom_ranges ranges[PROMREG_MAX]; | |
| 100 | ||
| 101 | success = prom_getproperty(node, "ranges", | |
| 102 | (char *) ranges, | |
| 103 | sizeof (ranges)); | |
| 104 | if (success != -1) { | |
| 105 | num_ranges = (success/sizeof(struct linux_prom_ranges)); | |
| 106 | if (parent) { | |
| 107 | struct linux_prom_ranges parent_ranges[PROMREG_MAX]; | |
| 108 | int num_parent_ranges; | |
| 109 | ||
| 110 | success = prom_getproperty(parent, "ranges", | |
| 111 | (char *) parent_ranges, | |
| 112 | sizeof (parent_ranges)); | |
| 113 | if (success != -1) { | |
| 114 | num_parent_ranges = (success/sizeof(struct linux_prom_ranges)); | |
| 115 | prom_adjust_ranges (ranges, num_ranges, parent_ranges, num_parent_ranges); | |
| 116 | } | |
| 117 | } | |
| 118 | prom_adjust_regs(regs, nregs, ranges, num_ranges); | |
| 119 | } | |
| 120 | } |