/haiku/src/apps/debuganalyzer/gui/chart/ |
H A D | ChartLegend.cpp | 12 ChartLegend::ChartLegend(int32 level) argument 14 fLevel(level)
|
/haiku/src/tests/system/kernel/device_manager/ |
H A D | listdev.c | 14 put_level(int32 level) argument 16 while (level-- > 0) 22 dump_attribute(struct dev_attr *attr, int32 level) argument 27 put_level(level); 52 dump_device(uint8 level) argument 61 dump_attribute(&attr, level); 67 dump_nodes(uint8 level) argument 70 dump_device(level); 76 dump_nodes(level+1);
|
/haiku/headers/private/kernel/ |
H A D | debug_paranoia.h | 56 # define PARANOIA_ONLY_LEVEL(level, x) \ 57 if ((level) <= (COMPONENT_PARANOIA_LEVEL)) { \ 62 # define PARANOIA_ONLY_LEVEL(level, x) 72 #define ADD_PARANOIA_CHECK(level, object, address, size) \ 73 PARANOIA_ONLY_LEVEL((level), \ 76 #define UPDATE_PARANOIA_CHECK(level, object, address, size) \ 77 PARANOIA_ONLY_LEVEL((level), \ 80 #define SET_PARANOIA_CHECK(level, object, address, size) \ 81 PARANOIA_ONLY_LEVEL((level), \ 84 #define REMOVE_PARANOIA_CHECK(level, objec [all...] |
/haiku/src/bin/pkgman/ |
H A D | CommonOptions.h | 25 void SetDebugLevel(int level) argument 26 { fDebugLevel = level; }
|
/haiku/src/tests/add-ons/print/ppd/test/ |
H A D | TestParser.cpp | 71 void ExtractChildren(StatementList* list, int level); 73 void Indent(int level) argument 75 for (; level > 0; level --) { 80 void PrintValue(const char* label, Value* arg, int level) argument 82 Indent(level); 104 bool ExtractGroup(Statement* statement, int level) argument 109 Indent(level); 118 ExtractChildren(statement->GetChildren(), level+1); 124 void ExtractChildren(StatementList* list, int level) argument [all...] |
/haiku/src/kits/storage/disk_device/ |
H A D | DiskDevicePrivate.cpp | 42 PartitionFilterVisitor::Visit(BPartition *partition, int32 level) argument 44 if (fFilter->Filter(partition, level)) 45 return fVisitor->Visit(partition, level); 70 IDFinderVisitor::Visit(BPartition *partition, int32 level) argument
|
H A D | DiskDeviceVisitor.cpp | 65 \param level The level of the partition in the partition tree. 70 BDiskDeviceVisitor::Visit(BPartition *partition, int32 level) argument
|
/haiku/src/bin/listdev/ |
H A D | listdev.cpp | 75 put_level(int32 level) argument 77 while (level-- > 0) 83 dump_attribute(struct device_attr_info *attr, int32 level) argument 88 put_level(level); 118 dump_device(device_node_cookie *node, uint8 level) argument 127 put_level(level); 128 printf("(%d)\n", level); 130 dump_attribute(&attr, level); 136 dump_nodes(device_node_cookie *node, uint8 level) argument 140 dump_device(node, level); 153 display_device(device_node_cookie *node, uint8 level) argument 348 display_nodes(device_node_cookie *node, uint8 level) argument [all...] |
/haiku/src/add-ons/kernel/debugger/qrencode/ |
H A D | qrspec.h | 39 * @param level 42 extern int QRspec_getDataLength(int version, QRecLevel level); 47 * @param level 50 extern int QRspec_getECCLength(int version, QRecLevel level); 55 * @param level 58 extern int QRspec_getMinimumVersion(int size, QRecLevel level); 101 * @param level 106 void QRspec_getEccSpec(int version, QRecLevel level, int spec[5]); 141 * @param level 144 extern unsigned int QRspec_getFormatInfo(int mask, QRecLevel level); [all...] |
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | logging.c | 194 * @level: Log level 202 static FILE * ntfs_log_get_stream(u32 level) argument 206 switch (level) { 233 * @level: Log level to be prefixed 239 static const char * ntfs_log_get_prefix(u32 level) argument 243 switch (level) { 307 * @level: Level at which the line is logged 320 int line, u32 level, voi 319 ntfs_log_redirect(const char *function, const char *file, int line, u32 level, void *data, const char *format, ...) argument 361 ntfs_log_handler_syslog(const char *function __attribute__((unused)), const char *file __attribute__((unused)), int line __attribute__((unused)), u32 level, void *data __attribute__((unused)), const char *format, va_list args) argument 444 ntfs_log_handler_fprintf(const char *function, const char *file, int line, u32 level, void *data, const char *format, va_list args) argument 557 ntfs_log_handler_stdout(const char *function, const char *file, int line, u32 level, void *data, const char *format, va_list args) argument 590 ntfs_log_handler_outerr(const char *function, const char *file, int line, u32 level, void *data, const char *format, va_list args) argument 622 ntfs_log_handler_stderr(const char *function, const char *file, int line, u32 level, void *data, const char *format, va_list args) argument [all...] |
/haiku/headers/private/storage/ |
H A D | DiskDevicePrivate.h | 25 virtual bool Filter(BPartition *partition, int32 level) = 0; 35 virtual bool Visit(BPartition *partition, int32 level); 48 virtual bool Visit(BPartition *partition, int32 level);
|
H A D | DiskDeviceVisitor.h | 22 virtual bool Visit(BPartition *partition, int32 level);
|
/haiku/src/tests/system/libroot/posix/ |
H A D | signal_in_allocator_test2.cpp | 43 allocator_thread(int level) argument 45 if (level > 100000) 50 allocator_thread(level + 1);
|
/haiku/src/system/boot/platform/efi/arch/arm64/ |
H A D | arch_mmu.h | 26 * 1, Table The descriptor gives the address of the next level of 206 uint16 DescriptorIndex(addr_t virt_addr, uint8 level) { argument 207 return (virt_addr >> fRegime[level].shift) & fRegime[level].mask; 210 bool BlocksAllowed(uint8 level) { argument 211 return fRegime[level].blocks; 214 bool TablesAllowed(uint8 level) { argument 215 return fRegime[level].tables; 218 bool PagesAllowed(uint8 level) { argument 219 return fRegime[level] 222 Mask(uint8 level) argument 226 Aligned(addr_t address, uint8 level) argument 230 EntrySize(uint8 level) argument 234 TableSize(uint8 level) argument [all...] |
/haiku/src/tests/system/kernel/file_corruption/fs/ |
H A D | Directory.cpp | 97 int32 level, const char* name, 103 status_t _InsertEntrySplitBlock(int32 level, 108 bool _Check(int32 level, uint64 blockIndex, 568 for (uint32 level = 0; level <= depth; level++) { 570 RETURN_ERROR(level == 0 ? B_ENTRY_NOT_FOUND : B_BAD_DATA); 588 PRINT(" level %" B_PRId32 " -> index: %" B_PRId32 " %sexact\n", level, 593 if (level 693 int32 level; local 1006 int32 level = 0; local 1104 _UpdateOrInsertKey(LevelInfo* infos, int32 level, const char* name, size_t nameLength, uint64 blockIndex, bool insertKey, Transaction& transaction) argument [all...] |
H A D | File.cpp | 56 // this level 328 // get the level infos 357 PRINT(" preparing level %" B_PRId32 ": index: %" B_PRId32 363 int32 level = depth - 1; local 367 LevelInfo& info = infos[level]; 371 PRINT(" level: %" B_PRId32 ": index: %" B_PRId32 " -> back " 372 "tracking\n", level, info.index); 374 level--; 375 infos[level].index++; 381 PRINT(" level 504 int32 level = 0; local 655 int32 level = depth - 1; local [all...] |
/haiku/headers/posix/ |
H A D | ftw.h | 28 int level; member in struct:FTW
|
/haiku/src/system/kernel/arch/arm64/ |
H A D | VMSAv8TranslationMap.cpp | 57 int level = 4; local 63 level--; 66 ASSERT(level >= 0); 68 return level; 125 VMSAv8TranslationMap::MakeBlock(phys_addr_t pa, int level, uint64_t attr) argument 127 ASSERT(level >= fMinBlockLevel && level < 4); 129 return pa | attr | (level == 3 ? 0x3 : 0x1); 134 VMSAv8TranslationMap::FreeTable(phys_addr_t ptPa, int level) argument 136 ASSERT(level < [all...] |
H A D | VMSAv8TranslationMap.h | 92 uint64_t MakeBlock(phys_addr_t pa, int level, uint64_t attr); 93 void FreeTable(phys_addr_t ptPa, int level); 94 phys_addr_t MakeTable(phys_addr_t ptPa, int level, int index, vm_page_reservation* reservation); 95 void MapRange(phys_addr_t ptPa, int level, addr_t va, phys_addr_t pa, size_t size, 97 bool WalkTable(phys_addr_t ptPa, int level, addr_t va, phys_addr_t* pa, uint64_t* attr);
|
/haiku/src/apps/activitymonitor/ |
H A D | SettingsWindow.cpp | 71 const char* _TextFor(uint32 level) const 73 if (level >= kNumUpdateIntervals) 76 bigtime_t interval = kUpdateIntervals[level]; 125 int32 level = 0; local 126 if (message->FindInt32("be:value", &level) != B_OK) 130 update.AddInt64("interval", kUpdateIntervals[level] * 1000LL);
|
/haiku/src/apps/sudoku/ |
H A D | SudokuWindow.h | 36 void _Generate(int32 level); 38 void _SetLevel(int32 level);
|
/haiku/src/tests/add-ons/print/ppd/ui/ |
H A D | PPDConfigView.h | 24 CategoryItem(const char* text, Statement* statement, uint32 level) argument 25 : BStringItem(text, level)
|
/haiku/src/add-ons/kernel/network/ppp/shared/libkernelppp/ |
H A D | KPPPLayer.cpp | 11 level that is used to determine the order at which the packets get encapsulated 33 KPPPLayer::KPPPLayer(const char *name, ppp_level level, uint32 overhead) argument 37 fLevel(level),
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | BTree.cpp | 322 BTree::Path::GetNode(int level, int* _slot) const argument 325 *_slot = fSlots[level]; 326 return fNodes[level]; 341 uint8 level = node->Level(); local 342 if (fNodes[level] == NULL) { 343 fNodes[level] = new Node(fTree->SystemVolume(), node->BlockNum()); 344 if (fNodes[level] == NULL) 347 fNodes[level]->SetTo(node->BlockNum()); 350 fSlots[level] = fNodes[level] 358 Move(int level, int step) argument 412 CopyOnWrite(Transaction& transaction, int level, uint32 start, int num, int length) argument 475 InternalCopy(Transaction& transaction, int level) argument 764 int level = 0; local 803 int level = 0; local [all...] |
/haiku/src/kits/shared/ |
H A D | ColorQuantizer.cpp | 152 uint32 bitsPerColor, uint32 level, uint32* _leafCount, 160 *_node = _CreateNode(level, bitsPerColor, _leafCount, reducibleNodes); 170 // Recurse a level deeper if the node is not a leaf. 171 int shift = 7 - level; 172 int index = (((r & kMask[level]) >> shift) << 2) | 173 (((g & kMask[level]) >> shift) << 1) | 174 (( b & kMask[level]) >> shift); 176 level + 1, _leafCount, reducibleNodes); 182 BColorQuantizer::_CreateNode(uint32 level, uint32 bitsPerColor, argument 190 node->isLeaf = (level 151 _AddColor(Node** _node, uint8 r, uint8 g, uint8 b, uint8 a, uint32 bitsPerColor, uint32 level, uint32* _leafCount, Node** reducibleNodes) argument [all...] |