The Netsukuku Project  0.0.9
An Alternative routing method
 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Macros
qspn-empiric.c File Reference
#include "includes.h"
#include "common.h"
#include "inet.h"
#include "endianness.h"
#include "qspn-empiric.h"
Include dependency graph for qspn-empiric.c:

Functions

int pos_from_node (map_node *node, map_node *map)
 
map_nodeinit_map (size_t len)
 
void free_map (map_node *map, size_t count)
 
map_rnodernode_insert (map_rnode *buf, size_t pos, map_rnode *new)
 
map_rnodemap_rnode_insert (map_node *node, size_t pos, map_rnode *new)
 
map_rnodernode_add (map_node *node, map_rnode *new)
 
int rnode_rtt_compar (const void *a, const void *b)
 
void rnode_rtt_order (map_node *node)
 
int mod_rnode_addr (map_rnode *rnode, int *map_start, int *new_start)
 
int get_rnode_block (int *map, map_node *node, map_rnode *rblock, int rstart)
 
map_rnodemap_get_rblock (map_node *map, int *addr_map, int maxgroupnode, int *count)
 
int store_rnode_block (int *map, map_node *node, map_rnode *rblock, int rstart)
 
int map_store_rblock (map_node *map, int *addr_map, int maxgroupnode, map_rnode *rblock)
 
int verify_int_map_hdr (struct int_map_hdr *imap_hdr, int maxgroupnode, int maxrnodeblock)
 
void pack_map_node (map_node *node, char *pack)
 
void unpack_map_node (map_node *node, char *pack)
 
char * pack_map (map_node *map, int *addr_map, int maxgroupnode, map_node *root_node, size_t *pack_sz)
 
map_nodeunpack_map (char *pack, int *addr_map, map_node **new_root, int maxgroupnode, int maxrnodeblock)
 
int save_map (map_node *map, map_node *root_node, char *file)
 
map_nodeload_map (char *file, map_node **new_root)
 
void thread_joint (int joint, void *(*start_routine)(void *), void *nopt)
 
void wait_threads (void)
 
void gen_rnd_map (int start_node, int back_link, int back_link_rtt)
 
void init_q_queue (map_node *map)
 
void free_q_queue (map_node *map)
 
int store_tracer_pkt (struct q_opt *qopt)
 
void * send_qspn_backpro (void *argv)
 
void * send_qspn_reply (void *argv)
 
void * send_qspn_open (void *argv)
 
void * send_qspn_pkt (void *argv)
 
void collect_data (void)
 
void * show_temp_stat (void *null)
 
int print_map (map_node *map, char *map_file)
 
int lgl_print_map (map_node *map, char *lgl_mapfile)
 
void print_data (char *file)
 
void clear_all (void)
 
int main (int argc, char **argv)
 

Function Documentation

void clear_all ( void  )

Here is the caller graph for this function:

void collect_data ( void  )

Here is the caller graph for this function:

void free_map ( map_node map,
size_t  count 
)

Here is the caller graph for this function:

void free_q_queue ( map_node map)

Here is the caller graph for this function:

void gen_rnd_map ( int  start_node,
int  back_link,
int  back_link_rtt 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int get_rnode_block ( int *  map,
map_node node,
map_rnode rblock,
int  rstart 
)

Here is the call graph for this function:

Here is the caller graph for this function:

map_node* init_map ( size_t  len)

Here is the call graph for this function:

Here is the caller graph for this function:

void init_q_queue ( map_node map)

Here is the call graph for this function:

Here is the caller graph for this function:

int lgl_print_map ( map_node map,
char *  lgl_mapfile 
)

Here is the caller graph for this function:

map_node* load_map ( char *  file,
map_node **  new_root 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int main ( int  argc,
char **  argv 
)

Here is the call graph for this function:

map_rnode* map_get_rblock ( map_node map,
int *  addr_map,
int  maxgroupnode,
int *  count 
)

Here is the call graph for this function:

Here is the caller graph for this function:

map_rnode* map_rnode_insert ( map_node node,
size_t  pos,
map_rnode new 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int map_store_rblock ( map_node map,
int *  addr_map,
int  maxgroupnode,
map_rnode rblock 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int mod_rnode_addr ( map_rnode rnode,
int *  map_start,
int *  new_start 
)

Here is the caller graph for this function:

char* pack_map ( map_node map,
int *  addr_map,
int  maxgroupnode,
map_node root_node,
size_t *  pack_sz 
)

Here is the call graph for this function:

Here is the caller graph for this function:

void pack_map_node ( map_node node,
char *  pack 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int pos_from_node ( map_node node,
map_node map 
)

Here is the caller graph for this function:

void print_data ( char *  file)

Here is the caller graph for this function:

int print_map ( map_node map,
char *  map_file 
)

Here is the caller graph for this function:

map_rnode* rnode_add ( map_node node,
map_rnode new 
)

Here is the call graph for this function:

Here is the caller graph for this function:

map_rnode* rnode_insert ( map_rnode buf,
size_t  pos,
map_rnode new 
)

Here is the caller graph for this function:

int rnode_rtt_compar ( const void *  a,
const void *  b 
)

Here is the caller graph for this function:

void rnode_rtt_order ( map_node node)

Here is the call graph for this function:

Here is the caller graph for this function:

int save_map ( map_node map,
map_node root_node,
char *  file 
)

Here is the call graph for this function:

Here is the caller graph for this function:

void* send_qspn_backpro ( void *  argv)

Here is the call graph for this function:

Here is the caller graph for this function:

void* send_qspn_open ( void *  argv)

Here is the call graph for this function:

Here is the caller graph for this function:

void* send_qspn_pkt ( void *  argv)

Here is the call graph for this function:

Here is the caller graph for this function:

void* send_qspn_reply ( void *  argv)

Here is the call graph for this function:

Here is the caller graph for this function:

void* show_temp_stat ( void *  null)

Here is the caller graph for this function:

int store_rnode_block ( int *  map,
map_node node,
map_rnode rblock,
int  rstart 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int store_tracer_pkt ( struct q_opt qopt)

Here is the call graph for this function:

Here is the caller graph for this function:

void thread_joint ( int  joint,
void *(*)(void *)  start_routine,
void *  nopt 
)

Here is the caller graph for this function:

map_node* unpack_map ( char *  pack,
int *  addr_map,
map_node **  new_root,
int  maxgroupnode,
int  maxrnodeblock 
)

Here is the call graph for this function:

Here is the caller graph for this function:

void unpack_map_node ( map_node node,
char *  pack 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int verify_int_map_hdr ( struct int_map_hdr imap_hdr,
int  maxgroupnode,
int  maxrnodeblock 
)

Here is the caller graph for this function:

void wait_threads ( void  )

Here is the caller graph for this function: