Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
F
frama-c
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Deploy
Releases
Container Registry
Model registry
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
pub
frama-c
Commits
0e692305
Commit
0e692305
authored
2 years ago
by
Loïc Correnson
Committed by
Allan Blanchard
2 years ago
Browse files
Options
Downloads
Patches
Plain Diff
[wp] better consolidation of trivials & cached
parent
bff858cb
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/plugins/wp/Stats.ml
+49
-25
49 additions, 25 deletions
src/plugins/wp/Stats.ml
with
49 additions
and
25 deletions
src/plugins/wp/Stats.ml
+
49
−
25
View file @
0e692305
...
@@ -113,23 +113,46 @@ let choose_best a b =
...
@@ -113,23 +113,46 @@ let choose_best a b =
let
choose_worst
a
b
=
let
choose_worst
a
b
=
if
VCS
.
leq
(
snd
b
)
(
snd
a
)
then
a
else
b
if
VCS
.
leq
(
snd
b
)
(
snd
a
)
then
a
else
b
let
consolidated_valid
=
function
let
is_trivial
(
p
,
r
)
=
|
[]
->
NoResult
,
0
,
0
,
[]
p
=
Qed
||
VCS
.
is_trivial
r
let
is_cached
((
_
,
r
)
as
pr
)
=
r
.
VCS
.
cached
||
not
(
VCS
.
is_verdict
r
)
||
is_trivial
pr
type
consolidated
=
{
cs_verdict
:
VCS
.
verdict
;
cs_cached
:
int
;
cs_trivial
:
int
;
cs_provers
:
(
prover
*
pstats
)
list
;
}
let
consolidated
=
function
|
[]
->
{
cs_verdict
=
NoResult
;
cs_trivial
=
0
;
cs_cached
=
0
;
cs_provers
=
[]
}
|
u
::
w
as
results
->
|
u
::
w
as
results
->
let
p
,
r
=
List
.
fold_left
choose_best
u
w
in
let
(
p
,
r
)
as
pr
=
List
.
fold_left
choose_best
u
w
in
let
trivial
=
p
=
Qed
||
VCS
.
is_trivial
r
in
let
trivial
=
is_trivial
pr
in
let
cached
=
let
cached
=
not
trivial
&&
List
.
for_all
is_cached
results
in
List
.
for_all
let
provers
=
(
fun
(
_
,
r
)
->
r
.
VCS
.
cached
||
not
(
VCS
.
is_verdict
r
))
if
p
=
Qed
then
[
Qed
,
pqed
r
]
results
in
else
pmerge
[
Qed
,
psolver
r
]
[
p
,
presult
r
]
r
.
VCS
.
verdict
,
in
(
if
trivial
then
1
else
0
)
,
{
(
if
cached
then
1
else
0
)
,
cs_verdict
=
r
.
VCS
.
verdict
;
if
p
=
Qed
then
[
Qed
,
pqed
r
]
cs_trivial
=
(
if
trivial
then
1
else
0
)
;
else
pmerge
[
Qed
,
psolver
r
]
[
p
,
presult
r
]
cs_cached
=
(
if
cached
then
1
else
0
)
;
cs_provers
=
provers
;
}
let
valid_stats
prs
=
let
stats
prs
=
let
verdict
,
trivial
,
cached
,
provers
=
consolidated_valid
prs
in
let
{
cs_verdict
=
verdict
;
cs_trivial
=
trivial
;
cs_cached
=
cached
;
cs_provers
=
provers
;
}
=
consolidated
prs
in
match
verdict
with
match
verdict
with
|
Valid
->
|
Valid
->
{
empty
with
verdict
;
provers
;
trivial
;
cached
;
proved
=
1
}
{
empty
with
verdict
;
provers
;
trivial
;
cached
;
proved
=
1
}
...
@@ -143,14 +166,14 @@ let valid_stats prs =
...
@@ -143,14 +166,14 @@ let valid_stats prs =
{
empty
with
verdict
;
provers
;
trivial
;
cached
;
failed
=
1
}
{
empty
with
verdict
;
provers
;
trivial
;
cached
;
failed
=
1
}
let
results
~
smoke
prs
=
let
results
~
smoke
prs
=
if
not
smoke
then
valid_
stats
prs
if
not
smoke
then
stats
prs
else
else
let
verdict
,
missing
=
let
verdict
,
missing
=
List
.
partition
(
fun
(
_
,
r
)
->
VCS
.
is_verdict
r
)
prs
in
List
.
partition
(
fun
(
_
,
r
)
->
VCS
.
is_verdict
r
)
prs
in
let
doomed
,
passed
=
let
doomed
,
passed
=
List
.
partition
(
fun
(
_
,
r
)
->
VCS
.
is_valid
r
)
verdict
in
List
.
partition
(
fun
(
_
,
r
)
->
VCS
.
is_valid
r
)
verdict
in
if
doomed
<>
[]
then
if
doomed
<>
[]
then
valid_
stats
doomed
stats
doomed
else
else
let
trivial
=
List
.
fold_left
let
trivial
=
List
.
fold_left
(
fun
c
(
p
,
r
)
->
if
p
=
Qed
||
VCS
.
is_trivial
r
then
succ
c
else
c
)
(
fun
c
(
p
,
r
)
->
if
p
=
Qed
||
VCS
.
is_trivial
r
then
succ
c
else
c
)
...
@@ -236,18 +259,20 @@ let pp_pstats fmt p =
...
@@ -236,18 +259,20 @@ let pp_pstats fmt p =
let
pp_stats
~
shell
~
cache
fmt
s
=
let
pp_stats
~
shell
~
cache
fmt
s
=
let
total
=
proofs
s
in
let
total
=
proofs
s
in
let
valids
=
s
.
proved
in
let
cacheable
=
total
-
s
.
trivial
in
let
cached
=
s
.
trivial
+
s
.
cached
in
if
s
.
tactics
>
1
then
if
s
.
tactics
>
1
then
Format
.
fprintf
fmt
" (Tactics %d)"
s
.
tactics
Format
.
fprintf
fmt
" (Tactics %d)"
s
.
tactics
else
if
s
.
tactics
=
1
then
else
if
s
.
tactics
=
1
then
Format
.
fprintf
fmt
" (Tactic)"
;
Format
.
fprintf
fmt
" (Tactic)"
;
let
updating
=
Cache
.
is_updating
cache
in
let
updating
=
Cache
.
is_updating
cache
in
let
cache_miss
=
Cache
.
is_active
cache
&&
not
updating
&&
cached
<
total
in
let
cache_miss
=
Cache
.
is_active
cache
&&
not
updating
&&
s
.
cached
<
cacheable
in
let
qed_only
=
let
qed_only
=
match
s
.
provers
with
[
Qed
,_
]
->
valids
=
total
|
_
->
false
in
match
s
.
provers
with
[
Qed
,_
]
->
s
.
proved
=
total
|
_
->
false
in
let
print_cache
=
let
print_cache
=
not
qed_only
&&
Cache
.
is_active
cache
&&
0
<
cached
in
not
qed_only
&&
Cache
.
is_active
cache
&&
(
updating
||
0
<
s
.
trivial
||
0
<
s
.
cached
)
in
List
.
iter
List
.
iter
(
fun
(
p
,
pr
)
->
(
fun
(
p
,
pr
)
->
let
success
=
truncate
pr
.
success
in
let
success
=
truncate
pr
.
success
in
...
@@ -255,7 +280,7 @@ let pp_stats ~shell ~cache fmt s =
...
@@ -255,7 +280,7 @@ let pp_stats ~shell ~cache fmt s =
pr
.
time
>
Rformat
.
epsilon
&&
pr
.
time
>
Rformat
.
epsilon
&&
(
not
shell
||
cache_miss
)
in
(
not
shell
||
cache_miss
)
in
let
print_proofs
=
success
>
0
&&
total
>
1
in
let
print_proofs
=
success
>
0
&&
total
>
1
in
let
print_qed
=
qed_only
&&
s
.
verdict
=
Valid
&&
valids
=
total
in
let
print_qed
=
qed_only
&&
s
.
verdict
=
Valid
&&
s
.
proved
=
total
in
if
p
!=
Qed
||
print_qed
||
print_perfo
||
print_proofs
if
p
!=
Qed
||
print_qed
||
print_perfo
||
print_proofs
then
then
begin
begin
...
@@ -269,13 +294,12 @@ let pp_stats ~shell ~cache fmt s =
...
@@ -269,13 +294,12 @@ let pp_stats ~shell ~cache fmt s =
end
end
)
s
.
provers
;
)
s
.
provers
;
if
shell
&&
cache_miss
then
if
shell
&&
cache_miss
then
Format
.
fprintf
fmt
" (Cache miss %d)"
(
total
-
cached
)
Format
.
fprintf
fmt
" (Cache miss %d)"
(
cacheable
-
s
.
cached
)
else
else
if
print_cache
then
if
print_cache
then
if
s
.
trivial
=
total
then
if
s
.
trivial
=
total
then
Format
.
fprintf
fmt
" (Trivial)"
Format
.
fprintf
fmt
" (Trivial)"
else
else
let
cacheable
=
total
-
s
.
trivial
in
if
updating
||
s
.
cached
=
cacheable
then
if
updating
||
s
.
cached
=
cacheable
then
Format
.
fprintf
fmt
" (Cached)"
Format
.
fprintf
fmt
" (Cached)"
else
else
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment