SunOS5.8 is a radical departure from SunOs4.X in many ways. one of the important differences is the handling of devices. Adding devices under SunOS4.x required a kernel reconfiguration, recompliation and reboot. Under SunOS5.X, this has changed with the ability to add some drivers on the fly.... (1 Reply)
One cool thing about unix is that it predicts disk blocks that you may need and tries to have them in core before you need them. Over the years, various unix vendors tried various algorithms to improve performance. HP has patented their latest algorithm...
Multi-threaded Read Ahead Prediction... (0 Replies)
I would like to search a router config file for "ip address $ip", once found, I want to grab the line just before that contains "interface $interfacetype"
basically saying, 10.3.127.9 is assigned to "Loopback1" given the below as an example.
interface Loopback1
ip address 10.3.127.9... (1 Reply)
Hi Guys,
I wonder if after enabling CIO/DIO at the filesystem level and assuming that CIO/DIO will bypass the JFS2 read ahead available when not using CIO/DIO my questionis what parameters I can play with to tune/improve the CIO in order to obtain similar performance for sequential reads (... (7 Replies)
:confused:
Good Day,
I have this script that gets the archive names and the time it applies based on the alert log. The application of archives are of daily basis and usually many so having this script helps my job become easier.
My problem is that when i get all the time stamps and... (1 Reply)
Hi,
I am trying to write a ksh to compare the time in a date
date
Thu Jul 1 09:01:24 PDT 2010
when I try to get hour
date | awk '{print $4}' | cut -f1 -d:
08
how I can trim the 0 ahead of 08 to make it 8?
please help~ (7 Replies)
Time on unix server shows 8:00a CST
Time on Windows 7 Box shows 8:00a CST
However when you access an NFS share the time stamp on the files show an hour ahead? Talking about a newly created file shows an hour ahead so at 8:00a the file will show a time stamp of 9:00a CST
the problem it... (1 Reply)
Discussion started by: Paul Standley
1 Replies
LEARN ABOUT DEBIAN
tst
tst(3) InterNetNews Documentation tst(3)NAME
tst - ternary search trie functions
SYNOPSIS
#include <inn/tst.h>
struct tst;
struct tst *tst_init(int node_line_width);
void tst_cleanup(struct tst *tst);
int tst_insert(struct tst *tst, const unsigned char *key, void *data, int option, void **exist_ptr);
void *tst_search(struct tst *tst, const unsigned char *key);
void *tst_delete(struct tst *tst, const unsigned char *key);
DESCRIPTION
tst_init allocates memory for members of struct tst, and allocates the first node_line_width nodes. A NULL pointer is returned by tst_init
if any part of the memory allocation fails. On success, a pointer to a struct tst is returned.
The value for node_line_width must be chosen very carefully. One node is required for every character in the tree. If you choose a value
that is too small, your application will spend too much time calling malloc(3) and your node space will be too spread out. Too large a
value is just a waste of space.
tst_cleanup frees all memory allocated to nodes, internal structures, as well as tst itself.
tst_insert inserts the string key into the tree. Behavior when a duplicate key is inserted is controlled by option. If key is already in
the tree then TST_DUPLICATE_KEY is returned, and the data pointer for the existing key is placed in exist_ptr. If option is set to
TST_REPLACE then the existing data pointer for the existing key is replaced by data. Note that the old data pointer will still be placed
in exist_ptr.
If a duplicate key is encountered and option is not set to TST_REPLACE then TST_DUPLICATE_KEY is returned. If key is zero length then
TST_NULL_KEY is returned. A successful insert or replace returns TST_OK. A return value of TST_ERROR indicates that a memory allocation
error occurred while trying to grow the node free.
Note that the data argument must never be NULL. If it is, then calls to tst_search will fail for a key that exists because the data value
was set to NULL, which is what tst_search returns. If you just want a simple existence tree, use the tst pointer as the data pointer.
tst_search finds the string key in the tree if it exists and returns the data pointer associated with that key.
If key is not found then NULL is returned, otherwise the data pointer associated with key is returned.
tst_delete deletes the string key from the tree if it exists and returns the data pointer assocaited with that key.
If key is not found then NULL is returned, otherwise the data pointer associated with key is returned.
HISTORY
Converted to POD from Peter A. Friend's ternary search trie documentation by Alex Kiernan <alex.kiernan@thus.net> for InterNetNews 2.4.0.
$Id: tst.pod 9074 2010-05-31 19:01:32Z iulius $
INN 2.5.3 2011-06-10 tst(3)