Utility Library

This page is currently being updated to AmigaOS 4.x. Some of the information contained here may not yet be applicable in part or totally.

Utility Library

Utility library is the home for all the OS functions which don't fit in the other libraries. Among the calls in utility library are calls to manage tags and tag lists, callback hooks, and some generic 32-bit math functions, all discussed below.

Date Functions

To ease date-related calculations, the utility library has some functions to convert a date, specified in a ClockData structure, in the number of seconds since 00:00:00 01-Jan-78 and vice versa.

To indicate the date, the ClockData structure (in <utility/date.h>) is used.

struct ClockData
{
    UWORD sec;     /* seconds (0 - 59) */
    UWORD min;     /* minutes (0 - 59) */
    UWORD hour;    /* hour (0 - 23) */
    UWORD mday;    /* day of the month (1 - 31) */
    UWORD month;   /* month of the year (1 - 12) */
    UWORD year;    /* 1978 - */
    UWORD wday;    /* day of the week (0 - 6, where 0 is Sunday) */
};

The following functions are available to operate on ClockData:

Utility Library Date Functions

Amiga2Date()	Calculate the date from the specified timestamp (in seconds).
CheckDate()	Check the legality of a date.
Date2Amiga()	Calculate the timestamp from the specified date.

Amiga2Date() takes a number of seconds from 01-Jan-78 as argument and fills in the supplied ClockData structure with the date and time.

CheckDate() checks if the supplied ClockData structure is valid, and returns the number of seconds from 01-Jan-78 if it is. Note that this function currently does not take the supplied day of the week in account.

Date2Amiga() takes a ClockData structure as argument and returns the number of seconds since 01-Jan-78. The supplied ClockData structure must be valid, since no checking is done.

The following example shows various uses of the utility library date functions.

// a2d.c
#include <exec/types.h>
#include <exec/memory.h>
#include <dos/datetime.h>
#include <devices/timer.h>
 
// Note these three libraries are opened by newlib startup code.
#include <proto/exec.h>
#include <proto/dos.h>
#include <proto/utility.h>
 
#include <proto/timer.h>
 
struct TimerIFace *ITimer = NULL;
 
int main()
{
  struct timerequest *tr = IExec->AllocSysObjectTags(ASOT_IOREQUEST,
    ASOIOR_Size, sizeof(struct TimeRequest),
    ASOIOR_ReplyPort, NULL,
    TAG_END);
 
  if (tr != NULL)
  {
    if (!(IExec->OpenDevice("timer.device", UNIT_VBLANK, (struct IORequest *)tr, 0) ))
    {
      struct Library *TimerBase = tr->tr_node.io_Device;
      ITimer = (struct TimerIFace*)IExec->GetInterface(TimerBase, "main", 1, NULL);
 
      if (ITimer != NULL)
      {
        struct TimeVal tv;
        ITimer->GetSysTime(&tv);
 
        IDOS->Printf("GetSysTime():\t%d %d\n", tv.Seconds, tv.Microseconds);
 
        struct ClockData clockdata;
        IUtility->Amiga2Date(tv.Seconds, &clockdata);
 
        IDOS->Printf("Amiga2Date():  sec %d min %d hour %d\n",
          clockdata.sec, clockdata.min, clockdata.hour);
 
        IDOS->Printf("               mday %d month %d year %d wday %d\n",
          clockdata.mday, clockdata.month, clockdata.year, clockdata.wday);
 
        int32 seconds = IUtility->CheckDate(&clockdata);
 
        IDOS->Printf("CheckDate():\t%ld\n", seconds);
 
        seconds = IUtility->Date2Amiga(&clockdata);
 
        IDOS->Printf("Date2Amiga():\t%ld\n", seconds);
 
        IEXec->DropInterface((struct Interface*)ITimer);
      }
 
      IExec->CloseDevice((struct IORequest *)tr);
    }
 
    IExec->FreeSysObject(ASOT_IOREQUEST, tr);
  }
 
  return RETURN_OK;
}

Named Objects

