[PATCH] D83571: [LLVM] New carry-less multiplication instruction llvm.experimental.clmul

[Krzysztof Parzyszek via Phabricator via llvm-commits]

kparzysz added inline comments.


================
Comment at: llvm/docs/LangRef.rst:8471
+
+This is not the same as multiplication. It is as if multiplication was done,
+but with no carrying of overflow values. If the operands are polynomials in a
----------------
I would reword this to define what this operation does, then add a remark about how it's different from integer multiplication.  Something like:

"In the scalar version with operands of type iN, both operands are assumed to be polynomials with binary coefficients, where the most significant bit corresponds to the coefficient at x^(N-1).  The operation calculates the result of polynomial multiplication of the operands, modulo x^N.
The vector version treats each element of the input vector as a separate polynomial.

Note that this is different from integer multiplication ..."


CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D83571/new/

https://reviews.llvm.org/D83571