tableau-parm(1) [debian man page]
tableau-parm(1) tableau-parm(1) NAME
tableau-parm - Tableau Write-blocking Bridge Query/Command Utility SYNOPSIS
tableau-parm [-r] device DESCRIPTION
tableau-parm is designed to interact with write-blocking forensics bridges produced by Tableau, LLC. It can be used to query bridges for various bridge and device data, as well as to disable DCO regions. OPTIONS
tableau-parm accepts the following parameters: -r Directs tableau-parm to permanently remove a DCO, if it exists. THIS WILL MODIFY THE STATE OF THE DRIVE. USE AT YOUR OWN RISK! (It is recommended for forensics investigations, that a full drive image be taken before this command is run, and then again afterward if a DCO was detected originally.) Note: after running this, you'll need to restart the Tableau bridge for it to correctly detect the changes. device Required argument. Specifies the device file for the bridge/drive to be queried. This must be a device presenting SCSI emulation. Under Linux, all USB and FireWire mass storage devices behave like SCSI devices. Once a bridge and drive are plugged in and powered on, one can generally find out what the device was dynamically mapped to by running: dmesg | tail -20 OUTPUT
tableau-parm generates simple output with one data value per line, interspersed with blank lines and section headers. This output format is subject to change. EXAMPLES
To query a bridge which is mapped to /dev/sda: tableau-parm /dev/sda To remove a DCO from the hard drive on /dev/sda: tableau-parm -r /dev/sda BUGS
Older versions of ATA and SATA Tableau firmwares didn't properly handle HPA and DCO on some types of drives. Be sure to upgrade your block- ers' firmwares using the firmware update utility, version 4.2 or later, which was released on July 5, 2007. This is not really a bug, but something to note: when a drive has both an HPA and DCO section, and the DCO is removed, the HPA is removed with it. This is how the bridge firmware works, and isn't something controlled by tableau-parm. Just something to be aware of. CREDITS
Copyright (C) 2007,2009 Timothy D. Morgan Copyright (C) 1999,2001,2006,2007 D. Gilbert tableau-parm was written by Timothy D. Morgan using portions of SCSI example code written by D. Gilbert. Tableau, LLC cooperated in the development of this tool by providing documentation on the proprietary SCSI interfaces and assisted in test- ing. Without their help, this tool would not have been possible. Tableau, LLC does not endorse or warrant this code in any way. LICENSE
Please see the file "LICENSE" included with this software distribution. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License version 3 for more details. SEE ALSO
hdparm(1) sdparm(1) Forensics Utilities 30 September 2009 tableau-parm(1)
Check Out this Related Man Page
CANFIELD(6) BSD Games Manual CANFIELD(6) NAME
canfield, cfscores -- the solitaire card game canfield SYNOPSIS
canfield cfscores [-a] [user] DESCRIPTION
If you have never played solitaire before, it is recommended that you consult a solitaire instruction book. In Canfield, tableau cards may be built on each other downward in alternate colors. An entire pile must be moved as a unit in building. Top cards of the piles are available to be played on foundations, but never into empty spaces. Spaces must be filled from the stock. The top card of the stock also is available to be played on foundations or built on tableau piles. After the stock is exhausted, tableau spaces may be filled from the talon and the player may keep them open until he wishes to use them. Cards are dealt from the hand to the talon by threes and this repeats until there are no more cards in the hand or the player quits. To have cards dealt onto the talon the player types 'ht' for his move. Foundation base cards are also automatically moved to the foundation when they become available. The command 'c' causes canfield to maintain card counting statistics on the bottom of the screen. When properly used this can greatly increase one's chances of winning. The rules for betting are somewhat less strict than those used in the official version of the game. The initial deal costs $13. You may quit at this point or inspect the game. Inspection costs $13 and allows you to make as many moves as possible without moving any cards from your hand to the talon. (The initial deal places three cards on the talon; if all these cards are used, three more are made available.) Finally, if the game seems interesting, you must pay the final installment of $26. At this point you are credited at the rate of $5 for each card on the foundation; as the game progresses you are credited with $5 for each card that is moved to the foundation. Each run through the hand after the first costs $5. The card counting feature costs $1 for each unknown card that is identified. If the information is toggled on, you are only charged for cards that became visible since it was last turned on. Thus the maximum cost of information is $34. Playing time is charged at a rate of $1 per minute. With no arguments, the program cfscores prints out the current status of your canfield account. If a user name is specified, it prints out the status of their canfield account. If the -a flag is specified, it prints out the canfield accounts for all users that have played the game since the database was set up. FILES
/usr/games/canfield the game itself /usr/games/cfscores the database printer /var/games/cfscores the database of scores BUGS
It is impossible to cheat. AUTHORS
Originally written: Steve Levine. Further random hacking by: Steve Feldman, Kirk McKusick, Mikey Olson, and Eric Allman. BSD
May 31, 1993 BSD