| /kernel/linux/linux-5.10/drivers/gpu/drm/udl/ |
| H A D | udl_transfer.c | 29 * Trims identical data from front and back of line
33 * for back and front buffer ptrs and width
39 const unsigned long *back = (const unsigned long *) bback;
47 if (back[j] != front[j]) {
54 if (back[k] != front[k]) {
167 /* go back and fill in raw pixel count */ in udl_compress_hline16()
|
| /third_party/mesa3d/src/freedreno/computerator/examples/ |
| H A D | test-opcodes.sh | 191 ; convert half results back to full:
210 ; convert half results back to full:
229 ; convert half results back to full:
|
| /third_party/node/deps/v8/src/snapshot/ |
| H A D | shared-heap-serializer.cc | 106 DCHECK(existing_cache->back().IsUndefined(roots)); in SerializeUsingSharedHeapObjectCache()
107 existing_cache->back() = *obj; in SerializeUsingSharedHeapObjectCache()
221 DCHECK(cache->back().IsUndefined(isolate())); in ReconstructSharedHeapObjectCacheForTesting()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| H A D | SlotIndexes.cpp | 83 SlotIndex blockStartIndex(&indexList.back(), SlotIndex::Slot_Block); in runOnMachineFunction()
94 &MI, SlotIndex(&indexList.back(), SlotIndex::Slot_Block))); in runOnMachineFunction()
101 MBBRanges[MBB.getNumber()].second = SlotIndex(&indexList.back(), in runOnMachineFunction()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/CodeView/ |
| H A D | ContinuationRecordBuilder.cpp | 122 return SegmentWriter.getOffset() - SegmentOffsets.back(); in getCurrentSegmentLength()
126 uint32_t SegmentBegin = SegmentOffsets.back(); in insertSegmentEnd()
132 // out the length or the TypeIndex of the back-reference, but we need the in insertSegmentEnd()
137 uint32_t SegmentLength = NewSegmentBegin - SegmentOffsets.back(); in insertSegmentEnd()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/ |
| H A D | RemarkStreamer.cpp | 96 R.Args.back().Key = Arg.Key; in toRemark()
97 R.Args.back().Val = Arg.Val; in toRemark()
98 R.Args.back().Loc = toRemarkLocation(Arg.Loc); in toRemark()
|
| /third_party/skia/third_party/externals/spirv-tools/test/ |
| H A D | operand_pattern_test.cpp | 40 EXPECT_EQ(SPV_OPERAND_TYPE_ID, pattern.back()); in TEST()
47 EXPECT_EQ(SPV_OPERAND_TYPE_NONE, pattern.back()); in TEST()
156 EXPECT_FALSE(spvOperandIsVariable(pattern.back())); in TEST_P()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/ |
| H A D | operand_pattern_test.cpp | 40 EXPECT_EQ(SPV_OPERAND_TYPE_ID, pattern.back()); in TEST()
47 EXPECT_EQ(SPV_OPERAND_TYPE_NONE, pattern.back()); in TEST()
156 EXPECT_FALSE(spvOperandIsVariable(pattern.back())); in TEST_P()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| H A D | TimeProfiler.cpp | 73 auto &E = Stack.back(); in end()
79 Entries.back().getFlameGraphStartUs(StartTime) + in end()
80 Entries.back().getFlameGraphDurUs())) && in end()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| H A D | cord_rep_btree_navigator.h | 132 // position available, and then does a 'back dive' towards the previous leaf
217 return index_[0] == edge->back() ? NextUp() : edge->Edge(++index_[0]); in Next()
226 assert(index_[0] == node_[0]->back()); in NextUp()
256 index_[height] = static_cast<uint8_t>(index = edge->back()); in PreviousUp()
|
| /third_party/skia/bench/ |
| H A D | SKPBench.cpp | 77 fSurfaces.back()->getCanvas()->clipRect(clip); in onPerCanvasPreDraw()
79 fSurfaces.back()->getCanvas()->setMatrix(canvas->getLocalToDevice()); in onPerCanvasPreDraw()
80 fSurfaces.back()->getCanvas()->scale(fScale, fScale); in onPerCanvasPreDraw()
|
| /third_party/spirv-tools/test/ |
| H A D | operand_pattern_test.cpp | 40 EXPECT_EQ(SPV_OPERAND_TYPE_ID, pattern.back()); in TEST()
47 EXPECT_EQ(SPV_OPERAND_TYPE_NONE, pattern.back()); in TEST()
163 EXPECT_FALSE(spvOperandIsVariable(pattern.back())); in TEST_P()
|
| /third_party/vk-gl-cts/framework/common/ |
| H A D | tcuTestHierarchyIterator.cpp | 128 const NodeIter& iter = m_sessionStack.back(); in getState()
142 return m_sessionStack.back().node; in getNode()
168 NodeIter& iter = m_sessionStack.back(); in next()
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/hisilicon/hns3/hns3pf/ |
| H A D | hclge_main.c | 599 struct hclge_dev *hdev = vport->back; in hclge_update_stats()
629 struct hclge_dev *hdev = vport->back; in hclge_get_sset_count()
674 struct hclge_dev *hdev = vport->back; in hclge_get_strings()
716 struct hclge_dev *hdev = vport->back; in hclge_get_stats()
728 struct hclge_dev *hdev = vport->back; in hclge_get_mac_stat()
907 struct hclge_dev *hdev = vport->back; in hclge_check_port_speed()
1654 struct hclge_dev *hdev = vport->back; in hclge_assign_tqp()
1686 struct hclge_dev *hdev = vport->back; in hclge_knic_setup()
1753 struct hclge_dev *hdev = vport->back; in hclge_vport_setup()
1803 vport->back in hclge_alloc_vport()
[all...] |
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/pipeline/ |
| H A D | vktPipelineMultisampledRenderToSingleSampledTests.cpp | 535 stencilOpState, // VkStencilOpState back; in makeGraphicsPipeline()
1286 barriers.back().image = *wd.floatResolve1.image; in initResolveImageLayouts()
1292 barriers.back().image = *wd.floatResolve2.image; in initResolveImageLayouts()
1298 barriers.back().image = *wd.intResolve.image; in initResolveImageLayouts()
1304 barriers.back().image = *wd.depthStencilResolve.image; in initResolveImageLayouts()
1305 barriers.back().newLayout = VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL; in initResolveImageLayouts()
1306 barriers.back().subresourceRange.aspectMask = getDepthStencilAspectFlags(params.depthStencilFormat); in initResolveImageLayouts()
1382 barriers.back().image = *wd.floatResolve1.image; in postRenderingResolveImageLayoutTransition()
1388 barriers.back().image = *wd.floatResolve2.image; in postRenderingResolveImageLayoutTransition()
1394 barriers.back() in postRenderingResolveImageLayoutTransition()
[all...] |
| /kernel/linux/linux-5.10/arch/hexagon/lib/ |
| H A D | memcpy.S | 26 * overreading bloated codesize back up to 892
160 #define back R7 /* nr bytes > dword boundary in src block */ define
217 back = cl0(len); define
222 prolog &= lsr(mask, back);
233 back = add(len, offset); define
255 p3 = cmp.gtu(back, #8);
|
| /kernel/linux/linux-6.6/arch/hexagon/lib/ |
| H A D | memcpy.S | 26 * overreading bloated codesize back up to 892
160 #define back R7 /* nr bytes > dword boundary in src block */ define
217 back = cl0(len); define
222 prolog &= lsr(mask, back);
233 back = add(len, offset); define
255 p3 = cmp.gtu(back, #8);
|
| /kernel/linux/linux-5.10/fs/xfs/scrub/ |
| H A D | dabtree.c | 282 xfs_dablk_t back; in xchk_da_btree_block_check_siblings() local
286 back = be32_to_cpu(hdr->back); in xchk_da_btree_block_check_siblings()
290 if (forw != 0 || back != 0) in xchk_da_btree_block_check_siblings()
296 * Check back (left) and forw (right) pointers. These functions in xchk_da_btree_block_check_siblings()
299 error = xchk_da_btree_block_check_sibling(ds, level, 0, back); in xchk_da_btree_block_check_siblings()
525 /* End of leaf, pop back towards the root. */ in xchk_da_btree()
547 /* End of node, pop back towards the root. */ in xchk_da_btree()
|
| /kernel/linux/linux-6.6/fs/xfs/scrub/ |
| H A D | dabtree.c | 283 xfs_dablk_t back; in xchk_da_btree_block_check_siblings() local
287 back = be32_to_cpu(hdr->back); in xchk_da_btree_block_check_siblings()
291 if (forw != 0 || back != 0) in xchk_da_btree_block_check_siblings()
297 * Check back (left) and forw (right) pointers. These functions in xchk_da_btree_block_check_siblings()
300 error = xchk_da_btree_block_check_sibling(ds, level, 0, back); in xchk_da_btree_block_check_siblings()
529 /* End of leaf, pop back towards the root. */ in xchk_da_btree()
551 /* End of node, pop back towards the root. */ in xchk_da_btree()
|
| /third_party/libwebsockets/lib/core/ |
| H A D | logs.c | 377 int n, back = 0; in __lws_logv() local
416 back++; in __lws_logv()
420 int b = back; in __lws_logv()
428 back--; in __lws_logv()
429 } while (back > 0); in __lws_logv()
|
| /third_party/mesa3d/src/microsoft/clc/ |
| H A D | compute_test.h | 81 ranges.back().RangeType == type && in add()
82 ranges.back().RegisterSpace == spaceid && in add()
83 ranges.back().BaseShaderRegister + ranges.back().NumDescriptors == resid) { in add()
84 ranges.back().NumDescriptors++; in add()
|
| /third_party/ltp/testcases/kernel/fs/read_all/ |
| H A D | read_all.c | 61 int back; member
141 int i = q->back, j = 0; in queue_push()
154 q->back = i; in queue_push()
169 q->back = 0; in queue_init()
393 while (i != w->q->back) { in restart_worker()
|
| /third_party/vk-gl-cts/executor/ |
| H A D | xeTestCase.cpp | 313 return curGroup->createCase(caseType, components.back().c_str()); in createCase()
464 const TestGroup* group = m_iterStack.back().group; in operator ++()
465 int& childNdx = m_iterStack.back().childNdx; in operator ++()
499 return m_iterStack.back().group->getChild(m_iterStack.back().childNdx); in operator *()
|
| /third_party/skia/src/gpu/ops/ |
| H A D | AtlasPathRenderer.cpp | 96 // If we have MSAA to fall back on, paths are already fast enough that we really only benefit from
220 !fAtlasRenderTasks.back()->addPath(viewMatrix, path, devIBounds->topLeft(), widthInAtlas, in addPathToAtlas()
223 auto currentAtlasTask = (!fAtlasRenderTasks.empty()) ? fAtlasRenderTasks.back().get() in addPathToAtlas()
259 const GrSurfaceProxy* atlasProxy = fAtlasRenderTasks.back()->atlasProxy(); in onCanDrawPath()
318 fAtlasRenderTasks.back()->readView(caps), in onDrawPath()
384 GrSurfaceProxyView atlasView = fAtlasRenderTasks.back()->readView(*sdc->caps()); in makeAtlasClipEffect()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| H A D | graphcycles_test.cc | 231 nodes[node_index] = nodes.back(); in TEST()
239 edges[i] = edges.back(); in TEST()
273 edges[i] = edges.back(); in TEST()
335 nodes[node_index] = nodes.back(); in TEST()
342 edges[j] = edges.back(); in TEST()
|