Home
last modified time | relevance | path

Searched refs:covered_cases (Results 1 - 3 of 3) sorted by relevance

/third_party/node/deps/v8/src/interpreter/
H A Dcontrol-flow-builders.cc123 int min_case, int max_case, std::map<int, CaseClause*>& covered_cases) { in EmitJumpTableIfExists()
127 if (covered_cases.find(j) == covered_cases.end()) { in EmitJumpTableIfExists()
122 EmitJumpTableIfExists( int min_case, int max_case, std::map<int, CaseClause*>& covered_cases) EmitJumpTableIfExists() argument
H A Dcontrol-flow-builders.h178 std::map<int, CaseClause*>& covered_cases);
H A Dbytecode-generator.cc1841 std::map<int, CaseClause*> covered_cases; member
1848 return covered_cases.find(j) != covered_cases.end(); in CaseExists()
1855 CaseClause* GetClause(int j) { return covered_cases[j]; } in GetClause()
1863 return covered_cases.size() == 0 ? INT_MAX : covered_cases.begin()->first; in MinCase()
1866 return covered_cases.size() == 0 ? INT_MIN : covered_cases.rbegin()->first; in MaxCase()
1870 for (auto iter = covered_cases.begin(); iter != covered_cases in Print()
[all...]

Completed in 8 milliseconds