Linux Audio

Check our new training course

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