mirror of
https://github.com/DragonOS-Community/DragonOS.git
synced 2025-06-20 18:26:32 +00:00
删除一些过时的C代码 (#565)
* 删除C版本的crc库 * 删除lockref * 删除过时的libc文档以及wait.c * 删除过时的C版本kfifo代码及文档 * 移除未用到的lz4库 * 删除内核的stdlib.c * 删除fabs.c * fmt * 使得put_string系统调用能够通过tty输出颜色 暂且这样改，这一部分应该是用户层面提供的功能，后续删除 --------- Co-authored-by: GnoCiYeH <heyicong@dragonos.org>
This commit is contained in:
LoGin
GitHub
@ -1,12 +0,0 @@
|
||||
#pragma once
|
||||
#include <common/sys/types.h>
|
||||
|
||||
/**
|
||||
* @brief 计算crc16
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint16_t crc
|
||||
*/
|
||||
uint16_t crc16(uint16_t crc, const uint8_t *buffer, size_t len);
|
||||
@ -1,12 +0,0 @@
|
||||
#pragma once
|
||||
#include <common/sys/types.h>
|
||||
|
||||
/**
|
||||
* @brief 计算crc32
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint32_t crc
|
||||
*/
|
||||
uint32_t crc32(uint32_t crc, const uint8_t *buffer, size_t len);
|
||||
@ -1,12 +0,0 @@
|
||||
#pragma once
|
||||
#include <common/sys/types.h>
|
||||
|
||||
/**
|
||||
* @brief 计算crc64
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint64_t crc
|
||||
*/
|
||||
uint64_t crc64(uint64_t crc, const uint8_t *buffer, size_t len);
|
||||
@ -1,12 +0,0 @@
|
||||
#pragma once
|
||||
#include <common/sys/types.h>
|
||||
|
||||
/**
|
||||
* @brief 计算crc7
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint8_t crc
|
||||
*/
|
||||
uint8_t crc7(uint8_t crc, const uint8_t *buffer, size_t len);
|
||||
@ -1,12 +0,0 @@
|
||||
#pragma once
|
||||
#include <common/sys/types.h>
|
||||
|
||||
/**
|
||||
* @brief 计算crc8
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint8_t crc
|
||||
*/
|
||||
uint8_t crc8(uint8_t crc, const uint8_t *buffer, size_t len);
|
||||
@ -1,153 +0,0 @@
|
||||
#pragma once
|
||||
|
||||
#include <DragonOS/stdint.h>
|
||||
#include <common/spinlock.h>
|
||||
|
||||
struct kfifo_t
|
||||
{
|
||||
uint32_t total_size; // 缓冲区总空间
|
||||
uint32_t size; // 元素所占的字节数
|
||||
uint32_t in_offset; // 入口偏移
|
||||
uint32_t out_offset; // 出口偏移
|
||||
void *buffer; // 缓冲区
|
||||
} __attribute__((aligned(sizeof(long))));
|
||||
|
||||
/**
|
||||
* @brief 忽略kfifo队列中的所有内容，并把输入和输出偏移量都归零
|
||||
*
|
||||
*/
|
||||
#define kfifo_reset(fifo) (void)({ \
|
||||
(fifo)->size = 0; \
|
||||
(fifo)->in_offset = 0; \
|
||||
(fifo)->out_offset = 0; \
|
||||
})
|
||||
|
||||
/**
|
||||
* @brief 忽略kfifo队列中的所有内容，并将输入偏移量赋值给输出偏移量
|
||||
*
|
||||
*/
|
||||
#define kfifo_reset_out(fifo) (void)({ \
|
||||
(fifo)->size = 0; \
|
||||
(fifo)->out_offset = (fifo)->in_offset; \
|
||||
})
|
||||
|
||||
/**
|
||||
* @brief 获取kfifo缓冲区的最大大小
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @return uint32_t 缓冲区最大大小
|
||||
*/
|
||||
#define kfifo_total_size(fifo) ((fifo)->total_size)
|
||||
/**
|
||||
* @brief 获取kfifo缓冲区当前已使用的大小
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @return uint32_t 缓冲区当前已使用的大小
|
||||
*/
|
||||
#define kfifo_size(fifo) ((fifo)->size)
|
||||
|
||||
/**
|
||||
* @brief 判断kfifo缓冲区当前是否为空
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @return uint32_t 0->非空， 1->空
|
||||
*/
|
||||
#define kfifo_empty(fifo) (((fifo)->size == 0) ? 1 : 0)
|
||||
|
||||
/**
|
||||
* @brief 判断kfifo缓冲区当前是否为满
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @return uint32_t 0->不满， 1->满
|
||||
*/
|
||||
#define kfifo_full(fifo) (((fifo)->size == (fifo)->total_size) ? 1 : 0)
|
||||
|
||||
/**
|
||||
* @brief 通过动态方式初始化kfifo缓冲队列
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param size 缓冲区大小
|
||||
* @param reserved 暂时保留，请置为0
|
||||
* @return int 错误码：成功->0
|
||||
*/
|
||||
int kfifo_alloc(struct kfifo_t *fifo, uint32_t size, uint64_t reserved);
|
||||
|
||||
/**
|
||||
* @brief 释放通过kfifo_alloc创建的fifo缓冲区
|
||||
*
|
||||
* @param fifo fifo队列结构体
|
||||
*/
|
||||
void kfifo_free_alloc(struct kfifo_t *fifo);
|
||||
|
||||
/**
|
||||
* @brief 使用指定的缓冲区来初始化kfifo缓冲队列
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param buffer 缓冲区
|
||||
* @param size 缓冲区大小
|
||||
*/
|
||||
void kfifo_init(struct kfifo_t *fifo, void *buffer, uint32_t size);
|
||||
|
||||
/**
|
||||
* @brief 向kfifo缓冲区推入指定大小的数据
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param from 来源数据地址
|
||||
* @param size 数据大小（字节数）
|
||||
* @return uint32_t 推入的数据大小
|
||||
*/
|
||||
uint32_t kfifo_in(struct kfifo_t *fifo, const void *from, uint32_t size);
|
||||
|
||||
/**
|
||||
* @brief 从kfifo缓冲区取出数据，并从队列中删除数据
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param to 拷贝目标地址
|
||||
* @param size 数据大小（字节数）
|
||||
* @return uint32_t 取出的数据大小
|
||||
*/
|
||||
uint32_t kfifo_out(struct kfifo_t *fifo, void *to, uint32_t size);
|
||||
|
||||
/**
|
||||
* @brief 从kfifo缓冲区取出数据，但是不从队列中删除数据
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param to 拷贝目标地址
|
||||
* @param size 数据大小（字节数）
|
||||
* @return uint32_t 取出的数据大小
|
||||
*/
|
||||
uint32_t kfifo_out_peek(struct kfifo_t *fifo, void *to, uint32_t size);
|
||||
|
||||
/**
|
||||
* @brief 向kfifo缓冲区推入指定大小的数据并在过程加锁
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param from 来源数据地址
|
||||
* @param size 数据大小（字节数）
|
||||
* @param lock 自旋锁
|
||||
* @return uint32_t 推入的数据大小
|
||||
*/
|
||||
uint32_t __always_inline kfifo_in_locked(struct kfifo_t *fifo, const void *from, uint32_t size, spinlock_t *lock)
|
||||
{
|
||||
spin_lock(lock);
|
||||
uint32_t retval = kfifo_in(fifo, from, size);
|
||||
spin_unlock(lock);
|
||||
return retval;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 从kfifo缓冲区取出数据，并从队列中删除数据，并在过程加锁
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param to 拷贝目标地址
|
||||
* @param size 数据大小（字节数）
|
||||
* @param lock 自旋锁
|
||||
* @return uint32_t 取出的数据大小
|
||||
*/
|
||||
uint32_t __always_inline kfifo_out_locked(struct kfifo_t *fifo, void *to, uint32_t size, spinlock_t *lock)
|
||||
{
|
||||
spin_lock(lock);
|
||||
uint32_t retval = kfifo_out(fifo, to, size);
|
||||
spin_unlock(lock);
|
||||
return retval;
|
||||
}
|
||||
@ -1,104 +0,0 @@
|
||||
#pragma once
|
||||
|
||||
#include <common/sys/types.h>
|
||||
#include <common/spinlock.h>
|
||||
|
||||
#if ARCH(X86_64)
|
||||
// 仅在x64架构下启用cmpxchg
|
||||
#define __LOCKREF_ENABLE_CMPXCHG__
|
||||
#endif
|
||||
struct lockref
|
||||
{
|
||||
union
|
||||
{
|
||||
#ifdef __LOCKREF_ENABLE_CMPXCHG__
|
||||
aligned_u64 lock_count; // 通过该变量的声明，使得整个lockref按照8字节对齐
|
||||
#endif
|
||||
struct
|
||||
{
|
||||
spinlock_t lock;
|
||||
int count;
|
||||
};
|
||||
};
|
||||
};
|
||||
|
||||
/**
|
||||
* @brief 原子的将引用计数加1
|
||||
*
|
||||
* @param lock_ref 要被操作的lockref变量
|
||||
*/
|
||||
void lockref_inc(struct lockref *lock_ref);
|
||||
|
||||
/**
|
||||
* @brief 原子地将引用计数加1.如果原来的count≤0，则操作失败。
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return bool 操作成功=>true
|
||||
* 操作失败=>false
|
||||
*/
|
||||
bool lockref_inc_not_zero(struct lockref *lock_ref);
|
||||
|
||||
/**
|
||||
* @brief 原子地减少引用计数。如果已处于count≤0的状态，则返回-1
|
||||
*
|
||||
* 本函数与lockref_dec_return()的区别在于，当在cmpxchg()中检测到count<=0或已加锁，本函数会再次尝试通过加锁来执行操作
|
||||
* 而后者会直接返回错误
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return int 操作成功 => 返回新的引用变量值
|
||||
* lockref处于count≤0的状态 => 返回-1
|
||||
*/
|
||||
int lockref_dec(struct lockref *lock_ref);
|
||||
|
||||
/**
|
||||
* @brief 原子地减少引用计数。如果处于已加锁或count≤0的状态，则返回-1
|
||||
*
|
||||
* 本函数与lockref_dec()的区别在于，当在cmpxchg()中检测到count<=0或已加锁，本函数会直接返回错误
|
||||
* 而后者会再次尝试通过加锁来执行操作
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return int 操作成功 => 返回新的引用变量值
|
||||
* lockref处于已加锁或count≤0的状态 => 返回-1
|
||||
*/
|
||||
int lockref_dec_return(struct lockref *lock_ref);
|
||||
|
||||
|
||||
/**
|
||||
* @brief 原子地减少引用计数。若当前的引用计数≤1，则操作失败
|
||||
*
|
||||
* 该函数与lockref_dec_or_lock_not_zero()的区别在于，当cmpxchg()时发现old.count≤1时，该函数会直接返回false.
|
||||
* 而后者在这种情况下，会尝试加锁来进行操作。
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return true 成功将引用计数减1
|
||||
* @return false 如果当前的引用计数≤1，操作失败
|
||||
*/
|
||||
bool lockref_dec_not_zero(struct lockref *lock_ref);
|
||||
|
||||
/**
|
||||
* @brief 原子地减少引用计数。若当前的引用计数≤1，则操作失败
|
||||
*
|
||||
* 该函数与lockref_dec_not_zero()的区别在于，当cmpxchg()时发现old.count≤1时，该函数会尝试加锁来进行操作。
|
||||
* 而后者在这种情况下，会直接返回false.
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return true 成功将引用计数减1
|
||||
* @return false 如果当前的引用计数≤1，操作失败
|
||||
*/
|
||||
bool lockref_dec_or_lock_not_zero(struct lockref *lock_ref);
|
||||
|
||||
/**
|
||||
* @brief 将lockref变量标记为已经死亡（将count设置为负值）
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
*/
|
||||
void lockref_mark_dead(struct lockref * lock_ref);
|
||||
|
||||
/**
|
||||
* @brief 自增引用计数。（除非该lockref已经死亡）
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return true 操作成功
|
||||
* @return false 操作失败，lockref已死亡
|
||||
*/
|
||||
bool lockref_inc_not_dead(struct lockref *lock_ref);
|
||||
@ -1,771 +0,0 @@
|
||||
/*
|
||||
* LZ4 - Fast LZ compression algorithm
|
||||
* Header File
|
||||
* Copyright (C) 2011-present, Yann Collet.
|
||||
|
||||
BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are
|
||||
met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright
|
||||
notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above
|
||||
copyright notice, this list of conditions and the following disclaimer
|
||||
in the documentation and/or other materials provided with the
|
||||
distribution.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
You can contact the author at :
|
||||
- LZ4 homepage : http://www.lz4.org
|
||||
- LZ4 source repository : https://github.com/lz4/lz4
|
||||
*/
|
||||
#if defined(__cplusplus)
|
||||
extern "C"
|
||||
{
|
||||
#endif
|
||||
|
||||
#ifndef LZ4_H_2983827168210
|
||||
#define LZ4_H_2983827168210
|
||||
|
||||
/* --- Dependency --- */
|
||||
#include <common/stddef.h> /* size_t */
|
||||
|
||||
/**
|
||||
Introduction
|
||||
|
||||
LZ4 is lossless compression algorithm, providing compression speed >500 MB/s per core,
|
||||
scalable with multi-cores CPU. It features an extremely fast decoder, with speed in
|
||||
multiple GB/s per core, typically reaching RAM speed limits on multi-core systems.
|
||||
|
||||
The LZ4 compression library provides in-memory compression and decompression functions.
|
||||
It gives full buffer control to user.
|
||||
Compression can be done in:
|
||||
- a single step (described as Simple Functions)
|
||||
- a single step, reusing a context (described in Advanced Functions)
|
||||
- unbounded multiple steps (described as Streaming compression)
|
||||
|
||||
lz4.h generates and decodes LZ4-compressed blocks (doc/lz4_Block_format.md).
|
||||
Decompressing such a compressed block requires additional metadata.
|
||||
Exact metadata depends on exact decompression function.
|
||||
For the typical case of LZ4_decompress_safe(),
|
||||
metadata includes block's compressed size, and maximum bound of decompressed size.
|
||||
Each application is free to encode and pass such metadata in whichever way it wants.
|
||||
|
||||
lz4.h only handle blocks, it can not generate Frames.
|
||||
|
||||
Blocks are different from Frames (doc/lz4_Frame_format.md).
|
||||
Frames bundle both blocks and metadata in a specified manner.
|
||||
Embedding metadata is required for compressed data to be self-contained and portable.
|
||||
Frame format is delivered through a companion API, declared in lz4frame.h.
|
||||
The `lz4` CLI can only manage frames.
|
||||
*/
|
||||
|
||||
/*^***************************************************************
|
||||
* Export parameters
|
||||
*****************************************************************/
|
||||
/*
|
||||
* LZ4_DLL_EXPORT :
|
||||
* Enable exporting of functions when building a Windows DLL
|
||||
* LZ4LIB_VISIBILITY :
|
||||
* Control library symbols visibility.
|
||||
*/
|
||||
#ifndef LZ4LIB_VISIBILITY
|
||||
#if defined(__GNUC__) && (__GNUC__ >= 4)
|
||||
#define LZ4LIB_VISIBILITY __attribute__((visibility("default")))
|
||||
#else
|
||||
#define LZ4LIB_VISIBILITY
|
||||
#endif
|
||||
#endif
|
||||
#if defined(LZ4_DLL_EXPORT) && (LZ4_DLL_EXPORT == 1)
|
||||
#define LZ4LIB_API __declspec(dllexport) LZ4LIB_VISIBILITY
|
||||
#elif defined(LZ4_DLL_IMPORT) && (LZ4_DLL_IMPORT == 1)
|
||||
#define LZ4LIB_API __declspec(dllimport) LZ4LIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
|
||||
#else
|
||||
#define LZ4LIB_API LZ4LIB_VISIBILITY
|
||||
#endif
|
||||
|
||||
/*------ Version ------*/
|
||||
#define LZ4_VERSION_MAJOR 1 /* for breaking interface changes */
|
||||
#define LZ4_VERSION_MINOR 9 /* for new (non-breaking) interface capabilities */
|
||||
#define LZ4_VERSION_RELEASE 3 /* for tweaks, bug-fixes, or development */
|
||||
|
||||
#define LZ4_VERSION_NUMBER (LZ4_VERSION_MAJOR * 100 * 100 + LZ4_VERSION_MINOR * 100 + LZ4_VERSION_RELEASE)
|
||||
|
||||
#define LZ4_LIB_VERSION LZ4_VERSION_MAJOR.LZ4_VERSION_MINOR.LZ4_VERSION_RELEASE
|
||||
#define LZ4_QUOTE(str) #str
|
||||
#define LZ4_EXPAND_AND_QUOTE(str) LZ4_QUOTE(str)
|
||||
#define LZ4_VERSION_STRING LZ4_EXPAND_AND_QUOTE(LZ4_LIB_VERSION)
|
||||
|
||||
LZ4LIB_API int LZ4_versionNumber(void); /**< library version number; useful to check dll version */
|
||||
LZ4LIB_API const char *LZ4_versionString(void); /**< library version string; useful to check dll version */
|
||||
|
||||
/*-************************************
|
||||
* Tuning parameter
|
||||
**************************************/
|
||||
/*!
|
||||
* LZ4_MEMORY_USAGE :
|
||||
* Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
|
||||
* Increasing memory usage improves compression ratio.
|
||||
* Reduced memory usage may improve speed, thanks to better cache locality.
|
||||
* Default value is 14, for 16KB, which nicely fits into Intel x86 L1 cache
|
||||
*/
|
||||
#ifndef LZ4_MEMORY_USAGE
|
||||
#define LZ4_MEMORY_USAGE 14
|
||||
#endif
|
||||
|
||||
/*-************************************
|
||||
* Simple Functions
|
||||
**************************************/
|
||||
/*! LZ4_compress_default() :
|
||||
* Compresses 'srcSize' bytes from buffer 'src'
|
||||
* into already allocated 'dst' buffer of size 'dstCapacity'.
|
||||
* Compression is guaranteed to succeed if 'dstCapacity' >= LZ4_compressBound(srcSize).
|
||||
* It also runs faster, so it's a recommended setting.
|
||||
* If the function cannot compress 'src' into a more limited 'dst' budget,
|
||||
* compression stops *immediately*, and the function result is zero.
|
||||
* In which case, 'dst' content is undefined (invalid).
|
||||
* srcSize : max supported value is LZ4_MAX_INPUT_SIZE.
|
||||
* dstCapacity : size of buffer 'dst' (which must be already allocated)
|
||||
* @return : the number of bytes written into buffer 'dst' (necessarily <= dstCapacity)
|
||||
* or 0 if compression fails
|
||||
* Note : This function is protected against buffer overflow scenarios (never writes outside 'dst' buffer, nor read outside 'source' buffer).
|
||||
*/
|
||||
LZ4LIB_API int LZ4_compress_default(const char *src, char *dst, int srcSize, int dstCapacity);
|
||||
|
||||
/*! LZ4_decompress_safe() :
|
||||
* compressedSize : is the exact complete size of the compressed block.
|
||||
* dstCapacity : is the size of destination buffer (which must be already allocated), presumed an upper bound of decompressed size.
|
||||
* @return : the number of bytes decompressed into destination buffer (necessarily <= dstCapacity)
|
||||
* If destination buffer is not large enough, decoding will stop and output an error code (negative value).
|
||||
* If the source stream is detected malformed, the function will stop decoding and return a negative result.
|
||||
* Note 1 : This function is protected against malicious data packets :
|
||||
* it will never writes outside 'dst' buffer, nor read outside 'source' buffer,
|
||||
* even if the compressed block is maliciously modified to order the decoder to do these actions.
|
||||
* In such case, the decoder stops immediately, and considers the compressed block malformed.
|
||||
* Note 2 : compressedSize and dstCapacity must be provided to the function, the compressed block does not contain them.
|
||||
* The implementation is free to send / store / derive this information in whichever way is most beneficial.
|
||||
* If there is a need for a different format which bundles together both compressed data and its metadata, consider looking at lz4frame.h instead.
|
||||
*/
|
||||
LZ4LIB_API int LZ4_decompress_safe(const char *src, char *dst, int compressedSize, int dstCapacity);
|
||||
|
||||
/*-************************************
|
||||
* Advanced Functions
|
||||
**************************************/
|
||||
#define LZ4_MAX_INPUT_SIZE 0x7E000000 /* 2 113 929 216 bytes */
|
||||
#define LZ4_COMPRESSBOUND(isize) ((unsigned)(isize) > (unsigned)LZ4_MAX_INPUT_SIZE ? 0 : (isize) + ((isize) / 255) + 16)
|
||||
|
||||
/*! LZ4_compressBound() :
|
||||
Provides the maximum size that LZ4 compression may output in a "worst case" scenario (input data not compressible)
|
||||
This function is primarily useful for memory allocation purposes (destination buffer size).
|
||||
Macro LZ4_COMPRESSBOUND() is also provided for compilation-time evaluation (stack memory allocation for example).
|
||||
Note that LZ4_compress_default() compresses faster when dstCapacity is >= LZ4_compressBound(srcSize)
|
||||
inputSize : max supported value is LZ4_MAX_INPUT_SIZE
|
||||
return : maximum output size in a "worst case" scenario
|
||||
or 0, if input size is incorrect (too large or negative)
|
||||
*/
|
||||
LZ4LIB_API int LZ4_compressBound(int inputSize);
|
||||
|
||||
/*! LZ4_compress_fast() :
|
||||
Same as LZ4_compress_default(), but allows selection of "acceleration" factor.
|
||||
The larger the acceleration value, the faster the algorithm, but also the lesser the compression.
|
||||
It's a trade-off. It can be fine tuned, with each successive value providing roughly +~3% to speed.
|
||||
An acceleration value of "1" is the same as regular LZ4_compress_default()
|
||||
Values <= 0 will be replaced by LZ4_ACCELERATION_DEFAULT (currently == 1, see lz4.c).
|
||||
Values > LZ4_ACCELERATION_MAX will be replaced by LZ4_ACCELERATION_MAX (currently == 65537, see lz4.c).
|
||||
*/
|
||||
LZ4LIB_API int LZ4_compress_fast(const char *src, char *dst, int srcSize, int dstCapacity, int acceleration);
|
||||
|
||||
/*! LZ4_compress_fast_extState() :
|
||||
* Same as LZ4_compress_fast(), using an externally allocated memory space for its state.
|
||||
* Use LZ4_sizeofState() to know how much memory must be allocated,
|
||||
* and allocate it on 8-bytes boundaries (using `malloc()` typically).
|
||||
* Then, provide this buffer as `void* state` to compression function.
|
||||
*/
|
||||
LZ4LIB_API int LZ4_sizeofState(void);
|
||||
LZ4LIB_API int LZ4_compress_fast_extState(void *state, const char *src, char *dst, int srcSize, int dstCapacity, int acceleration);
|
||||
|
||||
/*! LZ4_compress_destSize() :
|
||||
* Reverse the logic : compresses as much data as possible from 'src' buffer
|
||||
* into already allocated buffer 'dst', of size >= 'targetDestSize'.
|
||||
* This function either compresses the entire 'src' content into 'dst' if it's large enough,
|
||||
* or fill 'dst' buffer completely with as much data as possible from 'src'.
|
||||
* note: acceleration parameter is fixed to "default".
|
||||
*
|
||||
* *srcSizePtr : will be modified to indicate how many bytes where read from 'src' to fill 'dst'.
|
||||
* New value is necessarily <= input value.
|
||||
* @return : Nb bytes written into 'dst' (necessarily <= targetDestSize)
|
||||
* or 0 if compression fails.
|
||||
*
|
||||
* Note : from v1.8.2 to v1.9.1, this function had a bug (fixed un v1.9.2+):
|
||||
* the produced compressed content could, in specific circumstances,
|
||||
* require to be decompressed into a destination buffer larger
|
||||
* by at least 1 byte than the content to decompress.
|
||||
* If an application uses `LZ4_compress_destSize()`,
|
||||
* it's highly recommended to update liblz4 to v1.9.2 or better.
|
||||
* If this can't be done or ensured,
|
||||
* the receiving decompression function should provide
|
||||
* a dstCapacity which is > decompressedSize, by at least 1 byte.
|
||||
* See https://github.com/lz4/lz4/issues/859 for details
|
||||
*/
|
||||
LZ4LIB_API int LZ4_compress_destSize(const char *src, char *dst, int *srcSizePtr, int targetDstSize);
|
||||
|
||||
/*! LZ4_decompress_safe_partial() :
|
||||
* Decompress an LZ4 compressed block, of size 'srcSize' at position 'src',
|
||||
* into destination buffer 'dst' of size 'dstCapacity'.
|
||||
* Up to 'targetOutputSize' bytes will be decoded.
|
||||
* The function stops decoding on reaching this objective.
|
||||
* This can be useful to boost performance
|
||||
* whenever only the beginning of a block is required.
|
||||
*
|
||||
* @return : the number of bytes decoded in `dst` (necessarily <= targetOutputSize)
|
||||
* If source stream is detected malformed, function returns a negative result.
|
||||
*
|
||||
* Note 1 : @return can be < targetOutputSize, if compressed block contains less data.
|
||||
*
|
||||
* Note 2 : targetOutputSize must be <= dstCapacity
|
||||
*
|
||||
* Note 3 : this function effectively stops decoding on reaching targetOutputSize,
|
||||
* so dstCapacity is kind of redundant.
|
||||
* This is because in older versions of this function,
|
||||
* decoding operation would still write complete sequences.
|
||||
* Therefore, there was no guarantee that it would stop writing at exactly targetOutputSize,
|
||||
* it could write more bytes, though only up to dstCapacity.
|
||||
* Some "margin" used to be required for this operation to work properly.
|
||||
* Thankfully, this is no longer necessary.
|
||||
* The function nonetheless keeps the same signature, in an effort to preserve API compatibility.
|
||||
*
|
||||
* Note 4 : If srcSize is the exact size of the block,
|
||||
* then targetOutputSize can be any value,
|
||||
* including larger than the block's decompressed size.
|
||||
* The function will, at most, generate block's decompressed size.
|
||||
*
|
||||
* Note 5 : If srcSize is _larger_ than block's compressed size,
|
||||
* then targetOutputSize **MUST** be <= block's decompressed size.
|
||||
* Otherwise, *silent corruption will occur*.
|
||||
*/
|
||||
LZ4LIB_API int LZ4_decompress_safe_partial(const char *src, char *dst, int srcSize, int targetOutputSize, int dstCapacity);
|
||||
|
||||
/*-*********************************************
|
||||
* Streaming Compression Functions
|
||||
***********************************************/
|
||||
typedef union LZ4_stream_u LZ4_stream_t; /* incomplete type (defined later) */
|
||||
|
||||
LZ4LIB_API LZ4_stream_t *LZ4_createStream(void);
|
||||
LZ4LIB_API int LZ4_freeStream(LZ4_stream_t *streamPtr);
|
||||
|
||||
/*! LZ4_resetStream_fast() : v1.9.0+
|
||||
* Use this to prepare an LZ4_stream_t for a new chain of dependent blocks
|
||||
* (e.g., LZ4_compress_fast_continue()).
|
||||
*
|
||||
* An LZ4_stream_t must be initialized once before usage.
|
||||
* This is automatically done when created by LZ4_createStream().
|
||||
* However, should the LZ4_stream_t be simply declared on stack (for example),
|
||||
* it's necessary to initialize it first, using LZ4_initStream().
|
||||
*
|
||||
* After init, start any new stream with LZ4_resetStream_fast().
|
||||
* A same LZ4_stream_t can be re-used multiple times consecutively
|
||||
* and compress multiple streams,
|
||||
* provided that it starts each new stream with LZ4_resetStream_fast().
|
||||
*
|
||||
* LZ4_resetStream_fast() is much faster than LZ4_initStream(),
|
||||
* but is not compatible with memory regions containing garbage data.
|
||||
*
|
||||
* Note: it's only useful to call LZ4_resetStream_fast()
|
||||
* in the context of streaming compression.
|
||||
* The *extState* functions perform their own resets.
|
||||
* Invoking LZ4_resetStream_fast() before is redundant, and even counterproductive.
|
||||
*/
|
||||
LZ4LIB_API void LZ4_resetStream_fast(LZ4_stream_t *streamPtr);
|
||||
|
||||
/*! LZ4_loadDict() :
|
||||
* Use this function to reference a static dictionary into LZ4_stream_t.
|
||||
* The dictionary must remain available during compression.
|
||||
* LZ4_loadDict() triggers a reset, so any previous data will be forgotten.
|
||||
* The same dictionary will have to be loaded on decompression side for successful decoding.
|
||||
* Dictionary are useful for better compression of small data (KB range).
|
||||
* While LZ4 accept any input as dictionary,
|
||||
* results are generally better when using Zstandard's Dictionary Builder.
|
||||
* Loading a size of 0 is allowed, and is the same as reset.
|
||||
* @return : loaded dictionary size, in bytes (necessarily <= 64 KB)
|
||||
*/
|
||||
LZ4LIB_API int LZ4_loadDict(LZ4_stream_t *streamPtr, const char *dictionary, int dictSize);
|
||||
|
||||
/*! LZ4_compress_fast_continue() :
|
||||
* Compress 'src' content using data from previously compressed blocks, for better compression ratio.
|
||||
* 'dst' buffer must be already allocated.
|
||||
* If dstCapacity >= LZ4_compressBound(srcSize), compression is guaranteed to succeed, and runs faster.
|
||||
*
|
||||
* @return : size of compressed block
|
||||
* or 0 if there is an error (typically, cannot fit into 'dst').
|
||||
*
|
||||
* Note 1 : Each invocation to LZ4_compress_fast_continue() generates a new block.
|
||||
* Each block has precise boundaries.
|
||||
* Each block must be decompressed separately, calling LZ4_decompress_*() with relevant metadata.
|
||||
* It's not possible to append blocks together and expect a single invocation of LZ4_decompress_*() to decompress them together.
|
||||
*
|
||||
* Note 2 : The previous 64KB of source data is __assumed__ to remain present, unmodified, at same address in memory !
|
||||
*
|
||||
* Note 3 : When input is structured as a double-buffer, each buffer can have any size, including < 64 KB.
|
||||
* Make sure that buffers are separated, by at least one byte.
|
||||
* This construction ensures that each block only depends on previous block.
|
||||
*
|
||||
* Note 4 : If input buffer is a ring-buffer, it can have any size, including < 64 KB.
|
||||
*
|
||||
* Note 5 : After an error, the stream status is undefined (invalid), it can only be reset or freed.
|
||||
*/
|
||||
LZ4LIB_API int LZ4_compress_fast_continue(LZ4_stream_t *streamPtr, const char *src, char *dst, int srcSize, int dstCapacity, int acceleration);
|
||||
|
||||
/*! LZ4_saveDict() :
|
||||
* If last 64KB data cannot be guaranteed to remain available at its current memory location,
|
||||
* save it into a safer place (char* safeBuffer).
|
||||
* This is schematically equivalent to a memcpy() followed by LZ4_loadDict(),
|
||||
* but is much faster, because LZ4_saveDict() doesn't need to rebuild tables.
|
||||
* @return : saved dictionary size in bytes (necessarily <= maxDictSize), or 0 if error.
|
||||
*/
|
||||
LZ4LIB_API int LZ4_saveDict(LZ4_stream_t *streamPtr, char *safeBuffer, int maxDictSize);
|
||||
|
||||
/*-**********************************************
|
||||
* Streaming Decompression Functions
|
||||
* Bufferless synchronous API
|
||||
************************************************/
|
||||
typedef union LZ4_streamDecode_u LZ4_streamDecode_t; /* tracking context */
|
||||
|
||||
/*! LZ4_createStreamDecode() and LZ4_freeStreamDecode() :
|
||||
* creation / destruction of streaming decompression tracking context.
|
||||
* A tracking context can be re-used multiple times.
|
||||
*/
|
||||
LZ4LIB_API LZ4_streamDecode_t *LZ4_createStreamDecode(void);
|
||||
LZ4LIB_API int LZ4_freeStreamDecode(LZ4_streamDecode_t *LZ4_stream);
|
||||
|
||||
/*! LZ4_setStreamDecode() :
|
||||
* An LZ4_streamDecode_t context can be allocated once and re-used multiple times.
|
||||
* Use this function to start decompression of a new stream of blocks.
|
||||
* A dictionary can optionally be set. Use NULL or size 0 for a reset order.
|
||||
* Dictionary is presumed stable : it must remain accessible and unmodified during next decompression.
|
||||
* @return : 1 if OK, 0 if error
|
||||
*/
|
||||
LZ4LIB_API int LZ4_setStreamDecode(LZ4_streamDecode_t *LZ4_streamDecode, const char *dictionary, int dictSize);
|
||||
|
||||
/*! LZ4_decoderRingBufferSize() : v1.8.2+
|
||||
* Note : in a ring buffer scenario (optional),
|
||||
* blocks are presumed decompressed next to each other
|
||||
* up to the moment there is not enough remaining space for next block (remainingSize < maxBlockSize),
|
||||
* at which stage it resumes from beginning of ring buffer.
|
||||
* When setting such a ring buffer for streaming decompression,
|
||||
* provides the minimum size of this ring buffer
|
||||
* to be compatible with any source respecting maxBlockSize condition.
|
||||
* @return : minimum ring buffer size,
|
||||
* or 0 if there is an error (invalid maxBlockSize).
|
||||
*/
|
||||
LZ4LIB_API int LZ4_decoderRingBufferSize(int maxBlockSize);
|
||||
#define LZ4_DECODER_RING_BUFFER_SIZE(maxBlockSize) (65536 + 14 + (maxBlockSize)) /* for static allocation; maxBlockSize presumed valid */
|
||||
|
||||
/*! LZ4_decompress_*_continue() :
|
||||
* These decoding functions allow decompression of consecutive blocks in "streaming" mode.
|
||||
* A block is an unsplittable entity, it must be presented entirely to a decompression function.
|
||||
* Decompression functions only accepts one block at a time.
|
||||
* The last 64KB of previously decoded data *must* remain available and unmodified at the memory position where they were decoded.
|
||||
* If less than 64KB of data has been decoded, all the data must be present.
|
||||
*
|
||||
* Special : if decompression side sets a ring buffer, it must respect one of the following conditions :
|
||||
* - Decompression buffer size is _at least_ LZ4_decoderRingBufferSize(maxBlockSize).
|
||||
* maxBlockSize is the maximum size of any single block. It can have any value > 16 bytes.
|
||||
* In which case, encoding and decoding buffers do not need to be synchronized.
|
||||
* Actually, data can be produced by any source compliant with LZ4 format specification, and respecting maxBlockSize.
|
||||
* - Synchronized mode :
|
||||
* Decompression buffer size is _exactly_ the same as compression buffer size,
|
||||
* and follows exactly same update rule (block boundaries at same positions),
|
||||
* and decoding function is provided with exact decompressed size of each block (exception for last block of the stream),
|
||||
* _then_ decoding & encoding ring buffer can have any size, including small ones ( < 64 KB).
|
||||
* - Decompression buffer is larger than encoding buffer, by a minimum of maxBlockSize more bytes.
|
||||
* In which case, encoding and decoding buffers do not need to be synchronized,
|
||||
* and encoding ring buffer can have any size, including small ones ( < 64 KB).
|
||||
*
|
||||
* Whenever these conditions are not possible,
|
||||
* save the last 64KB of decoded data into a safe buffer where it can't be modified during decompression,
|
||||
* then indicate where this data is saved using LZ4_setStreamDecode(), before decompressing next block.
|
||||
*/
|
||||
LZ4LIB_API int LZ4_decompress_safe_continue(LZ4_streamDecode_t *LZ4_streamDecode, const char *src, char *dst, int srcSize, int dstCapacity);
|
||||
|
||||
/*! LZ4_decompress_*_usingDict() :
|
||||
* These decoding functions work the same as
|
||||
* a combination of LZ4_setStreamDecode() followed by LZ4_decompress_*_continue()
|
||||
* They are stand-alone, and don't need an LZ4_streamDecode_t structure.
|
||||
* Dictionary is presumed stable : it must remain accessible and unmodified during decompression.
|
||||
* Performance tip : Decompression speed can be substantially increased
|
||||
* when dst == dictStart + dictSize.
|
||||
*/
|
||||
LZ4LIB_API int LZ4_decompress_safe_usingDict(const char *src, char *dst, int srcSize, int dstCapcity, const char *dictStart, int dictSize);
|
||||
|
||||
#endif /* LZ4_H_2983827168210 */
|
||||
|
||||
/*^*************************************
|
||||
* !!!!!! STATIC LINKING ONLY !!!!!!
|
||||
***************************************/
|
||||
|
||||
/*-****************************************************************************
|
||||
* Experimental section
|
||||
*
|
||||
* Symbols declared in this section must be considered unstable. Their
|
||||
* signatures or semantics may change, or they may be removed altogether in the
|
||||
* future. They are therefore only safe to depend on when the caller is
|
||||
* statically linked against the library.
|
||||
*
|
||||
* To protect against unsafe usage, not only are the declarations guarded,
|
||||
* the definitions are hidden by default
|
||||
* when building LZ4 as a shared/dynamic library.
|
||||
*
|
||||
* In order to access these declarations,
|
||||
* define LZ4_STATIC_LINKING_ONLY in your application
|
||||
* before including LZ4's headers.
|
||||
*
|
||||
* In order to make their implementations accessible dynamically, you must
|
||||
* define LZ4_PUBLISH_STATIC_FUNCTIONS when building the LZ4 library.
|
||||
******************************************************************************/
|
||||
|
||||
#ifdef LZ4_STATIC_LINKING_ONLY
|
||||
|
||||
#ifndef LZ4_STATIC_3504398509
|
||||
#define LZ4_STATIC_3504398509
|
||||
|
||||
#ifdef LZ4_PUBLISH_STATIC_FUNCTIONS
|
||||
#define LZ4LIB_STATIC_API LZ4LIB_API
|
||||
#else
|
||||
#define LZ4LIB_STATIC_API
|
||||
#endif
|
||||
|
||||
/*! LZ4_compress_fast_extState_fastReset() :
|
||||
* A variant of LZ4_compress_fast_extState().
|
||||
*
|
||||
* Using this variant avoids an expensive initialization step.
|
||||
* It is only safe to call if the state buffer is known to be correctly initialized already
|
||||
* (see above comment on LZ4_resetStream_fast() for a definition of "correctly initialized").
|
||||
* From a high level, the difference is that
|
||||
* this function initializes the provided state with a call to something like LZ4_resetStream_fast()
|
||||
* while LZ4_compress_fast_extState() starts with a call to LZ4_resetStream().
|
||||
*/
|
||||
LZ4LIB_STATIC_API int LZ4_compress_fast_extState_fastReset(void *state, const char *src, char *dst, int srcSize, int dstCapacity, int acceleration);
|
||||
|
||||
/*! LZ4_attach_dictionary() :
|
||||
* This is an experimental API that allows
|
||||
* efficient use of a static dictionary many times.
|
||||
*
|
||||
* Rather than re-loading the dictionary buffer into a working context before
|
||||
* each compression, or copying a pre-loaded dictionary's LZ4_stream_t into a
|
||||
* working LZ4_stream_t, this function introduces a no-copy setup mechanism,
|
||||
* in which the working stream references the dictionary stream in-place.
|
||||
*
|
||||
* Several assumptions are made about the state of the dictionary stream.
|
||||
* Currently, only streams which have been prepared by LZ4_loadDict() should
|
||||
* be expected to work.
|
||||
*
|
||||
* Alternatively, the provided dictionaryStream may be NULL,
|
||||
* in which case any existing dictionary stream is unset.
|
||||
*
|
||||
* If a dictionary is provided, it replaces any pre-existing stream history.
|
||||
* The dictionary contents are the only history that can be referenced and
|
||||
* logically immediately precede the data compressed in the first subsequent
|
||||
* compression call.
|
||||
*
|
||||
* The dictionary will only remain attached to the working stream through the
|
||||
* first compression call, at the end of which it is cleared. The dictionary
|
||||
* stream (and source buffer) must remain in-place / accessible / unchanged
|
||||
* through the completion of the first compression call on the stream.
|
||||
*/
|
||||
LZ4LIB_STATIC_API void LZ4_attach_dictionary(LZ4_stream_t *workingStream, const LZ4_stream_t *dictionaryStream);
|
||||
|
||||
/*! In-place compression and decompression
|
||||
*
|
||||
* It's possible to have input and output sharing the same buffer,
|
||||
* for highly contrained memory environments.
|
||||
* In both cases, it requires input to lay at the end of the buffer,
|
||||
* and decompression to start at beginning of the buffer.
|
||||
* Buffer size must feature some margin, hence be larger than final size.
|
||||
*
|
||||
* |<------------------------buffer--------------------------------->|
|
||||
* |<-----------compressed data--------->|
|
||||
* |<-----------decompressed size------------------>|
|
||||
* |<----margin---->|
|
||||
*
|
||||
* This technique is more useful for decompression,
|
||||
* since decompressed size is typically larger,
|
||||
* and margin is short.
|
||||
*
|
||||
* In-place decompression will work inside any buffer
|
||||
* which size is >= LZ4_DECOMPRESS_INPLACE_BUFFER_SIZE(decompressedSize).
|
||||
* This presumes that decompressedSize > compressedSize.
|
||||
* Otherwise, it means compression actually expanded data,
|
||||
* and it would be more efficient to store such data with a flag indicating it's not compressed.
|
||||
* This can happen when data is not compressible (already compressed, or encrypted).
|
||||
*
|
||||
* For in-place compression, margin is larger, as it must be able to cope with both
|
||||
* history preservation, requiring input data to remain unmodified up to LZ4_DISTANCE_MAX,
|
||||
* and data expansion, which can happen when input is not compressible.
|
||||
* As a consequence, buffer size requirements are much higher,
|
||||
* and memory savings offered by in-place compression are more limited.
|
||||
*
|
||||
* There are ways to limit this cost for compression :
|
||||
* - Reduce history size, by modifying LZ4_DISTANCE_MAX.
|
||||
* Note that it is a compile-time constant, so all compressions will apply this limit.
|
||||
* Lower values will reduce compression ratio, except when input_size < LZ4_DISTANCE_MAX,
|
||||
* so it's a reasonable trick when inputs are known to be small.
|
||||
* - Require the compressor to deliver a "maximum compressed size".
|
||||
* This is the `dstCapacity` parameter in `LZ4_compress*()`.
|
||||
* When this size is < LZ4_COMPRESSBOUND(inputSize), then compression can fail,
|
||||
* in which case, the return code will be 0 (zero).
|
||||
* The caller must be ready for these cases to happen,
|
||||
* and typically design a backup scheme to send data uncompressed.
|
||||
* The combination of both techniques can significantly reduce
|
||||
* the amount of margin required for in-place compression.
|
||||
*
|
||||
* In-place compression can work in any buffer
|
||||
* which size is >= (maxCompressedSize)
|
||||
* with maxCompressedSize == LZ4_COMPRESSBOUND(srcSize) for guaranteed compression success.
|
||||
* LZ4_COMPRESS_INPLACE_BUFFER_SIZE() depends on both maxCompressedSize and LZ4_DISTANCE_MAX,
|
||||
* so it's possible to reduce memory requirements by playing with them.
|
||||
*/
|
||||
|
||||
#define LZ4_DECOMPRESS_INPLACE_MARGIN(compressedSize) (((compressedSize) >> 8) + 32)
|
||||
#define LZ4_DECOMPRESS_INPLACE_BUFFER_SIZE(decompressedSize) ((decompressedSize) + LZ4_DECOMPRESS_INPLACE_MARGIN(decompressedSize)) /**< note: presumes that compressedSize < decompressedSize. note2: margin is overestimated a bit, since it could use compressedSize instead */
|
||||
|
||||
#ifndef LZ4_DISTANCE_MAX /* history window size; can be user-defined at compile time */
|
||||
#define LZ4_DISTANCE_MAX 65535 /* set to maximum value by default */
|
||||
#endif
|
||||
|
||||
#define LZ4_COMPRESS_INPLACE_MARGIN (LZ4_DISTANCE_MAX + 32) /* LZ4_DISTANCE_MAX can be safely replaced by srcSize when it's smaller */
|
||||
#define LZ4_COMPRESS_INPLACE_BUFFER_SIZE(maxCompressedSize) ((maxCompressedSize) + LZ4_COMPRESS_INPLACE_MARGIN) /**< maxCompressedSize is generally LZ4_COMPRESSBOUND(inputSize), but can be set to any lower value, with the risk that compression can fail (return code 0(zero)) */
|
||||
|
||||
#endif /* LZ4_STATIC_3504398509 */
|
||||
#endif /* LZ4_STATIC_LINKING_ONLY */
|
||||
|
||||
#ifndef LZ4_H_98237428734687
|
||||
#define LZ4_H_98237428734687
|
||||
|
||||
/*-************************************************************
|
||||
* Private Definitions
|
||||
**************************************************************
|
||||
* Do not use these definitions directly.
|
||||
* They are only exposed to allow static allocation of `LZ4_stream_t` and `LZ4_streamDecode_t`.
|
||||
* Accessing members will expose user code to API and/or ABI break in future versions of the library.
|
||||
**************************************************************/
|
||||
#define LZ4_HASHLOG (LZ4_MEMORY_USAGE - 2)
|
||||
#define LZ4_HASHTABLESIZE (1 << LZ4_MEMORY_USAGE)
|
||||
#define LZ4_HASH_SIZE_U32 (1 << LZ4_HASHLOG) /* required as macro for static allocation */
|
||||
|
||||
#if defined(__cplusplus) || (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
|
||||
#include <DragonOS/stdint.h>
|
||||
typedef int8_t LZ4_i8;
|
||||
typedef uint8_t LZ4_byte;
|
||||
typedef uint16_t LZ4_u16;
|
||||
typedef uint32_t LZ4_u32;
|
||||
#else
|
||||
typedef signed char LZ4_i8;
|
||||
typedef unsigned char LZ4_byte;
|
||||
typedef unsigned short LZ4_u16;
|
||||
typedef unsigned int LZ4_u32;
|
||||
#endif
|
||||
|
||||
typedef struct LZ4_stream_t_internal LZ4_stream_t_internal;
|
||||
struct LZ4_stream_t_internal
|
||||
{
|
||||
LZ4_u32 hashTable[LZ4_HASH_SIZE_U32];
|
||||
LZ4_u32 currentOffset;
|
||||
LZ4_u32 tableType;
|
||||
const LZ4_byte *dictionary;
|
||||
const LZ4_stream_t_internal *dictCtx;
|
||||
LZ4_u32 dictSize;
|
||||
};
|
||||
|
||||
typedef struct
|
||||
{
|
||||
const LZ4_byte *externalDict;
|
||||
size_t extDictSize;
|
||||
const LZ4_byte *prefixEnd;
|
||||
size_t prefixSize;
|
||||
} LZ4_streamDecode_t_internal;
|
||||
|
||||
/*! LZ4_stream_t :
|
||||
* Do not use below internal definitions directly !
|
||||
* Declare or allocate an LZ4_stream_t instead.
|
||||
* LZ4_stream_t can also be created using LZ4_createStream(), which is recommended.
|
||||
* The structure definition can be convenient for static allocation
|
||||
* (on stack, or as part of larger structure).
|
||||
* Init this structure with LZ4_initStream() before first use.
|
||||
* note : only use this definition in association with static linking !
|
||||
* this definition is not API/ABI safe, and may change in future versions.
|
||||
*/
|
||||
#define LZ4_STREAMSIZE 16416 /* static size, for inter-version compatibility */
|
||||
#define LZ4_STREAMSIZE_VOIDP (LZ4_STREAMSIZE / sizeof(void *))
|
||||
union LZ4_stream_u
|
||||
{
|
||||
void *table[LZ4_STREAMSIZE_VOIDP];
|
||||
LZ4_stream_t_internal internal_donotuse;
|
||||
}; /* previously typedef'd to LZ4_stream_t */
|
||||
|
||||
/*! LZ4_initStream() : v1.9.0+
|
||||
* An LZ4_stream_t structure must be initialized at least once.
|
||||
* This is automatically done when invoking LZ4_createStream(),
|
||||
* but it's not when the structure is simply declared on stack (for example).
|
||||
*
|
||||
* Use LZ4_initStream() to properly initialize a newly declared LZ4_stream_t.
|
||||
* It can also initialize any arbitrary buffer of sufficient size,
|
||||
* and will @return a pointer of proper type upon initialization.
|
||||
*
|
||||
* Note : initialization fails if size and alignment conditions are not respected.
|
||||
* In which case, the function will @return NULL.
|
||||
* Note2: An LZ4_stream_t structure guarantees correct alignment and size.
|
||||
* Note3: Before v1.9.0, use LZ4_resetStream() instead
|
||||
*/
|
||||
LZ4LIB_API LZ4_stream_t *LZ4_initStream(void *buffer, size_t size);
|
||||
|
||||
/*! LZ4_streamDecode_t :
|
||||
* information structure to track an LZ4 stream during decompression.
|
||||
* init this structure using LZ4_setStreamDecode() before first use.
|
||||
* note : only use in association with static linking !
|
||||
* this definition is not API/ABI safe,
|
||||
* and may change in a future version !
|
||||
*/
|
||||
#define LZ4_STREAMDECODESIZE_U64 (4 + ((sizeof(void *) == 16) ? 2 : 0) /*AS-400*/)
|
||||
#define LZ4_STREAMDECODESIZE (LZ4_STREAMDECODESIZE_U64 * sizeof(unsigned long long))
|
||||
union LZ4_streamDecode_u
|
||||
{
|
||||
unsigned long long table[LZ4_STREAMDECODESIZE_U64];
|
||||
LZ4_streamDecode_t_internal internal_donotuse;
|
||||
}; /* previously typedef'd to LZ4_streamDecode_t */
|
||||
|
||||
/*-************************************
|
||||
* Obsolete Functions
|
||||
**************************************/
|
||||
|
||||
/*! Deprecation warnings
|
||||
*
|
||||
* Deprecated functions make the compiler generate a warning when invoked.
|
||||
* This is meant to invite users to update their source code.
|
||||
* Should deprecation warnings be a problem, it is generally possible to disable them,
|
||||
* typically with -Wno-deprecated-declarations for gcc
|
||||
* or _CRT_SECURE_NO_WARNINGS in Visual.
|
||||
*
|
||||
* Another method is to define LZ4_DISABLE_DEPRECATE_WARNINGS
|
||||
* before including the header file.
|
||||
*/
|
||||
#ifdef LZ4_DISABLE_DEPRECATE_WARNINGS
|
||||
#define LZ4_DEPRECATED(message) /* disable deprecation warnings */
|
||||
#else
|
||||
#if defined(__cplusplus) && (__cplusplus >= 201402) /* C++14 or greater */
|
||||
#define LZ4_DEPRECATED(message) [[deprecated(message)]]
|
||||
#elif defined(_MSC_VER)
|
||||
#define LZ4_DEPRECATED(message) __declspec(deprecated(message))
|
||||
#elif defined(__clang__) || (defined(__GNUC__) && (__GNUC__ * 10 + __GNUC_MINOR__ >= 45))
|
||||
#define LZ4_DEPRECATED(message) __attribute__((deprecated(message)))
|
||||
#elif defined(__GNUC__) && (__GNUC__ * 10 + __GNUC_MINOR__ >= 31)
|
||||
#define LZ4_DEPRECATED(message) __attribute__((deprecated))
|
||||
#else
|
||||
#pragma message("WARNING: LZ4_DEPRECATED needs custom implementation for this compiler")
|
||||
#define LZ4_DEPRECATED(message) /* disabled */
|
||||
#endif
|
||||
#endif /* LZ4_DISABLE_DEPRECATE_WARNINGS */
|
||||
|
||||
/*! Obsolete compression functions (since v1.7.3) */
|
||||
LZ4_DEPRECATED("use LZ4_compress_default() instead")
|
||||
LZ4LIB_API int LZ4_compress(const char *src, char *dest, int srcSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_default() instead")
|
||||
LZ4LIB_API int LZ4_compress_limitedOutput(const char *src, char *dest, int srcSize, int maxOutputSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead")
|
||||
LZ4LIB_API int LZ4_compress_withState(void *state, const char *source, char *dest, int inputSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead")
|
||||
LZ4LIB_API int LZ4_compress_limitedOutput_withState(void *state, const char *source, char *dest, int inputSize, int maxOutputSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead")
|
||||
LZ4LIB_API int LZ4_compress_continue(LZ4_stream_t *LZ4_streamPtr, const char *source, char *dest, int inputSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead")
|
||||
LZ4LIB_API int LZ4_compress_limitedOutput_continue(LZ4_stream_t *LZ4_streamPtr, const char *source, char *dest, int inputSize, int maxOutputSize);
|
||||
|
||||
/*! Obsolete decompression functions (since v1.8.0) */
|
||||
LZ4_DEPRECATED("use LZ4_decompress_fast() instead")
|
||||
LZ4LIB_API int LZ4_uncompress(const char *source, char *dest, int outputSize);
|
||||
LZ4_DEPRECATED("use LZ4_decompress_safe() instead")
|
||||
LZ4LIB_API int LZ4_uncompress_unknownOutputSize(const char *source, char *dest, int isize, int maxOutputSize);
|
||||
|
||||
/* Obsolete streaming functions (since v1.7.0)
|
||||
* degraded functionality; do not use!
|
||||
*
|
||||
* In order to perform streaming compression, these functions depended on data
|
||||
* that is no longer tracked in the state. They have been preserved as well as
|
||||
* possible: using them will still produce a correct output. However, they don't
|
||||
* actually retain any history between compression calls. The compression ratio
|
||||
* achieved will therefore be no better than compressing each chunk
|
||||
* independently.
|
||||
*/
|
||||
LZ4_DEPRECATED("Use LZ4_createStream() instead")
|
||||
LZ4LIB_API void *LZ4_create(char *inputBuffer);
|
||||
LZ4_DEPRECATED("Use LZ4_createStream() instead")
|
||||
LZ4LIB_API int LZ4_sizeofStreamState(void);
|
||||
LZ4_DEPRECATED("Use LZ4_resetStream() instead")
|
||||
LZ4LIB_API int LZ4_resetStreamState(void *state, char *inputBuffer);
|
||||
LZ4_DEPRECATED("Use LZ4_saveDict() instead")
|
||||
LZ4LIB_API char *LZ4_slideInputBuffer(void *state);
|
||||
|
||||
/*! Obsolete streaming decoding functions (since v1.7.0) */
|
||||
LZ4_DEPRECATED("use LZ4_decompress_safe_usingDict() instead")
|
||||
LZ4LIB_API int LZ4_decompress_safe_withPrefix64k(const char *src, char *dst, int compressedSize, int maxDstSize);
|
||||
LZ4_DEPRECATED("use LZ4_decompress_fast_usingDict() instead")
|
||||
LZ4LIB_API int LZ4_decompress_fast_withPrefix64k(const char *src, char *dst, int originalSize);
|
||||
|
||||
/*! Obsolete LZ4_decompress_fast variants (since v1.9.0) :
|
||||
* These functions used to be faster than LZ4_decompress_safe(),
|
||||
* but this is no longer the case. They are now slower.
|
||||
* This is because LZ4_decompress_fast() doesn't know the input size,
|
||||
* and therefore must progress more cautiously into the input buffer to not read beyond the end of block.
|
||||
* On top of that `LZ4_decompress_fast()` is not protected vs malformed or malicious inputs, making it a security liability.
|
||||
* As a consequence, LZ4_decompress_fast() is strongly discouraged, and deprecated.
|
||||
*
|
||||
* The last remaining LZ4_decompress_fast() specificity is that
|
||||
* it can decompress a block without knowing its compressed size.
|
||||
* Such functionality can be achieved in a more secure manner
|
||||
* by employing LZ4_decompress_safe_partial().
|
||||
*
|
||||
* Parameters:
|
||||
* originalSize : is the uncompressed size to regenerate.
|
||||
* `dst` must be already allocated, its size must be >= 'originalSize' bytes.
|
||||
* @return : number of bytes read from source buffer (== compressed size).
|
||||
* The function expects to finish at block's end exactly.
|
||||
* If the source stream is detected malformed, the function stops decoding and returns a negative result.
|
||||
* note : LZ4_decompress_fast*() requires originalSize. Thanks to this information, it never writes past the output buffer.
|
||||
* However, since it doesn't know its 'src' size, it may read an unknown amount of input, past input buffer bounds.
|
||||
* Also, since match offsets are not validated, match reads from 'src' may underflow too.
|
||||
* These issues never happen if input (compressed) data is correct.
|
||||
* But they may happen if input data is invalid (error or intentional tampering).
|
||||
* As a consequence, use these functions in trusted environments with trusted data **only**.
|
||||
*/
|
||||
LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe() instead")
|
||||
LZ4LIB_API int LZ4_decompress_fast(const char *src, char *dst, int originalSize);
|
||||
LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_continue() instead")
|
||||
LZ4LIB_API int LZ4_decompress_fast_continue(LZ4_streamDecode_t *LZ4_streamDecode, const char *src, char *dst, int originalSize);
|
||||
LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_usingDict() instead")
|
||||
LZ4LIB_API int LZ4_decompress_fast_usingDict(const char *src, char *dst, int originalSize, const char *dictStart, int dictSize);
|
||||
|
||||
/*! LZ4_resetStream() :
|
||||
* An LZ4_stream_t structure must be initialized at least once.
|
||||
* This is done with LZ4_initStream(), or LZ4_resetStream().
|
||||
* Consider switching to LZ4_initStream(),
|
||||
* invoking LZ4_resetStream() will trigger deprecation warnings in the future.
|
||||
*/
|
||||
LZ4LIB_API void LZ4_resetStream(LZ4_stream_t *streamPtr);
|
||||
|
||||
#endif /* LZ4_H_98237428734687 */
|
||||
|
||||
#if defined(__cplusplus)
|
||||
}
|
||||
#endif
|
||||
@ -1,30 +0,0 @@
|
||||
#include <common/math.h>
|
||||
#include <common/sys/types.h>
|
||||
#include "libm.h"
|
||||
|
||||
double fabs(double x)
|
||||
{
|
||||
union
|
||||
{
|
||||
double f;
|
||||
uint64_t i;
|
||||
} u = {x};
|
||||
u.i &= -1ULL / 2;
|
||||
return u.f;
|
||||
}
|
||||
|
||||
|
||||
#if __LDBL_MANT_DIG__ == 53 && __LDBL_MAX_EXP__ == 1024
|
||||
long double fabsl(long double x)
|
||||
{
|
||||
return fabs(x);
|
||||
}
|
||||
#elif (__LDBL_MANT_DIG__ == 64 || __LDBL_MANT_DIG__ == 113) && __LDBL_MAX_EXP__ == 16384
|
||||
long double fabsl(long double x)
|
||||
{
|
||||
union ldshape u = {x};
|
||||
|
||||
u.i.se &= 0x7fff;
|
||||
return u.f;
|
||||
}
|
||||
#endif
|
||||
@ -1,3 +0,0 @@
|
||||
#pragma once
|
||||
|
||||
#define NUMA_NO_NODE (-1)
|
||||
@ -1,9 +0,0 @@
|
||||
#pragma once
|
||||
|
||||
/**
|
||||
* @brief 将长整型转换为字符串
|
||||
*
|
||||
* @param input 输入的数据
|
||||
* @return const char* 结果字符串
|
||||
*/
|
||||
const char* ltoa(long input);
|
||||
@ -1,12 +0,0 @@
|
||||
#pragma once
|
||||
#include "types.h"
|
||||
|
||||
/**
|
||||
* @brief 等待指定pid的子进程退出
|
||||
*
|
||||
* @param pid 子进程的pid
|
||||
* @param stat_loc 返回的子进程结束状态
|
||||
* @param options 额外的控制选项
|
||||
* @return pid_t
|
||||
*/
|
||||
pid_t waitpid(pid_t pid, int *stat_loc, int options);
|
||||
@ -1,12 +0,0 @@
|
||||
#pragma once
|
||||
|
||||
#if ARCH(I386) || ARCH(X86_64)
|
||||
|
||||
#include <common/atomic.h>
|
||||
|
||||
// 该结构体需要与libs/refcount.rs的保持一致，且以rust版本为准
|
||||
typedef struct refcount_struct {
|
||||
atomic_t refs;
|
||||
} refcount_t;
|
||||
|
||||
#endif
|
||||
@ -11,14 +11,7 @@
|
||||
#pragma once
|
||||
|
||||
|
||||
#include <common/crc16.h>
|
||||
#include <common/crc32.h>
|
||||
#include <common/crc64.h>
|
||||
#include <common/crc7.h>
|
||||
#include <common/crc8.h>
|
||||
#include <common/glib.h>
|
||||
#include <common/kfifo.h>
|
||||
#include <common/lz4.h>
|
||||
#include <common/printk.h>
|
||||
#include <common/spinlock.h>
|
||||
#include <common/stdio.h>
|
||||
@ -26,7 +19,6 @@
|
||||
#include <common/time.h>
|
||||
#include <common/unistd.h>
|
||||
#include <driver/multiboot2/multiboot2.h>
|
||||
#include <include/DragonOS/refcount.h>
|
||||
#include <libs/lib_ui/textui.h>
|
||||
#include <mm/mm.h>
|
||||
#include <mm/mmio.h>
|
||||
|
||||
@ -1,7 +1,7 @@
|
||||
|
||||
CFLAGS += -I .
|
||||
|
||||
kernel_lib_subdirs:= sys
|
||||
kernel_lib_subdirs:=
|
||||
|
||||
kernel_lib_objs:= $(shell find ./*.c)
|
||||
|
||||
|
||||
@ -1,41 +0,0 @@
|
||||
#include <common/sys/types.h>
|
||||
|
||||
// Polynomial=0x8005
|
||||
// Initial Value=0x0
|
||||
// Final Xor Value=0x0
|
||||
|
||||
/** CRC table for the CRC-16. The poly is 0x8005 (x^16 + x^15 + x^2 + 1) */
|
||||
uint16_t const crc16_table[256] = {
|
||||
0x0000, 0x8005, 0x800F, 0x000A, 0x801B, 0x001E, 0x0014, 0x8011, 0x8033, 0x0036, 0x003C, 0x8039, 0x0028, 0x802D, 0x8027, 0x0022,
|
||||
0x8063, 0x0066, 0x006C, 0x8069, 0x0078, 0x807D, 0x8077, 0x0072, 0x0050, 0x8055, 0x805F, 0x005A, 0x804B, 0x004E, 0x0044, 0x8041,
|
||||
0x80C3, 0x00C6, 0x00CC, 0x80C9, 0x00D8, 0x80DD, 0x80D7, 0x00D2, 0x00F0, 0x80F5, 0x80FF, 0x00FA, 0x80EB, 0x00EE, 0x00E4, 0x80E1,
|
||||
0x00A0, 0x80A5, 0x80AF, 0x00AA, 0x80BB, 0x00BE, 0x00B4, 0x80B1, 0x8093, 0x0096, 0x009C, 0x8099, 0x0088, 0x808D, 0x8087, 0x0082,
|
||||
0x8183, 0x0186, 0x018C, 0x8189, 0x0198, 0x819D, 0x8197, 0x0192, 0x01B0, 0x81B5, 0x81BF, 0x01BA, 0x81AB, 0x01AE, 0x01A4, 0x81A1,
|
||||
0x01E0, 0x81E5, 0x81EF, 0x01EA, 0x81FB, 0x01FE, 0x01F4, 0x81F1, 0x81D3, 0x01D6, 0x01DC, 0x81D9, 0x01C8, 0x81CD, 0x81C7, 0x01C2,
|
||||
0x0140, 0x8145, 0x814F, 0x014A, 0x815B, 0x015E, 0x0154, 0x8151, 0x8173, 0x0176, 0x017C, 0x8179, 0x0168, 0x816D, 0x8167, 0x0162,
|
||||
0x8123, 0x0126, 0x012C, 0x8129, 0x0138, 0x813D, 0x8137, 0x0132, 0x0110, 0x8115, 0x811F, 0x011A, 0x810B, 0x010E, 0x0104, 0x8101,
|
||||
0x8303, 0x0306, 0x030C, 0x8309, 0x0318, 0x831D, 0x8317, 0x0312, 0x0330, 0x8335, 0x833F, 0x033A, 0x832B, 0x032E, 0x0324, 0x8321,
|
||||
0x0360, 0x8365, 0x836F, 0x036A, 0x837B, 0x037E, 0x0374, 0x8371, 0x8353, 0x0356, 0x035C, 0x8359, 0x0348, 0x834D, 0x8347, 0x0342,
|
||||
0x03C0, 0x83C5, 0x83CF, 0x03CA, 0x83DB, 0x03DE, 0x03D4, 0x83D1, 0x83F3, 0x03F6, 0x03FC, 0x83F9, 0x03E8, 0x83ED, 0x83E7, 0x03E2,
|
||||
0x83A3, 0x03A6, 0x03AC, 0x83A9, 0x03B8, 0x83BD, 0x83B7, 0x03B2, 0x0390, 0x8395, 0x839F, 0x039A, 0x838B, 0x038E, 0x0384, 0x8381,
|
||||
0x0280, 0x8285, 0x828F, 0x028A, 0x829B, 0x029E, 0x0294, 0x8291, 0x82B3, 0x02B6, 0x02BC, 0x82B9, 0x02A8, 0x82AD, 0x82A7, 0x02A2,
|
||||
0x82E3, 0x02E6, 0x02EC, 0x82E9, 0x02F8, 0x82FD, 0x82F7, 0x02F2, 0x02D0, 0x82D5, 0x82DF, 0x02DA, 0x82CB, 0x02CE, 0x02C4, 0x82C1,
|
||||
0x8243, 0x0246, 0x024C, 0x8249, 0x0258, 0x825D, 0x8257, 0x0252, 0x0270, 0x8275, 0x827F, 0x027A, 0x826B, 0x026E, 0x0264, 0x8261,
|
||||
0x0220, 0x8225, 0x822F, 0x022A, 0x823B, 0x023E, 0x0234, 0x8231, 0x8213, 0x0216, 0x021C, 0x8219, 0x0208, 0x820D, 0x8207, 0x0202};
|
||||
|
||||
/**
|
||||
* @brief 计算crc16
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint16_t crc
|
||||
*/
|
||||
uint16_t crc16(uint16_t crc, uint8_t const *buffer, size_t len)
|
||||
{
|
||||
while (len--)
|
||||
{
|
||||
crc = (crc << 8) ^ crc16_table[((crc >> 8) ^ *buffer++) & 0xff];
|
||||
}
|
||||
return crc;
|
||||
}
|
||||
@ -1,56 +0,0 @@
|
||||
#include <common/sys/types.h>
|
||||
// Polynomial=0x4C11DB7
|
||||
// Initial Value=0x0
|
||||
// Final Xor Value:0x0
|
||||
|
||||
/** CRC table for the CRC-32. The poly is 0x4C11DB7 */
|
||||
uint32_t const crc32_table[256] = {
|
||||
0x00000000, 0x04C11DB7, 0x09823B6E, 0x0D4326D9, 0x130476DC, 0x17C56B6B, 0x1A864DB2, 0x1E475005,
|
||||
0x2608EDB8, 0x22C9F00F, 0x2F8AD6D6, 0x2B4BCB61, 0x350C9B64, 0x31CD86D3, 0x3C8EA00A, 0x384FBDBD,
|
||||
0x4C11DB70, 0x48D0C6C7, 0x4593E01E, 0x4152FDA9, 0x5F15ADAC, 0x5BD4B01B, 0x569796C2, 0x52568B75,
|
||||
0x6A1936C8, 0x6ED82B7F, 0x639B0DA6, 0x675A1011, 0x791D4014, 0x7DDC5DA3, 0x709F7B7A, 0x745E66CD,
|
||||
0x9823B6E0, 0x9CE2AB57, 0x91A18D8E, 0x95609039, 0x8B27C03C, 0x8FE6DD8B, 0x82A5FB52, 0x8664E6E5,
|
||||
0xBE2B5B58, 0xBAEA46EF, 0xB7A96036, 0xB3687D81, 0xAD2F2D84, 0xA9EE3033, 0xA4AD16EA, 0xA06C0B5D,
|
||||
0xD4326D90, 0xD0F37027, 0xDDB056FE, 0xD9714B49, 0xC7361B4C, 0xC3F706FB, 0xCEB42022, 0xCA753D95,
|
||||
0xF23A8028, 0xF6FB9D9F, 0xFBB8BB46, 0xFF79A6F1, 0xE13EF6F4, 0xE5FFEB43, 0xE8BCCD9A, 0xEC7DD02D,
|
||||
0x34867077, 0x30476DC0, 0x3D044B19, 0x39C556AE, 0x278206AB, 0x23431B1C, 0x2E003DC5, 0x2AC12072,
|
||||
0x128E9DCF, 0x164F8078, 0x1B0CA6A1, 0x1FCDBB16, 0x018AEB13, 0x054BF6A4, 0x0808D07D, 0x0CC9CDCA,
|
||||
0x7897AB07, 0x7C56B6B0, 0x71159069, 0x75D48DDE, 0x6B93DDDB, 0x6F52C06C, 0x6211E6B5, 0x66D0FB02,
|
||||
0x5E9F46BF, 0x5A5E5B08, 0x571D7DD1, 0x53DC6066, 0x4D9B3063, 0x495A2DD4, 0x44190B0D, 0x40D816BA,
|
||||
0xACA5C697, 0xA864DB20, 0xA527FDF9, 0xA1E6E04E, 0xBFA1B04B, 0xBB60ADFC, 0xB6238B25, 0xB2E29692,
|
||||
0x8AAD2B2F, 0x8E6C3698, 0x832F1041, 0x87EE0DF6, 0x99A95DF3, 0x9D684044, 0x902B669D, 0x94EA7B2A,
|
||||
0xE0B41DE7, 0xE4750050, 0xE9362689, 0xEDF73B3E, 0xF3B06B3B, 0xF771768C, 0xFA325055, 0xFEF34DE2,
|
||||
0xC6BCF05F, 0xC27DEDE8, 0xCF3ECB31, 0xCBFFD686, 0xD5B88683, 0xD1799B34, 0xDC3ABDED, 0xD8FBA05A,
|
||||
0x690CE0EE, 0x6DCDFD59, 0x608EDB80, 0x644FC637, 0x7A089632, 0x7EC98B85, 0x738AAD5C, 0x774BB0EB,
|
||||
0x4F040D56, 0x4BC510E1, 0x46863638, 0x42472B8F, 0x5C007B8A, 0x58C1663D, 0x558240E4, 0x51435D53,
|
||||
0x251D3B9E, 0x21DC2629, 0x2C9F00F0, 0x285E1D47, 0x36194D42, 0x32D850F5, 0x3F9B762C, 0x3B5A6B9B,
|
||||
0x0315D626, 0x07D4CB91, 0x0A97ED48, 0x0E56F0FF, 0x1011A0FA, 0x14D0BD4D, 0x19939B94, 0x1D528623,
|
||||
0xF12F560E, 0xF5EE4BB9, 0xF8AD6D60, 0xFC6C70D7, 0xE22B20D2, 0xE6EA3D65, 0xEBA91BBC, 0xEF68060B,
|
||||
0xD727BBB6, 0xD3E6A601, 0xDEA580D8, 0xDA649D6F, 0xC423CD6A, 0xC0E2D0DD, 0xCDA1F604, 0xC960EBB3,
|
||||
0xBD3E8D7E, 0xB9FF90C9, 0xB4BCB610, 0xB07DABA7, 0xAE3AFBA2, 0xAAFBE615, 0xA7B8C0CC, 0xA379DD7B,
|
||||
0x9B3660C6, 0x9FF77D71, 0x92B45BA8, 0x9675461F, 0x8832161A, 0x8CF30BAD, 0x81B02D74, 0x857130C3,
|
||||
0x5D8A9099, 0x594B8D2E, 0x5408ABF7, 0x50C9B640, 0x4E8EE645, 0x4A4FFBF2, 0x470CDD2B, 0x43CDC09C,
|
||||
0x7B827D21, 0x7F436096, 0x7200464F, 0x76C15BF8, 0x68860BFD, 0x6C47164A, 0x61043093, 0x65C52D24,
|
||||
0x119B4BE9, 0x155A565E, 0x18197087, 0x1CD86D30, 0x029F3D35, 0x065E2082, 0x0B1D065B, 0x0FDC1BEC,
|
||||
0x3793A651, 0x3352BBE6, 0x3E119D3F, 0x3AD08088, 0x2497D08D, 0x2056CD3A, 0x2D15EBE3, 0x29D4F654,
|
||||
0xC5A92679, 0xC1683BCE, 0xCC2B1D17, 0xC8EA00A0, 0xD6AD50A5, 0xD26C4D12, 0xDF2F6BCB, 0xDBEE767C,
|
||||
0xE3A1CBC1, 0xE760D676, 0xEA23F0AF, 0xEEE2ED18, 0xF0A5BD1D, 0xF464A0AA, 0xF9278673, 0xFDE69BC4,
|
||||
0x89B8FD09, 0x8D79E0BE, 0x803AC667, 0x84FBDBD0, 0x9ABC8BD5, 0x9E7D9662, 0x933EB0BB, 0x97FFAD0C,
|
||||
0xAFB010B1, 0xAB710D06, 0xA6322BDF, 0xA2F33668, 0xBCB4666D, 0xB8757BDA, 0xB5365D03, 0xB1F740B4};
|
||||
|
||||
/**
|
||||
* @brief 计算crc32
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint32_t crc
|
||||
*/
|
||||
uint32_t crc32(uint32_t crc, uint8_t const *buffer, size_t len)
|
||||
{
|
||||
while (len--)
|
||||
{
|
||||
crc = (crc << 8) ^ (crc32_table[((crc >> 24) ^ *buffer++) & 0xff]);
|
||||
}
|
||||
return crc;
|
||||
}
|
||||
@ -1,57 +0,0 @@
|
||||
#include <common/sys/types.h>
|
||||
|
||||
// Polynomial =0x42F0E1EBA9EA3693
|
||||
// Initial Value=0x0
|
||||
// Final Xor Value=0x0
|
||||
uint64_t const crc64_table[256] = {
|
||||
0x0000000000000000, 0x42F0E1EBA9EA3693, 0x85E1C3D753D46D26, 0xC711223CFA3E5BB5, 0x493366450E42ECDF, 0x0BC387AEA7A8DA4C, 0xCCD2A5925D9681F9, 0x8E224479F47CB76A,
|
||||
0x9266CC8A1C85D9BE, 0xD0962D61B56FEF2D, 0x17870F5D4F51B498, 0x5577EEB6E6BB820B, 0xDB55AACF12C73561, 0x99A54B24BB2D03F2, 0x5EB4691841135847, 0x1C4488F3E8F96ED4,
|
||||
0x663D78FF90E185EF, 0x24CD9914390BB37C, 0xE3DCBB28C335E8C9, 0xA12C5AC36ADFDE5A, 0x2F0E1EBA9EA36930, 0x6DFEFF5137495FA3, 0xAAEFDD6DCD770416, 0xE81F3C86649D3285,
|
||||
0xF45BB4758C645C51, 0xB6AB559E258E6AC2, 0x71BA77A2DFB03177, 0x334A9649765A07E4, 0xBD68D2308226B08E, 0xFF9833DB2BCC861D, 0x388911E7D1F2DDA8, 0x7A79F00C7818EB3B,
|
||||
0xCC7AF1FF21C30BDE, 0x8E8A101488293D4D, 0x499B3228721766F8, 0x0B6BD3C3DBFD506B, 0x854997BA2F81E701, 0xC7B97651866BD192, 0x00A8546D7C558A27, 0x4258B586D5BFBCB4,
|
||||
0x5E1C3D753D46D260, 0x1CECDC9E94ACE4F3, 0xDBFDFEA26E92BF46, 0x990D1F49C77889D5, 0x172F5B3033043EBF, 0x55DFBADB9AEE082C, 0x92CE98E760D05399, 0xD03E790CC93A650A,
|
||||
0xAA478900B1228E31, 0xE8B768EB18C8B8A2, 0x2FA64AD7E2F6E317, 0x6D56AB3C4B1CD584, 0xE374EF45BF6062EE, 0xA1840EAE168A547D, 0x66952C92ECB40FC8, 0x2465CD79455E395B,
|
||||
0x3821458AADA7578F, 0x7AD1A461044D611C, 0xBDC0865DFE733AA9, 0xFF3067B657990C3A, 0x711223CFA3E5BB50, 0x33E2C2240A0F8DC3, 0xF4F3E018F031D676, 0xB60301F359DBE0E5,
|
||||
0xDA050215EA6C212F, 0x98F5E3FE438617BC, 0x5FE4C1C2B9B84C09, 0x1D14202910527A9A, 0x93366450E42ECDF0, 0xD1C685BB4DC4FB63, 0x16D7A787B7FAA0D6, 0x5427466C1E109645,
|
||||
0x4863CE9FF6E9F891, 0x0A932F745F03CE02, 0xCD820D48A53D95B7, 0x8F72ECA30CD7A324, 0x0150A8DAF8AB144E, 0x43A04931514122DD, 0x84B16B0DAB7F7968, 0xC6418AE602954FFB,
|
||||
0xBC387AEA7A8DA4C0, 0xFEC89B01D3679253, 0x39D9B93D2959C9E6, 0x7B2958D680B3FF75, 0xF50B1CAF74CF481F, 0xB7FBFD44DD257E8C, 0x70EADF78271B2539, 0x321A3E938EF113AA,
|
||||
0x2E5EB66066087D7E, 0x6CAE578BCFE24BED, 0xABBF75B735DC1058, 0xE94F945C9C3626CB, 0x676DD025684A91A1, 0x259D31CEC1A0A732, 0xE28C13F23B9EFC87, 0xA07CF2199274CA14,
|
||||
0x167FF3EACBAF2AF1, 0x548F120162451C62, 0x939E303D987B47D7, 0xD16ED1D631917144, 0x5F4C95AFC5EDC62E, 0x1DBC74446C07F0BD, 0xDAAD56789639AB08, 0x985DB7933FD39D9B,
|
||||
0x84193F60D72AF34F, 0xC6E9DE8B7EC0C5DC, 0x01F8FCB784FE9E69, 0x43081D5C2D14A8FA, 0xCD2A5925D9681F90, 0x8FDAB8CE70822903, 0x48CB9AF28ABC72B6, 0x0A3B7B1923564425,
|
||||
0x70428B155B4EAF1E, 0x32B26AFEF2A4998D, 0xF5A348C2089AC238, 0xB753A929A170F4AB, 0x3971ED50550C43C1, 0x7B810CBBFCE67552, 0xBC902E8706D82EE7, 0xFE60CF6CAF321874,
|
||||
0xE224479F47CB76A0, 0xA0D4A674EE214033, 0x67C58448141F1B86, 0x253565A3BDF52D15, 0xAB1721DA49899A7F, 0xE9E7C031E063ACEC, 0x2EF6E20D1A5DF759, 0x6C0603E6B3B7C1CA,
|
||||
0xF6FAE5C07D3274CD, 0xB40A042BD4D8425E, 0x731B26172EE619EB, 0x31EBC7FC870C2F78, 0xBFC9838573709812, 0xFD39626EDA9AAE81, 0x3A28405220A4F534, 0x78D8A1B9894EC3A7,
|
||||
0x649C294A61B7AD73, 0x266CC8A1C85D9BE0, 0xE17DEA9D3263C055, 0xA38D0B769B89F6C6, 0x2DAF4F0F6FF541AC, 0x6F5FAEE4C61F773F, 0xA84E8CD83C212C8A, 0xEABE6D3395CB1A19,
|
||||
0x90C79D3FEDD3F122, 0xD2377CD44439C7B1, 0x15265EE8BE079C04, 0x57D6BF0317EDAA97, 0xD9F4FB7AE3911DFD, 0x9B041A914A7B2B6E, 0x5C1538ADB04570DB, 0x1EE5D94619AF4648,
|
||||
0x02A151B5F156289C, 0x4051B05E58BC1E0F, 0x87409262A28245BA, 0xC5B073890B687329, 0x4B9237F0FF14C443, 0x0962D61B56FEF2D0, 0xCE73F427ACC0A965, 0x8C8315CC052A9FF6,
|
||||
0x3A80143F5CF17F13, 0x7870F5D4F51B4980, 0xBF61D7E80F251235, 0xFD913603A6CF24A6, 0x73B3727A52B393CC, 0x31439391FB59A55F, 0xF652B1AD0167FEEA, 0xB4A25046A88DC879,
|
||||
0xA8E6D8B54074A6AD, 0xEA16395EE99E903E, 0x2D071B6213A0CB8B, 0x6FF7FA89BA4AFD18, 0xE1D5BEF04E364A72, 0xA3255F1BE7DC7CE1, 0x64347D271DE22754, 0x26C49CCCB40811C7,
|
||||
0x5CBD6CC0CC10FAFC, 0x1E4D8D2B65FACC6F, 0xD95CAF179FC497DA, 0x9BAC4EFC362EA149, 0x158E0A85C2521623, 0x577EEB6E6BB820B0, 0x906FC95291867B05, 0xD29F28B9386C4D96,
|
||||
0xCEDBA04AD0952342, 0x8C2B41A1797F15D1, 0x4B3A639D83414E64, 0x09CA82762AAB78F7, 0x87E8C60FDED7CF9D, 0xC51827E4773DF90E, 0x020905D88D03A2BB, 0x40F9E43324E99428,
|
||||
0x2CFFE7D5975E55E2, 0x6E0F063E3EB46371, 0xA91E2402C48A38C4, 0xEBEEC5E96D600E57, 0x65CC8190991CB93D, 0x273C607B30F68FAE, 0xE02D4247CAC8D41B, 0xA2DDA3AC6322E288,
|
||||
0xBE992B5F8BDB8C5C, 0xFC69CAB42231BACF, 0x3B78E888D80FE17A, 0x7988096371E5D7E9, 0xF7AA4D1A85996083, 0xB55AACF12C735610, 0x724B8ECDD64D0DA5, 0x30BB6F267FA73B36,
|
||||
0x4AC29F2A07BFD00D, 0x08327EC1AE55E69E, 0xCF235CFD546BBD2B, 0x8DD3BD16FD818BB8, 0x03F1F96F09FD3CD2, 0x41011884A0170A41, 0x86103AB85A2951F4, 0xC4E0DB53F3C36767,
|
||||
0xD8A453A01B3A09B3, 0x9A54B24BB2D03F20, 0x5D45907748EE6495, 0x1FB5719CE1045206, 0x919735E51578E56C, 0xD367D40EBC92D3FF, 0x1476F63246AC884A, 0x568617D9EF46BED9,
|
||||
0xE085162AB69D5E3C, 0xA275F7C11F7768AF, 0x6564D5FDE549331A, 0x279434164CA30589, 0xA9B6706FB8DFB2E3, 0xEB46918411358470, 0x2C57B3B8EB0BDFC5, 0x6EA7525342E1E956,
|
||||
0x72E3DAA0AA188782, 0x30133B4B03F2B111, 0xF7021977F9CCEAA4, 0xB5F2F89C5026DC37, 0x3BD0BCE5A45A6B5D, 0x79205D0E0DB05DCE, 0xBE317F32F78E067B, 0xFCC19ED95E6430E8,
|
||||
0x86B86ED5267CDBD3, 0xC4488F3E8F96ED40, 0x0359AD0275A8B6F5, 0x41A94CE9DC428066, 0xCF8B0890283E370C, 0x8D7BE97B81D4019F, 0x4A6ACB477BEA5A2A, 0x089A2AACD2006CB9,
|
||||
0x14DEA25F3AF9026D, 0x562E43B4931334FE, 0x913F6188692D6F4B, 0xD3CF8063C0C759D8, 0x5DEDC41A34BBEEB2, 0x1F1D25F19D51D821, 0xD80C07CD676F8394, 0x9AFCE626CE85B507
|
||||
|
||||
};
|
||||
|
||||
/**
|
||||
* @brief 计算crc64
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint64_t crc
|
||||
*/
|
||||
uint64_t crc64(uint64_t crc, uint8_t const *buffer, size_t len)
|
||||
{
|
||||
while (len--)
|
||||
{
|
||||
crc = (crc << 8) ^ (crc64_table[((crc >> 56) ^ *buffer++) & 0xff]);
|
||||
}
|
||||
return crc;
|
||||
}
|
||||
@ -1,38 +0,0 @@
|
||||
#include <common/sys/types.h>
|
||||
|
||||
/** CRC table for the CRC-7. The poly is 0X09 */
|
||||
// crc7 generator polynomial : G(x)=x7+x3+1
|
||||
const uint8_t crc7_table[256] = {
|
||||
0X00, 0X09, 0X12, 0X1B, 0X24, 0X2D, 0X36, 0X3F, 0X48, 0X41, 0X5A, 0X53, 0X6C, 0X65, 0X7E, 0X77,
|
||||
0X19, 0X10, 0X0B, 0X02, 0X3D, 0X34, 0X2F, 0X26, 0X51, 0X58, 0X43, 0X4A, 0X75, 0X7C, 0X67, 0X6E,
|
||||
0X32, 0X3B, 0X20, 0X29, 0X16, 0X1F, 0X04, 0X0D, 0X7A, 0X73, 0X68, 0X61, 0X5E, 0X57, 0X4C, 0X45,
|
||||
0X2B, 0X22, 0X39, 0X30, 0X0F, 0X06, 0X1D, 0X14, 0X63, 0X6A, 0X71, 0X78, 0X47, 0X4E, 0X55, 0X5C,
|
||||
0X64, 0X6D, 0X76, 0X7F, 0X40, 0X49, 0X52, 0X5B, 0X2C, 0X25, 0X3E, 0X37, 0X08, 0X01, 0X1A, 0X13,
|
||||
0X7D, 0X74, 0X6F, 0X66, 0X59, 0X50, 0X4B, 0X42, 0X35, 0X3C, 0X27, 0X2E, 0X11, 0X18, 0X03, 0X0A,
|
||||
0X56, 0X5F, 0X44, 0X4D, 0X72, 0X7B, 0X60, 0X69, 0X1E, 0X17, 0X0C, 0X05, 0X3A, 0X33, 0X28, 0X21,
|
||||
0X4F, 0X46, 0X5D, 0X54, 0X6B, 0X62, 0X79, 0X70, 0X07, 0X0E, 0X15, 0X1C, 0X23, 0X2A, 0X31, 0X38,
|
||||
0X41, 0X48, 0X53, 0X5A, 0X65, 0X6C, 0X77, 0X7E, 0X09, 0X00, 0X1B, 0X12, 0X2D, 0X24, 0X3F, 0X36,
|
||||
0X58, 0X51, 0X4A, 0X43, 0X7C, 0X75, 0X6E, 0X67, 0X10, 0X19, 0X02, 0X0B, 0X34, 0X3D, 0X26, 0X2F,
|
||||
0X73, 0X7A, 0X61, 0X68, 0X57, 0X5E, 0X45, 0X4C, 0X3B, 0X32, 0X29, 0X20, 0X1F, 0X16, 0X0D, 0X04,
|
||||
0X6A, 0X63, 0X78, 0X71, 0X4E, 0X47, 0X5C, 0X55, 0X22, 0X2B, 0X30, 0X39, 0X06, 0X0F, 0X14, 0X1D,
|
||||
0X25, 0X2C, 0X37, 0X3E, 0X01, 0X08, 0X13, 0X1A, 0X6D, 0X64, 0X7F, 0X76, 0X49, 0X40, 0X5B, 0X52,
|
||||
0X3C, 0X35, 0X2E, 0X27, 0X18, 0X11, 0X0A, 0X03, 0X74, 0X7D, 0X66, 0X6F, 0X50, 0X59, 0X42, 0X4B,
|
||||
0X17, 0X1E, 0X05, 0X0C, 0X33, 0X3A, 0X21, 0X28, 0X5F, 0X56, 0X4D, 0X44, 0X7B, 0X72, 0X69, 0X60,
|
||||
0X0E, 0X07, 0X1C, 0X15, 0X2A, 0X23, 0X38, 0X31, 0X46, 0X4F, 0X54, 0X5D, 0X62, 0X6B, 0X70, 0X79};
|
||||
|
||||
/**
|
||||
* @brief 计算crc7
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint8_t crc
|
||||
*/
|
||||
uint8_t crc7(uint8_t crc, const uint8_t *buffer, size_t len)
|
||||
{
|
||||
while (len--)
|
||||
{
|
||||
crc = crc7_table[(crc << 1) ^ *buffer++];
|
||||
}
|
||||
return (crc);
|
||||
}
|
||||
@ -1,41 +0,0 @@
|
||||
#include <common/sys/types.h>
|
||||
// Polynomial=0x31
|
||||
// Initial Value=0x0
|
||||
// Final Xor Value=0x0
|
||||
|
||||
/** CRC table for the CRC-8. The poly is 0x31 */
|
||||
const uint8_t crc8_table[256] = {
|
||||
0x00, 0x31, 0x62, 0x53, 0xc4, 0xf5, 0xa6, 0x97, 0xb9, 0x88, 0xdb, 0xea, 0x7d, 0x4c, 0x1f, 0x2e,
|
||||
0x43, 0x72, 0x21, 0x10, 0x87, 0xb6, 0xe5, 0xd4, 0xfa, 0xcb, 0x98, 0xa9, 0x3e, 0x0f, 0x5c, 0x6d,
|
||||
0x86, 0xb7, 0xe4, 0xd5, 0x42, 0x73, 0x20, 0x11, 0x3f, 0x0e, 0x5d, 0x6c, 0xfb, 0xca, 0x99, 0xa8,
|
||||
0xc5, 0xf4, 0xa7, 0x96, 0x01, 0x30, 0x63, 0x52, 0x7c, 0x4d, 0x1e, 0x2f, 0xb8, 0x89, 0xda, 0xeb,
|
||||
0x3d, 0x0c, 0x5f, 0x6e, 0xf9, 0xc8, 0x9b, 0xaa, 0x84, 0xb5, 0xe6, 0xd7, 0x40, 0x71, 0x22, 0x13,
|
||||
0x7e, 0x4f, 0x1c, 0x2d, 0xba, 0x8b, 0xd8, 0xe9, 0xc7, 0xf6, 0xa5, 0x94, 0x03, 0x32, 0x61, 0x50,
|
||||
0xbb, 0x8a, 0xd9, 0xe8, 0x7f, 0x4e, 0x1d, 0x2c, 0x02, 0x33, 0x60, 0x51, 0xc6, 0xf7, 0xa4, 0x95,
|
||||
0xf8, 0xc9, 0x9a, 0xab, 0x3c, 0x0d, 0x5e, 0x6f, 0x41, 0x70, 0x23, 0x12, 0x85, 0xb4, 0xe7, 0xd6,
|
||||
0x7a, 0x4b, 0x18, 0x29, 0xbe, 0x8f, 0xdc, 0xed, 0xc3, 0xf2, 0xa1, 0x90, 0x07, 0x36, 0x65, 0x54,
|
||||
0x39, 0x08, 0x5b, 0x6a, 0xfd, 0xcc, 0x9f, 0xae, 0x80, 0xb1, 0xe2, 0xd3, 0x44, 0x75, 0x26, 0x17,
|
||||
0xfc, 0xcd, 0x9e, 0xaf, 0x38, 0x09, 0x5a, 0x6b, 0x45, 0x74, 0x27, 0x16, 0x81, 0xb0, 0xe3, 0xd2,
|
||||
0xbf, 0x8e, 0xdd, 0xec, 0x7b, 0x4a, 0x19, 0x28, 0x06, 0x37, 0x64, 0x55, 0xc2, 0xf3, 0xa0, 0x91,
|
||||
0x47, 0x76, 0x25, 0x14, 0x83, 0xb2, 0xe1, 0xd0, 0xfe, 0xcf, 0x9c, 0xad, 0x3a, 0x0b, 0x58, 0x69,
|
||||
0x04, 0x35, 0x66, 0x57, 0xc0, 0xf1, 0xa2, 0x93, 0xbd, 0x8c, 0xdf, 0xee, 0x79, 0x48, 0x1b, 0x2a,
|
||||
0xc1, 0xf0, 0xa3, 0x92, 0x05, 0x34, 0x67, 0x56, 0x78, 0x49, 0x1a, 0x2b, 0xbc, 0x8d, 0xde, 0xef,
|
||||
0x82, 0xb3, 0xe0, 0xd1, 0x46, 0x77, 0x24, 0x15, 0x3b, 0x0a, 0x59, 0x68, 0xff, 0xce, 0x9d, 0xac};
|
||||
|
||||
/**
|
||||
* @brief 计算crc8
|
||||
*
|
||||
* @param crc crc初始值
|
||||
* @param buffer 输入缓冲区
|
||||
* @param len buffer大小（bytes）
|
||||
* @return uint8_t crc
|
||||
*/
|
||||
uint8_t crc8(uint8_t crc, uint8_t const *buffer, size_t len)
|
||||
{
|
||||
while (len--)
|
||||
{
|
||||
// printf("%04x\n",(crc ^ *buffer)&0xff);
|
||||
crc = crc8_table[crc ^ *buffer++];
|
||||
}
|
||||
return (crc);
|
||||
}
|
||||
@ -1,151 +0,0 @@
|
||||
#include <common/kfifo.h>
|
||||
#include <common/glib.h>
|
||||
#include <common/errno.h>
|
||||
#include <common/compiler.h>
|
||||
#include <mm/slab.h>
|
||||
|
||||
/**
|
||||
* @brief 通过动态方式初始化kfifo缓冲队列
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param size 缓冲区大小
|
||||
* @param reserved 暂时保留，请置为0
|
||||
* @return int 错误码: NOMEM; 成功->0
|
||||
*/
|
||||
int kfifo_alloc(struct kfifo_t *fifo, uint32_t size, uint64_t reserved)
|
||||
{
|
||||
memset(fifo, 0, sizeof(struct kfifo_t));
|
||||
fifo->buffer = kmalloc(size, 0);
|
||||
if (fifo->buffer == NULL)
|
||||
goto failed;
|
||||
|
||||
fifo->total_size = size;
|
||||
return 0;
|
||||
failed:;
|
||||
return -ENOMEM;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 使用指定的缓冲区来初始化kfifo缓冲队列
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param buffer 缓冲区
|
||||
* @param size 缓冲区大小
|
||||
*/
|
||||
void kfifo_init(struct kfifo_t *fifo, void *buffer, uint32_t size)
|
||||
{
|
||||
memset(fifo, 0, sizeof(struct kfifo_t));
|
||||
|
||||
fifo->buffer = buffer;
|
||||
fifo->total_size = size;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 向kfifo缓冲区推入数据
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param from 来源数据地址
|
||||
* @param size 数据大小（字节数）
|
||||
* @return uint32_t 推入的数据大小
|
||||
*/
|
||||
uint32_t kfifo_in(struct kfifo_t *fifo, const void *from, uint32_t size)
|
||||
{
|
||||
// 判断空间是否够
|
||||
if (unlikely(fifo->size + size > fifo->total_size))
|
||||
return 0;
|
||||
if (unlikely(from == NULL))
|
||||
return 0;
|
||||
|
||||
// 分两种情况，一种是要发生回环，另一种不发生回环
|
||||
if (fifo->in_offset + size > fifo->total_size) // 发生回环
|
||||
{
|
||||
uint32_t tmp = fifo->total_size - fifo->in_offset;
|
||||
memcpy(fifo->buffer + fifo->in_offset, from, tmp);
|
||||
memcpy(fifo->buffer, from + tmp, size - tmp);
|
||||
fifo->in_offset = size - tmp;
|
||||
}
|
||||
else // 不发生回环
|
||||
{
|
||||
memcpy(fifo->buffer + fifo->in_offset, from, size);
|
||||
fifo->in_offset += size;
|
||||
}
|
||||
|
||||
fifo->size += size;
|
||||
|
||||
return size;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 从kfifo缓冲区取出数据，并从队列中删除数据
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param to 拷贝目标地址
|
||||
* @param size 数据大小（字节数）
|
||||
* @return uint32_t 取出的数据大小
|
||||
*/
|
||||
uint32_t kfifo_out(struct kfifo_t *fifo, void *to, uint32_t size)
|
||||
{
|
||||
if (unlikely(to == NULL)) // 判断目标地址是否为空
|
||||
return 0;
|
||||
if (unlikely(size > fifo->size)) // 判断队列中是否有这么多数据
|
||||
return 0;
|
||||
|
||||
// 判断是否会发生回环
|
||||
if (fifo->out_offset + size > fifo->total_size) // 发生回环
|
||||
{
|
||||
uint32_t tmp = fifo->total_size - fifo->out_offset;
|
||||
memcpy(to, fifo->buffer + fifo->out_offset, tmp);
|
||||
memcpy(to + tmp, fifo->buffer, size - tmp);
|
||||
fifo->out_offset = size - tmp;
|
||||
}
|
||||
else // 未发生回环
|
||||
{
|
||||
memcpy(to, fifo->buffer + fifo->out_offset, size);
|
||||
fifo->out_offset += size;
|
||||
}
|
||||
|
||||
fifo->size -= size;
|
||||
|
||||
return size;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 从kfifo缓冲区取出数据，但是不从队列中删除数据
|
||||
*
|
||||
* @param fifo 队列结构体
|
||||
* @param to 拷贝目标地址
|
||||
* @param size 数据大小（字节数）
|
||||
* @return uint32_t 取出的数据大小
|
||||
*/
|
||||
uint32_t kfifo_out_peek(struct kfifo_t *fifo, void *to, uint32_t size)
|
||||
{
|
||||
if (unlikely(to == NULL)) // 判断目标地址是否为空
|
||||
return 0;
|
||||
if (unlikely(size > fifo->size)) // 判断队列中是否有这么多数据
|
||||
return 0;
|
||||
|
||||
// 判断是否会发生回环
|
||||
if (fifo->out_offset + size > fifo->total_size) // 发生回环
|
||||
{
|
||||
uint32_t tmp = fifo->total_size - fifo->out_offset;
|
||||
memcpy(to, fifo->buffer + fifo->out_offset, tmp);
|
||||
memcpy(to + tmp, fifo->buffer, size - tmp);
|
||||
}
|
||||
else // 未发生回环
|
||||
{
|
||||
memcpy(to, fifo->buffer + fifo->out_offset, size);
|
||||
}
|
||||
|
||||
return size;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 释放通过kfifo_alloc创建的fifo缓冲区
|
||||
*
|
||||
* @param fifo fifo队列结构体
|
||||
*/
|
||||
void kfifo_free_alloc(struct kfifo_t *fifo)
|
||||
{
|
||||
kfree(fifo->buffer);
|
||||
memset(fifo, 0, sizeof(struct kfifo_t));
|
||||
}
|
||||
@ -1,249 +0,0 @@
|
||||
#include <arch/arch.h>
|
||||
|
||||
#if ARCH(I386) || ARCH(X86_64)
|
||||
|
||||
#include <common/lockref.h>
|
||||
#include <common/compiler.h>
|
||||
|
||||
#ifdef __LOCKREF_ENABLE_CMPXCHG__
|
||||
#include <asm/cmpxchg.h>
|
||||
|
||||
#define CMPXCHG_LOOP(__lock_ref, CODE, SUCCESS) \
|
||||
{ \
|
||||
int retry = 100; \
|
||||
struct lockref old; \
|
||||
BUILD_BUG_ON(sizeof(old) != sizeof(uint64_t)); \
|
||||
old.lock_count = READ_ONCE(__lock_ref->lock_count); \
|
||||
while (likely(!spin_is_locked(&old.lock))) \
|
||||
{ \
|
||||
struct lockref new = old; \
|
||||
CODE; \
|
||||
if (likely(arch_try_cmpxchg(&__lock_ref->lock_count, &old.lock_count, new.lock_count))) \
|
||||
{ \
|
||||
SUCCESS; \
|
||||
} \
|
||||
if (!--retry) \
|
||||
break; \
|
||||
pause(); \
|
||||
} \
|
||||
}
|
||||
#else
|
||||
|
||||
#define CMPXCHG_LOOP(__lock_ref, CODE, SUCCESS) \
|
||||
do \
|
||||
{ \
|
||||
} while (0)
|
||||
|
||||
#endif
|
||||
|
||||
/**
|
||||
* @brief 原子的将引用计数加1
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
*/
|
||||
void lockref_inc(struct lockref *lock_ref)
|
||||
{
|
||||
// 先尝试使用cmpxchg进行无锁操作，若成功则返回
|
||||
CMPXCHG_LOOP(lock_ref, ++new.count;, return;);
|
||||
|
||||
// 无锁操作超时，或当前是上锁的状态，则退化为有锁操作
|
||||
spin_lock(&lock_ref->lock);
|
||||
++lock_ref->count;
|
||||
spin_unlock(&lock_ref->lock);
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 原子地将引用计数加1.如果原来的count≤0，则操作失败。
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return bool 操作成功=>true
|
||||
* 操作失败=>false
|
||||
*/
|
||||
bool lockref_inc_not_zero(struct lockref *lock_ref)
|
||||
{
|
||||
CMPXCHG_LOOP(
|
||||
lock_ref,
|
||||
{
|
||||
if (old.count <= 0)
|
||||
return false;
|
||||
++new.count;
|
||||
},
|
||||
{ return true; })
|
||||
|
||||
bool retval;
|
||||
spin_lock(&lock_ref->lock);
|
||||
retval = false;
|
||||
if (lock_ref->count > 0)
|
||||
{
|
||||
++lock_ref->count;
|
||||
retval = true;
|
||||
}
|
||||
spin_unlock(&lock_ref->lock);
|
||||
return retval;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 原子地减少引用计数。如果已处于count≤0的状态，则返回-1
|
||||
*
|
||||
* 本函数与lockref_dec_return()的区别在于，当在cmpxchg()中检测到count<=0或已加锁，本函数会再次尝试通过加锁来执行操作
|
||||
* 而后者会直接返回错误
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return int 操作成功 => 返回新的引用变量值
|
||||
* lockref处于count≤0的状态 => 返回-1
|
||||
*/
|
||||
int lockref_dec(struct lockref *lock_ref)
|
||||
{
|
||||
CMPXCHG_LOOP(
|
||||
lock_ref,
|
||||
{
|
||||
if (old.count <= 0)
|
||||
break;
|
||||
--new.count;
|
||||
},
|
||||
{ return new.count; })
|
||||
|
||||
// 如果xchg时，处于已加锁的状态或者检测到old.count <= 0，则采取加锁处理
|
||||
int retval = -1;
|
||||
spin_lock(&lock_ref->lock);
|
||||
if (lock_ref->count > 0)
|
||||
{
|
||||
--lock_ref->count;
|
||||
retval = lock_ref->count;
|
||||
}
|
||||
spin_unlock(&lock_ref->lock);
|
||||
|
||||
return retval;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 原子地减少引用计数。如果处于已加锁或count≤0的状态，则返回-1
|
||||
*
|
||||
* 本函数与lockref_dec()的区别在于，当在cmpxchg()中检测到count<=0或已加锁，本函数会直接返回错误
|
||||
* 而后者会再次尝试通过加锁来执行操作
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return int 操作成功 => 返回新的引用变量值
|
||||
* lockref处于已加锁或count≤0的状态 => 返回-1
|
||||
*/
|
||||
int lockref_dec_return(struct lockref *lock_ref)
|
||||
{
|
||||
CMPXCHG_LOOP(
|
||||
lock_ref,
|
||||
{
|
||||
if (old.count <= 0)
|
||||
return -1;
|
||||
--new.count;
|
||||
},
|
||||
{ return new.count; })
|
||||
|
||||
return -1;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 原子地减少引用计数。若当前的引用计数≤1，则操作失败
|
||||
*
|
||||
* 该函数与lockref_dec_or_lock_not_zero()的区别在于，当cmpxchg()时发现old.count≤1时，该函数会直接返回false.
|
||||
* 而后者在这种情况下，会尝试加锁来进行操作。
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return true 成功将引用计数减1
|
||||
* @return false 如果当前的引用计数≤1，操作失败
|
||||
*/
|
||||
bool lockref_dec_not_zero(struct lockref *lock_ref)
|
||||
{
|
||||
CMPXCHG_LOOP(
|
||||
lock_ref,
|
||||
{
|
||||
if (old.count <= 1)
|
||||
return false;
|
||||
--new.count;
|
||||
},
|
||||
{ return true; })
|
||||
|
||||
bool retval = false;
|
||||
spin_lock(&lock_ref->lock);
|
||||
if (lock_ref->count > 1)
|
||||
{
|
||||
--lock_ref->count;
|
||||
retval = true;
|
||||
}
|
||||
spin_unlock(&lock_ref->lock);
|
||||
return retval;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 原子地减少引用计数。若当前的引用计数≤1，则操作失败
|
||||
*
|
||||
* 该函数与lockref_dec_not_zero()的区别在于，当cmpxchg()时发现old.count≤1时，该函数会尝试加锁来进行操作。
|
||||
* 而后者在这种情况下，会直接返回false.
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return true 成功将引用计数减1
|
||||
* @return false 如果当前的引用计数≤1，操作失败
|
||||
*/
|
||||
bool lockref_dec_or_lock_not_zero(struct lockref *lock_ref)
|
||||
{
|
||||
CMPXCHG_LOOP(
|
||||
lock_ref,
|
||||
{
|
||||
if (old.count <= 1)
|
||||
break;
|
||||
--new.count;
|
||||
},
|
||||
{ return true; });
|
||||
|
||||
bool retval = false;
|
||||
spin_lock(&lock_ref->lock);
|
||||
if (lock_ref->count > 1)
|
||||
{
|
||||
--lock_ref->count;
|
||||
retval = true;
|
||||
}
|
||||
spin_unlock(&lock_ref->lock);
|
||||
return retval;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 将lockref变量标记为已经死亡（将count设置为负值）
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
*/
|
||||
void lockref_mark_dead(struct lockref *lock_ref)
|
||||
{
|
||||
// 需要自旋锁先被加锁，若没有被加锁，则会抛出错误信息
|
||||
assert_spin_locked(&lock_ref->lock);
|
||||
lock_ref->count = -128;
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief 自增引用计数。（除非该lockref已经死亡）
|
||||
*
|
||||
* @param lock_ref 指向要被操作的lockref变量的指针
|
||||
* @return true 操作成功
|
||||
* @return false 操作失败，lockref已死亡
|
||||
*/
|
||||
bool lockref_inc_not_dead(struct lockref *lock_ref)
|
||||
{
|
||||
CMPXCHG_LOOP(
|
||||
lock_ref,
|
||||
{
|
||||
if (old.count < 0)
|
||||
return false;
|
||||
++new.count;
|
||||
},
|
||||
{ return true; })
|
||||
|
||||
bool retval = false;
|
||||
// 快捷路径操作失败，尝试加锁
|
||||
spin_lock(&lock_ref->lock);
|
||||
if (lock_ref->count >= 0)
|
||||
{
|
||||
++lock_ref->count;
|
||||
retval = true;
|
||||
}
|
||||
spin_unlock(&lock_ref->lock);
|
||||
return retval;
|
||||
}
|
||||
|
||||
#endif
|
||||
File diff suppressed because it is too large
Load Diff
@ -32,18 +32,6 @@ macro_rules! println {
|
||||
($($arg:tt)*) => ($crate::print!("{}\n", format_args!($($arg)*)));
|
||||
}
|
||||
|
||||
/// 指定颜色，彩色输出
|
||||
/// @param FRcolor 前景色
|
||||
/// @param BKcolor 背景色
|
||||
#[macro_export]
|
||||
macro_rules! printk_color {
|
||||
|
||||
($FRcolor:expr, $BKcolor:expr, $($arg:tt)*) => {
|
||||
use alloc;
|
||||
$crate::libs::printk::PrintkWriter.__write_string_color($FRcolor, $BKcolor, alloc::fmt::format(format_args!($($arg)*)).as_str())
|
||||
};
|
||||
}
|
||||
|
||||
#[macro_export]
|
||||
macro_rules! kdebug {
|
||||
($($arg:tt)*) => {
|
||||
|
||||
@ -1,29 +0,0 @@
|
||||
#include <common/stdlib.h>
|
||||
|
||||
/**
|
||||
* @brief 将长整型转换为字符串
|
||||
*
|
||||
* @param input 输入的数据
|
||||
* @return const char* 结果字符串
|
||||
*/
|
||||
const char *ltoa(long input)
|
||||
{
|
||||
/* large enough for -9223372036854775808 */
|
||||
static char buffer[21] = {0};
|
||||
char *pos = buffer + sizeof(buffer) - 1;
|
||||
int neg = input < 0;
|
||||
unsigned long n = neg ? -input : input;
|
||||
|
||||
*pos-- = '\0';
|
||||
do
|
||||
{
|
||||
*pos-- = '0' + n % 10;
|
||||
n /= 10;
|
||||
if (pos < buffer)
|
||||
return pos + 1;
|
||||
} while (n);
|
||||
|
||||
if (neg)
|
||||
*pos-- = '-';
|
||||
return pos + 1;
|
||||
}
|
||||
@ -1,14 +0,0 @@
|
||||
|
||||
CFLAGS += -I .
|
||||
|
||||
kernel_lib_sys_objs:= $(shell find ./*.c)
|
||||
|
||||
ECHO:
|
||||
@echo "$@"
|
||||
|
||||
$(kernel_lib_sys_objs): ECHO
|
||||
$(CC) $(CFLAGS) -c $@ -o $@.o
|
||||
|
||||
all: $(kernel_lib_sys_objs)
|
||||
@echo $(kernel_lib_sys_objs)
|
||||
|
||||
@ -1,15 +0,0 @@
|
||||
#include <syscall/syscall_num.h>
|
||||
#include <syscall/syscall.h>
|
||||
|
||||
/**
|
||||
* @brief 等待指定pid的子进程退出
|
||||
*
|
||||
* @param pid 子进程的pid
|
||||
* @param stat_loc 返回的子进程结束状态
|
||||
* @param options 额外的控制选项
|
||||
* @return pid_t
|
||||
*/
|
||||
pid_t waitpid(pid_t pid, int *stat_loc, int options)
|
||||
{
|
||||
return (pid_t)enter_syscall_int(SYS_WAIT4, (uint64_t)pid, (uint64_t)stat_loc, options, 0, 0, 0);
|
||||
}
|
||||
@ -14,6 +14,7 @@ use crate::{
|
||||
resource::{RLimit64, RUsage},
|
||||
ProcessManager,
|
||||
},
|
||||
syscall::user_access::check_and_clone_cstr,
|
||||
};
|
||||
|
||||
use num_traits::FromPrimitive;
|
||||
@ -58,10 +59,6 @@ pub const SYS_SCHED: usize = 100003;
|
||||
#[derive(Debug)]
|
||||
pub struct Syscall;
|
||||
|
||||
extern "C" {
|
||||
fn do_put_string(s: *const u8, front_color: u32, back_color: u32) -> usize;
|
||||
}
|
||||
|
||||
impl Syscall {
|
||||
/// 初始化系统调用
|
||||
#[inline(never)]
|
||||
@ -1047,7 +1044,16 @@ impl Syscall {
|
||||
front_color: u32,
|
||||
back_color: u32,
|
||||
) -> Result<usize, SystemError> {
|
||||
return Ok(unsafe { do_put_string(s, front_color, back_color) });
|
||||
// todo: 删除这个系统调用
|
||||
let s = check_and_clone_cstr(s, Some(4096))?;
|
||||
let fr = (front_color & 0x00ff0000) >> 16;
|
||||
let fg = (front_color & 0x0000ff00) >> 8;
|
||||
let fb = front_color & 0x000000ff;
|
||||
let br = (back_color & 0x00ff0000) >> 16;
|
||||
let bg = (back_color & 0x0000ff00) >> 8;
|
||||
let bb = back_color & 0x000000ff;
|
||||
print!("\x1B[38;2;{fr};{fg};{fb};48;2;{br};{bg};{bb}m{s}\x1B[0m");
|
||||
return Ok(s.len());
|
||||
}
|
||||
|
||||
pub fn reboot() -> Result<usize, SystemError> {
|
||||
|
||||
@ -1,11 +1,11 @@
|
||||
#include "syscall.h"
|
||||
#include <arch/arch.h>
|
||||
#include <common/errno.h>
|
||||
#include <common/fcntl.h>
|
||||
#include <common/string.h>
|
||||
#include <mm/slab.h>
|
||||
#include <process/process.h>
|
||||
#include <time/sleep.h>
|
||||
#include <arch/arch.h>
|
||||
|
||||
#if ARCH(I386) || ARCH(X86_64)
|
||||
// 导出系统调用入口函数，定义在entry.S中
|
||||
@ -26,8 +26,8 @@ extern void syscall_int(void);
|
||||
* @return long
|
||||
*/
|
||||
|
||||
long enter_syscall_int(ul syscall_id, ul arg0, ul arg1, ul arg2, ul arg3, ul arg4, ul arg5)
|
||||
{
|
||||
long enter_syscall_int(ul syscall_id, ul arg0, ul arg1, ul arg2, ul arg3,
|
||||
ul arg4, ul arg5) {
|
||||
long err_code;
|
||||
__asm__ __volatile__("movq %2, %%rdi \n\t"
|
||||
"movq %3, %%rsi \n\t"
|
||||
@ -37,37 +37,19 @@ long enter_syscall_int(ul syscall_id, ul arg0, ul arg1, ul arg2, ul arg3, ul arg
|
||||
"movq %7, %%r9 \n\t"
|
||||
"int $0x80 \n\t"
|
||||
: "=a"(err_code)
|
||||
: "a"(syscall_id), "m"(arg0), "m"(arg1), "m"(arg2), "m"(arg3), "m"(arg4), "m"(arg5)
|
||||
: "a"(syscall_id), "m"(arg0), "m"(arg1), "m"(arg2),
|
||||
"m"(arg3), "m"(arg4), "m"(arg5)
|
||||
: "memory", "r8", "r9", "r10", "rdi", "rsi", "rdx");
|
||||
|
||||
return err_code;
|
||||
}
|
||||
|
||||
#else
|
||||
long enter_syscall_int(ul syscall_id, ul arg0, ul arg1, ul arg2, ul arg3, ul arg4, ul arg5)
|
||||
{
|
||||
while (1)
|
||||
{
|
||||
long enter_syscall_int(ul syscall_id, ul arg0, ul arg1, ul arg2, ul arg3,
|
||||
ul arg4, ul arg5) {
|
||||
while (1) {
|
||||
/* code */
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
||||
/**
|
||||
* @brief 打印字符串的系统调用
|
||||
*
|
||||
* 当arg1和arg2均为0时，打印黑底白字，否则按照指定的前景色和背景色来打印
|
||||
*
|
||||
* @param regs 寄存器
|
||||
* @param arg0 要打印的字符串
|
||||
* @param arg1 前景色
|
||||
* @param arg2 背景色
|
||||
* @return ul 返回值
|
||||
*/
|
||||
ul do_put_string(char *s, uint32_t front_color, uint32_t background_color)
|
||||
{
|
||||
|
||||
printk_color(front_color, background_color, s);
|
||||
return 0;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user