2020-01-01 19:15:32 +00:00
|
|
|
// /***************************************************************************
|
|
|
|
|
// The Disc Image Chef
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
// Filename : CompactDisc.cs
|
|
|
|
|
// Author(s) : Natalia Portillo <claunia@claunia.com>
|
|
|
|
|
//
|
|
|
|
|
// Component : Core algorithms.
|
|
|
|
|
//
|
|
|
|
|
// --[ Description ] ----------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
// Dumps CDs and DDCDs.
|
|
|
|
|
//
|
|
|
|
|
// --[ License ] --------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
// 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 <http://www.gnu.org/licenses/>.
|
|
|
|
|
//
|
|
|
|
|
// ----------------------------------------------------------------------------
|
2020-01-03 17:51:30 +00:00
|
|
|
// Copyright © 2011-2020 Natalia Portillo
|
2020-01-01 19:15:32 +00:00
|
|
|
// ****************************************************************************/
|
|
|
|
|
|
|
|
|
|
using System;
|
|
|
|
|
using System.Collections.Generic;
|
|
|
|
|
using System.IO;
|
2020-01-05 06:06:50 +00:00
|
|
|
using System.Linq;
|
|
|
|
|
using DiscImageChef.Checksums;
|
2020-01-01 19:15:32 +00:00
|
|
|
using DiscImageChef.CommonTypes.Enums;
|
2020-01-01 21:50:49 +00:00
|
|
|
using DiscImageChef.CommonTypes.Structs;
|
2020-01-02 18:31:49 +00:00
|
|
|
using DiscImageChef.Core.Logging;
|
2020-01-01 19:15:32 +00:00
|
|
|
using DiscImageChef.Devices;
|
|
|
|
|
|
|
|
|
|
// ReSharper disable JoinDeclarationAndInitializer
|
|
|
|
|
// ReSharper disable InlineOutVariableDeclaration
|
|
|
|
|
// ReSharper disable TooWideLocalVariableScope
|
|
|
|
|
|
|
|
|
|
namespace DiscImageChef.Core.Devices.Dumping
|
|
|
|
|
{
|
|
|
|
|
partial class Dump
|
|
|
|
|
{
|
|
|
|
|
// TODO: Fix offset
|
|
|
|
|
void ReadCdFirstTrackPregap(uint blockSize, ref double currentSpeed, Dictionary<MediaTagType, byte[]> mediaTags,
|
|
|
|
|
MmcSubchannel supportedSubchannel, ref double totalDuration)
|
|
|
|
|
{
|
|
|
|
|
bool sense; // Sense indicator
|
|
|
|
|
byte[] cmdBuf; // Data buffer
|
|
|
|
|
double cmdDuration; // Command execution time
|
|
|
|
|
DateTime timeSpeedStart; // Time of start for speed calculation
|
|
|
|
|
ulong sectorSpeedStart = 0; // Used to calculate correct speed
|
|
|
|
|
bool gotFirstTrackPregap = false;
|
|
|
|
|
int firstTrackPregapSectorsGood = 0;
|
|
|
|
|
var firstTrackPregapMs = new MemoryStream();
|
|
|
|
|
|
|
|
|
|
_dumpLog.WriteLine("Reading first track pregap");
|
|
|
|
|
UpdateStatus?.Invoke("Reading first track pregap");
|
|
|
|
|
InitProgress?.Invoke();
|
|
|
|
|
timeSpeedStart = DateTime.UtcNow;
|
|
|
|
|
|
|
|
|
|
for(int firstTrackPregapBlock = -150; firstTrackPregapBlock < 0 && _resume.NextBlock == 0;
|
|
|
|
|
firstTrackPregapBlock++)
|
|
|
|
|
{
|
|
|
|
|
if(_aborted)
|
|
|
|
|
{
|
|
|
|
|
_dumpLog.WriteLine("Aborted!");
|
|
|
|
|
UpdateStatus?.Invoke("Aborted!");
|
|
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
PulseProgress?.
|
|
|
|
|
Invoke($"Trying to read first track pregap sector {firstTrackPregapBlock} ({currentSpeed:F3} MiB/sec.)");
|
|
|
|
|
|
|
|
|
|
sense = _dev.ReadCd(out cmdBuf, out _, (uint)firstTrackPregapBlock, blockSize, 1,
|
|
|
|
|
MmcSectorTypes.AllTypes, false, false, true, MmcHeaderCodes.AllHeaders, true, true,
|
|
|
|
|
MmcErrorField.None, supportedSubchannel, _dev.Timeout, out cmdDuration);
|
|
|
|
|
|
|
|
|
|
if(!sense &&
|
|
|
|
|
!_dev.Error)
|
|
|
|
|
{
|
|
|
|
|
firstTrackPregapMs.Write(cmdBuf, 0, (int)blockSize);
|
|
|
|
|
gotFirstTrackPregap = true;
|
|
|
|
|
firstTrackPregapSectorsGood++;
|
|
|
|
|
totalDuration += cmdDuration;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
// Write empty data
|
|
|
|
|
if(gotFirstTrackPregap)
|
|
|
|
|
firstTrackPregapMs.Write(new byte[blockSize], 0, (int)blockSize);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
sectorSpeedStart++;
|
|
|
|
|
|
|
|
|
|
double elapsed = (DateTime.UtcNow - timeSpeedStart).TotalSeconds;
|
|
|
|
|
|
|
|
|
|
if(elapsed < 1)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
currentSpeed = (sectorSpeedStart * blockSize) / (1048576 * elapsed);
|
|
|
|
|
sectorSpeedStart = 0;
|
|
|
|
|
timeSpeedStart = DateTime.UtcNow;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if(firstTrackPregapSectorsGood > 0)
|
|
|
|
|
mediaTags.Add(MediaTagType.CD_FirstTrackPregap, firstTrackPregapMs.ToArray());
|
|
|
|
|
|
|
|
|
|
EndProgress?.Invoke();
|
|
|
|
|
UpdateStatus?.Invoke($"Got {firstTrackPregapSectorsGood} first track pregap sectors.");
|
|
|
|
|
_dumpLog.WriteLine("Got {0} first track pregap sectors.", firstTrackPregapSectorsGood);
|
|
|
|
|
|
|
|
|
|
firstTrackPregapMs.Close();
|
|
|
|
|
}
|
2020-01-01 21:50:49 +00:00
|
|
|
|
2020-01-02 18:31:49 +00:00
|
|
|
public static void SolveTrackPregaps(Device dev, DumpLog dumpLog, UpdateStatusHandler updateStatus,
|
2020-01-05 06:06:50 +00:00
|
|
|
Track[] tracks, bool supportsPqSubchannel, bool supportsRwSubchannel,
|
|
|
|
|
Database.Models.Device dbDev)
|
2020-01-01 21:50:49 +00:00
|
|
|
{
|
2020-01-05 06:06:50 +00:00
|
|
|
bool sense; // Sense indicator
|
|
|
|
|
byte[] cmdBuf; // Data buffer
|
|
|
|
|
byte[] subBuf;
|
|
|
|
|
int posQ;
|
|
|
|
|
uint retries;
|
|
|
|
|
bool? bcd = null;
|
|
|
|
|
byte[] crc;
|
|
|
|
|
Dictionary<uint, int> pregaps = new Dictionary<uint, int>();
|
2020-01-01 21:50:49 +00:00
|
|
|
|
|
|
|
|
if(!supportsPqSubchannel &&
|
|
|
|
|
!supportsRwSubchannel)
|
|
|
|
|
return;
|
|
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
// Check if subchannel is BCD
|
|
|
|
|
for(retries = 0; retries < 10; retries++)
|
2020-01-01 21:50:49 +00:00
|
|
|
{
|
2020-01-05 06:06:50 +00:00
|
|
|
sense = GetSectorForPregap(dev, 11, dbDev, out subBuf);
|
|
|
|
|
|
|
|
|
|
if(sense)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
bcd = (subBuf[9] & 0x10) > 0;
|
|
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if(bcd is null)
|
|
|
|
|
{
|
|
|
|
|
dumpLog?.WriteLine("Could not detect if drive subchannel is BCD or not, pregaps could not be calculated, dump may be incorrect...");
|
|
|
|
|
|
|
|
|
|
updateStatus?.
|
|
|
|
|
Invoke("Could not detect if drive subchannel is BCD or not, pregaps could not be calculated, dump may be incorrect...");
|
|
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Initialize the dictionary
|
|
|
|
|
for(int i = 0; i < tracks.Length; i++)
|
|
|
|
|
pregaps[tracks[i].TrackSequence] = 0;
|
|
|
|
|
|
|
|
|
|
foreach(Track track in tracks)
|
|
|
|
|
{
|
|
|
|
|
if(track.TrackSequence <= 1)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
int lba = (int)track.TrackStartSector - 1;
|
|
|
|
|
bool pregapFound = false;
|
|
|
|
|
Track previousTrack = tracks.FirstOrDefault(t => t.TrackSequence == track.TrackSequence - 1);
|
|
|
|
|
|
|
|
|
|
bool goneBack = false;
|
|
|
|
|
bool goFront = false;
|
2020-01-01 21:50:49 +00:00
|
|
|
|
2020-01-03 16:11:53 +00:00
|
|
|
// Check if pregap is 0
|
2020-01-05 06:06:50 +00:00
|
|
|
for(retries = 0; retries < 10; retries++)
|
2020-01-03 16:11:53 +00:00
|
|
|
{
|
2020-01-05 06:06:50 +00:00
|
|
|
sense = GetSectorForPregap(dev, (uint)lba, dbDev, out subBuf);
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
if(sense)
|
|
|
|
|
continue;
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
if(bcd == false)
|
|
|
|
|
BinaryToBcdQ(subBuf);
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
CRC16CCITTContext.Data(subBuf, 10, out crc);
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
if(crc[0] != subBuf[10] ||
|
|
|
|
|
crc[1] != subBuf[11])
|
|
|
|
|
continue;
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
BcdToBinaryQ(subBuf);
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
// Q position
|
|
|
|
|
if((subBuf[0] & 0xF) != 1)
|
|
|
|
|
continue;
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
posQ = ((subBuf[7] * 60 * 75) + (subBuf[8] * 75) + subBuf[9]) - 150;
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
if(subBuf[1] != track.TrackSequence - 1 ||
|
|
|
|
|
subBuf[2] == 0 ||
|
|
|
|
|
posQ != lba)
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
pregaps[track.TrackSequence] = 0;
|
|
|
|
|
|
|
|
|
|
pregapFound = true;
|
2020-01-03 16:11:53 +00:00
|
|
|
}
|
|
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
if(pregapFound)
|
|
|
|
|
continue;
|
|
|
|
|
|
2020-01-03 16:11:53 +00:00
|
|
|
// Calculate pregap
|
2020-01-05 15:37:25 +00:00
|
|
|
lba = (int)track.TrackStartSector - 150;
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
pregapFound = false;
|
|
|
|
|
|
|
|
|
|
while(lba > (int)previousTrack.TrackStartSector)
|
2020-01-01 21:50:49 +00:00
|
|
|
{
|
2020-01-05 15:37:25 +00:00
|
|
|
// Some drives crash if you try to read just before the previous read, so seek away first
|
|
|
|
|
GetSectorForPregap(dev, (uint)lba - 10, dbDev, out subBuf);
|
|
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
for(retries = 0; retries < 10; retries++)
|
2020-01-01 21:50:49 +00:00
|
|
|
{
|
2020-01-05 06:06:50 +00:00
|
|
|
sense = GetSectorForPregap(dev, (uint)lba, dbDev, out subBuf);
|
2020-01-01 21:50:49 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
if(sense)
|
|
|
|
|
continue;
|
2020-01-01 21:50:49 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
if(bcd == false)
|
|
|
|
|
BinaryToBcdQ(subBuf);
|
|
|
|
|
|
|
|
|
|
CRC16CCITTContext.Data(subBuf, 10, out crc);
|
2020-01-03 16:11:53 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
if(crc[0] != subBuf[10] ||
|
|
|
|
|
crc[1] != subBuf[11])
|
2020-01-02 18:17:47 +00:00
|
|
|
continue;
|
|
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
BcdToBinaryQ(subBuf);
|
2020-01-02 18:17:47 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
// If it's not Q position
|
|
|
|
|
if((subBuf[0] & 0xF) != 1)
|
2020-01-02 18:17:47 +00:00
|
|
|
{
|
2020-01-05 06:06:50 +00:00
|
|
|
// This means we already searched back, so search forward
|
|
|
|
|
if(goFront)
|
|
|
|
|
{
|
|
|
|
|
lba++;
|
|
|
|
|
|
|
|
|
|
if(lba == (int)previousTrack.TrackStartSector)
|
|
|
|
|
pregapFound = true;
|
|
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
}
|
2020-01-01 21:50:49 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
// Search back
|
|
|
|
|
goneBack = true;
|
|
|
|
|
lba--;
|
|
|
|
|
|
|
|
|
|
break;
|
2020-01-02 18:17:47 +00:00
|
|
|
}
|
2020-01-01 21:50:49 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
// Previous track
|
|
|
|
|
if(subBuf[1] < track.TrackSequence)
|
2020-01-01 21:50:49 +00:00
|
|
|
{
|
|
|
|
|
lba++;
|
|
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
// Already gone back, so go forward
|
|
|
|
|
if(goneBack)
|
|
|
|
|
goFront = true;
|
2020-01-01 21:50:49 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
break;
|
2020-01-01 21:50:49 +00:00
|
|
|
}
|
|
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
// Same track, but not pregap
|
|
|
|
|
if(subBuf[1] == track.TrackSequence &&
|
|
|
|
|
subBuf[2] > 0)
|
2020-01-02 18:17:47 +00:00
|
|
|
{
|
2020-01-05 06:06:50 +00:00
|
|
|
lba--;
|
2020-01-02 18:17:47 +00:00
|
|
|
|
2020-01-01 21:50:49 +00:00
|
|
|
break;
|
2020-01-02 18:17:47 +00:00
|
|
|
}
|
2020-01-01 21:50:49 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
// Pregap according to Q position
|
|
|
|
|
int pregapQ = (subBuf[3] * 60 * 75) + (subBuf[4] * 75) + subBuf[5] + 1;
|
|
|
|
|
|
|
|
|
|
// Bigger than known change, otherwise we found it
|
|
|
|
|
if(pregapQ > pregaps[track.TrackSequence])
|
|
|
|
|
pregaps[track.TrackSequence] = pregapQ;
|
|
|
|
|
else if(pregapQ == pregaps[track.TrackSequence])
|
|
|
|
|
pregapFound = true;
|
|
|
|
|
|
2020-01-01 21:50:49 +00:00
|
|
|
lba--;
|
2020-01-05 06:06:50 +00:00
|
|
|
|
|
|
|
|
break;
|
2020-01-01 21:50:49 +00:00
|
|
|
}
|
2020-01-05 06:06:50 +00:00
|
|
|
|
|
|
|
|
if(pregapFound)
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
if(retries != 10)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
dumpLog?.WriteLine($"Could not calculate pregap for track {track.TrackSequence}");
|
|
|
|
|
updateStatus?.Invoke($"Could not calculate pregap for track {track.TrackSequence}");
|
2020-01-05 15:37:00 +00:00
|
|
|
|
|
|
|
|
break;
|
2020-01-01 21:50:49 +00:00
|
|
|
}
|
2020-01-05 06:06:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for(int i = 0; i < tracks.Length; i++)
|
|
|
|
|
{
|
|
|
|
|
tracks[i].TrackPregap = (ulong)pregaps[tracks[i].TrackSequence];
|
|
|
|
|
tracks[i].TrackStartSector -= tracks[i].TrackPregap;
|
2020-01-01 21:50:49 +00:00
|
|
|
|
|
|
|
|
#if DEBUG
|
2020-01-05 06:06:50 +00:00
|
|
|
dumpLog?.WriteLine($"Track {tracks[i].TrackSequence} pregap is {tracks[i].TrackPregap} sectors");
|
|
|
|
|
updateStatus?.Invoke($"Track {tracks[i].TrackSequence} pregap is {tracks[i].TrackPregap} sectors");
|
2020-01-01 21:50:49 +00:00
|
|
|
#endif
|
2020-01-05 06:06:50 +00:00
|
|
|
}
|
|
|
|
|
}
|
2020-01-01 21:50:49 +00:00
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
static bool GetSectorForPregap(Device dev, uint lba, Database.Models.Device dbDev, out byte[] subBuf)
|
|
|
|
|
{
|
|
|
|
|
byte[] cmdBuf;
|
|
|
|
|
bool sense;
|
|
|
|
|
subBuf = null;
|
|
|
|
|
|
|
|
|
|
sense = dev.ReadCd(out cmdBuf, out _, lba, 2448, 1, MmcSectorTypes.AllTypes, false, false, true,
|
|
|
|
|
MmcHeaderCodes.AllHeaders, true, true, MmcErrorField.None, MmcSubchannel.Raw,
|
|
|
|
|
dev.Timeout, out _);
|
|
|
|
|
|
|
|
|
|
if(sense)
|
|
|
|
|
sense = dev.ReadCd(out cmdBuf, out _, lba, 2448, 1, MmcSectorTypes.Cdda, false, false, false,
|
|
|
|
|
MmcHeaderCodes.None, true, false, MmcErrorField.None, MmcSubchannel.Raw, dev.Timeout,
|
|
|
|
|
out _);
|
|
|
|
|
|
|
|
|
|
if(!sense)
|
|
|
|
|
{
|
|
|
|
|
byte[] tmpBuf = new byte[96];
|
|
|
|
|
Array.Copy(cmdBuf, 2352, tmpBuf, 0, 96);
|
|
|
|
|
subBuf = DeinterleaveQ(tmpBuf);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
sense = dev.ReadCd(out cmdBuf, out _, lba, 96, 1, MmcSectorTypes.AllTypes, false, false, false,
|
|
|
|
|
MmcHeaderCodes.None, false, false, MmcErrorField.None, MmcSubchannel.Raw,
|
|
|
|
|
dev.Timeout, out _);
|
|
|
|
|
|
|
|
|
|
if(sense)
|
|
|
|
|
sense = dev.ReadCd(out cmdBuf, out _, lba, 96, 1, MmcSectorTypes.Cdda, false, false, false,
|
|
|
|
|
MmcHeaderCodes.None, false, false, MmcErrorField.None, MmcSubchannel.Raw,
|
|
|
|
|
dev.Timeout, out _);
|
|
|
|
|
|
|
|
|
|
if(!sense)
|
|
|
|
|
{
|
|
|
|
|
subBuf = DeinterleaveQ(cmdBuf);
|
|
|
|
|
}
|
2020-01-05 15:37:25 +00:00
|
|
|
else if(dbDev?.ATAPI?.RemovableMedias?.Any(d => d.SupportsPlextorReadCDDA == true) == true ||
|
|
|
|
|
dbDev?.SCSI?.RemovableMedias?.Any(d => d.SupportsPlextorReadCDDA == true) == true ||
|
|
|
|
|
dev.Manufacturer.ToLowerInvariant() == "plextor")
|
|
|
|
|
sense = dev.PlextorReadCdDa(out cmdBuf, out _, lba, 2448, 1, PlextorSubchannel.All, dev.Timeout,
|
|
|
|
|
out _);
|
2020-01-05 06:06:50 +00:00
|
|
|
|
2020-01-05 15:37:25 +00:00
|
|
|
{
|
2020-01-05 06:06:50 +00:00
|
|
|
if(!sense)
|
|
|
|
|
{
|
|
|
|
|
byte[] tmpBuf = new byte[96];
|
|
|
|
|
Array.Copy(cmdBuf, 0, tmpBuf, 0, 96);
|
|
|
|
|
subBuf = DeinterleaveQ(tmpBuf);
|
|
|
|
|
}
|
|
|
|
|
}
|
2020-01-01 21:50:49 +00:00
|
|
|
}
|
2020-01-05 06:06:50 +00:00
|
|
|
|
|
|
|
|
return sense;
|
2020-01-01 21:50:49 +00:00
|
|
|
}
|
2020-01-03 16:40:04 +00:00
|
|
|
|
|
|
|
|
static byte[] DeinterleaveQ(byte[] subchannel)
|
|
|
|
|
{
|
|
|
|
|
int[] q = new int[subchannel.Length / 8];
|
|
|
|
|
|
|
|
|
|
// De-interlace Q subchannel
|
|
|
|
|
for(int iq = 0; iq < subchannel.Length; iq += 8)
|
|
|
|
|
{
|
|
|
|
|
q[iq / 8] = (subchannel[iq] & 0x40) << 1;
|
|
|
|
|
q[iq / 8] += subchannel[iq + 1] & 0x40;
|
|
|
|
|
q[iq / 8] += (subchannel[iq + 2] & 0x40) >> 1;
|
|
|
|
|
q[iq / 8] += (subchannel[iq + 3] & 0x40) >> 2;
|
|
|
|
|
q[iq / 8] += (subchannel[iq + 4] & 0x40) >> 3;
|
|
|
|
|
q[iq / 8] += (subchannel[iq + 5] & 0x40) >> 4;
|
|
|
|
|
q[iq / 8] += (subchannel[iq + 6] & 0x40) >> 5;
|
|
|
|
|
q[iq / 8] += (subchannel[iq + 7] & 0x40) >> 6;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
byte[] deQ = new byte[q.Length];
|
|
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
for(int iq = 0; iq < q.Length; iq++)
|
2020-01-03 16:40:04 +00:00
|
|
|
{
|
|
|
|
|
deQ[iq] = (byte)q[iq];
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return deQ;
|
|
|
|
|
}
|
|
|
|
|
|
2020-01-05 06:06:50 +00:00
|
|
|
static void BinaryToBcdQ(byte[] q)
|
|
|
|
|
{
|
|
|
|
|
q[1] = (byte)(((q[1] / 10) << 4) + (q[1] % 10));
|
|
|
|
|
q[2] = (byte)(((q[2] / 10) << 4) + (q[2] % 10));
|
|
|
|
|
q[3] = (byte)(((q[3] / 10) << 4) + (q[3] % 10));
|
|
|
|
|
q[4] = (byte)(((q[4] / 10) << 4) + (q[4] % 10));
|
|
|
|
|
q[5] = (byte)(((q[5] / 10) << 4) + (q[5] % 10));
|
|
|
|
|
q[6] = (byte)(((q[6] / 10) << 4) + (q[6] % 10));
|
|
|
|
|
q[7] = (byte)(((q[7] / 10) << 4) + (q[7] % 10));
|
|
|
|
|
q[8] = (byte)(((q[8] / 10) << 4) + (q[8] % 10));
|
|
|
|
|
q[9] = (byte)(((q[9] / 10) << 4) + (q[9] % 10));
|
|
|
|
|
}
|
|
|
|
|
|
2020-01-03 16:40:04 +00:00
|
|
|
static void BcdToBinaryQ(byte[] q)
|
|
|
|
|
{
|
|
|
|
|
q[1] = (byte)(((q[1] / 16) * 10) + (q[1] & 0x0F));
|
|
|
|
|
q[2] = (byte)(((q[2] / 16) * 10) + (q[2] & 0x0F));
|
|
|
|
|
q[3] = (byte)(((q[3] / 16) * 10) + (q[3] & 0x0F));
|
|
|
|
|
q[4] = (byte)(((q[4] / 16) * 10) + (q[4] & 0x0F));
|
|
|
|
|
q[5] = (byte)(((q[5] / 16) * 10) + (q[5] & 0x0F));
|
|
|
|
|
q[6] = (byte)(((q[6] / 16) * 10) + (q[6] & 0x0F));
|
|
|
|
|
q[7] = (byte)(((q[7] / 16) * 10) + (q[7] & 0x0F));
|
|
|
|
|
q[8] = (byte)(((q[8] / 16) * 10) + (q[8] & 0x0F));
|
|
|
|
|
q[9] = (byte)(((q[9] / 16) * 10) + (q[9] & 0x0F));
|
|
|
|
|
}
|
2020-01-01 19:15:32 +00:00
|
|
|
}
|
|
|
|
|
}
|