Skip to content
Snippets Groups Projects
Select Git revision
  • 6aa68be7c3f285d6f21dc50dca6fe9f3d4b61a51
  • master default protected
  • 9.0
  • 8.0
  • 7.8
  • 7.6
  • 7.4
  • 7.2
  • 7.0
  • 0.6
  • rosuav/latex-markdown-renderer
  • rxnpatch/rxnpatch
  • marcus/gobject-introspection
  • rxnpatch/8.0
  • rosuav/pre-listening-ports
  • nt-tools
  • rosuav/async-annotations
  • rosuav/pgsql-ssl
  • rxnpatch/rxnpatch-broken/2023-10-06T094250
  • grubba/fdlib
  • grubba/wip/sakura/8.0
  • v8.0.2000
  • v8.0.1998
  • v8.0.1996
  • v8.0.1994
  • v8.0.1992
  • v8.0.1990
  • v8.0.1988
  • v8.0.1986
  • rxnpatch/clusters/8.0/2025-04-29T124414
  • rxnpatch/2025-04-29T124414
  • v8.0.1984
  • v8.0.1982
  • v8.0.1980
  • v8.0.1978
  • v8.0.1976
  • v8.0.1974
  • v8.0.1972
  • v8.0.1970
  • v8.0.1968
  • v8.0.1966
41 results

array.h

Blame
  • macros.h 2.54 KiB
    /* macros.h
     *
     */
    
    /* nettle, low-level cryptographics library
     *
     * Copyright (C) 2001 Niels Mller
     *  
     * The nettle library is free software; you can redistribute it and/or modify
     * it under the terms of the GNU Lesser General Public License as published by
     * the Free Software Foundation; either version 2.1 of the License, or (at your
     * option) any later version.
     * 
     * The nettle library is distributed in the hope that it will be useful, but
     * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
     * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
     * License for more details.
     * 
     * You should have received a copy of the GNU Lesser General Public License
     * along with the nettle library; see the file COPYING.LIB.  If not, write to
     * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
     * MA 02111-1307, USA.
     */
    
    #ifndef NETTLE_MACROS_H_INCLUDED
    #define NETTLE_MACROS_H_INCLUDED
    
    /* Reads a 32-bit integer, in network, big-endian, byte order */
    #define READ_UINT32(p)				\
    (  (((uint32_t) (p)[0]) << 24)			\
     | (((uint32_t) (p)[1]) << 16)			\
     | (((uint32_t) (p)[2]) << 8)			\
     |  ((uint32_t) (p)[3]))
    
    #define WRITE_UINT32(p, i)			\
    do {						\
      (p)[0] = ((i) >> 24) & 0xff;			\
      (p)[1] = ((i) >> 16) & 0xff;			\
      (p)[2] = ((i) >> 8) & 0xff;			\
      (p)[3] = (i) & 0xff;				\
    } while(0)
    
    /* Analogous macros, for 24 and 16 bit numbers */
    #define READ_UINT24(p)				\
    (  (((uint32_t) (p)[0]) << 16)			\
     | (((uint32_t) (p)[1]) << 8)			\
     |  ((uint32_t) (p)[2]))
    
    #define WRITE_UINT24(p, i)			\
    do {						\
      (p)[0] = ((i) >> 16) & 0xff;			\
      (p)[1] = ((i) >> 8) & 0xff;			\
      (p)[2] = (i) & 0xff;				\
    } while(0)
    
    #define READ_UINT16(p)				\
    (  (((uint32_t) (p)[0]) << 8)			\
     |  ((uint32_t) (p)[1]))
    
    #define WRITE_UINT16(p, i)			\
    do {						\
      (p)[0] = ((i) >> 8) & 0xff;			\
      (p)[1] = (i) & 0xff;				\
    } while(0)
    
    /* And the other, little-endian, byteorder */
    #define LE_READ_UINT32(p)			\
    (  (((uint32_t) (p)[3]) << 24)			\
     | (((uint32_t) (p)[2]) << 16)			\
     | (((uint32_t) (p)[1]) << 8)			\
     |  ((uint32_t) (p)[0]))
    
    #define LE_WRITE_UINT32(p, i)			\
    do {						\
      (p)[3] = ((i) >> 24) & 0xff;			\
      (p)[2] = ((i) >> 16) & 0xff;			\
      (p)[1] = ((i) >> 8) & 0xff;			\
      (p)[0] = (i) & 0xff;				\
    } while(0)
    
    /* Macro to make it easier to loop over several blocks. */
    #define FOR_BLOCKS(length, dst, src, blocksize)	\
      assert( !((length) % (blocksize)));           \
      for (; (length); ((length) -= (blocksize),	\
    		  (dst) += (blocksize),		\
    		  (src) += (blocksize)) )
    
    #endif /* NETTLE_MACROS_H_INCLUDED */