| /dports/biology/plink/plink-ng-79b2df8c/2.0/ |
| H A D | pgen_compress.cc | 12 unsigned char* pgr_alloc = nullptr; in main() local
73 if (cachealigned_malloc(cur_alloc_cacheline_ct * kCacheline, &pgr_alloc)) { in main()
78 …reterr = PgrInit(use_mmap? nullptr : argv[1 + decompress], max_vrec_width, &pgfi, &pgr, pgr_alloc); in main()
223 if (pgr_alloc) { in main()
224 aligned_free(pgr_alloc); in main()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/contraction/ |
| H A D | contractGraph_driver.cpp | 119 (*return_tuples) = pgr_alloc((*count), (*return_tuples)); in get_postgres_result()
127 contracted_vertices = pgr_alloc(vids.size(), contracted_vertices); in get_postgres_result()
151 contracted_vertices = pgr_alloc(vids.size(), contracted_vertices); in get_postgres_result()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/transitiveClosure/ |
| H A D | transitiveClosure_driver.cpp | 59 (*return_tuples) = pgr_alloc((*count), (*return_tuples)); in get_postgres_result()
70 target_array = pgr_alloc(adj_siz , target_array); in get_postgres_result()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/common/ |
| H A D | pgr_alloc.cpp | 32 duplicate = pgr_alloc(msg.size() + 1, duplicate); in pgr_msg()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/alpha_shape/ |
| H A D | alphaShape_driver.cpp | 167 *return_tuples = pgr_alloc(*return_count, (*return_tuples)); in do_alphaShape()
173 *return_tuples = pgr_alloc(*return_count, (*return_tuples)); in do_alphaShape()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/include/cpp_common/ |
| H A D | pgr_alloc.hpp | 66 pgr_alloc(std::size_t size, T* ptr) { in pgr_alloc() function
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/bdAstar/ |
| H A D | bdAstar_driver.cpp | 235 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_bdAstar()
249 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_bdAstar()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/max_flow/ |
| H A D | maximum_cardinality_matching_driver.cpp | 68 (*return_tuples) = pgr_alloc(matched_vertices.size(), (*return_tuples)); in do_pgr_maximum_cardinality_matching()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/components/ |
| H A D | biconnectedComponents_driver.cpp | 81 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_biconnectedComponents()
|
| H A D | bridges_driver.cpp | 81 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_bridges()
|
| H A D | strongComponents_driver.cpp | 80 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_strongComponents()
|
| H A D | connectedComponents_driver.cpp | 83 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_connectedComponents()
|
| H A D | articulationPoints_driver.cpp | 80 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_articulationPoints()
|
| H A D | makeConnected_driver.cpp | 87 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_makeConnected()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/mincut/ |
| H A D | stoerWagner_driver.cpp | 91 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_stoerWagner()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/topologicalSort/ |
| H A D | topologicalSort_driver.cpp | 99 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_topologicalSort()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/coloring/ |
| H A D | sequentialVertexColoring_driver.cpp | 132 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_sequentialVertexColoring()
|
| H A D | bipartite_driver.cpp | 95 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_bipartite()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/chinese/ |
| H A D | chinesePostman_driver.cpp | 95 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_directedChPP()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/planar/ |
| H A D | boyerMyrvold_driver.cpp | 90 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_boyerMyrvold()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/dijkstra/ |
| H A D | dijkstra_driver.cpp | 226 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_many_to_many_dijkstra()
327 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_combinations_dijkstra()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/spanningTree/ |
| H A D | randomSpanningTree_driver.cpp | 103 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_randomSpanningTree()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/dominator/ |
| H A D | lengauerTarjanDominatorTree_driver.cpp | 101 (*return_tuples) = pgr_alloc(count, (*return_tuples)); in do_pgr_LTDTree()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/ksp/ |
| H A D | ksp_driver.cpp | 88 *return_tuples = pgr_alloc(count, (*return_tuples)); in do_pgr_ksp()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/lineGraph/ |
| H A D | lineGraphFull_driver.cpp | 48 (*return_tuples) = pgr_alloc(edge_result.size(), (*return_tuples)); in get_turn_penalty_postgres_result()
|