7 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hello Team,
I would like to use a shell script that run each 15 minutes in order to recorder the number of process per user
I request your help in order to build an awk script under Solaris from the following command or similar:
ps -fea -o user | sort | uniq -c | sort -k 2
648 ... (3 Replies)
Discussion started by: csierra
3 Replies
2. What is on Your Mind?
Hello,
I have been working as Solaris/Linux Admin since past 8 years. I am looking options for my profile change, but there is some limitation. I worked as 24x7 support for admin, server support, high availability, etc. But been worked on developing side and scripting part.
When I search for Big... (2 Replies)
Discussion started by: nightup2222
2 Replies
3. Red Hat
Hi all,
i need to collect all system activities data(processes running, disk details, memory, etc), system logs and things related.
i heard of cfg2html but its not available for my CentOS distro(i may need to install separately but thats not what i wana do).
i can use sar for syatem... (1 Reply)
Discussion started by: ajayyadavmca
1 Replies
4. AIX
Hi All,
I have two mount points have the same data with little changes between them
/appabc1
/appabc2
Both of them have the same data, there is some little changes on the data between them
I want /appabc2 to has the same data of /appabc1 exactly including to those little changes... (6 Replies)
Discussion started by: Mr.AIX
6 Replies
5. UNIX for Advanced & Expert Users
Hi,
In order to have a sand box machine that I could use to test some system changes before going to production state, I'd like to duplicate a working system to a virtual one. Ideally, I'd like to manage to do it this way :
- Make a full system backup excluding the user file system (this... (7 Replies)
Discussion started by: pagaille
7 Replies
6. HP-UX
Hi all,
I have a server running HP-UX 11i V1 (11.11).
We had a problem with the system disk which cannot boot and the recovery with the CD failed too.
the only solution was to re-install the system on a new disk.
The problem now is to get access to the data which are on other disks, not... (2 Replies)
Discussion started by: aribault
2 Replies
7. Shell Programming and Scripting
I have created simple shell script
#!/bin/sh
echo `date`; echo "Start ....
find . -mtime +95 -print > /tmp/files.txt
for file in `cat /tmp/files.txt`
do
echo "copying file - $file"
/usr/local/bin/scp -p -P 2222 $file remote.hostname:/file/path
echo "copid file -... (3 Replies)
Discussion started by: ynilesh
3 Replies
ici::doc::pod3::sdrhash(3) ICI library functions ici::doc::pod3::sdrhash(3)
NAME
sdrhash - Simple Data Recorder hash table management functions
SYNOPSIS
#include "sdr.h"
Object sdr_hash_create (Sdr sdr, int keyLength,
int estNbrOfEntries,
int meanSearchLength);
int sdr_hash_insert (Sdr sdr, Object hash, char *key,
Address value, Object *entry);
int sdr_hash_delete_entry (Sdr sdr, Object entry);
int sdr_hash_entry_value (Sdr sdr, Object hash, Object entry);
int sdr_hash_retrieve (Sdr sdr, Object hash, char *key,
Address *value, Object *entry);
int sdr_hash_count (Sdr sdr, Object hash);
int sdr_hash_revise (Sdr sdr, Object hash, char *key,
Address value);
int sdr_hash_remove (Sdr sdr, Object hash, char *key,
Address *value);
int sdr_hash_destroy (Sdr sdr, Object hash);
DESCRIPTION
The SDR hash functions manage hash table objects in an SDR.
Hash tables associate values with keys. A value is always in the form of an SDR Address, nominally the address of some stored object
identified by the associated key, but the actual significance of a value may be anything that fits into a long. A key is always an array
of from 1 to 255 bytes, which may have any semantics at all.
Keys must be unique; no two distinct entries in an SDR hash table may have the same key. Any attempt to insert a duplicate entry in an SDR
hash table will be rejected.
All keys must be of the same length, and that length must be declared at the time the hash table is created. Invoking a hash table
function with a key that is shorter than the declared length will have unpredictable results.
An SDR hash table is an array of linked lists. The location of a given value in the hash table is automatically determined by computing a
"hash" of the key, dividing the hash by the number of linked lists in the array, using the remainder as an index to the corresponding
linked list, and then sequentially searching through the list entries until the entry with the matching key is found.
The number of linked lists in the array is automatically computed at the time the hash table is created, based on the estimated maximum
number of entries you expect to store in the table and the mean linked list length (i.e., mean search time) you prefer. Increasing the
maximum number of entries in the table and decreasing the mean linked list length both tend to increase the amount of SDR heap space
occupied by the hash table.
Object sdr_hash_create(Sdr sdr, int keyLength, int estNbrOfEntries, int meanSearchLength)
Creates an SDR hash table. Returns the SDR address of the new hash table on success, zero on any error.
int sdr_hash_insert(Sdr sdr, Object hash, char *key, Address value, Object *entry)
Inserts an entry into the hash table identified by hash. On success, places the address of the new hash table entry in entry and
returns zero. Returns -1 on any error.
int sdr_hash_delete_entry(Sdr sdr, Object entry)
Deletes the hash table entry identified by entry. Returns zero on success, -1 on any error.
Address sdr_hash_entry_value(Sdr sdr, Object hash, Object entry)
Returns the value of the hash table entry identified by entry.
int sdr_hash_retrieve(Sdr sdr, Object hash, char *key, Address *value, Object *entry)
Searches for the value associated with key in this hash table, storing it in value if found. If the entry matching key was found,
places the address of the hash table entry in entry and returns 1. Returns zero if no such entry exists, -1 on any other failure.
int sdr_hash_count(Sdr sdr, Object hash)
Returns the number of entries in the hash table identified by hash.
int sdr_hash_revise(Sdr sdr, Object hash, char *key, Address value)
Searches for the hash table entry matching key in this hash table, replacing the associated value with value if found. Returns 1 if
the entry matching key was found, zero if no such entry exists, -1 on any other failure.
int sdr_hash_remove(Sdr sdr, Object hash, char *key, Address *value)
Searches for the hash table entry matching key in this hash table; if the entry is found, stores its value in value, deletes the entry,
and returns 1. Returns zero if no such entry exists, -1 on any other failure.
void sdr_hash_destroy(Sdr sdr, Object hash);
Destroys hash, destroying all entries in all linked lists of the array and destroying the hash table array structure itself. DO NOT
use sdr_free() to destroy a hash table, as this would leave the hash table's content allocated yet unreferenced.
SEE ALSO
sdr(3), sdrlist(3), sdrtable(3)
perl v5.14.2 2012-05-25 ici::doc::pod3::sdrhash(3)
