05-12-2015
An error message like that usually means that another process removed that file while
find was walking the file hierarchy. In other words:
- find used readdir() or getdents() to read a name from the directory it is processing,
- another process unlinks or renames the filename just read by find, and then,
- find tries to stat() the file to check the file's timestamps and gets the error you listed.
These 2 Users Gave Thanks to Don Cragun For This Post:
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Help me understand the right output.
We have two machines.
The first one is
HP-UX machine1 B.11.00 U 9000/800 694339343 unlimited-user license
The second one is
AIX machine2 2 5 00067B2F4C00
with AIX version 5.2.0.0
Here is the command that I use on both systems on different... (9 Replies)
Discussion started by: jerardfjay
9 Replies
2. Programming
I have the following program:
int main(int argc, char** argv){
unsigned long int mean=0;
for(int i=1;i<10;i++){
mean+=poisson(12);
cout<<mean<<endl;
}
cout<<"Sum of poisson: "<< mean;
return 0;
}
when I run it, I get the... (4 Replies)
Discussion started by: santiagorf
4 Replies
3. Ubuntu
It is so till login screen. I mean that when I boot my computer, Ubuntu shows a splash screen with mouse instead of Ubuntu logo and in the login screen it shows XUbuntu login screen... It began when I upgraded to previous kernel, I suppose, but I'm not sure... I can't say that it annoys me very... (6 Replies)
Discussion started by: Sapfeer
6 Replies
4. AIX
Hello together,
i have a strange memory behavior on a AIX 7.1 System, which i cannot explain.
The Filesystem-Cache will not be grow up and drops often after few minutes. I know if a file was deleted, that the same segment in the FS-Cache will also be cleared. But i am not sure if this is the... (8 Replies)
Discussion started by: -=XrAy=-
8 Replies
5. UNIX for Advanced & Expert Users
Centos 5.8
Lets say I have 2 nfs shares mounted to /folder1 and /folder2.
If I do a find / -name *something*
Will it also search the 2 nfs shares ?
If so is there a way to avoid this?
Thanks (2 Replies)
Discussion started by: whegra
2 Replies
6. AIX
I am trying to create an archive using tar. I am specifying a list of directories using the -L option. For testing purposes I created a simple directory structure:
/backup/test
/backup/test/test1
/backup/test/test2
The file specified by the -L option, named files.txt, contains:... (8 Replies)
Discussion started by: judykstra
8 Replies
7. Shell Programming and Scripting
Hi All,
I am facing a strange problem while grepping for a process. Here is the small script that i have written.
It will look for any process running with the parameter passed to the script.
If no process is running it should print appropriate message.
$ cat t.ksh
#!/bin/ksh
set -x
... (9 Replies)
Discussion started by: veeresh_15
9 Replies
8. Shell Programming and Scripting
Hello All,
I have a strange issue. I've created a shell script which connects to RMAN (Oracle Recovery Manager) and executes full DB backup. I then executed this script with nohup and in the background:
$ nohup my_script.sh > logfile.log 2>&1 &The issue is that when I tried to take a look into... (6 Replies)
Discussion started by: JackK
6 Replies
9. UNIX for Advanced & Expert Users
I am getting some strange behaviour from the kill command. When I run the which command it says it points to /usr/bin/kill. When I look at my PATH I have /usr/bin in it. So why does running kill or /usr/bin/kill produce different outputs?
ghost ~
$ which kill
/usr/bin/kill
ghost ~
$ kill... (5 Replies)
Discussion started by: cokedude
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)