Messed with documentation to try to make doxygen happy and more likely to see this file.
This commit is contained in:
parent
f15d7dbdf1
commit
a3885944a0
9 changed files with 24 additions and 5 deletions
|
@ -7,6 +7,9 @@
|
|||
#define stasis_handle(x) stasis_handle_##x
|
||||
|
||||
/**
|
||||
|
||||
@file
|
||||
|
||||
Error handling:
|
||||
|
||||
read, write, append, open, release_read_buffer and
|
||||
|
|
|
@ -1,3 +1,5 @@
|
|||
|
||||
/** @file */
|
||||
typedef struct range {
|
||||
long start;
|
||||
long stop;
|
||||
|
@ -46,4 +48,3 @@ static inline long rangeTrackerRoundDown(long x, long quant) {
|
|||
static inline long rangeTrackerRoundUp(long x, long quant) {
|
||||
return (((x-1) / quant) + 1) * quant;
|
||||
}
|
||||
|
||||
|
|
|
@ -25,7 +25,7 @@ void lladdFifoPool_markDirty(int xid, lladdFifoPool_t * pool, lladdFifo_t * fifo
|
|||
/**
|
||||
Create a new pool of ringBuffer based fifos
|
||||
|
||||
@param consumerCount the number of consumers in the pool.
|
||||
consumerCount is the number of consumers in the pool.
|
||||
@todo this function should be generalized to other consumer implementations.
|
||||
*/
|
||||
lladdFifoPool_t * lladdFifoPool_ringBufferInit (int consumerCount, int bufferSize,
|
||||
|
|
|
@ -1,6 +1,11 @@
|
|||
#include <stdio.h>
|
||||
#include "io.h"
|
||||
#include <stdlib.h>
|
||||
/** @file
|
||||
|
||||
This file contains old-ish utility methods that wrap fseek, read, etc...
|
||||
|
||||
*/
|
||||
long myFseek(FILE * f, long offset, int whence) {
|
||||
long ret;
|
||||
flockfile(f);
|
||||
|
|
|
@ -2,6 +2,13 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
/** @file
|
||||
|
||||
This implements a io handle that wraps another handle, logging each
|
||||
call (and its result) to stdout.
|
||||
|
||||
*/
|
||||
|
||||
typedef struct debug_impl {
|
||||
stasis_handle_t * h;
|
||||
} debug_impl;
|
||||
|
|
|
@ -13,6 +13,7 @@
|
|||
#include <sys/stat.h>
|
||||
#include <fcntl.h>
|
||||
|
||||
/** @file */
|
||||
|
||||
typedef struct file_impl {
|
||||
pthread_mutex_t mut;
|
||||
|
|
|
@ -3,7 +3,7 @@
|
|||
#include <string.h>
|
||||
#include <pthread.h>
|
||||
#include <errno.h>
|
||||
|
||||
/** @file */
|
||||
|
||||
typedef struct mem_impl {
|
||||
pthread_mutex_t mut;
|
||||
|
|
|
@ -6,7 +6,9 @@
|
|||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
#include <linkedlist.h>
|
||||
/*
|
||||
/**
|
||||
|
||||
@file
|
||||
|
||||
Design:
|
||||
|
||||
|
|
|
@ -32,7 +32,7 @@ void freePage(Page * freepage, long freepage_id, Page * headerpage) {
|
|||
}
|
||||
|
||||
/**
|
||||
@param freepage Must be the head of the freepage list (right now,
|
||||
freepage Must be the head of the freepage list (right now,
|
||||
the free list is essentially treated like a stack.
|
||||
*/
|
||||
void unfreePage(Page * freepage, Page * headerpage) {
|
||||
|
|
Loading…
Reference in a new issue