当前位置:网站首页>DD's command
DD's command
2022-07-06 00:42:00 【Riding the waves】
dd: Copy a file in a block of a specified size , And perform the specified transformation at the same time of copying
Be careful : The place where the number is specified ends with the following characters , Multiply by the corresponding number :b=512;c=1;k=1024;w=2
Parameters | explain | |||||||||||||||||||||||||
if | file name | Input file name , Default to standard input . That is, specify the source file .< if=input file > | ||||||||||||||||||||||||
of | file name | Output file name , Default to standard output . I.e. designated purpose document .< of=output file > | ||||||||||||||||||||||||
ibs | bytes | Read in at a time bytes Bytes , That is, to specify a block size of bytes Bytes | ||||||||||||||||||||||||
obs | bytes | One output bytes Bytes , That is, to specify a block size of bytes Bytes | ||||||||||||||||||||||||
bs | bytes | Also set read in / The output block size is bytes Bytes | ||||||||||||||||||||||||
cbs | bytes | One conversion bytes Bytes , That is, specify the conversion buffer size | ||||||||||||||||||||||||
skip | blocks | Skip from the beginning of the input file blocks Block and start copying | ||||||||||||||||||||||||
seek | blocks | Skip from the beginning of the output file blocks Block and start copying Be careful : Usually only valid if the output file is disk or tape , That is, backup to disk or tape is valid | ||||||||||||||||||||||||
count | blocks | Just copy blocks Block , The size of the block is equal to ibs Number of bytes specified | ||||||||||||||||||||||||
conv | conversion | Convert the file with the specified parameters
|
边栏推荐
- Spark获取DataFrame中列的方式--col,$,column,apply
- XML配置文件
- [groovy] compile time meta programming (AST syntax tree conversion with annotations | define annotations and use groovyasttransformationclass to indicate ast conversion interface | ast conversion inte
- Pointer - character pointer
- Leetcode 44 Wildcard matching (2022.02.13)
- Classical concurrency problem: the dining problem of philosophers
- Synchronized and reentrantlock
- LeetCode 6005. The minimum operand to make an array an alternating array
- Location based mobile terminal network video exploration app system documents + foreign language translation and original text + guidance records (8 weeks) + PPT + review + project source code
- Basic introduction and source code analysis of webrtc threads
猜你喜欢
关于#数据库#的问题:(5)查询库存表中每本书的条码、位置和借阅的读者编号
看抖音直播Beyond演唱会有感
MCU通过UART实现OTA在线升级流程
Classical concurrency problem: the dining problem of philosophers
Extension and application of timestamp
Arduino hexapod robot
Starting from 1.5, build a micro Service Framework - call chain tracking traceid
notepad++正则表达式替换字符串
小程序技术优势与产业互联网相结合的分析
MySQL存储引擎
随机推荐
孤勇者
Spark SQL空值Null,NaN判断和处理
LeetCode 6005. The minimum operand to make an array an alternating array
Folding and sinking sand -- weekly record of ETF
免费的聊天机器人API
Search (DFS and BFS)
如何利用Flutter框架开发运行小程序
数据分析思维分析方法和业务知识——分析方法(二)
Leetcode Fibonacci sequence
Room cannot create an SQLite connection to verify the queries
Classical concurrency problem: the dining problem of philosophers
Yolov5、Pycharm、Anaconda环境安装
AtCoder Beginner Contest 254【VP记录】
建立时间和保持时间的模型分析
图解网络:TCP三次握手背后的原理,为啥两次握手不可以?
Leetcode 450 deleting nodes in a binary search tree
MySQL storage engine
How to make your own robot
关于#数据库#的问题:(5)查询库存表中每本书的条码、位置和借阅的读者编号
Getting started with devkit