10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi,
thanks to a precedent post, and thanks to the reply of derekludwig of the forum, I have convert my first awk command as :
test.txt is : AAAAAGHIJKLAjKMEFJKLjklABCDJkLEFGHIJKL
awk -f findstring.awk test.txt > textreturn.txtfindstring.awk is :
BEGIN{ SLENGTH = 3 }
{
... (3 Replies)
Discussion started by: thewizarde6
3 Replies
2. UNIX for Advanced & Expert Users
When I was trying to mirror in my v880 server after OS up gradation from 8 to 10
metadb -afc 3 /dev/dsk/c1t1d0s7
I got an error
metadb: Segmentation Fault
Segmentation Fault (core dumped)
Then I logged a case to Oracle/sun team they suggest
"Please could you try
metadb -ac 3... (0 Replies)
Discussion started by: taherahmed
0 Replies
3. Programming
i am executing following program
int main()
{ char str;
FILE * fp;
int i=0; ... (4 Replies)
Discussion started by: bhavesh.sapra
4 Replies
4. Red Hat
Hi All,
I am getting "Segmentation fault (core dumped)" error in the runtime. I am new this please can you tell me why is that i am getting this error and I am not sure of my compilation :
gcc -c avc_test.c
gcc -c md5.c
gcc avc_test.o md5.o -shared -Llibcoreavc_sdk.so -o proj
... (1 Reply)
Discussion started by: fido.genial
1 Replies
5. Solaris
i am getting segmentation fault (core dumped)
i tried following things but couldn't understand what is wrong with my prog and where the problem is....
i have only adb debugger available on solaris....
so plz help
bash-3.00$ pstack core
core 'core' of 765: ./mod_generalised_tapinread... (4 Replies)
Discussion started by: junaid.nehvi
4 Replies
6. Solaris
i am getting Segmentation Fault (core dumped) on solaris,
but when i run the same program with same input on linux it runs successfully.
How can i trace the fault in program on solaris. (6 Replies)
Discussion started by: junaid.nehvi
6 Replies
7. Programming
I have written a code in UNIX which is complied by using g++. Compling with turbo C didnt yield any errors, but with g++ I am getting Memory fault, core dumped. Could anyone help me out with this?
Given below is the code:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>... (2 Replies)
Discussion started by: usshell
2 Replies
8. UNIX for Advanced & Expert Users
I use SCO UNIX 5.07 on a Compaq Proliant Machine. Each time I press the Escape or Delete key while running a program or issuing a FoxBase+ command from the dot prompt, I receive the error message: "Memory Fault - Core Dumped" and the screen locks up immediately.
I would appreciate if necessary... (0 Replies)
Discussion started by: bayuz
0 Replies
9. Programming
what r the situations to receive an error msg like the one below
Segmentation Fault (core dumped) (2 Replies)
Discussion started by: bankpro
2 Replies
10. UNIX for Dummies Questions & Answers
Hello To All!
Now anfd then I receive a message on my console:
Segmentation fault (core dumped)
What does it mean? Or more precisely what are the implications?
:confused: (1 Reply)
Discussion started by: Ivo
1 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)
