Home
last modified time | relevance | path

Searched refs:back (Results 2101 - 2125 of 2803) sorted by relevance

1...<<81828384858687888990>>...113

/third_party/typescript/tests/baselines/reference/tscWatch/emitAndErrorUpdates/assumeChangesOnlyAffectDirectDependencies/transitive-exports/no-circular-import/
H A Dexport-with-incremental.js547 Change:: Rename property title2 to title of interface ITest to revert back to original text
H A Dexport.js299 Change:: Rename property title2 to title of interface ITest to revert back to original text
/third_party/typescript/tests/baselines/reference/tscWatch/emitAndErrorUpdates/assumeChangesOnlyAffectDirectDependenciesAndD/transitive-exports/no-circular-import/
H A Dexport-with-incremental.js543 Change:: Rename property title2 to title of interface ITest to revert back to original text
H A Dexport.js319 Change:: Rename property title2 to title of interface ITest to revert back to original text
/third_party/typescript/tests/baselines/reference/tscWatch/emitAndErrorUpdates/assumeChangesOnlyAffectDirectDependenciesAndD/transitive-exports/yes-circular-import/
H A Dexports-with-incremental.js608 Change:: Rename property title2 to title of interface ITest to revert back to original text
H A Dexports.js354 Change:: Rename property title2 to title of interface ITest to revert back to original text
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Draw_hash_set_probe_benchmark.cc100 pointers[i] = pointers.back(); in allocate()
106 // Just put it back on the pool. No need to release the memory. in deallocate()
156 // Keep going until we hit min load factor again, then go back one. in GetMinMaxLoadSizes()
/third_party/skia/third_party/externals/abseil-cpp/absl/random/
H A Dbeta_distribution_test.cc351 (!cutoffs.empty() && boundary <= cutoffs.back())) { in SingleChiSquaredTest()
/third_party/skia/third_party/externals/abseil-cpp/absl/types/
H A Dspan.h300 // Span::back()
304 constexpr reference back() const noexcept {
/third_party/skia/modules/skparagraph/src/
H A DParagraphCache.cpp432 paragraph.fLines.back().setParagraphImpl(&paragraph); in GetStoredLayout()
/third_party/spirv-tools/source/opt/
H A Dfold.cpp222 return BinaryOperate(opcode, operand_words.front(), operand_words.back()); in OperateWords()
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/renderpass/
H A DvktRenderPassTestsUtil.cpp793 dependencies.push_back(createSubpassDependency<SubpassDep>(dependency, &memoryBarriers.back())); in createRenderPass()
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/tessellation/
H A DvktTessellationFractionalSpacingTests.cpp155 if (sortedCoords[0] != 0.0f || sortedCoords.back() != 1.0f) in verifyFractionalSpacingSingle()
/third_party/vulkan-loader/tests/framework/shim/
H A Dwindows_shim.cpp291 *phkResult = platform_shim.created_keys.back().get(); in ShimRegOpenKeyExA()
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/rich_editor/
H A Drich_editor_pattern.cpp2489 if (it == std::prev(spanNodes.end()) || StringUtils::ToWstring((*it)->GetSpanItem()->content).back() == L'\n') {
2549 isEnd = StringUtils::ToWstring(info->content).back() == '\n';
2575 isEnd = StringUtils::ToWstring(info->content).back() == '\n';
2919 if (!isParagraphHead && item->content.back() == '\n') {
3022 span = spans_.back();
3910 if (spans.back()) {
3911 end = spans.back()->interval.second;
5152 return !wContent.empty() && wContent.back() == L'\n';
5559 TAG_LOGI(AceLogTag::ACE_RICH_TEXT, "RichEditor %{public}d receives back press event", tmpHost->GetId());
6097 auto value = operationRecords_.back();
[all...]
/third_party/mesa3d/src/amd/vulkan/
H A Dradv_cmd_buffer.c91 .back = ~0u,
96 .back = ~0u,
101 .back = 0u,
1729 radeon_emit(cmd_buffer->cs, S_028434_STENCILTESTVAL_BF(d->stencil_reference.back) | in radv_emit_stencil()
1730 S_028434_STENCILMASK_BF(d->stencil_compare_mask.back) | in radv_emit_stencil()
1731 S_028434_STENCILWRITEMASK_BF(d->stencil_write_mask.back) | in radv_emit_stencil()
1841 S_028800_STENCILFUNC_BF(d->stencil_op.back.compare_op); in radv_emit_depth_control()
1856 S_02842C_STENCILFAIL_BF(si_translate_stencil_op(d->stencil_op.back.fail_op)) | in radv_emit_stencil_control()
1857 S_02842C_STENCILZPASS_BF(si_translate_stencil_op(d->stencil_op.back.pass_op)) | in radv_emit_stencil_control()
1858 S_02842C_STENCILZFAIL_BF(si_translate_stencil_op(d->stencil_op.back in radv_emit_stencil_control()
[all...]
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/text/
H A Dtext_pattern.cpp760 span = spans_.back(); in HandleUrlClick()
814 span = spans_.back(); in HandleClickOnTextAndSpan()
1819 AddUdmfTxtPreProcessor(resultObj, finalResult.back(), false); in ProcessNormalUdmfData()
1822 AddUdmfTxtPreProcessor(resultObj, finalResult.back(), true); in ProcessNormalUdmfData()
3230 spans_.back()->imageNodeId = imageSpanNode->GetId(); in AddImageToSpanItem()
3495 auto endY = dragBoxes_.back().Top(); in GetDragUpperLeftCoordinates()
/kernel/linux/linux-5.10/drivers/net/ethernet/intel/igc/
H A Digc_main.c1770 * igc_reuse_rx_page - page flip buffer and store it back on the ring
1901 /* hand second half of page back to the ring */ in igc_put_rx_buffer()
1946 /* if mapping failed free memory back to system since in igc_alloc_mapped_page()
1996 * because each write-back erases this info. in igc_alloc_rx_buffers()
2059 * descriptor has been written back in igc_clean_rx_irq()
2109 /* place incomplete frames back on ring for completion */ in igc_clean_rx_irq()
4329 * igc_watchdog - Timer Call-back
4634 /* fall back to MSI */ in igc_request_irq()
4655 /* fall back to legacy interrupts */ in igc_request_irq()
5065 struct igc_adapter *adapter = hw->back; in igc_read_pci_cfg()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/intel/e1000/
H A De1000_main.c210 struct e1000_adapter *adapter = hw->back; in e1000_get_hw_dev()
418 /* Just clear the power down bit to wake the phy back up */ in e1000_power_up_phy()
973 hw->back = adapter; in e1000_probe()
2841 * tso gets written back prematurely before the data is fully in e1000_tx_map()
3115 /* This goes back to the question of how to logically map a Tx queue in e1000_xmit_frame()
4689 * we assume back-to-back in e1000_smartspeed()
4847 struct e1000_adapter *adapter = hw->back; in e1000_pci_set_mwi()
4856 struct e1000_adapter *adapter = hw->back; in e1000_pci_clear_mwi()
4863 struct e1000_adapter *adapter = hw->back; in e1000_pcix_get_mmrbc()
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/intel/e1000/
H A De1000_main.c210 struct e1000_adapter *adapter = hw->back; in e1000_get_hw_dev()
418 /* Just clear the power down bit to wake the phy back up */ in e1000_power_up_phy()
973 hw->back = adapter; in e1000_probe()
2841 * tso gets written back prematurely before the data is fully in e1000_tx_map()
3115 /* This goes back to the question of how to logically map a Tx queue in e1000_xmit_frame()
4687 * we assume back-to-back in e1000_smartspeed()
4845 struct e1000_adapter *adapter = hw->back; in e1000_pci_set_mwi()
4854 struct e1000_adapter *adapter = hw->back; in e1000_pci_clear_mwi()
4861 struct e1000_adapter *adapter = hw->back; in e1000_pcix_get_mmrbc()
[all...]
/kernel/linux/linux-6.6/fs/f2fs/
H A Df2fs.h523 * we fall back to treating the name as an opaque byte sequence.
880 static inline bool __is_discard_mergeable(struct discard_info *back, in __is_discard_mergeable() argument
883 return (back->lstart + back->len == front->lstart) && in __is_discard_mergeable()
884 (back->len + front->len <= max_len); in __is_discard_mergeable()
888 struct discard_info *back, unsigned int max_len) in __is_discard_back_mergeable()
890 return __is_discard_mergeable(back, cur, max_len); in __is_discard_back_mergeable()
887 __is_discard_back_mergeable(struct discard_info *cur, struct discard_info *back, unsigned int max_len) __is_discard_back_mergeable() argument
/third_party/glslang/SPIRV/
H A DSpvBuilder.cpp180 type = groupedTypes[OpTypeVoid].back(); in makeVoidType()
200 type = groupedTypes[OpTypeBool].back(); in makeBoolType()
215 type = groupedTypes[OpTypeSampler].back(); in makeSamplerType()
1221 type = groupedTypes[OpTypeAccelerationStructureKHR].back(); in makeAccelerationStructureType()
1236 type = groupedTypes[OpTypeRayQueryKHR].back(); in makeRayQueryType()
1251 type = groupedTypes[OpTypeHitObjectNV].back(); in makeHitObjectNVType()
3039 // gets a vec4 back instead of a float. in createTextureCall()
3507 // Go back to the headerBlock and make the flow control split in makeEndIf()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DSROA.cpp341 /// a GEP back into the bounds using it elsewhere) and nor is the PHI, but we
924 "Map index doesn't point back to a slice with this user.");
1405 if (Indices.size() == 1 && cast<ConstantInt>(Indices.back())->isZero())
1574 /// pointer, walking back through bit casts and GEPs, searching for a base
1589 // fall back to it, so keep it and the base it was computed from around here.
3737 assert(Offsets.Splits.back() ==
3791 // Now we have to go *back* through all the stores, because a later store may
3881 LLVM_DEBUG(dbgs() << " new slice [" << NewSlices.back().beginOffset()
3882 << ", " << NewSlices.back().endOffset()
4030 LLVM_DEBUG(dbgs() << " new slice [" << NewSlices.back()
[all...]
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/multiview/
H A DvktMultiViewRenderTests.cpp1133 // VkStencilOpState back; in makeGraphicsPipeline()
2510 VK_CHECK(m_device->beginCommandBuffer(cmdBufferSecondary.back().get()->get(), &info)); in draw()
2512 m_device->cmdBindVertexBuffers(cmdBufferSecondary.back().get()->get(), 0u, DE_LENGTH_OF_ARRAY(vertexBuffers), vertexBuffers, vertexBufferOffsets); in draw()
2513 m_device->cmdBindPipeline(cmdBufferSecondary.back().get()->get(), VK_PIPELINE_BIND_POINT_GRAPHICS, **pipelines[subpassNdx]); in draw()
2535 m_device->cmdDraw(cmdBufferSecondary.back().get()->get(), 4u, 1u, (drawNdx + subpassNdx % m_squareCount) * 4u, 0u); in draw()
2537 VK_CHECK(m_device->endCommandBuffer(cmdBufferSecondary.back().get()->get())); in draw()
2539 m_device->cmdExecuteCommands(*m_cmdBuffer, 1u, &cmdBufferSecondary.back().get()->get()); in draw()
/third_party/rust/crates/memchr/bench/data/code/
H A Drust-library.rs2626 assert_eq!(n.back().unwrap(), &2); in test_basic()
2653 assert_eq!(p.back(), Some(&1)); in test_split_off()
2694 assert_eq!(m.back(), Some(&1)); in test_split_off()
11228 assert_eq!(*d.back().unwrap(), 137); in test_simple()
11262 assert_eq!((*deq.back().unwrap()).clone(), d.clone()); in test_parameterized()
12875 // Split search (both front & back non-empty): in test_binary_search()
12913 // Split search (both front & back non-empty): in test_partition_point()
14767 /// is free to give back more than we asked for.
16343 /// `String` to a [`str`][`&str`], then referencing the [`str`][`&str`] back to
16458 /// [`into_bytes`] method will give back th
27661 pub fn back(&self) -> Option<&T> { back() functions
41693 pub fn back(&self) -> Option<&T> { back() functions
[all...]

Completed in 105 milliseconds

1...<<81828384858687888990>>...113