generic_mpih-add1.c 2.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
  1. /* mpihelp-add_1.c - MPI helper functions
  2. * Copyright (C) 1994, 1996, 1997, 1998,
  3. * 2000 Free Software Foundation, Inc.
  4. *
  5. * This file is part of GnuPG.
  6. *
  7. * GnuPG is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * GnuPG is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
  20. *
  21. * Note: This code is heavily based on the GNU MP Library.
  22. * Actually it's the same code with only minor changes in the
  23. * way the data is stored; this is to support the abstraction
  24. * of an optional secure memory allocation which may be used
  25. * to avoid revealing of sensitive data due to paging etc.
  26. * The GNU MP Library itself is published under the LGPL;
  27. * however I decided to publish this code under the plain GPL.
  28. */
  29. #include "mpi-internal.h"
  30. #include "longlong.h"
  31. mpi_limb_t
  32. mpihelp_add_n(mpi_ptr_t res_ptr, mpi_ptr_t s1_ptr,
  33. mpi_ptr_t s2_ptr, mpi_size_t size)
  34. {
  35. mpi_limb_t x, y, cy;
  36. mpi_size_t j;
  37. /* The loop counter and index J goes from -SIZE to -1. This way
  38. the loop becomes faster. */
  39. j = -size;
  40. /* Offset the base pointers to compensate for the negative indices. */
  41. s1_ptr -= j;
  42. s2_ptr -= j;
  43. res_ptr -= j;
  44. cy = 0;
  45. do {
  46. y = s2_ptr[j];
  47. x = s1_ptr[j];
  48. y += cy; /* add previous carry to one addend */
  49. cy = y < cy; /* get out carry from that addition */
  50. y += x; /* add other addend */
  51. cy += y < x; /* get out carry from that add, combine */
  52. res_ptr[j] = y;
  53. } while (++j);
  54. return cy;
  55. }