| /dports/www/mod_fcgid/mod_fcgid-2.3.9/modules/fcgid/ |
| H A D | fcgid_spawn_ctl.c | 60 current_node != NULL; current_node = current_node->next) { in register_life_death()
78 current_node = apr_pcalloc(g_stat_pool, sizeof(*current_node)); in register_life_death()
86 current_node->score = 0; in register_life_death()
111 current_node->score -= in register_life_death()
177 current_node != NULL; current_node = current_node->next) { in is_spawn_allowed()
187 if (!current_node) { in is_spawn_allowed()
196 current_node->score -= in is_spawn_allowed()
215 if (current_node->process_counter >= current_node->max_class_process_count) { in is_spawn_allowed()
236 current_node != NULL; current_node = current_node->next) { in is_kill_allowed()
246 if (current_node) { in is_kill_allowed()
[all …]
|
| H A D | fcgid_pm_main.c | 76 while (current_node != proc_table) { in scan_idlelist()
109 current_node = next_node; in scan_idlelist()
117 fcgid_procnode *current_node; in scan_busylist() local
153 current_node = &proc_table[current_node->next_index]; in scan_busylist()
214 current_node = next_node; in scan_idlelist_zombie()
245 current_node = next_node; in scan_idlelist_zombie()
259 current_node = &proc_table[current_node->next_index]; in scan_idlelist_zombie()
317 current_node = next_node; in scan_errorlist()
322 current_node != proc_table; in scan_errorlist()
323 current_node = &proc_table[current_node->next_index]) { in scan_errorlist()
[all …]
|
| /dports/news/inn-current/inn-2.7-20211226/lib/ |
| H A D | tst.c | 114 current_node = current_node->middle; in tst_grow_node_free_list()
209 current_node = current_node->middle; in tst_insert()
216 current_node = current_node->left; in tst_insert()
221 current_node = current_node->right; in tst_insert()
231 current_node = current_node->middle; in tst_insert()
262 current_node = current_node->middle; in tst_search()
267 current_node = current_node->left; in tst_search()
269 current_node = current_node->right; in tst_search()
318 current_node = current_node->left; in tst_delete()
323 current_node = current_node->right; in tst_delete()
[all …]
|
| /dports/news/inn/inn-2.6.4/lib/ |
| H A D | tst.c | 116 current_node = current_node->middle; in tst_grow_node_free_list()
211 current_node = current_node->middle; in tst_insert()
218 current_node = current_node->left; in tst_insert()
223 current_node = current_node->right; in tst_insert()
234 current_node = current_node->middle; in tst_insert()
265 current_node = current_node->middle; in tst_search()
270 current_node = current_node->left; in tst_search()
272 current_node = current_node->right; in tst_search()
321 current_node = current_node->left; in tst_delete()
326 current_node = current_node->right; in tst_delete()
[all …]
|
| /dports/sysutils/shlock/inn-2.6.4/lib/ |
| H A D | tst.c | 116 current_node = current_node->middle; in tst_grow_node_free_list()
211 current_node = current_node->middle; in tst_insert()
218 current_node = current_node->left; in tst_insert()
223 current_node = current_node->right; in tst_insert()
234 current_node = current_node->middle; in tst_insert()
265 current_node = current_node->middle; in tst_search()
270 current_node = current_node->left; in tst_search()
272 current_node = current_node->right; in tst_search()
321 current_node = current_node->left; in tst_delete()
326 current_node = current_node->right; in tst_delete()
[all …]
|
| /dports/devel/aegis/aegis-4.25.D510/libaegis/xmltextread/ |
| H A D | by_node.cc | 34 current_node(0) in xml_text_reader_by_node()
91 current_node = 0; in calculate_current_node_handler()
113 if (current_node) in process_node()
119 if (current_node) in process_node()
124 if (current_node) in process_node()
129 if (current_node) in process_node()
134 if (current_node) in process_node()
139 if (current_node) in process_node()
145 if (current_node) in process_node()
154 if (current_node) in process_node()
[all …]
|
| /dports/net/libzmq4/zeromq-4.3.4/src/ |
| H A D | radix_tree.cpp | 225 node_t current_node = _root; in match() local
237 while (current_node.prefix_length () > 0 || current_node.edgecount () > 0) { in match()
277 parent_node = current_node; in match()
278 current_node = next_node; in match()
305 current_node.resize (current_node.prefix_length (), in add()
320 current_node.set_edge_at (current_node.edgecount () - 1, in add()
406 current_node.set_refcount (current_node.refcount () + 1); in add()
426 current_node.set_refcount (current_node.refcount () - 1); in rm()
432 if (current_node == _root) in rm()
490 free (current_node._data); in rm()
[all …]
|
| /dports/net/py-pyzmq/pyzmq-22.3.0/bundled/zeromq/src/ |
| H A D | radix_tree.cpp | 225 node_t current_node = _root; in match() local
237 while (current_node.prefix_length () > 0 || current_node.edgecount () > 0) { in match()
277 parent_node = current_node; in match()
278 current_node = next_node; in match()
305 current_node.resize (current_node.prefix_length (), in add()
320 current_node.set_edge_at (current_node.edgecount () - 1, in add()
406 current_node.set_refcount (current_node.refcount () + 1); in add()
426 current_node.set_refcount (current_node.refcount () - 1); in rm()
432 if (current_node == _root) in rm()
490 free (current_node._data); in rm()
[all …]
|
| /dports/lang/yap/yap-6.2.2/OPTYap/ |
| H A D | tab.tries.c | 231 current_node = TrNode_parent(current_node); in exec_substitution_loop()
323 current_node = TrNode_parent(current_node); in exec_substitution_loop()
327 current_node = TrNode_parent(current_node); in exec_substitution_loop()
330 current_node = TrNode_parent(current_node); in exec_substitution_loop()
334 current_node = TrNode_parent(current_node); in exec_substitution_loop()
335 current_node = TrNode_parent(current_node); in exec_substitution_loop()
346 current_node = TrNode_parent(current_node); in exec_substitution_loop()
618 current_node = TrNode_next(current_node);
629 current_node = TrNode_next(current_node);
708 current_node = TrNode_next(current_node);
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 170 if(current_node == m_sink){ in augment_direct_paths()
213 m_dist_map[current_node] = 1; in augment_direct_paths()
214 m_time_map[current_node] = 1; in augment_direct_paths()
239 vertex_descriptor current_node; in grow() local
316 finish_node(current_node); in grow()
349 while(current_node != m_source){ in augment()
355 set_no_parent(current_node); in augment()
361 current_node = target(e, m_g); in augment()
362 while(current_node != m_sink){ in augment()
392 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/science/py-dlib/dlib-19.22/dlib/sequence/ |
| H A D | sequence_kernel_2.h | 391 item.current_node->right = current_node; in cat()
392 current_node->left = item.current_node; in cat()
459 item.current_node = current_node; in swap()
607 node* current_node, in delete_nodes() argument
615 delete current_node; in delete_nodes() local
616 current_node = temp; in delete_nodes()
629 node*& current_node, in move_to_pos() argument
646 current_node = current_node->left; in move_to_pos()
652 current_node = current_node->right; in move_to_pos()
666 current_node = current_node->left; in move_to_pos()
[all …]
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/sequence/ |
| H A D | sequence_kernel_2.h | 391 item.current_node->right = current_node; in cat()
392 current_node->left = item.current_node; in cat()
459 item.current_node = current_node; in swap()
607 node* current_node, in delete_nodes() argument
615 delete current_node; in delete_nodes() local
616 current_node = temp; in delete_nodes()
629 node*& current_node, in move_to_pos() argument
646 current_node = current_node->left; in move_to_pos()
652 current_node = current_node->right; in move_to_pos()
666 current_node = current_node->left; in move_to_pos()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
356 set_no_parent(current_node); in augment()
362 current_node = target(e, m_g); in augment()
363 while(current_node != m_sink){ in augment()
369 set_no_parent(current_node); in augment()
387 while(current_node != m_source){ in find_bottleneck()
393 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 182 if (current_node == m_sink) in augment_direct_paths()
266 vertex_descriptor current_node; in grow() local
271 && (has_parent(current_node) || current_node == m_source in grow()
401 finish_node(current_node); in grow()
438 while (current_node != m_source) in augment()
453 current_node = target(e, m_g); in augment()
454 while (current_node != m_sink) in augment()
482 while (current_node != m_source) in find_bottleneck()
490 current_node = target(e, m_g); in find_bottleneck()
491 while (current_node != m_sink) in find_bottleneck()
[all …]
|
| /dports/graphics/krita/krita-4.4.8/libs/image/lazybrush/ |
| H A D | patched_boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
360 set_no_parent(current_node); in augment()
366 current_node = target(e, m_g); in augment()
367 while(current_node != m_sink){ in augment()
377 set_no_parent(current_node); in augment()
395 while(current_node != m_source){ in find_bottleneck()
401 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
356 set_no_parent(current_node); in augment()
362 current_node = target(e, m_g); in augment()
363 while(current_node != m_sink){ in augment()
369 set_no_parent(current_node); in augment()
387 while(current_node != m_source){ in find_bottleneck()
393 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 182 if (current_node == m_sink) in augment_direct_paths()
266 vertex_descriptor current_node; in grow() local
271 && (has_parent(current_node) || current_node == m_source in grow()
401 finish_node(current_node); in grow()
438 while (current_node != m_source) in augment()
453 current_node = target(e, m_g); in augment()
454 while (current_node != m_sink) in augment()
482 while (current_node != m_source) in find_bottleneck()
490 current_node = target(e, m_g); in find_bottleneck()
491 while (current_node != m_sink) in find_bottleneck()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 182 if (current_node == m_sink) in augment_direct_paths()
266 vertex_descriptor current_node; in grow() local
271 && (has_parent(current_node) || current_node == m_source in grow()
401 finish_node(current_node); in grow()
438 while (current_node != m_source) in augment()
453 current_node = target(e, m_g); in augment()
454 while (current_node != m_sink) in augment()
482 while (current_node != m_source) in find_bottleneck()
490 current_node = target(e, m_g); in find_bottleneck()
491 while (current_node != m_sink) in find_bottleneck()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
356 set_no_parent(current_node); in augment()
362 current_node = target(e, m_g); in augment()
363 while(current_node != m_sink){ in augment()
369 set_no_parent(current_node); in augment()
387 while(current_node != m_source){ in find_bottleneck()
393 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
356 set_no_parent(current_node); in augment()
362 current_node = target(e, m_g); in augment()
363 while(current_node != m_sink){ in augment()
369 set_no_parent(current_node); in augment()
387 while(current_node != m_source){ in find_bottleneck()
393 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
356 set_no_parent(current_node); in augment()
362 current_node = target(e, m_g); in augment()
363 while(current_node != m_sink){ in augment()
369 set_no_parent(current_node); in augment()
387 while(current_node != m_source){ in find_bottleneck()
393 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
356 set_no_parent(current_node); in augment()
362 current_node = target(e, m_g); in augment()
363 while(current_node != m_sink){ in augment()
369 set_no_parent(current_node); in augment()
387 while(current_node != m_source){ in find_bottleneck()
393 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
356 set_no_parent(current_node); in augment()
362 current_node = target(e, m_g); in augment()
363 while(current_node != m_sink){ in augment()
369 set_no_parent(current_node); in augment()
387 while(current_node != m_source){ in find_bottleneck()
393 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
356 set_no_parent(current_node); in augment()
362 current_node = target(e, m_g); in augment()
363 while(current_node != m_sink){ in augment()
369 set_no_parent(current_node); in augment()
387 while(current_node != m_source){ in find_bottleneck()
393 current_node = target(e, m_g); in find_bottleneck()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 171 if(current_node == m_sink){ in augment_direct_paths()
240 vertex_descriptor current_node; in grow() local
317 finish_node(current_node); in grow()
350 while(current_node != m_source){ in augment()
356 set_no_parent(current_node); in augment()
362 current_node = target(e, m_g); in augment()
363 while(current_node != m_sink){ in augment()
369 set_no_parent(current_node); in augment()
387 while(current_node != m_source){ in find_bottleneck()
393 current_node = target(e, m_g); in find_bottleneck()
[all …]
|