Home
last modified time | relevance | path

Searched refs:will_overflow (Results 1 – 5 of 5) sorted by relevance

/aosp_15_r20/external/harfbuzz_ng/src/
H A Dhb-repacker.hh351 bool will_overflow = graph::will_overflow (sorted_graph); in hb_resolve_graph_overflows() local
352 if (!will_overflow) in hb_resolve_graph_overflows()
357 if (is_gsub_or_gpos && will_overflow) in hb_resolve_graph_overflows()
386 && graph::will_overflow (sorted_graph, &overflows) in hb_resolve_graph_overflows()
414 if (graph::will_overflow (sorted_graph)) in hb_resolve_graph_overflows()
H A Dtest-repacker.cc450 if (graph::will_overflow (expected_graph)) in run_resolve_overflow_test()
1709 assert (!graph::will_overflow (graph, nullptr)); in test_will_overflow_1()
1722 assert (graph::will_overflow (graph, nullptr)); in test_will_overflow_2()
1735 assert (graph::will_overflow (graph, nullptr)); in test_will_overflow_3()
/aosp_15_r20/external/cronet/base/profiler/
H A Dframe_pointer_unwinder_unittest.cc214 uintptr_t will_overflow = std::numeric_limits<uintptr_t>::max() - 1; in TEST_F() local
225 RegisterContextFramePointer(&context) = will_overflow; in TEST_F()
/aosp_15_r20/external/harfbuzz_ng/src/graph/
H A Dserialize.hh108 will_overflow (graph_t& graph, in will_overflow() function
/aosp_15_r20/external/harfbuzz_ng/docs/
H A Drepacker.md72 if (graph.will_overflow())
77 while (overflows = graph.will_overflow()):