restrictions_input.h File Reference

#include <stddef.h>
#include "c_types/restriction_t.h"

Include dependency graph for restrictions_input.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
void	pgr_get_restrictions (char *restrictions_sql, Restriction_t **restrictions, size_t *total_restrictions)

Function Documentation

pgr_get_restrictions()

void pgr_get_restrictions	(	char *	restrictions_sql,
		Restriction_t **	restrictions,
		size_t *	total_restrictions
	)

Definition at line 63 of file restrictions_input.c.

                                    {
    const int tuple_limit = 1000000;
    clock_t start_t = clock();
 
    PGR_DBG("pgr_get_restrictions");
    PGR_DBG("%s", restrictions_sql);
 
    Column_info_t info[3];
 
    int i;
    for (i = 0; i < 3; ++i) {
        info[i].colNumber = -1;
        info[i].type = 0;
        info[i].strict = true;
    }
 
    /* restriction id */
    info[0].name = "id";
    info[1].name = "cost";
    /* array of edges */
    info[2].name = "path";
 
    info[0].eType = ANY_INTEGER;
    info[1].eType = ANY_NUMERICAL;
    info[2].eType = ANY_INTEGER_ARRAY;
 
    info[1].strict = false;
 
    size_t total_tuples;
 
    void *SPIplan;
    SPIplan = pgr_SPI_prepare(restrictions_sql);
    Portal SPIportal;
    SPIportal = pgr_SPI_cursor_open(SPIplan);
 
    bool moredata = true;
    (*total_restrictions) = total_tuples = 0;
 
 
    /*  on the first tuple get the column numbers */
 
    while (moredata == true) {
        SPI_cursor_fetch(SPIportal, true, tuple_limit);
        if (total_tuples == 0) {
            pgr_fetch_column_info(info, 3);
        }
        size_t ntuples = SPI_processed;
        total_tuples += ntuples;
        PGR_DBG("Restrictions to be processed %ld", ntuples);
        PGR_DBG("size of structure %ld",  sizeof(Restriction_t));
        if (ntuples > 0) {
            if ((*restrictions) == NULL) {
                (*restrictions) = (Restriction_t *)palloc(
                        total_tuples * sizeof(Restriction_t));
            } else {
                (*restrictions) = (Restriction_t *)repalloc(
                        (*restrictions),
                        total_tuples * sizeof(Restriction_t));
            }
 
            if ((*restrictions) == NULL) {
                elog(ERROR, "Out of memory");
            }
 
            size_t t;
            SPITupleTable *tuptable = SPI_tuptable;
            TupleDesc tupdesc = SPI_tuptable->tupdesc;
            PGR_DBG("processing %ld", ntuples);
            for (t = 0; t < ntuples; t++) {
                HeapTuple tuple = tuptable->vals[t];
                fetch_restriction(&tuple, &tupdesc, info,
                        &(*restrictions)[total_tuples - ntuples + t]);
            }
            SPI_freetuptable(tuptable);
        } else {
            moredata = false;
        }
    }
 
    SPI_cursor_close(SPIportal);
 
    if (total_tuples == 0) {
        (*total_restrictions) = 0;
        PGR_DBG("NO restrictions");
        return;
    }
 
    (*total_restrictions) = total_tuples;
    PGR_DBG("Finish reading %ld restrictions, %ld",
            total_tuples,
            (*total_restrictions));
    clock_t end_t = clock();
    time_msg(" reading Restrictions", start_t, end_t);
}

References ANY_INTEGER, ANY_INTEGER_ARRAY, ANY_NUMERICAL, Column_info_t::colNumber, Column_info_t::eType, fetch_restriction(), Column_info_t::name, PGR_DBG, pgr_fetch_column_info(), pgr_SPI_cursor_open(), pgr_SPI_prepare(), Column_info_t::strict, time_msg(), and Column_info_t::type.

Referenced by compute_trsp(), and process().