Searched refs:lower (Results 1 - 25 of 58) sorted by last modified time

123

/haiku/headers/private/kernel/util/
H A DVectorMap.h659 int32 lower = 0; local
661 while (lower < upper) {
662 int32 mid = (lower + upper) / 2;
666 lower = mid + 1;
670 exists = (lower < Count() && fEntryStrategy.Compare(key,
671 fEntryStrategy.GetKey(fElements[lower])) == 0);
672 return lower;
/haiku/src/add-ons/kernel/drivers/audio/hda/
H A Dhda_controller.cpp961 bufferDescriptors->lower = (uint32)stream->physical_buffers[index];
H A Dhda_controller_defs.h171 uint32 lower; member in struct:__anon7
/haiku/src/kits/interface/
H A DColumnListView.cpp4605 int32 lower = 0; local
4607 while( lower < upper ) {
4608 int32 middle = lower + (upper-lower+1)/2;
4611 else if( cmp > 0 ) lower = middle+1;
4612 else lower = upper = middle;
4615 // At this point, 'upper' and 'lower' at the last found item.
/haiku/src/kits/debugger/dwarf/
H A DDwarfFile.cpp3345 int lower = 0; local
3347 while (lower < upper) {
3348 int mid = (lower + upper + 1) / 2;
3352 lower = mid;
3355 CompilationUnit* unit = fCompilationUnits.ItemAt(lower);
3379 int lower = 0; local
3384 while (lower < upper) {
3385 int mid = (lower + upper + 1) / 2;
3389 lower = mid;
3392 FDELookupInfo* info = infoList.ItemAt(lower);
[all...]
H A DBaseUnit.cpp96 int lower = 0; local
98 while (lower < upper) {
99 int mid = (lower + upper + 1) / 2;
103 lower = mid;
106 return fEntryOffsets[lower] == offset ? fEntries[lower] : NULL;
/haiku/src/system/kernel/util/
H A Dring_buffer.cpp62 size_t lower = length - upper; local
66 || user_memcpy(data + upper, buffer->buffer, lower) < B_OK)
70 memcpy(data + upper, buffer->buffer, lower);
105 size_t lower = length - upper; local
109 || user_memcpy(buffer->buffer, data + upper, lower) < B_OK)
113 memcpy(buffer->buffer, data + upper, lower);
261 size_t lower = length - upper; local
264 memcpy((uint8*)data + upper, buffer->buffer, lower);
294 size_t lower = buffer->in - upper; local
299 vecs[1].iov_len = lower;
330 size_t lower = length - upper; 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
505 int32 lower = 0; 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, uppe
775 int32 lower = 0; local
[all...]
/haiku/src/apps/debuganalyzer/model/
H A DModel.cpp361 size_t lower = 0; local
363 while (lower < upper) {
364 size_t mid = (lower + upper) / 2;
368 lower = mid + 1;
373 return lower;
668 size_t lower = 0; local
670 while (lower < upper) {
671 size_t mid = (lower + upper) / 2;
688 lower = mid;
695 lower
[all...]
/haiku/src/apps/debuganalyzer/gui/main_window/
H A DSchedulingPage.cpp789 int32 lower = 0; local
791 while (lower < upper) {
792 int32 mid = (lower + upper + 1) / 2;
797 lower = mid;
800 if (lower >= 0 && lower < eventCount) {
801 threadState = events[lower].state;
802 threadStateTime = events[lower].time;
803 threadWaitObject = events[lower].waitObject;
804 if (lower
1263 int32 lower = 0; local
[all...]
/haiku/src/tools/fs_shell/
H A Dunistd.cpp76 off_t lower = 0; local
78 while (lower < upper) {
79 off_t mid = (lower + upper + 1) / 2;
81 lower = mid;
86 return lower;
/haiku/src/system/libroot/posix/crypt/
H A Dcrypt.cpp56 const uint8 lower = n & 0x0f; local
58 assert(lower < 16 && upper < 16);
60 outBuffer[outIndex++] = kHexAlphabet[lower];
165 // Set a lower bound on N_log2: below 12 scrypt is weaker than bcrypt.
/haiku/src/add-ons/kernel/drivers/network/ether/intel22x/dev/igc/
H A Digc_txrx.c477 pkt_info = le16toh(rxd->wb.lower.lo_dword.hs_rss.pkt_info);
482 ptype = le32toh(rxd->wb.lower.lo_dword.data) & IGC_PKTTYPE_MASK;
524 le32toh(rxd->wb.lower.hi_dword.rss);
H A Digc_hw.h152 } lower; member in struct:igc_rx_desc_extended::__anon2
182 } lower; member in struct:igc_rx_desc_packet_split::__anon8
207 } lower; member in struct:igc_tx_desc
257 } lower; member in struct:igc_data_desc
H A Digc_base.h111 } lower; member in struct:igc_adv_rx_desc::__anon236
/haiku/src/add-ons/kernel/partitioning_systems/common/
H A DPartitionMap.cpp226 int32 lower = 0; local
228 while (lower < upper) {
229 int32 mid = (lower + upper) / 2;
232 lower = mid + 1;
236 const Partition* partition = partitions[lower];
/haiku/src/kits/shared/
H A DMemoryRingIO.cpp130 const size_t lower = size - upper; local
132 memcpy(buffer + upper, fBuffer, lower);
167 const size_t lower = size - upper; local
169 memcpy(fBuffer, buffer + upper, lower);
/haiku/src/add-ons/kernel/drivers/network/ether/ipro1000/dev/e1000/
H A Digb_txrx.c452 pkt_info = le16toh(rxd->wb.lower.lo_dword.hs_rss.pkt_info);
457 ptype = le32toh(rxd->wb.lower.lo_dword.data) & IGB_PKTTYPE_MASK;
504 le32toh(rxd->wb.lower.hi_dword.rss);
H A Dem_txrx.c372 ctxd->lower.data = htole32(cmd | txd_lower | seg_len);
381 ctxd->lower.data = htole32(cmd | txd_lower | TSO_WORKAROUND);
389 ctxd->lower.data = htole32(cmd | txd_lower | seg_len);
409 ctxd->lower.data |= htole32(E1000_TXD_CMD_EOP | txd_flags);
682 pkt_info = le32toh(rxd->wb.lower.mrq);
717 ri->iri_flowid = le32toh(rxd->wb.lower.hi_dword.rss);
H A De1000_vf.h108 } lower; member in struct:e1000_adv_rx_desc::__anon49
H A De1000_hw.h439 } lower; member in struct:e1000_rx_desc_extended::__anon21
469 } lower; member in struct:e1000_rx_desc_packet_split::__anon27
494 } lower; member in struct:e1000_tx_desc
544 } lower; member in struct:e1000_data_desc
H A De1000_base.h138 } lower; member in struct:e1000_adv_rx_desc::__anon13
H A De1000_82575.h70 } lower; member in struct:e1000_adv_data_desc
/haiku/src/servers/registrar/
H A DPriorityMessageQueue.cpp118 int32 lower = 0; local
120 while (lower < upper) {
121 int32 mid = (lower + upper) / 2;
124 lower = mid + 1;
128 return lower;
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar9002/
H A Dar9280_attach.c589 int upper, lower, cur_vit_mask; local
725 lower = bin - 100;
732 if ((cur_bin > lower) && (cur_bin < upper)) {
764 lower = bin - 120;
767 if ((cur_vit_mask > lower) && (cur_vit_mask < upper)) {

Completed in 309 milliseconds

123