database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-27 12:41:57 +03:00
Code Activity

8.4 pgindent run, with new combined Linux/FreeBSD/MinGW typedef list

Browse Source 
provided by Andrew.
This commit is contained in:
Bruce Momjian
2009-06-11 14:49:15 +00:00
parent 4e86efb4e5
commit d747140279
654 changed files with 11900 additions and 11387 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
contrib/ltree/ltree_gist.c
View File

@ -1,7 +1,7 @@
/*
* GiST support for ltree
* Teodor Sigaev <teodor@stack.net>
* $PostgreSQL: pgsql/contrib/ltree/ltree_gist.c,v 1.24 2008/05/12 00:00:42 alvherre Exp $
* $PostgreSQL: pgsql/contrib/ltree/ltree_gist.c,v 1.25 2009/06/11 14:48:51 momjian Exp $
*/
#include "postgres.h"
@ -150,7 +150,7 @@ ltree_same(PG_FUNCTION_ARGS)
}
static void
hashing(BITVECP sign, ltree * t)
hashing(BITVECP sign, ltree *t)
{
int tlen = t->numlevel;
ltree_level *cur = LTREE_FIRST(t);
@ -271,7 +271,7 @@ typedef struct rix
{
int index;
ltree *r;
} RIX;
} RIX;
static int
treekey_cmp(const void *a, const void *b)
@ -441,7 +441,7 @@ ltree_picksplit(PG_FUNCTION_ARGS)
}
static bool
gist_isparent(ltree_gist * key, ltree * query)
gist_isparent(ltree_gist *key, ltree *query)
{
int4 numlevel = query->numlevel;
int i;
@ -461,7 +461,7 @@ gist_isparent(ltree_gist * key, ltree * query)
}
static ltree *
copy_ltree(ltree * src)
copy_ltree(ltree *src)
{
ltree *dst = (ltree *) palloc(VARSIZE(src));
@ -470,7 +470,7 @@ copy_ltree(ltree * src)
}
static bool
gist_ischild(ltree_gist * key, ltree * query)
gist_ischild(ltree_gist *key, ltree *query)
{
ltree *left = copy_ltree(LTG_GETLNODE(key));
ltree *right = copy_ltree(LTG_GETRNODE(key));
@ -495,7 +495,7 @@ gist_ischild(ltree_gist * key, ltree * query)
}
static bool
gist_qe(ltree_gist * key, lquery * query)
gist_qe(ltree_gist *key, lquery *query)
{
lquery_level *curq = LQUERY_FIRST(query);
BITVECP sign = LTG_SIGN(key);
@ -534,7 +534,7 @@ gist_qe(ltree_gist * key, lquery * query)
}
static int
gist_tqcmp(ltree * t, lquery * q)
gist_tqcmp(ltree *t, lquery *q)
{
ltree_level *al = LTREE_FIRST(t);
lquery_level *ql = LQUERY_FIRST(q);
@ -563,7 +563,7 @@ gist_tqcmp(ltree * t, lquery * q)
}
static bool
gist_between(ltree_gist * key, lquery * query)
gist_between(ltree_gist *key, lquery *query)
{
if (query->firstgood == 0)
return true;
@ -578,13 +578,13 @@ gist_between(ltree_gist * key, lquery * query)
}
static bool
checkcondition_bit(void *checkval, ITEM * val)
checkcondition_bit(void *checkval, ITEM *val)
{
return (FLG_CANLOOKSIGN(val->flag)) ? GETBIT(checkval, HASHVAL(val->val)) : true;
}
static bool
gist_qtxt(ltree_gist * key, ltxtquery * query)
gist_qtxt(ltree_gist *key, ltxtquery *query)
{
if (LTG_ISALLTRUE(key))
return true;
@ -597,7 +597,7 @@ gist_qtxt(ltree_gist * key, ltxtquery * query)
}
static bool
arrq_cons(ltree_gist * key, ArrayType *_query)
arrq_cons(ltree_gist *key, ArrayType *_query)
{
lquery *query = (lquery *) ARR_DATA_PTR(_query);
int num = ArrayGetNItems(ARR_NDIM(_query), ARR_DIMS(_query));
@ -626,6 +626,7 @@ ltree_consistent(PG_FUNCTION_ARGS)
{
GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
/* Oid subtype = PG_GETARG_OID(3); */
bool *recheck = (bool *) PG_GETARG_POINTER(4);
ltree_gist *key = (ltree_gist *) DatumGetPointer(entry->key);