@@ -106,7 +106,7 @@ makesign(BITVECP sign, TRGM *a, int siglen)
106
106
SETBIT (sign , SIGLENBIT (siglen )); /* set last unused bit */
107
107
for (k = 0 ; k < len ; k ++ )
108
108
{
109
- CPTRGM ((( char * ) & tmp ) , ptr + k );
109
+ CPTRGM (& tmp , ptr + k );
110
110
HASH (sign , tmp , siglen );
111
111
}
112
112
}
@@ -186,7 +186,7 @@ cnt_sml_sign_common(TRGM *qtrg, BITVECP sign, int siglen)
186
186
187
187
for (k = 0 ; k < len ; k ++ )
188
188
{
189
- CPTRGM ((( char * ) & tmp ) , ptr + k );
189
+ CPTRGM (& tmp , ptr + k );
190
190
count += GETBIT (sign , HASHVAL (tmp , siglen ));
191
191
}
192
192
@@ -373,7 +373,7 @@ gtrgm_consistent(PG_FUNCTION_ARGS)
373
373
res = true;
374
374
for (k = 0 ; k < len ; k ++ )
375
375
{
376
- CPTRGM ((( char * ) & tmp ) , ptr + k );
376
+ CPTRGM (& tmp , ptr + k );
377
377
if (!GETBIT (sign , HASHVAL (tmp , siglen )))
378
378
{
379
379
res = false;
@@ -426,7 +426,7 @@ gtrgm_consistent(PG_FUNCTION_ARGS)
426
426
check = (bool * ) palloc (len * sizeof (bool ));
427
427
for (k = 0 ; k < len ; k ++ )
428
428
{
429
- CPTRGM ((( char * ) & tmp ) , ptr + k );
429
+ CPTRGM (& tmp , ptr + k );
430
430
check [k ] = GETBIT (sign , HASHVAL (tmp , siglen ));
431
431
}
432
432
res = trigramsMatchGraph (cache -> graph , check );
@@ -552,7 +552,7 @@ unionkey(BITVECP sbase, TRGM *add, int siglen)
552
552
553
553
for (i = 0 ; i < ARRNELEM (add ); i ++ )
554
554
{
555
- CPTRGM ((( char * ) & tmp ) , ptr + i );
555
+ CPTRGM (& tmp , ptr + i );
556
556
HASH (sbase , tmp , siglen );
557
557
}
558
558
}
0 commit comments