Home
last modified time | relevance | path

Searched refs:idy (Results 1 - 5 of 5) sorted by relevance

/third_party/skia/tests/
H A DPathCoverageTest.cpp30 int idy = SkAbs32(SkScalarRoundToInt(dy)); in cheap_distance() local
31 if (idx > idy) { in cheap_distance()
32 idx += idy >> 1; in cheap_distance()
34 idx = idy + (idx >> 1); in cheap_distance()
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles.cc493 bool GraphCycles::InsertEdge(GraphId idx, GraphId idy) { in InsertEdge() argument
496 const int32_t y = NodeIndex(idy); in InsertEdge()
498 Node* ny = FindNode(r, idy); in InsertEdge()
625 int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len, in FindPath() argument
628 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
630 const int32_t y = NodeIndex(idy); in FindPath()
/third_party/skia/third_party/externals/tint/src/resolver/
H A Darray_accessor_test.cc49 auto* idy = Var("idy", ty.u32(), Expr(2u)); in TEST_F() local
50 auto* acc = IndexAccessor(IndexAccessor("my_var", idx), idy); in TEST_F()
51 WrapInFunction(Decl(idx), Decl(idy), acc); in TEST_F()
80 auto* idx = Var("idy", ty.u32(), Expr(2u)); in TEST_F()
/third_party/skia/src/core/
H A DSkScan_Hairline.cpp233 uint32_t idy = SkScalarCeilToInt(dy);
235 if (idx > idy) {
236 return idx + (idy >> 1);
238 return idy + (idx >> 1);
/third_party/skia/third_party/externals/angle2/src/tests/gl_tests/
H A DShaderStorageBufferTest.cpp1304 for (unsigned int idy = 0; idy < kComponentCount; idy++) in TEST_P()
1306 EXPECT_EQ(kExpectedValues[idx][idy], *(ptr + idx * kComponentCount + idy)); in TEST_P()

Completed in 10 milliseconds