1. I have a reference file with the IP addresses and names
2. A script runs and gets me one of the IP addresses and puts it in a separate file, for e.g audit_output.log
3. I now have to check the user associated with the IP address that I get from audit_output.log and print the user.
Can sombody help me on how to go about with this ?
Thanks
Last edited by Don Cragun; 07-07-2014 at 01:22 AM..
Reason: Add CODE tags.
Hi Frnds
I Want to pull xml's from logs based on the below condition.In each log having so many xml's it's taking so much of time to search all logs manually...can u please provide solution
USER:ECMINT CONV:GETARPLNICHUBTST
<CardNbr>376703134104004</CardNbr>
</Envelope>
Response XML:... (3 Replies)
I have some log files and would like to 'strip' some information from them.
I would like to take the time:
time="Mon Oct 20 01:36:21 BST 2008"
and another line that occurs under each time stamp.
Does anyone know how I could do this?
Many thanks. (5 Replies)
Hello,
I cant get the perl script to pull the information from
Sark DNS 4.X Options
ACL Templates=
and other=
Can someone look at the script to see why and fix it please.
FYI..Under Sark DNS 4.x ACL Templates= and other= has an indent/tab, not sure if thats the reason my the script... (24 Replies)
am using txr command (txr 1097) on a process that generates the following output. Im trying to extract the 13th field from the highlighted string. it is delimited by '?'. The 13th field corresponds to the '0' (in bold). can you let me know how I can extract the 13 th field please?
... (1 Reply)
Hello All,
I have created a script to capture logs on every day at every 3 Min.Please find in attach.So my goal is to mail all the logs to myself for pertical date.So can anyone guide me how can i this on the basis of the attached logs.
Regards
Ankit (0 Replies)
Hi,
If I have loads of logs like below and I am interested to print the requests(lines) which have taken more than 1000 ms. In this case how could I print the two highlighted lines ?
abc.log
reqquest id232342 , adfghfasdfsaf, TIME=30
reqquest id11111 , asdfdfghdffsaf, TIME=54
reqquest... (0 Replies)
Hi,
If I have loads of logs like below and I am interested to print the requests(lines) which have taken more than 1000 ms. In this case how could I print the two highlighted lines ?
abc.log
reqquest id232342 , adfghfasdfsaf, TIME=30
reqquest id11111 , asdfdfghdffsaf, TIME=54
reqquest... (4 Replies)
I need to grab information from the output of the ps command.
For each line of ps output that contains _progres -b I need to get the word that follows -p. The "-p" can be anywhere after "_progres -b".
Using grep to select the correct lines is no problem (e.g. ps -ef|grep "_progres \-b|grep -v... (3 Replies)
Hello community,
I'm going crazy to analize an output via shell script and then get some information from it, here is the output:
Slot 2 - MMU2 H, RAU2 X 15/A01
XPIC Enabled
Autorestore Unknown
Slot 3 - MMU2 H, RAU2 X 15/A01
XPIC ... (7 Replies)
Discussion started by: Lord Spectre
7 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)