Changeset View

Standalone View

	Show All 37 Lines
	* size. Resets and overwrites the given scratch space. If the points do not			* size. Resets and overwrites the given scratch space. If the points do not
	* fit in the scratch space the algorithm is repeatedly run with batches of			* fit in the scratch space the algorithm is repeatedly run with batches of
	* points. If no scratch space is given then a simple algorithm is used that			* points. If no scratch space is given then a simple algorithm is used that
	* simply multiplies the points with the corresponding scalars and adds them up.			* simply multiplies the points with the corresponding scalars and adds them up.
	* Returns: 1 on success (including when inp_g_sc is NULL and n is 0)			* Returns: 1 on success (including when inp_g_sc is NULL and n is 0)
	* 0 if there is not enough scratch space for a single point or			* 0 if there is not enough scratch space for a single point or
	* callback returns 0			* callback returns 0
	*/			*/
	static int secp256k1_ecmult_multi_var(const secp256k1_ecmult_context ctx, secp256k1_scratch scratch, secp256k1_gej r, const secp256k1_scalar inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n);			static int secp256k1_ecmult_multi_var(const secp256k1_callback* error_callback, const secp256k1_ecmult_context ctx, secp256k1_scratch scratch, secp256k1_gej r, const secp256k1_scalar inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n);

	#endif /* SECP256K1_ECMULT_H */			#endif /* SECP256K1_ECMULT_H */