| /dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/ |
| H A D | pretransition.f | 30 & actnode,kflag,ndesinode local
120 actnode=konl(ifaceq(m,jface))
121 if(nodedesiinv(actnode).ne.1) then
128 actnode=konl(ifacet(m,jface))
136 actnode=konl(ifacew2(m,jface))
144 actnode=konl(ifacew1(m,jface))
156 actnode=nopesurf(m)
159 xo(ifree)=co(1,actnode)
162 yo(ifree)=co(2,actnode)
165 zo(ifree)=co(3,actnode)
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/centrality/ |
| H A D | betweenness.c | 404 nrgeo[actnode] = 0; in igraph_betweenness_cutoff()
439 tmpscore[neighbor] += (tmpscore[actnode] + 1) * nrgeo[neighbor] / nrgeo[actnode]; in igraph_betweenness_cutoff()
443 VECTOR(*tmpres)[actnode] += tmpscore[actnode]; in igraph_betweenness_cutoff()
447 distance[actnode] = 0; in igraph_betweenness_cutoff()
448 nrgeo[actnode] = 0; in igraph_betweenness_cutoff()
449 tmpscore[actnode] = 0; in igraph_betweenness_cutoff()
930 (tmpscore[actnode] + 1) * nrgeo[neighbor] / nrgeo[actnode]; in igraph_edge_betweenness_cutoff()
932 (tmpscore[actnode] + 1) * nrgeo[neighbor] / nrgeo[actnode]; in igraph_edge_betweenness_cutoff()
936 distance[actnode] = 0; in igraph_edge_betweenness_cutoff()
937 tmpscore[actnode] = 0; in igraph_edge_betweenness_cutoff()
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/games/ |
| H A D | forestfire.c | 111 long int no_of_nodes = nodes, actnode, i; in igraph_forest_fire_game() local
166 if (VECTOR(visited)[(nei)] != actnode+1) { \ in igraph_forest_fire_game()
167 VECTOR(visited)[(nei)] = actnode+1; \ in igraph_forest_fire_game()
169 IGRAPH_CHECK(igraph_vector_push_back(&edges, actnode)); \ in igraph_forest_fire_game()
171 IGRAPH_CHECK(igraph_vector_push_back(outneis+actnode, nei)); \ in igraph_forest_fire_game()
172 IGRAPH_CHECK(igraph_vector_push_back(inneis+nei, actnode)); \ in igraph_forest_fire_game()
177 for (actnode = 1; actnode < no_of_nodes; actnode++) { in igraph_forest_fire_game()
184 VECTOR(visited)[actnode] = actnode + 1; in igraph_forest_fire_game()
188 long int a = RNG_INTEGER(0, actnode - 1); in igraph_forest_fire_game()
213 if (VECTOR(visited)[nei] != actnode + 1) { in igraph_forest_fire_game()
[all …]
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | forestfire.c | 111 long int no_of_nodes = nodes, actnode, i; in igraph_forest_fire_game() local
166 if (VECTOR(visited)[(nei)] != actnode+1) { \ in igraph_forest_fire_game()
167 VECTOR(visited)[(nei)] = actnode+1; \ in igraph_forest_fire_game()
169 IGRAPH_CHECK(igraph_vector_push_back(&edges, actnode)); \ in igraph_forest_fire_game()
171 IGRAPH_CHECK(igraph_vector_push_back(outneis+actnode, nei)); \ in igraph_forest_fire_game()
172 IGRAPH_CHECK(igraph_vector_push_back(inneis+nei, actnode)); \ in igraph_forest_fire_game()
177 for (actnode = 1; actnode < no_of_nodes; actnode++) { in igraph_forest_fire_game()
184 VECTOR(visited)[actnode] = actnode + 1; in igraph_forest_fire_game()
188 long int a = RNG_INTEGER(0, actnode - 1); in igraph_forest_fire_game()
213 if (VECTOR(visited)[nei] != actnode + 1) { in igraph_forest_fire_game()
[all …]
|
| H A D | centrality.c | 1969 distance[actnode] = 0; in igraph_betweenness_estimate()
1971 nrgeo[actnode] = 0; in igraph_betweenness_estimate()
1975 tmpscore[actnode] = 0; in igraph_betweenness_estimate()
2033 if (actnode != source) { in igraph_betweenness_estimate()
2034 VECTOR(*tmpres)[actnode] += tmpscore[actnode]; in igraph_betweenness_estimate()
2038 distance[actnode] = 0; in igraph_betweenness_estimate()
2040 nrgeo[actnode] = 0; in igraph_betweenness_estimate()
2044 tmpscore[actnode] = 0; in igraph_betweenness_estimate()
2461 if (distance[actnode] < 1) { in igraph_edge_betweenness_estimate()
2477 (tmpscore[actnode] + 1) * nrgeo[neighbor] / nrgeo[actnode]; in igraph_edge_betweenness_estimate()
[all …]
|
| H A D | flow.c | 680 long int actnode = (long int) igraph_dqueue_pop(&Q); in igraph_maxflow() local
681 for (i = FIRST(actnode), j = LAST(actnode); i < j; i++) { in igraph_maxflow()
751 long int actnode = (long int) igraph_dqueue_pop(&Q); in igraph_maxflow() local
753 DIST(actnode) = actdist; in igraph_maxflow()
755 for (i = FIRST(actnode), j = LAST(actnode); i < j; i++) { in igraph_maxflow()
911 long int edge = FIRST(actnode) + (long int) CURRENT(actnode); in igraph_maxflow()
916 nei = edge < LAST(actnode) ? HEAD(edge) : -1; in igraph_maxflow()
924 CURRENT(actnode) += 1; in igraph_maxflow()
948 CURRENT(actnode) += 1; in igraph_maxflow()
952 CURRENT(actnode) += 1; in igraph_maxflow()
[all …]
|
| /dports/audio/libmodplug/libmodplug-0.8.9.0/src/ |
| H A D | load_dmf.cpp | 541 UINT actnode; in DMFNewNode() local
543 actnode = tree->nodecount; in DMFNewNode()
544 if (actnode > 255) return; in DMFNewNode()
548 actnode = tree->lastnode; in DMFNewNode()
549 if (actnode > 255) return; in DMFNewNode()
576 UINT actnode; in DMFUnpack() local
586 actnode = 0; in DMFUnpack()
591 actnode = tree.nodes[actnode].right; in DMFUnpack()
593 actnode = tree.nodes[actnode].left; in DMFUnpack()
594 if (actnode > 255) break; in DMFUnpack()
[all …]
|
| /dports/audio/sdl2_mixer/SDL2_mixer-2.0.4/external/libmodplug-0.8.9.0/src/ |
| H A D | load_dmf.cpp | 541 UINT actnode;
543 actnode = tree->nodecount;
544 if (actnode > 255) return;
548 actnode = tree->lastnode;
549 if (actnode > 255) return;
576 UINT actnode;
586 actnode = 0;
591 actnode = tree.nodes[actnode].right;
593 actnode = tree.nodes[actnode].left;
594 if (actnode > 255) break;
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/properties/ |
| H A D | girth.c | 114 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_girth() local
115 long int actlevel = VECTOR(level)[actnode]; in igraph_girth()
122 neis = igraph_lazy_adjlist_get(&adjlist, (igraph_integer_t) actnode); in igraph_girth()
138 t1 = actnode; t2 = nei; in igraph_girth()
176 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_girth() local
177 neis = igraph_lazy_adjlist_get(&adjlist, (igraph_integer_t) actnode); in igraph_girth()
182 FATHER(nei) = actnode + 1; in igraph_girth()
|
| H A D | convergence_degree.c | 130 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_convergence_degree() local
133 eids = igraph_inclist_get(&inclist, actnode); in igraph_convergence_degree()
136 long int neighbor = IGRAPH_OTHER(graph, VECTOR(*eids)[j], actnode); in igraph_convergence_degree()
143 if (actnode < neighbor) { in igraph_convergence_degree()
161 if (actnode < neighbor) { in igraph_convergence_degree()
|
| H A D | neighborhood.c | 114 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_size() local
117 igraph_neighbors(graph, &neis, (igraph_integer_t) actnode, mode); in igraph_neighborhood_size()
249 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood() local
252 igraph_neighbors(graph, &neis, (igraph_integer_t) actnode, mode); in igraph_neighborhood()
396 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_graphs() local
399 igraph_neighbors(graph, &neis, (igraph_integer_t) actnode, mode); in igraph_neighborhood_graphs()
|
| H A D | trees.c | 98 long int actnode = (long int) igraph_dqueue_pop(&Q); in igraph_unfold_tree() local
100 IGRAPH_CHECK(igraph_incident(graph, &neis, (igraph_integer_t) actnode, mode)); in igraph_unfold_tree()
107 long int nei = IGRAPH_OTHER(graph, edge, actnode); in igraph_unfold_tree()
|
| /dports/math/igraph/igraph-0.9.5/src/community/ |
| H A D | edge_betweenness.c | 556 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_community_edge_betweenness() local
558 neip = igraph_inclist_get(elist_out_p, actnode); in igraph_community_edge_betweenness()
566 nrgeo[neighbor] += nrgeo[actnode]; in igraph_community_edge_betweenness()
570 nrgeo[neighbor] += nrgeo[actnode]; in igraph_community_edge_betweenness()
571 distance[neighbor] = distance[actnode] + 1; in igraph_community_edge_betweenness()
582 long int actnode = (long int) igraph_stack_pop(&stack); in igraph_community_edge_betweenness() local
583 if (distance[actnode] < 1) { in igraph_community_edge_betweenness()
588 neip = igraph_inclist_get(elist_in_p, actnode); in igraph_community_edge_betweenness()
593 if (distance[neighbor] == distance[actnode] - 1 && in igraph_community_edge_betweenness()
596 (tmpscore[actnode] + 1) * nrgeo[neighbor] / nrgeo[actnode]; in igraph_community_edge_betweenness()
[all …]
|
| /dports/audio/libopenmpt/libopenmpt-0.6.0+release.autotools/soundlib/ |
| H A D | Load_dmf.cpp | 1083 int actnode = nodecount; in DMFNewNode() local
1084 if(actnode > 255) return; in DMFNewNode()
1088 actnode = lastnode; in DMFNewNode()
1089 if(actnode > 255) return; in DMFNewNode()
1098 nodes[actnode].left = -1; in DMFNewNode()
1107 nodes[actnode].right = -1; in DMFNewNode()
1125 int actnode = 0; in DMFUnpack() local
1130 actnode = tree.nodes[actnode].right; in DMFUnpack()
1132 actnode = tree.nodes[actnode].left; in DMFUnpack()
1133 if(actnode > 255) break; in DMFUnpack()
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/paths/ |
| H A D | all_shortest_paths.c | 192 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_get_all_shortest_paths() local
212 IGRAPH_CHECK(igraph_neighbors(graph, &neis, (igraph_integer_t) actnode, in igraph_get_all_shortest_paths()
230 VECTOR(*nrgeo)[neighbor] += VECTOR(*nrgeo)[actnode]; in igraph_get_all_shortest_paths()
246 fatherptr = (long int) VECTOR(ptrhead)[actnode]; in igraph_get_all_shortest_paths()
|
| H A D | histogram.c | 100 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_path_length_hist() local
103 neis = igraph_adjlist_get(&allneis, actnode); in igraph_path_length_hist()
|
| /dports/sysutils/moosefs3-netdump/moosefs-3.0.116/mfsclient/ |
| H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree() argument
106 if (actnode!=NULL) { in expr_rfree()
107 if (actnode->op!=REF) { in expr_rfree()
108 expr_rfree(actnode->arg1); in expr_rfree()
109 expr_rfree(actnode->arg2); in expr_rfree()
111 free(actnode); in expr_rfree()
|
| /dports/sysutils/moosefs3-cgi/moosefs-3.0.116/mfsclient/ |
| H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree() argument
106 if (actnode!=NULL) { in expr_rfree()
107 if (actnode->op!=REF) { in expr_rfree()
108 expr_rfree(actnode->arg1); in expr_rfree()
109 expr_rfree(actnode->arg2); in expr_rfree()
111 free(actnode); in expr_rfree()
|
| /dports/sysutils/moosefs3-cgiserv/moosefs-3.0.116/mfsclient/ |
| H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree() argument
106 if (actnode!=NULL) { in expr_rfree()
107 if (actnode->op!=REF) { in expr_rfree()
108 expr_rfree(actnode->arg1); in expr_rfree()
109 expr_rfree(actnode->arg2); in expr_rfree()
111 free(actnode); in expr_rfree()
|
| /dports/sysutils/moosefs3-chunkserver/moosefs-3.0.116/mfsclient/ |
| H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree() argument
106 if (actnode!=NULL) { in expr_rfree()
107 if (actnode->op!=REF) { in expr_rfree()
108 expr_rfree(actnode->arg1); in expr_rfree()
109 expr_rfree(actnode->arg2); in expr_rfree()
111 free(actnode); in expr_rfree()
|
| /dports/sysutils/moosefs3-cli/moosefs-3.0.116/mfsclient/ |
| H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree() argument
106 if (actnode!=NULL) { in expr_rfree()
107 if (actnode->op!=REF) { in expr_rfree()
108 expr_rfree(actnode->arg1); in expr_rfree()
109 expr_rfree(actnode->arg2); in expr_rfree()
111 free(actnode); in expr_rfree()
|
| /dports/sysutils/moosefs3-client/moosefs-3.0.116/mfsclient/ |
| H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree() argument
106 if (actnode!=NULL) { in expr_rfree()
107 if (actnode->op!=REF) { in expr_rfree()
108 expr_rfree(actnode->arg1); in expr_rfree()
109 expr_rfree(actnode->arg2); in expr_rfree()
111 free(actnode); in expr_rfree()
|
| /dports/sysutils/moosefs3-metalogger/moosefs-3.0.116/mfsclient/ |
| H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree() argument
106 if (actnode!=NULL) { in expr_rfree()
107 if (actnode->op!=REF) { in expr_rfree()
108 expr_rfree(actnode->arg1); in expr_rfree()
109 expr_rfree(actnode->arg2); in expr_rfree()
111 free(actnode); in expr_rfree()
|
| /dports/sysutils/moosefs3-master/moosefs-3.0.116/mfsclient/ |
| H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree() argument
106 if (actnode!=NULL) { in expr_rfree()
107 if (actnode->op!=REF) { in expr_rfree()
108 expr_rfree(actnode->arg1); in expr_rfree()
109 expr_rfree(actnode->arg2); in expr_rfree()
111 free(actnode); in expr_rfree()
|
| /dports/math/igraph/igraph-0.9.5/src/flow/ |
| H A D | flow.c | 693 long int actnode = (long int) igraph_dqueue_pop(&Q); in igraph_maxflow() local
694 for (i = FIRST(actnode), j = LAST(actnode); i < j; i++) { in igraph_maxflow()
764 long int actnode = (long int) igraph_dqueue_pop(&Q); in igraph_maxflow() local
766 DIST(actnode) = actdist; in igraph_maxflow()
768 for (i = FIRST(actnode), j = LAST(actnode); i < j; i++) { in igraph_maxflow()
924 long int edge = FIRST(actnode) + (long int) CURRENT(actnode); in igraph_maxflow()
929 nei = edge < LAST(actnode) ? HEAD(edge) : -1; in igraph_maxflow()
937 CURRENT(actnode) += 1; in igraph_maxflow()
961 CURRENT(actnode) += 1; in igraph_maxflow()
965 CURRENT(actnode) += 1; in igraph_maxflow()
[all …]
|