Searched refs:upper (Results 1 - 25 of 69) sorted by last modified time

123

/haiku/headers/private/kernel/util/
H A DVectorMap.h660 int32 upper = Count(); local
661 while (lower < upper) {
662 int32 mid = (lower + upper) / 2;
668 upper = mid;
/haiku/src/add-ons/kernel/drivers/audio/hda/
H A Dhda_controller.cpp962 bufferDescriptors->upper
/haiku/src/kits/interface/
H A DColumnListView.cpp4606 int32 upper = list->CountItems()-1; local
4607 while( lower < upper ) {
4608 int32 middle = lower + (upper-lower+1)/2;
4610 if( cmp < 0 ) upper = middle-1;
4612 else lower = upper = middle;
4615 // At this point, 'upper' and 'lower' at the last found item.
4616 // Arbitrarily use 'upper' and determine the final insertion
4618 if( upper < 0 ) upper = 0;
4619 else if( upper < lis
[all...]
/haiku/src/apps/haikudepot/build/scripts/
H A Dhdsjsonschemacommon.py49 return propname[0:1].upper() + propname[1:]
229 obj["cppnameupper"] = obj_cpp_classname.upper()
/haiku/src/kits/debugger/dwarf/
H A DDwarfFile.cpp3346 int upper = fCompilationUnits.CountItems() - 1; local
3347 while (lower < upper) {
3348 int mid = (lower + upper + 1) / 2;
3350 upper = mid - 1;
3380 int upper = infoList.CountItems() - 1; local
3381 if (upper < 0)
3384 while (lower < upper) {
3385 int mid = (lower + upper + 1) / 2;
3387 upper = mid - 1;
H A DBaseUnit.cpp97 int upper = fEntries.Count() - 1; local
98 while (lower < upper) {
99 int mid = (lower + upper + 1) / 2;
101 upper = mid - 1;
/haiku/src/system/kernel/util/
H A Dring_buffer.cpp61 size_t upper = buffer->size - buffer->first; local
62 size_t lower = length - upper;
65 if (user_memcpy(data, buffer->buffer + buffer->first, upper) < B_OK
66 || user_memcpy(data + upper, buffer->buffer, lower) < B_OK)
69 memcpy(data, buffer->buffer + buffer->first, upper);
70 memcpy(data + upper, buffer->buffer, lower);
104 size_t upper = buffer->size - position; local
105 size_t lower = length - upper;
108 if (user_memcpy(buffer->buffer + position, data, upper) < B_OK
109 || user_memcpy(buffer->buffer, data + upper, lowe
260 size_t upper = buffer->size - offset; local
293 size_t upper = buffer->size - buffer->first; local
329 size_t upper = from->size - from->first; local
[all...]
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DIterators.cpp504 // binary search: lower and upper are node indices, mid is a key index
506 int32 upper = node->CountItems(); local
507 while (lower < upper) {
508 int32 mid = (lower + upper) / 2; // lower <= mid < upper <= count
513 upper = mid; // lower <= upper < count
515 lower = mid + 1; // lower <= upper <= count
516 //PRINT((" lower: %ld, upper: %ld\n", lower, upper));
776 int32 upper = node->CountItems() - 1; local
[all...]
/haiku/src/apps/debuganalyzer/model/
H A DModel.cpp362 size_t upper = fIORequestCount; local
363 while (lower < upper) {
364 size_t mid = (lower + upper) / 2;
370 upper = mid;
669 size_t upper = CountEvents(); local
670 while (lower < upper) {
671 size_t mid = (lower + upper) / 2;
672 while (mid < upper) {
687 if (mid == upper) {
697 upper
[all...]
/haiku/src/apps/debuganalyzer/gui/main_window/
H A DSchedulingPage.cpp790 int32 upper = eventCount - 1; local
791 while (lower < upper) {
792 int32 mid = (lower + upper + 1) / 2;
795 upper = mid - 1;
1264 int32 upper = eventCount - 1; local
1265 while (lower < upper) {
1266 int32 mid = (lower + upper + 1) / 2;
1269 upper = mid - 1;
1287 while (upper + 1 < eventCount) {
1288 upper
[all...]
/haiku/src/tools/fs_shell/
H A Dunistd.cpp77 off_t upper = maxSize; local
78 while (lower < upper) {
79 off_t mid = (lower + upper + 1) / 2;
83 upper = mid - 1;
/haiku/src/system/libroot/posix/crypt/
H A Dcrypt.cpp55 const uint8 upper = n >> 4; local
58 assert(lower < 16 && upper < 16);
59 outBuffer[outIndex++] = kHexAlphabet[upper];
/haiku/src/add-ons/kernel/drivers/network/ether/intel22x/dev/igc/
H A Digc_txrx.c102 status = txr->tx_base[cur].upper.fields.status;
112 if (txr->tx_base[i].upper.fields.status & IGC_TXD_STAT_DD)
438 staterr = le32toh(rxd->wb.upper.status_error);
452 * to upper layer. Initialize ri structure.
476 staterr = le32toh(rxd->wb.upper.status_error);
481 len = le16toh(rxd->wb.upper.length);
487 rxd->wb.upper.status_error = 0;
519 ri->iri_vtag = le16toh(rxd->wb.upper.vlan);
H A Digc_hw.h157 } upper; member in struct:igc_rx_desc_extended::__anon2
192 } upper; member in struct:igc_rx_desc_packet_split::__anon8
215 } upper; member in struct:igc_tx_desc
265 } upper; member in struct:igc_data_desc
H A Dif_igc.c401 u32 staterr = le32toh(rxr->rx_base[j].wb.upper.status_error);
402 u32 length = le32toh(rxr->rx_base[j].wb.upper.length);
411 buf->eop != -1 ? txr->tx_base[buf->eop].upper.fields.status & IGC_TXD_STAT_DD : 0);
/haiku/src/add-ons/kernel/partitioning_systems/common/
H A DPartitionMap.cpp227 int32 upper = count - 1; local
228 while (lower < upper) {
229 int32 mid = (lower + upper) / 2;
234 upper = mid;
/haiku/src/kits/shared/
H A DMemoryRingIO.cpp129 const size_t upper = fBufferSize - fReadAtNext; local
130 const size_t lower = size - upper;
131 memcpy(buffer, fBuffer + fReadAtNext, upper);
132 memcpy(buffer + upper, fBuffer, lower);
166 const size_t upper = fBufferSize - fWriteAtNext; local
167 const size_t lower = size - upper;
169 memcpy(fBuffer, buffer + upper, lower);
/haiku/src/add-ons/kernel/drivers/network/ether/ipro1000/dev/e1000/
H A Digb_txrx.c413 staterr = le32toh(rxd->wb.upper.status_error);
427 * to upper layer. Initialize ri structure.
451 staterr = le32toh(rxd->wb.upper.status_error);
456 len = le16toh(rxd->wb.upper.length);
462 rxd->wb.upper.status_error = 0;
497 ri->iri_vtag = be16toh(rxd->wb.upper.vlan);
499 ri->iri_vtag = le16toh(rxd->wb.upper.vlan);
H A Dif_em.c707 u32 staterr = le32toh(rxr->rx_base[j].wb.upper.status_error);
708 u32 length = le32toh(rxr->rx_base[j].wb.upper.length);
717 buf->eop != -1 ? txr->tx_base[buf->eop].upper.fields.status & E1000_TXD_STAT_DD : 0);
H A Dem_txrx.c111 status = txr->tx_base[cur].upper.fields.status;
121 if (txr->tx_base[i].upper.fields.status & E1000_TXD_STAT_DD)
373 ctxd->upper.data = htole32(txd_upper);
382 ctxd->upper.data = htole32(txd_upper);
390 ctxd->upper.data = htole32(txd_upper);
445 status = txr->tx_base[cur].upper.fields.status;
475 status = txr->tx_base[cur].upper.fields.status;
533 rxd->wb.upper.status_error = 0;
588 staterr = le32toh(rxd->wb.upper.status_error);
681 staterr = le32toh(rxd->wb.upper
[all...]
H A De1000_vf.h113 } upper; member in struct:e1000_adv_rx_desc::__anon49
H A De1000_hw.h444 } upper; member in struct:e1000_rx_desc_extended::__anon21
479 } upper; member in struct:e1000_rx_desc_packet_split::__anon27
502 } upper; member in struct:e1000_tx_desc
552 } upper; member in struct:e1000_data_desc
H A De1000_base.h143 } upper; member in struct:e1000_adv_rx_desc::__anon13
H A De1000_82575.h79 } upper; member in struct:e1000_adv_data_desc
/haiku/src/servers/registrar/
H A DPriorityMessageQueue.cpp119 int32 upper = fMessages.CountItems(); local
120 while (lower < upper) {
121 int32 mid = (lower + upper) / 2;
126 upper = mid;

Completed in 309 milliseconds

123