Home
last modified time | relevance | path

Searched refs:list (Results 1 – 10 of 10) sorted by relevance

/rust/kernel/list/
A Dimpl_list_item_mod.rs27 unsafe fn raw_get_list_links(ptr: *mut Self) -> *mut crate::list::ListLinks<ID>; in raw_get_list_links()
40 unsafe impl$(<$($generics)*>)? $crate::list::HasListLinks$(<$id>)? for $self {
91 let ptr: *mut $crate::list::ListLinksSelfPtr<$item_type $(, $id)?> =
189 $crate::list::impl_has_list_links! {
194 unsafe impl$(<$($generics)*>)? $crate::list::ListItem<$num> for $self {
233 unsafe { <Self as $crate::list::ListItem<$num>>::view_links(me) }
255 $crate::list::impl_has_list_links_self_ptr! {
260 unsafe impl$(<$($generics)*>)? $crate::list::ListItem<$num> for $self {
279 $crate::list::ListLinksSelfPtr::raw_get_self_ptr(container)
328 $crate::list::ListLinksSelfPtr::raw_get_self_ptr(container)
[all …]
A Darc_field.rs73 $pub fn $name<'a>(self: &'a $crate::list::ListArc<Self $(, $id)?>) -> &'a $typ {
76 unsafe { $crate::list::ListArcField::<$typ $(, $id)?>::assert_ref(field) }
79 $crate::list::define_list_arc_field_getter!($($rest)*);
85 $pub fn $name<'a>(self: &'a mut $crate::list::ListArc<Self $(, $id)?>) -> &'a mut $typ {
88 unsafe { $crate::list::ListArcField::<$typ $(, $id)?>::assert_mut(field) }
91 $crate::list::define_list_arc_field_getter!($($rest)*);
A Darc.rs87 impl$(<$($generics)*>)? $crate::list::ListArcSafe<$num> for $t {
91 $crate::list::impl_list_arc_safe! { $($rest)* }
97 impl$(<$($generics)*>)? $crate::list::ListArcSafe<$num> for $t {
107 <$fty as $crate::list::ListArcSafe<$num>>::on_create_list_arc_from_unique(field)
113 … unsafe { <$fty as $crate::list::ListArcSafe<$num>>::on_drop_list_arc(&self.$field) };
116 unsafe impl$(<$($generics)*>)? $crate::list::TryNewListArc<$num> for $t
121 <$fty as $crate::list::TryNewListArc<$num>>::try_new_list_arc(&self.$field)
124 $crate::list::impl_list_arc_safe! { $($rest)* }
/rust/pin-init/examples/
A Dlinked_list.rs44 pub fn insert_next(list: &ListHead) -> impl PinInit<Self, Infallible> + '_ { in insert_next()
46 prev: list.next.prev().replace(unsafe { Link::new_unchecked(this)}), in insert_next()
47 next: list.next.replace(unsafe { Link::new_unchecked(this)}), in insert_next()
53 pub fn insert_prev(list: &ListHead) -> impl PinInit<Self, Infallible> + '_ { in insert_prev()
55 next: list.prev.next().replace(unsafe { Link::new_unchecked(this)}), in insert_prev()
56 prev: list.prev.replace(unsafe { Link::new_unchecked(this)}), in insert_prev()
A Dmutex.rs174 fn insert_new(list: &ListHead) -> impl PinInit<Self> + '_ { in insert_new()
179 wait_list <- ListHead::insert_prev(list), in insert_new()
185 wait_list <- ListHead::insert_prev(list), in insert_new()
/rust/kernel/
A Dlist.rs603 list: self, in cursor_front()
612 list: self, in cursor_back()
826 list: &'a mut List<T, ID>, field
837 let first = self.list.first; in prev_ptr()
900 if next == self.list.first { in move_next()
926 self.list.first in insert_inner()
936 self.list.first = item; in insert_inner()
1057 list: List<T, ID>, field
1064 self.list.pop_front() in next()
1072 self.list.pop_back() in next_back()
[all …]
A Dopp.rs92 let mut list = KVec::with_capacity(names.len() + 1, GFP_KERNEL)?; in to_c_str_array() variables
95 list.push(name.as_ptr().cast(), GFP_KERNEL)?; in to_c_str_array()
98 list.push(ptr::null(), GFP_KERNEL)?; in to_c_str_array()
99 Ok(list) in to_c_str_array()
447 let list = to_c_str_array(x)?; in set()
448 let ptr = list.as_ptr(); in set()
449 (Some(list), ptr) in set()
456 let list = to_c_str_array(x)?; in set()
457 let ptr = list.as_ptr(); in set()
458 (Some(list), ptr) in set()
A Dlib.rs98 pub mod list; module
/rust/pin-init/
A DCONTRIBUTING.md58 Certificate of Origin]. This has to be done for both mailing list submissions as well as GitHub
A DREADME.md69 the Linux kernel. It also uses a wait list and a basic spinlock. Importantly the wait list

Completed in 16 milliseconds