matrixRows_input.c

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
File: matrixRows_input.c
 
Copyright (c) 2015 pgRouting developers
Mail: [email protected]
 
Developer:
Copyright (c) 2015 Celia Virginia Vergara Castillo
 
------
 
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
 
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
 
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 ********************************************************************PGR-GNU*/
 
#include "c_common/matrixRows_input.h"
 
#include "c_types/column_info_t.h"
#include "c_types/matrix_cell_t.h"
 
#include "c_common/get_check_data.h"
 
#ifdef PROFILE
#include "c_common/time_msg.h"
#include "c_common/debug_macro.h"
#endif
 
/*
.. pgr_pickDeliver start
 
A ``SELECT`` statement that returns the following columns:
 
::
 
    start_vid, end_vid, agg_cost
 
============= =============== ================================================
Column        Type            Description
============= =============== ================================================
**start_vid** |ANY-INTEGER|   Identifier of a node.
**end_vid**   |ANY-NUMERICAL| Identifier of a node
**agg_cost**  |ANY-NUMERICAL| Time to travel from ``start_vid`` to ``end_vid``
============= =============== ================================================
 
.. pgr_pickDeliver end
 
*/
 
static
void fetch_plain(
        HeapTuple *tuple,
        TupleDesc *tupdesc,
        Column_info_t info[3],
        Matrix_cell_t *row) {
    row->from_vid = get_Id(tuple, tupdesc,  info[0], -1);
    row->to_vid = get_Id(tuple, tupdesc,  info[1], -1);
    row->cost = get_PositiveTInterval_plain(tuple, tupdesc, info[2], 0);
}
 
static
void fetch_timestamps(
        HeapTuple *tuple,
        TupleDesc *tupdesc,
        Column_info_t info[3],
        Matrix_cell_t *row) {
    row->from_vid = get_Id(tuple, tupdesc,  info[0], -1);
    row->to_vid = get_Id(tuple, tupdesc,  info[1], -1);
    row->cost = get_PositiveTInterval(tuple, tupdesc, info[2], 0);
}
 
static
void
get_matrixRows_general(
    char *sql,
    Column_info_t *info,
    const int kind,
    Matrix_cell_t **rows,
    size_t *total_rows) {
#ifdef PROFILE
  clock_t start_t = clock();
  PGR_DBG("%s", sql);
#endif
 
  const int tuple_limit = 1000000;
  size_t total_tuples = 0;
  const int column_count = 3;
 
  void *SPIplan;
  SPIplan = pgr_SPI_prepare(sql);
 
  Portal SPIportal;
  SPIportal = pgr_SPI_cursor_open(SPIplan);
 
 
  bool moredata = true;
  (*total_rows) = total_tuples;
 
  while (moredata == true) {
    SPI_cursor_fetch(SPIportal, true, tuple_limit);
    if (total_tuples == 0)
      pgr_fetch_column_info(info, column_count);
 
    size_t ntuples = SPI_processed;
    total_tuples += ntuples;
 
    if (ntuples > 0) {
      if ((*rows) == NULL)
        (*rows) = (Matrix_cell_t *)palloc0(
            total_tuples * sizeof(Matrix_cell_t));
      else
        (*rows) = (Matrix_cell_t *)repalloc(
            (*rows), total_tuples * sizeof(Matrix_cell_t));
 
      if ((*rows) == NULL) {
        elog(ERROR, "Out of memory");
      }
 
      SPITupleTable *tuptable = SPI_tuptable;
      TupleDesc tupdesc = SPI_tuptable->tupdesc;
 
      size_t t;
      for (t = 0; t < ntuples; t++) {
        HeapTuple tuple = tuptable->vals[t];
        switch (kind) {
          case 0 : fetch_timestamps(&tuple, &tupdesc, info,
                       &(*rows)[total_tuples - ntuples + t]);
                   break;
          case 1 : fetch_plain(&tuple, &tupdesc, info,
                       &(*rows)[total_tuples - ntuples + t]);
                   break;
        }
      }
      SPI_freetuptable(tuptable);
    } else {
      moredata = false;
    }
  }
 
  SPI_cursor_close(SPIportal);
 
 
  if (total_tuples == 0) {
    (*total_rows) = 0;
    return;
  }
 
  (*total_rows) = total_tuples;
#ifdef PROFILE
  time_msg(" reading time matrix", start_t, clock());
#endif
}
 
void
get_matrixRows(
    char *sql,
    Matrix_cell_t **rows,
    size_t *total_rows) {
  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;
    info[i].eType = ANY_INTEGER;
  }
  info[0].name = "start_vid";
  info[1].name = "end_vid";
  info[2].name = "travel_time";
 
  info[2].eType = INTERVAL;
  get_matrixRows_general(sql, info, 0, rows, total_rows);
}
 
void
get_matrixRows_plain(
    char *sql,
    Matrix_cell_t **rows,
    size_t *total_rows) {
  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;
    info[i].eType = ANY_INTEGER;
  }
  info[0].name = "start_vid";
  info[1].name = "end_vid";
  info[2].name = "agg_cost";
 
  info[2].eType = ANY_NUMERICAL;
  get_matrixRows_general(sql, info, 1, rows, total_rows);
}