Searched refs:end (Results 51 - 75 of 643) sorted by relevance

1234567891011>>

/haiku/src/kits/app/
H A DTokenSpace.cpp89 if (iterator == fTokenMap.end())
106 if (iterator != fTokenMap.end() && iterator->second.type == type)
122 if (iterator == fTokenMap.end() || iterator->second.type != type)
139 if (iterator == fTokenMap.end() || iterator->second.type != B_HANDLER_TOKEN)
162 if (iterator == fTokenMap.end() || iterator->second.type != B_HANDLER_TOKEN)
/haiku/src/apps/patchbay/
H A DPatchView.cpp94 endpoint_itor begin, end; local
100 end = fConsumers.end();
110 end = fProducers.end();
120 for (itor = begin; itor != end; itor++, index--)
124 if (itor == end)
153 i != fProducers.end(); i++) {
161 i != fConsumers.end(); i++) {
367 i != fConsumers.end();
[all...]
/haiku/src/add-ons/kernel/debugger/hangman/
H A Dhangman.c120 size_t sz, got, beg, end, i; local
152 for (end = beg; end < got && isalpha(bigbuffer[end]); end++);
153 if (end < got && !isalpha(bigbuffer[end]) && beg + MIN_LETTERS < end) {
156 for (i = beg; i < end; i++)
158 strncpy(&(words[current][0]), &(bigbuffer[beg]), end
176 size_t sz, got, beg, end, i; local
[all...]
/haiku/headers/cpp/
H A Dstl_queue.h135 { make_heap(c.begin(), c.end(), comp); }
140 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
146 { make_heap(c.begin(), c.end(), comp); }
153 c.insert(c.end(), __first, __last);
154 make_heap(c.begin(), c.end(), comp);
159 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
164 { make_heap(c.begin(), c.end(), comp); }
170 c.insert(c.end(), __first, __last);
171 make_heap(c.begin(), c.end(), comp);
181 push_heap(c.begin(), c.end(), com
[all...]
H A Dstl_bvector.h431 _M_finish = copy(__position, end(), __i);
476 copy_backward(__position, end(), _M_finish + difference_type(__n));
485 _M_finish = copy(__position, end(), __i);
498 iterator end() { return _M_finish; } function in class:vector
499 const_iterator end() const { return _M_finish; } function in class:vector
501 reverse_iterator rbegin() { return reverse_iterator(end()); }
503 return const_reverse_iterator(end());
510 size_type size() const { return size_type(end() - begin()); }
515 bool empty() const { return begin() == end(); }
543 copy(__x.begin(), __x.end(), _M_star
[all...]
/haiku/src/apps/cortex/TipManager/
H A DTipManagerImpl.cpp71 it != m_childViews.end(); ++it) {
75 it != m_tips.end(); ++it) {
109 itView != parentOrder.end(); itView++) {
115 viewEntry->m_childViews.end(),
119 if(itEntry == viewEntry->m_childViews.end()) {
137 if(itFound != viewEntry->m_tips.end()) {
175 itView != parentOrder.end(); itView++) {
181 viewEntry->m_childViews.end(),
185 if(itEntry == viewEntry->m_childViews.end())
212 it != viewEntry->m_tips.end();
[all...]
/haiku/src/apps/mail/
H A DPeople.cpp58 int end = groupString.FindFirst(',', first); local
59 if (end < 0)
60 end = groupString.Length();
63 groupString.CopyInto(group, first, end - first);
67 first = end + 1;
138 if (found != fPersonMap.end()) {
179 if (found != fGroupMap.end())
/haiku/src/system/boot/loader/
H A Dkernel_args.cpp71 uint64 end = start + size; local
77 if (end < rangeStart || start > rangeEnd) {
81 if (start >= rangeStart && end <= rangeEnd) {
91 if (end > ranges[i].start + ranges[i].size) {
93 ranges[i].size = end - ranges[i].start;
147 uint64 end = ROUNDUP(start + size, B_PAGE_SIZE); local
155 if (end <= rangeStart) {
157 } else if (end >= rangeEnd) {
163 ranges[i].start = end;
164 ranges[i].size = rangeEnd - end;
191 uint64 end = base + size - 1; local
[all...]
/haiku/src/kits/package/
H A DPackageInfoStringBuilder.h256 const char* end = data; local
257 while (*end != '\0') {
259 switch (*end) {
268 replacement[1] = *end;
271 end++;
275 if (start < end)
276 _Write(start, end - start);
280 start = ++end;
283 if (start < end)
284 _Write(start, end
[all...]
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DAttribute.cpp210 const uint8* end = start + fVolume->InodeSize(); local
214 if ((off_t)(pos + length) > (end - start) || length > fBodyEntry->ValueSize())
261 const uint8* end = start + fVolume->InodeSize(); local
264 + fInode->Node().ExtraInodeSize(), end, name, index, &count,
289 Attribute::_FindAttributeBody(const uint8* start, const uint8* end, argument
292 TRACE("_FindAttributeBody %p %p %s\n", start, end, name);
295 return _FindAttribute(start + sizeof(uint32), end, name, index, count,
301 Attribute::_FindAttributeBlock(const uint8* start, const uint8* end, const char* name, argument
304 TRACE("_FindAttributeBlock %p %p %s\n", start, end, name);
309 return _FindAttribute(start + sizeof(ext2_xattr_header), end, nam
315 _FindAttribute(const uint8* start, const uint8* end, const char* name, int32 index, int32 *count, ext2_xattr_entry** _entry) argument
[all...]
H A DAttribute.h52 status_t _FindAttributeBody(const uint8* start, const uint8* end,
55 status_t _FindAttributeBlock(const uint8* start, const uint8* end,
58 status_t _FindAttribute(const uint8* start, const uint8* end,
/haiku/src/system/kernel/arch/x86/paging/64bit/
H A DX86VMTranslationMap64Bit.cpp172 X86VMTranslationMap64Bit::MaxPagesNeededToMap(addr_t start, addr_t end) const
179 end += start;
184 requiredPML4s = end / k64BitPML4TRange + 1
187 size_t requiredPDPTs = end / k64BitPDPTRange + 1
189 size_t requiredPageDirs = end / k64BitPageDirectoryRange + 1
191 size_t requiredPageTables = end / k64BitPageTableRange + 1
234 X86VMTranslationMap64Bit::Unmap(addr_t start, addr_t end) argument
237 if (start >= end)
241 ")\n", start, end);
256 index < k64BitTableEntryCount && start < end;
283 DebugMarkRangePresent(addr_t start, addr_t end, bool markPresent) argument
402 addr_t end = base + size - 1; local
668 Protect(addr_t start, addr_t end, uint32 attributes, uint32 memoryType) argument
[all...]
/haiku/src/system/libroot/posix/glibc/arch/sparc/
H A Dadd_n.S37 add %o1,%g1,%o1 ! make s1_ptr point at end
38 add %o2,%g1,%o2 ! make s2_ptr point at end
39 add %o0,%g1,%o0 ! make res_ptr point at end
H A Dsub_n.S34 add %o1,%g1,%o1 ! make s1_ptr point at end
35 add %o2,%g1,%o2 ! make s2_ptr point at end
36 add %o0,%g1,%o0 ! make res_ptr point at end
/haiku/src/libs/gnu/
H A Dqsort.c25 char* end = itemA + sizeOfElement; local
26 for (; itemA < end; itemA++, itemB++)
72 char* end = base + (numElements * sizeOfElement); local
79 for (pivIndexA = base + sizeOfElement; pivIndexA < end;
121 // v- end (beyond the array)
193 end - lastPivEqualsPos);
197 sort_r_simple(end - (lastPivEqualsPos - lastPivCmpItem),
/haiku/src/apps/haikudepot/packagemodel/
H A DDepotInfo.cpp122 fPackages.end(),
135 fPackages.end(),
138 if (it != fPackages.end()) {
153 fPackages.end(),
157 if (it != fPackages.end()) {
200 for (it = fPackages.begin(); it != fPackages.end(); it++) {
/haiku/src/apps/debuganalyzer/model/
H A DThreadModel.cpp56 int32 end)
59 int32 count = end - start;
60 if (start < 0 || count <= 0 || waitObjects.CountItems() < end)
54 AddWaitObjectGroup( const BObjectList<Model::ThreadWaitObject>& waitObjects, int32 start, int32 end) argument
/haiku/src/bin/rc/
H A Drdef.cpp45 for (ptr_iter_t i = list.begin(); i != list.end(); ++i) {
91 for (ptr_iter_t i = include_dirs.begin(); i != include_dirs.end(); ++i) {
164 for (ptr_iter_t i = include_dirs.begin(); i != include_dirs.end(); ++i) {
/haiku/src/tests/system/libroot/posix/
H A Dseek_and_write_test.cpp40 test_for_zero(int fd, off_t start, off_t end) argument
42 while (start < end) {
44 size_t length = std::min((size_t)(end - start), sizeof(buffer));
110 // Seek past its end, and write something
/haiku/src/system/kernel/arch/x86/paging/pae/
H A DX86VMTranslationMapPAE.h25 addr_t end) const;
31 virtual status_t Unmap(addr_t start, addr_t end);
33 virtual status_t DebugMarkRangePresent(addr_t start, addr_t end,
/haiku/src/system/kernel/arch/ppc/paging/460/
H A DPPCVMTranslationMap460.h30 addr_t end) const;
36 virtual status_t Unmap(addr_t start, addr_t end);
41 virtual status_t DebugMarkRangePresent(addr_t start, addr_t end,
/haiku/src/system/kernel/arch/ppc/paging/classic/
H A DPPCVMTranslationMapClassic.h30 addr_t end) const;
36 virtual status_t Unmap(addr_t start, addr_t end);
41 virtual status_t DebugMarkRangePresent(addr_t start, addr_t end,
/haiku/src/system/kernel/arch/arm/paging/32bit/
H A DARMVMTranslationMap32Bit.h22 addr_t end) const;
28 virtual status_t Unmap(addr_t start, addr_t end);
30 virtual status_t DebugMarkRangePresent(addr_t start, addr_t end,
/haiku/src/tools/cppunit/cppunit/
H A DTestFactoryRegistry.cpp53 while ( it != m_registries.end() )
74 if ( foundIt == m_registries.end() )
127 for ( Factories::iterator it = m_factories.begin(); it != m_factories.end(); ++it )
183 it != m_factories.end();
/haiku/src/apps/cortex/RouteApp/
H A DNodeSetIOContext.cpp66 it != m_nodes.end(); ++it) {
97 it != m_nodes.end(); ++it) {
146 it != m_nodes.end(); ++it) {
165 it != m_nodes.end(); ++it) {

Completed in 265 milliseconds

1234567891011>>