add licence and improving code visual
This commit is contained in:
chacha
17
Draw.c
17
Draw.c
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <cvg.h>
|
||||
#include <sst1init.h>
|
||||
|
||||
|
||||
23
Draw.h
23
Draw.h
@@ -1,6 +1,27 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef _DEF_DRAW_H_
|
||||
#define _DEF_DRAW_H_
|
||||
|
||||
void drawTriangle( const SstRegs *sst, const int x, const int y, const int tSize);
|
||||
void
|
||||
drawTriangle( const SstRegs *sst,
|
||||
const int x,
|
||||
const int y,
|
||||
const int tSize);
|
||||
|
||||
#endif //_DEF_DRAW_H_
|
||||
|
||||
197
FaultSources.c
197
FaultSources.c
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
|
||||
@@ -21,7 +38,7 @@ def_sFaultSourceScoreRec ar_dFaultScores_sorted[NB_FAULT_SOURCE];
|
||||
void
|
||||
FaultSource_Reset()
|
||||
{
|
||||
for(def_eFaultSource idx=0;idx<NB_FAULT_SOURCE;idx++)
|
||||
for(def_eFaultSource idx = 0; idx < NB_FAULT_SOURCE; idx++ )
|
||||
ar_dFaultScores[idx].dScore = 0.0;
|
||||
}
|
||||
|
||||
@@ -29,9 +46,7 @@ static unsigned long
|
||||
FaultSource_getNbDeps(const def_eFaultSource eFaultSource)
|
||||
{
|
||||
unsigned long res = 0;
|
||||
for(unsigned long idx = 0;
|
||||
idx < NB_FAULT_SOURCE;
|
||||
idx++)
|
||||
for(unsigned long idx = 0; idx < NB_FAULT_SOURCE; idx++ )
|
||||
if(ar_dFaultScores[idx].eParrentFaultSource == eFaultSource)
|
||||
res++;
|
||||
return res;
|
||||
@@ -47,16 +62,15 @@ FaultSource_AddScore( def_eFaultSource eFaultSource,
|
||||
ar_dFaultScores[eFaultSource].dScore += dScore;
|
||||
eFaultSource = ar_dFaultScores[eFaultSource].eParrentFaultSource;
|
||||
dDivider = FaultSource_getNbDeps(eFaultSource);
|
||||
if(dDivider <= 0) dDivider = 1.0;
|
||||
if(dDivider <= 0)
|
||||
dDivider = 1.0;
|
||||
}while(eFaultSource != _INVALID_FAULT_SOURCE_);
|
||||
}
|
||||
|
||||
static unsigned long
|
||||
FaultSource_Sort_GetIdx(const def_eFaultSource eFaultSource)
|
||||
{
|
||||
for(unsigned long idx = 0;
|
||||
idx < NB_FAULT_SOURCE;
|
||||
idx++)
|
||||
for(unsigned long idx = 0; idx < NB_FAULT_SOURCE; idx++ )
|
||||
if(ar_dFaultScores_sorted[idx].eThisFaultSource == eFaultSource)
|
||||
return idx;
|
||||
return _INVALID_FAULT_SOURCE_;
|
||||
@@ -67,9 +81,9 @@ FaultSource_Sort_Swap( const def_eFaultSource eFaultSourceCurrentA,
|
||||
const def_eFaultSource eFaultSourceCurrentB)
|
||||
{
|
||||
static def_sFaultSourceScoreRec tmp;
|
||||
memcpy(&tmp,&ar_dFaultScores_sorted[eFaultSourceCurrentA],sizeof(def_sFaultSourceScoreRec));
|
||||
memcpy(&ar_dFaultScores_sorted[eFaultSourceCurrentA],&ar_dFaultScores_sorted[eFaultSourceCurrentB],sizeof(def_sFaultSourceScoreRec));
|
||||
memcpy(&ar_dFaultScores_sorted[eFaultSourceCurrentB],&tmp,sizeof(def_sFaultSourceScoreRec));
|
||||
memcpy(&tmp, &ar_dFaultScores_sorted[eFaultSourceCurrentA], sizeof(def_sFaultSourceScoreRec));
|
||||
memcpy(&ar_dFaultScores_sorted[eFaultSourceCurrentA], &ar_dFaultScores_sorted[eFaultSourceCurrentB], sizeof(def_sFaultSourceScoreRec));
|
||||
memcpy(&ar_dFaultScores_sorted[eFaultSourceCurrentB], &tmp, sizeof(def_sFaultSourceScoreRec));
|
||||
}
|
||||
|
||||
void
|
||||
@@ -85,60 +99,56 @@ FaultSource_Sort()
|
||||
bSwapped = 0;
|
||||
|
||||
for(long eFaultSourceCurrentComp=0;
|
||||
eFaultSourceCurrentComp<(NB_FAULT_SOURCE-1);
|
||||
eFaultSourceCurrentComp++)
|
||||
eFaultSourceCurrentComp < (NB_FAULT_SOURCE - 1);
|
||||
eFaultSourceCurrentComp++ )
|
||||
{
|
||||
if( ar_dFaultScores_sorted[eFaultSourceCurrentComp].dScore
|
||||
< ar_dFaultScores_sorted[eFaultSourceCurrentComp+1].dScore)
|
||||
< ar_dFaultScores_sorted[eFaultSourceCurrentComp + 1].dScore)
|
||||
{
|
||||
FaultSource_Sort_Swap(eFaultSourceCurrentComp,eFaultSourceCurrentComp+1);
|
||||
bSwapped=1;
|
||||
FaultSource_Sort_Swap(eFaultSourceCurrentComp, eFaultSourceCurrentComp + 1);
|
||||
bSwapped = 1;
|
||||
break;
|
||||
}
|
||||
}
|
||||
//if(!bSwapped)
|
||||
// break;
|
||||
for(long eFaultSourceCurrentComp=(NB_FAULT_SOURCE-2);
|
||||
eFaultSourceCurrentComp>=0;
|
||||
eFaultSourceCurrentComp--)
|
||||
for(long eFaultSourceCurrentComp = (NB_FAULT_SOURCE-2);
|
||||
eFaultSourceCurrentComp >= 0;
|
||||
eFaultSourceCurrentComp-- )
|
||||
{
|
||||
if( ar_dFaultScores_sorted[eFaultSourceCurrentComp].dScore
|
||||
< ar_dFaultScores_sorted[eFaultSourceCurrentComp+1].dScore)
|
||||
< ar_dFaultScores_sorted[eFaultSourceCurrentComp + 1].dScore)
|
||||
{
|
||||
FaultSource_Sort_Swap(eFaultSourceCurrentComp,eFaultSourceCurrentComp+1);
|
||||
bSwapped=1;
|
||||
FaultSource_Sort_Swap(eFaultSourceCurrentComp, eFaultSourceCurrentComp + 1);
|
||||
bSwapped = 1;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// updating refs
|
||||
for(long eFaultSourceIdx=0;
|
||||
eFaultSourceIdx<NB_FAULT_SOURCE;
|
||||
eFaultSourceIdx++)
|
||||
for(long eFaultSourceIdx = 0;
|
||||
eFaultSourceIdx < NB_FAULT_SOURCE;
|
||||
eFaultSourceIdx++ )
|
||||
{
|
||||
unsigned long idx = FaultSource_Sort_GetIdx(ar_dFaultScores_sorted[eFaultSourceIdx].eParrentFaultSource);
|
||||
ar_dFaultScores_sorted[eFaultSourceIdx].eParrentFaultSource = idx;
|
||||
}
|
||||
for(long eFaultSourceIdx=0;
|
||||
eFaultSourceIdx<NB_FAULT_SOURCE;
|
||||
eFaultSourceIdx++)
|
||||
{
|
||||
for(long eFaultSourceIdxv = 0;
|
||||
eFaultSourceIdx < NB_FAULT_SOURCE;
|
||||
eFaultSourceIdx++ )
|
||||
ar_dFaultScores_sorted[eFaultSourceIdx].eThisFaultSource = eFaultSourceIdx;
|
||||
}
|
||||
}
|
||||
void
|
||||
FaultSource_GetLoc(def_eFaultSource eFaultSource, char* loc)
|
||||
{
|
||||
loc[0]='\0';
|
||||
strcpy(loc,ar_dFaultScores_sorted[eFaultSource].szLoc);
|
||||
strcpy(loc, ar_dFaultScores_sorted[eFaultSource].szLoc);
|
||||
eFaultSource = ar_dFaultScores_sorted[eFaultSource].eParrentFaultSource;
|
||||
|
||||
while(eFaultSource != _INVALID_FAULT_SOURCE_)
|
||||
{
|
||||
static char buff[1024];
|
||||
sprintf(buff,"%s->%s",ar_dFaultScores_sorted[eFaultSource].szLoc,loc);
|
||||
strcpy(loc,buff);
|
||||
sprintf(buff, "%s->%s", ar_dFaultScores_sorted[eFaultSource].szLoc, loc);
|
||||
strcpy(loc, buff);
|
||||
eFaultSource = ar_dFaultScores_sorted[eFaultSource].eParrentFaultSource;
|
||||
}
|
||||
}
|
||||
@@ -148,26 +158,27 @@ FaultSource_Display()
|
||||
{
|
||||
double dScoreSum = 0;
|
||||
|
||||
for(def_eFaultSource eFaultSourceCurrent=0;
|
||||
for(def_eFaultSource eFaultSourceCurrent = 0;
|
||||
eFaultSourceCurrent < NB_FAULT_SOURCE && ar_dFaultScores_sorted[eFaultSourceCurrent].dScore > 0;
|
||||
eFaultSourceCurrent++ )
|
||||
dScoreSum+=ar_dFaultScores_sorted[eFaultSourceCurrent].dScore;
|
||||
|
||||
dScoreSum += ar_dFaultScores_sorted[eFaultSourceCurrent].dScore;
|
||||
|
||||
printf("------------------------------------------------\n");
|
||||
printf("\nDefects list:\n\n");
|
||||
printf("Score\tElement [Loc]\n");
|
||||
printf("------------------------------------------------\n");
|
||||
for(def_eFaultSource eFaultSourceCurrent=0;
|
||||
|
||||
for(def_eFaultSource eFaultSourceCurrent = 0;
|
||||
eFaultSourceCurrent < NB_FAULT_SOURCE
|
||||
&& (ar_dFaultScores_sorted[eFaultSourceCurrent].dScore > 0);
|
||||
eFaultSourceCurrent++ )
|
||||
{
|
||||
static char buff[1024];
|
||||
FaultSource_GetLoc(eFaultSourceCurrent,buff);
|
||||
FaultSource_GetLoc(eFaultSourceCurrent, buff);
|
||||
printf("%02.3f\t%s [%s]\n",
|
||||
100*ar_dFaultScores_sorted[eFaultSourceCurrent].dScore/dScoreSum,
|
||||
100 * ar_dFaultScores_sorted[eFaultSourceCurrent].dScore / dScoreSum,
|
||||
ar_dFaultScores_sorted[eFaultSourceCurrent].szName,
|
||||
buff);
|
||||
buff );
|
||||
}
|
||||
}
|
||||
|
||||
@@ -178,81 +189,15 @@ WordBitFaultSet( const unsigned long ErrorMark,
|
||||
const def_eFaultSource eFaultSourceL,
|
||||
const def_eFaultSource eFaultSourceH)
|
||||
{
|
||||
/* loop unrolling optimization
|
||||
for(unsigned long bitPos = 0; bitPos <= 31 ; bitPos++)
|
||||
{
|
||||
if(ErrorMark & (1<<bitPos))
|
||||
if(ErrorMark & (1 << bitPos))
|
||||
{
|
||||
if(bitPos<16)
|
||||
if(bitPos < 16)
|
||||
FaultSource_AddScore(eFaultSourceL + bitPos, dScore);
|
||||
else
|
||||
FaultSource_AddScore(eFaultSourceH + bitPos - 16, dScore);
|
||||
}
|
||||
}*/
|
||||
if(ErrorMark & 0x00000001)
|
||||
FaultSource_AddScore(eFaultSourceL, dScore);
|
||||
if(ErrorMark & 0x00000002)
|
||||
FaultSource_AddScore(eFaultSourceL+1, dScore);
|
||||
if(ErrorMark & 0x00000004)
|
||||
FaultSource_AddScore(eFaultSourceL+2, dScore);
|
||||
if(ErrorMark & 0x00000008)
|
||||
FaultSource_AddScore(eFaultSourceL+3, dScore);
|
||||
if(ErrorMark & 0x00000010)
|
||||
FaultSource_AddScore(eFaultSourceL+4, dScore);
|
||||
if(ErrorMark & 0x00000020)
|
||||
FaultSource_AddScore(eFaultSourceL+5, dScore);
|
||||
if(ErrorMark & 0x00000040)
|
||||
FaultSource_AddScore(eFaultSourceL+6, dScore);
|
||||
if(ErrorMark & 0x00000080)
|
||||
FaultSource_AddScore(eFaultSourceL+7, dScore);
|
||||
if(ErrorMark & 0x00000100)
|
||||
FaultSource_AddScore(eFaultSourceL+8, dScore);
|
||||
if(ErrorMark & 0x00000200)
|
||||
FaultSource_AddScore(eFaultSourceL+9, dScore);
|
||||
if(ErrorMark & 0x00000400)
|
||||
FaultSource_AddScore(eFaultSourceL+10, dScore);
|
||||
if(ErrorMark & 0x00000800)
|
||||
FaultSource_AddScore(eFaultSourceL+11, dScore);
|
||||
if(ErrorMark & 0x00001000)
|
||||
FaultSource_AddScore(eFaultSourceL+12, dScore);
|
||||
if(ErrorMark & 0x00002000)
|
||||
FaultSource_AddScore(eFaultSourceL+13, dScore);
|
||||
if(ErrorMark & 0x00004000)
|
||||
FaultSource_AddScore(eFaultSourceL+14, dScore);
|
||||
if(ErrorMark & 0x00008000)
|
||||
FaultSource_AddScore(eFaultSourceL+15, dScore);
|
||||
if(ErrorMark & 0x00010000)
|
||||
FaultSource_AddScore(eFaultSourceH, dScore);
|
||||
if(ErrorMark & 0x00020000)
|
||||
FaultSource_AddScore(eFaultSourceH+1, dScore);
|
||||
if(ErrorMark & 0x00040000)
|
||||
FaultSource_AddScore(eFaultSourceH+2, dScore);
|
||||
if(ErrorMark & 0x00080000)
|
||||
FaultSource_AddScore(eFaultSourceH+3, dScore);
|
||||
if(ErrorMark & 0x00100000)
|
||||
FaultSource_AddScore(eFaultSourceH+4, dScore);
|
||||
if(ErrorMark & 0x00200000)
|
||||
FaultSource_AddScore(eFaultSourceH+5, dScore);
|
||||
if(ErrorMark & 0x00400000)
|
||||
FaultSource_AddScore(eFaultSourceH+6, dScore);
|
||||
if(ErrorMark & 0x00800000)
|
||||
FaultSource_AddScore(eFaultSourceH+7, dScore);
|
||||
if(ErrorMark & 0x01000000)
|
||||
FaultSource_AddScore(eFaultSourceH+8, dScore);
|
||||
if(ErrorMark & 0x02000000)
|
||||
FaultSource_AddScore(eFaultSourceH+9, dScore);
|
||||
if(ErrorMark & 0x04000000)
|
||||
FaultSource_AddScore(eFaultSourceH+10, dScore);
|
||||
if(ErrorMark & 0x08000000)
|
||||
FaultSource_AddScore(eFaultSourceH+11, dScore);
|
||||
if(ErrorMark & 0x10000000)
|
||||
FaultSource_AddScore(eFaultSourceH+12, dScore);
|
||||
if(ErrorMark & 0x20000000)
|
||||
FaultSource_AddScore(eFaultSourceH+13, dScore);
|
||||
if(ErrorMark & 0x40000000)
|
||||
FaultSource_AddScore(eFaultSourceH+14, dScore);
|
||||
if(ErrorMark & 0x80000000)
|
||||
FaultSource_AddScore(eFaultSourceH+15, dScore);
|
||||
|
||||
}
|
||||
|
||||
void
|
||||
@@ -260,22 +205,9 @@ QuartetBitFaultSet( const unsigned long ErrorMark,
|
||||
const double dScore,
|
||||
const def_eFaultSource eFaultSource)
|
||||
{
|
||||
/* loop unrolling optimization
|
||||
for(unsigned long bitPos = 0; bitPos <= 4 ; bitPos++)
|
||||
{
|
||||
if(ErrorMark & (1<<bitPos))
|
||||
{
|
||||
for(unsigned char bitPos = 0; bitPos <= 4 ; bitPos++)
|
||||
if(ErrorMark & (1 << bitPos))
|
||||
FaultSource_AddScore(eFaultSource + bitPos, dScore);
|
||||
}
|
||||
}*/
|
||||
if(ErrorMark & 0x1)
|
||||
FaultSource_AddScore(eFaultSource, dScore);
|
||||
if(ErrorMark & 0x2)
|
||||
FaultSource_AddScore(eFaultSource+1, dScore);
|
||||
if(ErrorMark & 0x4)
|
||||
FaultSource_AddScore(eFaultSource+2, dScore);
|
||||
if(ErrorMark & 0x8)
|
||||
FaultSource_AddScore(eFaultSource+3, dScore);
|
||||
}
|
||||
|
||||
|
||||
@@ -308,20 +240,19 @@ TMUTexDataCtrlFaultSet( const unsigned long ErrorMark,
|
||||
const def_eFaultSource eFaultSourceWE
|
||||
)
|
||||
{
|
||||
|
||||
if( ErrorMark && (count_bit32(ErrorMark) > 16) )
|
||||
{
|
||||
if(ErrorMark & 0x000000FF)
|
||||
FaultSource_AddScore(eFaultSourceCASL,dScore/2);
|
||||
FaultSource_AddScore(eFaultSourceCASL,dScore);
|
||||
if(ErrorMark & 0x0000FF00)
|
||||
FaultSource_AddScore(eFaultSourceCASH,dScore/2);
|
||||
FaultSource_AddScore(eFaultSourceCASH,dScore);
|
||||
if(ErrorMark & 0x00FF0000)
|
||||
FaultSource_AddScore(eFaultSourceCASL,dScore/2);
|
||||
FaultSource_AddScore(eFaultSourceCASL,dScore);
|
||||
if(ErrorMark & 0xFF000000)
|
||||
FaultSource_AddScore(eFaultSourceCASH,dScore/2);
|
||||
FaultSource_AddScore(eFaultSourceCASH,dScore);
|
||||
|
||||
FaultSource_AddScore(eFaultSourceRAS,dScore/4);
|
||||
FaultSource_AddScore(eFaultSourceWE,dScore/4);
|
||||
FaultSource_AddScore(eFaultSourceRAS,dScore / 2);
|
||||
FaultSource_AddScore(eFaultSourceWE,dScore / 2);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
1850
FaultSources.h
1850
FaultSources.h
File diff suppressed because it is too large
Load Diff
675
LICENSE.md
Normal file
675
LICENSE.md
Normal file
@@ -0,0 +1,675 @@
|
||||
# GNU GENERAL PUBLIC LICENSE
|
||||
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc.
|
||||
<https://fsf.org/>
|
||||
|
||||
Everyone is permitted to copy and distribute verbatim copies of this
|
||||
license document, but changing it is not allowed.
|
||||
|
||||
## Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom
|
||||
to share and change all versions of a program--to make sure it remains
|
||||
free software for all its users. We, the Free Software Foundation, use
|
||||
the GNU General Public License for most of our software; it applies
|
||||
also to any other work released this way by its authors. You can apply
|
||||
it to your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you
|
||||
have certain responsibilities if you distribute copies of the
|
||||
software, or if you modify it: responsibilities to respect the freedom
|
||||
of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the
|
||||
manufacturer can do so. This is fundamentally incompatible with the
|
||||
aim of protecting users' freedom to change the software. The
|
||||
systematic pattern of such abuse occurs in the area of products for
|
||||
individuals to use, which is precisely where it is most unacceptable.
|
||||
Therefore, we have designed this version of the GPL to prohibit the
|
||||
practice for those products. If such problems arise substantially in
|
||||
other domains, we stand ready to extend this provision to those
|
||||
domains in future versions of the GPL, as needed to protect the
|
||||
freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish
|
||||
to avoid the special danger that patents applied to a free program
|
||||
could make it effectively proprietary. To prevent this, the GPL
|
||||
assures that patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
## TERMS AND CONDITIONS
|
||||
|
||||
### 0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds
|
||||
of works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of
|
||||
an exact copy. The resulting work is called a "modified version" of
|
||||
the earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user
|
||||
through a computer network, with no transfer of a copy, is not
|
||||
conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices" to
|
||||
the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
### 1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work for
|
||||
making modifications to it. "Object code" means any non-source form of
|
||||
a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users can
|
||||
regenerate automatically from other parts of the Corresponding Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that same
|
||||
work.
|
||||
|
||||
### 2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not convey,
|
||||
without conditions so long as your license otherwise remains in force.
|
||||
You may convey covered works to others for the sole purpose of having
|
||||
them make modifications exclusively for you, or provide you with
|
||||
facilities for running those works, provided that you comply with the
|
||||
terms of this License in conveying all material for which you do not
|
||||
control copyright. Those thus making or running the covered works for
|
||||
you must do so exclusively on your behalf, under your direction and
|
||||
control, on terms that prohibit them from making any copies of your
|
||||
copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under the
|
||||
conditions stated below. Sublicensing is not allowed; section 10 makes
|
||||
it unnecessary.
|
||||
|
||||
### 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such
|
||||
circumvention is effected by exercising rights under this License with
|
||||
respect to the covered work, and you disclaim any intention to limit
|
||||
operation or modification of the work as a means of enforcing, against
|
||||
the work's users, your or third parties' legal rights to forbid
|
||||
circumvention of technological measures.
|
||||
|
||||
### 4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
### 5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these
|
||||
conditions:
|
||||
|
||||
- a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
- b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under
|
||||
section 7. This requirement modifies the requirement in section 4
|
||||
to "keep intact all notices".
|
||||
- c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
- d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
### 6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms of
|
||||
sections 4 and 5, provided that you also convey the machine-readable
|
||||
Corresponding Source under the terms of this License, in one of these
|
||||
ways:
|
||||
|
||||
- a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
- b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the Corresponding
|
||||
Source from a network server at no charge.
|
||||
- c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
- d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
- e) Convey the object code using peer-to-peer transmission,
|
||||
provided you inform other peers where the object code and
|
||||
Corresponding Source of the work are being offered to the general
|
||||
public at no charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal,
|
||||
family, or household purposes, or (2) anything designed or sold for
|
||||
incorporation into a dwelling. In determining whether a product is a
|
||||
consumer product, doubtful cases shall be resolved in favor of
|
||||
coverage. For a particular product received by a particular user,
|
||||
"normally used" refers to a typical or common use of that class of
|
||||
product, regardless of the status of the particular user or of the way
|
||||
in which the particular user actually uses, or expects or is expected
|
||||
to use, the product. A product is a consumer product regardless of
|
||||
whether the product has substantial commercial, industrial or
|
||||
non-consumer uses, unless such uses represent the only significant
|
||||
mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to
|
||||
install and execute modified versions of a covered work in that User
|
||||
Product from a modified version of its Corresponding Source. The
|
||||
information must suffice to ensure that the continued functioning of
|
||||
the modified object code is in no case prevented or interfered with
|
||||
solely because modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or
|
||||
updates for a work that has been modified or installed by the
|
||||
recipient, or for the User Product in which it has been modified or
|
||||
installed. Access to a network may be denied when the modification
|
||||
itself materially and adversely affects the operation of the network
|
||||
or violates the rules and protocols for communication across the
|
||||
network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
### 7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders
|
||||
of that material) supplement the terms of this License with terms:
|
||||
|
||||
- a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
- b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
- c) Prohibiting misrepresentation of the origin of that material,
|
||||
or requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
- d) Limiting the use for publicity purposes of names of licensors
|
||||
or authors of the material; or
|
||||
- e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
- f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions
|
||||
of it) with contractual assumptions of liability to the recipient,
|
||||
for any liability that these contractual assumptions directly
|
||||
impose on those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions; the
|
||||
above requirements apply either way.
|
||||
|
||||
### 8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your license
|
||||
from a particular copyright holder is reinstated (a) provisionally,
|
||||
unless and until the copyright holder explicitly and finally
|
||||
terminates your license, and (b) permanently, if the copyright holder
|
||||
fails to notify you of the violation by some reasonable means prior to
|
||||
60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
### 9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or run
|
||||
a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
### 10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
### 11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims owned
|
||||
or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within the
|
||||
scope of its coverage, prohibits the exercise of, or is conditioned on
|
||||
the non-exercise of one or more of the rights that are specifically
|
||||
granted under this License. You may not convey a covered work if you
|
||||
are a party to an arrangement with a third party that is in the
|
||||
business of distributing software, under which you make payment to the
|
||||
third party based on the extent of your activity of conveying the
|
||||
work, and under which the third party grants, to any of the parties
|
||||
who would receive the covered work from you, a discriminatory patent
|
||||
license (a) in connection with copies of the covered work conveyed by
|
||||
you (or copies made from those copies), or (b) primarily for and in
|
||||
connection with specific products or compilations that contain the
|
||||
covered work, unless you entered into that arrangement, or that patent
|
||||
license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
### 12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under
|
||||
this License and any other pertinent obligations, then as a
|
||||
consequence you may not convey it at all. For example, if you agree to
|
||||
terms that obligate you to collect a royalty for further conveying
|
||||
from those to whom you convey the Program, the only way you could
|
||||
satisfy both those terms and this License would be to refrain entirely
|
||||
from conveying the Program.
|
||||
|
||||
### 13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
### 14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions
|
||||
of the GNU General Public License from time to time. Such new versions
|
||||
will be similar in spirit to the present version, but may differ in
|
||||
detail to address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the Program
|
||||
specifies that a certain numbered version of the GNU General Public
|
||||
License "or any later version" applies to it, you have the option of
|
||||
following the terms and conditions either of that numbered version or
|
||||
of any later version published by the Free Software Foundation. If the
|
||||
Program does not specify a version number of the GNU General Public
|
||||
License, you may choose any version ever published by the Free
|
||||
Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future versions
|
||||
of the GNU General Public License can be used, that proxy's public
|
||||
statement of acceptance of a version permanently authorizes you to
|
||||
choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
### 15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT
|
||||
WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT
|
||||
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND
|
||||
PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE
|
||||
DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
|
||||
CORRECTION.
|
||||
|
||||
### 16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR
|
||||
CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
||||
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES
|
||||
ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT
|
||||
NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR
|
||||
LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM
|
||||
TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER
|
||||
PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
|
||||
|
||||
### 17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
## How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these
|
||||
terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest to
|
||||
attach them to the start of each source file to most effectively state
|
||||
the exclusion of warranty; and each file should have at least the
|
||||
"copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper
|
||||
mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands \`show w' and \`show c' should show the
|
||||
appropriate parts of the General Public License. Of course, your
|
||||
program's commands might be different; for a GUI interface, you would
|
||||
use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or
|
||||
school, if any, to sign a "copyright disclaimer" for the program, if
|
||||
necessary. For more information on this, and how to apply and follow
|
||||
the GNU GPL, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your
|
||||
program into proprietary programs. If your program is a subroutine
|
||||
library, you may consider it more useful to permit linking proprietary
|
||||
applications with the library. If this is what you want to do, use the
|
||||
GNU Lesser General Public License instead of this License. But first,
|
||||
please read <https://www.gnu.org/licenses/why-not-lgpl.html>.
|
||||
239
Readme.md
239
Readme.md
@@ -1,79 +1,192 @@
|
||||
\# Voodoo 2 (TMU) MemTest
|
||||
|
||||
|
||||
|
||||
This tool is an attempt to help troubleshooting Voodoo² TMU's issues.
|
||||
# Voodoo 2 (TMU) MemTest
|
||||
|
||||
## Introduction
|
||||
|
||||
This tool is an attempt to assist troubleshooting Voodoo² TMU's issues.
|
||||
|
||||
TMU system can be very hard to fix because there are so many connexions.
|
||||
|
||||
I developped this small tookit because at the time, one of my Voodoo2 was starting to have glitches and I could not figure out what was wrong.
|
||||
|
||||
I also had a 2nd one that I bought faulty and was struggling to repair.
|
||||
|
||||
Witchery was just out but did not support testing TMU memory.
|
||||
|
||||
So I found it funny to write a piece of code that tries to move data from CPU to TMU and vice-versa.
|
||||
|
||||
\## TMU0 Memory test
|
||||
I found that the original 3DFX driver was actually doing a subset of what was needed, just to detect 8MB/12MB (and 4MB ?) Voodoo2 (Voodoo FX ?) boards.
|
||||
|
||||
That was the starting point, and after a lot of trials and error, I managed to transmit data to/from everywhere.
|
||||
|
||||
Note that this is a hoby project, done mostly for fun because buying another Voodoo2 would probably be cheaper than the time invested ... :).
|
||||
|
||||
As this is an open-source tool, feel free to Fork, Raise Tickets or to send Pull-Requests !
|
||||
|
||||
## Requirements
|
||||
|
||||
To build this tool you need GNU Make, GCC and Glide 2.x SDK.
|
||||
|
||||
Requirement to run this tools depends on the build platform and options.
|
||||
|
||||
If you are using the binary I am sharing here, then you need a 32bit Linux System with :
|
||||
- a Kernel >= 2.6.24
|
||||
- glibc >= 2.3.6
|
||||
- working Glide 2.x drivers
|
||||
- a pentium 3 (or better) micro-code compatible CPU
|
||||
|
||||
As a reference, the development & validation environement was :
|
||||
- Debian Linux Etch (4.0) i386
|
||||
- Debian official 2.6.24 Kernel recompiled with pentium III options
|
||||
- my own build of (updated) glide drivers.
|
||||
|
||||
## Status
|
||||
|
||||
Here is the [hopefully updated] project status.
|
||||
|
||||
- [ ] Implementation
|
||||
- [X] test data (bit move)
|
||||
- [X] test data (random pattern)
|
||||
- [X] test address
|
||||
- [ ] test data (huge block)
|
||||
- [ ] test draw triangle shape (no texture)
|
||||
- [ ] launch options / single test
|
||||
- [ ] fault analysis
|
||||
- [ ] output to file (TBD: csv, tsv, json, xml ...)
|
||||
- [ ] Validation
|
||||
- [X] working Voodoo2
|
||||
- [X] working Voodoo2 SLI
|
||||
- [ ] any RAM ICs
|
||||
- [ ] DQx
|
||||
- [X] short
|
||||
- [ ] force 0
|
||||
- [ ] force 1
|
||||
- [ ] floating
|
||||
- [ ] addresses
|
||||
- [X] short
|
||||
- [ ] force 0
|
||||
- [ ] force 1
|
||||
- [ ] floating
|
||||
- [ ] RAS
|
||||
- [ ] short
|
||||
- [ ] force 0
|
||||
- [ ] force 1
|
||||
- [ ] floating
|
||||
- [ ] CAS
|
||||
- [ ] short
|
||||
- [ ] force 0
|
||||
- [ ] force 1
|
||||
- [ ] floating
|
||||
- [ ] WE
|
||||
- [ ] short
|
||||
- [ ] force 0
|
||||
- [ ] force 1
|
||||
- [ ] floating
|
||||
- [ ] 1MB TMU test (faulty)
|
||||
- [ ] 2MB TMU test (= 8MB Voodoo2)
|
||||
- [ ] 4MB TMU test (= 12MB Voodoo2)
|
||||
- [ ] TMU0 or TMU1 only*
|
||||
- [ ] FBI to TMU1 fault
|
||||
- [ ] FBI to TMU0 fault
|
||||
- [ ] TMU1 to TMU0 fault
|
||||
- [ ] TMU0 to FBI fault
|
||||
- [ ] Documentation
|
||||
- [ ] CLI help
|
||||
- [ ] short youtube video
|
||||
- [ ] Other
|
||||
- [ ] Integration with Witchery ?
|
||||
|
||||
## TMU0 Memory test
|
||||
|
||||
Here is a simplified data flow diagram:
|
||||
|
||||
```
|
||||
|
||||
┌────────────┐ 3 ┌───────────┐
|
||||
|
||||
│ ┼─────► │
|
||||
|
||||
│ TMU0 │ │ TMU0 RAM │
|
||||
|
||||
│ ◄─────┼ │
|
||||
|
||||
└──▲──────┬──┘ └───────────┘
|
||||
|
||||
│ │ 4
|
||||
|
||||
│ │
|
||||
|
||||
2 │ │ 5
|
||||
|
||||
│ │
|
||||
|
||||
┌──┼──────▼──┐ 6 ┌───────────┐
|
||||
|
||||
│ ┼─────► │
|
||||
|
||||
│ FBI │ │ FBI RAM │
|
||||
|
||||
│ ◄─────┼ │
|
||||
|
||||
└──▲───────┬─┘ 7 └───────────┘
|
||||
|
||||
│ │
|
||||
|
||||
│ │
|
||||
|
||||
1 │ │ 7
|
||||
|
||||
│ │
|
||||
|
||||
┌──┼───────▼─┐
|
||||
|
||||
│ │
|
||||
|
||||
│ CPU │
|
||||
|
||||
│ │
|
||||
|
||||
└────────────┘
|
||||
|
||||
```
|
||||
┌────────────┐ 3 ┌───────────┐
|
||||
│ ┼─────► │
|
||||
│ TMU0 │ │ TMU0 RAM │
|
||||
│ ◄─────┼ │
|
||||
└──▲───────┬─┘ └───────────┘
|
||||
│ │ 4
|
||||
│ │
|
||||
2 │ │ 5
|
||||
│ │
|
||||
│ │
|
||||
┌──┼───────▼─┐ 6 ┌───────────┐
|
||||
│ ┼─────► │
|
||||
│ FBI │ │ FBI RAM │
|
||||
│ ◄─────┼ │
|
||||
└──▲───────┬─┘ 7 └───────────┘
|
||||
│ │
|
||||
│ │
|
||||
1 │ │ 7
|
||||
│ │
|
||||
│ │
|
||||
┌──┼───────▼─┐
|
||||
│ │
|
||||
│ CPU │
|
||||
│ │
|
||||
└────────────┘
|
||||
```
|
||||
|
||||
* 1 : CPU configure texture base address and write data to the FBI
|
||||
* 2 : The FBI streams the texture to the TMU
|
||||
* 3 : The TMU writes the texture into his private memory
|
||||
* 4 : The CPU sends a request to the TMU (through the FBI) to render a triangle using this texture (double the size)
|
||||
* 5 : The TMU streams the rendered pixels to the FBI
|
||||
* 6 : The FBI writes the pixel to the frame buffer
|
||||
* 7 : The CPU requests the pixels using the Linear Frame Buffer access
|
||||
* x : The CPU can compare the rendered value with the original texture
|
||||
1. CPU configures texture base address and sends data to the FBI
|
||||
2. The FBI streams the texture to TMU0
|
||||
3. TMU0 writes the texture into his private memory
|
||||
4. The CPU sends a request to TMU0 (through the FBI) to render a triangle using this texture (double the size triangle)
|
||||
5. TMU0 streams the rendered pixels to the FBI
|
||||
6. The FBI writes the pixel to the frame buffer
|
||||
7. The CPU requests the pixels using the Linear Frame Buffer access
|
||||
8. The CPU can compare the rendered value with the original texture
|
||||
|
||||
|
||||
## TMU1 Memory test
|
||||
|
||||
Here is a simplified data flow diagram:
|
||||
|
||||
```
|
||||
┌────────────┐
|
||||
│ │
|
||||
│ TMU1 RAM │
|
||||
│ │
|
||||
└──▲──────┬──┘
|
||||
│ │
|
||||
3 │ 4 ┼
|
||||
│ │
|
||||
┌──┼──────▼──┐ 5 ┌────────────┐
|
||||
│ │ │ │
|
||||
│ TMU1 ┼──────► TMU0 │
|
||||
│ │ │ │
|
||||
└── ──▲──────┘ └─────┬──────┘
|
||||
│ │
|
||||
2 │ 6 │
|
||||
│ │
|
||||
┌─────┼────────────────── ▼──────┐ 7 ┌───────────┐
|
||||
│ ┼─────► │
|
||||
│ FBI │ │ FBI RAM │
|
||||
│ ◄─────┼ │
|
||||
└──▲───────┬─────────────────────┘ 8 └───────────┘
|
||||
│ │
|
||||
1 │ │ 9
|
||||
│ │
|
||||
┌──┼───────▼─┐
|
||||
│ │
|
||||
│ CPU │
|
||||
│ │
|
||||
└────────────┘
|
||||
```
|
||||
|
||||
0. CPU configures TM0 to simply passthrough incoming TMU1's pixel stream without modifications
|
||||
1. CPU configures texture base address and sends data to the FBI
|
||||
2. The FBI streams the texture to TMU1
|
||||
3. TMU1 writes the texture into his private memory
|
||||
4. The CPU sends a request to TMU1 (through the FBI) to render a triangle using this texture (double the size triangle)
|
||||
5. TMU1 streams the rendered pixels to TMU0
|
||||
6. TMU0 streams the rendered pixels to the FBI
|
||||
7. The FBI writes the pixel to the frame buffer
|
||||
8. The CPU requests the pixels using the Linear Frame Buffer access
|
||||
9. The CPU can compare the rendered value with the original texture
|
||||
|
||||
## Accessing different memory regions
|
||||
|
||||
TBD
|
||||
|
||||
## Licence
|
||||
|
||||
**GPL-3.0-or-later**
|
||||
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <cvg.h>
|
||||
#include <fxpci.h>
|
||||
#include <sst1init.h>
|
||||
@@ -17,12 +34,6 @@ typedef struct _def_sTestAddress {
|
||||
unsigned char nRowBit;
|
||||
}def_sTestAddress;
|
||||
|
||||
/*
|
||||
static sst1DeviceInfoStruct devInfo;
|
||||
static FxU32* sst;
|
||||
static SstRegs *sstregs;
|
||||
*/
|
||||
|
||||
unsigned long
|
||||
RenderTestAddress( sst1DeviceInfoStruct* devInfo,
|
||||
FxU32* sst,
|
||||
|
||||
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef _DEF_TEST_ADDRESS_H_
|
||||
#define _DEF_TEST_ADDRESS_H_
|
||||
|
||||
|
||||
832
Test_Data.c
832
Test_Data.c
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <cvg.h>
|
||||
#include <fxpci.h>
|
||||
#include <sst1init.h>
|
||||
@@ -19,104 +36,41 @@ RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
const FxU32 value1,
|
||||
const FxU32 value2)
|
||||
{
|
||||
|
||||
/* set the Init0 register to enable ? MBytes of memory */
|
||||
// info->tmuInit0[tmu] = SST_TREXINIT0_DEFAULT | BIT(20); // BIT(20) seems to use bank 2...even if TMU mem is <= 2MB
|
||||
|
||||
devInfo->tmuInit0[(int)ucNumTMU] = SST_TREXINIT0_DEFAULT ;
|
||||
|
||||
sst1InitIdle(sst);
|
||||
devInfo->tmuInit0[(int)ucNumTMU] = SST_TREXINIT0_DEFAULT ;
|
||||
ISET(SST_TREX(sstregs,ucNumTMU)->trexInit0, devInfo->tmuInit0[(int)ucNumTMU]);
|
||||
sst1InitIdle(sst);
|
||||
/*
|
||||
sst1InitIdle(sst);
|
||||
ISET(SST_TREX(sstregs,ucNumTMU)->trexInit0, 0x5000 | (devInfo->tmuInit0[(int)ucNumTMU] & ~0x7000));
|
||||
sst1InitIdle(sst);
|
||||
*/
|
||||
ISET(sstregs->texBaseAddr, (mem>>3)); /* set to mem addr */
|
||||
|
||||
// First line, to use bits 0..31
|
||||
volatile const FxU32 *texAddr = (ucNumTMU<<(21-2)) + (((FxU32)0)<<(17-2)) + (FxU32 *)SST_TEX_ADDRESS(sstregs);
|
||||
ISET(texAddr[0], value1); /* write a value */
|
||||
ISET(texAddr[1], value1+1); /* write a value */
|
||||
ISET(texAddr[2], value1+2); /* write a value */
|
||||
ISET(texAddr[3], value1+3); /* write a value */
|
||||
|
||||
// Second line, to use bits 32..63
|
||||
volatile const FxU32 *texAddr2 = (ucNumTMU<<(21-2)) + (((FxU32)0)<<(17-2)) + (1<<(9-2))+ (FxU32 *)SST_TEX_ADDRESS(sstregs);
|
||||
ISET(texAddr2[0], value2); /* write a value */
|
||||
ISET(texAddr2[1], value2+1); /* write a value */
|
||||
ISET(texAddr2[2], value2+2); /* write a value */
|
||||
ISET(texAddr2[3], value2+3); /* write a value */
|
||||
ISET(sstregs->texBaseAddr, mem>>3);
|
||||
|
||||
/* Writing to first texture line, to use RAM bits 0..31 */
|
||||
volatile FxU32 *texAddr = (ucNumTMU<<(21-2)) /* NUM_TMU */
|
||||
+ (((FxU32)0)<<(17-2)) /* LOD_0 */
|
||||
+ (FxU32 *)SST_TEX_ADDRESS(sst); /* tex base address */
|
||||
ISET(texAddr[0], value1); ISET(texAddr[1], value1 + 1);
|
||||
ISET(texAddr[2], value1 + 2); ISET(texAddr[3], value1 + 3);
|
||||
|
||||
/* writing to second texture line, to use RAM bits 32..63 */
|
||||
texAddr2 += (1<<(9-2))
|
||||
ISET(texAddr2[0], value2); ISET(texAddr2[1], value2 + 1);
|
||||
ISET(texAddr2[2], value2 + 2); ISET(texAddr2[3], value2 + 3);
|
||||
|
||||
/* draw a 8x8triangle */
|
||||
drawTriangle(sstregs,0,0,8);
|
||||
|
||||
/* reading back first line pixels addresses */
|
||||
const FxU32 L1_1 = IGET(sst[(SST_LFB_ADDR >> 2) + 0]);
|
||||
const FxU32 L1_2 = IGET(sst[(SST_LFB_ADDR >> 2) + 1]);
|
||||
const FxU32 L1_3 = IGET(sst[(SST_LFB_ADDR >> 2) + 2]);
|
||||
const FxU32 L1_4 = IGET(sst[(SST_LFB_ADDR >> 2) + 3]);
|
||||
|
||||
/* reading back second line pixels addresses */
|
||||
const FxU32 L2_1 = IGET(sst[(SST_LFB_ADDR >> 2) + (2048 >> 2) + 0]);
|
||||
const FxU32 L2_2 = IGET(sst[(SST_LFB_ADDR >> 2) + (2048 >> 2) + 1]);
|
||||
const FxU32 L2_3 = IGET(sst[(SST_LFB_ADDR >> 2) + (2048 >> 2) + 2]);
|
||||
const FxU32 L2_4 = IGET(sst[(SST_LFB_ADDR >> 2) + (2048 >> 2) + 3]);
|
||||
|
||||
drawTriangle(sstregs,0,0,10); /* draw a 10x10 triangle */
|
||||
|
||||
// First line pixels addresses
|
||||
const FxU32 L1_1 = IGET(sst[(SST_LFB_ADDR>>2)+0]);
|
||||
const FxU32 L1_2 = IGET(sst[(SST_LFB_ADDR>>2)+1]);
|
||||
const FxU32 L1_3 = IGET(sst[(SST_LFB_ADDR>>2)+2]);
|
||||
const FxU32 L1_4 = IGET(sst[(SST_LFB_ADDR>>2)+3]);
|
||||
|
||||
// Second line pixels addresses
|
||||
const FxU32 L2_1 = IGET(sst[(SST_LFB_ADDR>>2)+(2048>>2)+0]);
|
||||
const FxU32 L2_2 = IGET(sst[(SST_LFB_ADDR>>2)+(2048>>2)+1]);
|
||||
const FxU32 L2_3 = IGET(sst[(SST_LFB_ADDR>>2)+(2048>>2)+2]);
|
||||
const FxU32 L2_4 = IGET(sst[(SST_LFB_ADDR>>2)+(2048>>2)+3]);
|
||||
|
||||
unsigned long long NbErr = 0;
|
||||
//unsigned char bErrLowBytes=0;
|
||||
//unsigned char bErrHighBytes=0;
|
||||
if( L1_1 != value1)
|
||||
{
|
||||
//printf("Error on pixel LFB[0][0] (0x%08x)!\n",mem);
|
||||
NbErr++;
|
||||
//bErrLowBytes=1;
|
||||
}
|
||||
if( L1_2 != value1+1)
|
||||
{
|
||||
//printf("Error on pixel LFB[0][1] (0x%08x)!\n",mem);
|
||||
NbErr++;
|
||||
//bErrLowBytes=1;
|
||||
}
|
||||
if( L1_3 != value1+2)
|
||||
{
|
||||
//printf("Error on pixel LFB[0][2] (0x%08x)!\n",mem);
|
||||
NbErr++;
|
||||
//bErrLowBytes=1;
|
||||
}
|
||||
if( L1_4 != value1+3)
|
||||
{
|
||||
//printf("Error on pixel LFB[0][3] (0x%08x)!\n",mem);
|
||||
NbErr++;
|
||||
//bErrLowBytes=1;
|
||||
}
|
||||
|
||||
if( L2_1 != value2)
|
||||
{
|
||||
//printf("Error on pixel LFB[1][0] (0x%08x)!\n",mem);
|
||||
NbErr++;
|
||||
//bErrHighBytes=1;
|
||||
}
|
||||
if( L2_2 != value2+1)
|
||||
{
|
||||
//printf("Error on pixel LFB[1][1] (0x%08x)!\n",mem);
|
||||
NbErr++;
|
||||
//bErrHighBytes=1;
|
||||
}
|
||||
if( L2_3 != value2+2)
|
||||
{
|
||||
//printf("Error on pixel LFB[1][2] (0x%08x)!\n",mem);
|
||||
NbErr++;
|
||||
//bErrHighBytes=1;
|
||||
}
|
||||
if( L2_4 != value2+3)
|
||||
{
|
||||
//printf("Error on pixel LFB[1][3] (0x%08x)!\n",mem);
|
||||
NbErr++;
|
||||
//bErrHighBytes=1;
|
||||
}
|
||||
|
||||
// Diag Help logs
|
||||
|
||||
const unsigned long ErrorMark_L1_1 = L1_1 ^ ( value1 + 0 );
|
||||
const unsigned long ErrorMark_L1_2 = L1_2 ^ ( value1 + 1 );
|
||||
@@ -126,328 +80,331 @@ RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
const unsigned long ErrorMark_L2_2 = L2_2 ^ ( value2 + 1 );
|
||||
const unsigned long ErrorMark_L2_3 = L2_3 ^ ( value2 + 2 );
|
||||
const unsigned long ErrorMark_L2_4 = L2_4 ^ ( value2 + 3 );
|
||||
|
||||
if( ErrorMark_L1_1 || ErrorMark_L1_2 || ErrorMark_L1_3 || ErrorMark_L1_4
|
||||
|| ErrorMark_L2_1 || ErrorMark_L2_2 || ErrorMark_L2_3 || ErrorMark_L2_4)
|
||||
{
|
||||
NbErr++;
|
||||
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0/16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0/16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0/16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0/16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0/16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0/16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0/16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0/16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0/16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0/16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0/16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0/16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0/16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0/16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0/16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0/16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 0, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 4, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 8, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 12, 1.0/16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 16, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 20, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 24, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 28, 1.0/16, RA13_1);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 0, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 4, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 8, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 12, 1.0/16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 16, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 20, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 24, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 28, 1.0/16, RA13_1);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 0, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 4, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 8, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 12, 1.0/16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 16, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 20, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 24, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 28, 1.0/16, RA13_1);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 0, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 4, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 8, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 12, 1.0/16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 16, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 20, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 24, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 28, 1.0/16, RA13_1);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 0, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 4, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 8, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 12, 1.0/16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 16, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 20, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 24, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 28, 1.0/16, RA13_1);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 0, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 4, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 8, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 12, 1.0/16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 16, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 20, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 24, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 28, 1.0/16, RA13_1);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 0, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 4, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 8, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 12, 1.0/16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 16, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 20, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 24, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 28, 1.0/16, RA13_1);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 0, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 4, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 8, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 12, 1.0/16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 16, 1.0/16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 20, 1.0/16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 24, 1.0/16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 28, 1.0/16, RA13_1);
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0 / 16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0 / 16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0 / 16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0 / 16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0 / 16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0 / 16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0 / 16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0 / 16, U9_TMU0_TF_DATA_0, U9_TMU0_TF_DATA_0);
|
||||
|
||||
const double dScoreFront = (mem >= 0x200000) ? 0.5/4 : 1.0/4;
|
||||
const double dScoreBack = (mem >= 0x200000) ? 1.0/4 : 0.5/4;
|
||||
|
||||
if(ucNumTMU == 0)
|
||||
{
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0/16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0/16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0/16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0/16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0/16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0/16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0/16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0/16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0 / 16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0 / 16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0 / 16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0 / 16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0 / 16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0 / 16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0 / 16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0 / 16, TT_TDATA_R131, TT_TDATA_R131);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L1_1, dScoreFront, U14, U12);
|
||||
MemChipDQFaultSet(ErrorMark_L1_2, dScoreFront, U14, U12);
|
||||
MemChipDQFaultSet(ErrorMark_L1_3, dScoreFront, U14, U12);
|
||||
MemChipDQFaultSet(ErrorMark_L1_4, dScoreFront, U14, U12);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 0, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 4, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 8, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 12, 1.0 / 16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 16, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 20, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 24, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_1 >> 28, 1.0 / 16, RA13_1);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L2_1, dScoreFront, U18, U17);
|
||||
MemChipDQFaultSet(ErrorMark_L2_2, dScoreFront, U18, U17);
|
||||
MemChipDQFaultSet(ErrorMark_L2_3, dScoreFront, U18, U17);
|
||||
MemChipDQFaultSet(ErrorMark_L2_4, dScoreFront, U18, U17);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 0, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 4, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 8, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 12, 1.0 / 16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 16, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 20, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 24, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_2 >> 28, 1.0 / 16, RA13_1);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L1_1, dScoreBack, U23, U24);
|
||||
MemChipDQFaultSet(ErrorMark_L1_2, dScoreBack, U23, U24);
|
||||
MemChipDQFaultSet(ErrorMark_L1_3, dScoreBack, U23, U24);
|
||||
MemChipDQFaultSet(ErrorMark_L1_4, dScoreBack, U23, U12);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 0, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 4, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 8, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 12, 1.0 / 16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 16, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 20, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 24, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_3 >> 28, 1.0 / 16, RA13_1);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L2_1, dScoreBack, U25, U26);
|
||||
MemChipDQFaultSet(ErrorMark_L2_2, dScoreBack, U25, U26);
|
||||
MemChipDQFaultSet(ErrorMark_L2_3, dScoreBack, U25, U26);
|
||||
MemChipDQFaultSet(ErrorMark_L2_4, dScoreBack, U25, U26);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 0, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 4, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 8, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 12, 1.0 / 16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 16, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 20, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 24, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L1_4 >> 28, 1.0 / 16, RA13_1);
|
||||
|
||||
TMUTexDataFaultSet(ErrorMark_L1_1, ErrorMark_L2_1, 1.0/4, U9_TMU0);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_2, ErrorMark_L2_2, 1.0/4, U9_TMU0);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_3, ErrorMark_L2_3, 1.0/4, U9_TMU0);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_4, ErrorMark_L2_4, 1.0/4, U9_TMU0);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 0, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 4, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 8, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 12, 1.0 / 16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 16, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 20, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 24, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_1 >> 28, 1.0 / 16, RA13_1);
|
||||
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_1,
|
||||
1.0/4,
|
||||
U9_TMU0_TEX_CAS0,
|
||||
U9_TMU0_TEX_CAS1,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_2,
|
||||
1.0/4,
|
||||
U9_TMU0_TEX_CAS0,
|
||||
U9_TMU0_TEX_CAS1,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_3,
|
||||
1.0/4,
|
||||
U9_TMU0_TEX_CAS0,
|
||||
U9_TMU0_TEX_CAS1,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_4,
|
||||
1.0/4,
|
||||
U9_TMU0_TEX_CAS0,
|
||||
U9_TMU0_TEX_CAS1,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_1,
|
||||
1.0/4,
|
||||
U9_TMU0_TEX_CAS2,
|
||||
U9_TMU0_TEX_CAS3,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_2,
|
||||
1.0/4,
|
||||
U9_TMU0_TEX_CAS2,
|
||||
U9_TMU0_TEX_CAS3,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_3,
|
||||
1.0/4,
|
||||
U9_TMU0_TEX_CAS2,
|
||||
U9_TMU0_TEX_CAS3,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_4,
|
||||
1.0/4,
|
||||
U9_TMU0_TEX_CAS2,
|
||||
U9_TMU0_TEX_CAS3,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 0, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 4, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 8, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 12, 1.0 / 16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 16, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 20, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 24, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_2 >> 28, 1.0 / 16, RA13_1);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 0, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 4, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 8, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 12, 1.0 / 16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 16, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 20, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 24, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_3 >> 28, 1.0 / 16, RA13_1);
|
||||
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 0, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 4, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 8, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 12, 1.0 / 16, RA13_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 16, 1.0 / 16, RA10_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 20, 1.0 / 16, RA11_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 24, 1.0 / 16, RA12_1);
|
||||
QuartetBitFaultSet(ErrorMark_L2_4 >> 28, 1.0 / 16, RA13_1);
|
||||
|
||||
const double dScoreFront = (mem >= 0x200000) ? 1.0 / 8 : 1.0 / 4;
|
||||
const double dScoreBack = (mem >= 0x200000) ? 1.0 / 4 : 1.0 / 8;
|
||||
|
||||
if(ucNumTMU == 0)
|
||||
{
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0 / 16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0 / 16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0 / 16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0 / 16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0 / 16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0 / 16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0 / 16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0 / 16, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L1_1, dScoreFront, U14, U12);
|
||||
MemChipDQFaultSet(ErrorMark_L1_2, dScoreFront, U14, U12);
|
||||
MemChipDQFaultSet(ErrorMark_L1_3, dScoreFront, U14, U12);
|
||||
MemChipDQFaultSet(ErrorMark_L1_4, dScoreFront, U14, U12);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L2_1, dScoreFront, U18, U17);
|
||||
MemChipDQFaultSet(ErrorMark_L2_2, dScoreFront, U18, U17);
|
||||
MemChipDQFaultSet(ErrorMark_L2_3, dScoreFront, U18, U17);
|
||||
MemChipDQFaultSet(ErrorMark_L2_4, dScoreFront, U18, U17);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L1_1, dScoreBack, U23, U24);
|
||||
MemChipDQFaultSet(ErrorMark_L1_2, dScoreBack, U23, U24);
|
||||
MemChipDQFaultSet(ErrorMark_L1_3, dScoreBack, U23, U24);
|
||||
MemChipDQFaultSet(ErrorMark_L1_4, dScoreBack, U23, U12);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L2_1, dScoreBack, U25, U26);
|
||||
MemChipDQFaultSet(ErrorMark_L2_2, dScoreBack, U25, U26);
|
||||
MemChipDQFaultSet(ErrorMark_L2_3, dScoreBack, U25, U26);
|
||||
MemChipDQFaultSet(ErrorMark_L2_4, dScoreBack, U25, U26);
|
||||
|
||||
TMUTexDataFaultSet(ErrorMark_L1_1, ErrorMark_L2_1, 1.0 / 4, U9_TMU0);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_2, ErrorMark_L2_2, 1.0 / 4, U9_TMU0);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_3, ErrorMark_L2_3, 1.0 / 4, U9_TMU0);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_4, ErrorMark_L2_4, 1.0 / 4, U9_TMU0);
|
||||
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_1,
|
||||
1.0 / 8,
|
||||
U9_TMU0_TEX_CAS0,
|
||||
U9_TMU0_TEX_CAS1,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_2,
|
||||
1.0 / 8,
|
||||
U9_TMU0_TEX_CAS0,
|
||||
U9_TMU0_TEX_CAS1,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_3,
|
||||
1.0 / 8,
|
||||
U9_TMU0_TEX_CAS0,
|
||||
U9_TMU0_TEX_CAS1,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_4,
|
||||
1.0 / 8,
|
||||
U9_TMU0_TEX_CAS0,
|
||||
U9_TMU0_TEX_CAS1,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_1,
|
||||
1.0 / 8,
|
||||
U9_TMU0_TEX_CAS2,
|
||||
U9_TMU0_TEX_CAS3,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_2,
|
||||
1.0 / 8,
|
||||
U9_TMU0_TEX_CAS2,
|
||||
U9_TMU0_TEX_CAS3,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_3,
|
||||
1.0 / 8,
|
||||
U9_TMU0_TEX_CAS2,
|
||||
U9_TMU0_TEX_CAS3,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_4,
|
||||
1.0 / 8,
|
||||
U9_TMU0_TEX_CAS2,
|
||||
U9_TMU0_TEX_CAS3,
|
||||
mem < 0x200000 ? U9_TMU0_TEX_RAS0 : U9_TMU0_TEX_RAS1,
|
||||
U9_TMU0_TEX_WE);
|
||||
|
||||
}
|
||||
else if(ucNumTMU == 1)
|
||||
{
|
||||
/* during TMU1 test, TMU0 doesnt receive any textures => ignoring these
|
||||
WordBitFaultSet(ErrorMark_L1_1, 0.5, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 0.5, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 0.5, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 0.5, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 0.5, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 0.5, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 0.5, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 0.5, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
*/
|
||||
|
||||
// U9_TMU0_TT_DATA_x is only tested when using TMU1
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0/16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0/16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0/16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0/16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0/16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0/16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0/16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0/16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0/16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0/16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0/16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0/16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0/16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0/16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0/16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0/16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0/16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0/16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0/16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0/16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0/16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0/16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0/16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0/16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L1_1, dScoreFront, U13, U11);
|
||||
MemChipDQFaultSet(ErrorMark_L1_2, dScoreFront, U13, U11);
|
||||
MemChipDQFaultSet(ErrorMark_L1_3, dScoreFront, U13, U11);
|
||||
MemChipDQFaultSet(ErrorMark_L1_4, dScoreFront, U13, U11);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L2_1, dScoreFront, U16, U15);
|
||||
MemChipDQFaultSet(ErrorMark_L2_2, dScoreFront, U16, U15);
|
||||
MemChipDQFaultSet(ErrorMark_L2_3, dScoreFront, U16, U15);
|
||||
MemChipDQFaultSet(ErrorMark_L2_4, dScoreFront, U16, U15);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L1_1, dScoreBack, U27, U28);
|
||||
MemChipDQFaultSet(ErrorMark_L1_2, dScoreBack, U27, U28);
|
||||
MemChipDQFaultSet(ErrorMark_L1_3, dScoreBack, U27, U28);
|
||||
MemChipDQFaultSet(ErrorMark_L1_4, dScoreBack, U27, U28);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L2_1, dScoreBack, U29, U30);
|
||||
MemChipDQFaultSet(ErrorMark_L2_2, dScoreBack, U29, U30);
|
||||
MemChipDQFaultSet(ErrorMark_L2_3, dScoreBack, U29, U30);
|
||||
MemChipDQFaultSet(ErrorMark_L2_4, dScoreBack, U29, U30);
|
||||
|
||||
TMUTexDataFaultSet(ErrorMark_L1_1, ErrorMark_L2_1, 1.0/4, U8_TMU1);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_2, ErrorMark_L2_2, 1.0/4, U8_TMU1);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_3, ErrorMark_L2_3, 1.0/4, U8_TMU1);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_4, ErrorMark_L2_4, 1.0/4, U8_TMU1);
|
||||
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_1,
|
||||
1.0/4,
|
||||
U8_TMU1_TEX_CAS0,
|
||||
U8_TMU1_TEX_CAS1,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_2,
|
||||
1.0/4,
|
||||
U8_TMU1_TEX_CAS0,
|
||||
U8_TMU1_TEX_CAS1,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_3,
|
||||
1.0/4,
|
||||
U8_TMU1_TEX_CAS0,
|
||||
U8_TMU1_TEX_CAS1,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_4,
|
||||
1.0/4,
|
||||
U8_TMU1_TEX_CAS0,
|
||||
U8_TMU1_TEX_CAS1,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_1,
|
||||
1.0/4,
|
||||
U8_TMU1_TEX_CAS2,
|
||||
U8_TMU1_TEX_CAS3,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_2,
|
||||
1.0/4,
|
||||
U8_TMU1_TEX_CAS2,
|
||||
U8_TMU1_TEX_CAS3,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_3,
|
||||
1.0/4,
|
||||
U8_TMU1_TEX_CAS2,
|
||||
U8_TMU1_TEX_CAS3,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_4,
|
||||
1.0/4,
|
||||
U8_TMU1_TEX_CAS2,
|
||||
U8_TMU1_TEX_CAS3,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE );
|
||||
}
|
||||
|
||||
/*
|
||||
if( NbErr )
|
||||
{
|
||||
printf("============\n");
|
||||
if(L1_1 != value1+0)
|
||||
}
|
||||
else if(ucNumTMU == 1)
|
||||
{
|
||||
/* during TMU1 test, TMU0 doesnt receive any textures => ignoring these
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0 / 2, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0 / 2, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0 / 2, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0 / 2, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0 / 2, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0 / 2, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0 / 2, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0 / 2, U9_TMU0_FT_DATA_0, U9_TMU0_FT_DATA_0);
|
||||
*/
|
||||
|
||||
/* U9_TMU0_TT_DATA_x is only tested when using TMU1 */
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0 / 16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0 / 16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0 / 16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0 / 16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0 / 16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0 / 16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0 / 16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0 / 16, U9_TMU0_TT_DATA_0, U9_TMU0_TT_DATA_0);
|
||||
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0 / 16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0 / 16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0 / 16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0 / 16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0 / 16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0 / 16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0 / 16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0 / 16, U8_TMU1_TF_DATA_0, U8_TMU1_TF_DATA_0);
|
||||
|
||||
WordBitFaultSet(ErrorMark_L1_1, 1.0 / 16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_2, 1.0 / 16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_3, 1.0 / 16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L1_4, 1.0 / 16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_1, 1.0 / 16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_2, 1.0 / 16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_3, 1.0 / 16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
WordBitFaultSet(ErrorMark_L2_4, 1.0 / 16, U8_TMU1_FT_DATA_0, U8_TMU1_FT_DATA_0);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L1_1, dScoreFront, U13, U11);
|
||||
MemChipDQFaultSet(ErrorMark_L1_2, dScoreFront, U13, U11);
|
||||
MemChipDQFaultSet(ErrorMark_L1_3, dScoreFront, U13, U11);
|
||||
MemChipDQFaultSet(ErrorMark_L1_4, dScoreFront, U13, U11);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L2_1, dScoreFront, U16, U15);
|
||||
MemChipDQFaultSet(ErrorMark_L2_2, dScoreFront, U16, U15);
|
||||
MemChipDQFaultSet(ErrorMark_L2_3, dScoreFront, U16, U15);
|
||||
MemChipDQFaultSet(ErrorMark_L2_4, dScoreFront, U16, U15);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L1_1, dScoreBack, U27, U28);
|
||||
MemChipDQFaultSet(ErrorMark_L1_2, dScoreBack, U27, U28);
|
||||
MemChipDQFaultSet(ErrorMark_L1_3, dScoreBack, U27, U28);
|
||||
MemChipDQFaultSet(ErrorMark_L1_4, dScoreBack, U27, U28);
|
||||
|
||||
MemChipDQFaultSet(ErrorMark_L2_1, dScoreBack, U29, U30);
|
||||
MemChipDQFaultSet(ErrorMark_L2_2, dScoreBack, U29, U30);
|
||||
MemChipDQFaultSet(ErrorMark_L2_3, dScoreBack, U29, U30);
|
||||
MemChipDQFaultSet(ErrorMark_L2_4, dScoreBack, U29, U30);
|
||||
|
||||
TMUTexDataFaultSet(ErrorMark_L1_1, ErrorMark_L2_1, 1.0 / 4, U8_TMU1);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_2, ErrorMark_L2_2, 1.0 / 4, U8_TMU1);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_3, ErrorMark_L2_3, 1.0 / 4, U8_TMU1);
|
||||
TMUTexDataFaultSet(ErrorMark_L1_4, ErrorMark_L2_4, 1.0 / 4, U8_TMU1);
|
||||
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_1,
|
||||
1.0 / 8,
|
||||
U8_TMU1_TEX_CAS0,
|
||||
U8_TMU1_TEX_CAS1,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_2,
|
||||
1.0 / 8,
|
||||
U8_TMU1_TEX_CAS0,
|
||||
U8_TMU1_TEX_CAS1,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_3,
|
||||
1.0 / 8,
|
||||
U8_TMU1_TEX_CAS0,
|
||||
U8_TMU1_TEX_CAS1,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L1_4,
|
||||
1.0 / 8,
|
||||
U8_TMU1_TEX_CAS0,
|
||||
U8_TMU1_TEX_CAS1,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_1,
|
||||
1.0 / 8,
|
||||
U8_TMU1_TEX_CAS2,
|
||||
U8_TMU1_TEX_CAS3,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_2,
|
||||
1.0 / 8,
|
||||
U8_TMU1_TEX_CAS2,
|
||||
U8_TMU1_TEX_CAS3,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_3,
|
||||
1.0 / 8,
|
||||
U8_TMU1_TEX_CAS2,
|
||||
U8_TMU1_TEX_CAS3,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE);
|
||||
TMUTexDataCtrlFaultSet( ErrorMark_L2_4,
|
||||
1.0 / 8,
|
||||
U8_TMU1_TEX_CAS2,
|
||||
U8_TMU1_TEX_CAS3,
|
||||
mem < 0x200000 ? U8_TMU1_TEX_RAS0 : U8_TMU1_TEX_RAS1,
|
||||
U8_TMU1_TEX_WE );
|
||||
}
|
||||
|
||||
/*
|
||||
printf("== Quick Report ==\n");
|
||||
if(ErrorMark_L1_1)
|
||||
{
|
||||
printf( "LFB[0][0] is 0x%08x [expected 0x%08x] !\n", L1_1, value1+0);
|
||||
printf( "Faulty bits :\n");
|
||||
printbin32Info(ErrorMark_L1_1, 31, 0);
|
||||
printf( "\n");
|
||||
}
|
||||
if(L1_2 != value1+1)
|
||||
if(ErrorMark_L1_2)
|
||||
{
|
||||
printf( "LFB[0][1] is 0x%08x [expected 0x%08x] !\n", L1_2, value1+1);
|
||||
printf( "LFB[0][1] is 0x%08x [expected 0x%08x] !\n", L1_2, value1+1);
|
||||
printf( "Faulty bits :\n");
|
||||
printbin32Info(ErrorMark_L1_2, 31, 0);
|
||||
printf( "\n");
|
||||
}
|
||||
if(L1_3 != value1+2)
|
||||
if(ErrorMark_L1_3)
|
||||
{
|
||||
printf( "LFB[0][2] is 0x%08x [expected 0x%08x] !\n", L1_3, value1+2);
|
||||
printf( "Faulty bits :\n");
|
||||
printbin32Info(ErrorMark_L1_3, 31, 0);
|
||||
printf( "\n");
|
||||
}
|
||||
if(L1_4!= value1+3)
|
||||
if(ErrorMark_L1_4)
|
||||
{
|
||||
printf( "LFB[0][3] is 0x%08x [expected 0x%08x] !\n", L1_4, value1+3);
|
||||
printf( "Faulty bits :\n");
|
||||
@@ -455,122 +412,42 @@ RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
printf( "\n");
|
||||
}
|
||||
|
||||
if(L2_1 != value2+0)
|
||||
if(ErrorMark_L2_1)
|
||||
{
|
||||
printf( "LFB[1][0] is 0x%08x [expected 0x%08x] !\n", L2_1, value2+0);
|
||||
printf( "Faulty bits :\n");
|
||||
printbin32Info(ErrorMark_L2_1, 63, 21);
|
||||
printf( "\n");
|
||||
}
|
||||
if(L2_2 != value2+1)
|
||||
if(ErrorMark_L2_2)
|
||||
{
|
||||
printf( "LFB[1][1] is 0x%08x [expected 0x%08x] !\n", L2_2, value2+1);
|
||||
printf( "Faulty bits :\n");
|
||||
printbin32Info(ErrorMark_L2_2, 63, 21);
|
||||
printf( "\n");
|
||||
}
|
||||
if(L2_3 != value2+2)
|
||||
if(ErrorMark_L2_3)
|
||||
{
|
||||
printf( "LFB[1][2] is 0x%08x [expected 0x%08x] !\n", L2_3, value2+2);
|
||||
printf( "Faulty bits :\n");
|
||||
printbin32Info(ErrorMark_L2_3, 63, 21);
|
||||
printf( "\n");
|
||||
}
|
||||
if(L2_4!= value2+3)
|
||||
if(ErrorMark_L2_4)
|
||||
{
|
||||
printf( "LFB[1][3] is 0x%08x [expected 0x%08x] !\n", L2_4, value2+3);
|
||||
printf( "Faulty bits :\n");
|
||||
printbin32Info(ErrorMark_L2_4, 63, 21);
|
||||
printf( "\n");
|
||||
}
|
||||
|
||||
if(bErrLowBytes)
|
||||
{
|
||||
if(tmu == 0)
|
||||
{
|
||||
if( (ErrorMark_L1_1 & 0xFFFF)
|
||||
|| (ErrorMark_L1_2 & 0xFFFF)
|
||||
|| (ErrorMark_L1_3 & 0xFFFF)
|
||||
|| (ErrorMark_L1_4 & 0xFFFF) )
|
||||
{
|
||||
printf("Check DQ connections to/from U14 (front) and U23 (back)\n");
|
||||
}
|
||||
|
||||
if( (ErrorMark_L1_1 & 0xFFFF0000)
|
||||
|| (ErrorMark_L1_2 & 0xFFFF0000)
|
||||
|| (ErrorMark_L1_3 & 0xFFFF0000)
|
||||
|| (ErrorMark_L1_4 & 0xFFFF0000) )
|
||||
{
|
||||
printf("Check DQ connections to/from U12 (front) and U24 (back)\n");
|
||||
}
|
||||
}
|
||||
else if(tmu == 1)
|
||||
{
|
||||
if( (ErrorMark_L1_1 & 0xFFFF)
|
||||
|| (ErrorMark_L1_2 & 0xFFFF)
|
||||
|| (ErrorMark_L1_3 & 0xFFFF)
|
||||
|| (ErrorMark_L1_4 & 0xFFFF) )
|
||||
{
|
||||
printf("Check DQ connections to/from U13 (front) and U27 (back)\n");
|
||||
}
|
||||
|
||||
if( (ErrorMark_L1_1 & 0xFFFF0000)
|
||||
|| (ErrorMark_L1_2 & 0xFFFF0000)
|
||||
|| (ErrorMark_L1_3 & 0xFFFF0000)
|
||||
|| (ErrorMark_L1_4 & 0xFFFF0000) )
|
||||
{
|
||||
printf("Check DQ connections to/from U11 (front) and U28 (back)\n");
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
if(bErrHighBytes)
|
||||
{
|
||||
if(ucNumTMU == 0)
|
||||
{
|
||||
if( (ErrorMark_L2_1 & 0xFFFF)
|
||||
|| (ErrorMark_L2_2 & 0xFFFF)
|
||||
|| (ErrorMark_L2_3 & 0xFFFF)
|
||||
|| (ErrorMark_L2_4 & 0xFFFF) )
|
||||
{
|
||||
printf("Check DQ connections to/from U18 (front) and U25 (back)\n");
|
||||
}
|
||||
|
||||
if( (ErrorMark_L2_1 & 0xFFFF0000)
|
||||
|| (ErrorMark_L2_2 & 0xFFFF0000)
|
||||
|| (ErrorMark_L2_3 & 0xFFFF0000)
|
||||
|| (ErrorMark_L2_4 & 0xFFFF0000) )
|
||||
{
|
||||
printf("Check DQ connections to/from U17 (front) and U26 (back)\n");
|
||||
}
|
||||
}
|
||||
else if(ucNumTMU == 1)
|
||||
{
|
||||
if( (ErrorMark_L2_1 & 0xFFFF)
|
||||
|| (ErrorMark_L2_2 & 0xFFFF)
|
||||
|| (ErrorMark_L2_3 & 0xFFFF)
|
||||
|| (ErrorMark_L2_4 & 0xFFFF) )
|
||||
{
|
||||
printf("Check DQ connections to/from U16 (front) and U29 (back)\n");
|
||||
}
|
||||
|
||||
if( (ErrorMark_L2_1 & 0xFFFF0000)
|
||||
|| (ErrorMark_L2_2 & 0xFFFF0000)
|
||||
|| (ErrorMark_L2_3 & 0xFFFF0000)
|
||||
|| (ErrorMark_L2_4 & 0xFFFF0000) )
|
||||
{
|
||||
printf("Check DQ connections to/from U15 (front) and U32 (back)\n");
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
}*/
|
||||
*/
|
||||
}
|
||||
|
||||
/* reset the Init0 register back to its previous value */
|
||||
sst1InitIdle(sst);
|
||||
ISET(SST_TREX(sst,ucNumTMU)->trexInit0, devInfo->tmuInit0[(int)ucNumTMU]);
|
||||
sst1InitIdle(sst);
|
||||
|
||||
return NbErr;
|
||||
}
|
||||
|
||||
@@ -605,7 +482,7 @@ test_TMU_datalines( sst1DeviceInfoStruct* devInfo,
|
||||
|
||||
unsigned long long ullNbErrorAll = 0;
|
||||
|
||||
// set downstream TMUs to passthrough
|
||||
/* set downstream TMUs to only passthrough */
|
||||
for (int i=0; i<ucNumTMU; i++)
|
||||
ISET(SST_TREX(sstregs,i)->textureMode, SST_TC_PASS | SST_TCA_PASS);
|
||||
|
||||
@@ -629,7 +506,7 @@ test_TMU_datalines( sst1DeviceInfoStruct* devInfo,
|
||||
ucAddMovingBit++)
|
||||
{
|
||||
FxU32 bitTest = 1u;
|
||||
FxU32 bitTest2 = 1u<<31;
|
||||
FxU32 bitTest2 = 1u << 31;
|
||||
for(unsigned long nloop=0;; nloop++)
|
||||
{
|
||||
unsigned long ulNbError;
|
||||
@@ -649,6 +526,7 @@ test_TMU_datalines( sst1DeviceInfoStruct* devInfo,
|
||||
bitTest = bRandom ? get_notnull_random_balanced_mByte() : (bitTest << 1);
|
||||
bitTest2 = bRandom ? get_notnull_random_balanced_mByte() : (bitTest2 >> 1);
|
||||
}
|
||||
|
||||
//printf("Done @ 0x%08x\n",dataTest);
|
||||
|
||||
const FxU32 new_addrTest = pMemBlk->ulAddStart | (1 << ucAddMovingBit);
|
||||
|
||||
17
Test_Data.h
17
Test_Data.h
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef _DEF_TEST_DATA_H_
|
||||
#define _DEF_TEST_DATA_H_
|
||||
|
||||
|
||||
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
@@ -15,6 +32,11 @@
|
||||
|
||||
#include "Test_Data_Huge.h"
|
||||
|
||||
#define _DEF_NB_PIXEL_ROW 256
|
||||
#define _DEF_NB_PIXEL_COL 256
|
||||
|
||||
//#define _PROFILING
|
||||
|
||||
static unsigned long long
|
||||
RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
FxU32* sst,
|
||||
@@ -23,14 +45,11 @@ RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
const FxU32 mem)
|
||||
{
|
||||
unsigned long NbErr = 0;
|
||||
|
||||
#ifdef _PROFILING
|
||||
clock_t begin = clock();
|
||||
|
||||
#endif
|
||||
ISET(sstregs->texBaseAddr, (mem>>3)); /* set to mem addr */
|
||||
|
||||
#define _DEF_NB_PIXEL_ROW 256
|
||||
#define _DEF_NB_PIXEL_COL 256
|
||||
|
||||
static unsigned short
|
||||
ar_u16Pixels[_DEF_NB_PIXEL_ROW][_DEF_NB_PIXEL_COL];
|
||||
static unsigned long
|
||||
@@ -48,12 +67,14 @@ RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
ar_u16Pixels[iter_row][iter_col+1] = NewData & 0xFFFF;
|
||||
}
|
||||
}
|
||||
clock_t after_create = clock();
|
||||
|
||||
#ifdef _PROFILING
|
||||
clock_t after_create = clock();
|
||||
#endif
|
||||
|
||||
volatile FxU32 *texRowAddr
|
||||
= (ucNumTMU<<(21-2)) + (((FxU32)0/*LOD0*/)<<(17-2))
|
||||
+ (FxU32 *)SST_TEX_ADDRESS(sstregs);
|
||||
+ (FxU32 *)SST_TEX_ADDRESS(sst);
|
||||
|
||||
for(unsigned short iter_row = 0; iter_row < _DEF_NB_PIXEL_ROW; iter_row++)
|
||||
{
|
||||
@@ -64,19 +85,28 @@ RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
}
|
||||
texRowAddr += (1<<(9-2)); //jump to next line
|
||||
}
|
||||
|
||||
#ifdef _PROFILING
|
||||
clock_t after_write = clock();
|
||||
#define NB_CHECK_LOOP 3
|
||||
clock_t before_draw[NB_CHECK_LOOP];
|
||||
clock_t after_draw[NB_CHECK_LOOP];
|
||||
clock_t after_read[NB_CHECK_LOOP];
|
||||
clock_t after_check[NB_CHECK_LOOP];
|
||||
#endif
|
||||
|
||||
for(unsigned int i = 0; i<NB_CHECK_LOOP; i++)
|
||||
{
|
||||
//printf("draw/checking\n");
|
||||
#ifdef _PROFILING
|
||||
before_draw[i] = clock();
|
||||
#endif
|
||||
|
||||
drawTriangle(sstregs, 0, 0, 512); /* draw a 252x512 triangle */
|
||||
after_draw[i] = clock();
|
||||
|
||||
#ifdef _PROFILING
|
||||
after_draw[i] = clock();
|
||||
#endif
|
||||
/*
|
||||
printf("rdy.\n");
|
||||
GrLfbInfo_t info;
|
||||
@@ -125,8 +155,9 @@ RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
pLFB += ((2048)>>2) - ((_DEF_NB_PIXEL_COL*2) >>2) ;
|
||||
|
||||
}
|
||||
#ifdef _PROFILING
|
||||
after_read[i] = clock();
|
||||
|
||||
#endif
|
||||
for(unsigned short iter_row = 0; iter_row < _DEF_NB_PIXEL_ROW; iter_row++)
|
||||
{
|
||||
//printf("checking row %d\n",iter_row);
|
||||
@@ -150,9 +181,11 @@ RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
}
|
||||
}
|
||||
}
|
||||
#ifdef _PROFILING
|
||||
after_check[i] = clock();
|
||||
#endif
|
||||
}
|
||||
/*
|
||||
#ifdef _PROFILING
|
||||
clock_t end = clock();
|
||||
printf("time to create: %f\n",(double)(after_create-begin)/CLOCKS_PER_SEC);
|
||||
printf("time to write: %f\n",(double)(after_write-after_create)/CLOCKS_PER_SEC);
|
||||
@@ -163,8 +196,8 @@ RenderTest( sst1DeviceInfoStruct* devInfo,
|
||||
printf("time to check [%d]: %f\n",i,(double)(after_check[i]-after_read[i])/CLOCKS_PER_SEC);
|
||||
}
|
||||
printf("overall: %f\n",(double)(end-begin)/CLOCKS_PER_SEC);
|
||||
* */
|
||||
//sleep(10);
|
||||
#endif
|
||||
|
||||
return NbErr;
|
||||
}
|
||||
|
||||
@@ -197,20 +230,12 @@ test_TMU_datalines_Huge( sst1DeviceInfoStruct* devInfo,
|
||||
};
|
||||
|
||||
unsigned long long ullNbErrorAll = 0;
|
||||
|
||||
/* set the Init0 register to enable ? MBytes of memory */
|
||||
// info->tmuInit0[tmu] = SST_TREXINIT0_DEFAULT | BIT(20); // BIT(20) seems to use bank 2...even if TMU mem is <= 2MB
|
||||
|
||||
|
||||
devInfo->tmuInit0[(int)ucNumTMU] = SST_TREXINIT0_DEFAULT ;
|
||||
|
||||
sst1InitIdle(sst);
|
||||
ISET(SST_TREX(sstregs,ucNumTMU)->trexInit0, devInfo->tmuInit0[(int)ucNumTMU]);
|
||||
sst1InitIdle(sst);
|
||||
/*
|
||||
sst1InitIdle(sst);
|
||||
ISET(SST_TREX(sstregs,ucNumTMU)->trexInit0, 0x5000 | (devInfo->tmuInit0[(int)ucNumTMU] & ~0x7000));
|
||||
sst1InitIdle(sst);
|
||||
*/
|
||||
|
||||
// set downstream TMUs to passthrough
|
||||
for (int i=0; i<ucNumTMU; i++)
|
||||
|
||||
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef _DEF_TEST_DATA_HUGE_H_
|
||||
#define _DEF_TEST_DATA_HUGE_H_
|
||||
|
||||
|
||||
17
Utils.c
17
Utils.c
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#define _BSD_SOURCE 1
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
|
||||
17
Utils.h
17
Utils.h
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef _DEF_UTILS_H_
|
||||
#define _DEF_UTILS_H_
|
||||
|
||||
|
||||
41
main.c
41
main.c
@@ -1,3 +1,20 @@
|
||||
/* V2MemTest - A CLI Tool to test & fix Voodoo² TMU System
|
||||
* Copyright (C) 2026 ChaCha
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#define _BSD_SOURCE 1
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
@@ -19,6 +36,30 @@
|
||||
#include "Test_Data.h"
|
||||
#include "Test_Data_Huge.h"
|
||||
|
||||
typedef enum _def_eLogLevel {
|
||||
E_LOGLEVEL_ERROR,
|
||||
E_LOGLEVEL_WARNING,
|
||||
E_LOGLEVEL_INFO,
|
||||
E_LOGLEVEL_DEBUG,
|
||||
E_LOGLEVEL_TRACE,
|
||||
}def_eLogLevel;
|
||||
|
||||
typedef struct _def_sOptions
|
||||
{
|
||||
def_eLogLevel ucLogLevel;
|
||||
unsigned char bLogStdOut;
|
||||
char szLogFileName[2048];
|
||||
char szTSVFile[2048];
|
||||
}
|
||||
|
||||
def_sOptions Options = {
|
||||
.ucLogLevel = E_LOGLEVEL_WARNING,
|
||||
.bLogStdOut = 1,
|
||||
.szLogFileName = {0},
|
||||
.szTSVFile = {0}
|
||||
};
|
||||
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
unsigned long long ullNbErrorAll = 0;
|
||||
|
||||
21
nppws
Normal file
21
nppws
Normal file
@@ -0,0 +1,21 @@
|
||||
<NotepadPlus>
|
||||
<Project name="V2MemTest">
|
||||
<File name=".gitignore" />
|
||||
<File name="Draw.c" />
|
||||
<File name="Draw.h" />
|
||||
<File name="FaultSources.c" />
|
||||
<File name="FaultSources.h" />
|
||||
<File name="LICENSE.txt" />
|
||||
<File name="main.c" />
|
||||
<File name="Makefile" />
|
||||
<File name="Readme.md" />
|
||||
<File name="Test_Address.c" />
|
||||
<File name="Test_Address.h" />
|
||||
<File name="Test_Data.c" />
|
||||
<File name="Test_Data.h" />
|
||||
<File name="Test_Data_Huge.c" />
|
||||
<File name="Test_Data_Huge.h" />
|
||||
<File name="Utils.c" />
|
||||
<File name="Utils.h" />
|
||||
</Project>
|
||||
</NotepadPlus>
|
||||
Reference in New Issue
Block a user