#include <dep_graph.h>


Public Member Functions | |
| void | Print (FILE *fp) |
| ARRAY_DIRECTED_GRAPH16 (mUINT16 num_v, mUINT16 num_e, WN_MAP map, DEP_GRAPH_TYPE type) | |
| MEM_POOL * | Pool () |
| void | Erase_Graph () |
| EINDEX16 | Add_Edge (VINDEX16 from, VINDEX16 to, DEP dep, BOOL is_must=FALSE) |
| DEP | Dep (EINDEX16 edge) |
| BOOL | Is_Must (EINDEX16 edge) |
| void | Set_Dep (EINDEX16 edge, DEP dep, BOOL is_must=FALSE) |
| VINDEX16 | Add_Vertex (WN *wn) |
| void | Remove_Edge (EINDEX16 e) |
| VINDEX16 | Get_Vertex (WN *wn) |
| VINDEX16 | Get_Vertex () |
| void | Delete_Vertex (VINDEX16 v) |
| WN * | Get_Wn (VINDEX16 v) |
| void | Set_Wn (VINDEX16 v, WN *wn) |
| void | Delete_Vertex (WN *wn) |
| void | Clear_Map_For_Vertex (VINDEX16 v) |
| void | Clear_Map () |
| mBOOL | Copy_Vertex (VINDEX16 v1, VINDEX16 v2) |
| void | PreserveMapPair (WN *orig, WN *wn1, WN *wn2) |
| void | PruneMapsUsingParity (void) |
Private Attributes | |
| WN_MAP | _map |
| DEP_GRAPH_TYPE | _type |
| MEM_POOL * | _pool |
Friends | |
| void | Depgraph_Write (void *depgraph, struct output_file *fl, WN_MAP off_map) |
| void * | Depgraph_Read (char *cur_addr, char *end_addr, char *wn_base) |
Definition at line 446 of file dep_graph.h.
| ARRAY_DIRECTED_GRAPH16::ARRAY_DIRECTED_GRAPH16 | ( | mUINT16 | num_v, | |
| mUINT16 | num_e, | |||
| WN_MAP | map, | |||
| DEP_GRAPH_TYPE | type | |||
| ) | [inline] |
| EINDEX16 ARRAY_DIRECTED_GRAPH16::Add_Edge | ( | VINDEX16 | from, | |
| VINDEX16 | to, | |||
| DEP | dep, | |||
| BOOL | is_must = FALSE | |||
| ) | [inline] |
Definition at line 465 of file dep_graph.h.
References DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_e, _type, DEP_ARRAY_GRAPH, Is_True, and result.
Referenced by Copy_Vertex().
Definition at line 492 of file dep_graph.h.
References _map, DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_v, DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Add_Vertex(), result, and WN_MAP_Set.

| void ARRAY_DIRECTED_GRAPH16::Clear_Map | ( | ) | [inline] |
Definition at line 537 of file dep_graph.h.
References Clear_Map_For_Vertex(), DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Get_Next_Vertex(), and Get_Vertex().

| void ARRAY_DIRECTED_GRAPH16::Clear_Map_For_Vertex | ( | VINDEX16 | v | ) | [inline] |
Definition at line 532 of file dep_graph.h.
References _map, DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_v, NULL, and WN_MAP_Set.
Referenced by Clear_Map().
Definition at line 545 of file dep_graph.h.
References DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_e, _type, Add_Edge(), DEP_ARRAY_GRAPH, DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Get_In_Edge(), DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Get_Next_In_Edge(), DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Get_Next_Out_Edge(), DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Get_Out_Edge(), DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Get_Sink(), DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Get_Source(), Is_True, Remove_Edge(), and source.
Referenced by PreserveMapPair().

| void ARRAY_DIRECTED_GRAPH16::Delete_Vertex | ( | WN * | wn | ) | [inline] |
Definition at line 528 of file dep_graph.h.
References Delete_Vertex(), and Get_Vertex().

| void ARRAY_DIRECTED_GRAPH16::Delete_Vertex | ( | VINDEX16 | v | ) | [inline] |
Reimplemented from DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >.
Definition at line 514 of file dep_graph.h.
References _map, DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_v, NULL, and WN_MAP_Set.
Referenced by Delete_Vertex().
Definition at line 475 of file dep_graph.h.
References DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_e, _type, DEP_ARRAY_GRAPH, and Is_True.
| void ARRAY_DIRECTED_GRAPH16::Erase_Graph | ( | ) |
Reimplemented from DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >.
| VINDEX16 ARRAY_DIRECTED_GRAPH16::Get_Vertex | ( | ) | [inline] |
Definition at line 510 of file dep_graph.h.
Referenced by Clear_Map(), Delete_Vertex(), and PreserveMapPair().
Definition at line 506 of file dep_graph.h.
References _map, and WN_MAP_Get.
Referenced by WB_BROWSER::Deps_Loop(), and WB_BROWSER::Deps_Ref().
Definition at line 519 of file dep_graph.h.
References DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_v.
Referenced by WB_BROWSER::Vertices().
Definition at line 480 of file dep_graph.h.
References DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_e, _type, DEP_ARRAY_GRAPH, and Is_True.
| MEM_POOL* ARRAY_DIRECTED_GRAPH16::Pool | ( | ) | [inline] |
Definition at line 461 of file dep_graph.h.
References _pool.
Definition at line 582 of file dep_graph.h.
References DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Add_Vertex(), Copy_Vertex(), Get_Vertex(), and Is_True.

| void ARRAY_DIRECTED_GRAPH16::Print | ( | FILE * | fp | ) |
| void ARRAY_DIRECTED_GRAPH16::PruneMapsUsingParity | ( | void | ) |
| void ARRAY_DIRECTED_GRAPH16::Remove_Edge | ( | EINDEX16 | e | ) | [inline] |
Definition at line 502 of file dep_graph.h.
References DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::Delete_Edge().
Referenced by Copy_Vertex().

Definition at line 485 of file dep_graph.h.
References DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_e, _type, DEP_ARRAY_GRAPH, and Is_True.
Definition at line 523 of file dep_graph.h.
References _map, DIRECTED_GRAPH16< ARRAY_EDGE16, ARRAY_VERTEX16 >::_v, and WN_MAP_Set.
| void* Depgraph_Read | ( | char * | cur_addr, | |
| char * | end_addr, | |||
| char * | wn_base | |||
| ) | [friend] |
| void Depgraph_Write | ( | void * | depgraph, | |
| struct output_file * | fl, | |||
| WN_MAP | off_map | |||
| ) | [friend] |
WN_MAP ARRAY_DIRECTED_GRAPH16::_map [private] |
Definition at line 448 of file dep_graph.h.
Referenced by Add_Vertex(), ARRAY_DIRECTED_GRAPH16(), Clear_Map_For_Vertex(), Delete_Vertex(), Get_Vertex(), and Set_Wn().
MEM_POOL* ARRAY_DIRECTED_GRAPH16::_pool [private] |
Definition at line 450 of file dep_graph.h.
Referenced by ARRAY_DIRECTED_GRAPH16(), and Pool().
DEP_GRAPH_TYPE ARRAY_DIRECTED_GRAPH16::_type [private] |
Definition at line 449 of file dep_graph.h.
Referenced by Add_Edge(), ARRAY_DIRECTED_GRAPH16(), Copy_Vertex(), Dep(), Is_Must(), and Set_Dep().
1.6.1