* Delete a list entry by making the prev/next entries * point to each other. * * This is only for internal list manipulation where we know * the prev/next entries already! */ @ @ requires \valid(prev); @ requires \valid(next); @ requires prev == next || \separated(prev,next); @ terminates \true; @ ensures next->prev == prev; @ ensures prev->next == next; @ assigns next->prev,pre
| 218 | @ assigns next->prev,prev->next; |
| 219 | @*/ |
| 220 | static inline void __td_list_del(struct td_list_head * prev, struct td_list_head * next) |
| 221 | { |
| 222 | next->prev = prev; |
| 223 | prev->next = next; |
| 224 | /*@ assert next->prev == prev; */ |
| 225 | /*@ assert prev->next == next; */ |
| 226 | } |
| 227 | |
| 228 | /** |
| 229 | * td_list_del - deletes entry from list. |
no outgoing calls
no test coverage detected