1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
/*
File: list_add_sorted.h
Copyright (C) 2006-2008 Christophe GRENIER <grenier@cgsecurity.org>
This software is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write the Free Software Foundation, Inc., 51
Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef _LIST_ADD_SORTED_UNIQ_H
#define _LIST_ADD_SORTED_UNIQ_H
/*
X requires finite(head);
X ensures finite(head);
X ensures finite(newe);
X ensures reachable(head,newe);
*/
/*@
@ requires \valid(newe);
@ requires \valid(head);
@ requires \valid_function(compar);
@ requires separation: \separated(newe, head);
@ requires list_separated(head->prev, newe);
@ requires list_separated(head, newe);
@ requires finite(head->prev);
@ requires finite(head);
@*/
static inline void td_list_add_sorted(struct td_list_head *newe, struct td_list_head *head,
int (*compar)(const struct td_list_head *a, const struct td_list_head *b))
{
struct td_list_head *pos;
/*@
@ loop invariant \valid(pos);
@ loop invariant \valid(pos->prev);
@ loop invariant \valid(pos->next);
@ loop invariant pos == head || \separated(pos, head);
@ loop invariant \valid_function(compar);
@ loop assigns pos;
@*/
/*
X loop invariant finite(head->prev);
X loop invariant finite(head);
*/
td_list_for_each(pos, head)
{
/*@ assert \valid_function(compar); */
/*@ assert \valid_read(newe); */
/*@ assert \valid_read(pos); */
if(compar(newe,pos)<0)
break;
}
if(pos != head)
{
__td_list_add(newe, pos->prev, pos);
}
else
{
/*@ assert finite(head->prev); */
/*@ assert finite(head); */
/*@ assert list_separated(head->prev, newe); */
/*@ assert list_separated(head, newe); */
td_list_add_tail(newe, head);
}
/*X assert finite(head); */
/*X assert finite(newe); */
}
#endif
|
