Here is the equivalent example (a 100 MB sparse file on a <10 MB filesystem) but using Solaris and ZFS instead of Linux loopback fs.
Note also that Linux loopback filesystem equivalent is Solaris Loopback file driver (lofi) which would also be usable instead of a ZFS volume as I did.
hi all,
in my server there are some specific application files which are spread through out the server... these are spread in folders..sub-folders..chid folders...
please help me, how can i find the total size of these specific files in the server... (3 Replies)
Dear ALL
Today I faced one problem in the file system, during invoking the command #df -k , I saw /usr reached to 95% Used, could any one give advice ?
thanks & regarded (7 Replies)
I have the next code, and the output is incosistent, what is the problem:
free blocks: 1201595
block size: 4096
total size(free blocks * block size): 626765824
1201595 * 4096 not is 626765824, what's the problem???
#include <sys/statvfs.h>
#include <stdio.h>
int main(){
... (1 Reply)
Hello. I do have a problem.
The statement sounds like this: Given a directory, find all subdirectories (regardless of depth) which contain a file that has more than a half of the size of the respective subdirectory.
I've tried to solve this in many ways, but all I came up with is half... (1 Reply)
#!/bin/sh
##########################################################################################################
#This script is being used for AOK application for cleaning up the .out files and zip it under logs directory.
# IBM
# Created
#For pdocap201/pdoca202 .out files for AOK
#1.... (0 Replies)
Hi Experts,
I have a script like
$ORACLE_HOME/bin/sqlplus username/password # << ENDSQL
set pagesize 0 trim on feedback off verify off echo off newp none timing off
set serveroutput on
set heading off
spool Schemaerrtmp.txt
select ' TIMESTAMP COMPUTER NAME ... (5 Replies)
To find the whole size of a particular directory i use "du -sk /dirname".. but after finding the direcory's size how do i make conditions like if the size of the dir is more than 1 GB i hav to delete some of the files inside the dir (0 Replies)
I have been searching both on Unix.com and Google and have not been able to find the answer to my question. I think it is partly because I can't come up with the right search terms.
Recently, my virtual server switched storage devices and I think the problem may be related to that change.... (2 Replies)
Hello,
Here is my code:
:~$ truncate -s 16M MyTestFile.txt
:~$ du -h MyTestFile.txt
4,0K MyTestFile.txt
Q1: Please why du -h does not work in this case ?
Q2: Other than "du -h", how can i get the size of a directory (using linux command)
Thanks a lot.
Best Regards. (2 Replies)
I am new at developing EXPECT scripts. I'm trying to create a script that will automatically connect to a several UNIX (sun solaris and HPUX) database server via FTP and pull the sizes of the listener/alert log files from specified server directory on the remote machines.
1. I want the script... (7 Replies)
Discussion started by: mikebantor
7 Replies
LEARN ABOUT FREEBSD
archive_entry_linkify
ARCHIVE_ENTRY_LINKIFY(3) BSD Library Functions Manual ARCHIVE_ENTRY_LINKIFY(3)NAME
archive_entry_linkresolver, archive_entry_linkresolver_new, archive_entry_linkresolver_set_strategy, archive_entry_linkresolver_free,
archive_entry_linkify -- hardlink resolver functions
LIBRARY
Streaming Archive Library (libarchive, -larchive)
SYNOPSIS
#include <archive_entry.h>
struct archive_entry_linkresolver *
archive_entry_linkresolver_new(void);
void
archive_entry_linkresolver_set_strategy(struct archive_entry_linkresolver *resolver, int format);
void
archive_entry_linkresolver_free(struct archive_entry_linkresolver *resolver);
void
archive_entry_linkify(struct archive_entry_linkresolver *resolver, struct archive_entry **entry, struct archive_entry **sparse);
DESCRIPTION
Programs that want to create archives have to deal with hardlinks. Hardlinks are handled in different ways by the archive formats. The
basic strategies are:
1. Ignore hardlinks and store the body for each reference (old cpio, zip).
2. Store the body the first time an inode is seen (ustar, pax).
3. Store the body the last time an inode is seen (new cpio).
The archive_entry_linkresolver functions help by providing a unified interface and handling the complexity behind the scene.
The archive_entry_linkresolver functions assume that archive_entry instances have valid nlinks, inode and device values. The inode and
device value is used to match entries. The nlinks value is used to determined if all references have been found and if the internal refer-
ences can be recycled.
The archive_entry_linkresolver_new() function allocates a new link resolver. The instance can be freed using
archive_entry_linkresolver_free(). All deferred entries are flushed and the internal storage is freed.
The archive_entry_linkresolver_set_strategy() function selects the optimal hardlink strategy for the given format. The format code can be
obtained from archive_format(3). The function can be called more than once, but it is recommended to flush all deferred entries first.
The archive_entry_linkify() function is the core of archive_entry_linkresolver. The entry() argument points to the archive_entry that should
be written. Depending on the strategy one of the following actions is taken:
1. For the simple archive formats *entry is left unmodified and *sparse is set to NULL.
2. For tar like archive formats, *sparse is set to NULL. If *entry is NULL, no action is taken. If the hardlink count of *entry is larger
than 1 and the file type is a regular file or symbolic link, the internal list is searched for a matching inode. If such an inode is
found, the link count is decremented and the file size of *entry is set to 0 to notify that no body should be written. If no such inode
is found, a copy of the entry is added to the internal cache with a link count reduced by one.
3. For new cpio like archive formats a value for *entry of NULL is used to flush deferred entries. In that case *entry is set to an arbi-
trary deferred entry and the entry itself is removed from the internal list. If the internal list is empty, *entry is set to NULL. In
either case, *sparse is set to NULL and the function returns. If the hardlink count of *entry is one or the file type is a directory or
device, *sparse is set to NULL and no further action is taken. Otherwise, the internal list is searched for a matching inode. If such
an inode is not found, the entry is added to the internal list, both *entry and *sparse are set to NULL and the function returns. If
such an inode is found, the link count is decremented. If it remains larger than one, the existing entry on the internal list is
swapped with *entry after retaining the link count. The existing entry is returned in *entry. If the link count reached one, the new
entry is also removed from the internal list and returned in *sparse. Otherwise *sparse is set to NULL.
The general usage is therefore:
1. For each new archive entry, call archive_entry_linkify().
2. Keep in mind that the entries returned may have a size of 0 now.
3. If *entry is not NULL, archive it.
4. If *sparse is not NULL, archive it.
5. After all entries have been written to disk, call archive_entry_linkify() with *entry set to NULL and archive the returned entry as long
as it is not NULL.
RETURN VALUES
archive_entry_linkresolver_new() returns NULL on malloc(3) failures.
SEE ALSO archive_entry(3)BSD February 2, 2012 BSD