@@ -190,36 +190,36 @@ load_check_constraints(Oid parent_oid)
190190proc = SPI_processed ;
191191
192192if (ret > 0 && SPI_tuptable != NULL )
193-
194- // TupleDesc tupdesc = SPI_tuptable->tupdesc;
195- SPITupleTable * tuptable = SPI_tuptable ;
196- Oid * children ;
197- RangeEntry * ranges ;
198- Datum min ;
199- Datum max ;
193+
194+ // TupleDesc tupdesc = SPI_tuptable->tupdesc;
195+ SPITupleTable * tuptable = SPI_tuptable ;
196+ Oid * children ;
197+ RangeEntry * ranges ;
198+ Datum min ;
199+ Datum max ;
200200int hash ;
201201HashRelation * hashrel ;
202202
203- alloc_dsm_array (& prel -> children ,sizeof (Oid ),proc );
204- children = (Oid * )dsm_array_get_pointer (& prel -> children );
203+ alloc_dsm_array (& prel -> children ,sizeof (Oid ),proc );
204+ children = (Oid * )dsm_array_get_pointer (& prel -> children );
205205
206- if (prel -> parttype == PT_RANGE )
207-
206+ if (prel -> parttype == PT_RANGE )
207+
208208rangerel = (RangeRelation * )
209209hash_search (range_restrictions , (void * )& parent_oid ,HASH_ENTER ,& found );
210210
211- alloc_dsm_array (& rangerel -> ranges ,sizeof (RangeEntry ),proc );
212- ranges = (RangeEntry * )dsm_array_get_pointer (& rangerel -> ranges );
213-
211+ alloc_dsm_array (& rangerel -> ranges ,sizeof (RangeEntry ),proc );
212+ ranges = (RangeEntry * )dsm_array_get_pointer (& rangerel -> ranges );
213+
214214
215- for (i = 0 ;i < proc ;i ++ )
216-
215+ for (i = 0 ;i < proc ;i ++ )
216+
217217RangeEntry re ;
218- HeapTuple tuple = tuptable -> vals [i ];
219- bool isnull ;
220- Datum val ;
221- char * conbin ;
222- Expr * expr ;
218+ HeapTuple tuple = tuptable -> vals [i ];
219+ bool isnull ;
220+ Datum val ;
221+ char * conbin ;
222+ Expr * expr ;
223223
224224// HeapTuplereltuple;
225225// Form_pg_class pg_class_tuple;
@@ -269,7 +269,7 @@ load_check_constraints(Oid parent_oid)
269269}
270270
271271/* TODO: check if some ranges overlap! */
272-
272+
273273}
274274
275275