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
d2f16c7e
Commit
d2f16c7e
authored
2 years ago
by
Valentin Perrelle
Committed by
David Bühler
1 year ago
Browse files
Options
Downloads
Patches
Plain Diff
[Eva] New type for callstacks
parent
d6331d4d
No related branches found
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
src/plugins/eva/types/callstack.ml
+136
-0
136 additions, 0 deletions
src/plugins/eva/types/callstack.ml
src/plugins/eva/types/callstack.mli
+66
-0
66 additions, 0 deletions
src/plugins/eva/types/callstack.mli
with
202 additions
and
0 deletions
src/plugins/eva/types/callstack.ml
0 → 100644
+
136
−
0
View file @
d2f16c7e
(**************************************************************************)
(* *)
(* This file is part of Frama-C. *)
(* *)
(* Copyright (C) 2007-2023 *)
(* CEA (Commissariat à l'énergie atomique et aux énergies *)
(* alternatives) *)
(* *)
(* you can redistribute it and/or modify it under the terms of the GNU *)
(* Lesser General Public License as published by the Free Software *)
(* Foundation, version 2.1. *)
(* *)
(* It 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 Lesser General Public License for more details. *)
(* *)
(* See the GNU Lesser General Public License version 2.1 *)
(* for more details (enclosed in the file licenses/LGPLv2.1). *)
(* *)
(**************************************************************************)
module
Thread
=
Int
(* Threads are identified by integers *)
module
Kf
=
Kernel_function
module
Stmt
=
Cil_datatype
.
Stmt
type
call
=
Cil_types
.
kernel_function
*
Cil_types
.
stmt
module
Call
=
Datatype
.
Pair_with_collections
(
Kf
)(
Stmt
)
(
struct
let
module_name
=
"Eva.Callstack.Call"
end
)
module
Calls
=
Datatype
.
List
(
Call
)
type
callstack
=
{
thread
:
int
;
entry_point
:
Cil_types
.
kernel_function
;
stack
:
call
list
;
}
(* Datatype *)
module
Prototype
=
struct
include
Datatype
.
Serializable_undefined
type
t
=
callstack
let
name
=
"Eva.Callstack"
let
reprs
=
List
.
concat_map
(
fun
stack
->
List
.
map
(
fun
entry_point
->
{
thread
=
0
;
entry_point
;
stack
})
Kernel_function
.
reprs
)
Calls
.
reprs
let
pretty
fmt
cs
=
let
pp_call
fmt
(
kf
,
stmt
)
=
Format
.
fprintf
fmt
"%a :: %a <-@ "
Kf
.
pretty
kf
Cil_datatype
.
Location
.
pretty
(
Stmt
.
loc
stmt
)
in
Format
.
fprintf
fmt
"@[<hv>"
;
List
.
iter
(
pp_call
fmt
)
cs
.
stack
;
Format
.
fprintf
fmt
"%a@]"
Kf
.
pretty
cs
.
entry_point
let
equal
cs1
cs2
=
Thread
.
equal
cs1
.
thread
cs2
.
thread
&&
Calls
.
equal
cs1
.
stack
cs2
.
stack
&&
Kf
.
equal
cs1
.
entry_point
cs2
.
entry_point
let
compare
cs1
cs2
=
let
r
=
Thread
.
compare
cs1
.
thread
cs2
.
thread
in
if
r
<>
0
then
r
else
let
r
=
Kf
.
compare
cs1
.
entry_point
cs2
.
entry_point
in
if
r
<>
0
then
r
else
Calls
.
compare
cs1
.
stack
cs2
.
stack
let
hash
cs
=
Hashtbl
.
hash
(
cs
.
thread
,
Kf
.
hash
cs
.
entry_point
,
Calls
.
hash
cs
.
stack
)
end
include
Datatype
.
Make_with_collections
(
Prototype
)
(* Constructors *)
let
init
?
(
thread
=
0
)
entry_point
=
{
thread
;
entry_point
;
stack
=
[]
}
let
of_legacy
(
cs
:
Value_types
.
callstack
)
=
let
rec
aux
acc
=
function
|
(
kf
,
Cil_types
.
Kstmt
stmt
)
::
tail
->
aux
((
kf
,
stmt
)
::
acc
)
tail
|
[(
kf
,
Kglobal
)]
->
{
thread
=
0
;
entry_point
=
kf
;
stack
=
List
.
rev
acc
}
|
_
->
assert
false
in
aux
[]
cs
(* Stack manipulation *)
let
push
kf
stmt
cs
=
{
cs
with
stack
=
(
kf
,
stmt
)
::
cs
.
stack
}
let
pop
cs
=
match
cs
.
stack
with
|
[]
->
None
|
(
kf
,
stmt
)
::
tail
->
Some
(
kf
,
stmt
,
{
cs
with
stack
=
tail
})
let
top
cs
=
match
cs
.
stack
with
|
[]
->
None
|
(
kf
,
stmt
)
::
_
->
Some
(
kf
,
stmt
)
let
top_kf
cs
=
match
cs
.
stack
with
|
[]
->
cs
.
entry_point
|
(
kf
,
_stmt
)
::
_
->
kf
let
top_callsite
cs
=
match
cs
.
stack
with
|
[]
->
None
|
(
_kf
,
stmt
)
::
_
->
Some
(
stmt
)
(* Conversion *)
let
to_legacy
cs
=
let
l
=
List
.
rev_map
(
fun
(
kf
,
stmt
)
->
(
kf
,
Cil_types
.
Kstmt
stmt
))
cs
.
stack
in
List
.
rev
((
cs
.
entry_point
,
Cil_types
.
Kglobal
)
::
l
)
let
to_kf_list
cs
=
cs
.
entry_point
::
List
.
rev_map
fst
cs
.
stack
let
to_stmt_list
cs
=
List
.
rev_map
snd
cs
.
stack
This diff is collapsed.
Click to expand it.
src/plugins/eva/types/callstack.mli
0 → 100644
+
66
−
0
View file @
d2f16c7e
(**************************************************************************)
(* *)
(* This file is part of Frama-C. *)
(* *)
(* Copyright (C) 2007-2023 *)
(* CEA (Commissariat à l'énergie atomique et aux énergies *)
(* alternatives) *)
(* *)
(* you can redistribute it and/or modify it under the terms of the GNU *)
(* Lesser General Public License as published by the Free Software *)
(* Foundation, version 2.1. *)
(* *)
(* It 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 Lesser General Public License for more details. *)
(* *)
(* See the GNU Lesser General Public License version 2.1 *)
(* for more details (enclosed in the file licenses/LGPLv2.1). *)
(* *)
(**************************************************************************)
[
@@@
api_start
]
(* A call is identified by the function called and the call statement *)
type
call
=
Cil_types
.
kernel_function
*
Cil_types
.
stmt
module
Call
:
Datatype
.
S
with
type
t
=
call
(** [callstack] is used to describe the analysis context when analysing a
function. It contains the thread, the entry point and the list of
calls from the entry point.
This type is very likely to change in the future. Never use this type
directly, prefer the use of the following functions when possible. *)
type
callstack
=
private
{
thread
:
int
;
(* An identifier of the thread's callstack *)
entry_point
:
Cil_types
.
kernel_function
;
(* The first function in the callstack *)
stack
:
call
list
;
}
include
Datatype
.
S
with
type
t
=
callstack
(* Constructors *)
val
init
:
?
thread
:
int
->
Cil_types
.
kernel_function
->
t
val
of_legacy
:
Value_types
.
callstack
->
t
(* Stack manipulation *)
val
push
:
Cil_types
.
kernel_function
->
Cil_types
.
stmt
->
t
->
t
val
pop
:
t
->
(
Cil_types
.
kernel_function
*
Cil_types
.
stmt
*
t
)
option
val
top
:
t
->
(
Cil_types
.
kernel_function
*
Cil_types
.
stmt
)
option
val
top_kf
:
t
->
Cil_types
.
kernel_function
val
top_callsite
:
t
->
Cil_types
.
stmt
option
(* Conversion *)
(** This function is likely to be removed in future versions*)
val
to_legacy
:
t
->
Value_types
.
callstack
(** Gives the list of kf in the callstack from the entry point to the top of the callstack (i.e. reverse order of the call stack). *)
val
to_kf_list
:
t
->
Cil_types
.
kernel_function
list
(** Gives the list of call statements from the bottom to the top of the callstack (i.e. reverse order of the call stack). *)
val
to_stmt_list
:
t
->
Cil_types
.
stmt
list
[
@@@
api_end
]
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