File Manager

Hackfut Security File Manager

Current Path: /opt/td-agent/embedded/include/postgresql/server/utils

opt / td-agent / embedded / include / postgresql / server / utils /

📁 ..
📄 acl.h(13.83 KB)
📄 aclchk_internal.h(1.42 KB)
📄 array.h(18.84 KB)
📄 arrayaccess.h(2.97 KB)
📄 ascii.h(579 B)
📄 attoptcache.h(725 B)
📄 builtins.h(56.08 KB)
📄 bytea.h(1.63 KB)
📄 cash.h(2.07 KB)
📄 catcache.h(7.4 KB)
📄 combocid.h(870 B)
📄 date.h(7.77 KB)
📄 datetime.h(10.59 KB)
📄 datum.h(1.88 KB)
📄 dynahash.h(498 B)
📄 dynamic_loader.h(648 B)
📄 elog.h(14.74 KB)
📄 errcodes.h(20.1 KB)
📄 evtcache.h(934 B)
📄 expandeddatum.h(6.89 KB)
📄 fmgroids.h(72.24 KB)
📄 fmgrtab.h(1.15 KB)
📄 formatting.h(1.41 KB)
📄 geo_decls.h(16.22 KB)
📄 guc.h(15.6 KB)
📄 guc_tables.h(7.22 KB)
📄 help_config.h(457 B)
📄 hsearch.h(5.97 KB)
📄 index_selfuncs.h(2.16 KB)
📄 inet.h(4.6 KB)
📄 int8.h(4.12 KB)
📄 inval.h(1.71 KB)
📄 json.h(3.26 KB)
📄 jsonapi.h(4.19 KB)
📄 jsonb.h(16.13 KB)
📄 logtape.h(1.5 KB)
📄 lsyscache.h(6.91 KB)
📄 memdebug.h(1.25 KB)
📄 memutils.h(6.16 KB)
📄 nabstime.h(5.79 KB)
📄 numeric.h(1.92 KB)
📄 palloc.h(5.04 KB)
📄 pg_crc.h(3.42 KB)
📄 pg_locale.h(2.63 KB)
📄 pg_lsn.h(1.29 KB)
📄 pg_rusage.h(847 B)
📄 plancache.h(8.36 KB)
📄 portal.h(9.64 KB)
📄 probes.h(6.54 KB)
📄 ps_status.h(668 B)
📄 rangetypes.h(8.31 KB)
📄 rel.h(18.18 KB)
📄 relcache.h(3.79 KB)
📄 relfilenodemap.h(561 B)
📄 relmapper.h(1.8 KB)
📄 reltrigger.h(1.95 KB)
📄 resowner.h(2.52 KB)
📄 resowner_private.h(3.42 KB)
📄 rls.h(1.73 KB)
📄 ruleutils.h(1.2 KB)
📄 sampling.h(1.96 KB)
📄 selfuncs.h(9.39 KB)
📄 snapmgr.h(4.13 KB)
📄 snapshot.h(4.2 KB)
📄 sortsupport.h(10.81 KB)
📄 spccache.h(604 B)
📄 syscache.h(5.91 KB)
📄 timeout.h(2.48 KB)
📄 timestamp.h(10.34 KB)
📄 tqual.h(4.11 KB)
📄 tuplesort.h(4.86 KB)
📄 tuplestore.h(3.23 KB)
📄 typcache.h(5.71 KB)
📄 tzparser.h(1.13 KB)
📄 uuid.h(861 B)
📄 varbit.h(4.31 KB)
📄 xml.h(3.89 KB)

Editing: pg_crc.h

