/haiku/src/servers/app/drawing/Painter/ |
H A D | agg_clipped_alpha_mask.h | 52 int count = num_pix; local 55 bool has_inside = _set_outside(x, y, covers, count); 67 while(--count); 72 int count = num_pix; local 75 bool has_inside = _set_outside(x, y, covers, count); 80 memcpy(covers, mask, count); 85 int& count) const 93 int num_pix = count; 104 count += x; 105 if(count < [all...] |
/haiku/src/apps/haikudepot/textview/ |
H A D | TextSpan.cpp | 126 TextSpan::Remove(int32 start, int32 count) argument 128 _TruncateRemove(start, count); 130 if (count > 0) { 131 fText.RemoveChars(start, count); 144 TextSpan::SubSpan(int32 start, int32 count) const 146 _TruncateRemove(start, count); 149 if (count > 0) 150 fText.CopyCharsInto(subString, start, count); 171 TextSpan::_TruncateRemove(int32& start, int32& count) const 173 if (count < [all...] |
/haiku/headers/os/app/ |
H A D | MessageRunner.h | 16 int32 count = -1); 19 int32 count = -1); 22 int32 count, BMessenger replyTo); 25 int32 count, BMessenger replyTo); 31 status_t SetCount(int32 count); 33 int32* count) const; 37 int32 count); 40 int32 count, BMessenger replyTo); 48 int32 count, bool detach, 53 int32 count, BMessenge [all...] |
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | bitmap.c | 107 * @count: number of bits to set 110 * Set @count bits starting at bit @start_bit in the bitmap described by the 116 s64 count, int value) 122 if (!na || start_bit < 0 || count < 0) { 125 __FUNCTION__, na, (long long)start_bit, (long long)count); 136 bufsize = ((count - (bit ? 8 - bit : 0) + 7) >> 3) + firstbyte; 157 while ((bit & 7) && count--) { 167 /* Loop until @count reaches zero. */ 170 bit = count & 7; 173 if (count > 115 ntfs_bitmap_set_bits_in_run(ntfs_attr *na, s64 start_bit, s64 count, int value) argument 268 ntfs_bitmap_set_run(ntfs_attr *na, s64 start_bit, s64 count) argument 290 ntfs_bitmap_clear_run(ntfs_attr *na, s64 start_bit, s64 count) argument [all...] |
/haiku/src/tests/kits/app/bmessagerunner/ |
H A D | SetIntervalTester.cpp | 47 bigtime_t interval = 0, int32 count = 0) 54 CHK(runnerCount == count); 71 int32 count = 0; local 72 BMessageRunner runner(target, &message, interval, count); 95 int32 count = 1; local 96 BMessageRunner runner(target, &message, interval, count); 98 check_message_runner_info(runner, B_OK, interval, count); 99 snooze(count * interval + 10000); 124 int32 count = 5; local 125 BMessageRunner runner(target, &message, interval, count); 161 int32 count = 5; local 198 int32 count = -1; local 239 int32 count = 5; local 285 int32 count = 5; local [all...] |
/haiku/src/apps/mediaplayer/playlist/ |
H A D | PLItemsCommand.cpp | 32 PLItemsCommand::_CleanUp(PlaylistItem**& items, int32 count, bool deleteItems) argument 37 for (int32 i = 0; i < count; i++)
|
/haiku/src/libs/stdc++/legacy/ |
H A D | sbform.cc | 37 int count = _IO_vfprintf(this, format, ap); local 39 return count;
|
/haiku/src/system/libroot/posix/wchar/ |
H A D | wmemcmp.c | 10 __wmemcmp(const wchar_t* wcs1, const wchar_t* wcs2, size_t count) argument 12 while (count-- > 0) {
|
H A D | wcsncmp.c | 10 __wcsncmp(const wchar_t* wcs1, const wchar_t* wcs2, size_t count) argument 14 while (count-- > 0) {
|
/haiku/src/bin/ |
H A D | fortune.c | 24 int count = 0; local 31 // count directory entries 37 count++; 40 if (count == 0) { 46 chosen = rand() % count; 47 count = 0; 54 if (chosen <= count) { 69 count++; 85 unsigned count; local 140 // count fortune [all...] |
/haiku/src/tests/kits/app/blooper/ |
H A D | IsMessageWaitingTest.cpp | 79 int32 count; 82 count = port_buffer_size_etc(_get_looper_port_(&Looper), B_TIMEOUT, 0); 83 } while (count == B_INTERRUPTED); 85 CPPUNIT_ASSERT(count < 0); 86 cout << endl << "port_buffer_size_etc: " << strerror(count) << endl; 140 ssize_t count; 143 count = port_buffer_size_etc(_get_looper_port_(Looper), B_TIMEOUT, 0); 144 } while (count == B_INTERRUPTED); 147 if (count < 0) 149 cout << strerror(count); [all...] |
/haiku/src/bin/network/telnet/ |
H A D | ring.h | 76 ring_init(Ring *ring, unsigned char *buffer, int count); 80 ring_supply_data(Ring *ring, unsigned char *buffer, int count); 83 ring_consume_data(Ring *ring, unsigned char *buffer, int count); 88 ring_supplied(Ring *ring, int count), 89 ring_consumed(Ring *ring, int count);
|
/haiku/src/libs/compat/freebsd_network/ |
H A D | fbsd_subr_bufring.c | 41 buf_ring_alloc(int count, struct malloc_type *type, int flags, struct mtx *lock) argument 45 KASSERT(powerof2(count), ("buf ring must be size power of 2")); 47 br = malloc(sizeof(struct buf_ring) + count*sizeof(caddr_t), 54 br->br_prod_size = br->br_cons_size = count; 55 br->br_prod_mask = br->br_cons_mask = count-1;
|
/haiku/src/tests/system/libroot/posix/ |
H A D | thread_local_test.cpp | 45 int thread_local_test(int count) argument 47 pthread_t ids[count]; 48 int short_ids[count]; 52 for (int i = 0; i < count; i++) { 57 for (int i = 0; i < count; i++)
|
/haiku/src/apps/debuganalyzer/gui/chart/ |
H A D | DefaultChartAxisLegendSource.cpp | 43 int32 count = 0; local 52 return count; 54 legends[count] = legend; 55 values[count++] = value; 58 return count; 79 int32 count = 0; local 89 return count; 91 legends[count] = legend; 92 values[count++] = value; 95 return count; [all...] |
/haiku/src/system/libroot/os/ |
H A D | sem.c | 12 create_sem(int32 count, const char *name) argument 14 return _kern_create_sem(count, name); 33 acquire_sem_etc(sem_id id, int32 count, uint32 flags, bigtime_t timeout) argument 35 return _kern_acquire_sem_etc(id, count, flags, timeout); 50 switch_sem_etc(sem_id releaseSem, sem_id id, int32 count, uint32 flags, bigtime_t timeout) argument 52 return _kern_switch_sem_etc(releaseSem, id, count, flags, timeout); 64 release_sem_etc(sem_id id, int32 count, uint32 flags) argument 66 return _kern_release_sem_etc(id, count, flags); 71 get_sem_count(sem_id sem, int32 *count) argument 73 return _kern_get_sem_count(sem, count); [all...] |
/haiku/src/libs/iconv/ |
H A D | iso2022_jp1.h | 41 int count = 0; local 46 if (n < count+3) 51 s += 3; count += 3; 52 if (n < count+1) 58 s += 3; count += 3; 59 if (n < count+1) 69 s += 3; count += 3; 70 if (n < count+1) 75 if (n < count+4) 79 s += 4; count 156 int count = (state == STATE_ASCII ? 1 : 4); local 177 int count = (state == STATE_JISX0201ROMAN ? 1 : 4); local 198 int count = (state == STATE_JISX0208 ? 2 : 5); local 220 int count = (state == STATE_JISX0212 ? 2 : 6); local [all...] |
H A D | iso2022_jp3.h | 55 int count = 0; local 60 if (n < count+3) 65 s += 3; count += 3; 66 if (n < count+1) 72 s += 3; count += 3; 73 if (n < count+1) 79 s += 3; count += 3; 80 if (n < count+1) 90 s += 3; count += 3; 91 if (n < count 262 int count = 0; local 499 int count = local [all...] |
H A D | iso2022_cn.h | 58 int count = 0; local 63 if (n < count+4) 69 s += 4; count += 4; 70 if (n < count+1) 76 s += 4; count += 4; 77 if (n < count+1) 85 s += 4; count += 4; 86 if (n < count+1) 104 return count+4; 116 s++; count 192 int count = (state1 == STATE_ASCII ? 1 : 2); local 215 int count = (state2 == STATE2_DESIGNATED_GB2312 ? 0 : 4) + (state1 == STATE_TWOBYTE ? 0 : 1) + 2; local 245 int count = (state2 == STATE2_DESIGNATED_CNS11643_1 ? 0 : 4) + (state1 == STATE_TWOBYTE ? 0 : 1) + 2; local 270 int count = (state3 == STATE3_DESIGNATED_CNS11643_2 ? 0 : 4) + 4; local [all...] |
H A D | iso2022_kr.h | 57 int count = 0; local 62 if (n < count+4) 68 s += 4; count += 4; 69 if (n < count+1) 81 s++; count++; 82 if (n < count+1) 88 s++; count++; 89 if (n < count+1) 108 return count+1; 112 if (n < count 147 int count = (state1 == STATE_ASCII ? 1 : 2); local 169 int count = (state2 == STATE2_DESIGNATED_KSC5601 ? 0 : 4) + (state1 == STATE_TWOBYTE ? 0 : 1) + 2; local [all...] |
H A D | utf32.h | 38 int count = 0; local 43 count += 4; 51 return count; 58 return RET_TOOFEW(count); 67 int count = 0; local 74 r += 4; n -= 4; count += 4; 85 return count+4;
|
/haiku/src/tests/add-ons/kernel/file_systems/bfs/ |
H A D | bfs_attribute_iterator_test.cpp | 42 add_attributes(BFile& file, int32 start, int32 count) argument 44 for (int32 index = start; index < start + count; index++) { 53 remove_attributes(BFile& file, int32 start, int32 count) argument 55 for (int32 index = start; index < start + count; index++) { 82 test_remove_attributes(BFile& file, int32 start, int32 count, int32 removeAt, argument 123 for (int32 i = start; i < start + count; i++) { 126 index, count); 134 test_add_attributes(BFile& file, int32 start, int32 count, int32 addAt, argument 175 for (int32 i = start; i < start + count; i++) { 178 index, count); [all...] |
/haiku/headers/libs/agg/ |
H A D | agg_dda_line.h | 37 dda_line_interpolator(int y1, int y2, unsigned count) : argument 39 m_inc(((y2 - y1) << FractionShift) / int(count)), 95 dda2_line_interpolator(int y1, int y2, int count) : argument 96 m_cnt(count <= 0 ? 1 : count), 104 m_mod += count; 105 m_rem += count; 108 m_mod -= count; 112 dda2_line_interpolator(int y1, int y2, int count, int) : argument 113 m_cnt(count < 128 dda2_line_interpolator(int y, int count) argument [all...] |
/haiku/src/system/kernel/util/ |
H A D | RadixBitmap.cpp | 197 radix_leaf_alloc(radix_node *leaf, radix_slot_t slotIndex, int32 count) 199 if (count <= (int32)BITMAP_RADIX) { 201 uint32 n = BITMAP_RADIX - count; 212 // we could not allocate count here, update big_hint 213 if (leaf->big_hint >= count) 214 leaf->big_hint = count - 1; 220 radix_node_alloc(radix_node *node, radix_slot_t slotIndex, int32 count, 230 if (count <= node[i].big_hint) { 233 addr = radix_leaf_alloc(&node[i], slotIndex, count); 235 addr = radix_node_alloc(&node[i], slotIndex, count, radi [all...] |
/haiku/src/kits/debugger/types/ |
H A D | TargetAddressRangeList.cpp | 62 int32 count = fRanges.Size(); local 63 if (count == 0) 67 for (int32 i = 0; i < count; i++) 78 int32 count = fRanges.Size(); local 79 for (int32 i = 0; i < count; i++) 89 int32 count = fRanges.Size(); local 90 for (int32 i = 0; i < count; i++) {
|