edge_disjoint_paths.c File Reference

#include <stdbool.h>
#include "c_common/postgres_connection.h"
#include "utils/array.h"
#include "c_common/debug_macro.h"
#include "c_common/e_report.h"
#include "c_common/time_msg.h"
#include "c_common/edges_input.h"
#include "c_common/arrays_input.h"
#include "c_common/combinations_input.h"
#include "drivers/max_flow/edge_disjoint_paths_driver.h"

Include dependency graph for edge_disjoint_paths.c:

Go to the source code of this file.

Functions
PGDLLEXPORT Datum	_pgr_edgedisjointpaths (PG_FUNCTION_ARGS)
	PG_FUNCTION_INFO_V1 (_pgr_edgedisjointpaths)
static void	process (char *edges_sql, char *combinations_sql, ArrayType *starts, ArrayType *ends, bool directed, General_path_element_t **result_tuples, size_t *result_count)

Function Documentation

_pgr_edgedisjointpaths()

PGDLLEXPORT Datum _pgr_edgedisjointpaths

(

PG_FUNCTION_ARGS

)

Definition at line 138 of file edge_disjoint_paths.c.

                                         {
    FuncCallContext *funcctx;
    TupleDesc tuple_desc;
 
    General_path_element_t *result_tuples = NULL;
    size_t result_count = 0;
 
    if (SRF_IS_FIRSTCALL()) {
        MemoryContext oldcontext;
        funcctx = SRF_FIRSTCALL_INIT();
        oldcontext = MemoryContextSwitchTo(funcctx->multi_call_memory_ctx);
 
 
        if (PG_NARGS() == 4) {
            /*
             * many to many
             */
            process(
                text_to_cstring(PG_GETARG_TEXT_P(0)),
                NULL,
                PG_GETARG_ARRAYTYPE_P(1),
                PG_GETARG_ARRAYTYPE_P(2),
                PG_GETARG_BOOL(3),
                &result_tuples,
                &result_count);
 
        } else if (PG_NARGS() == 3) {
            /*
             * combinations
             */
            process(
                text_to_cstring(PG_GETARG_TEXT_P(0)),
                text_to_cstring(PG_GETARG_TEXT_P(1)),
                NULL,
                NULL,
                PG_GETARG_BOOL(2),
                &result_tuples,
                &result_count);
        }
 
 
#if PGSQL_VERSION > 95
        funcctx->max_calls = result_count;
#else
        funcctx->max_calls = (uint32_t)result_count;
#endif
        funcctx->user_fctx = result_tuples;
        if (get_call_result_type(fcinfo, NULL, &tuple_desc)
                != TYPEFUNC_COMPOSITE) {
            ereport(ERROR,
                    (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
                     errmsg("function returning record called in context "
                         "that cannot accept type record")));
        }
 
        funcctx->tuple_desc = tuple_desc;
        MemoryContextSwitchTo(oldcontext);
    }
 
    funcctx = SRF_PERCALL_SETUP();
    tuple_desc = funcctx->tuple_desc;
    result_tuples = (General_path_element_t *) funcctx->user_fctx;
 
    if (funcctx->call_cntr < funcctx->max_calls) {
        HeapTuple tuple;
        Datum result;
        Datum *values;
        bool *nulls;
 
 
        values = palloc(9 * sizeof(Datum));
        nulls = palloc(9 * sizeof(bool));
 
        size_t i;
        for (i = 0; i < 9; ++i) {
            nulls[i] = false;
        }
 
        values[0] = Int32GetDatum(funcctx->call_cntr + 1);
        values[1] = Int32GetDatum(
                result_tuples[funcctx->call_cntr].start_id + 1);
        values[2] = Int32GetDatum(result_tuples[funcctx->call_cntr].seq);
        values[3] = Int64GetDatum(result_tuples[funcctx->call_cntr].start_id);
        values[4] = Int64GetDatum(result_tuples[funcctx->call_cntr].end_id);
        values[5] = Int64GetDatum(result_tuples[funcctx->call_cntr].node);
        values[6] = Int64GetDatum(result_tuples[funcctx->call_cntr].edge);
        values[7] = Float8GetDatum(result_tuples[funcctx->call_cntr].cost);
        values[8] = Float8GetDatum(result_tuples[funcctx->call_cntr].agg_cost);
 
        tuple = heap_form_tuple(tuple_desc, values, nulls);
        result = HeapTupleGetDatum(tuple);
        SRF_RETURN_NEXT(funcctx, result);
    } else {
        SRF_RETURN_DONE(funcctx);
    }
}

