11-20-2013
This User Gave Thanks to drl For This Post:
10 More Discussions You Might Find Interesting
1. HP-UX
Hi All
I want to plan my backups, but 1st i would like to know what is the size of each directory. Is there any command which can show me the size of directories?
Regards (2 Replies)
Discussion started by: cgege
2 Replies
2. UNIX for Dummies Questions & Answers
$ls -lrt mydir
total 12
drwxrwxrwx 2 nobody nobody 512 Aug 8 11:51 tmp
drwxrwxrwx 2 nobody nobody 4608 Jan 19 12:20 web.cache
$ ls -lrt mydir/web.cache/
total 0
$ ls -lrt mydir/tmp/
total 0
Can anyone explain me the above results? I know the o/p of ls, but this... (3 Replies)
Discussion started by: rahulrathod
3 Replies
3. UNIX for Dummies Questions & Answers
Hi
I am using the command below to list the 10 biggest directories and files in my present directory
du -hs * | sort +0 | tail -10
the output is
8K disk-space
16K rish
32K WINDOWS
48K tests
104K imgvdEwLa.jpg
168K 020204_aerosmith_1024768.jdk
3.2M Acdc -... (4 Replies)
Discussion started by: the.noob
4 Replies
4. Shell Programming and Scripting
find -type d -name "TC_*" | sort
That's what I have so far... it finds the appropriate directories and then sorts them. But, when it comes to nested subdirectories, it only sorts relative to the first subdirectory. I want it to sort based on the directory at the end of the path. Does anyone know... (3 Replies)
Discussion started by: crimsondarkn
3 Replies
5. Shell Programming and Scripting
Hi,
how to know the size of the files in the directory, exclusing the subfolder. ?
i tried du -h
du -sk
du -k
but its not giving.. (2 Replies)
Discussion started by: mail2sant
2 Replies
6. Shell Programming and Scripting
Hi ,
I am very new to unix as well as shell scripting. I have to write a script for the following requirement.
In a particular mount, have to list all the directories and sub directories along with size of the directory and sub directory in ascending order.
Please help me in this regard and many... (4 Replies)
Discussion started by: nmakkena
4 Replies
7. Shell Programming and Scripting
Can some one help in sorting the attached file.
I used cmd: sort -r jar1.txt -o sortedjar.txt , but it didnt work.
Thanks for your help in Advance. (6 Replies)
Discussion started by: sawyer
6 Replies
8. UNIX for Dummies Questions & Answers
Alright so I've tried a couple different things that at first glance, looked like they worked.
find . -maxdepth 5 -type d -daystart -mtime 1 | xargs du -h Which seems to ignore the previous commands such as depth and modified time.
find .. -maxdepth 2 -type d -daystart -ctime 1 | xargs... (8 Replies)
Discussion started by: Aussiemick
8 Replies
9. Shell Programming and Scripting
Hi guys,
i'm searching for a command, which gives me back all the directories which are greater than a particular size?
thx for helping so far :b:
guti (2 Replies)
Discussion started by: guti_rocks
2 Replies
10. UNIX for Dummies Questions & Answers
Hello,
There are 3 directories on FTP server with format yyyymmddhhmiss.
Can someone please let tell me how do I sort these directories in descending order.
I only have get the files from the latest directory on FTP server.
ftp>ls -l
20150707011229
20150707061229
20150707131225
... (2 Replies)
Discussion started by: pavan_test
2 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)
NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS
--predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO
bup-midx(1), bup-save(1)
BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown- bup-margin(1)