Struct caffe2_operator::AsyncNetBase
source · pub struct AsyncNetBase { /* private fields */ }
Implementations§
source§impl AsyncNetBase
impl AsyncNetBase
pub fn new_from_net_def_and_workspace( net_def: &Arc<NetDef>, ws: *mut Workspace ) -> Self
pub fn supports_async(&mut self) -> bool
pub fn get_operators(&self) -> Vec<*mut OperatorStorage>
pub fn tEST_execution_chains(&self) -> &ExecutionChains
pub fn get_stream_counters(&mut self) -> &mut Vec<i32>
pub fn new(net_def: &Arc<NetDef>, ws: *mut Workspace) -> Self
pub fn handle_run_error(&mut self) -> bool
pub fn run_async(&mut self) -> bool
pub fn pool_getter( &mut self, pools: &mut HashMap<i32, HashMap<i32, Arc<dyn TaskThreadPoolBaseInterface>>>, device_type: i32, device_id: i32, pool_size: i32 ) -> Arc<dyn TaskThreadPoolBaseInterface>
pub fn pool(&mut self) -> Arc<dyn TaskThreadPoolBaseInterface>
pub fn pool_with_device_option( &mut self, device_option: &DeviceOption ) -> Arc<dyn TaskThreadPoolBaseInterface>
pub fn stream(&mut self, task_id: i32) -> i32
pub fn is_stream_free(&self, task_id: i32, stream_id: i32) -> bool
pub fn can_schedule( &mut self, task_id: i32, status: *const Vec<EventStatus>, parent_failed: *mut bool ) -> bool
pub fn can_schedule_with_parent_id_and_child_id( &mut self, parent_id: i32, child_id: i32 ) -> bool
pub fn tasks_num(&self) -> i32
pub fn event(&self, task_id: i32) -> &mut Event
pub fn query(&self, task_id: i32) -> EventStatus
pub fn children(&self, task_id: i32) -> &Vec<i32>
pub fn parents(&self, task_id: i32) -> &Vec<i32>
pub fn get_parent_count(&mut self, child_id: i32) -> i32
pub fn update_parent_count(&mut self, child_id: i32) -> i32
pub fn test_and_set_scheduled(&mut self, task_id: i32) -> bool
pub fn num_ops(&self, task_id: i32) -> i32
pub fn first_task_op_id(&self, task_id: i32) -> i32
pub fn last_task_op_id(&self, task_id: i32) -> i32
pub fn first_task_op(&self, task_id: i32) -> *const OperatorStorage
pub fn last_task_op(&self, task_id: i32) -> *const OperatorStorage
pub fn first_task_op_mut(&mut self, task_id: i32) -> *mut OperatorStorage
pub fn last_task_op_mut(&mut self, task_id: i32) -> *mut OperatorStorage
pub fn async_wait(&self, task_id: i32, stream_id: i32, wait_task_ids: &Vec<i32>)
pub fn reset(&mut self)
sourcepub fn handle_chain_error(
&mut self,
task_id: i32,
op: *mut OperatorStorage,
err_str: *const u8,
save_exception: Option<bool>
)
pub fn handle_chain_error( &mut self, task_id: i32, op: *mut OperatorStorage, err_str: *const u8, save_exception: Option<bool> )
Exception/error handling
pub fn run(&mut self, task_id: i32, stream_id: i32) -> bool
pub fn finish_tasks(&mut self, task_ids: &HashSet<i32>)
pub fn finalize_events(&mut self)
pub fn get_operator_stats(&self) -> ProfDAGProtos
pub fn get_per_operator_cost(&self) -> ProfDAGProtos
pub fn get_prof_report(&self) -> ProfDAGReport
Trait Implementations§
Auto Trait Implementations§
impl !RefUnwindSafe for AsyncNetBase
impl !Send for AsyncNetBase
impl !Sync for AsyncNetBase
impl Unpin for AsyncNetBase
impl !UnwindSafe for AsyncNetBase
Blanket Implementations§
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.