02-11-2013
It does work in ksh88 (Version M-11/16/88f).
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
Can anyone please let me know the meaning of this line,i am not able to understand the egrep part(egrep '^{1,2}).This will search for this combination in beginning but what does the values in {}signifies here.
/bin/echo $WhenToRun | egrep '^{1,2}:$' >/dev/null (1 Reply)
Discussion started by: namishtiwari
1 Replies
2. Solaris
OS : SOLARIS 10
debug tool :$gdb -v
GNU gdb 6.6
compiler : $gcc -v
gcc version 2.95.3 20010315 (release)
When i tried to debug my application i got the following error.
$gdb Pal
GNU gdb 6.6
Copyright (C) 2006 Free Software Foundation, Inc.
This GDB was... (2 Replies)
Discussion started by: satish@123
2 Replies
3. Shell Programming and Scripting
Can Anybody please tell me the meaning of the script:
#!/bin/sh
str=$@
echo $str | sed 's/.*\\//'
exit 0 (6 Replies)
Discussion started by: nixhead
6 Replies
4. UNIX for Dummies Questions & Answers
If I don't explain my issue well enough, I apologize ahead of time, extreme newbie here to scripting.
I'm currently learning scripting from books and have moved on to the text Wicked Cool Shell Scripts by Dave Taylor, but there are still basic concepts that I'm having trouble understanding.
... (10 Replies)
Discussion started by: Chasman78
10 Replies
5. Shell Programming and Scripting
i am beginner in shell scripting.
not able to understand what below line will do.
PS1=${HOST:=Žuname -nŽ}"$ " ; export PS1 HOST
below is the script
#!/bin/hash
PS1=${HOST:=Žuname -nŽ}"$ " ; export PS1 HOST ;
echo $PS1
and i getting the below output
Žuname -nŽ$ (25 Replies)
Discussion started by: scriptor
25 Replies
6. UNIX for Dummies Questions & Answers
I have added some code in my file.
I have created executable rpm file of our code and also I have created debuginfo and debugsource files and installed all three.
But when I debug in gdb I see the the code changes in soucre file. But the break point does not hit at that place as if it did not... (1 Reply)
Discussion started by: rupeshkp728
1 Replies
7. Shell Programming and Scripting
the attached perl script is a deamon that, once kicked off from the command line, it runs in the background and waits for the master server to tell it what plugins to run.
the script works well. but the problem is, whenever i start it, after about a few seconds of starting it, i start getting... (4 Replies)
Discussion started by: SkySmart
4 Replies
8. Programming
Hi ,
could someone suggest best reference for core file understanding , analysis , debugging for different architectures
like what registers represent what in a architecture specific core ..
how to get maximum information out of corrupted core
different tools and how they work and how to... (1 Reply)
Discussion started by: Gopi Krishna P
1 Replies
9. Shell Programming and Scripting
I have this code
#!/bin/bash
LZ () {
RETVAL="\n$(date +%Y-%m-%d_%H-%M-%S) --- "
return RETVAL
}
echo -e $LZ"Test"
sleep 3
echo -e $LZ"Test"
which I want to use to make logentrys on my NAS. I expect of this code that there would be output like
2017-03-07_11-00-00 --- Test (4 Replies)
Discussion started by: matrois
4 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)