| /haiku/src/kits/interface/layouter/ |
| H A D | LayoutOptimizer.cpp | 58 we enter the next iteration, i.e. by computing a new optimal solution with
440 // for the next iteration
728 // The main loop: Each iteration we try to get closer to the optimum
731 // W^k. Afterward each iteration we adjust the active set.
732 TRACE_ONLY(int iteration = 0;)
735 TRACE("\n[iteration %d]\n", iteration++);
|
| /haiku/src/libs/linprog/ |
| H A D | LayoutOptimizer.cpp | 72 we enter the next iteration, i.e. by computing a new optimal solution with
418 // for the next iteration
695 // The main loop: Each iteration we try to get closer to the optimum
698 // W^k. Afterward each iteration we adjust the active set.
699 TRACE_ONLY(int iteration = 0;)
702 TRACE("\n[iteration %d]\n", iteration++);
|
| /haiku/src/system/kernel/arch/x86/32/ |
| H A D | apm.cpp | 195 apm_daemon(void *arg, int iteration) argument
|
| /haiku/src/tests/system/kernel/ |
| H A D | mtrr_power_test.c | 28 find_nearest(uint64 value, int iteration) argument
30 if (iteration > 4 || (iteration + 1) >= solCount)
35 props[iteration] = down;
37 for (i=0; i<=iteration; i++)
39 solCount = iteration + 1;
42 find_nearest(value - down, iteration + 1);
43 props[iteration] = -up;
45 for (i=0; i<=iteration; i++)
47 solCount = iteration
[all...] |
| /haiku/src/tests/system/kernel/unit/lock/ |
| H A D | RWLockTests.cpp | 173 uint64 iteration = 0; local
186 "thread index: %" B_PRId32 ", iteration: %" B_PRId32
188 iteration, value, k, count);
195 iteration++;
213 uint64 iteration = 0; local
228 "thread index: %" B_PRId32 ", iteration: %" B_PRId32
230 iteration, value, k, count);
237 iteration++;
254 uint64 iteration = 0; local
275 "thread index: %" B_PRId32 ", iteration
[all...] |
| /haiku/headers/os/drivers/ |
| H A D | KernelExport.h | 135 typedef void (*daemon_hook)(void *arg, int iteration);
|
| /haiku/src/add-ons/kernel/drivers/network/ether/ipro1000/dev/e1000/ |
| H A D | e1000_ich8lan.c | 4732 s32 j, iteration, sector_size; local
4754 iteration = flash_bank_size / ICH_FLASH_SEG_SIZE_256;
4758 iteration = 1;
4762 iteration = 1;
4766 iteration = 1;
4776 for (j = 0; j < iteration; j++) {
5341 /* Set the mac to wait the maximum time between each iteration
|
| /haiku/src/add-ons/kernel/file_systems/fat/ |
| H A D | dir.cpp | 521 dir->iteration++;
685 dir->iteration++;
998 entry->iteration = 0;
|
| H A D | dosfs.cpp | 101 kprintf("iteration %" B_PRIu32 ", si=%" B_PRIu32 ", ei=%" B_PRIu32
102 ", cluster=%" B_PRIu32 "\n", n->iteration, n->sindex, n->eindex,
|
| H A D | dosfs.h | 68 /* iteration is incremented each time the fat chain changes. it's used by
72 uint32 iteration; member in struct:vnode
|
| H A D | encodings.cpp | 1283 status_t munge_short_name1(uchar nshort[11], int iteration, int encoding) argument
1288 return munge_short_name_english(nshort, iteration);
1290 return munge_short_name_sjis(nshort, iteration);
|
| H A D | encodings.h | 25 status_t munge_short_name1(uchar nshort[11], int iteration, int encoding);
|
| H A D | file.cpp | 262 node->iteration++;
344 node->iteration++;
449 node->iteration++;
578 file->iteration++;
|
| /haiku/src/add-ons/kernel/generic/scsi_periph/ |
| H A D | io.cpp | 506 periph_sync_queue_daemon(void *arg, int iteration) argument
|
| H A D | scsi_periph_int.h | 116 void periph_sync_queue_daemon(void *arg, int iteration);
|
| /haiku/src/add-ons/translators/raw/ |
| H A D | LibRAW.cpp | 346 LibRAW::ProgressCallback(void *data, enum LibRaw_progress p, int iteration, argument
349 return ((LibRAW*)data)->_ProgressCallback(p, iteration, expected);
354 LibRAW::_ProgressCallback(enum LibRaw_progress p,int iteration, int expected) argument
356 fProgressMonitor(libraw_strprogress(p), iteration * 100 / expected,
|
| H A D | LibRAW.h | 88 int iteration, int expected);
90 int iteration, int expected);
|
| /haiku/src/system/kernel/ |
| H A D | heap.cpp | 2004 deferred_deleter(void *arg, int iteration) argument
|
| H A D | module.cpp | 250 static void HandleNotifications(void *data, int iteration);
923 // prevent from falling into modules hash iteration again
1695 int /*iteration*/)
1879 // hash at the end. We can't do that during the iteration.
|