typedef struct Payload Payload;
+/**
+ * @brief Hash Payload storage Structure; filled in linear.
+ */
struct Payload {
- /**
- * \brief Hash Payload storage Structure; filled in linear.
- */
void *Data; /**< the Data belonging to this storage */
DeleteHashDataFunc Destructor; /**< if we want to destroy Data, do it with this function. */
};
+
+/**
+ * @brief Hash key element; sorted by key
+ */
struct HashKey {
- /**
- * \brief Hash key element; sorted by key
- */
long Key; /**< Numeric Hashkey comperator for hash sorting */
long Position; /**< Pointer to a Payload struct in the Payload Aray */
char *HashKey; /**< the Plaintext Hashkey */
Payload *PL; /**< pointer to our payload for sorting */
};
+/**
+ * @brief Hash structure; holds arrays of Hashkey and Payload.
+ */
struct HashList {
- /**
- * \brief Hash structure; holds arrays of Hashkey and Payload.
- */
Payload **Members; /**< Our Payload members. This fills up linear */
HashKey **LookupTable; /**< Hash Lookup table. Elements point to members, and are sorted by their hashvalue */
char **MyKeys; /**< this keeps the members for a call of GetHashKeys */
long uniq; /**< are the keys going to be uniq? */
};
+/**
+ * @brief Anonymous Hash Iterator Object. used for traversing the whole array from outside
+ */
struct HashPos {
- /**
- * \brief Anonymous Hash Iterator Object. used for traversing the whole array from outside
- */
- long Position;
- int StepWidth;
+ long Position; /**< Position inside of the hash */
+ int StepWidth; /**< small? big? forward? backward? */
};
/**
- * \brief Iterate over the hash and call PrintEntry.
- * \param Hash your Hashlist structure
- * \param Trans is called so you could for example print 'A:' if the next entries are like that.
+ * @brief Iterate over the hash and call PrintEntry.
+ * @param Hash your Hashlist structure
+ * @param Trans is called so you could for example print 'A:' if the next entries are like that.
* Must be aware to receive NULL in both pointers.
- * \param PrintEntry print entry one by one
+ * @param PrintEntry print entry one by one
* \returns the number of items printed
*/
int PrintHash(HashList *Hash, TransitionFunc Trans, PrintHashDataFunc PrintEntry)
/**
- * \brief verify the contents of a hash list; here for debugging purposes.
- * \param Hash your Hashlist structure
- * \param First Functionpointer to allow you to print your payload
- * \param Second Functionpointer to allow you to print your payload
+ * @brief verify the contents of a hash list; here for debugging purposes.
+ * @param Hash your Hashlist structure
+ * @param First Functionpointer to allow you to print your payload
+ * @param Second Functionpointer to allow you to print your payload
* \returns 0
*/
int dbg_PrintHash(HashList *Hash, PrintHashContent First, PrintHashContent Second)
/**
- * \brief instanciate a new hashlist
+ * @brief instanciate a new hashlist
* \returns the newly allocated list.
*/
HashList *NewHash(int Uniq, HashFunc F)
/**
- * \brief private destructor for one hash element.
+ * @brief private destructor for one hash element.
* Crashing? go one frame up and do 'print *FreeMe->LookupTable[i]'
- * \param Data an element to free using the user provided destructor, or just plain free
+ * @param Data an element to free using the user provided destructor, or just plain free
*/
static void DeleteHashPayload (Payload *Data)
{
}
/**
- * \brief Destructor for nested hashes
+ * @brief Destructor for nested hashes
*/
void HDeleteHash(void *vHash)
{
}
/**
- * \brief destroy a hashlist and all of its members
+ * @brief destroy a hashlist and all of its members
* Crashing? do 'print *FreeMe->LookupTable[i]'
- * \param Hash Hash to destroy. Is NULL'ed so you are shure its done.
+ * @param Hash Hash to destroy. Is NULL'ed so you are shure its done.
*/
void DeleteHash(HashList **Hash)
{
}
/**
- * \brief Private function to increase the hash size.
- * \param Hash the Hasharray to increase
+ * @brief Private function to increase the hash size.
+ * @param Hash the Hasharray to increase
*/
static void IncreaseHashSize(HashList *Hash)
{
/**
- * \brief private function to add a new item to / replace an existing in - the hashlist
+ * @brief private function to add a new item to / replace an existing in - the hashlist
* if the hash list is full, its re-alloced with double size.
* \parame Hash our hashlist to manipulate
- * \param HashPos where should we insert / replace?
- * \param HashKeyStr the Hash-String
- * \param HKLen length of HashKeyStr
- * \param Data your Payload to add
- * \param Destructor Functionpointer to free Data. if NULL, default free() is used.
+ * @param HashPos where should we insert / replace?
+ * @param HashKeyStr the Hash-String
+ * @param HKLen length of HashKeyStr
+ * @param Data your Payload to add
+ * @param Destructor Functionpointer to free Data. if NULL, default free() is used.
*/
static void InsertHashItem(HashList *Hash,
long HashPos,
}
/**
- * \brief if the user has tainted the hash, but wants to insert / search items by their key
+ * @brief if the user has tainted the hash, but wants to insert / search items by their key
* we need to search linear through the array. You have been warned that this will take more time!
- * \param Hash Our Hash to manipulate
- * \param HashBinKey the Hash-Number to lookup.
+ * @param Hash Our Hash to manipulate
+ * @param HashBinKey the Hash-Number to lookup.
* \returns the position (most closely) matching HashBinKey (-> Caller needs to compare! )
*/
static long FindInTaintedHash(HashList *Hash, long HashBinKey)
}
/**
- * \brief Private function to lookup the Item / the closest position to put it in
- * \param Hash Our Hash to manipulate
- * \param HashBinKey the Hash-Number to lookup.
+ * @brief Private function to lookup the Item / the closest position to put it in
+ * @param Hash Our Hash to manipulate
+ * @param HashBinKey the Hash-Number to lookup.
* \returns the position (most closely) matching HashBinKey (-> Caller needs to compare! )
*/
static long FindInHash(HashList *Hash, long HashBinKey)
/**
- * \brief another hashing algorithm; treat it as just a pointer to long.
- * \param str Our pointer to the long value
- * \param len the length of the data pointed to; needs to be sizeof int, else we won't use it!
+ * @brief another hashing algorithm; treat it as just a pointer to long.
+ * @param str Our pointer to the long value
+ * @param len the length of the data pointed to; needs to be sizeof int, else we won't use it!
* \returns the calculated hash value
*/
int Flathash(const char *str, long len)
}
/**
- * \brief private abstract wrapper around the hashing algorithm
- * \param HKey the hash string
- * \param HKLen length of HKey
+ * @brief private abstract wrapper around the hashing algorithm
+ * @param HKey the hash string
+ * @param HKLen length of HKey
* \returns the calculated hash value
*/
inline static long CalcHashKey (HashList *Hash, const char *HKey, long HKLen)
/**
- * \brief Add a new / Replace an existing item in the Hash
- * \param HashList the list to manipulate
- * \param HKey the hash-string to store Data under
- * \param HKeyLen Length of HKey
- * \param Data the payload you want to associate with HKey
- * \param DeleteIt if not free() should be used to delete Data set to NULL, else DeleteIt is used.
+ * @brief Add a new / Replace an existing item in the Hash
+ * @param HashList the list to manipulate
+ * @param HKey the hash-string to store Data under
+ * @param HKeyLen Length of HKey
+ * @param Data the payload you want to associate with HKey
+ * @param DeleteIt if not free() should be used to delete Data set to NULL, else DeleteIt is used.
*/
void Put(HashList *Hash, const char *HKey, long HKLen, void *Data, DeleteHashDataFunc DeleteIt)
{
}
/**
- * \brief Lookup the Data associated with HKey
- * \param Hash the Hashlist to search in
- * \param HKey the hashkey to look up
- * \param HKLen length of HKey
- * \param Data returns the Data associated with HKey
+ * @brief Lookup the Data associated with HKey
+ * @param Hash the Hashlist to search in
+ * @param HKey the hashkey to look up
+ * @param HKLen length of HKey
+ * @param Data returns the Data associated with HKey
* \returns 0 if not found, 1 if.
*/
int GetHash(HashList *Hash, const char *HKey, long HKLen, void **Data)
}
/**
- * \brief get the Keys present in this hash, simila to array_keys() in PHP
+ * @brief get the Keys present in this hash, simila to array_keys() in PHP
* Attention: List remains to Hash! don't modify or free it!
- * \param Hash Your Hashlist to extract the keys from
- * \param List returns the list of hashkeys stored in Hash
+ * @param Hash Your Hashlist to extract the keys from
+ * @param List returns the list of hashkeys stored in Hash
*/
int GetHashKeys(HashList *Hash, char ***List)
{
}
/**
- * \brief creates a hash-linear iterator object
- * \param Hash the list we reference
- * \param in which step width should we iterate?
+ * @brief creates a hash-linear iterator object
+ * @param Hash the list we reference
+ * @param in which step width should we iterate?
* If negative, the last position matching the
* step-raster is provided.
* \returns the hash iterator
}
/**
- * \brief retrieve the counter from the itteratoor
- * \param the Iterator to analyze
+ * @brief retrieve the counter from the itteratoor
+ * @param the Iterator to analyze
* \returns the n'th hashposition we point at
*/
int GetHashPosCounter(HashList *Hash, HashPos *At)
}
/**
- * \brief frees a linear hash iterator
+ * @brief frees a linear hash iterator
*/
void DeleteHashPos(HashPos **DelMe)
{
/**
- * \brief Get the data located where HashPos Iterator points at, and Move HashPos one forward
- * \param Hash your Hashlist to follow
- * \param HKLen returns Length of Hashkey Returned
- * \param HashKey returns the Hashkey corrosponding to HashPos
- * \param Data returns the Data found at HashPos
+ * @brief Get the data located where HashPos Iterator points at, and Move HashPos one forward
+ * @param Hash your Hashlist to follow
+ * @param HKLen returns Length of Hashkey Returned
+ * @param HashKey returns the Hashkey corrosponding to HashPos
+ * @param Data returns the Data found at HashPos
* \returns whether the item was found or not.
*/
int GetNextHashPos(HashList *Hash, HashPos *At, long *HKLen, const char **HashKey, void **Data)
}
/**
- * \brief Get the data located where At points to
+ * @brief Get the data located where At points to
* note: you should prefer iterator operations instead of using me.
- * \param Hash your Hashlist peek from
- * \param HKLen returns Length of Hashkey Returned
- * \param HashKey returns the Hashkey corrosponding to HashPos
- * \param Data returns the Data found at HashPos
+ * @param Hash your Hashlist peek from
+ * @param HKLen returns Length of Hashkey Returned
+ * @param HashKey returns the Hashkey corrosponding to HashPos
+ * @param Data returns the Data found at HashPos
* \returns whether the item was found or not.
*/
int GetHashAt(HashList *Hash,long At, long *HKLen, const char **HashKey, void **Data)
}
/**
- * \brief sorting function for sorting the Hash alphabeticaly by their strings
- * \param Key1 first item
- * \param Key2 second item
+ * @brief sorting function for sorting the Hash alphabeticaly by their strings
+ * @param Key1 first item
+ * @param Key2 second item
*/
static int SortByKeys(const void *Key1, const void* Key2)
{
}
/**
- * \brief sorting function for sorting the Hash alphabeticaly reverse by their strings
- * \param Key1 first item
- * \param Key2 second item
+ * @brief sorting function for sorting the Hash alphabeticaly reverse by their strings
+ * @param Key1 first item
+ * @param Key2 second item
*/
static int SortByKeysRev(const void *Key1, const void* Key2)
{
}
/**
- * \brief sorting function to regain hash-sequence and revert tainted status
- * \param Key1 first item
- * \param Key2 second item
+ * @brief sorting function to regain hash-sequence and revert tainted status
+ * @param Key1 first item
+ * @param Key2 second item
*/
static int SortByHashKeys(const void *Key1, const void* Key2)
{
/**
- * \brief sort the hash alphabeticaly by their keys.
+ * @brief sort the hash alphabeticaly by their keys.
* Caution: This taints the hashlist, so accessing it later
* will be significantly slower! You can un-taint it by SortByHashKeyStr
- * \param Hash the list to sort
- * \param Order 0/1 Forward/Backward
+ * @param Hash the list to sort
+ * @param Order 0/1 Forward/Backward
*/
void SortByHashKey(HashList *Hash, int Order)
{
}
/**
- * \brief sort the hash by their keys (so it regains untainted state).
+ * @brief sort the hash by their keys (so it regains untainted state).
* this will result in the sequence the hashing allgorithm produces it by default.
- * \param Hash the list to sort
+ * @param Hash the list to sort
*/
void SortByHashKeyStr(HashList *Hash)
{
/**
- * \brief gives user sort routines access to the hash payload
- * \param Searchentry to retrieve Data to
+ * @brief gives user sort routines access to the hash payload
+ * @param Searchentry to retrieve Data to
* \returns Data belonging to HashVoid
*/
const void *GetSearchPayload(const void *HashVoid)
}
/**
- * \brief sort the hash by your sort function. see the following sample.
+ * @brief sort the hash by your sort function. see the following sample.
* this will result in the sequence the hashing allgorithm produces it by default.
- * \param Hash the list to sort
- * \param SortBy Sortfunction; see below how to implement this
+ * @param Hash the list to sort
+ * @param SortBy Sortfunction; see below how to implement this
*/
void SortByPayload(HashList *Hash, CompareFunc SortBy)
{
/**
* @defgroup StrBuf Stringbuffer, A class for manipulating strings with dynamic buffers
+ * StrBuf is a versatile class, aiding the handling of dynamic strings
+ * * reduce de/reallocations
+ * * reduce the need to remeasure it
+ * * reduce scanning over the string (in @ref StrBuf_NextTokenizer "Tokenizers")
+ * * allow asyncroneous IO for line and Blob based operations
+ * * reduce the use of memove in those
+ * * Quick filling in several operations with append functions
+ */
+
+/**
+ * @defgroup StrBuf_DeConstructors Create/Destroy StrBufs
+ * @ingroup StrBuf
+ */
+
+/**
+ * @defgroup StrBuf_Cast Cast operators to interact with char* based code
+ * @ingroup StrBuf
+ * use these operators to interfere with code demanding char*;
+ * if you need to own the content, smash me. Avoid, since we loose the length information.
+ */
+
+/**
+ * @defgroup StrBuf_Filler Create/Replace/Append Content into a StrBuf
+ * @ingroup StrBuf
+ * operations to get your Strings into a StrBuf, manipulating them, or appending
+ */
+/**
+ * @defgroup StrBuf_NextTokenizer Fast tokenizer to pull tokens in sequence
+ * @ingroup StrBuf
+ * Quick tokenizer; demands of the user to pull its tokens in sequence
+ */
+
+/**
+ * @defgroup StrBuf_Tokenizer tokenizer Functions; Slow ones.
+ * @ingroup StrBuf
+ * versatile tokenizer; random access to tokens, but slower; Prefer the @ref StrBuf_NextTokenizer "Next Tokenizer"
+ */
+
+/**
+ * @defgroup StrBuf_BufferedIO Buffered IO with Asynchroneous reads and no unneeded memmoves (the fast ones)
+ * @ingroup StrBuf
+ * File IO to fill StrBufs; Works with work-buffer shared across several calls;
+ * External Cursor to maintain the current read position inside of the buffer
+ * the non-fast ones will use memove to keep the start of the buffer the read buffer (which is slower)
+ */
+
+/**
+ * @defgroup StrBuf_IO FileIO; Prefer @ref StrBuf_BufferedIO
+ * @ingroup StrBuf
+ * Slow I/O; avoid.
+ */
+
+/**
+ * @defgroup StrBuf_DeEnCoder functions to translate the contents of a buffer
+ * @ingroup StrBuf
+ * these functions translate the content of a buffer into another representation;
+ * some are combined Fillers and encoders
*/
/**
long BufUsed; /**< StNumber of Chars used excluding the trailing \\0 */
int ConstBuf; /**< are we just a wrapper arround a static buffer and musn't we be changed? */
#ifdef SIZE_DEBUG
- long nIncreases;
- char bt [SIZ];
- char bt_lastinc [SIZ];
+ long nIncreases; /**< for profiling; cound how many times we needed more */
+ char bt [SIZ]; /**< Stacktrace of last increase */
+ char bt_lastinc [SIZ]; /**< How much did we increase last time? */
#endif
};
#endif
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_Cast
* @brief Cast operator to Plain String
* @note if the buffer is altered by StrBuf operations, this pointer may become
* invalid. So don't lean on it after altering the buffer!
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_Cast
* @brief since we know strlen()'s result, provide it here.
* @param Str the string to return the length to
* @returns contentlength of the buffer
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief local utility function to resize the buffer
* @param Buf the buffer whichs storage we should increase
* @param KeepOriginal should we copy the original buffer or just start over with a new one
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief shrink an _EMPTY_ buffer if its Buffer superseeds threshhold to NewSize. Buffercontent is thoroughly ignored and flushed.
* @param Buf Buffer to shrink (has to be empty)
* @param ThreshHold if the buffer is bigger then this, its readjusted
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief shrink long term buffers to their real size so they don't waste memory
* @param Buf buffer to shrink
* @param Force if not set, will just executed if the buffer is much to big; set for lifetime strings
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief Allocate a new buffer with default buffer size
* @returns the new stringbuffer
*/
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief Copy Constructor; returns a duplicate of CopyMe
* @param CopyMe Buffer to faxmilate
* @returns the new stringbuffer
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief create a new Buffer using an existing c-string
* this function should also be used if you want to pre-suggest
* the buffer size to allocate in conjunction with ptr == NULL
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief Set an existing buffer from a c-string
+ * @param Buf buffer to load
* @param ptr c-string to put into
* @param nChars set to -1 if we should work 0-terminated
* @returns the new length of the string
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief use strbuf as wrapper for a string constant for easy handling
* @param StringConstant a string to wrap
* @param SizeOfStrConstant should be sizeof(StringConstant)-1
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief flush the content of a Buf; keep its struct
* @param buf Buffer to flush
*/
}
/**
+ * @ingroup StrBuf_DeConstructors
* @brief wipe the content of a Buf thoroughly (overwrite it -> expensive); keep its struct
* @param buf Buffer to wipe
*/
int hFreeDbglog = -1;
#endif
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief Release a Buffer
* Its a double pointer, so it can NULL your pointer
* so fancy SIG11 appear instead of random results
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief flatten a Buffer to the Char * we return
* Its a double pointer, so it can NULL your pointer
* so fancy SIG11 appear instead of random results
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeConstructors
* @brief Release the buffer
* If you want put your StrBuf into a Hash, use this as Destructor.
* @param VFreeMe untyped pointer to a StrBuf. be shure to do the right thing [TM]
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeEnCoder
* @brief Escape a string for feeding out as a URL while appending it to a Buffer
- * @param outbuf the output buffer
- * @param oblen the size of outbuf to sanitize
- * @param strbuf the input buffer
+ * @param OutBuf the output buffer
+ * @param In Buffer to encode
+ * @param PlainIn way in from plain old c strings
*/
void StrBufUrlescAppend(StrBuf *OutBuf, const StrBuf *In, const char *PlainIn)
{
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeEnCoder
* @brief Append a string, escaping characters which have meaning in HTML.
*
* @param Target target buffer
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeEnCoder
* @brief Append a string, escaping characters which have meaning in HTML.
* Converts linebreaks into blanks; escapes single quotes
* @param Target target buffer
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeEnCoder
* @brief Append a string, escaping characters which have meaning in ICAL.
* [\n,]
* @param Target target buffer
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeEnCoder
* @brief Append a string, escaping characters which have meaning in JavaScript strings .
*
* @param Target target buffer
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_DeEnCoder
* @brief Append a string, escaping characters which have meaning in HTML + json.
*
* @param Target target buffer
* @ingroup StrBuf
* @brief sprintf like function appending the formated string to the buffer
* vsnprintf version to wrap into own calls
- * @param Buf Buffer to extend by format and @params
+ * @param Buf Buffer to extend by format and Params
* @param format printf alike format to add
* @param ap va_list containing the items for format
*/
* @brief sprintf like function putting the formated string into the buffer
* @param Buf Buffer to extend by format and Parameters
* @param format printf alike format to add
- * @param ap va_list containing the items for format
*/
void StrBufPrintf(StrBuf *Buf, const char *format, ...)
{
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_Tokenizer
* @brief Counts the numbmer of tokens in a buffer
* @param source String to count tokens in
* @param tok Tokenizer char to count
* remove_token() - a tokenizer that kills, maims, and destroys
*/
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_Tokenizer
* @brief a string tokenizer
* @param Source StringBuffer to read into
- * @param parmnum n'th @parameter to remove
- * @param separator tokenizer @param
+ * @param parmnum n'th Parameter to remove
+ * @param separator tokenizer character
* @returns -1 if not found, else length of token.
*/
int StrBufRemove_token(StrBuf *Source, int parmnum, char separator)
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_Tokenizer
* @brief a string tokenizer
* @param dest Destination StringBuffer
* @param Source StringBuffer to read into
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_Tokenizer
* @brief a string tokenizer to fetch an integer
* @param Source String containing tokens
* @param parmnum n'th Parameter to extract
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_Tokenizer
* @brief a string tokenizer to fetch a long integer
* @param Source String containing tokens
* @param parmnum n'th Parameter to extract
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_Tokenizer
* @brief a string tokenizer to fetch an unsigned long
* @param Source String containing tokens
* @param parmnum n'th Parameter to extract
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_NextTokenizer
* @brief a string tokenizer; Bounds checker
* function to make shure whether StrBufExtract_NextToken and friends have reached the end of the string.
* @param Source our tokenbuffer
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_NextTokenizer
* @brief a string tokenizer
* @param dest Destination StringBuffer
* @param Source StringBuffer to read into
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_NextTokenizer
* @brief a string tokenizer
- * @param dest Destination StringBuffer
* @param Source StringBuffer to read from
* @param pStart pointer to the end of the last token. Feed with NULL.
- * @param separator tokenizer @param
+ * @param separator tokenizer character
+ * @param nTokens number of tokens to fastforward over
* @returns -1 if not found, else length of token.
*/
int StrBufSkip_NTokenS(const StrBuf *Source, const char **pStart, char separator, int nTokens)
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_NextTokenizer
* @brief a string tokenizer to fetch an integer
* @param Source StringBuffer to read from
* @param pStart Cursor on the tokenstring
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_NextTokenizer
* @brief a string tokenizer to fetch a long integer
* @param Source StringBuffer to read from
* @param pStart Cursor on the tokenstring
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_NextTokenizer
* @brief a string tokenizer to fetch an unsigned long
* @param Source StringBuffer to read from
* @param pStart Cursor on the tokenstring
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_IO
* @brief Read a line from socket
* flushes and closes the FD on error
* @param buf the buffer to get the input to
}
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_BufferedIO
* @brief Read a line from socket
* flushes and closes the FD on error
+ * @param Line the line to read from the fd / I/O Buffer
* @param buf the buffer to get the input to
* @param fd pointer to the filedescriptor to read
- * @param append Append to an existing string or replace?
+ * @param timeout number of successless selects until we bail out
+ * @param selectresolution how long to wait on each select
* @param Error strerror() on error
* @returns numbers of chars read
*/
static const char *ErrRBLF_SelectFailed="StrBufTCP_read_buffered_line_fast: Select failed without reason";
static const char *ErrRBLF_NotEnoughSentFromServer="StrBufTCP_read_buffered_line_fast: No complete line was sent from peer";
/**
- * @ingroup StrBuf
+ * @ingroup StrBuf_BufferedIO
* @brief Read a line from socket
* flushes and closes the FD on error
- * @param buf the buffer to get the input to
+ * @param Line Line to read from the fd / I/O Buffer
+ * @param IOBuf the buffer to get the input to
* @param Pos pointer to the current read position, should be NULL initialized!
* @param fd pointer to the filedescriptor to read
- * @param append Append to an existing string or replace?
+ * @param timeout number of successless selects until we bail out
+ * @param selectresolution how long to wait on each select
* @param Error strerror() on error
* @returns numbers of chars read
*/
}
/**
+ * @ingroup StrBuf_IO
* @brief Input binary data from socket
* flushes and closes the FD on error
- * @param buf the buffer to get the input to
+ * @param Buf the buffer to get the input to
* @param fd pointer to the filedescriptor to read
* @param append Append to an existing string or replace?
* @param nBytes the maximal number of bytes to read
const char *ErrRBB_too_many_selects = "StrBufReadBLOBBuffered: to many selects; aborting.";
/**
+ * @ingroup StrBuf_BufferedIO
* @brief Input binary data from socket
* flushes and closes the FD on error
- * @param buf the buffer to get the input to
+ * @param Blob put binary thing here
+ * @param IOBuf the buffer to get the input to
+ * @param Pos offset inside of IOBuf
* @param fd pointer to the filedescriptor to read
* @param append Append to an existing string or replace?
* @param nBytes the maximal number of bytes to read
+ * @param check whether we should search for '000\n' terminators in case of timeouts
* @param Error strerror() on error
* @returns numbers of chars read
*/
}
/**
+ * @ingroup StrBuf
* @brief Cut nChars from the start of the string
* @param Buf Buffer to modify
* @param nChars how many chars should be skipped?
}
/**
+ * @ingroup StrBuf
* @brief Cut the trailing n Chars from the string
* @param Buf Buffer to modify
* @param nChars how many chars should be trunkated?
}
/**
+ * @ingroup StrBuf
* @brief Cut the string after n Chars
* @param Buf Buffer to modify
* @param AfternChars after how many chars should we trunkate the string?
/**
+ * @ingroup StrBuf
* @brief Strip leading and trailing spaces from a string; with premeasured and adjusted length.
- * @param buf the string to modify
- * @param len length of the string.
+ * @param Buf the string to modify
*/
void StrBufTrim(StrBuf *Buf)
{
}
/**
+ * @ingroup StrBuf
* @brief uppercase the contents of a buffer
* @param Buf the buffer to translate
*/
/**
+ * @ingroup StrBuf
* @brief lowercase the contents of a buffer
* @param Buf the buffer to translate
*/
}
/**
+ * @ingroup StrBuf
* @brief removes double slashes from pathnames
* @param Dir directory string to filter
* @param RemoveTrailingSlash allows / disallows trailing slashes
}
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief unhide special chars hidden to the HTML escaper
* @param target buffer to put the unescaped string in
* @param source buffer to unescape
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief hide special chars from the HTML escapers and friends
* @param target buffer to put the escaped string in
* @param source buffer to escape
target->buf[target->BufUsed + 1] = '\0';
}
-/**
- * @brief uses the same calling syntax as compress2(), but it
- * creates a stream compatible with HTTP "Content-encoding: gzip"
- */
#ifdef HAVE_ZLIB
#define DEF_MEM_LEVEL 8 /*< memlevel??? */
#define OS_CODE 0x03 /*< unix */
-int ZEXPORT compress_gzip(Bytef * dest, /*< compressed buffer*/
- size_t * destLen, /*< length of the compresed data */
- const Bytef * source, /*< source to encode */
- uLong sourceLen, /*< length of source to encode */
- int level) /*< compression level */
+
+/**
+ * @ingroup StrBuf_DeEnCoder
+ * @brief uses the same calling syntax as compress2(), but it
+ * creates a stream compatible with HTTP "Content-encoding: gzip"
+ * @param dest compressed buffer
+ * @param destLen length of the compresed data
+ * @param source source to encode
+ * @param sourceLen length of source to encode
+ * @param level compression level
+ */
+int ZEXPORT compress_gzip(Bytef * dest,
+ size_t * destLen,
+ const Bytef * source,
+ uLong sourceLen,
+ int level)
{
const int gz_magic[2] = { 0x1f, 0x8b }; /* gzip magic header */
/**
+ * @ingroup StrBuf_DeEnCoder
+ * @brief compress the buffer with gzip
* Attention! If you feed this a Const String, you must maintain the uncompressed buffer yourself!
+ * @param Buf buffer whose content is to be gzipped
*/
int CompressBuffer(StrBuf *Buf)
{
}
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief decode a buffer from base 64 encoding; destroys original
* @param Buf Buffor to transform
*/
}
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief decode a buffer from base 64 encoding; destroys original
* @param Buf Buffor to transform
*/
}
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief replace all chars >0x20 && < 0x7F with Mute
* @param Mute char to put over invalid chars
* @param Buf Buffor to transform
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief remove escaped strings from i.e. the url string (like %20 for blanks)
* @param Buf Buffer to translate
* @param StripBlanks Reduce several blanks to one?
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief RFC2047-encode a header field if necessary.
* If no non-ASCII characters are found, the string
* will be copied verbatim without encoding.
}
/**
+ * @ingroup StrBuf
* @brief replaces all occurances of 'search' by 'replace'
* @param buf Buffer to modify
* @param search character to search
- * @param relpace character to replace search by
+ * @param replace character to replace search by
*/
void StrBufReplaceChars(StrBuf *buf, char search, char replace)
{
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief Wrapper around iconv_open()
* Our version adds aliases for non-standard Microsoft charsets
* such as 'MS950', aliasing them to names like 'CP950'
*
* @param tocode Target encoding
* @param fromcode Source encoding
+ * @param pic anonimized pointer to iconv struct
*/
void ctdl_iconv_open(const char *tocode, const char *fromcode, void *pic)
{
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief find one chunk of a RFC822 encoded string
* @param Buffer where to search
* @param bptr where to start searching
}
/**
+ * @ingroup StrBuf
* @brief swaps the contents of two StrBufs
* this is to be used to have cheap switched between a work-buffer and a target buffer
* @param A First one
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief convert one buffer according to the preselected iconv pointer PIC
* @param ConvertBuf buffer we need to translate
* @param TmpBuf To share a workbuffer over several iterations. prepare to have it filled with useless stuff afterwards.
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief catches one RFC822 encoded segment, and decodes it.
* @param Target buffer to fill with result
* @param DecodeMe buffer with stuff to process
}
/**
+ * @ingroup StrBuf_DeEnCoder
* @brief Handle subjects with RFC2047 encoding such as:
* =?koi8-r?B?78bP0s3Mxc7JxSDXz9rE1dvO2c3JINvB0sHNySDP?=
* @param Target where to put the decoded string to
}
/**
+ * @ingroup StrBuf
* @brief evaluate the length of an utf8 special character sequence
* @param Char the character to examine
* @returns width of utf8 chars in bytes
}
/**
+ * @ingroup StrBuf
* @brief detect whether this char starts an utf-8 encoded char
* @param Char character to inspect
* @returns yes or no
}
/**
+ * @ingroup StrBuf
* @brief measure the number of glyphs in an UTF8 string...
- * @param str string to measure
- * @returns the length of str
+ * @param Buf string to measure
+ * @returns the number of glyphs in Buf
*/
long StrBuf_Utf8StrLen(StrBuf *Buf)
{
}
/**
+ * @ingroup StrBuf
* @brief cuts a string after maxlen glyphs
- * @param str string to cut to maxlen glyphs
+ * @param Buf string to cut to maxlen glyphs
* @param maxlen how long may the string become?
- * @returns pointer to maxlen or the end of the string
+ * @returns current length of the string
*/
long StrBuf_Utf8StrCut(StrBuf *Buf, int maxlen)
{
/**
+ * @ingroup StrBuf
* @brief extract a "next line" from Buf; Ptr to persist across several iterations
* @param LineBuf your line will be copied here.
* @param Buf BLOB with lines of text...
projects / citadel.git / commitdiff