Home
last modified time | relevance | path

Searched refs:leaf_t (Results 1 – 25 of 45) sorted by relevance

12

/dports/math/viennacl/ViennaCL-1.7.1/viennacl/device_specific/
H A Dtree_parsing.hpp91 void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t) const in operator ()()
107 void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t) const in operator ()()
263 void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t leaf) const in operator ()()
293 inline std::string evaluate(leaf_t leaf, std::map<std::string, std::string> const & accessors, in evaluate()
320 inline void evaluate(utils::kernel_generation_stream & stream, leaf_t leaf, std::map<std::string, s… in evaluate()
338 …void operator()(scheduler::statement const & /*statement*/, vcl_size_t root_idx, leaf_t leaf) const in operator ()()
360 inline void process(utils::kernel_generation_stream & stream, leaf_t leaf, std::string const & type… in process()
386 inline void process(utils::kernel_generation_stream & stream, leaf_t leaf, std::string const & type… in process()
478 …inline void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t leaf_t)… in operator ()()
481 if (leaf_t==LHS_NODE_TYPE && root_node.lhs.type_family != scheduler::COMPOSITE_OPERATION_FAMILY) in operator ()()
[all …]
H A Dforwards.h180 enum leaf_t enum
190 typedef std::pair<vcl_size_t, leaf_t> mapping_key;
200 …inline void process(utils::kernel_generation_stream & stream, leaf_t leaf, std::string const & typ…
202 …inline std::string evaluate(leaf_t leaf, std::map<std::string, std::string> const & accessors, sch…
/dports/games/vavoom/vavoom-1.33/utils/glvis/
H A Dglvisint.h70 struct leaf_t struct
80 leaf_t* leaf; argument
97 typedef leaf_t subsector_t;
190 void CheckStack(leaf_t *leaf, threaddata_t *thread);
H A Dflow.cpp63 leaf_t *leaf; in SimpleFlood()
153 void TVisBuilder::CheckStack(leaf_t *leaf, threaddata_t *thread) in CheckStack()
371 leaf_t *leaf; in RecursiveLeafFlow()
640 leaf_t* leaf; in LeafFlow()
/dports/games/zhlt/zhlt-3.4/hlvis/
H A Dflow.cpp379 leaf_t* leaf; in RecursiveLeafFlow()
639 leaf_t* leaf; in SimpleFlood()
687 leaf_t *leaf; in BlockVis()
732 static portal_t *GetSplitPortal(leaf_t *leaf1, leaf_t *leaf2) in GetSplitPortal()
777 static void MakeSplitPortalList(leaf_t *leaf1, leaf_t *leaf2, portal_t **portals, int *num_portals) in MakeSplitPortalList()
840 leaf_t *l = g_leafs + leaf1; in DisjointLeafVis()
841 leaf_t *tl = g_leafs + leaf2; in DisjointLeafVis()
1013 static float GetShortestDistance(leaf_t *leaf1, leaf_t *leaf2) in GetShortestDistance()
1068 static float CalcSplitsAndDotProducts(plane_t *org_split_plane, leaf_t *leaf1, leaf_t *leaf2, plan… in CalcSplitsAndDotProducts()
1249 leaf_t *l;
[all …]
H A Dvis.h109 } leaf_t; typedef
119 leaf_t* leaf;
170 extern leaf_t* g_leafs;
/dports/games/uhexen2/hexen2source-1.5.9/utils/vis/
H A Dvis.h92 } leaf_t; typedef
98 leaf_t *leaf;
118 extern leaf_t *leafs;
H A Dvis.c42 leaf_t *leafs;
166 void prl(leaf_t *l)
425 leaf_t *leaf; in LeafFlow()
698 leaf_t *l; in LoadPortals()
732 leafs = (leaf_t *) SafeMalloc(portalleafs * sizeof(leaf_t)); in LoadPortals()
/dports/games/gtkradiant/GPL/Q2Tools/bsp/qvis3/
H A Dvis.h92 } leaf_t; typedef
99 leaf_t *leaf;
123 extern leaf_t *leafs;
H A Dqvis3.c34 leaf_t *leafs;
102 void prl(leaf_t *l) in prl()
186 leaf_t *leaf; in ClusterMerge()
333 leaf_t *l; in LoadPortals()
369 leafs = malloc(portalclusters*sizeof(leaf_t)); in LoadPortals()
370 memset (leafs, 0, portalclusters*sizeof(leaf_t)); in LoadPortals()
H A Dflow.c64 void CheckStack (leaf_t *leaf, threaddata_t *thread) in CheckStack()
388 leaf_t *leaf; in RecursiveLeafFlow()
628 leaf_t *leaf; in SimpleFlood()
734 leaf_t *leaf; in RecursiveLeafBitFlow()
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/extra/bsp/qvis3/
H A Dvis.h92 } leaf_t; typedef
99 leaf_t *leaf;
123 extern leaf_t *leafs;
H A Dqvis3.c34 leaf_t *leafs;
102 void prl(leaf_t *l) in prl()
186 leaf_t *leaf; in ClusterMerge()
333 leaf_t *l; in LoadPortals()
369 leafs = malloc(portalclusters*sizeof(leaf_t)); in LoadPortals()
370 memset (leafs, 0, portalclusters*sizeof(leaf_t)); in LoadPortals()
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake2/q2map/
H A Dqvis.h106 } leaf_t; typedef
113 leaf_t *leaf;
137 extern leaf_t *leafs;
H A Dqvis.c34 leaf_t *leafs;
102 void prl(leaf_t *l) in prl()
186 leaf_t *leaf; in ClusterMerge()
333 leaf_t *l; in LoadPortals()
369 leafs = malloc(portalclusters*sizeof(leaf_t)); in LoadPortals()
370 memset (leafs, 0, portalclusters*sizeof(leaf_t)); in LoadPortals()
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/q2map/
H A Dqvis.h106 } leaf_t; typedef
113 leaf_t *leaf;
137 extern leaf_t *leafs;
H A Dqvis.c34 leaf_t *leafs;
101 void prl( leaf_t *l ){ in prl()
182 leaf_t *leaf; in ClusterMerge()
328 leaf_t *l; in LoadPortals()
368 leafs = malloc( portalclusters * sizeof( leaf_t ) ); in LoadPortals()
369 memset( leafs, 0, portalclusters * sizeof( leaf_t ) ); in LoadPortals()
/dports/math/viennacl/ViennaCL-1.7.1/viennacl/device_specific/templates/
H A Dtemplate_base.hpp135 …void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t leaf_t) const { in operator ()()
136 mapping_type::key_type key(root_idx, leaf_t); in operator ()()
139 … if (leaf_t == LHS_NODE_TYPE && root_node.lhs.type_family != scheduler::COMPOSITE_OPERATION_FAMILY) in operator ()()
141 …else if (leaf_t == RHS_NODE_TYPE && root_node.rhs.type_family != scheduler::COMPOSITE_OPERATION_FA… in operator ()()
143 else if ( leaf_t== PARENT_NODE_TYPE) in operator ()()
181 void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t leaf) const in operator ()()
273 … void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t leaf_t) const in operator ()()
276 … if (leaf_t==LHS_NODE_TYPE && root_node.lhs.type_family != scheduler::COMPOSITE_OPERATION_FAMILY) in operator ()()
278 …else if (leaf_t==RHS_NODE_TYPE && root_node.rhs.type_family != scheduler::COMPOSITE_OPERATION_FAMI… in operator ()()
353 …de_trans(scheduler::statement::container_type const & array, vcl_size_t root_idx, leaf_t leaf_type) in is_node_trans()
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake3/q3map2/
H A Dvis.c78 void prl(leaf_t *l) in prl()
172 leaf_t *leaf; in ClusterMerge()
437 leaf_t *l1, *l2; in TryMergeLeaves()
540 leaf_t *leaf; in MergeLeaves()
690 leaf_t *leaf; in MergeLeafPortals()
849 leaf_t *l; in LoadPortals()
886 leafs = safe_malloc(portalclusters*sizeof(leaf_t)); in LoadPortals()
887 memset (leafs, 0, portalclusters*sizeof(leaf_t)); in LoadPortals()
975 faceleafs = safe_malloc(portalclusters*sizeof(leaf_t)); in LoadPortals()
976 memset(faceleafs, 0, portalclusters*sizeof(leaf_t)); in LoadPortals()
H A Dvisflow.c80 void CheckStack (leaf_t *leaf, threaddata_t *thread) in CheckStack()
417 leaf_t *leaf; in RecursiveLeafFlow()
692 leaf_t *leaf; in RecursivePassageFlow()
821 leaf_t *leaf; in RecursivePassagePortalFlow()
1324 leaf_t *leaf; in CreatePassages()
1436 leaf_t *leaf; in PassageMemory()
1513 leaf_t *leaf; in SimpleFlood()
1649 leaf_t *leaf; in RecursiveLeafBitFlow()
/dports/games/netradiant/netradiant-20150621-src/tools/quake3/q3map2/
H A Dvis.c77 void prl( leaf_t *l ){ in prl()
168 leaf_t *leaf; in ClusterMerge()
463 leaf_t *l1, *l2; in TryMergeLeaves()
571 leaf_t *leaf; in MergeLeaves()
730 leaf_t *leaf; in MergeLeafPortals()
895 leaf_t *l; in LoadPortals()
940 leafs = safe_malloc( portalclusters * sizeof( leaf_t ) ); in LoadPortals()
941 memset( leafs, 0, portalclusters * sizeof( leaf_t ) ); in LoadPortals()
1040 faceleafs = safe_malloc( portalclusters * sizeof( leaf_t ) ); in LoadPortals()
1041 memset( faceleafs, 0, portalclusters * sizeof( leaf_t ) ); in LoadPortals()
H A Dvisflow.c82 void CheckStack( leaf_t *leaf, threaddata_t *thread ){ in CheckStack()
429 leaf_t *leaf; in RecursiveLeafFlow()
701 leaf_t *leaf; in RecursivePassageFlow()
828 leaf_t *leaf; in RecursivePassagePortalFlow()
1340 leaf_t *leaf; in CreatePassages()
1464 leaf_t *leaf; in PassageMemory()
1542 leaf_t *leaf; in SimpleFlood()
1686 leaf_t *leaf; in RecursiveLeafBitFlow()
/dports/databases/unixODBC/unixODBC-2.3.9/Drivers/nn/
H A Dyyevl.c30 } leaf_t; typedef
32 static int getleaf(yystmt_t* yystmt, node_t* nd, leaf_t* lf) in getleaf()
235 leaf_t a, b; in getrange()
393 leaf_t lf; in is_sql_null()
403 leaf_t la, lb; in compare()
552 leaf_t la, lb; in evl_like()
/dports/games/quake2-relay/relay-0.4/common/
H A Dbsp.h166 } leaf_t; typedef
215 leaf_t leafs[MAX_MAP_LEAFS];
/dports/shells/fish/fish-3.3.1/src/
H A Dast.h327 struct leaf_t : public node_t { struct
348 leaf_t() : node_t(Type, Category) {} in leaf_t() argument
420 struct keyword_base_t : public leaf_t<type_t::keyword_base> {
431 struct token_base_t : public leaf_t<type_t::token_base> {
444 struct maybe_newlines_t final : public leaf_t<type_t::maybe_newlines> {};
455 struct argument_t final : public leaf_t<type_t::argument> {};
467 struct variable_assignment_t final : public leaf_t<type_t::variable_assignment> {};

12