Home
last modified time | relevance | path

Searched refs:n_blocks (Results 1 – 5 of 5) 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.h22 size_t n_blocks() const { return n_blocks_; } in n_blocks() function
36 explicit Data(size_t n_blocks);
55 Data* NewData(size_t n_blocks);
/external/v8/src/compiler/
Dbasic-block-instrumentor.cc54 size_t n_blocks = static_cast<size_t>(schedule->RpoBlockCount()) - 1; in Instrument() local
56 info->isolate()->GetOrCreateBasicBlockProfiler()->NewData(n_blocks); in Instrument()
76 for (BasicBlockVector::iterator it = blocks->begin(); block_number < n_blocks; in Instrument()
/external/libpcap/
Doptimize.c118 static int n_blocks; variable
219 memset((char *)levels, 0, n_blocks * sizeof(*levels)); in find_levels()
239 i = n_blocks * nodewords; in find_dom()
311 n_blocks * nodewords * sizeof(*all_closure_sets)); in find_closure()
1616 for (i = 0; i < n_blocks; ++i) in find_inedges()
1777 for (i = 0; i < n_blocks; ++i) in intern_blocks()
1782 for (i = n_blocks - 1; --i >= 0; ) { in intern_blocks()
1785 for (j = i + 1; j < n_blocks; ++j) { in intern_blocks()
1795 for (i = 0; i < n_blocks; ++i) { in intern_blocks()
1863 n = n_blocks++; in number_blks_r()
[all …]
/external/v8/test/cctest/compiler/
Dtest-basic-block-profiler.cc28 CHECK_EQ(static_cast<int>(size), static_cast<int>(data->n_blocks())); in Expect()