/*
 * pg_crc.h
 *
 * PostgreSQL CRC support
 *
 * See Ross Williams' excellent introduction
 * A PAINLESS GUIDE TO CRC ERROR DETECTION ALGORITHMS, available from
 * http://www.ross.net/crc/ or several other net sites.
 *
 * We have three slightly different variants of a 32-bit CRC calculation:
 * CRC-32C (Castagnoli polynomial), CRC-32 (Ethernet polynomial), and a legacy
 * CRC-32 version that uses the lookup table in a funny way. They all consist
 * of four macros:
 *
 * INIT_<variant>(crc)
 *		Initialize a CRC accumulator
 *
 * COMP_<variant>(crc, data, len)
 *		Accumulate some (more) bytes into a CRC
 *
 * FIN_<variant>(crc)
 *		Finish a CRC calculation
 *
 * EQ_<variant>(c1, c2)
 *		Check for equality of two CRCs.
 *
 * The CRC-32C variant is in port/pg_crc32c.h.
 *
 * Portions Copyright (c) 1996-2016, PostgreSQL Global Development Group
 * Portions Copyright (c) 1994, Regents of the University of California
 *
 * src/include/utils/pg_crc.h
 */
#ifndef PG_CRC_H
#define PG_CRC_H

typedef uint32 pg_crc32;

/*
 * CRC-32, the same used e.g. in Ethernet.
 *
 * This is currently only used in ltree and hstore contrib modules. It uses
 * the same lookup table as the legacy algorithm below. New code should
 * use the Castagnoli version instead.
 */
#define INIT_TRADITIONAL_CRC32(crc) ((crc) = 0xFFFFFFFF)
#define FIN_TRADITIONAL_CRC32(crc)	((crc) ^= 0xFFFFFFFF)
#define COMP_TRADITIONAL_CRC32(crc, data, len)	\
	COMP_CRC32_NORMAL_TABLE(crc, data, len, pg_crc32_table)
#define EQ_TRADITIONAL_CRC32(c1, c2) ((c1) == (c2))

/* Sarwate's algorithm, for use with a "normal" lookup table */
#define COMP_CRC32_NORMAL_TABLE(crc, data, len, table)			  \
do {															  \
	const unsigned char *__data = (const unsigned char *) (data); \
	uint32		__len = (len); \
\
	while (__len-- > 0) \
	{ \
		int		__tab_index = ((int) (crc) ^ *__data++) & 0xFF; \
		(crc) = table[__tab_index] ^ ((crc) >> 8); \
	} \
} while (0)

/*
 * The CRC algorithm used for WAL et al in pre-9.5 versions.
 *
 * This closely resembles the normal CRC-32 algorithm, but is subtly
 * different. Using Williams' terms, we use the "normal" table, but with
 * "reflected" code. That's bogus, but it was like that for years before
 * anyone noticed. It does not correspond to any polynomial in a normal CRC
 * algorithm, so it's not clear what the error-detection properties of this
 * algorithm actually are.
 *
 * We still need to carry this around because it is used in a few on-disk
 * structures that need to be pg_upgradeable. It should not be used in new
 * code.
 */
#define INIT_LEGACY_CRC32(crc) ((crc) = 0xFFFFFFFF)
#define FIN_LEGACY_CRC32(crc)	((crc) ^= 0xFFFFFFFF)
#define COMP_LEGACY_CRC32(crc, data, len)	\
	COMP_CRC32_REFLECTED_TABLE(crc, data, len, pg_crc32_table)
#define EQ_LEGACY_CRC32(c1, c2) ((c1) == (c2))

/*
 * Sarwate's algorithm, for use with a "reflected" lookup table (but in the
 * legacy algorithm, we actually use it on a "normal" table, see above)
 */
#define COMP_CRC32_REFLECTED_TABLE(crc, data, len, table) \
do {															  \
	const unsigned char *__data = (const unsigned char *) (data); \
	uint32		__len = (len); \
\
	while (__len-- > 0) \
	{ \
		int		__tab_index = ((int) ((crc) >> 24) ^ *__data++) & 0xFF; \
		(crc) = table[__tab_index] ^ ((crc) << 8); \
	} \
} while (0)

/*
 * Constant table for the CRC-32 polynomials. The same table is used by both
 * the normal and traditional variants.
 */
extern PGDLLIMPORT const uint32 pg_crc32_table[256];

#endif   /* PG_CRC_H */

Hackfut Security File Manager

Editing: pg_crc.h

Upload File

Create Folder