Home
last modified time | relevance | path

Searched refs:branch_factor (Results 1 – 25 of 44) sorted by relevance

12

/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/extensions/browser/
H A Dcontent_hash_tree.cc16 int branch_factor) { in ComputeTreeHashRoot() argument
17 if (leaf_hashes.empty() || branch_factor < 2) in ComputeTreeHashRoot()
38 for (int j = 0; j < branch_factor && i != current->end(); j++) { in ComputeTreeHashRoot()
H A Dcontent_hash_tree.h35 int branch_factor);
/dports/www/chromium-legacy/chromium-88.0.4324.182/extensions/browser/
H A Dcontent_hash_tree.cc16 int branch_factor) { in ComputeTreeHashRoot() argument
17 if (leaf_hashes.empty() || branch_factor < 2) in ComputeTreeHashRoot()
38 for (int j = 0; j < branch_factor && i != current->end(); j++) { in ComputeTreeHashRoot()
H A Dcontent_hash_tree.h35 int branch_factor);
/dports/security/cfv/cfv-3.0.0.dev0/test/
H A Dbenchmark.py76 def create_test_dir(root, num_files, branch_factor, max_size, verbose=False): argument
77 levels = int(math.ceil(math.log(num_files, branch_factor)))
78 formatlen = int(math.ceil(math.log(branch_factor, 16)))
96 while path_counter[inc_level] == branch_factor - 1:
107 create_test_dir(start_path, args.files, args.branch_factor, args.max_size, verbose=args.verbose)
/dports/benchmarks/mdtest/mdtest-1.9.3_13/
H A Dmdtest.c104 int branch_factor = 1; variable
890 for (i=0; i<branch_factor; i++) { in create_remove_items()
1003 while (parent_dir > branch_factor) { in mdtest_stat()
1161 while (parent_dir > branch_factor) { in mdtest_read()
2037 if (branch_factor < 1 && depth > 0) { in valid_tests()
2280 for (i=0; i<branch_factor; i++) { in create_remove_directory_tree()
2399 branch_factor = atoi(optarg); break; in main()
2520 if (branch_factor < 1) { in main()
2522 } else if (branch_factor == 1) { in main()
2526 (1 - pow(branch_factor, depth+1)) / (1 - branch_factor); in main()
[all …]
/dports/graphics/blender/blender-2.91.0/intern/cycles/kernel/
H A Dkernel_path_state.h32 state->branch_factor = 1.0f; in path_state_init()
240 return min(sqrtf(max3(fabs(throughput)) * state->branch_factor), 1.0f); in path_state_continuation_probability()
272 state->branch_factor *= num_branches; in path_state_branch()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/openmp/runtime/src/
H A Dkmp_barrier.cpp303 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
369 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
413 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
505 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
524 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
549 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
574 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
647 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
730 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
734 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/projects/openmp/runtime/src/
H A Dkmp_barrier.cpp303 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
369 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
413 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
505 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
524 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
549 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
573 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
645 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
728 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
732 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/projects/openmp/runtime/src/
H A Dkmp_barrier.cpp303 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
369 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
413 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
505 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
524 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
549 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
574 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
647 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
730 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
734 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/openmp/runtime/src/
H A Dkmp_barrier.cpp301 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
367 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
411 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
503 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
522 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
547 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
572 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
645 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
728 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
732 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/openmp/runtime/src/
H A Dkmp_barrier.cpp291 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
353 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
396 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
486 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
504 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
529 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
553 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
622 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
704 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
708 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/openmp/runtime/src/
H A Dkmp_barrier.cpp303 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
369 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
413 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
505 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
524 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
549 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
574 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
647 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
730 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
734 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/openmp/runtime/src/
H A Dkmp_barrier.cpp303 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
369 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
413 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
505 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
524 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
549 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
573 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
645 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
728 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
732 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/openmp/runtime/src/
H A Dkmp_barrier.cpp291 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
353 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
396 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
486 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
504 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
529 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
553 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
622 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
704 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
708 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/openmp/runtime/src/
H A Dkmp_barrier.cpp301 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
367 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
411 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
503 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
522 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
547 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
572 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
645 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
728 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
732 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/projects/openmp/runtime/src/
H A Dkmp_barrier.cpp302 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
365 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
409 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
501 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
520 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
545 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
569 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
638 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
721 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
725 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/llvm80/llvm-8.0.1.src/projects/openmp/runtime/src/
H A Dkmp_barrier.cpp256 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
319 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
363 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
455 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
474 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
499 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
523 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
592 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
675 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
679 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/openmp/runtime/src/
H A Dkmp_barrier.cpp291 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
353 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
396 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
486 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
504 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
529 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
553 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
622 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
704 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
708 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/sysutils/py-rdiff-backup/rdiff-backup-2.0.5/testing/
H A Dbenchmark.py50 def create_nested(dirname, s, depth, branch_factor=10): argument
61 sub_rps = [rp.append("file_%d" % i) for i in range(branch_factor)]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/openmp/runtime/src/
H A Dkmp_barrier.cpp803 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
865 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
908 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
998 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
1016 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
1041 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
1065 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
1134 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
1216 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
1220 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
[all …]
/dports/net-p2p/py-libtorrent-rasterbar/libtorrent-1.2.13/include/libtorrent/kademlia/
H A Dtraversal_algorithm.hpp83 int branch_factor() const { TORRENT_ASSERT(m_branch_factor >= 0); return m_branch_factor; } in branch_factor() function
/dports/net-p2p/libtorrent-rasterbar/libtorrent-rasterbar-1.2.14/include/libtorrent/kademlia/
H A Dtraversal_algorithm.hpp83 int branch_factor() const { TORRENT_ASSERT(m_branch_factor >= 0); return m_branch_factor; } in branch_factor() function
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/clk/rockchip/
H A Dclk.h428 branch_factor, enumerator
760 .branch_type = branch_factor, \
772 .branch_type = branch_factor, \
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/clk/rockchip/
H A Dclk.h428 branch_factor, enumerator
760 .branch_type = branch_factor, \
772 .branch_type = branch_factor, \

12