10 More Discussions You Might Find Interesting
1. Cybersecurity
Hello,
I have a RedHat machine (version 5.11) and i need to install BIND version version 9.9.7-P2 in order to fix a known BIND vulnerability CVE-2015-5477.
I downloaded the tar file from isc website but i am having trouble to install the file.
Does anybody knows a link for the rpm package of... (0 Replies)
Discussion started by: omonoiatis9
0 Replies
2. Red Hat
After checking the dependencies from below command:-
yum deplist gcc
Update:-
Now when I tried to install the very first dependency , it gave the below error, I guess something is wrong with YUM server itself :P
... (1 Reply)
Discussion started by: manish131081
1 Replies
3. Android
I need to run and monitor applications on Android Emulator. I am using the strace utility to monitor system calls. Everytime to start strace i need to manually start the application , get the process Id of the application and then give it to strace to start logging all the system calls.
So is... (20 Replies)
Discussion started by: far001han
20 Replies
4. UNIX for Advanced & Expert Users
Hi,
does anyone know the equivalent command of the following in AIX :
$ strace -tp 15033
Process 15033 attached - interrupt to quit
11:28:06 gettimeofday({1257766086, 104118}, NULL) = 0
11:28:06 getrusage(RUSAGE_SELF, {ru_utime={2270, 615813}, ru_stime={0, 634903}, ...}) = 0
Thank you (6 Replies)
Discussion started by: big123456
6 Replies
5. Shell Programming and Scripting
How to make RPM not write to RPM database if RPM fails to deploy?
IE I create an rpm spec file that contains the following
if
then
exit 1
fi
My rpm will fail at deployment, but if I do rpm -qa , I can see the rpm in the rpm db (3 Replies)
Discussion started by: 3junior
3 Replies
6. Shell Programming and Scripting
hi
i have an application which have a expect script. But now when I run application on other machines, it requires expect to be present on that system.
Now I have the binary of expect with all the libraries required.
The binary support for Rhel 5 version or later versions.
Can aneone tell... (2 Replies)
Discussion started by: tapan_kumawat
2 Replies
7. Red Hat
Hello,
Any pointers where to get an rpm for xtrlock?
Thanks,
mgb (0 Replies)
Discussion started by: mgb
0 Replies
8. Red Hat
HI all,
What the minimum & recommended system requirement for Rhel Linux to get install on it??:(
Plz reply ASAp (0 Replies)
Discussion started by: saurabh84g
0 Replies
9. UNIX for Advanced & Expert Users
Hi Gurus,
I need to trace a sqlplus session using strace.
Can someone please provide me the syntax. sorry was not able to figure out by reading the man page. :-(
i tried to do as below but getting the error
xt33db006/u1/app/oracle/product/10.2.0/asm_1$ strace -f sqlplus '/as sysdba'... (0 Replies)
Discussion started by: p4cldba
0 Replies
10. UNIX for Advanced & Expert Users
OK so I wanted to know how does grep outputs to the pipe and how sort reads from it. So I run a strace over "grep blah myfile | sort" and this is what I got:
open("myfile", O_RDONLY|O_LARGEFILE) = 3
fstat64(3, {st_mode=S_IFREG|0600, st_size=84, ...}) = 0
read(3, "blah blah and blah cause of... (4 Replies)
Discussion started by: klam
4 Replies
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)