References General_path_element_t::agg_cost, General_path_element_t::cost, General_path_element_t::edge, General_path_element_t::end_id, if(), General_path_element_t::node, process(), General_path_element_t::seq, and General_path_element_t::start_id.

PG_FUNCTION_INFO_V1()

PG_FUNCTION_INFO_V1

(

_pgr_edgedisjointpaths

)

process()

static void process ( char *  edges_sql, char *  combinations_sql, ArrayType *  starts, ArrayType *  ends, bool  directed, General_path_element_t **  result_tuples, size_t *  result_count  )

static

Definition at line 48 of file edge_disjoint_paths.c.

                          {
    pgr_SPI_connect();
 
    int64_t *source_vertices = NULL;
    size_t size_source_verticesArr = 0;
 
    int64_t *sink_vertices = NULL;
    size_t size_sink_verticesArr = 0;
 
 
    pgr_edge_t *edges = NULL;
    size_t total_edges = 0;
 
    pgr_combination_t *combinations = NULL;
    size_t total_combinations = 0;
 
    if (starts && ends) {
        source_vertices = (int64_t*)
            pgr_get_bigIntArray(&size_source_verticesArr, starts);
        sink_vertices = (int64_t*)
            pgr_get_bigIntArray(&size_sink_verticesArr, ends);
    } else if (combinations_sql) {
        pgr_get_combinations(combinations_sql, &combinations, &total_combinations);
        if (total_combinations == 0) {
            if (combinations)
                pfree(combinations);
            pgr_SPI_finish();
            return;
        }
    }
 
    pgr_get_edges(edges_sql, &edges, &total_edges);
 
    if (total_edges == 0) {
        if (source_vertices) pfree(source_vertices);
        if (sink_vertices) pfree(sink_vertices);
        pgr_SPI_finish();
        return;
    }
 
 
    PGR_DBG("Starting timer");
    clock_t start_t = clock();
    char* log_msg = NULL;
    char* notice_msg = NULL;
    char* err_msg = NULL;
 
    do_pgr_edge_disjoint_paths(
        edges, total_edges,
        combinations, total_combinations,
        source_vertices, size_source_verticesArr,
        sink_vertices, size_sink_verticesArr,
        directed,
 
        result_tuples, result_count,
 
        &log_msg,
        &notice_msg,
        &err_msg);
 
    time_msg("pgr_edgeDisjointPaths(many to many)", start_t, clock());
 
    if (edges) pfree(edges);
    if (source_vertices) pfree(source_vertices);
    if (sink_vertices) pfree(sink_vertices);
 
    if (err_msg && (*result_tuples)) {
        pfree(*result_tuples);
        (*result_tuples) = NULL;
        (*result_count) = 0;
    }
 
    pgr_global_report(log_msg, notice_msg, err_msg);
 
    if (log_msg) pfree(log_msg);
    if (notice_msg) pfree(notice_msg);
    if (err_msg) pfree(err_msg);
    pgr_SPI_finish();
}

References do_pgr_edge_disjoint_paths(), PGR_DBG, pgr_get_bigIntArray(), pgr_get_combinations(), pgr_get_edges(), pgr_global_report(), pgr_SPI_connect(), pgr_SPI_finish(), and time_msg().

Referenced by _pgr_edgedisjointpaths().