@@ -107,24 +107,24 @@ static char *
107
107
get_phrase_distance (char * buf ,int16 * distance )
108
108
{
109
109
char * ptr = buf ;
110
- long l ;
111
110
char * endptr ;
111
+ long l ;
112
112
113
113
* distance = 1 ;
114
114
115
- while ( ptr && t_isspace (ptr ) )
115
+ while ( ptr && t_isspace (ptr ))
116
116
ptr += pg_mblen (ptr );
117
117
118
- if ( !t_iseq (ptr ,'[' ) )
118
+ if (!t_iseq (ptr ,'[' ))
119
119
return buf ;
120
120
ptr ++ ;
121
121
122
- while ( * ptr && t_isspace (ptr ) )
122
+ while ( * ptr && t_isspace (ptr ))
123
123
ptr += pg_mblen (ptr );
124
124
125
125
l = strtol (ptr ,& endptr ,10 );
126
126
127
- if (ptr == endptr )
127
+ if (ptr == endptr )
128
128
return buf ;
129
129
130
130
if (errno == ERANGE || l < 0 || l > MAXENTRYPOS )
@@ -135,14 +135,14 @@ get_phrase_distance(char *buf, int16 *distance)
135
135
136
136
ptr = endptr ;
137
137
138
- while ( * ptr && t_isspace (ptr ) )
138
+ while ( * ptr && t_isspace (ptr ))
139
139
ptr += pg_mblen (ptr );
140
140
141
- if ( !t_iseq (ptr ,']' ) )
141
+ if (!t_iseq (ptr ,']' ))
142
142
return buf ;
143
143
ptr ++ ;
144
144
145
- * distance = (int16 )l ;
145
+ * distance = (int16 )l ;
146
146
return ptr ;
147
147
}
148
148
@@ -243,7 +243,8 @@ gettoken_query(TSQueryParserState state,
243
243
state -> state = WAITOPERAND ;
244
244
* operator = OP_PHRASE ;
245
245
(state -> buf )++ ;
246
- state -> buf = get_phrase_distance (state -> buf ,weight /* use as storage for distance */ );
246
+ state -> buf = get_phrase_distance (state -> buf ,
247
+ weight );/* use as storage for distance */
247
248
return PT_OPR ;
248
249
}
249
250
else if (t_iseq (state -> buf ,')' ))
@@ -281,7 +282,7 @@ pushOperator(TSQueryParserState state, int8 oper, int16 distance)
281
282
{
282
283
QueryOperator * tmp ;
283
284
284
- Assert (oper == OP_NOT || oper == OP_AND || oper == OP_OR || oper == OP_PHRASE );
285
+ Assert (oper == OP_NOT || oper == OP_AND || oper == OP_OR || oper == OP_PHRASE );
285
286
286
287
tmp = (QueryOperator * )palloc0 (sizeof (QueryOperator ));
287
288
tmp -> type = QI_OPR ;
@@ -413,7 +414,9 @@ makepol(TSQueryParserState state,
413
414
opstack [lenstack - 1 ].op == OP_NOT ))
414
415
{
415
416
lenstack -- ;
416
- pushOperator (state ,opstack [lenstack ].op ,opstack [lenstack ].distance );
417
+ pushOperator (state ,
418
+ opstack [lenstack ].op ,
419
+ opstack [lenstack ].distance );
417
420
}
418
421
break ;
419
422
case PT_OPR :
@@ -436,14 +439,18 @@ makepol(TSQueryParserState state,
436
439
opstack [lenstack - 1 ].op == OP_NOT ))
437
440
{
438
441
lenstack -- ;
439
- pushOperator (state ,opstack [lenstack ].op ,opstack [lenstack ].distance );
442
+ pushOperator (state ,
443
+ opstack [lenstack ].op ,
444
+ opstack [lenstack ].distance );
440
445
}
441
446
break ;
442
447
case PT_CLOSE :
443
448
while (lenstack )
444
449
{
445
450
lenstack -- ;
446
- pushOperator (state ,opstack [lenstack ].op ,opstack [lenstack ].distance );
451
+ pushOperator (state ,
452
+ opstack [lenstack ].op ,
453
+ opstack [lenstack ].distance );
447
454
};
448
455
return ;
449
456
case PT_ERR :
@@ -457,7 +464,9 @@ makepol(TSQueryParserState state,
457
464
while (lenstack )
458
465
{
459
466
lenstack -- ;
460
- pushOperator (state ,opstack [lenstack ].op ,opstack [lenstack ].distance );
467
+ pushOperator (state ,
468
+ opstack [lenstack ].op ,
469
+ opstack [lenstack ].distance );
461
470
}
462
471
}
463
472
@@ -494,7 +503,9 @@ findoprnd_recurse(QueryItem *ptr, uint32 *pos, int nnodes, bool *needcleanup)
494
503
QueryOperator * curitem = & ptr [* pos ].qoperator ;
495
504
int tmp = * pos ;
496
505
497
- Assert (curitem -> oper == OP_AND || curitem -> oper == OP_OR || curitem -> oper == OP_PHRASE );
506
+ Assert (curitem -> oper == OP_AND ||
507
+ curitem -> oper == OP_OR ||
508
+ curitem -> oper == OP_PHRASE );
498
509
499
510
if (curitem -> oper == OP_PHRASE )
500
511
* needcleanup = true;
@@ -751,7 +762,7 @@ infix(INFIX *in, int parentPriority)
751
762
}
752
763
else if (in -> curpol -> qoperator .oper == OP_NOT )
753
764
{
754
- int priority = PRINT_PRIORITY (in -> curpol );
765
+ int priority = PRINT_PRIORITY (in -> curpol );
755
766
756
767
if (priority < parentPriority )
757
768
{
@@ -783,9 +794,9 @@ infix(INFIX *in, int parentPriority)
783
794
784
795
in -> curpol ++ ;
785
796
if (priority < parentPriority ||
786
- (op == OP_PHRASE &&
787
- (priority == parentPriority /*phrase are not commutative! */ ||
788
- parentPriority == OP_PRIORITY (OP_AND ) )))
797
+ (op == OP_PHRASE &&
798
+ (priority == parentPriority || /*phrases are not commutative! */
799
+ parentPriority == OP_PRIORITY (OP_AND ))))
789
800
{
790
801
needParenthesis = true;
791
802
RESIZEBUF (in ,2 );
@@ -806,7 +817,7 @@ infix(INFIX *in, int parentPriority)
806
817
infix (in ,priority );
807
818
808
819
/* print operator & right operand */
809
- RESIZEBUF (in ,3 + (2 + 10 /*distance */ )+ (nrm .cur - nrm .buf ));
820
+ RESIZEBUF (in ,3 + (2 + 10 /* distance */ )+ (nrm .cur - nrm .buf ));
810
821
switch (op )
811
822
{
812
823
case OP_OR :
@@ -816,7 +827,7 @@ infix(INFIX *in, int parentPriority)
816
827
sprintf (in -> cur ," & %s" ,nrm .buf );
817
828
break ;
818
829
case OP_PHRASE :
819
- if (distance != 1 )
830
+ if (distance != 1 )
820
831
sprintf (in -> cur ," ?[%d] %s" ,distance ,nrm .buf );
821
832
else
822
833
sprintf (in -> cur ," ? %s" ,nrm .buf );
@@ -903,7 +914,7 @@ tsquerysend(PG_FUNCTION_ARGS)
903
914
break ;
904
915
case QI_OPR :
905
916
pq_sendint (& buf ,item -> qoperator .oper ,sizeof (item -> qoperator .oper ));
906
- if (item -> qoperator .oper == OP_PHRASE )
917
+ if (item -> qoperator .oper == OP_PHRASE )
907
918
pq_sendint (& buf ,item -> qoperator .distance ,sizeof (item -> qoperator .distance ));
908
919
break ;
909
920
default :
@@ -920,16 +931,16 @@ tsquerysend(PG_FUNCTION_ARGS)
920
931
Datum
921
932
tsqueryrecv (PG_FUNCTION_ARGS )
922
933
{
923
- StringInfo buf = (StringInfo )PG_GETARG_POINTER (0 );
924
- TSQuery query ;
925
- int i ,
926
- len ;
927
- QueryItem * item ;
928
- int datalen ;
929
- char * ptr ;
930
- uint32 size ;
931
- const char * * operands ;
932
- bool needcleanup ;
934
+ StringInfo buf = (StringInfo )PG_GETARG_POINTER (0 );
935
+ TSQuery query ;
936
+ int i ,
937
+ len ;
938
+ QueryItem * item ;
939
+ int datalen ;
940
+ char * ptr ;
941
+ uint32 size ;
942
+ const char * * operands ;
943
+ bool needcleanup ;
933
944
934
945
size = pq_getmsgint (buf ,sizeof (uint32 ));
935
946
if (size > (MaxAllocSize /sizeof (QueryItem )))
@@ -1006,7 +1017,7 @@ tsqueryrecv(PG_FUNCTION_ARGS)
1006
1017
1007
1018
item -> qoperator .oper = oper ;
1008
1019
if (oper == OP_PHRASE )
1009
- item -> qoperator .distance = (int16 )pq_getmsgint (buf ,sizeof (int16 ));
1020
+ item -> qoperator .distance = (int16 )pq_getmsgint (buf ,sizeof (int16 ));
1010
1021
}
1011
1022
else
1012
1023
elog (ERROR ,"unrecognized tsquery node type: %d" ,item -> type );