/hardware/google/gfxstream/guest/mesa/src/util/ |
D | dag.c | 34 struct dag_edge edge = { in append_edge() local 39 util_dynarray_append(&parent->edges, struct dag_edge, edge); in append_edge() 52 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) { in dag_add_edge() 53 if (edge->child == child && edge->data == data) in dag_add_edge() 72 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) { in dag_add_edge_max_data() 73 if (edge->child == child) { in dag_add_edge_max_data() 74 edge->data = MAX2(edge->data, data); in dag_add_edge_max_data() 89 dag_remove_edge(struct dag *dag, struct dag_edge *edge) in dag_remove_edge() argument 91 if (!edge->child) in dag_remove_edge() 94 struct dag_node *child = edge->child; in dag_remove_edge() [all …]
|
D | dag.h | 57 void dag_remove_edge(struct dag *dag, struct dag_edge *edge);
|
/hardware/interfaces/tests/trie/1.0/default/ |
D | Trie.cpp | 74 [&](const TrieEdge& edge) { return ch == edge.character; }); in addString() argument 96 [&](const TrieEdge& edge) { return ch == edge.character; }); in containsString() argument
|
/hardware/google/gfxstream/codegen/vulkan/vulkan-docs-next/proposals/ |
D | VK_EXT_non_seamless_cube_map.adoc | 12 Other graphics APIs, such as OpenGL and D3D9, have cube maps without seamless edge handling. 13 When sampling near an edge, instead of interpolating between two texels on the neighboring cube map… 14 Vulkan only has cube maps with seamless edge handling. 31 A new per sampler setting to allow to select if cube map edge sampling is seamless can be introduce… 48 Using `VK_SAMPLER_CREATE_NON_SEAMLESS_CUBE_MAP_BIT_EXT` disables seamless cube map edge handling. 52 As an example, if an application creates a cube map and wants to always clamp to the edge within th…
|
/hardware/google/gfxstream/guest/mesa/src/util/tests/ |
D | dag_test.cpp | 191 util_dynarray_foreach (&node[0].edges, struct dag_edge, edge) { in TEST_F() 192 if (edge->child == &node[1]) { in TEST_F() 193 EXPECT_EQ(edge->data, 1); in TEST_F() 195 EXPECT_EQ(edge->child, &node[2]); in TEST_F() 196 EXPECT_EQ(edge->data, 0); in TEST_F()
|
/hardware/st/nfc/1.0/adaptation/ |
D | i2clayer.c | 62 static int i2cSetPolarity(int fid, bool low, bool edge); 296 static int i2cSetPolarity(int fid, bool low, bool edge) in i2cSetPolarity() argument 302 if (edge) { in i2cSetPolarity() 309 if (edge) { in i2cSetPolarity()
|
/hardware/google/gfxstream/codegen/vulkan/vulkan-docs-next/chapters/ |
D | tessellation.adoc | 166 subdivisions along each edge of the domain. 201 of segments used to subdivide a corresponding edge. 212 corresponding edge is divided into [eq]#n# segments of equal length in (u,v) 221 If [eq]#n# is one, the edge will not be subdivided. 222 Otherwise, the corresponding edge will be divided into [eq]#n - 2# segments 233 of the subdivided edge. 240 vertices_ that are positioned on the edge of the patch if an inner 243 the outer edge of the patch, even if there are pairs of vertices with 331 produce _inner vertices_ positioned on the edge of the triangle. 343 outer edge nearest that corner. [all …]
|
/hardware/google/gfxstream/codegen/vulkan/vulkan-docs-next/appendices/ |
D | invariance.adoc | 180 *Rule 2* _The set of vertices generated along the outer edge of the 187 edge is always symmetric. 200 triangular and quad tessellation must: be independent of the specific edge 203 subdividing the w = 0 edge in triangular tessellation, vertices must: be 205 identical v = 0 edge. 207 subdividing the v = 0 edge, vertices must: be generated at (0, x) and (0, 208 1-x) when subdividing an otherwise identical u = 0 edge._ 229 none of its vertices lie on an outer edge of the subdivided primitive._ 232 connecting an inner and outer edge depends only on the inner and outer 233 tessellation levels corresponding to that edge and the spacing decorations._
|
D | VK_EXT_depth_clamp_zero_one.adoc | 18 It can be used to ensure portability in edge cases of features like
|
D | VK_EXT_non_seamless_cube_map.adoc | 19 cube map edge handling>> on a per sampler level which matches the behavior
|
D | VK_QCOM_fragment_density_map_offset.adoc | 69 1024x1024 for this example before density value access is clamped to edge of map 80 before the density values are clamped to edge of map
|
D | VK_NV_fill_rectangle.adoc | 20 triangles with an internal edge.
|
D | VK_EXT_extended_dynamic_state.adoc | 50 Implementing these edge cases adds overhead to some implementations that
|
D | VK_KHR_buffer_device_address.adoc | 100 extensions were added to help cover a few edge cases missed by the original
|
/hardware/st/nfc/st21nfc/adaptation/ |
D | i2clayer.cc | 72 static int i2cSetPolarity(int fid, bool low, bool edge); 395 static int i2cSetPolarity(int fid, bool low, bool edge) { in i2cSetPolarity() argument 400 if (edge) { in i2cSetPolarity() 407 if (edge) { in i2cSetPolarity()
|
/hardware/google/gfxstream/third-party/glm/include/glm/detail/ |
D | func_common.hpp | 240 GLM_FUNC_DECL genType step(genType edge, genType x); 247 GLM_FUNC_DECL vecType<T, P> step(T edge, vecType<T, P> const & x); 254 GLM_FUNC_DECL vecType<T, P> step(vecType<T, P> const & edge, vecType<T, P> const & x);
|
D | func_common_simd.inl | 210 …GLM_FUNC_QUALIFIER static tvec4<float, P> call(tvec4<float, P> const& edge, tvec4<float, P> const&… 213 result.data = glm_vec4_step(edge.data, x.data);
|
D | func_common.inl | 290 GLM_FUNC_QUALIFIER static vecType<T, P> call(vecType<T, P> const & edge, vecType<T, P> const & x) 292 return mix(vecType<T, P>(1), vecType<T, P>(0), glm::lessThan(x, edge)); 583 GLM_FUNC_QUALIFIER genType step(genType edge, genType x) argument 585 return mix(static_cast<genType>(1), static_cast<genType>(0), glm::lessThan(x, edge)); 589 GLM_FUNC_QUALIFIER vecType<T, P> step(T edge, vecType<T, P> const & x) argument 591 …il::compute_step_vector<T, P, vecType, detail::is_aligned<P>::value>::call(vecType<T, P>(edge), x); 595 GLM_FUNC_QUALIFIER vecType<T, P> step(vecType<T, P> const & edge, vecType<T, P> const & x) argument 597 return detail::compute_step_vector<T, P, vecType, detail::is_aligned<P>::value>::call(edge, x);
|
/hardware/google/gfxstream/codegen/vulkan/vulkan-docs-next/chapters/VK_QCOM_rotated_copies/ |
D | rotated_addressing_blits.adoc | 88 Implementations must: clamp at the edge of the source image, and may: 89 additionally clamp to the edge of the source region.
|
/hardware/google/gfxstream/third-party/glm/include/glm/gtx/ |
D | simd_vec4.hpp | 299 detail::fvec4SIMD const & edge, 303 float const & edge,
|
D | simd_vec4.inl | 454 detail::fvec4SIMD const & edge, argument 458 __m128 cmp0 = _mm_cmpngt_ps(x.Data, edge.Data); 464 float const & edge, argument 468 __m128 cmp0 = _mm_cmpngt_ps(x.Data, _mm_set1_ps(edge));
|
/hardware/google/gfxstream/third-party/glm/include/glm/simd/ |
D | common.h | 199 GLM_FUNC_QUALIFIER glm_vec4 glm_vec4_step(glm_vec4 edge, glm_vec4 x) in glm_vec4_step() argument 201 glm_vec4 const cmp = _mm_cmple_ps(x, edge); in glm_vec4_step()
|
/hardware/interfaces/camera/metadata/3.2/ |
D | types.hal | 530 /** android.edge.mode [dynamic, enum, public] 532 * <p>Operation mode for edge 537 /** android.edge.strength [controls, byte, system] 539 * <p>Control the amount of edge enhancement 544 /** android.edge.availableEdgeModes [static, byte[], public] 546 * <p>List of edge enhancement modes for ANDROID_EDGE_MODE that are supported by this camera 2108 /** android.edge.mode enumeration values
|
/hardware/interfaces/input/common/1.0/ |
D | types.hal | 537 /** Motion intersected top edge of the screen */ 539 /** Motion intersected bottom edge of the screen */ 541 /** Motion intersected left edge of the screen */ 543 /** Motion intersected right edge of the screen */
|
/hardware/google/gfxstream/codegen/vulkan/vulkan-docs-next/chapters/VK_EXT_host_image_copy/ |
D | copies.adoc | 70 extents must: match the edge of the image. 208 extents must: match the edge of the image.
|