Home
last modified time | relevance | path

Searched refs:begin (Results 1 – 25 of 2430) sorted by relevance

12345678910>>...98

/freebsd/contrib/dialog/samples/
H A Dwheel27 --begin "`scaley 27`" "`scalex 98`" --infobox "pushd /var/log >/dev/null" 0 0 --and-widget \
28 --begin "`scaley 35`" "`scalex 95`" --infobox "mkdir -p news -m 755" 0 0 --and-widget \
29 --begin "`scaley 45`" "`scalex 86`" --infobox "chown news.news news" 0 0 --and-widget \
30 --begin "`scaley 48`" "`scalex 78`" --infobox "cd /var/log/news" 0 0 --and-widget \
31 --begin "`scaley 51`" "`scalex 61`" --infobox "mkdir -p OLD -m 755" 0 0 --and-widget \
32 --begin "`scaley 52`" "`scalex 47`" --infobox "chown news.news OLD" 0 0 --and-widget \
33 --begin "`scaley 51`" "`scalex 40`" --infobox "cd /var/spool" 0 0 --and-widget \
34 --begin "`scaley 48`" "`scalex 25`" --infobox "mkdir -p news -m 775" 0 0 --and-widget \
35 --begin "`scaley 42`" "`scalex 13`" --infobox "chown news.news news" 0 0 --and-widget \
36 --begin "`scaley 35`" "`scalex 4`" --infobox "cd /var/spool/news" 0 0 --and-widget \
[all …]
/freebsd/contrib/processor-trace/libipt/src/
H A Dpt_event_queue.c69 uint8_t begin, end, gap, idx; in pt_evq_enqueue() local
77 begin = evq->begin[evb]; in pt_evq_enqueue()
80 if (evq_max <= begin) in pt_evq_enqueue()
90 if (begin == gap) in pt_evq_enqueue()
101 uint8_t begin, end; in pt_evq_dequeue() local
109 begin = evq->begin[evb]; in pt_evq_dequeue()
112 if (evq_max <= begin) in pt_evq_dequeue()
118 if (begin == end) in pt_evq_dequeue()
121 evq->begin[evb] = pt_evq_inc(begin); in pt_evq_dequeue()
123 return &evq->queue[evb][begin]; in pt_evq_dequeue()
[all …]
H A Dpt_sync.c70 const uint8_t *begin, *end; in pt_find_psb() local
76 begin = config->begin; in pt_find_psb()
106 if (pos < begin) in pt_find_psb()
120 static int pt_sync_within_bounds(const uint8_t *pos, const uint8_t *begin, in pt_sync_within_bounds() argument
127 return (begin <= pos) && (pos <= end); in pt_sync_within_bounds()
133 const uint8_t *begin, *end; in pt_sync_set() local
139 begin = config->begin; in pt_sync_set()
142 if (!pt_sync_within_bounds(pos, begin, end)) in pt_sync_set()
164 const uint8_t *begin, *end, *start; in pt_sync_forward() local
170 begin = config->begin; in pt_sync_forward()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_leb128.h18 It EncodeSLEB128(T value, It begin, It end) { in EncodeSLEB128() argument
28 if (UNLIKELY(begin == end)) in EncodeSLEB128()
30 *(begin++) = byte; in EncodeSLEB128()
32 return begin; in EncodeSLEB128()
36 It DecodeSLEB128(It begin, It end, T* v) { in DecodeSLEB128() argument
41 if (UNLIKELY(begin == end)) in DecodeSLEB128()
42 return begin; in DecodeSLEB128()
43 byte = *(begin++); in DecodeSLEB128()
51 return begin; in DecodeSLEB128()
55 It EncodeULEB128(T value, It begin, It end) { in EncodeULEB128() argument
[all …]
H A Dsanitizer_lzw.h23 ItOut LzwEncode(ItIn begin, ItIn end, ItOut out) { in LzwEncode() argument
36 for (auto it = begin; it != end; ++it) in LzwEncode()
57 if (begin == end) in LzwEncode()
61 LzwCodeType match = prefix_to_code.find({kNoPrefix, *begin})->second; in LzwEncode()
62 ++begin; in LzwEncode()
63 for (auto it = begin; it != end; ++it) { in LzwEncode()
86 ItOut LzwDecode(ItIn begin, ItIn end, ItOut out) { in LzwDecode() argument
87 if (begin == end) in LzwDecode()
91 InternalMmapVector<T> dict_len1(*begin); in LzwDecode()
92 ++begin; in LzwDecode()
[all …]
/freebsd/contrib/byacc/test/
H A Dgrammar.y135 long begin; /* offset in temporary file */ member
152 long begin; /* offset in temporary file */ member
168 long begin; /* offset in temporary file */ member
535 new_decl_spec(&decl_spec, dft_decl_spec(), $1->begin, DS_NONE);
577 new_decl_spec(&$$, $1.text, $1.begin, DS_NONE);
581 new_decl_spec(&$$, $1.text, $1.begin, DS_EXTERN);
585 new_decl_spec(&$$, $1.text, $1.begin, DS_NONE);
589 new_decl_spec(&$$, $1.text, $1.begin, DS_STATIC);
593 new_decl_spec(&$$, $1.text, $1.begin, DS_INLINE);
597 new_decl_spec(&$$, $1.text, $1.begin, DS_JUNK);
[all …]
/freebsd/contrib/llvm-project/lld/COFF/
H A DICF.cpp42 void segregate(size_t begin, size_t end, bool constant);
51 size_t findBoundary(size_t begin, size_t end);
53 void forEachClassRange(size_t begin, size_t end,
104 void ICF::segregate(size_t begin, size_t end, bool constant) { in segregate() argument
105 while (begin < end) { in segregate()
109 chunks.begin() + begin + 1, chunks.begin() + end, [&](SectionChunk *s) { in segregate()
111 return equalsConstant(chunks[begin], s); in segregate()
112 return equalsVariable(chunks[begin], s); in segregate()
114 size_t mid = bound - chunks.begin(); in segregate()
118 for (size_t i = begin; i < mid; ++i) in segregate()
[all …]
/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DSwiftCallingConv.cpp64 void SwiftAggLowering::addTypedData(QualType type, CharUnits begin) { in addTypedData() argument
69 addTypedData(recType->getDecl(), begin); in addTypedData()
81 addTypedData(eltType, begin + i * eltSize); in addTypedData()
89 addTypedData(eltLLVMType, begin, begin + eltSize); in addTypedData()
90 addTypedData(eltLLVMType, begin + eltSize, begin + 2 * eltSize); in addTypedData()
95 addOpaqueData(begin, begin + CGM.getContext().getTypeSizeInChars(type)); in addTypedData()
103 addTypedData(atomicType->getValueType(), begin); in addTypedData()
108 addOpaqueData(begin + valueSize, begin + atomicSize); in addTypedData()
115 addTypedData(llvmType, begin); in addTypedData()
119 void SwiftAggLowering::addTypedData(const RecordDecl *record, CharUnits begin) { in addTypedData() argument
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/tests/unit/
H A Dinterval_set_test.cpp23 EXPECT_TRUE(S.begin() == S.end()); in TEST()
34 EXPECT_EQ(std::next(S.begin()), S.end()); in TEST()
35 EXPECT_EQ(S.find(7), S.begin()); in TEST()
47 EXPECT_EQ(std::next(S.begin()), S.end()); // Should see just one range. in TEST()
59 EXPECT_EQ(std::next(S.begin()), S.end()); // Should see just one range. in TEST()
77 EXPECT_EQ(std::next(S.begin()), S.end()); // Should see just one range. in TEST()
90 EXPECT_EQ(std::next(S.begin()), S.end()); in TEST()
91 EXPECT_EQ(S.begin()->first, 7U); in TEST()
92 EXPECT_EQ(S.begin()->second, 9U); in TEST()
103 EXPECT_EQ(std::next(S.begin()), S.end()); in TEST()
[all …]
H A Dinterval_map_test.cpp23 EXPECT_TRUE(M.begin() == M.end()); in TEST()
34 EXPECT_EQ(std::next(M.begin()), M.end()); in TEST()
35 EXPECT_EQ(M.find(7), M.begin()); in TEST()
52 EXPECT_EQ(std::next(M1.begin()), M1.end()); // Should see just one range. in TEST()
64 EXPECT_EQ(std::next(std::next(M2.begin())), M2.end()); // Expect two ranges. in TEST()
81 EXPECT_EQ(std::next(M1.begin()), M1.end()); // Should see just one range. in TEST()
93 EXPECT_EQ(std::next(std::next(M2.begin())), M2.end()); // Expect two ranges. in TEST()
116 EXPECT_EQ(std::next(M1.begin()), M1.end()); // Should see just one range. in TEST()
131 EXPECT_EQ(std::next(std::next(std::next(M2.begin()))), M2.end()); in TEST()
157 EXPECT_EQ(std::next(M.begin()), M.end()); in TEST()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Daccess.h23 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Tp* begin(_Tp (&__array)[_Np]) _NOEXCEPT { in begin() function
35 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 auto begin(_Cp& __c) -> decltype(__c.begin()) {
36 return __c.begin();
40 …IBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 auto begin(const _Cp& __c) -> decltype(__c.begin…
41 return __c.begin();
58 cbegin(const _Cp& __c) noexcept(noexcept(std::begin(__c))) -> decltype(std::begin(__c)) {
59 return std::begin(__c);
72 _LIBCPP_HIDE_FROM_ABI typename _Cp::iterator begin(_Cp& __c) { in begin() function
73 return __c.begin(); in begin()
77 _LIBCPP_HIDE_FROM_ABI typename _Cp::const_iterator begin(const _Cp& __c) { in begin() function
[all …]
/freebsd/contrib/processor-trace/libipt/test/src/
H A Dptunit-sync.c56 sfix->config.begin = sfix->buffer; in sfix_init()
81 errcode = pt_sync_forward(NULL, sfix->config.begin, &sfix->config); in sync_fwd_null()
87 errcode = pt_sync_forward(&sync, sfix->config.begin, NULL); in sync_fwd_null()
98 errcode = pt_sync_backward(NULL, sfix->config.begin, &sfix->config); in sync_bwd_null()
104 errcode = pt_sync_backward(&sync, sfix->config.begin, NULL); in sync_bwd_null()
115 sfix->config.end = sfix->config.begin; in sync_fwd_empty()
117 errcode = pt_sync_forward(&sync, sfix->config.begin, &sfix->config); in sync_fwd_empty()
128 sfix->config.end = sfix->config.begin; in sync_bwd_empty()
141 errcode = pt_sync_forward(&sync, sfix->config.begin, &sfix->config); in sync_fwd_none()
163 sfix_encode_psb(sfix->config.begin); in sync_fwd_here()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/lsan/
H A Dlsan_common_fuchsia.cpp82 uptr begin = reinterpret_cast<uptr>(chunk); in LockStuffAndStopTheWorld() local
83 uptr end = begin + size; in LockStuffAndStopTheWorld()
84 ScanGlobalRange(begin, end, &params->argument->frontier); in LockStuffAndStopTheWorld()
90 uptr begin = reinterpret_cast<uptr>(chunk); in LockStuffAndStopTheWorld() local
91 uptr end = begin + size; in LockStuffAndStopTheWorld()
92 ScanRangeForPointers(begin, end, &params->argument->frontier, "STACK", in LockStuffAndStopTheWorld()
99 uptr begin = reinterpret_cast<uptr>(chunk); in LockStuffAndStopTheWorld() local
100 uptr end = begin + size; in LockStuffAndStopTheWorld()
101 ScanRangeForPointers(begin, end, &params->argument->frontier, "REGISTERS", in LockStuffAndStopTheWorld()
117 uptr begin in LockStuffAndStopTheWorld() local
[all...]
/freebsd/contrib/llvm-project/libc/src/__support/
H A Dfixedvector.h30 LIBC_INLINE constexpr FixedVector(iterator begin, iterator end) in FixedVector() argument
32 LIBC_ASSERT(begin + CAPACITY >= end);
33 for (; begin != end; ++begin)
34 push_back(*begin);
38 LIBC_INLINE constexpr FixedVector(const_iterator begin, const_iterator end) in FixedVector() argument
40 LIBC_ASSERT(begin + CAPACITY >= end);
41 for (; begin != end; ++begin)
42 push_back(*begin);
116 LIBC_INLINE constexpr iterator begin() { return store.begin(); } in begin() function
119 LIBC_INLINE constexpr const_iterator begin() const { return store.begin(); } in begin() function
/freebsd/contrib/llvm-project/lld/MachO/
H A DICF.cpp38 void segregate(size_t begin, size_t end, EqualsFn);
39 size_t findBoundary(size_t begin, size_t end);
40 void forEachClassRange(size_t begin, size_t end,
48 void applySafeThunksToRange(size_t begin, size_t end);
61 icfInputs.assign(inputs.begin(), inputs.end()); in ICF()
182 return std::equal(ia->relocs.begin(), ia->relocs.end(), ib->relocs.begin(), in equalsConstant()
220 if (!std::equal(ia->relocs.begin(), ia->relocs.end(), ib->relocs.begin(), f)) in equalsVariable()
248 size_t ICF::findBoundary(size_t begin, size_t end) { in findBoundary() argument
249 uint64_t beginHash = icfInputs[begin]->icfEqClass[icfPass % 2]; in findBoundary()
250 for (size_t i = begin + 1; i < end; ++i) in findBoundary()
[all …]
/freebsd/contrib/llvm-project/lldb/include/lldb/Utility/
H A DRangeMap.h153 auto pos1 = vec1.begin(); in GetOverlaps()
155 auto pos2 = vec2.begin(); in GetOverlaps()
190 auto begin = m_entries.begin(); in Insert() local
192 auto pos = std::lower_bound(begin, end, entry); in Insert()
198 if (pos != begin) { in Insert()
211 m_entries.erase(m_entries.begin() + idx); in RemoveEntryAtIndex()
227 for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end; in IsSorted()
241 m_entries.begin(), m_entries.end(), [](const Entry &a, const Entry &b) { in CombineConsecutiveRanges()
250 Collection minimal_ranges(m_entries.begin(), pos); in CombineConsecutiveRanges()
285 for (pos = m_entries.begin(), end = m_entries.end(); pos != end; ++pos) in Slide()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DTinyPtrVector.h116 : IL.size() == 1 ? PtrUnion(*IL.begin()) in TinyPtrVector()
117 : PtrUnion(new VecTy(IL.begin(), IL.end()))) {} in TinyPtrVector()
128 : PtrUnion(new VecTy(Elts.begin(), Elts.end()))) {} in TinyPtrVector()
154 iterator begin() { in begin() function
158 return cast<VecTy *>(Val)->begin(); in begin()
163 return begin() + (Val.isNull() ? 0 : 1); in end()
168 const_iterator begin() const { in begin() function
169 return (const_iterator)const_cast<TinyPtrVector*>(this)->begin(); in begin()
177 reverse_iterator rend() { return reverse_iterator(begin()); } in rend()
184 return const_reverse_iterator(begin()); in rend()
[all …]
H A DSmallVector.h161 return isReferenceToRange(V, this->begin(), this->end()); in isReferenceToStorage()
169 return !LessThan(First, this->begin()) && !LessThan(Last, First) && in isRangeInStorage()
182 return Elt < this->begin() + NewSize; in isSafeToReferenceAfterResize()
241 Index = &Elt - This->begin(); in reserveForParamAndGetAddressImpl()
245 return ReferencesStorage ? This->begin() + Index : &Elt; in reserveForParamAndGetAddressImpl()
268 iterator begin() { return (iterator)this->BeginX; } in begin() function
269 const_iterator begin() const { return (const_iterator)this->BeginX; } in begin() function
270 iterator end() { return begin() + size(); } in end()
271 const_iterator end() const { return begin() + size(); } in end()
276 reverse_iterator rend() { return reverse_iterator(begin()); } in rend()
[all …]
/freebsd/contrib/llvm-project/lld/ELF/
H A DICF.cpp103 void segregate(size_t begin, size_t end, uint32_t eqClassBase, bool constant);
116 size_t findBoundary(size_t begin, size_t end);
118 void forEachClassRange(size_t begin, size_t end,
199 void ICF<ELFT>::segregate(size_t begin, size_t end, uint32_t eqClassBase, in segregate() argument
209 while (begin < end) { in segregate()
213 std::stable_partition(sections.begin() + begin + 1, in segregate()
214 sections.begin() + end, [&](InputSection *s) { in segregate()
216 return equalsConstant(sections[begin], s); in segregate()
217 return equalsVariable(sections[begin], s); in segregate()
219 size_t mid = bound - sections.begin(); in segregate()
[all …]
/freebsd/contrib/kyua/utils/format/
H A Dformatter.cpp67 std::string::size_type begin) in find_next_placeholder() argument
69 begin = expansion.find('%', begin); in find_next_placeholder()
70 while (begin != std::string::npos && expansion[begin + 1] == '%') in find_next_placeholder()
71 begin = expansion.find('%', begin + 2); in find_next_placeholder()
72 if (begin == std::string::npos) in find_next_placeholder()
74 if (begin == expansion.length() - 1) in find_next_placeholder()
77 std::string::size_type end = begin + 1; in find_next_placeholder()
80 const std::string placeholder = expansion.substr(begin, end - begin + 1); in find_next_placeholder()
85 return std::make_pair(begin, placeholder); in find_next_placeholder()
161 strip_double_percent(const std::string& in, const std::string::size_type begin, in strip_double_percent() argument
[all …]
/freebsd/usr.sbin/newsyslog/tests/
H A Dlegacy_test.sh20 begin() function
228 begin "create file ${name_postfix}" -newdir
234 begin "rotate normal 1 ${name_postfix}"
241 begin "rotate normal 2 ${name_postfix}"
249 begin "rotate normal 3 ${name_postfix}"
258 begin "rotate normal 4 ${name_postfix}"
267 begin "rotate normal 5 ${name_postfix}"
279 begin "noaction ${name_postfix}"
306 begin "create file ${name_postfix}" -newdir
312 begin "rotate normal 1 cnt=$cnt ${name_postfix}"
[all …]
/freebsd/contrib/bearssl/test/
H A Dtest_speed.c51 clock_t begin, end; \
56 begin = clock(); \
62 tt = (double)(end - begin) / CLOCKS_PER_SEC; \
103 clock_t begin, end; \
108 begin = clock(); \
113 tt = (double)(end - begin) / CLOCKS_PER_SEC; \
152 clock_t begin, end; \
157 begin = clock(); \
162 tt = (double)(end - begin) / CLOCKS_PER_SEC; \
199 clock_t begin, end; \
[all …]
/freebsd/contrib/llvm-project/lldb/source/Symbol/
H A DVariableList.cpp39 std::copy(variable_list->m_variables.begin(), // source begin in AddVariables()
58 m_variables.erase(m_variables.begin() + idx); in RemoveVariableAtIndex()
65 for (pos = m_variables.begin(); pos != end; ++pos) { in FindVariableIndex()
67 return std::distance(m_variables.begin(), pos); in FindVariableIndex()
76 for (pos = m_variables.begin(); pos != end; ++pos) { in FindVariable()
92 for (pos = m_variables.begin(); pos != end; ++pos) { in FindVariable()
106 for (pos = m_variables.begin(); pos != end; ++pos) in AppendVariablesIfUnique()
116 for (pos = m_variables.begin(); pos != end; ++pos) { in AppendVariablesIfUnique()
133 for (pos = m_variables.begin(); pos != end; ++pos) { in AppendVariablesWithScope()
148 const iterator begin = m_variables.begin(); in FindIndexForVariable() local
[all …]
/freebsd/contrib/llvm-project/lldb/source/DataFormatters/
H A DTypeCategoryMap.cpp83 ActiveCategoriesList::iterator iter = m_active_categories.begin(); in Enable()
109 MapType::iterator iter = m_map.begin(), end = m_map.end(); in EnableAllCategories()
119 pos = std::distance(sorted_categories.begin(), iter); in EnableAllCategories()
123 decltype(sorted_categories)::iterator viter = sorted_categories.begin(), in EnableAllCategories()
169 for (pos = m_map.begin(); pos != end; pos++) { in AnyMatches()
181 ActiveCategoriesIterator begin, end = m_active_categories.end(); in Get() local
197 for (begin = m_active_categories.begin(); begin != end; begin++) { in Get()
198 lldb::TypeCategoryImplSP category_sp = *begin; in Get()
231 ActiveCategoriesIterator begin, end = m_active_categories.end(); in ForEach() local
232 for (begin = m_active_categories.begin(); begin != end; begin++) { in ForEach()
[all …]
/freebsd/usr.bin/jot/
H A Djot.c92 double begin = BEGIN_DEF; in main() local
171 if (!sscanf(argv[1], "%lf", &begin)) in main()
172 begin = argv[1][strlen(argv[1])-1]; in main()
209 s = ender > begin ? 1 : -1; in main()
218 reps = (ender - begin + s) / s; in main()
225 begin = BEGIN_DEF; in main()
234 begin = BEGIN_DEF; in main()
237 begin = ender - reps * s + s; in main()
248 ender = begin + reps * s - s; in main()
259 s = (ender - begin) / (reps - 1); in main()
[all …]

12345678910>>...98