Searched refs:number (Results 51 - 75 of 142) sorted by last modified time

123456

/haiku/src/add-ons/kernel/file_systems/udf/
H A DPhysicalPartition.h27 PhysicalPartition(uint16 number, uint32 start, uint32 length);
/haiku/headers/private/print/
H A DTemplate.h38 virtual void Op(int number);
H A DPicturePrinter.h43 virtual void Op(int number);
H A DPictureIterator.h44 virtual void Op(int number) { } argument
/haiku/src/add-ons/kernel/drivers/network/ether/pegasus/
H A Ddriver.h100 int number; member in struct:_pegasus_dev
/haiku/src/libs/compat/freebsd_iflib/
H A Dnvlist.c1421 NVLIST_EXISTS(number, NUMBER)
1557 NVLIST_ADD(uint64_t, number)
1588 NVLIST_ADD_ARRAY(const uint64_t *, number)
1621 NVLIST_APPEND_ARRAY(const uint64_t, number, NUMBER)
1884 NVLIST_GET(uint64_t, number, NUMBER)
1919 NVLIST_GET_ARRAY(const uint64_t *, number, NUMBER)
1945 NVLIST_TAKE(uint64_t, number, NUMBER)
1988 NVLIST_TAKE_ARRAY(uint64_t *, number, NUMBER)
2024 NVLIST_FREE(number, NUMBER)
/haiku/src/bin/
H A Derror.c308 fprintf(stderr, "usage: %s <error number>\n"
315 print_error(char *number) argument
318 int32 error = (int32)strtoll(number, &end, 0);
322 // not a number, check names
324 while (p->name && strcmp(p->name, number))
327 fprintf(stderr, "%s: invalid number (%s)\n", __progname, number);
/haiku/src/apps/diskprobe/
H A DDataView.cpp1337 addr_t number; local
1339 || (number = (addr_t)strchr(hexNumbers, c)) == 0)
1345 number -= (addr_t)hexNumbers;
1349 | (number << fBitPosition);
1350 // mask out overwritten region and bit-wise or the number
/haiku/src/add-ons/kernel/debugger/demangle/
H A Dgcc3+.cpp882 TypedNumberLiteralNode(Node* type, const char* number, size_t length) argument
885 fNumber(number),
893 // If the type is bool and the number is 0 or 1, we use "false" or
908 // add the number -- replace a leading 'n' by '-', if necessary
1953 bool _ParseNumber(number_type& number);
2397 // <nv-offset> ::= <offset number>
2399 // <v-offset> ::= <offset number> _ <virtual offset number>
2615 // <discriminator> := _ <non-negative number>
2661 // <source-name> ::= <positive length number> <identifie
3658 _ParseNumber(number_type& number) argument
[all...]
/haiku/src/system/libroot/posix/stdlib/
H A Dstrtod.c75 * This strtod returns a nearest machine number to the input decimal
120 * down depends on the machine and the number being converted.
1245 * decimal point, followed by nd-nd0 digits. The number we're
1327 /* set to largest number */
1624 double __strtod_internal(const char *number, char **_end, int group);
1627 __strtod_internal(const char *number, char **_end, int group) argument
1632 return strtod(number, _end);
1637 long double __strtold_internal(const char *number, char **_end, int group);
1640 __strtold_internal(const char *number, char **_end, int group) argument
1642 return __strtod_internal(number, _en
1648 __strtof_internal(const char *number, char **_end, int group) argument
[all...]
/haiku/src/add-ons/kernel/drivers/network/wlan/iprowifi2200/dev/iwi/
H A Dif_iwi.c1523 beacon->state, le32toh(beacon->number)));
1533 if (le32toh(beacon->number) >= vap->iv_bmissthreshold) {
1535 le32toh(beacon->number),
/haiku/src/preferences/input/
H A DMouseView.cpp284 // draw mapping number centered over the button
303 int32 number = getMappingNumber(map.button[_ConvertFromVisualOrder(i)]); local
304 label[0] = number + '1';
/haiku/src/add-ons/kernel/drivers/midi/usb_midi/
H A Dusb_midi.cpp82 int number; local
89 number = find_free_device_number();
102 sprintf(area_name, DRIVER_NAME "_buffer%d", number);
130 sprintf(midiDevice->name, "%s%d", midi_base_name, number);
132 midiDevice->devnum = number;
212 /* port matching 'cable number' */
214 DPRINTF_ERR((MY_ID "no port matching cable number %d!\n",
316 and could possibly have different number of connectors! */
376 /* get the actual number of ports in and out */
/haiku/src/apps/bootmanager/
H A Dbootman.S20 %assign BIOS_REBOOT 0x19 ; dl - boot drive number
71 ; dl - number of drives (?)
249 .device resb 1 ; hard drive number
389 sub bl, al ; y = TEXT_ROWS / 2 - number of items / 2
586 mov dl, [si] ; drive number in dl
595 mov bx, 0x0F ; Page number and foreground color
692 ; dw number of entries
698 ; db hard drive number
/haiku/src/add-ons/mail_daemon/inbound_protocols/imap/imap_lib/
H A DResponse.cpp656 size_t number = strtoul(string.String(), (char**)&end, 10); local
658 throw ParseException("Invalid number!");
660 return number;
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DBlockCache.cpp122 BlockCache::GetBlock(uint64 number, Block **result) argument
125 if (!result || number >= fBlockCount)
132 Block *block = _FindBlock(number);
135 error = _ReadBlock(number, &block);
166 BlockCache::_FindBlock(uint64 number) argument
169 if (block->GetNumber() == number)
177 BlockCache::_ReadBlock(uint64 number, Block **result) argument
186 status_t error = block->_SetTo(this, number);
198 BlockCache::_GetBlock(off_t number) const
201 return const_cast<void*>(block_cache_get(fCacheHandle, number));
206 _ReleaseBlock(off_t number, void *data) const argument
[all...]
H A DBlock.cpp179 Block::_SetTo(BlockCache *cache, uint64 number) argument
186 fNumber = number;
246 /*! \brief Returns the number of child "items" the node contains/refers to.
248 If the node is a leaf node, this number is indeed the number of the
249 items it contains. For internal node it is the number of keys, as oposed
250 to the number of child nodes, which is CountItems() + 1.
252 \return The number of child "items" the node contains/refers to.
/haiku/headers/posix/
H A Dresolv.h67 int number; /* Identifying number, like T_MX */ member in struct:res_sym
80 #define MAXRESOLVSORT 10 /* number of net to sort on */
89 int retry; /* number of times to retransmit */
91 int nscount; /* number of name servers */
99 unsigned nsort:4; /* number of elements in sort_list[] */
/haiku/src/system/libroot/posix/
H A Dinttypes.c12 imaxabs(intmax_t number) argument
14 return number > 0 ? number : -number;
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DHTreeEntryIterator.cpp402 uint32 number = fDirectory->ID(); local
404 (uint8*)&number, sizeof(number));
/haiku/src/add-ons/kernel/partitioning_systems/session/
H A DDisc.cpp18 number \c 0x43.
21 number \c 0x2.
141 TRACE((" number = %d\n", scsi_command->number));
259 scsi_command.number = first_session;
890 // Anything else had better be a valid track number,
/haiku/src/add-ons/kernel/file_systems/cdda/
H A Dcdda.cpp23 uint8 number; member in struct:cdtext_pack_data
348 track number will be left in \a track, and the type of the data in \a id.
362 uint8 number = pack->number;
391 dprintf("%u.%u.%u, %u.%u.%u, ", pack->id, pack->track, pack->number,
414 number++;
417 if (pack->number != number)
/haiku/src/tests/system/network/tcptester/
H A Dtcptester.cpp36 number(context *ctx) function
55 int upper, lower = number(ctx);
58 upper = number(ctx);
67 return number(ctx);
74 int max, saved, count = number(ctx);
137 int value = number(ctx);
/haiku/src/system/libroot/posix/glibc/arch/sparc/
H A Dlshift.S39 andcc %o2,4-1,%g4 ! number of limbs in first loop
H A Drshift.S36 andcc %o2,4-1,%g4 ! number of limbs in first loop

Completed in 203 milliseconds

123456