#include <pathnodes.h>

Public Member Functions
	pg_node_attr (no_copy_equal, no_read, no_query_jumble) NodeTag type

RelOptInfo *parent	pg_node_attr (write_only_relids)

PathTarget *pathtarget	pg_node_attr (write_only_nondefault_pathtarget)

ParamPathInfo *param_info	pg_node_attr (write_only_req_outer)

Data Fields
NodeTag	pathtype

bool	parallel_aware

bool	parallel_safe

int	parallel_workers

Cardinality	rows

int	disabled_nodes

Cost	startup_cost

Cost	total_cost

List *	pathkeys

Detailed Description

Definition at line 1944 of file pathnodes.h.

Member Function Documentation

◆ pg_node_attr() [1/4]

Path::pg_node_attr	(	no_copy_equal	,
		no_read	,
		no_query_jumble
	)

◆ pg_node_attr() [2/4]

PathTarget *pathtarget Path::pg_node_attr ( write_only_nondefault_pathtarget )

◆ pg_node_attr() [3/4]

RelOptInfo *parent Path::pg_node_attr ( write_only_relids )

◆ pg_node_attr() [4/4]

ParamPathInfo *param_info Path::pg_node_attr ( write_only_req_outer )

Field Documentation

◆ disabled_nodes

◆ parallel_aware

bool Path::parallel_aware

Definition at line 1978 of file pathnodes.h.

Referenced by copy_generic_path_info(), cost_index(), create_append_path(), and get_singleton_append_subpath().

◆ parallel_safe

bool Path::parallel_safe

Definition at line 1980 of file pathnodes.h.

Referenced by apply_projection_to_path(), copy_generic_path_info(), create_append_path(), create_gating_plan(), create_recursiveunion_path(), create_setop_path(), get_cheapest_path_for_pathkeys(), and SS_charge_for_initplans().

◆ parallel_workers

int Path::parallel_workers

◆ pathkeys

List* Path::pathkeys

Definition at line 1991 of file pathnodes.h.

Referenced by add_foreign_final_paths(), add_paths_to_append_rel(), consider_groupingsets_paths(), create_append_path(), create_one_window_path(), create_setop_path(), create_window_paths(), gather_grouping_paths(), generate_nonunion_paths(), generate_union_paths(), get_cheapest_fractional_path_for_pathkeys(), get_cheapest_path_for_pathkeys(), get_useful_group_keys_orderings(), make_ordered_path(), reparameterize_path(), and set_cheapest().

◆ pathtype

NodeTag Path::pathtype

Definition at line 1951 of file pathnodes.h.

Referenced by bitmap_scan_cost_est(), cost_index(), cost_rescan(), create_incremental_sort_path(), GetExistingLocalJoinPath(), is_projection_capable_path(), reparameterize_path(), reparameterize_path_by_child(), and use_physical_tlist().

◆ rows

Cardinality Path::rows

Definition at line 1985 of file pathnodes.h.

Referenced by add_foreign_final_paths(), apply_projection_to_path(), approx_tuple_count(), build_setop_child_paths(), compute_gather_rows(), copy_generic_path_info(), cost_agg(), cost_append(), cost_bitmap_and_node(), cost_bitmap_heap_scan(), cost_bitmap_or_node(), cost_bitmap_tree_node(), cost_ctescan(), cost_functionscan(), cost_gather(), cost_gather_merge(), cost_group(), cost_incremental_sort(), cost_index(), cost_material(), cost_namedtuplestorescan(), cost_resultscan(), cost_samplescan(), cost_seqscan(), cost_sort(), cost_subqueryscan(), cost_tablefuncscan(), cost_tidrangescan(), cost_tidscan(), cost_valuesscan(), cost_windowagg(), create_append_path(), create_final_distinct_paths(), create_partial_grouping_paths(), create_partial_unique_paths(), create_setop_path(), create_setop_pathtarget(), final_cost_hashjoin(), final_cost_mergejoin(), final_cost_nestloop(), generate_grouped_paths(), generate_nonunion_paths(), generate_recursion_path(), and subpath_is_hashable().

◆ startup_cost

◆ total_cost

Cost Path::total_cost

The documentation for this struct was generated from the following file:

src/include/nodes/pathnodes.h

Public Member Functions

Data Fields