[#BN_mod_lshift1_quick]
= BN&lowbar;mod&lowbar;lshift1&lowbar;quick
:mrdocs:

Compute r &equals; (a &lt;&lt; 1) mod m, assuming 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;lshift1&lowbar;quick(
    xref:BIGNUM.adoc[BIGNUM]* r,
    xref:BIGNUM.adoc[BIGNUM] const* a,
    xref:BIGNUM.adoc[BIGNUM] const* m);
----

== Return Value

1 on success, or 0 on failure&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *r*
| Destination for the result (may alias `a)&period;`
| *a*
| Value to double then reduce&semi; must already be reduced modulo `m&period;`
| *m*
| Modulus&semi; must be positive&period;
|===


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