| 1 |
.. _Security_Hardening_Features: |
| 2 |
|
| 3 |
*************************** |
| 4 |
Security Hardening Features |
| 5 |
*************************** |
| 6 |
|
| 7 |
This chapter describes Ada extensions aimed at security hardening that |
| 8 |
are provided by GNAT. |
| 9 |
|
| 10 |
.. Register Scrubbing: |
| 11 |
|
| 12 |
Register Scrubbing |
| 13 |
================== |
| 14 |
|
| 15 |
GNAT can generate code to zero-out hardware registers before returning |
| 16 |
from a subprogram. |
| 17 |
|
| 18 |
It can be enabled with the *-fzero-call-used-regs* command line |
| 19 |
option, to affect all subprograms in a compilation, and with a |
| 20 |
:samp:`Machine_Attribute` pragma, to affect only specific subprograms. |
| 21 |
|
| 22 |
.. code-block:: ada |
| 23 |
|
| 24 |
procedure Foo; |
| 25 |
pragma Machine_Attribute (Foo, "zero_call_used_regs", "used"); |
| 26 |
-- Before returning, Foo scrubs only call-clobbered registers |
| 27 |
-- that it uses itself. |
| 28 |
|
| 29 |
function Bar return Integer; |
| 30 |
pragma Machine_Attribute (Bar, "zero_call_used_regs", "all"); |
| 31 |
-- Before returning, Bar scrubs all call-clobbered registers. |
| 32 |
|
| 33 |
|
| 34 |
For usage and more details on the command line option, and on the |
| 35 |
``zero_call_used_regs`` attribute, see :title:`Using the GNU Compiler |
| 36 |
Collection (GCC)`. |
| 37 |
|
| 38 |
|
| 39 |
.. Stack Scrubbing: |
| 40 |
|
| 41 |
Stack Scrubbing |
| 42 |
=============== |
| 43 |
|
| 44 |
GNAT can generate code to zero-out stack frames used by subprograms. |
| 45 |
|
| 46 |
It can be activated with the :samp:`Machine_Attribute` pragma, on |
| 47 |
specific subprograms and variables. |
| 48 |
|
| 49 |
.. code-block:: ada |
| 50 |
|
| 51 |
function Foo returns Integer; |
| 52 |
pragma Machine_Attribute (Foo, "strub"); |
| 53 |
-- Foo and its callers are modified so as to scrub the stack |
| 54 |
-- space used by Foo after it returns. |
| 55 |
|
| 56 |
procedure Bar; |
| 57 |
pragma Machine_Attribute (Bar, "strub", "internal"); |
| 58 |
-- Bar is turned into a wrapper for its original body, |
| 59 |
-- and they scrub the stack used by the original body. |
| 60 |
|
| 61 |
Var : Integer; |
| 62 |
pragma Machine_Attribute (Var, "strub"); |
| 63 |
-- Reading from Var in a subprogram enables stack scrubbing |
| 64 |
-- of the stack space used by the subprogram. |
| 65 |
|
| 66 |
|
| 67 |
There are also *-fstrub* command line options to control default |
| 68 |
settings. For usage and more details on the command line option, and |
| 69 |
on the ``strub`` attribute, see :title:`Using the GNU Compiler |
| 70 |
Collection (GCC)`. |
| 71 |
|
| 72 |
Note that Ada secondary stacks are not scrubbed. The restriction |
| 73 |
``No_Secondary_Stack`` avoids their use, and thus their accidental |
| 74 |
preservation of data that should be scrubbed. |
| 75 |
|
| 76 |
Attributes ``Access`` and ``Unconstrained_Access`` of variables and |
| 77 |
constants with ``strub`` enabled require types with ``strub`` enabled; |
| 78 |
there is no way to express an access-to-strub type otherwise. |
| 79 |
``Unchecked_Access`` bypasses this constraint, but the resulting |
| 80 |
access type designates a non-strub type. |
| 81 |
|
| 82 |
.. code-block:: ada |
| 83 |
|
| 84 |
VI : Integer; |
| 85 |
XsVI : access Integer := VI'Access; -- Error. |
| 86 |
UXsVI : access Integer := VI'Unchecked_Access; -- OK, |
| 87 |
-- UXsVI.all does not enable strub in the enclosing subprogram. |
| 88 |
|
| 89 |
type Strub_Int is new Integer; |
| 90 |
pragma Machine_Attribute (Strub_Int, "strub"); |
| 91 |
VSI : Strub_Int; |
| 92 |
XsVSI : access Strub_Int := VSI'Access; -- OK. |
| 93 |
-- XsVSI.all enables strub in the enclosing subprogram. |
| 94 |
|
| 95 |
|
| 96 |
Every access-to-subprogram type, renaming, and overriding and |
| 97 |
overridden dispatching operations that may refer to a subprogram with |
| 98 |
an attribute-modified interface must be annotated with the same |
| 99 |
interface-modifying attribute. Access-to-subprogram types can be |
| 100 |
explicitly converted to different strub modes, as long as they are |
| 101 |
interface-compatible (i.e., adding or removing ``at-calls`` is not |
| 102 |
allowed). For example, a ``strub``-``disabled`` subprogram can be |
| 103 |
turned ``callable`` through such an explicit conversion: |
| 104 |
|
| 105 |
.. code-block:: ada |
| 106 |
|
| 107 |
type TBar is access procedure; |
| 108 |
|
| 109 |
type TBar_Callable is access procedure; |
| 110 |
pragma Machine_Attribute (TBar_Callable, "strub", "callable"); |
| 111 |
|
| 112 |
Bar_Callable_Ptr : constant TBar_Callable |
| 113 |
:= TBar_Callable (TBar'(Bar'Access)); |
| 114 |
|
| 115 |
procedure Bar_Callable renames Bar_Callable_Ptr.all; |
| 116 |
pragma Machine_Attribute (Bar_Callable, "strub", "callable"); |
| 117 |
|
| 118 |
Note that the renaming declaration is expanded to a full subprogram |
| 119 |
body, it won't be just an alias. Only if it is inlined will it be as |
| 120 |
efficient as a call by dereferencing the access-to-subprogram constant |
| 121 |
Bar_Callable_Ptr. |
| 122 |
|
| 123 |
|
| 124 |
.. Hardened Conditionals: |
| 125 |
|
| 126 |
Hardened Conditionals |
| 127 |
===================== |
| 128 |
|
| 129 |
GNAT can harden conditionals to protect against control flow attacks. |
| 130 |
|
| 131 |
This is accomplished by two complementary transformations, each |
| 132 |
activated by a separate command-line option. |
| 133 |
|
| 134 |
The option *-fharden-compares* enables hardening of compares that |
| 135 |
compute results stored in variables, adding verification that the |
| 136 |
reversed compare yields the opposite result. |
| 137 |
|
| 138 |
The option *-fharden-conditional-branches* enables hardening of |
| 139 |
compares that guard conditional branches, adding verification of the |
| 140 |
reversed compare to both execution paths. |
| 141 |
|
| 142 |
These transformations are introduced late in the compilation pipeline, |
| 143 |
long after boolean expressions are decomposed into separate compares, |
| 144 |
each one turned into either a conditional branch or a compare whose |
| 145 |
result is stored in a boolean variable or temporary. Compiler |
| 146 |
optimizations, if enabled, may also turn conditional branches into |
| 147 |
stored compares, and vice-versa, or into operations with implied |
| 148 |
conditionals (e.g. MIN and MAX). Conditionals may also be optimized |
| 149 |
out entirely, if their value can be determined at compile time, and |
| 150 |
occasionally multiple compares can be combined into one. |
| 151 |
|
| 152 |
It is thus difficult to predict which of these two options will affect |
| 153 |
a specific compare operation expressed in source code. Using both |
| 154 |
options ensures that every compare that is neither optimized out nor |
| 155 |
optimized into implied conditionals will be hardened. |
| 156 |
|
| 157 |
The addition of reversed compares can be observed by enabling the dump |
| 158 |
files of the corresponding passes, through command line options |
| 159 |
*-fdump-tree-hardcmp* and *-fdump-tree-hardcbr*, respectively. |
| 160 |
|
| 161 |
They are separate options, however, because of the significantly |
| 162 |
different performance impact of the hardening transformations. |