16#ifndef __LEGION_REGISTRARS_H__
17#define __LEGION_REGISTRARS_H__
43 FieldSpace handle,
const char* layout_name =
nullptr);
68 const char* layout_name;
79 : size(s), alignment(0), scope(u)
82 : size(s), alignment(a), scope(LEGION_BOUNDED_POOL)
88 inline bool is_bounded(
void)
const
90 return (scope == LEGION_BOUNDED_POOL);
100 UnboundPoolScope scope;
115 TaskID task_id,
bool global =
true,
const char* variant_name =
nullptr);
117 TaskID task_id,
const char* variant_name,
bool global =
true);
131 unsigned index, LayoutConstraintID desc);
133 inline void set_leaf(
bool is_leaf =
true);
134 inline void set_inner(
bool is_inner =
true);
135 inline void set_idempotent(
bool is_idempotent =
true);
136 inline void set_replicable(
bool is_replicable =
true);
137 inline void set_concurrent(
bool is_concurrent =
true);
138 inline void set_concurrent_barrier(
bool needs_barrier =
true);
140 inline void add_generator_task(TaskID tid);
143 bool global_registration;
144 const char* task_variant_name;
158 std::map<Memory::Kind, PoolBounds> leaf_pool_bounds;
162 std::map<Memory::Kind, PoolBounds> non_escaping_leaf_pool_bounds;
165 std::set<TaskID> generator_tasks;
169 bool idempotent_variant;
170 bool replicable_variant;
171 bool concurrent_variant;
172 bool concurrent_barrier;
177#include "legion/api/registrars.inl"
Definition constraints.h:689
Definition constraints.h:202
Definition constraints.h:640
Definition constraints.h:240
Definition constraints.h:475
Definition constraints.h:61
Definition constraints.h:167
Definition constraints.h:881
Definition constraints.h:422
Definition constraints.h:737
Definition constraints.h:538
Definition constraints.h:830
Definition constraints.h:783
Definition constraints.h:95
Definition constraints.h:132
Definition constraints.h:357
Definition constraints.h:942
Definition constraints.h:592
Definition accessors.h:29
Definition registrars.h:39
Definition registrars.h:76
Definition registrars.h:111