UUID Handling

Classes
struct	apr_uuid_t

Macros
#define	APR_UUID_FORMATTED_LENGTH   36

Functions
	APU_DECLARE (void) apr_uuid_get(apr_uuid_t *uuid)
	Computes SipHash-2-4, producing a 64bit (APR_SIPHASH_DSIZE) hash from a message and a 128bit (APR_SIPHASH_KSIZE) secret key, into a possibly unaligned buffer (using the little endian representation as defined by the authors for interoperabilty) usable as a MAC.
	APU_DECLARE (apr_status_t) apr_uuid_parse(apr_uuid_t *uuid

Variables
const apr_uuid_t *	uuid
const char *	uuid_str

Detailed Description

Macro Definition Documentation

APR_UUID_FORMATTED_LENGTH

#define APR_UUID_FORMATTED_LENGTH   36

UUIDs are formatted as: 00112233-4455-6677-8899-AABBCCDDEEFF

Definition at line 46 of file apr_uuid.h.

Function Documentation

APU_DECLARE() [1/2]

APU_DECLARE

(

apr_status_t

)

Parse a standard-format string into a UUID

Parameters

uuid	The resulting UUID
uuid_str	The formatted UUID

< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.

< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.

< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".

< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".

< Replace

< Insert with duplicates

< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.

< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.

< mask to extract lock type

< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.

< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".

< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".

< Size of the file

< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.

< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".

Definition at line 358 of file apr_brigade.c.

APU_DECLARE() [2/2]

APU_DECLARE

(

void

)

Computes SipHash-2-4, producing a 64bit (APR_SIPHASH_DSIZE) hash from a message and a 128bit (APR_SIPHASH_KSIZE) secret key, into a possibly unaligned buffer (using the little endian representation as defined by the authors for interoperabilty) usable as a MAC.

Generate and return a (new) UUID

Parameters

uuid	The resulting UUID

Format a UUID into a string, following the standard format

Parameters

buffer	The buffer to place the formatted UUID string into. It must be at least APR_UUID_FORMATTED_LENGTH + 1 bytes long to hold the formatted UUID and a null terminator
uuid	The UUID to format

< use pool pre cleanup

Definition at line 128 of file apr_sha1.c.

Variable Documentation

uuid

const apr_uuid_t* uuid

Definition at line 62 of file apr_uuid.h.

uuid_str

const char* uuid_str

Definition at line 69 of file apr_uuid.h.