/haiku/src/apps/haikudepot/util/ |
H A D | RatingUtils.h | 21 static void Draw(BView* target, BPoint at, float value, 23 static void Draw(BView* target, BPoint at, float value);
|
H A D | RatingUtils.cpp | 20 RatingUtils::Draw(BView* target, BPoint at, float value) argument 34 Draw(target, at, value, star); 39 RatingUtils::Draw(BView* target, BPoint at, float value, argument 43 rect.OffsetBy(at); 57 target->DrawBitmap(star, at + BPoint(x, 0)); 67 rect.OffsetBy(at);
|
/haiku/headers/private/debugger/types/ |
H A D | ArrayIndexPath.h | 31 inline void SetIndexAt(int32 at, int64 newIndex); 66 ArrayIndexPath::SetIndexAt(int32 at, int64 newIndex) argument 68 if (at >= 0 && at < fIndices.Count()) 69 fIndices[at] = newIndex;
|
/haiku/src/bin/ |
H A D | badblocks.cpp | 23 off_t at = block * blockSize; local 40 fprintf(stderr, "Scanning '%s', %d * %d bytes at once\n", 46 for (; block <= endBlock; block += group, at += len) { 50 got = pread(fd, buffer, len, at); 56 block, at, got, len); 70 got = pread(fd, buffer, blockSize, at + blockSize * i); 95 fprintf(stderr, "badblocks [-sv] [-b block-size] [-c block-at-once] "
|
H A D | launch_roster.cpp | 92 time_t at = now - (runtime - when) / 1000000l; local 94 localtime_r(&at, &tm);
|
/haiku/src/system/libroot/posix/glibc/arch/sparc/ |
H A D | add_n.S | 10 the Free Software Foundation; either version 2.1 of the License, or (at your 37 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 D | sub_n.S | 10 the Free Software Foundation; either version 2.1 of the License, or (at your 34 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
|
H A D | lshift.S | 9 the Free Software Foundation; either version 2.1 of the License, or (at your 34 add %o1,%g1,%o1 ! make %o1 point at end of src 37 add %o0,%g1,%o0 ! make %o0 point at end of res
|
/haiku/headers/os/media/ |
H A D | TimeSource.h | 106 void DirectStart(bigtime_t at); 107 void DirectStop(bigtime_t at, bool immediate); 108 void DirectSeek(bigtime_t to, bigtime_t at);
|
/haiku/src/tests/system/network/tcp_shell/ |
H A D | BufferQueueTest.cpp | 49 add(size_t bytes, uint32 at) argument 51 gQueue.Add(create_filled_buffer(bytes), at); local 71 printf("%s (available %lu at %lu)\n", text, gQueue.Available(), 137 dump("added at the end of previous data");
|
/haiku/src/apps/showimage/ |
H A D | PrintOptionsWindow.cpp | 81 PrintOptionsWindow::PrintOptionsWindow(BPoint at, PrintOptions* options, argument 84 BWindow(BRect(at.x, at.y, at.x + 300, at.y + 200),
|
H A D | PrintOptionsWindow.h | 60 PrintOptionsWindow(BPoint at,
|
/haiku/src/add-ons/index_server/fulltext/ |
H A D | CLuceneDataBase.cpp | 78 if (fAddQueue.at(i) == ref) 92 if (fDeleteQueue.at(i) == ref) 120 if (!_IndexDocument(fAddQueue.at(i))) { 197 BPath path(&docs.at(i));
|
/haiku/headers/libs/agg/ |
H A D | agg_array.h | 36 const T& at(unsigned i) const { return m_array[i]; } function in class:agg::pod_array_adaptor 37 T& at(unsigned i) { return m_array[i]; } function in class:agg::pod_array_adaptor 68 const T& at(unsigned i) const { return m_array[i]; } function in class:agg::pod_auto_array 69 T& at(unsigned i) { return m_array[i]; } function in class:agg::pod_auto_array 95 const T& at(unsigned i) const { return m_array[i]; } function in class:agg::pod_auto_vector 96 T& at(unsigned i) { return m_array[i]; } function in class:agg::pod_auto_vector 145 const T& at(unsigned i) const { return m_array[i]; } function in class:agg::pod_array 146 T& at(unsigned i) { return m_array[i]; } function in class:agg::pod_array 201 const T& at(unsigned i) const { return m_array[i]; } function in class:agg::pod_vector 202 T& at(unsigne function in class:agg::pod_vector 391 const T& at(unsigned i) const function in class:agg::pod_bvector 396 T& at(unsigned i) function in class:agg::pod_bvector 1096 const value_type& at(unsigned i) const { return m_array[m_start + i]; } function in class:agg::range_adaptor 1097 value_type& at(unsigned i) { return m_array[m_start + i]; } function in class:agg::range_adaptor [all...] |
/haiku/src/system/kernel/arch/ppc/ |
H A D | arch_thread.cpp | 197 struct arch_thread *at = (struct arch_thread *)info; local 199 dprintf("\tsp: %p\n", at->sp); 250 * in the child team at the same position where the parent team left of.
|
/haiku/src/system/libroot/posix/glibc/arch/ppc/ |
H A D | lshift.S | 8 version 2.1 of the License, or (at your option) any later version. 37 add r7,r3,r0 # make r7 point at end of res 38 add r4,r4,r0 # make r4 point at end of s1
|
/haiku/src/system/kernel/arch/m68k/ |
H A D | arch_thread.cpp | 221 struct arch_thread *at = (struct arch_thread *)info; local 223 dprintf("\tsp: %p\n", at->sp); 273 * in the child team at the same position where the parent team left of.
|
/haiku/src/system/kernel/arch/m68k/paging/040/ |
H A D | M68KPagingStructures040.cpp | 128 #warning M68K: TODO: allocate all kernel pgdirs at boot and remove this (also dont remove them anymore from unmap)
|
/haiku/src/system/kernel/arch/x86/32/ |
H A D | thread.cpp | 211 struct arch_thread *at = (struct arch_thread *)info; local 213 kprintf("\tesp: %p\n", at->current_stack.esp); 214 kprintf("\tss: %p\n", at->current_stack.ss); 215 kprintf("\tfpu_state at %p\n", at->fpu_state);
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | DataContainer.cpp | 80 // this means files (no matter how small) always use cache mode at present. 296 phys_addr_t at = (page != NULL) local 301 at += pageoffset; 308 error = vm_memcpy_to_physical(at, buffer, bytes, user); 311 error = vm_memcpy_from_physical(buffer, at, bytes, user);
|
/haiku/src/preferences/mail/ |
H A D | AutoConfig.cpp | 92 int32 at = emailS.FindLast("@"); local 93 emailS.CopyInto(provider, at + 1, emailS.Length() - at);
|
/haiku/src/apps/bootmanager/ |
H A D | bootman.S | 2 ; Copyright 2007, Dengg David, david-d@gmx.at. All rights reserved. 273 ; Print title centered at row 2 281 ; Print message centered at second last row 330 at AddressPacket.packet_size, db 0x10 331 at AddressPacket.block_count, db 0x03 332 at AddressPacket.buffer, dw 0x0200, 0x07c0 333 at AddressPacket.offset, dw 1 492 mov si, list ; Start at top of list 569 ; Print "Loading <name>" at top of screen 672 at AddressPacke [all...] |
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | BTree.cpp | 174 BTree::Node::_Copy(const Node* origin, uint32 at, uint32 from, uint32 to, argument 177 TRACE("Node::_Copy() at: %d from: %d to: %d length: %d\n", 178 at, from, to, length); 181 memcpy(Item(at), origin->Item(from), origin->_CalculateSpace(from, to)); 185 for (uint32 i = at; i - at <= to - from; ++i) 188 memcpy(ItemData(at + to - from), origin->ItemData(to), 191 memcpy(Index(at), origin->Index(from),
|
/haiku/src/kits/media/ |
H A D | TimeSource.cpp | 611 BTimeSource::DirectStart(bigtime_t at) argument 622 BTimeSource::DirectStop(bigtime_t at, bool immediate) argument 633 BTimeSource::DirectSeek(bigtime_t to, bigtime_t at) argument
|
/haiku/src/kits/mail/ |
H A D | MailSettings.cpp | 517 const char* at = strstr(string, parentDirectory); local 518 if (at == NULL) 521 return at + strlen(parentDirectory);
|