Lines Matching refs:graph

40 class graph;  variable
45 friend class graph; variable
116 void activate_graph(graph& g);
117 void deactivate_graph(graph& g);
118 bool is_graph_active(graph& g);
119 graph_task* prioritize_task(graph& g, graph_task& arena_task);
120 void spawn_in_graph_arena(graph& g, graph_task& arena_task);
121 void enqueue_in_graph_arena(graph &g, graph_task& arena_task);
123 class graph; variable
128 graph_task(graph& g, small_object_allocator& allocator
135 graph& my_graph; // graph instance the task belongs to
149 friend graph_task* prioritize_task(graph& g, graph_task& gt);
237 class graph : no_copy, public graph_proxy {
257 graph();
260 explicit graph(task_group_context& use_this_context);
264 ~graph();
307 typedef graph_iterator<graph, graph_node> iterator;
308 typedef graph_iterator<const graph, const graph_node> const_iterator;
352 friend void activate_graph(graph& g);
353 friend void deactivate_graph(graph& g);
354 friend bool is_graph_active(graph& g);
355 friend graph_task* prioritize_task(graph& g, graph_task& arena_task);
356 friend void spawn_in_graph_arena(graph& g, graph_task& arena_task);
357 friend void enqueue_in_graph_arena(graph &g, graph_task& arena_task);
373 graph& g = my_graph; in finalize()
389 friend class graph; variable
398 graph& my_graph;
399 graph& graph_reference() const { in graph_reference()
406 explicit graph_node(graph& g);
415 inline void activate_graph(graph& g) { in activate_graph()
419 inline void deactivate_graph(graph& g) { in deactivate_graph()
423 inline bool is_graph_active(graph& g) { in is_graph_active()
427 inline graph_task* prioritize_task(graph& g, graph_task& gt) { in prioritize_task()
444 inline void spawn_in_graph_arena(graph& g, graph_task& arena_task) { in spawn_in_graph_arena()
462 inline void enqueue_in_graph_arena(graph &g, graph_task& arena_task) { in enqueue_in_graph_arena()