AddNamedObject()	Add a named object to a namespace.
AllocNamedObject()	Allocate a named object.
AttemptRemNamedObject()	Attempt to remove a named object.
FindNamedObject()	Find the next named object (case sensitive).
FreeNamedObject()	Frees a named object.
NamedObjectName()	Return the name of a named object.
ReleaseNamedObject()	Release usage of a named object.
RemNamedObject()	Remove a named object from any namespace.

Insert documentation here.

Data Structures

Splay Trees

Splay trees are a form of binary tree which organizes itself in response to insertions and searches. Whenever a search finds a specific tree node, that node is "pulled up" into the tree root, and the tree is subsequently reorganized. This reorganization is called "splaying" and has the effect of making the tree flatter, shortening the distances between the root and leaf nodes. Also, more frequently-used nodes will move more closely to the root of the tree during each splay operation. The more splay operations are performed, the more closely the tree will represent the frequency of the node accesses, and will eventually place the most frequently-used nodes close to the root of the tree. This self-organization makes splay trees well-suited for use in caches or dictionaries. Because search operations will modify the splay tree, you should always use an arbitration mechanism such as a Mutex if you share the same splay tree with several Tasks or Processes.

See Wikipedia for more generic information about splay trees.

CreateSplayTree()	Allocate a splay tree data structure.
DeleteSplayTree()	Free a splay tree and all its nodes.
FindSplayNode()	Search for a key in a splay tree.
InsertSplayNode()	Insert a new key into a splay tree.
RemoveSplayNode()	Remove a node from a splay tree.

Skip Lists

Skip lists combine linked lists with a look-ahead data structure which makes search and insertion operations efficient. You can add data in any particular order to the skip list, and the list will always take care of keeping that data stored in a specific order. The effort spent to maintain this order is small and grows slowly the more list items are added. Traversing the list is very fast and will always return the list items in sorted order. Retrieving specific list items is very efficient, too. Skip lists are useful if you need to be able to retrieve list items in a sorted order at any time while you are building the list. The drawback of skip lists is that the amount of memory required to maintain the list grows faster than the number of list items added.

See Wikipedia for more generic information about skip lists.

CreateSkipList()	Allocate a skip list data structure.
DeleteSkipList()	Free a skip list and all its nodes.
FindSkipNode()	Search for a key in a skip list.
GetFirstSkipNode()	Get a pointer to the first node of a skip list.
GetNextSkipNode()	Get a pointer to the following node in a skip list.
InsertSkipNode()	Insert a new key into a skip list.
RemoveSkipNode()	Remove a node from a skip list.

Function Reference

The tables which follow contain breif descriptions of the functions inside the utility library. See the SDK for details on each function call.

Tag Function Reference

The following are brief descriptions of the utility library functions which pertain to tags and tag lusts.

Function	Description
AllocSysObjectTags(ASOT_TAGLIST)	Allocate a TagItem array (or chain).
FreeSysObject(ASOT_TAGLIST)	Frees allocated TagItem lists.
CloneTagItems()	Copies a TagItem list.
RefreshTagItemClone()	Rejuvenates a clone from the original.
FindTagItem()	Scans TagItem list for a tag.
GetTagData()	Obtain data corresponding to tag.
NextTagItem()	Iterate TagItem lists.
TagInArray()	Check if a tag value appears in a Tag array.
FilterTagChanges()	Eliminate TagItems which specify no change.
FilterTagItems()	Remove selected items from a TagItem list.
MapTags()	Convert ti_Tag values in a list via map pairing.
PackBoolTags()	Builds a "Flag" word from a TagItem list.

Callback Hook Function Reference

The following are brief descriptions of the utility library functions which pertain to callback hooks.

Function	Description
CallHookPkt()	Call a standard callback Hook function.

International String Function Reference

The following are brief descriptions of the utility library functions which pertain to string operations using the international ASCII character set.

Function	Description
Stricmp()	Compare strings, case-insensitive.
Strnicmp()	Compare strings, case-insensitive, with specified length.
ToLower()	Convert a character to lower case.
ToUpper()	Convert a character to upper case.

Date Function Reference

The following are brief descriptions of the utility library functions which pertain to date conversion.

Function	Description
CheckDate()	Check the legality of a date.
Amiga2Date()	Calculate the date from a specified timestamp.
Date2Amiga()	Calculate the timestamp from a specified date.