2007-06-11 21:36:57 +00:00
|
|
|
#include <stasis/transactional.h>
|
2011-06-13 06:58:34 +00:00
|
|
|
#include <stasis/experimental/fifo.h>
|
2005-03-21 08:56:30 +00:00
|
|
|
|
|
|
|
|
#ifndef __LLADD_GRAPH_H
|
|
|
|
|
#define __LLADD_GRAPH_H
|
|
|
|
|
|
2005-03-24 04:43:22 +00:00
|
|
|
/*typedef struct {
|
2005-03-21 08:56:30 +00:00
|
|
|
int outPage; ///<= number of links that leave this page.
|
|
|
|
|
short inPage; ///<= number of links that stay within this page
|
|
|
|
|
/// (represented as an array of shorts after the
|
|
|
|
|
/// array of links leaving the page.)
|
|
|
|
|
short flags; ///<= information about this node. (algorithm specific...)
|
2005-03-24 04:43:22 +00:00
|
|
|
} nodeHeader_t; */
|
2005-03-21 08:56:30 +00:00
|
|
|
|
|
|
|
|
|
2005-03-24 04:43:22 +00:00
|
|
|
void naiveTraverse(int xid, recordid rid, int num);
|
|
|
|
|
void multiTraverse(int xid, recordid arrayList, lladdFifo_t * local, lladdFifo_t * global, lladdFifoPool_t * pool, int num);
|
2005-03-21 08:56:30 +00:00
|
|
|
void pushRequest(lladdConsumer_t * cons);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif
|
