Home
last modified time | relevance | path

Searched refs:n_blocks (Results 1 – 6 of 6) sorted by relevance

/external/v8/src/
Dbasic-block-profiler.cc12 BasicBlockProfiler::Data::Data(size_t n_blocks) in Data() argument
13 : n_blocks_(n_blocks), block_ids_(n_blocks_), counts_(n_blocks_, 0) {} in Data()
61 BasicBlockProfiler::Data* BasicBlockProfiler::NewData(size_t n_blocks) { in NewData() argument
62 Data* data = new Data(n_blocks); in NewData()
Dbasic-block-profiler.h23 size_t n_blocks() const { return n_blocks_; } in n_blocks() function
37 explicit Data(size_t n_blocks);
56 Data* NewData(size_t n_blocks);
/external/v8/src/compiler/
Dbasic-block-instrumentor.cc55 size_t n_blocks = static_cast<size_t>(schedule->RpoBlockCount()) - 1; in Instrument() local
57 info->isolate()->GetOrCreateBasicBlockProfiler()->NewData(n_blocks); in Instrument()
77 for (BasicBlockVector::iterator it = blocks->begin(); block_number < n_blocks; in Instrument()
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
DTensorContractionThreadPool.h50 const Index n_blocks; member
807 const Index n_blocks = CEIL_DIV(n, nc);
833 MaxSizeVector<RhsScalar *> blockBs(n_blocks);
834 for (int i = 0; i < n_blocks; i++) {
842 const Index num_kernel_notifications = num_threads * n_blocks;
861 for (int i = 0; i < n_blocks; ++i) {
862 Index notification_id = (blockAId * n_blocks + i);
892 for (Index n_block_idx = 0; n_block_idx < n_blocks; n_block_idx++) {
901 Index future_id = (blockAId * n_blocks + n_block_idx);
924 n_blocks, // n_blocks
[all …]
DTensorContractionCuda.h1319 const Index n_blocks = (n + 63) / 64;
1320 const dim3 num_blocks(m_blocks, n_blocks, 1);
1330 const Index n_blocks = (n + 63) / 64;
1331 const dim3 num_blocks(m_blocks, n_blocks, 1);
1336 const Index n_blocks = (n + 63) / 64;
1337 const dim3 num_blocks(m_blocks, n_blocks, 1);
/external/libpcap/
Doptimize.c138 int n_blocks; member
271 memset((char *)opt_state->levels, 0, opt_state->n_blocks * sizeof(*opt_state->levels)); in find_levels()
291 i = opt_state->n_blocks * opt_state->nodewords; in find_dom()
363 opt_state->n_blocks * opt_state->nodewords * sizeof(*opt_state->all_closure_sets)); in find_closure()
1641 for (i = 0; i < opt_state->n_blocks; ++i) in find_inedges()
1801 for (i = 0; i < opt_state->n_blocks; ++i) in intern_blocks()
1806 for (i = opt_state->n_blocks - 1; --i >= 0; ) { in intern_blocks()
1809 for (j = i + 1; j < opt_state->n_blocks; ++j) { in intern_blocks()
1819 for (i = 0; i < opt_state->n_blocks; ++i) { in intern_blocks()
1887 n = opt_state->n_blocks++; in number_blks_r()
[all …]