Home
last modified time | relevance | path

Searched refs:invalid_input (Results 1 – 9 of 9) sorted by relevance

/external/ltp/testcases/kernel/power_management/
Drunpwtests06.sh29 invalid_input="3 4 5 6 7 8 a abcefg x1999 xffff -1 -00000
42 check_input "${invalid_input}" invalid $test_file
Drunpwtests02.sh31 invalid_input="3 4 5 6 7 8 a abcefg x1999 xffff -1 -00000
43 check_input "${invalid_input}" invalid $test_file
Drunpwtests01.sh31 invalid_input="3 4 5 6 7 8 a abcefg x1999 xffff -1 -00000
44 check_input "${invalid_input}" invalid $test_file
/external/cronet/net/third_party/quiche/src/quiche/spdy/core/
Dspdy_alt_svc_wire_format_test.cc432 for (const char* invalid_input : invalid_input_array) { in TEST() local
433 absl::string_view input(invalid_input); in TEST()
483 for (const char* invalid_input : invalid_input_array) { in TEST() local
484 absl::string_view input(invalid_input); in TEST()
511 for (const char* invalid_input : invalid_input_array) { in TEST() local
512 absl::string_view input(invalid_input); in TEST()
/external/tensorflow/tensorflow/tools/graph_transforms/
Dsummarize_graph_main.cc246 for (const std::pair<string, string>& invalid_input : invalid_inputs) { in SummarizeGraph() local
247 std::cout << "Invalid input " << invalid_input.second << " for node " in SummarizeGraph()
248 << invalid_input.first << std::endl; in SummarizeGraph()
Dtransform_utils_test.cc737 for (const std::pair<string, string>& invalid_input : invalid_inputs) { in TestFindInvalidInputs() local
738 EXPECT_TRUE((invalid_input.first == "add_node1") || in TestFindInvalidInputs()
739 (invalid_input.first == "add_node2")); in TestFindInvalidInputs()
740 if (invalid_input.first == "add_node1") { in TestFindInvalidInputs()
741 EXPECT_TRUE((invalid_input.second == "missing_input1") || in TestFindInvalidInputs()
742 (invalid_input.second == "missing_input2")) in TestFindInvalidInputs()
743 << invalid_input.second; in TestFindInvalidInputs()
744 } else if (invalid_input.first == "add_node2") { in TestFindInvalidInputs()
745 EXPECT_EQ("missing_input3", invalid_input.second); in TestFindInvalidInputs()
Dtransform_utils.cc578 for (const std::pair<string, string>& invalid_input : invalid_inputs) { in IsGraphValid() local
579 LOG(ERROR) << "Invalid input " << invalid_input.second << " for node " in IsGraphValid()
580 << invalid_input.first << " - " in IsGraphValid()
581 << node_map[invalid_input.first]->DebugString(); in IsGraphValid()
/external/cronet/base/files/
Dfile_path_unittest.cc1473 for (auto* invalid_input : cases) { in TEST_F() local
1475 invalid_input); in TEST_F()
1485 for (auto* invalid_input : cases) { in TEST_F() local
1487 EXPECT_EQ(FilePath::CompareIgnoreCase(invalid_input, FPL("fixed")), 1); in TEST_F()
/external/libchrome/base/files/
Dfile_path_unittest.cc1311 for (auto* invalid_input : cases) { in TEST_F() local
1313 invalid_input); in TEST_F()