01-13-2013
? It doesn't look like it would fetch the next record, it looks like it would break, i.e. stop the loop.
8 More Discussions You Might Find Interesting
1. Programming
Dear all,
I used debugger from C++ and these are the message I got:
Program received signal SIGSEGV, Segmentation fault.
0x00323fc0 in free () from /lib/tls/libc.so.6
(gdb) info s
#0 0x00323fc0 in free () from /lib/tls/libc.so.6
#1 0x00794fa1 in operator delete () from... (5 Replies)
Discussion started by: napapanbkk
5 Replies
2. UNIX for Dummies Questions & Answers
When i run a program in sun solaris i got core dumped with an error message as follows...
signal SEGV (no mapping at the fault address) in _malloc_unlocked at 0xfe1d44ac
0xfe1d44ac: _malloc_unlocked+0x022c: ld , %o3
Current function is GetEDBInfo
360 EXEC SQL
(dbx) where... (1 Reply)
Discussion started by: noufal
1 Replies
3. Programming
Program received signal SIGSEGV, Segmentation fault
si_code: 1 - SEGV_MAPERR - Address not mapped to object.
0x9fffffffbe7080d0:0 in free+0xb0 () from /usr/lib/hpux64/libc.so.1
Hi ,
I have developed a class to read config file (flat file with space as a field seperator ) on plattform... (3 Replies)
Discussion started by: pravinbhingare
3 Replies
4. UNIX for Dummies Questions & Answers
:) Firstly Hi all!!, im NEW!! and on here hoping that someone might be able to offer me some help... i have a server that keeps crashing every few days with the error message:
PANIC KERNAL-MODE ADDRESS FAULT ON USER ADDRESS 0X14
KERNAL PAGE FAULT FROM (CS:EIP)=(100:EF71B5BD)
EAX=EF822000... (10 Replies)
Discussion started by: Twix
10 Replies
5. UNIX for Dummies Questions & Answers
Hello - I need to know the detail of HUP and SEGV.
I know HUP is Hangup and can be use to kill a Unix login session remotely by sending a hangup signal to the process running the login session.
Could someone tell me in detail prupose of HUP and SEGV (segmentation violation)?
I need to... (1 Reply)
Discussion started by: namasteall2000
1 Replies
6. UNIX for Dummies Questions & Answers
Hello
i ve got the following error on a C servor.
signal SEGV (no mapping at the fault address)
when running in dbx
program terminated by signal SEGV (no mapping at the fault address)
0xff1d5cb4: srch_dir+0x0154: cmp %o1, %o0
Current function is _log
533 ... (4 Replies)
Discussion started by: mumuri
4 Replies
7. Red Hat
Red Hat Enterprise 4.5 (32 bit)
In strace we see "unexpected reloc type 0x38" What does that code 0x38 mean?
mprotect(0x59a000, 42229760, PROT_READ|PROT_WRITE) = 0
writev(2, unexpected reloc type 0x38", 26}, {"", 0}, {"", 0}, {"\n", 1}], 1
0) = 113
exit_group(127) ... (6 Replies)
Discussion started by: Sunusernewbie
6 Replies
8. Shell Programming and Scripting
Hello,
I do not know if this is the right title to use. I have a large dictionary database which has the following structure:
where a b c d e are in English and p q r s t are in a target language., the two separated by the delimiter =.
What I am looking for is a perl script which will take... (5 Replies)
Discussion started by: gimley
5 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)