Home
last modified time | relevance | path

Searched refs:back (Results 26 - 50 of 2267) sorted by relevance

12345678910>>...91

/third_party/rust/crates/unicode-ident/generate/src/
H A Dmain.rs93 let mut back = [0u8; CHUNK / 2]; in main() variables
95 back.copy_from_slice(&chunk[CHUNK / 2..]); in main()
99 .push_back(back); in main()
110 let mut back = [0u8; CHUNK / 2]; in main() variables
112 back.copy_from_slice(&chunk[CHUNK / 2..]); in main()
121 halfdense.extend_from_slice(&back); in main()
122 while let Some(next) = halfchunkmap.get_mut(&back).and_then(VecDeque::pop_front) { in main()
124 concat[..CHUNK / 2].copy_from_slice(&back); in main()
138 back = next; in main()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.cpp16 if (Lists.back().EntryOffset == Entries.size()) { in finalizeList()
23 Lists.back().Label = Asm.createTempSymbol("debug_loc"); in finalizeList()
28 if (Entries.back().ByteOffset != DWARFBytes.size()) in finalizeEntry()
32 Comments.erase(Comments.begin() + Entries.back().CommentOffset, in finalizeEntry()
36 assert(Lists.back().EntryOffset <= Entries.size() && in finalizeEntry()
/third_party/skia/src/core/
H A DSkClipStack.cpp579 Element* element = (Element*)fDeque.back(); in reset()
598 Element* element = (Element*)fDeque.back(); in restoreTo()
626 Element* element = (Element*)fDeque.back(); in getBounds()
698 // Use reverse iterator instead of back because Rect path may need previous in pushElement()
705 prior = (Element*) fDeque.back(); in pushElement()
780 Element* element = (Element*) fDeque.back(); in clipEmpty()
787 ((Element*)fDeque.back())->fGenID = kEmptyGenID; in clipEmpty()
881 const Element* back = static_cast<const Element*>(fDeque.back()); in isRRect() local
882 if (!back) { in isRRect()
952 const Element* back = static_cast<const Element*>(fDeque.back()); getTopmostGenID() local
[all...]
/kernel/linux/linux-5.10/fs/erofs/
H A Dnamei.c51 int head, back; in find_target_dirent() local
57 back = ndirents - 1; in find_target_dirent()
60 while (head <= back) { in find_target_dirent()
61 const int mid = head + (back - head) / 2; in find_target_dirent()
82 back = mid - 1; in find_target_dirent()
95 int head, back; in find_target_block_classic() local
101 back = erofs_inode_datablocks(dir) - 1; in find_target_block_classic()
103 while (head <= back) { in find_target_block_classic()
104 const int mid = head + (back - head) / 2; in find_target_block_classic()
155 back in find_target_block_classic()
[all...]
/third_party/glslang/glslang/HLSL/
H A DhlslTokenStream.cpp96 token = currentTokenStack.back(); in popTokenStream()
110 ++tokenPosition.back(); in advanceToken()
111 if (tokenPosition.back() >= (int)tokenStreamStack.back()->size()) in advanceToken()
114 token = (*tokenStreamStack.back())[tokenPosition.back()]; in advanceToken()
/third_party/mesa3d/src/amd/compiler/
H A Daco_insert_exec_mask.cpp189 if (ctx.info[idx].exec.back().second & mask_type_wqm) in transition_to_WQM()
191 if (ctx.info[idx].exec.back().second & mask_type_global) { in transition_to_WQM()
192 Operand exec_mask = ctx.info[idx].exec.back().first; in transition_to_WQM()
195 ctx.info[idx].exec.back().first = exec_mask; in transition_to_WQM()
205 assert(ctx.info[idx].exec.back().second & mask_type_wqm); in transition_to_WQM()
206 assert(ctx.info[idx].exec.back().first.size() == bld.lm.size()); in transition_to_WQM()
207 assert(ctx.info[idx].exec.back().first.isTemp()); in transition_to_WQM()
208 ctx.info[idx].exec.back().first = in transition_to_WQM()
209 bld.copy(Definition(exec, bld.lm), ctx.info[idx].exec.back().first); in transition_to_WQM()
215 if (ctx.info[idx].exec.back() in transition_to_Exact()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DJSON.cpp95 back().moveFrom(std::move(V)); in Array()
290 if (!parseValue(A.back())) in parseValue()
629 assert(Stack.back().Ctx != Object && "Only attributes allowed here"); in valueBegin()
630 if (Stack.back().HasValue) { in valueBegin()
631 assert(Stack.back().Ctx != Singleton && "Only one value allowed here"); in valueBegin()
634 if (Stack.back().Ctx == Array) in valueBegin()
636 Stack.back().HasValue = true; in valueBegin()
649 Stack.back().Ctx = Array; in arrayBegin()
655 assert(Stack.back().Ctx == Array); in arrayEnd()
657 if (Stack.back() in arrayEnd()
[all...]
/third_party/musl/libc-test/src/functionalext/supplement/thread/
H A Dpthread_cond_init.c30 int back = pthread_cond_init(&cond, NULL); in pthread_cond_init_0100() local
31 EXPECT_EQ("pthread_cond_init_0100", back, SUCCESS); in pthread_cond_init_0100()
44 int back = pthread_cond_init(&cond, &a); in pthread_cond_init_0200() local
45 EXPECT_EQ("pthread_cond_init_0200", back, SUCCESS); in pthread_cond_init_0200()
H A Dpthread_attr_init.c36 int back = pthread_attr_init(&attr); in pthread_attr_init_0100() local
37 EXPECT_EQ("pthread_attr_init_0100", back, SUCCESS); in pthread_attr_init_0100()
50 int back = pthread_attr_init(&attr); in pthread_attr_init_0200() local
53 EXPECT_EQ("pthread_attr_init_0200", back, SUCCESS); in pthread_attr_init_0200()
/third_party/musl/libc-test/src/functionalext/supplement/mman/
H A Dmmap.c47 int back = stat(ptr, &statbuff); in mmap_0100() local
53 EXPECT_EQ("mmap_0100", back, SUCCESS); in mmap_0100()
86 int back = stat(ptr, &statbuff); in mmap_0200() local
91 EXPECT_EQ("mmap_0200", back, SUCCESS); in mmap_0200()
140 int back = stat(ptr, &statbuff); in mmap_0400() local
145 EXPECT_EQ("mmap_0400", back, SUCCESS); in mmap_0400()
177 int back = stat(ptr, &statbuff); in mmap_0500() local
183 EXPECT_EQ("mmap_0500", back, SUCCESS); in mmap_0500()
215 int back = stat(ptr, &statbuff); in mmap_0600() local
220 EXPECT_EQ("mmap_0600", back, SUCCES in mmap_0600()
250 int back = stat(ptr, &statbuff); mmap_0700() local
349 int back = stat(ptr, &statbuff); mmap_1000() local
385 int back = stat(ptr, &statbuff); mmap_1100() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/TableGen/
H A DTGLexer.cpp576 if (!PrepIncludeStack.back()->empty()) { in prepExitInclude()
694 PrepIncludeStack.back()->push_back( in lexPreprocessor()
702 // then just return back to the lines skipping code. in lexPreprocessor()
722 if (PrepIncludeStack.back()->empty()) in lexPreprocessor()
725 PreprocessorControlDesc IfdefEntry = PrepIncludeStack.back()->back(); in lexPreprocessor()
734 PrepIncludeStack.back()->pop_back(); in lexPreprocessor()
735 PrepIncludeStack.back()->push_back( in lexPreprocessor()
755 if (PrepIncludeStack.back()->empty()) in lexPreprocessor()
758 auto &IfdefOrElseEntry = PrepIncludeStack.back() in lexPreprocessor()
[all...]
/kernel/linux/linux-6.6/fs/erofs/
H A Dnamei.c50 int head, back; in find_target_dirent() local
56 back = ndirents - 1; in find_target_dirent()
59 while (head <= back) { in find_target_dirent()
60 const int mid = head + (back - head) / 2; in find_target_dirent()
81 back = mid - 1; in find_target_dirent()
93 int head = 0, back = erofs_iblks(dir) - 1; in erofs_find_target_block() local
97 while (head <= back) { in erofs_find_target_block()
98 const int mid = head + (back - head) / 2; in erofs_find_target_block()
135 back = mid - 1; in erofs_find_target_block()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/translit/
H A DAnyScriptTest.java118 String back; in TestForWidth()
119 back = narrow.transform(wideLettersAndSpace); in TestForWidth()
120 assertEquals("Should be narrow", lettersAndSpace, back); in TestForWidth()
121 back = narrow.transform(widePunctOnly); in TestForWidth()
122 assertEquals("Should be narrow", punctOnly, back); in TestForWidth()
125 back = latin.transform(wideLettersAndSpace); in TestForWidth()
126 assertEquals("Should be ascii", lettersAndSpace, back); in TestForWidth()
128 back = latin.transform(widePunctOnly); in TestForWidth()
129 assertEquals("Should be ascii", punctOnly, back); in TestForWidth()
133 //back in TestForWidth()
[all...]
/third_party/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/translit/
H A DAnyScriptTest.java115 String back; in TestForWidth()
116 back = narrow.transform(wideLettersAndSpace); in TestForWidth()
117 assertEquals("Should be narrow", lettersAndSpace, back); in TestForWidth()
118 back = narrow.transform(widePunctOnly); in TestForWidth()
119 assertEquals("Should be narrow", punctOnly, back); in TestForWidth()
122 back = latin.transform(wideLettersAndSpace); in TestForWidth()
123 assertEquals("Should be ascii", lettersAndSpace, back); in TestForWidth()
125 back = latin.transform(widePunctOnly); in TestForWidth()
126 assertEquals("Should be ascii", punctOnly, back); in TestForWidth()
130 //back in TestForWidth()
[all...]
/third_party/skia/experimental/sorttoy/
H A DFake.h94 sk_sp<FakeMCBlob> tmp = fStack.back().getCached(); in snapState()
100 fStack.back().setCached(tmp); in snapState()
109 fStack.back().addClip(std::move(clipCmd)); in clip()
114 fStack.back().translate(trans); in translate()
119 fStack.back().aboutToBePopped(paintersOrderWhenPopped); in pop()
136 // The transparent objects need to be draw back to front.
249 fDeviceStack.back()->save(); in save()
259 fDeviceStack.back()->translate(trans); in translate()
264 fDeviceStack.back()->restore(this->peekPaintersOrder()); in restore()
271 return fDeviceStack.back() in snapState()
[all...]
/third_party/mesa3d/src/loader/
H A Dloader_dri3_helper.c673 * Find an idle back buffer. If there isn't one, then
687 /* Check whether we need to reuse the current back buffer as new back. in dri3_find_back()
704 * Unigine Superposition hits this and this allows to use 2 back buffers in dri3_find_back()
813 struct loader_dri3_buffer *back; in loader_dri3_copy_sub_buffer() local
824 back = dri3_find_back_alloc(draw); in loader_dri3_copy_sub_buffer()
825 if (!back) in loader_dri3_copy_sub_buffer()
831 /* Update the linear buffer part of the back buffer in loader_dri3_copy_sub_buffer()
835 back->linear_buffer, in loader_dri3_copy_sub_buffer()
836 back in loader_dri3_copy_sub_buffer()
976 struct loader_dri3_buffer *back; loader_dri3_swap_buffers_msc() local
1211 struct loader_dri3_buffer *back = dri3_find_back_alloc(draw); loader_dri3_query_buffer_age() local
2197 struct loader_dri3_buffer *front, *back; loader_dri3_get_buffers() local
2355 struct loader_dri3_buffer *back; dri3_find_back_alloc() local
[all...]
/third_party/libunwind/libunwind/doc/
H A Dunw_create_addr_space.tex20 address-space and initializes it based on the call-back routines
22 The call-back routines are described in detail below. The
31 \section{Call-back Routines}
33 \Prog{Libunwind} uses a set of call-back routines to access the
41 The first argument to every call-back routine is an address-space
44 call-back routine, \Prog{libunwind} sets the \Var{as} argument to the
49 The synopsis and a detailed description of every call-back routine
52 \subsection{Call-back Routine Synopsis}
79 \Prog{Libunwind} invokes the \Func{find\_proc\_info}() call-back to
86 \Var{need\_unwind\_info} is zero if the call-back doe
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DPriorityWorklist.h84 const T &back() const { in back() function in llvm::PriorityWorklist
85 assert(!empty() && "Cannot call back() on empty PriorityWorklist!"); in back()
86 return V.back(); in back()
103 // If the element isn't at the back, null it out and append a fresh one. in insert()
147 assert(back() != T() && "Cannot have a null element at the back!"); in pop_back()
148 M.erase(back()); in pop_back()
151 } while (!V.empty() && V.back() == T()); in pop_back()
155 T Ret = back(); in pop_back_val()
172 } while (!V.empty() && V.back() in erase()
[all...]
/third_party/skia/modules/skottie/src/animator/
H A DKeyframeAnimator.cpp25 if (t >= fKFs.back().t) { in getLERPInfo()
27 return { 0, fKFs.back().v, fKFs.back().v }; in getLERPInfo()
51 SkASSERT(t < fKFs.back().t); in find_segment()
54 kf1 = &fKFs.back(); in find_segment()
161 auto& prev_kf = fKFs.back(); in parseKeyframes()
190 this, fKFs.back().v_idx + 1, fKFs.size()); in parseKeyframes()
/kernel/linux/linux-5.10/lib/lz4/
H A Dlz4hc_compress.c208 int back = 0; in LZ4HC_InsertAndGetWiderMatch() local
210 while ((ip + back > iLowLimit) in LZ4HC_InsertAndGetWiderMatch()
211 && (matchPtr + back > lowPrefixPtr) in LZ4HC_InsertAndGetWiderMatch()
212 && (ip[back - 1] == matchPtr[back - 1])) in LZ4HC_InsertAndGetWiderMatch()
213 back--; in LZ4HC_InsertAndGetWiderMatch()
215 mlt -= back; in LZ4HC_InsertAndGetWiderMatch()
219 *matchpos = matchPtr + back; in LZ4HC_InsertAndGetWiderMatch()
220 *startpos = ip + back; in LZ4HC_InsertAndGetWiderMatch()
229 int back in LZ4HC_InsertAndGetWiderMatch() local
[all...]
/kernel/linux/linux-6.6/lib/lz4/
H A Dlz4hc_compress.c208 int back = 0; in LZ4HC_InsertAndGetWiderMatch() local
210 while ((ip + back > iLowLimit) in LZ4HC_InsertAndGetWiderMatch()
211 && (matchPtr + back > lowPrefixPtr) in LZ4HC_InsertAndGetWiderMatch()
212 && (ip[back - 1] == matchPtr[back - 1])) in LZ4HC_InsertAndGetWiderMatch()
213 back--; in LZ4HC_InsertAndGetWiderMatch()
215 mlt -= back; in LZ4HC_InsertAndGetWiderMatch()
219 *matchpos = matchPtr + back; in LZ4HC_InsertAndGetWiderMatch()
220 *startpos = ip + back; in LZ4HC_InsertAndGetWiderMatch()
229 int back in LZ4HC_InsertAndGetWiderMatch() local
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/hisilicon/hns3/hns3pf/
H A Dhclge_mbx.c36 struct hclge_dev *hdev = vport->back; in hclge_gen_resp_to_vf()
95 struct hclge_dev *hdev = vport->back; in hclge_send_mbx_msg()
142 struct hclge_dev *hdev = vport->back; in hclge_inform_reset_assert_to_vf()
186 struct hclge_dev *hdev = vport->back; in hclge_get_ring_chain_from_mbx()
265 struct hclge_dev *hdev = vport->back; in hclge_query_ring_vector_map()
338 struct hclge_dev *hdev = vport->back; in hclge_set_vf_promisc_mode()
360 struct hclge_dev *hdev = vport->back; in hclge_set_vf_uc_mac_addr()
402 struct hclge_dev *hdev = vport->back; in hclge_set_vf_mc_mac_addr()
443 struct hclge_dev *hdev = vport->back; in hclge_set_vf_vlan_cfg()
494 struct hnae3_ae_dev *ae_dev = vport->back in hclge_get_basic_info()
[all...]
/third_party/skia/experimental/graphite/src/
H A DGpu.cpp58 OutstandingSubmission* back = (OutstandingSubmission*)fOutstandingSubmissions.back(); in checkForFinishedWork() local
59 if (back) { in checkForFinishedWork()
60 (*back)->waitUntilFinished(this); in checkForFinishedWork()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_lower_two_sided_color.c38 nir_variable *back; /* BFCn */ member
47 * instruction used to select front or back color based on FACE.
112 /* add required back-face color inputs: */ in setup_inputs()
121 state->colors[i].back = create_input( in setup_inputs()
183 nir_ssa_def *front, *back; in nir_lower_two_sided_color_block() local
186 back = nir_load_var(b, state->colors[idx].back); in nir_lower_two_sided_color_block()
189 back = load_input(b, state->colors[idx].back); in nir_lower_two_sided_color_block()
191 nir_ssa_def *color = nir_bcsel(b, face, front, back); in nir_lower_two_sided_color_block()
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dstruct_cfg_analysis.cpp67 if (block->id() == state.back().merge_node) { in AddBlocksInFunction()
73 if (block->id() == state.back().continue_node) { in AddBlocksInFunction()
74 state.back().cinfo.in_continue = true; in AddBlocksInFunction()
77 bb_to_construct_.emplace(std::make_pair(block->id(), state.back().cinfo)); in AddBlocksInFunction()
97 new_state.cinfo.containing_loop = state.back().cinfo.containing_loop; in AddBlocksInFunction()
98 new_state.cinfo.in_continue = state.back().cinfo.in_continue; in AddBlocksInFunction()
99 new_state.continue_node = state.back().continue_node; in AddBlocksInFunction()
105 state.back().cinfo.containing_switch; in AddBlocksInFunction()

Completed in 17 milliseconds

12345678910>>...91