diff options
| author | David Howells <dhowells@redhat.com> | 2012-09-21 23:31:13 +0100 |
|---|---|---|
| committer | Rusty Russell <rusty@rustcorp.com.au> | 2012-10-08 13:50:19 +1030 |
| commit | 4520c6a49af833c83de6c74525ce8e07bbe6d783 (patch) | |
| tree | 66b6b43e95cf270e00aa5cb308a12534f33216d9 /scripts/.gitignore | |
| parent | 4f73175d0375a7c1b3ae625e76acee8b39741f28 (diff) | |
| download | linux-3.10-4520c6a49af833c83de6c74525ce8e07bbe6d783.tar.gz linux-3.10-4520c6a49af833c83de6c74525ce8e07bbe6d783.tar.bz2 linux-3.10-4520c6a49af833c83de6c74525ce8e07bbe6d783.zip | |
X.509: Add simple ASN.1 grammar compiler
Add a simple ASN.1 grammar compiler. This produces a bytecode output that can
be fed to a decoder to inform the decoder how to interpret the ASN.1 stream it
is trying to parse.
Action functions can be specified in the grammar by interpolating:
({ foo })
after a type, for example:
SubjectPublicKeyInfo ::= SEQUENCE {
algorithm AlgorithmIdentifier,
subjectPublicKey BIT STRING ({ do_key_data })
}
The decoder is expected to call these after matching this type and parsing the
contents if it is a constructed type.
The grammar compiler does not currently support the SET type (though it does
support SET OF) as I can't see a good way of tracking which members have been
encountered yet without using up extra stack space.
Currently, the grammar compiler will fail if more than 256 bytes of bytecode
would be produced or more than 256 actions have been specified as it uses
8-bit jump values and action indices to keep space usage down.
Signed-off-by: David Howells <dhowells@redhat.com>
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
Diffstat (limited to 'scripts/.gitignore')
| -rw-r--r-- | scripts/.gitignore | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/scripts/.gitignore b/scripts/.gitignore index 65f362d931b..fb070fa1038 100644 --- a/scripts/.gitignore +++ b/scripts/.gitignore @@ -10,3 +10,4 @@ ihex2fw recordmcount docproc sortextable +asn1_compiler |