Home | History | Annotate | Download | only in ippcp
      1 /*******************************************************************************
      2 * Copyright 2018 Intel Corporation
      3 * All Rights Reserved.
      4 *
      5 * If this  software was obtained  under the  Intel Simplified  Software License,
      6 * the following terms apply:
      7 *
      8 * The source code,  information  and material  ("Material") contained  herein is
      9 * owned by Intel Corporation or its  suppliers or licensors,  and  title to such
     10 * Material remains with Intel  Corporation or its  suppliers or  licensors.  The
     11 * Material  contains  proprietary  information  of  Intel or  its suppliers  and
     12 * licensors.  The Material is protected by  worldwide copyright  laws and treaty
     13 * provisions.  No part  of  the  Material   may  be  used,  copied,  reproduced,
     14 * modified, published,  uploaded, posted, transmitted,  distributed or disclosed
     15 * in any way without Intel's prior express written permission.  No license under
     16 * any patent,  copyright or other  intellectual property rights  in the Material
     17 * is granted to  or  conferred  upon  you,  either   expressly,  by implication,
     18 * inducement,  estoppel  or  otherwise.  Any  license   under such  intellectual
     19 * property rights must be express and approved by Intel in writing.
     20 *
     21 * Unless otherwise agreed by Intel in writing,  you may not remove or alter this
     22 * notice or  any  other  notice   embedded  in  Materials  by  Intel  or Intel's
     23 * suppliers or licensors in any way.
     24 *
     25 *
     26 * If this  software  was obtained  under the  Apache License,  Version  2.0 (the
     27 * "License"), the following terms apply:
     28 *
     29 * You may  not use this  file except  in compliance  with  the License.  You may
     30 * obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
     31 *
     32 *
     33 * Unless  required  by   applicable  law  or  agreed  to  in  writing,  software
     34 * distributed under the License  is distributed  on an  "AS IS"  BASIS,  WITHOUT
     35 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
     36 *
     37 * See the   License  for the   specific  language   governing   permissions  and
     38 * limitations under the License.
     39 *******************************************************************************/
     40 
     41 /*
     42 //     Intel(R) Integrated Performance Primitives. Cryptography Primitives.
     43 //     Operations over GF(p).
     44 //
     45 //     Context:
     46 //        ippsGFpScratchBufferSize
     47 //
     48 */
     49 #include "owndefs.h"
     50 #include "owncp.h"
     51 
     52 #include "pcpgfpstuff.h"
     53 #include "pcpgfpxstuff.h"
     54 #include "pcptool.h"
     55 
     56 
     57 /*F*
     58 // Name: ippsGFpScratchBufferSize
     59 //
     60 // Purpose: Gets the size of the scratch buffer.
     61 //
     62 // Returns:                   Reason:
     63 //    ippStsNullPtrErr          pGFp == NULL
     64 //                              pBufferSize == NULL
     65 //    ippStsContextMatchErr     incorrect pGFp's context id
     66 //    ippStsBadArgErr           0>=nExponents
     67 //                              nExponents>6
     68 //    ippStsNoErr               no error
     69 //
     70 // Parameters:
     71 //    nExponents      Number of exponents.
     72 //    ExpBitSize      Maximum bit size of the exponents.
     73 //    pGFp            Pointer to the context of the finite field.
     74 //    pBufferSize     Pointer to the calculated buffer size in bytes.
     75 //
     76 *F*/
     77 
     78 IPPFUN(IppStatus, ippsGFpScratchBufferSize,(int nExponents, int ExpBitSize, const IppsGFpState* pGFp, int* pBufferSize))
     79 {
     80    IPP_BAD_PTR2_RET(pGFp, pBufferSize);
     81    pGFp = (IppsGFpState*)( IPP_ALIGNED_PTR(pGFp, GFP_ALIGNMENT) );
     82    IPP_BADARG_RET( !GFP_TEST_ID(pGFp), ippStsContextMatchErr );
     83 
     84    IPP_BADARG_RET( 0>=nExponents ||nExponents>IPP_MAX_EXPONENT_NUM, ippStsBadArgErr);
     85    IPP_BADARG_RET( 0>=ExpBitSize, ippStsBadArgErr);
     86 
     87    {
     88       int elmDataSize = GFP_FELEN(GFP_PMA(pGFp))*sizeof(BNU_CHUNK_T);
     89 
     90       /* get window_size */
     91       int w = (nExponents==1)? cpGFpGetOptimalWinSize(ExpBitSize) : /* use optimal window size, if single-scalar operation */
     92                                nExponents;                          /* or pseudo-oprimal if multi-scalar operation */
     93 
     94       /* number of table entries */
     95       int nPrecomputed = 1<<w;
     96 
     97       *pBufferSize = elmDataSize*nPrecomputed + (CACHE_LINE_SIZE-1);
     98 
     99       return ippStsNoErr;
    100    }
    101 }
    102