/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/MinCut/ |
H A D | capforest.c | 19 vertex **tnodes = n->tnodes; in capforest() local 58 vertex **tnodes; in delmax() 66 retnode = tnodes[1]; 67 temp = tnodes[1] = tnodes[last]; 72 if (tnodes[ch]->r < tnodes[ch+1]->r) 79 tnodes[pos] = tnodes[ch]; 85 tnodes[pos] = tnodes[ch]; 90 tnodes[pos] = temp; 117 tnodes[pos] = tnodes[ch]; in increment() 121 tnodes[pos] = v; in increment() [all …]
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
H A D | negf_green_cache.F | 39 REAL(kind=dp), ALLOCATABLE, DIMENSION(:) :: tnodes component 95 SUBROUTINE green_functions_cache_reorder(cache, tnodes) argument 97 REAL(kind=dp), DIMENSION(:), INTENT(in) :: tnodes local 104 nnodes = SIZE(tnodes) 111 IF (ALLOCATED(cache%tnodes)) DEALLOCATE (cache%tnodes) 114 ALLOCATE (cache%tnodes(nnodes)) 117 cache%tnodes(:) = tnodes(:) 118 CALL sort(cache%tnodes, nnodes, indices) 141 IF (ALLOCATED(cache%tnodes)) DEALLOCATE (cache%tnodes)
|
H A D | negf_integr_cc.F | 161 ALLOCATE (cc_env%tnodes(nnodes)) 178 cc_env%tnodes(nnodes_half + ipoint) = -cc_env%tnodes(nnodes_half - ipoint) 182 cc_env%tnodes(1:nnodes_half) = 2.0_dp*cc_env%tnodes(1:nnodes_half) + 1.0_dp 224 IF (ALLOCATED(cc_env%tnodes)) DEALLOCATE (cc_env%tnodes) 273 ALLOCATE (tnodes(nnodes_next)) 285 tnodes(nnodes_half + ipoint) = -tnodes(nnodes_half - ipoint + 1) 289 tnodes(1:nnodes_half) = 2.0_dp*tnodes(1:nnodes_half) + 1.0_dp 293 CALL MOVE_ALLOC(cc_env%tnodes, tnodes_old) 298 cc_env%tnodes(nnodes_exist + 1:nnodes_exist + nnodes_next) = tnodes(1:nnodes_next) 304 DEALLOCATE (tnodes) [all …]
|
H A D | negf_integr_utils.F | 69 REAL(kind=dp), DIMENSION(nnodes), INTENT(in) :: tnodes local 87 CALL rescale_nodes_linear(nnodes, tnodes, a, b, xnodes) 95 tnodes_angle(:) = tnodes(:) 238 SUBROUTINE rescale_nodes_cos(nnodes, tnodes) argument 240 REAL(kind=dp), DIMENSION(nnodes), INTENT(inout) :: tnodes local 245 tnodes(:) = COS(0.5_dp*pi*(1.0_dp - tnodes(:))) 258 SUBROUTINE rescale_nodes_linear(nnodes, tnodes, a, b, xnodes) argument 260 REAL(kind=dp), DIMENSION(nnodes), INTENT(in) :: tnodes local 272 xnodes(:) = median + half_len*tnodes(:) 285 SUBROUTINE rescale_nodes_pi_phi(a, b, nnodes, tnodes) argument [all …]
|
H A D | negf_integr_simpson.F | 95 REAL(kind=dp), ALLOCATABLE, DIMENSION(:) :: tnodes component 169 ALLOCATE (sr_env%tnodes(nnodes)) 172 sr_env%tnodes(1:nnodes) = tnodes_restart(1:nnodes) 217 IF (ALLOCATED(sr_env%tnodes)) DEALLOCATE (sr_env%tnodes) 244 ALLOCATE (tnodes(nnodes)) 248 CALL MOVE_ALLOC(sr_env%tnodes, tnodes_old) 251 ALLOCATE (sr_env%tnodes(nnodes_old + nnodes)) 252 sr_env%tnodes(1:nnodes_old) = tnodes_old(1:nnodes_old) 253 sr_env%tnodes(nnodes_old + 1:nnodes_old + nnodes) = tnodes(1:nnodes) 259 DEALLOCATE (tnodes) [all …]
|
/dports/science/cp2k-data/cp2k-7.1.0/src/ |
H A D | negf_green_cache.F | 39 REAL(kind=dp), ALLOCATABLE, DIMENSION(:) :: tnodes component 95 SUBROUTINE green_functions_cache_reorder(cache, tnodes) argument 97 REAL(kind=dp), DIMENSION(:), INTENT(in) :: tnodes local 104 nnodes = SIZE(tnodes) 111 IF (ALLOCATED(cache%tnodes)) DEALLOCATE (cache%tnodes) 114 ALLOCATE (cache%tnodes(nnodes)) 117 cache%tnodes(:) = tnodes(:) 118 CALL sort(cache%tnodes, nnodes, indices) 141 IF (ALLOCATED(cache%tnodes)) DEALLOCATE (cache%tnodes)
|
H A D | negf_integr_cc.F | 161 ALLOCATE (cc_env%tnodes(nnodes)) 178 cc_env%tnodes(nnodes_half + ipoint) = -cc_env%tnodes(nnodes_half - ipoint) 182 cc_env%tnodes(1:nnodes_half) = 2.0_dp*cc_env%tnodes(1:nnodes_half) + 1.0_dp 224 IF (ALLOCATED(cc_env%tnodes)) DEALLOCATE (cc_env%tnodes) 273 ALLOCATE (tnodes(nnodes_next)) 285 tnodes(nnodes_half + ipoint) = -tnodes(nnodes_half - ipoint + 1) 289 tnodes(1:nnodes_half) = 2.0_dp*tnodes(1:nnodes_half) + 1.0_dp 293 CALL MOVE_ALLOC(cc_env%tnodes, tnodes_old) 298 cc_env%tnodes(nnodes_exist + 1:nnodes_exist + nnodes_next) = tnodes(1:nnodes_next) 304 DEALLOCATE (tnodes) [all …]
|
H A D | negf_integr_utils.F | 69 REAL(kind=dp), DIMENSION(nnodes), INTENT(in) :: tnodes local 87 CALL rescale_nodes_linear(nnodes, tnodes, a, b, xnodes) 95 tnodes_angle(:) = tnodes(:) 238 SUBROUTINE rescale_nodes_cos(nnodes, tnodes) argument 240 REAL(kind=dp), DIMENSION(nnodes), INTENT(inout) :: tnodes local 245 tnodes(:) = COS(0.5_dp*pi*(1.0_dp-tnodes(:))) 258 SUBROUTINE rescale_nodes_linear(nnodes, tnodes, a, b, xnodes) argument 260 REAL(kind=dp), DIMENSION(nnodes), INTENT(in) :: tnodes local 272 xnodes(:) = median+half_len*tnodes(:) 285 SUBROUTINE rescale_nodes_pi_phi(a, b, nnodes, tnodes) argument [all …]
|
H A D | negf_integr_simpson.F | 95 REAL(kind=dp), ALLOCATABLE, DIMENSION(:) :: tnodes component 169 ALLOCATE (sr_env%tnodes(nnodes)) 172 sr_env%tnodes(1:nnodes) = tnodes_restart(1:nnodes) 217 IF (ALLOCATED(sr_env%tnodes)) DEALLOCATE (sr_env%tnodes) 244 ALLOCATE (tnodes(nnodes)) 248 CALL MOVE_ALLOC(sr_env%tnodes, tnodes_old) 251 ALLOCATE (sr_env%tnodes(nnodes_old + nnodes)) 252 sr_env%tnodes(1:nnodes_old) = tnodes_old(1:nnodes_old) 253 sr_env%tnodes(nnodes_old + 1:nnodes_old + nnodes) = tnodes(1:nnodes) 259 DEALLOCATE (tnodes) [all …]
|
/dports/games/zhlt/zhlt-3.4/hlrad/ |
H A D | trace.cpp | 16 static tnode_t* tnodes; variable 48 t->children[i] = tnode_p - tnodes; in MakeTnode() 65 tnodes = (tnode_t*)calloc((g_numnodes + 1), sizeof(tnode_t)); in MakeTnodes() 68 tnodes = (tnode_t*)(((long long)tnodes + 31) & ~31); in MakeTnodes() 70 tnodes = (tnode_t*)(((int)tnodes + 31) & ~31); in MakeTnodes() 72 tnode_p = tnodes; in MakeTnodes() 97 tnode = &tnodes[node]; in TestLine_r()
|
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake2/q2map/ |
H A D | trace.c | 41 tnode_t *tnodes, *tnode_p; variable 72 t->children[i] = tnode_p - tnodes; in MakeTnode() 90 tnodes = malloc( (numnodes+1) * sizeof(tnode_t)); in MakeTnodes() 91 tnodes = (tnode_t *)(((int)tnodes + 31)&~31); in MakeTnodes() 92 tnode_p = tnodes; in MakeTnodes() 113 tnode = &tnodes[node]; in TestLine_r() 239 node = tnodes[tstack_p->node].children[!tstack_p->side]; in _TestLine() 242 tnode = &tnodes[node]; in _TestLine()
|
/dports/games/gtkradiant/GPL/Q2Tools/bsp/qrad3/ |
H A D | trace.c | 38 tnode_t *tnodes, *tnode_p; variable 69 t->children[i] = tnode_p - tnodes; in MakeTnode() 87 tnodes = malloc( (numnodes+1) * sizeof(tnode_t)); in MakeTnodes() 88 tnodes = (tnode_t *)(((int)tnodes + 31)&~31); in MakeTnodes() 89 tnode_p = tnodes; in MakeTnodes() 110 tnode = &tnodes[node]; in TestLine_r() 236 node = tnodes[tstack_p->node].children[!tstack_p->side]; in _TestLine() 239 tnode = &tnodes[node]; in _TestLine()
|
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/extra/bsp/qrad3/ |
H A D | trace.c | 38 tnode_t *tnodes, *tnode_p; variable 69 t->children[i] = tnode_p - tnodes; in MakeTnode() 87 tnodes = malloc( (numnodes+1) * sizeof(tnode_t)); in MakeTnodes() 88 tnodes = (tnode_t *)(((int)tnodes + 31)&~31); in MakeTnodes() 89 tnode_p = tnodes; in MakeTnodes() 110 tnode = &tnodes[node]; in TestLine_r() 236 node = tnodes[tstack_p->node].children[!tstack_p->side]; in _TestLine() 239 tnode = &tnodes[node]; in _TestLine()
|
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/q2map/ |
H A D | trace.c | 41 tnode_t *tnodes, *tnode_p; variable 72 t->children[i] = tnode_p - tnodes; in MakeTnode() 89 tnodes = malloc( ( numnodes + 1 ) * sizeof( tnode_t ) ); in MakeTnodes() 90 tnodes = (tnode_t *)( ( (int)tnodes + 31 ) & ~31 ); in MakeTnodes() 91 tnode_p = tnodes; in MakeTnodes() 112 tnode = &tnodes[node]; in TestLine_r() 239 node = tnodes[tstack_p->node].children[!tstack_p->side]; in _TestLine() 242 tnode = &tnodes[node]; in _TestLine()
|
/dports/games/ufoai/ufoai-2.5-source/src/tools/ufo2map/common/ |
H A D | trace.cpp | 46 tnode_t* tnode = curTile->tnodes = Mem_AllocTypeN(tnode_t, curTile->numnodes + 1); in MakeTracingNodes() 55 curTile->thead[curTile->numtheads] = tnode - curTile->tnodes; in MakeTracingNodes() 69 Mem_Free(curTile->tnodes); in CloseTracingNodes() 70 curTile->tnodes = nullptr; in CloseTracingNodes()
|
/dports/games/quakeforge/quakeforge-0.7.2/tools/qflight/source/ |
H A D | trace.c | 68 tnode_t *tnodes, *tnode_p; variable 104 t->children[i] = tnode_p - tnodes; in MakeTnode() 118 tnode_p = tnodes = malloc (bsp->numnodes * sizeof (tnode_t)); in MakeTnodes() 175 node = tnodes[tstack->node].children[tstack->side ^ 1]; in TestLine() 178 tnode = &tnodes[node]; in TestLine()
|
/dports/games/uhexen2/hexen2source-1.5.9/utils/light/ |
H A D | trace.c | 43 static tnode_t *tnodes, *tnode_p; variable 74 t->children[i] = tnode_p - tnodes; in MakeTnode() 90 tnode_p = tnodes = (tnode_t *) SafeMalloc(numnodes * sizeof(tnode_t)); in MakeTnodes() 159 node = tnodes[tstack_p->node].children[!tstack_p->side]; in TestLine() 165 tnode = &tnodes[node]; in TestLine()
|
/dports/games/uhexen2/hexen2source-1.5.9/utils/jsh2color/ |
H A D | trace.c | 43 static tnode_t *tnodes, *tnode_p; variable 74 t->children[i] = tnode_p - tnodes; in MakeTnode() 90 tnode_p = tnodes = (tnode_t *) SafeMalloc(numnodes * sizeof(tnode_t)); in MakeTnodes() 159 node = tnodes[tstack_p->node].children[!tstack_p->side]; in TestLine() 165 tnode = &tnodes[node]; in TestLine()
|
/dports/www/aria2/aria2-1.36.0/test/ |
H A D | DHTBucketTest.cc | 413 std::deque<std::shared_ptr<DHTNode>> tnodes = bucket.getNodes(); in testDropNode() local 414 CPPUNIT_ASSERT_EQUAL((size_t)8, tnodes.size()); in testDropNode() 415 CPPUNIT_ASSERT(*nodes[3] == *tnodes[3]); in testDropNode() 423 std::deque<std::shared_ptr<DHTNode>> tnodes = bucket.getNodes(); in testDropNode() local 424 CPPUNIT_ASSERT_EQUAL((size_t)8, tnodes.size()); in testDropNode() 425 CPPUNIT_ASSERT(tnodes.end() == std::find_if(tnodes.begin(), tnodes.end(), in testDropNode() 427 CPPUNIT_ASSERT(*cachedNode2 == *tnodes[7]); in testDropNode()
|
/dports/net/clusterit/clusterit-2.5/dtop/ |
H A D | dtop.c | 760 batch_print(int tprocs, int tnodes) in batch_print() argument 768 for (i=0, vnodes=0; i < tnodes; i++) in batch_print() 860 curses_print(int tprocs, int tnodes) in curses_print() argument 873 for (i=0, vnodes=0; i < tnodes; i++) in curses_print() 973 int tnodes, k, l; local 1005 tnodes = i; 1207 for (k=0; k < tnodes; k++) { 1216 DPRINTF("tnodes=%d\n", tnodes); 1217 for (k=0; k < tnodes; k++) { 1236 curses_print(i, tnodes); [all …]
|
/dports/net/mpich/mpich-3.4.3/src/pm/hydra2/libhydra/rmk/slurm/ |
H A D | slurm_query_node_list.c | 18 char *nodes, *tnodes, *tmp, *start_str, *end_str, **set; in group_to_nodes() local 40 tnodes = MPL_strdup(nodes); in group_to_nodes() 41 tmp = strtok(tnodes, ","); in group_to_nodes()
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/geometry/ |
H A D | Geometry.cpp | 1721 q=*tnodes[0]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() 1723 q=*tnodes[1]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() 1725 q=*tnodes[5]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() 1733 p=*gnodes[i]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() 1734 q=*tnodes[0]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() 1736 q=*tnodes[1]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() 1738 q=*tnodes[5]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() 1760 q=*tnodes[0]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() 1762 q=*tnodes[1]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() 1772 q=*tnodes[0]-0.5*(*tnodes[0]+*tnodes[2]); in isInside() [all …]
|
/dports/net/mpich2/mpich2-1.5/src/pm/hydra/tools/bootstrap/external/ |
H A D | slurm_query_node_list.c | 17 char *pre, *nodes, *tnodes, *tmp, *start_str, *end_str, **set; in group_to_nodes() local 50 tnodes = HYDU_strdup(nodes); in group_to_nodes() 51 tmp = strtok(tnodes, ","); in group_to_nodes()
|
/dports/math/mfem/mfem-4.3/examples/ |
H A D | ex7.cpp | 285 Vector tnodes; in SnapNodes() local 286 nodes.GetTrueDofs(tnodes); in SnapNodes() 287 nodes.SetFromTrueDofs(tnodes); in SnapNodes()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Common/ |
H A D | network.c | 133 n->tnodes = (vertex **) calloc (n->vertnum, sizeof(vertex *)); in createnet() 257 n->tnodes = (vertex **) calloc (n->vertnum, sizeof(vertex *)); in createnet2() 381 if (n->tnodes) free((char *)n->tnodes); in free_net()
|