rename struct starpu_fifo_data into struct starpu_sched_component_fifo_data

doc/doxygen/chapters/api/modularized_scheduler.doxy

@@ -235,7 +235,7 @@ The actual scheduler
 @name Flow-control Fifo Component API
 \ingroup API_Modularized_Scheduler
 
-\fn struct starpu_sched_component *starpu_sched_component_fifo_create(struct starpu_sched_tree *tree, struct starpu_fifo_data *fifo_data)
+\fn struct starpu_sched_component *starpu_sched_component_fifo_create(struct starpu_sched_tree *tree, struct starpu_sched_component_fifo_data *fifo_data)
 \ingroup API_Modularized_Scheduler
 	 Return a struct starpu_sched_component with a fifo. A stable sort is performed according to tasks priorities.
 	 A push_task call on this component does not perform recursive calls, underlying components will have to call pop_task to get it.

doc/doxygen/chapters/modularized_scheduler.doxy

@@ -210,7 +210,7 @@ static void initialize_eager_prefetching_center_policy(unsigned sched_ctx_id)
    * be connected to Worker Components. By doing so, this Modularized 
    * Scheduler will be able to perform some prefetching on the resources 
    */
-  struct starpu_fifo_data fifo_data =
+  struct starpu_sched_component_fifo_data fifo_data =
   {
     .ntasks_threshold = ntasks_threshold,
     .exp_len_threshold = exp_len_threshold,

include/starpu_sched_component.h

@@ -109,13 +109,13 @@ int starpu_sched_component_is_combined_worker(struct starpu_sched_component *com
 void starpu_sched_component_worker_pre_exec_hook(struct starpu_task *task);
 void starpu_sched_component_worker_post_exec_hook(struct starpu_task *task);
 
-struct starpu_fifo_data
+struct starpu_sched_component_fifo_data
 {
 	unsigned ntasks_threshold;
 	double exp_len_threshold;
 };
 
-struct starpu_sched_component *starpu_sched_component_fifo_create(struct starpu_sched_tree *tree, struct starpu_fifo_data *fifo_data);
+struct starpu_sched_component *starpu_sched_component_fifo_create(struct starpu_sched_tree *tree, struct starpu_sched_component_fifo_data *fifo_data);
 int starpu_sched_component_is_fifo(struct starpu_sched_component *component);
 
 struct starpu_sched_component_prio_data

src/sched_policies/component_fifo.c

@@ -237,7 +237,7 @@ int starpu_sched_component_is_fifo(struct starpu_sched_component * component)
 	return component->push_task == fifo_push_task;
 }
 
-struct starpu_sched_component * starpu_sched_component_fifo_create(struct starpu_sched_tree *tree, struct starpu_fifo_data * params)
+struct starpu_sched_component * starpu_sched_component_fifo_create(struct starpu_sched_tree *tree, struct starpu_sched_component_fifo_data * params)
 {
 	struct starpu_sched_component * component = starpu_sched_component_create(tree);
 	struct _starpu_fifo_data * data = malloc(sizeof(*data));

src/sched_policies/modular_eager_prefetching.c

@@ -43,7 +43,7 @@ static void initialize_eager_prefetching_center_policy(unsigned sched_ctx_id)
 	t->root->add_child(t->root, eager_component);
 	eager_component->add_parent(eager_component, t->root);
 
-	struct starpu_fifo_data fifo_data =
+	struct starpu_sched_component_fifo_data fifo_data =
 		{
 			.ntasks_threshold = ntasks_threshold,
 			.exp_len_threshold = exp_len_threshold,

src/sched_policies/modular_random_prefetching.c

@@ -43,7 +43,7 @@ static void initialize_random_fifo_prefetching_center_policy(unsigned sched_ctx_
 	t->root->add_child(t->root, random_component);
 	random_component->add_parent(random_component, t->root);
 
-	struct starpu_fifo_data fifo_data =
+	struct starpu_sched_component_fifo_data fifo_data =
 		{
 			.ntasks_threshold = ntasks_threshold,
 			.exp_len_threshold = exp_len_threshold,