HomeSort by: relevance | last modified time | path
    Searched defs:vtbl_map_node (Results 1 - 2 of 2) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
vtable-verify.h 97 vtbl_map_node and the vtv_graph_node; and insert the node into two
103 of the vtbl_map_node, which gives us an easy way to use bitmaps to
106 struct vtbl_map_node { struct
115 struct vtbl_map_node *next, *prev; /* Pointers for the linked list
128 extern vec<struct vtbl_map_node *> vtbl_map_nodes_vec;
135 extern struct vtbl_map_node *vtbl_map_get_node (tree);
136 extern struct vtbl_map_node *find_or_create_vtbl_map_node (tree);
137 extern void vtbl_map_node_class_insert (struct vtbl_map_node *, unsigned);
138 extern bool vtbl_map_node_registration_find (struct vtbl_map_node *,
140 extern bool vtbl_map_node_registration_insert (struct vtbl_map_node *,
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
vtable-verify.h 97 vtbl_map_node and the vtv_graph_node; and insert the node into two
103 of the vtbl_map_node, which gives us an easy way to use bitmaps to
106 struct vtbl_map_node { struct
115 struct vtbl_map_node *next, *prev; /* Pointers for the linked list
128 extern vec<struct vtbl_map_node *> vtbl_map_nodes_vec;
135 extern struct vtbl_map_node *vtbl_map_get_node (tree);
136 extern struct vtbl_map_node *find_or_create_vtbl_map_node (tree);
137 extern void vtbl_map_node_class_insert (struct vtbl_map_node *, unsigned);
138 extern bool vtbl_map_node_registration_find (struct vtbl_map_node *,
140 extern bool vtbl_map_node_registration_insert (struct vtbl_map_node *,
    [all...]

Completed in 85 milliseconds