/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/src/test/ |
H A D | test_broadcast_node.cpp | 79 size_t predecessor_count() __TBB_override { return 0; } in predecessor_count() function in counting_array_receiver 95 ASSERT(b.predecessor_count() == 0, NULL); in test_serial_broadcasts() 259 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 2, "improper count for b0"); in test_extract() 260 ASSERT(b1.predecessor_count() == 1 && b1.successor_count() == 2, "improper count for b1"); in test_extract() 261 ASSERT(b2.predecessor_count() == 1 && b2.successor_count() == 2, "improper count for b2"); in test_extract() 262 ASSERT(b3.predecessor_count() == 1 && b3.successor_count() == 1, "improper count for b3"); in test_extract() 264 ASSERT(b5.predecessor_count() == 1 && b5.successor_count() == 1, "improper count for b5"); in test_extract() 266 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 2, "improper count for b0 after"); in test_extract() 267 …ASSERT(b1.predecessor_count() == 1 && b1.successor_count() == 1, "improper succ count for b1 after… in test_extract() 268 …ASSERT(b2.predecessor_count() == 1 && b2.successor_count() == 1, "improper succ count for b2 after… in test_extract() [all …]
|
H A D | test_multifunction_node.cpp | 446 ASSERT(mo_node.predecessor_count() == 0, NULL); in run_multiport_test() 549 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 1, "b0 has incorrect counts"); in test_extract() 550 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 551 ASSERT(mf0.predecessor_count() == 2 in test_extract() 555 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 556 ASSERT(q1.predecessor_count() == 1 && q1.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 577 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() 579 ASSERT(mf0.predecessor_count() == 1 in test_extract() 605 ASSERT(mf0.predecessor_count() == 1 in test_extract() 637 ASSERT(mf0.predecessor_count() == 0 in test_extract() [all …]
|
H A D | test_continue_node.cpp | 88 ASSERT(n.predecessor_count() == 0, NULL); in run_continue_nodes() 282 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 1, "b0 has incorrect counts"); in test_extract() 283 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 284 ASSERT(c0.predecessor_count() == 2 && c0.successor_count() == 1, "c0 has incorrect counts"); in test_extract() 285 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 309 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() 310 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 311 ASSERT(c0.predecessor_count() == 1 && c0.successor_count() == 1, "c0 has incorrect counts"); in test_extract() 312 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 330 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() [all …]
|
H A D | test_function_node.cpp | 285 ASSERT(exe_node.predecessor_count() == 0, NULL); in concurrency_levels() 495 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 1, "b0 has incorrect counts"); in test_extract() 496 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 497 ASSERT(f0.predecessor_count() == 2 && f0.successor_count() == 1, "f0 has incorrect counts"); in test_extract() 498 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 523 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() 524 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 525 ASSERT(f0.predecessor_count() == 1 && f0.successor_count() == 1, "f0 has incorrect counts"); in test_extract() 526 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 544 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() [all …]
|
H A D | test_indexer_node.cpp | 127 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); in make_and_validate_full_graph() 129 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); in make_and_validate_full_graph() 131 ASSERT( in2.predecessor_count() == 0 && in2_p_list.size() == 0, "expected 0 predecessors" ); in make_and_validate_full_graph() 194 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 196 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 198 ASSERT( in2.predecessor_count() == 0 && in2_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 203 … ASSERT( out0.predecessor_count() == 0 && out0_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 241 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); in validate_empty_graph() 243 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); in validate_empty_graph() 245 ASSERT( in2.predecessor_count() == 0 && in2_p_list.size() == 0, "expected 0 predecessors" ); in validate_empty_graph() [all …]
|
H A D | test_limiter_node.cpp | 59 size_t predecessor_count() __TBB_override { return 0; } in predecessor_count() function 91 size_t predecessor_count( ) __TBB_override { return 0; } in predecessor_count() function 165 ASSERT(lim.decrement.predecessor_count() == 1, NULL); in test_puts_with_decrements() 167 ASSERT(lim.predecessor_count() == 0, NULL); in test_puts_with_decrements() 328 REMARK("pred cnt == %d\n",(int)(lim_node.predecessor_count())); in test_multifunction_to_limiter() 512 ASSERT(node0.predecessor_count() == 0, "incorrect predecessor count at start"); in test_extract() 514 ASSERT(node0.decrement.predecessor_count() == 0, "incorrect decrement pred count at start"); in test_extract() 533 ASSERT(node0.predecessor_count() == 2, "incorrect predecessor count after construction"); in test_extract() 572 ASSERT(node0.predecessor_count() == 0, "incorrect predecessor count after extraction"); in test_extract() 601 ASSERT(node0.predecessor_count() == 0, "incorrect predecessor count after extract"); in test_extract() [all …]
|
H A D | harness_graph.h | 318 size_t predecessor_count() __TBB_override { return 0; } 389 size_t predecessor_count() __TBB_override { return 0; } 736 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); 738 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); 740 ASSERT( middle.predecessor_count() == 2 && mp_list.size() == 2, "expected 2 predecessors" ); 789 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); 791 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); 793 ASSERT( middle.predecessor_count() == 1 && mp_list.size() == 1, "expected 1 predecessor" ); 827 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); 829 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); [all …]
|
/dports/devel/tbb/oneTBB-2020.3/src/test/ |
H A D | test_broadcast_node.cpp | 79 size_t predecessor_count() __TBB_override { return 0; } in predecessor_count() function in counting_array_receiver 95 ASSERT(b.predecessor_count() == 0, NULL); in test_serial_broadcasts() 259 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 2, "improper count for b0"); in test_extract() 260 ASSERT(b1.predecessor_count() == 1 && b1.successor_count() == 2, "improper count for b1"); in test_extract() 261 ASSERT(b2.predecessor_count() == 1 && b2.successor_count() == 2, "improper count for b2"); in test_extract() 262 ASSERT(b3.predecessor_count() == 1 && b3.successor_count() == 1, "improper count for b3"); in test_extract() 264 ASSERT(b5.predecessor_count() == 1 && b5.successor_count() == 1, "improper count for b5"); in test_extract() 266 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 2, "improper count for b0 after"); in test_extract() 267 …ASSERT(b1.predecessor_count() == 1 && b1.successor_count() == 1, "improper succ count for b1 after… in test_extract() 268 …ASSERT(b2.predecessor_count() == 1 && b2.successor_count() == 1, "improper succ count for b2 after… in test_extract() [all …]
|
H A D | test_multifunction_node.cpp | 446 ASSERT(mo_node.predecessor_count() == 0, NULL); in run_multiport_test() 549 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 1, "b0 has incorrect counts"); in test_extract() 550 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 551 ASSERT(mf0.predecessor_count() == 2 in test_extract() 555 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 556 ASSERT(q1.predecessor_count() == 1 && q1.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 577 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() 579 ASSERT(mf0.predecessor_count() == 1 in test_extract() 605 ASSERT(mf0.predecessor_count() == 1 in test_extract() 637 ASSERT(mf0.predecessor_count() == 0 in test_extract() [all …]
|
H A D | test_continue_node.cpp | 88 ASSERT(n.predecessor_count() == 0, NULL); in run_continue_nodes() 282 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 1, "b0 has incorrect counts"); in test_extract() 283 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 284 ASSERT(c0.predecessor_count() == 2 && c0.successor_count() == 1, "c0 has incorrect counts"); in test_extract() 285 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 309 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() 310 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 311 ASSERT(c0.predecessor_count() == 1 && c0.successor_count() == 1, "c0 has incorrect counts"); in test_extract() 312 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 330 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() [all …]
|
H A D | test_function_node.cpp | 285 ASSERT(exe_node.predecessor_count() == 0, NULL); in concurrency_levels() 495 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 1, "b0 has incorrect counts"); in test_extract() 496 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 497 ASSERT(f0.predecessor_count() == 2 && f0.successor_count() == 1, "f0 has incorrect counts"); in test_extract() 498 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 523 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() 524 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 525 ASSERT(f0.predecessor_count() == 1 && f0.successor_count() == 1, "f0 has incorrect counts"); in test_extract() 526 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 544 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() [all …]
|
H A D | test_indexer_node.cpp | 127 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); in make_and_validate_full_graph() 129 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); in make_and_validate_full_graph() 131 ASSERT( in2.predecessor_count() == 0 && in2_p_list.size() == 0, "expected 0 predecessors" ); in make_and_validate_full_graph() 194 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 196 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 198 ASSERT( in2.predecessor_count() == 0 && in2_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 203 … ASSERT( out0.predecessor_count() == 0 && out0_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 241 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); in validate_empty_graph() 243 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); in validate_empty_graph() 245 ASSERT( in2.predecessor_count() == 0 && in2_p_list.size() == 0, "expected 0 predecessors" ); in validate_empty_graph() [all …]
|
H A D | test_limiter_node.cpp | 59 size_t predecessor_count() __TBB_override { return 0; } in predecessor_count() function 91 size_t predecessor_count( ) __TBB_override { return 0; } in predecessor_count() function 165 ASSERT(lim.decrement.predecessor_count() == 1, NULL); in test_puts_with_decrements() 167 ASSERT(lim.predecessor_count() == 0, NULL); in test_puts_with_decrements() 328 REMARK("pred cnt == %d\n",(int)(lim_node.predecessor_count())); in test_multifunction_to_limiter() 512 ASSERT(node0.predecessor_count() == 0, "incorrect predecessor count at start"); in test_extract() 514 ASSERT(node0.decrement.predecessor_count() == 0, "incorrect decrement pred count at start"); in test_extract() 533 ASSERT(node0.predecessor_count() == 2, "incorrect predecessor count after construction"); in test_extract() 572 ASSERT(node0.predecessor_count() == 0, "incorrect predecessor count after extraction"); in test_extract() 601 ASSERT(node0.predecessor_count() == 0, "incorrect predecessor count after extract"); in test_extract() [all …]
|
H A D | harness_graph.h | 318 size_t predecessor_count() __TBB_override { return 0; } 389 size_t predecessor_count() __TBB_override { return 0; } 736 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); 738 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); 740 ASSERT( middle.predecessor_count() == 2 && mp_list.size() == 2, "expected 2 predecessors" ); 789 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); 791 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); 793 ASSERT( middle.predecessor_count() == 1 && mp_list.size() == 1, "expected 1 predecessor" ); 827 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); 829 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); [all …]
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/src/test/ |
H A D | test_broadcast_node.cpp | 79 size_t predecessor_count() __TBB_override { return 0; } in predecessor_count() function in counting_array_receiver 95 ASSERT(b.predecessor_count() == 0, NULL); in test_serial_broadcasts() 259 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 2, "improper count for b0"); in test_extract() 260 ASSERT(b1.predecessor_count() == 1 && b1.successor_count() == 2, "improper count for b1"); in test_extract() 261 ASSERT(b2.predecessor_count() == 1 && b2.successor_count() == 2, "improper count for b2"); in test_extract() 262 ASSERT(b3.predecessor_count() == 1 && b3.successor_count() == 1, "improper count for b3"); in test_extract() 264 ASSERT(b5.predecessor_count() == 1 && b5.successor_count() == 1, "improper count for b5"); in test_extract() 266 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 2, "improper count for b0 after"); in test_extract() 267 …ASSERT(b1.predecessor_count() == 1 && b1.successor_count() == 1, "improper succ count for b1 after… in test_extract() 268 …ASSERT(b2.predecessor_count() == 1 && b2.successor_count() == 1, "improper succ count for b2 after… in test_extract() [all …]
|
H A D | test_multifunction_node.cpp | 446 ASSERT(mo_node.predecessor_count() == 0, NULL); in run_multiport_test() 549 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 1, "b0 has incorrect counts"); in test_extract() 550 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 551 ASSERT(mf0.predecessor_count() == 2 in test_extract() 555 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 556 ASSERT(q1.predecessor_count() == 1 && q1.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 577 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() 579 ASSERT(mf0.predecessor_count() == 1 in test_extract() 605 ASSERT(mf0.predecessor_count() == 1 in test_extract() 637 ASSERT(mf0.predecessor_count() == 0 in test_extract() [all …]
|
H A D | test_continue_node.cpp | 88 ASSERT(n.predecessor_count() == 0, NULL); in run_continue_nodes() 282 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 1, "b0 has incorrect counts"); in test_extract() 283 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 284 ASSERT(c0.predecessor_count() == 2 && c0.successor_count() == 1, "c0 has incorrect counts"); in test_extract() 285 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 309 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() 310 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 311 ASSERT(c0.predecessor_count() == 1 && c0.successor_count() == 1, "c0 has incorrect counts"); in test_extract() 312 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 330 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() [all …]
|
H A D | test_function_node.cpp | 285 ASSERT(exe_node.predecessor_count() == 0, NULL); in concurrency_levels() 495 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 1, "b0 has incorrect counts"); in test_extract() 496 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 497 ASSERT(f0.predecessor_count() == 2 && f0.successor_count() == 1, "f0 has incorrect counts"); in test_extract() 498 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 523 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() 524 ASSERT(b1.predecessor_count() == 0 && b1.successor_count() == 1, "b1 has incorrect counts"); in test_extract() 525 ASSERT(f0.predecessor_count() == 1 && f0.successor_count() == 1, "f0 has incorrect counts"); in test_extract() 526 ASSERT(q0.predecessor_count() == 1 && q0.successor_count() == 0, "q0 has incorrect counts"); in test_extract() 544 ASSERT(b0.predecessor_count() == 0 && b0.successor_count() == 0, "b0 has incorrect counts"); in test_extract() [all …]
|
H A D | test_indexer_node.cpp | 127 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); in make_and_validate_full_graph() 129 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); in make_and_validate_full_graph() 131 ASSERT( in2.predecessor_count() == 0 && in2_p_list.size() == 0, "expected 0 predecessors" ); in make_and_validate_full_graph() 194 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 196 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 198 ASSERT( in2.predecessor_count() == 0 && in2_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 203 … ASSERT( out0.predecessor_count() == 0 && out0_p_list.size() == 0, "expected 0 predecessors" ); in validate_partial_graph() 241 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); in validate_empty_graph() 243 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); in validate_empty_graph() 245 ASSERT( in2.predecessor_count() == 0 && in2_p_list.size() == 0, "expected 0 predecessors" ); in validate_empty_graph() [all …]
|
H A D | test_limiter_node.cpp | 59 size_t predecessor_count() __TBB_override { return 0; } in predecessor_count() function 91 size_t predecessor_count( ) __TBB_override { return 0; } in predecessor_count() function 165 ASSERT(lim.decrement.predecessor_count() == 1, NULL); in test_puts_with_decrements() 167 ASSERT(lim.predecessor_count() == 0, NULL); in test_puts_with_decrements() 328 REMARK("pred cnt == %d\n",(int)(lim_node.predecessor_count())); in test_multifunction_to_limiter() 512 ASSERT(node0.predecessor_count() == 0, "incorrect predecessor count at start"); in test_extract() 514 ASSERT(node0.decrement.predecessor_count() == 0, "incorrect decrement pred count at start"); in test_extract() 533 ASSERT(node0.predecessor_count() == 2, "incorrect predecessor count after construction"); in test_extract() 572 ASSERT(node0.predecessor_count() == 0, "incorrect predecessor count after extraction"); in test_extract() 601 ASSERT(node0.predecessor_count() == 0, "incorrect predecessor count after extract"); in test_extract() [all …]
|
H A D | harness_graph.h | 318 size_t predecessor_count() __TBB_override { return 0; } 389 size_t predecessor_count() __TBB_override { return 0; } 736 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); 738 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); 740 ASSERT( middle.predecessor_count() == 2 && mp_list.size() == 2, "expected 2 predecessors" ); 789 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); 791 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); 793 ASSERT( middle.predecessor_count() == 1 && mp_list.size() == 1, "expected 1 predecessor" ); 827 ASSERT( in0.predecessor_count() == 0 && in0_p_list.size() == 0, "expected 0 predecessors" ); 829 ASSERT( in1.predecessor_count() == 0 && in1_p_list.size() == 0, "expected 0 predecessors" ); [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/torque/ |
H A D | cfg.cc | 182 auto predecessor_count = CountBlockPredecessors(cfg_); in OptimizeCfg() local 186 if (predecessor_count[block->id()] == 0) continue; in OptimizeCfg() 194 DCHECK_GT(predecessor_count[destination->id()], 0); in OptimizeCfg() 195 if (predecessor_count[destination->id()] != 1) break; in OptimizeCfg() 203 --predecessor_count[destination->id()]; in OptimizeCfg() 204 DCHECK_EQ(predecessor_count[destination->id()], 0); in OptimizeCfg() 209 [&](Block* b) { return predecessor_count[b->id()] == 0; }); in OptimizeCfg()
|
/dports/lang/v8/v8-9.6.180.12/src/torque/ |
H A D | cfg.cc | 182 auto predecessor_count = CountBlockPredecessors(cfg_); in OptimizeCfg() local 186 if (predecessor_count[block->id()] == 0) continue; in OptimizeCfg() 194 DCHECK_GT(predecessor_count[destination->id()], 0); in OptimizeCfg() 195 if (predecessor_count[destination->id()] != 1) break; in OptimizeCfg() 203 --predecessor_count[destination->id()]; in OptimizeCfg() 204 DCHECK_EQ(predecessor_count[destination->id()], 0); in OptimizeCfg() 209 [&](Block* b) { return predecessor_count[b->id()] == 0; }); in OptimizeCfg()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/torque/ |
H A D | cfg.cc | 182 auto predecessor_count = CountBlockPredecessors(cfg_); in OptimizeCfg() local 186 if (predecessor_count[block->id()] == 0) continue; in OptimizeCfg() 194 DCHECK_GT(predecessor_count[destination->id()], 0); in OptimizeCfg() 195 if (predecessor_count[destination->id()] != 1) break; in OptimizeCfg() 203 --predecessor_count[destination->id()]; in OptimizeCfg() 204 DCHECK_EQ(predecessor_count[destination->id()], 0); in OptimizeCfg() 209 [&](Block* b) { return predecessor_count[b->id()] == 0; }); in OptimizeCfg()
|
/dports/java/java-subversion/subversion-1.14.1/subversion/libsvn_fs_x/ |
H A D | noderevs.c | 79 int predecessor_count; member 262 binary_noderev.predecessor_count = noderev->predecessor_count; in svn_fs_x__noderevs_add() 425 noderev->predecessor_count = binary_noderev->predecessor_count; in svn_fs_x__noderevs_get() 560 svn_packed__add_uint(noderevs_stream, noderev->predecessor_count); in svn_fs_x__write_noderevs_container() 711 noderev.predecessor_count = (int)svn_packed__get_uint(noderevs_stream); in svn_fs_x__read_noderevs_container() 871 noderev->predecessor_count = binary_noderev->predecessor_count; in svn_fs_x__noderevs_get_func()
|