/* StarPU --- Runtime system for heterogeneous multicore architectures. * * Copyright (C) 2009, 2010 Université de Bordeaux 1 * Copyright (C) 2010, 2011 Centre National de la Recherche Scientifique * * StarPU is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser General Public License as published by * the Free Software Foundation; either version 2.1 of the License, or (at * your option) any later version. * * StarPU is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. * * See the GNU Lesser General Public License in COPYING.LGPL for more details. */ #ifndef __COHERENCY__H__ #define __COHERENCY__H__ #include #include #include #include #include #include #include #include #include #include typedef enum { STARPU_OWNER, STARPU_SHARED, STARPU_INVALID } starpu_cache_state; /* this should contain the information relative to a given data replicate */ LIST_TYPE(starpu_data_replicate, starpu_data_handle handle; /* describe the actual data layout */ void *data_interface; unsigned memory_node; /* A buffer that is used for SCRATCH or reduction cannnot be used with * filters. */ unsigned relaxed_coherency; /* In the case of a SCRATCH access, we need to initialize the replicate * with a neutral element before using it. */ unsigned initialized; /* describes the state of the local data in term of coherency */ starpu_cache_state state; int refcnt; /* is the data locally allocated ? */ uint8_t allocated; /* was it automatically allocated ? */ /* perhaps the allocation was perform higher in the hiearchy * for now this is just translated into !automatically_allocated * */ uint8_t automatically_allocated; /* To help the scheduling policies to make some decision, we may keep a track of the tasks that are likely to request this data on the current node. It is the responsability of the scheduling _policy_ to set that flag when it assigns a task to a queue, policies which do not use this hint can simply ignore it. */ uint8_t requested[STARPU_MAXNODES]; struct starpu_data_request_s *request[STARPU_MAXNODES]; ); struct starpu_data_requester_list_s; struct starpu_jobid_list { unsigned long id; struct starpu_jobid_list *next; }; /* This structure describes a simply-linked list of task */ struct starpu_task_wrapper_list { struct starpu_task *task; struct starpu_task_wrapper_list *next; }; struct starpu_data_state_t { struct starpu_data_requester_list_s *req_list; /* the number of requests currently in the scheduling engine * (not in the req_list anymore) */ unsigned refcnt; starpu_access_mode current_mode; /* protect meta data */ starpu_spinlock_t header_lock; /* In case we user filters, the handle may describe a sub-data */ struct starpu_data_state_t *root_handle; /* root of the tree */ struct starpu_data_state_t *father_handle; /* father of the node, NULL if the current node is the root */ unsigned sibling_index; /* indicate which child this node is from the father's perpsective (if any) */ unsigned depth; /* what's the depth of the tree ? */ struct starpu_data_state_t *children; unsigned nchildren; /* describe the state of the data in term of coherency */ struct starpu_data_replicate_s per_node[STARPU_MAXNODES]; struct starpu_data_replicate_s per_worker[STARPU_NMAXWORKERS]; struct starpu_data_interface_ops_t *ops; /* To avoid recomputing data size all the time, we store it directly. */ size_t data_size; /* Footprint which identifies data layout */ uint32_t footprint; /* where is the data home ? -1 if none yet */ int home_node; /* what is the default write-through mask for that data ? */ uint32_t wt_mask; /* allows special optimization */ uint8_t is_readonly; /* in some case, the application may explicitly tell StarPU that a * piece of data is not likely to be used soon again */ unsigned is_not_important; /* Does StarPU have to enforce some implicit data-dependencies ? */ unsigned sequential_consistency; /* This lock should protect any operation to enforce * sequential_consistency */ pthread_mutex_t sequential_consistency_mutex; /* The last submitted task (or application data request) that declared * it would modify the piece of data ? Any task accessing the data in a * read-only mode should depend on that task implicitely if the * sequential_consistency flag is enabled. */ starpu_access_mode last_submitted_mode; struct starpu_task *last_submitted_writer; struct starpu_task_wrapper_list *last_submitted_readers; /* If FxT is enabled, we keep track of "ghost dependencies": that is to * say the dependencies that are not needed anymore, but that should * appear in the post-mortem DAG. For instance if we have the sequence * f(Aw) g(Aw), and that g is submitted after the termination of f, we * want to have f->g appear in the DAG even if StarPU does not need to * enforce this dependency anymore.*/ unsigned last_submitted_ghost_writer_id_is_valid; unsigned long last_submitted_ghost_writer_id; struct starpu_jobid_list *last_submitted_ghost_readers_id; struct starpu_task_wrapper_list *post_sync_tasks; unsigned post_sync_tasks_cnt; /* * Reductions */ /* During reduction we need some specific methods: redux_func performs * the reduction of an interface into another one (eg. "+="), and init_func * initializes the data interface to a default value that is stable by * reduction (eg. 0 for +=). */ struct starpu_codelet_t *redux_cl; struct starpu_codelet_t *init_cl; /* Are we currently performing a reduction on that handle ? If so the * reduction_refcnt should be non null until there are pending tasks * that are performing the reduction. */ unsigned reduction_refcnt; /* List of requesters that are specific to the pending reduction. This * list is used when the requests in the req_list list are frozen until * the end of the reduction. */ struct starpu_data_requester_list_s *reduction_req_list; starpu_data_handle reduction_tmp_handles[STARPU_NMAXWORKERS]; unsigned lazy_unregister; /* Used for MPI */ int rank; int tag; }; void _starpu_display_msi_stats(void); int _starpu_fetch_data_on_node(struct starpu_data_state_t *state, struct starpu_data_replicate_s *replicate, starpu_access_mode mode, unsigned is_prefetch, void (*callback_func)(void *), void *callback_arg); void _starpu_release_data_on_node(struct starpu_data_state_t *state, uint32_t default_wt_mask, struct starpu_data_replicate_s *replicate); void _starpu_update_data_state(starpu_data_handle handle, struct starpu_data_replicate_s *requesting_replicate, starpu_access_mode mode); uint32_t _starpu_get_data_refcnt(struct starpu_data_state_t *state, uint32_t node); size_t _starpu_data_get_size(starpu_data_handle handle); uint32_t _starpu_data_get_footprint(starpu_data_handle handle); void _starpu_push_task_output(struct starpu_task *task, uint32_t mask); __attribute__((warn_unused_result)) int _starpu_fetch_task_input(struct starpu_task *task, uint32_t mask); unsigned _starpu_is_data_present_or_requested(struct starpu_data_state_t *state, uint32_t node); unsigned starpu_data_test_if_allocated_on_node(starpu_data_handle handle, uint32_t memory_node); uint32_t _starpu_select_src_node(struct starpu_data_state_t *state); starpu_data_request_t create_request_to_fetch_data(starpu_data_handle handle, struct starpu_data_replicate_s *dst_replicate, starpu_access_mode mode, unsigned is_prefetch, void (*callback_func)(void *), void *callback_arg); void _starpu_redux_init_data_replicate(starpu_data_handle handle, struct starpu_data_replicate_s *replicate, int workerid); void starpu_data_start_reduction_mode(starpu_data_handle handle); void starpu_data_end_reduction_mode(starpu_data_handle handle); void starpu_data_end_reduction_mode_terminate(starpu_data_handle handle); #endif // __COHERENCY__H__