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

Functions

void bmap_levels_init (u_char levels, map_bnode ***bmap, u_int **bmap_nodes)
 
void bmap_levels_free (map_bnode **bmap, u_int *bmap_nodes)
 
void bmap_counter_init (u_char levels, u_int **bnodes_closed, u_int **bnodes_opened)
 
void bmap_counter_free (u_int *bnodes_closed, u_int *bnodes_opened)
 
void bmap_counter_reset (u_char levels, u_int *counter)
 
int map_add_bnode (map_bnode **bmap, u_int *bmap_nodes, u_int bnode, u_int links)
 
map_bnodemap_bnode_del (map_bnode *bmap, u_int *bmap_nodes, map_bnode *bnode)
 
int bmap_del_rnode_by_level (map_bnode *bnode, int level, map_gnode **ext_map, int total_levels)
 
int map_find_bnode (map_bnode *bmap, int bmap_nodes, int node)
 
int map_find_bnode_rnode (map_bnode *bmap, int bmap_nodes, void *n)
 
int map_count_bnode_rnode (map_bnode *bmap, int bmap_nodes, void *n)
 
int bmaps_count_bnode_rnode (map_bnode **bmap, int *bmap_nodes, int levels, void *n)
 
int map_del_bnode_rnode (map_bnode **bmap, int *bmap_nodes, void *n)
 
int bmaps_del_bnode_rnode (map_bnode **bmap, int *bmap_nodes, int levels, void *n)
 
void map_set_bnode_flag (map_bnode *bmap, int bmap_nodes, int flags)
 
void bmaps_set_bnode_flag (map_bnode **bmap, int *bmap_nodes, int levels, int flags)
 
char * pack_all_bmaps (map_bnode **bmaps, u_int *bmap_nodes, map_gnode **ext_map, quadro_group quadg, size_t *pack_sz)
 
map_bnode ** unpack_all_bmaps (char *pack, u_char max_levels, map_gnode **ext_map, u_int **bmap_nodes, int maxbnodes, int maxbnode_rnodeblock)
 
int save_bmap (map_bnode **bmaps, u_int *bmap_nodes, map_gnode **ext_map, quadro_group quadg, char *file)
 
map_bnode ** load_bmap (char *file, map_gnode **ext_map, u_char max_levels, u_int **bmap_nodes)
 

Function Documentation

void bmap_counter_free ( u_int *  bnodes_closed,
u_int *  bnodes_opened 
)

Here is the caller graph for this function:

void bmap_counter_init ( u_char  levels,
u_int **  bnodes_closed,
u_int **  bnodes_opened 
)

Here is the call graph for this function:

Here is the caller graph for this function:

void bmap_counter_reset ( u_char  levels,
u_int *  counter 
)

Here is the caller graph for this function:

int bmap_del_rnode_by_level ( map_bnode bnode,
int  level,
map_gnode **  ext_map,
int  total_levels 
)

Here is the call graph for this function:

void bmap_levels_free ( map_bnode **  bmap,
u_int *  bmap_nodes 
)

Here is the caller graph for this function:

void bmap_levels_init ( u_char  levels,
map_bnode ***  bmap,
u_int **  bmap_nodes 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int bmaps_count_bnode_rnode ( map_bnode **  bmap,
int *  bmap_nodes,
int  levels,
void *  n 
)

Here is the call graph for this function:

int bmaps_del_bnode_rnode ( map_bnode **  bmap,
int *  bmap_nodes,
int  levels,
void *  n 
)

Here is the call graph for this function:

Here is the caller graph for this function:

void bmaps_set_bnode_flag ( map_bnode **  bmap,
int *  bmap_nodes,
int  levels,
int  flags 
)

Here is the call graph for this function:

Here is the caller graph for this function:

map_bnode** load_bmap ( char *  file,
map_gnode **  ext_map,
u_char  max_levels,
u_int **  bmap_nodes 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int map_add_bnode ( map_bnode **  bmap,
u_int *  bmap_nodes,
u_int  bnode,
u_int  links 
)

Here is the call graph for this function:

Here is the caller graph for this function:

map_bnode* map_bnode_del ( map_bnode bmap,
u_int *  bmap_nodes,
map_bnode bnode 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int map_count_bnode_rnode ( map_bnode bmap,
int  bmap_nodes,
void *  n 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int map_del_bnode_rnode ( map_bnode **  bmap,
int *  bmap_nodes,
void *  n 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int map_find_bnode ( map_bnode bmap,
int  bmap_nodes,
int  node 
)

Here is the caller graph for this function:

int map_find_bnode_rnode ( map_bnode bmap,
int  bmap_nodes,
void *  n 
)

Here is the call graph for this function:

Here is the caller graph for this function:

void map_set_bnode_flag ( map_bnode bmap,
int  bmap_nodes,
int  flags 
)

Here is the caller graph for this function:

char* pack_all_bmaps ( map_bnode **  bmaps,
u_int *  bmap_nodes,
map_gnode **  ext_map,
quadro_group  quadg,
size_t *  pack_sz 
)

Here is the call graph for this function:

Here is the caller graph for this function:

int save_bmap ( map_bnode **  bmaps,
u_int *  bmap_nodes,
map_gnode **  ext_map,
quadro_group  quadg,
char *  file 
)

Here is the call graph for this function:

Here is the caller graph for this function:

map_bnode** unpack_all_bmaps ( char *  pack,
u_char  max_levels,
map_gnode **  ext_map,
u_int **  bmap_nodes,
int  maxbnodes,
int  maxbnode_rnodeblock 
)

Here is the call graph for this function:

Here is the caller graph for this function: