[#BN_mod_lshift_quick]
= BN&lowbar;mod&lowbar;lshift&lowbar;quick
:mrdocs:

Left&hyphen;shift then reduce quickly&colon; `r` &equals; (`a` &lt;&lt; `n)` mod `m` (assumes 0 &lt;&equals; a &lt; m)&period;

== Synopsis

Declared in `&lt;openssl&sol;bn&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
BN&lowbar;mod&lowbar;lshift&lowbar;quick(
    xref:BIGNUM.adoc[BIGNUM]* r,
    xref:BIGNUM.adoc[BIGNUM] const* a,
    int n,
    xref:BIGNUM.adoc[BIGNUM] const* m);
----

== Return Value

1 on success, or 0 on error&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *r*
| Destination&period;
| *a*
| Value already reduced modulo `m&period;`
| *n*
| Number of bits to shift left (non&hyphen;negative)&period;
| *m*
| Modulus&period;
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#
