mirror of
https://github.com/openharmony/third_party_elfutils.git
synced 2026-07-19 19:43:34 -04:00
Mark Wielaard
de2ed97f33
* Change name from "Red Hat elfutils" to "elfutils". * Update license of standalone tools and test from GPLv2 to GPLv3+. * Change license of libraries from GPLv2+exception to GPLv2/LGPLv3+. * Add Developer Certificate of Origin based contributor policy. top-level: - COPYING: Upgraded from GPLv2 to GPLv3. - CONTRIBUTING, COPYING-GPLv2, COPYING-LGPLv3: New files. - NEWS: Added note about new contribution and license policy. - Makefile.am: Updated to GPLv3, added new files to EXTRA_DIST. - configure.ac: Update to GPLv3, changed AC_INIT name to 'elfutils'. backends, lib, libasm, libcpu, libdw, libdwfl, libebl, libelf: - All files updated to GPLv2/LGPLv3+. Except some very small files (<5 lines) which didn't have any headers at all before, the linker .maps files and the libcpu/defs files which only contain data and libelf/elf.h which comes from glibc and is under LGPLv2+. config: - elfutils.spec.in: Add new License: headers and new %doc files. - Update all license headers to GPLv2/LGPLv3+ for files used by libs. src, tests: - All files updated to GPLv3+. Except for the test bz2 data files, the linker maps and script files and some very small files (<5 lines) that don't have any headers. Signed-off-by: Richard Fontana <rfontana@redhat.com> Signed-off-by: Mark Wielaard <mjw@redhat.com>
94 lines
3.2 KiB
C
94 lines
3.2 KiB
C
/* Declaration of functions and data types used for SHA1 sum computing
|
|
library functions.
|
|
Copyright (C) 2008 Red Hat, Inc.
|
|
This file is part of elfutils.
|
|
Written by Ulrich Drepper <drepper@redhat.com>, 2008.
|
|
|
|
This file is free software; you can redistribute it and/or modify
|
|
it under the terms of either
|
|
|
|
* the GNU Lesser General Public License as published by the Free
|
|
Software Foundation; either version 3 of the License, or (at
|
|
your option) any later version
|
|
|
|
or
|
|
|
|
* the GNU General Public License as published by the Free
|
|
Software Foundation; either version 2 of the License, or (at
|
|
your option) any later version
|
|
|
|
or both in parallel, as here.
|
|
|
|
elfutils 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
|
|
General Public License for more details.
|
|
|
|
You should have received copies of the GNU General Public License and
|
|
the GNU Lesser General Public License along with this program. If
|
|
not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
#ifndef _SHA1_H
|
|
#define _SHA1_H 1
|
|
|
|
#include <limits.h>
|
|
#include <stdint.h>
|
|
#include <stdio.h>
|
|
|
|
#define SHA1_DIGEST_SIZE 20
|
|
#define SHA1_BLOCK_SIZE 64
|
|
|
|
typedef uint32_t sha1_uint32;
|
|
typedef uintptr_t sha1_uintptr;
|
|
|
|
/* Structure to save state of computation between the single steps. */
|
|
struct sha1_ctx
|
|
{
|
|
sha1_uint32 A;
|
|
sha1_uint32 B;
|
|
sha1_uint32 C;
|
|
sha1_uint32 D;
|
|
sha1_uint32 E;
|
|
|
|
sha1_uint32 total[2];
|
|
sha1_uint32 buflen;
|
|
char buffer[128] __attribute__ ((__aligned__ (__alignof__ (sha1_uint32))));
|
|
};
|
|
|
|
/* Initialize structure containing state of computation. */
|
|
extern void sha1_init_ctx (struct sha1_ctx *ctx);
|
|
|
|
/* Starting with the result of former calls of this function (or the
|
|
initialization function update the context for the next LEN bytes
|
|
starting at BUFFER.
|
|
It is necessary that LEN is a multiple of 64!!! */
|
|
extern void sha1_process_block (const void *buffer, size_t len,
|
|
struct sha1_ctx *ctx);
|
|
|
|
/* Starting with the result of former calls of this function (or the
|
|
initialization function update the context for the next LEN bytes
|
|
starting at BUFFER.
|
|
It is NOT required that LEN is a multiple of 64. */
|
|
extern void sha1_process_bytes (const void *buffer, size_t len,
|
|
struct sha1_ctx *ctx);
|
|
|
|
/* Process the remaining bytes in the buffer and put result from CTX
|
|
in first 20 bytes following RESBUF. The result is always in little
|
|
endian byte order, so that a byte-wise output yields to the wanted
|
|
ASCII representation of the message digest.
|
|
|
|
IMPORTANT: On some systems it is required that RESBUF is correctly
|
|
aligned for a 32 bits value. */
|
|
extern void *sha1_finish_ctx (struct sha1_ctx *ctx, void *resbuf);
|
|
|
|
|
|
/* Put result from CTX in first 20 bytes following RESBUF. The result is
|
|
always in little endian byte order, so that a byte-wise output yields
|
|
to the wanted ASCII representation of the message digest.
|
|
|
|
IMPORTANT: On some systems it is required that RESBUF is correctly
|
|
aligned for a 32 bits value. */
|
|
extern void *sha1_read_ctx (const struct sha1_ctx *ctx, void *resbuf);
|
|
|
|
#endif /* sha1.h */
|