ok, heres what i want i need....well want, hehe...
in a program, its a simple menu, i need to log the user running the program off...back to the login prompt. this is not a super user, just a normal account.
i know i could just set the program to be the users login shell..but i'd rather do... (1 Reply)
hello ,
I have a C program which runs perfectly on linux but gives a segmentation core dump when i try to run it on solaris.
The compilation of the c code happens without any errors on solaris.
Any pointers
thanks
Nayeem (2 Replies)
How to write a program to
store the list of ordinary files and the directory files in the specified directory in two files called dir.dat and ord.dat. Then print the largest directory and largest file? (1 Reply)
Hi everybody,
Can anyone suggest me some good books on Linux Prog.. I know richard stevens is always there.. But any specific books on Linux Porgramming and Networking in Linux.. Wud be of great help if anybody replies.. (4 Replies)
Hello Friends,
I made this program, it is running fine. when i try to add this line of code in to do repeat. It is giving segmentation error. can you please tell me how should i fix tht error.
program runs fine. when i add
char r;
if statement
while (ch r ='y')
some cofe... (4 Replies)
I need a shell programing script for "double words"
Available Data:
This is a shell script that is used to find the ten character words in the machine local
dictionary (/usr/dict/words) that are made up with two valid english words that are
five character long. This means that each of the... (0 Replies)
HI
Can anyone provide me with codes for file transfer server to client or vice versa?
Also please explain how to compile those programs in ubuntu terminal as i am totally new to socket programming.
Thanks (0 Replies)
Discussion started by: mayhemtrigger
0 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)