File: [local] / sys / dev / raidframe / rf_geniq.c (download)
Revision 1.1.1.1 (vendor branch), Tue Mar 4 16:09:48 2008 UTC (16 years, 4 months ago) by nbrk
Branch: OPENBSD_4_2_BASE, MAIN
CVS Tags: jornada-partial-support-wip, HEAD Changes since 1.1: +0 -0 lines
Import of OpenBSD 4.2 release kernel tree with initial code to support
Jornada 720/728, StrongARM 1110-based handheld PC.
At this point kernel roots on NFS and boots into vfs_mountroot() and traps.
What is supported:
- glass console, Jornada framebuffer (jfb) works in 16bpp direct color mode
(needs some palette tweaks for non black/white/blue colors, i think)
- saic, SA11x0 interrupt controller (needs cleanup)
- sacom, SA11x0 UART (supported only as boot console for now)
- SA11x0 GPIO controller fully supported (but can't handle multiple interrupt
handlers on one gpio pin)
- sassp, SSP port on SA11x0 that attaches spibus
- Jornada microcontroller (jmcu) to control kbd, battery, etc throught
the SPI bus (wskbd attaches on jmcu, but not tested)
- tod functions seem work
- initial code for SA-1111 (chip companion) : this is TODO
Next important steps, i think:
- gpio and intc on sa1111
- pcmcia support for sa11x0 (and sa1111 help logic)
- REAL root on nfs when we have PCMCIA support (we may use any of supported pccard NICs)
- root on wd0! (using already supported PCMCIA-ATA)
|
/* $OpenBSD: rf_geniq.c,v 1.5 2002/12/16 07:01:04 tdeval Exp $ */
/* $NetBSD: rf_geniq.c,v 1.3 1999/02/05 00:06:12 oster Exp $ */
/*
* Copyright (c) 1995 Carnegie-Mellon University.
* All rights reserved.
*
* Author: Daniel Stodolsky
*
* Permission to use, copy, modify and distribute this software and
* its documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
* FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie the
* rights to redistribute these changes.
*/
/*
* rf_geniq.c -- Code which implements Reed-Solomon encoding for RAID level 6.
*/
#define RF_UTILITY 1
#include "rf_pqdeg.h"
/*
* five bit lfsr
* poly - feedback connections
*
* val = value;
*/
int
lsfr_shift(unsigned val, unsigned poly)
{
unsigned new;
unsigned int i;
unsigned high = (val >> 4) & 1;
unsigned bit;
new = (poly & 1) ? high : 0;
for (i = 1; i <= 4; i++) {
bit = (val >> (i - 1)) & 1;
if (poly & (1 << i)) /* There is a feedback connection. */
new = new | ((bit ^ high) << i);
else
new = new | (bit << i);
}
return new;
}
/* Generate Q matrices for the data. */
RF_ua32_t rf_qfor[32];
int
main(void)
{
unsigned int i, j, l, a, b;
unsigned int val;
unsigned int r;
unsigned int m, p, q;
RF_ua32_t k;
printf("/*\n");
printf(" * rf_invertq.h\n");
printf(" */\n");
printf("/*\n");
printf(" * GENERATED FILE -- DO NOT EDIT\n");
printf(" */\n");
printf("\n");
printf("#ifndef\t_RF__RF_INVERTQ_H_\n");
printf("#define\t_RF__RF_INVERTQ_H_\n");
printf("\n");
printf("/*\n");
printf(" * rf_geniq.c must include rf_archs.h before including\n");
printf(" * this file (to get VPATH magic right with the way we\n");
printf(" * generate this file in kernel trees).\n");
printf(" */\n");
printf("/* #include \"rf_archs.h\" */\n");
printf("\n");
printf("#if\t(RF_INCLUDE_PQ > 0) || (RF_INCLUDE_RAID6 > 0)\n");
printf("\n");
printf("#define\tRF_Q_COLS\t32\n");
printf("RF_ua32_t rf_rn = {");
k[0] = 1;
for (j = 0; j < 31; j++)
k[j + 1] = lsfr_shift(k[j], 5);
for (j = 0; j < 32; j++)
printf("%d, ", k[j]);
printf("};\n");
printf("RF_ua32_t rf_qfor[32] = {\n");
for (i = 0; i < 32; i++) {
printf("/* i = %d */\t{0, ", i);
rf_qfor[i][0] = 0;
for (j = 1; j < 32; j++) {
val = j;
for (l = 0; l < i; l++)
val = lsfr_shift(val, 5);
rf_qfor[i][j] = val;
printf("%d, ", val);
}
printf("},\n");
}
printf("};\n");
printf("#define\tRF_Q_DATA_COL(col_num)\trf_rn[col_num],"
" rf_qfor[28-(col_num)]\n");
/* generate the inverse tables. (i,j,p,q) */
/* The table just stores a. Get b back from the parity */
printf("#ifdef\t_KERNEL\n");
printf("RF_ua1024_t rf_qinv[1];\t/* don't compile monster table"
" into kernel */\n");
printf("#elif\tdefined(NO_PQ)\n");
printf("RF_ua1024_t rf_qinv[29*29];\n");
printf("#else\t/* !_KERNEL && NO_PQ */\n");
printf("RF_ua1024_t rf_qinv[29*29] = {\n");
for (i = 0; i < 29; i++) {
for (j = 0; j < 29; j++) {
printf("/* i %d, j %d */\t{", i, j);
if (i == j)
for (l = 0; l < 1023; l++)
printf("0, ");
else {
for (p = 0; p < 32; p++)
for (q = 0; q < 32; q++) {
/*
* What are a, b such that a ^
* b == p; and qfor[(28-i)][a
* ^ rf_rn[i+1]] ^
* qfor[(28-j)][b ^
* rf_rn[j+1]] == q. Solve by
* guessing a. Then testing.
*/
for (a = 0; a < 32; a++) {
b = a ^ p;
if ((rf_qfor[28 - i]
[a ^ k[i + 1]] ^
rf_qfor[28 - j]
[b ^ k[j + 1]]) ==
q)
break;
}
if (a == 32)
printf("unable to solve"
" %d %d %d %d\n",
i, j, p, q);
printf("%d, ", a);
}
}
printf("},\n");
}
}
printf("};\n");
printf("\n#endif\t/* (RF_INCLUDE_PQ > 0) || (RF_INCLUDE_RAID6 > 0) */"
"\n\n");
printf("#endif\t/* !_KERNEL && NO_PQ */\n");
printf("#endif\t/* !_RF__RF_INVERTQ_H_ */\n");
exit(0);
}