mirror of
https://github.com/mupen64plus/mupen64plus-oldsvn.git
synced 2024-05-13 17:57:42 -04:00
Removed some non-ascii characters, translated some messages from French to English. From sven.eckelmann@gmx.de
This commit is contained in:
parent
6968a36359
commit
f33a784a2e
|
@ -366,7 +366,7 @@ void ReadSpecialSettings (const char name[21])
|
|||
settings.tonic = TRUE;
|
||||
else if (strstr(name, (const char *)"All") && strstr(name, (const char *)"Star") && strstr(name, (const char *)"Baseball"))
|
||||
settings.ASB = TRUE;
|
||||
else if (strstr(name, (const char *)"<EFBFBD><EFBFBD>״<EFBFBD><EFBFBD>2 ˶<>ɼ<EFBFBD><C9BC><EFBFBD><EFBFBD>"))
|
||||
else if (strstr(name, (const char *)"\xbf\xef\xef\xbd\xbd\xbf\xb4\xd7\xbf\xef\xef\xbd\xbd\xbf\x20\x32\xb6\xcb\xbf\xef\xc9\xbd\xef\xbc\xbd\xbf\xbf\xef\xef\xbd\xbd\xbf\xbf\xef\x0a\xbd"))
|
||||
settings.doraemon2 = TRUE;
|
||||
else if (strstr(name, (const char *)"SPACE INVADERS"))
|
||||
settings.invaders = TRUE;
|
||||
|
|
|
@ -21,7 +21,7 @@
|
|||
/** flags **/
|
||||
// The message box contains three push buttons: Abort, Retry, and Ignore.
|
||||
#define MB_ABORTRETRYIGNORE (0x00000001)
|
||||
// Microsoft® Windows® 2000/XP: The message box contains three push buttons: Cancel, Try Again, Continue. Use this message box type instead of MB_ABORTRETRYIGNORE.
|
||||
// Microsoft(R) Windows(R) 2000/XP: The message box contains three push buttons: Cancel, Try Again, Continue. Use this message box type instead of MB_ABORTRETRYIGNORE.
|
||||
#define MB_CANCELTRYCONTINUE (0x00000002)
|
||||
// The message box contains one push button: OK. This is the default.
|
||||
#define MB_OK (0x00000004)
|
||||
|
|
|
@ -89,7 +89,7 @@ class PluginGuiQueryEvent : public QEvent
|
|||
|
||||
// The message box contains three push buttons: Abort, Retry, and Ignore.
|
||||
#define MB_ABORTRETRYIGNORE (0x00000001)
|
||||
// Microsoft® Windows® 2000/XP: The message box contains three push buttons:
|
||||
// Microsoft(R) Windows(R) 2000/XP: The message box contains three push buttons:
|
||||
// Cancel, Try Again, Continue. Use this message box type instead o
|
||||
// MB_ABORTRETRYIGNORE.
|
||||
#define MB_CANCELTRYCONTINUE (0x00000002)
|
||||
|
|
|
@ -125,7 +125,7 @@ void MTC0(void)
|
|||
case 13: // Cause
|
||||
if (rrt!=0)
|
||||
{
|
||||
printf("écriture dans Cause\n");
|
||||
printf("Write in Cause\n");
|
||||
stop = 1;
|
||||
}
|
||||
else Cause = rrt;
|
||||
|
|
|
@ -626,7 +626,7 @@ static void BLTZAL()
|
|||
if(local_rs < 0)
|
||||
interp_addr += (local_immediate-1)*4;
|
||||
}
|
||||
else printf("erreur dans bltzal\n");
|
||||
else printf("error in bltzal\n");
|
||||
last_addr = interp_addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -661,7 +661,7 @@ static void BGEZAL()
|
|||
if(local_rs >= 0)
|
||||
interp_addr += (local_immediate-1)*4;
|
||||
}
|
||||
else printf("erreur dans bgezal\n");
|
||||
else printf("error in bgezal\n");
|
||||
last_addr = interp_addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -699,7 +699,7 @@ static void BLTZALL()
|
|||
}
|
||||
else interp_addr+=8;
|
||||
}
|
||||
else printf("erreur dans bltzall\n");
|
||||
else printf("error in bltzall\n");
|
||||
last_addr = interp_addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -737,7 +737,7 @@ static void BGEZALL()
|
|||
}
|
||||
else interp_addr+=8;
|
||||
}
|
||||
else printf("erreur dans bgezall\n");
|
||||
else printf("error in bgezall\n");
|
||||
last_addr = interp_addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -948,7 +948,7 @@ static void ERET()
|
|||
update_count();
|
||||
if (Status & 0x4)
|
||||
{
|
||||
printf("erreur dans ERET\n");
|
||||
printf("error in ERET\n");
|
||||
stop=1;
|
||||
}
|
||||
else
|
||||
|
@ -1082,7 +1082,7 @@ static void MTC0()
|
|||
case 13: // Cause
|
||||
if (rrt!=0)
|
||||
{
|
||||
printf("écriture dans Cause\n");
|
||||
printf("Write in Cause\n");
|
||||
stop = 1;
|
||||
}
|
||||
else Cause = rrt;
|
||||
|
@ -3062,7 +3062,7 @@ void prefetch()
|
|||
}
|
||||
else
|
||||
{
|
||||
printf("execution à l'addresse :%x\n", (int)interp_addr);
|
||||
printf("execute address :%x\n", (int)interp_addr);
|
||||
stop=1;
|
||||
}
|
||||
}
|
||||
|
|
|
@ -252,7 +252,7 @@ void BLTZAL(void)
|
|||
if(local_rs < 0 && !skip_jump)
|
||||
PC += (PC-2)->f.i.immediate-1;
|
||||
}
|
||||
else printf("erreur dans bltzal\n");
|
||||
else printf("error in bltzal\n");
|
||||
last_addr = PC->addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -275,7 +275,7 @@ void BLTZAL_OUT(void)
|
|||
if(!skip_jump && local_rs < 0)
|
||||
jump_to(PC->addr + ((jump_target-1)<<2));
|
||||
}
|
||||
else printf("erreur dans bltzal\n");
|
||||
else printf("error in bltzal\n");
|
||||
last_addr = PC->addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -310,7 +310,7 @@ void BGEZAL(void)
|
|||
if(local_rs >= 0 && !skip_jump)
|
||||
PC += (PC-2)->f.i.immediate-1;
|
||||
}
|
||||
else printf("erreur dans bgezal\n");
|
||||
else printf("error in bgezal\n");
|
||||
last_addr = PC->addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -333,7 +333,7 @@ void BGEZAL_OUT(void)
|
|||
if(!skip_jump && local_rs >= 0)
|
||||
jump_to(PC->addr + ((jump_target-1)<<2));
|
||||
}
|
||||
else printf("erreur dans bgezal\n");
|
||||
else printf("error in bgezal\n");
|
||||
last_addr = PC->addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -373,7 +373,7 @@ void BLTZALL(void)
|
|||
else
|
||||
PC+=2;
|
||||
}
|
||||
else printf("erreur dans bltzall\n");
|
||||
else printf("error in bltzall\n");
|
||||
last_addr = PC->addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -401,7 +401,7 @@ void BLTZALL_OUT(void)
|
|||
else
|
||||
PC+=2;
|
||||
}
|
||||
else printf("erreur dans bltzall\n");
|
||||
else printf("error in bltzall\n");
|
||||
last_addr = PC->addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -441,7 +441,7 @@ void BGEZALL(void)
|
|||
else
|
||||
PC+=2;
|
||||
}
|
||||
else printf("erreur dans bgezall\n");
|
||||
else printf("error in bgezall\n");
|
||||
last_addr = PC->addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
@ -469,7 +469,7 @@ void BGEZALL_OUT(void)
|
|||
else
|
||||
PC+=2;
|
||||
}
|
||||
else printf("erreur dans bgezall\n");
|
||||
else printf("error in bgezall\n");
|
||||
last_addr = PC->addr;
|
||||
if (next_interupt <= Count) gen_interupt();
|
||||
}
|
||||
|
|
|
@ -444,7 +444,7 @@ void ERET(void)
|
|||
update_count();
|
||||
if (Status & 0x4)
|
||||
{
|
||||
printf ("erreur dans ERET\n");
|
||||
printf ("error in ERET\n");
|
||||
stop=1;
|
||||
}
|
||||
else
|
||||
|
|
|
@ -86,7 +86,7 @@ void debug(void)
|
|||
(unsigned int)hi,
|
||||
(unsigned int)(lo >> 32),
|
||||
(unsigned int)lo);
|
||||
printf("après %d instructions soit %x\n",
|
||||
printf("apres %d instructions soit %x\n",
|
||||
(unsigned int)(debug_count+Count),
|
||||
(unsigned int)(debug_count+Count));
|
||||
getchar();
|
||||
|
|
|
@ -87,7 +87,7 @@ void debug(void)
|
|||
(unsigned int)hi,
|
||||
(unsigned int)(lo >> 32),
|
||||
(unsigned int)lo);
|
||||
printf("après %d instructions soit %x\n",
|
||||
printf("aprs %d instructions soit %x\n",
|
||||
(unsigned int)(debug_count+Count),
|
||||
(unsigned int)(debug_count+Count));
|
||||
getchar();
|
||||
|
|
|
@ -21,11 +21,11 @@
|
|||
// libPROJ (used by GeoTIFF) is Copytight (c) 2000, Frank Warmerdam
|
||||
// libUnGif is Copyright (c) 1997, Eric S. Raymond
|
||||
//
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// it, incorporate it in a commercial application, use it for school,
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// effort to verify that this software works in the manner I expect it to;
|
||||
// however,...
|
||||
//
|
||||
|
|
|
@ -3,11 +3,11 @@
|
|||
//
|
||||
// Copyright (C) 2001 Michael S. Heiman
|
||||
//
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// it, incorporate it in a commercial application, use it for school,
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// effort to verify that this software works in the manner I expect it to;
|
||||
// however,...
|
||||
//
|
||||
|
|
|
@ -5,11 +5,11 @@
|
|||
//
|
||||
// Copyright 2000, 2001 M. Scott Heiman
|
||||
//
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// it, incorporate it in a commercial application, use it for school,
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// effort to verify that this software works in the manner I expect it to;
|
||||
// however,...
|
||||
//
|
||||
|
|
|
@ -12,11 +12,11 @@
|
|||
// Copyright (c) 1998, 1999 Glenn Randers-Pehrson
|
||||
// (libpng versions 0.97, January 1998, through 1.0.5, October 15, 1999)
|
||||
//
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// it, incorporate it in a commercial application, use it for school,
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// effort to verify that this software works in the manner I expect it to;
|
||||
// however,...
|
||||
//
|
||||
|
|
|
@ -4,11 +4,11 @@
|
|||
// Copyright (C) 2001 M. Scott Heiman
|
||||
// All Rights Reserved
|
||||
//
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// it, incorporate it in a commercial application, use it for school,
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// effort to verify that this software works in the manner I expect it to;
|
||||
// however,...
|
||||
//
|
||||
|
|
|
@ -4,11 +4,11 @@
|
|||
// Copyright (C) 2001 M. Scott Heiman
|
||||
// All Rights Reserved
|
||||
//
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// You may use the software for any purpose you see fit. You may modify
|
||||
// it, incorporate it in a commercial application, use it for school,
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// even turn it in as homework. You must keep the Copyright in the
|
||||
// header and source files. This software is not in the "Public Domain".
|
||||
// You may use this software at your own risk. I have made a reasonable
|
||||
// effort to verify that this software works in the manner I expect it to;
|
||||
// however,...
|
||||
//
|
||||
|
|
|
@ -1037,18 +1037,18 @@ void MP3 ();
|
|||
/*
|
||||
FFT = Fast Fourier Transform
|
||||
DCT = Discrete Cosine Transform
|
||||
MPEG-1 Layer 3 retains Layer 2’s 1152-sample window, as well as the FFT polyphase filter for
|
||||
backward compatibility, but adds a modified DCT filter. DCT’s advantages over DFTs (discrete
|
||||
MPEG-1 Layer 3 retains Layer 2's 1152-sample window, as well as the FFT polyphase filter for
|
||||
backward compatibility, but adds a modified DCT filter. DCT's advantages over DFTs (discrete
|
||||
Fourier transforms) include half as many multiply-accumulate operations and half the
|
||||
generated coefficients because the sinusoidal portion of the calculation is absent, and DCT
|
||||
generally involves simpler math. The finite lengths of a conventional DCTs’ bandpass impulse
|
||||
generally involves simpler math. The finite lengths of a conventional DCTs' bandpass impulse
|
||||
responses, however, may result in block-boundary effects. MDCTs overlap the analysis blocks
|
||||
and lowpass-filter the decoded audio to remove aliases, eliminating these effects. MDCTs also
|
||||
have a higher transform coding gain than the standard DCT, and their basic functions
|
||||
correspond to better bandpass response.
|
||||
|
||||
MPEG-1 Layer 3’s DCT sub-bands are unequally sized, and correspond to the human auditory
|
||||
system’s critical bands. In Layer 3 decoders must support both constant- and variable-bit-rate
|
||||
MPEG-1 Layer 3's DCT sub-bands are unequally sized, and correspond to the human auditory
|
||||
system's critical bands. In Layer 3 decoders must support both constant- and variable-bit-rate
|
||||
bit streams. (However, many Layer 1 and 2 decoders also handle variable bit rates). Finally,
|
||||
Layer 3 encoders Huffman-code the quantized coefficients before archiving or transmission for
|
||||
additional lossless compression. Bit streams range from 32 to 320 kbps, and 128-kbps rates
|
||||
|
|
Loading…
Reference in a new issue