Searched refs:run (Results 51 - 75 of 79) sorted by path

1234

/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBlockAllocator.h36 block_run& run);
38 off_t numBlocks, block_run& run,
40 status_t Free(Transaction& transaction, block_run run);
44 uint16 minimum, block_run& run);
52 status_t CheckBlockRun(block_run run,
55 bool IsValidBlockRun(block_run run,
H A DCachedBlock.h35 inline status_t SetTo(block_run run);
42 block_run run, bool empty = false);
131 CachedBlock::SetTo(block_run run) argument
133 return SetTo(fVolume->ToBlock(run));
163 CachedBlock::SetToWritable(Transaction& transaction, block_run run, bool empty) argument
165 return SetToWritable(transaction, fVolume->ToBlock(run), empty);
H A DCheckVisitor.cpp27 block_run run; member in struct:check_index
191 FATAL(("CheckVisitor didn't run through\n"));
316 index->run = inode->BlockRun();
380 // Iterating over the B+tree failed - we let the checkfs run
524 status = _CheckAllocated(runs[index], "indirect->run");
587 "double indirect->runs->run");
606 CheckVisitor::_CheckAllocated(block_run run, const char* type) argument
610 // make sure the block run is valid
611 if (!allocator.IsValidBlockRun(run, type)) {
618 off_t start = GetVolume()->ToBlock(run);
[all...]
H A DDebug.cpp36 dump_block_run(const char* prefix, const block_run& run) argument
38 kprintf("%s(%d, %d, %d)\n", prefix, (int)run.allocation_group, run.start,
39 run.length);
253 block_run run = volume->ToBlockRun(offset); local
254 kprintf(" (%d, %d)", (int)run.allocation_group, run.start);
318 kprintf("usage: bfs <ptr-to-volume> [<block-run>]\n"
319 "Dumps a BFS volume - <block-run> is given, it is converted to a "
332 block_run run; local
346 block_run run = volume->ToBlockRun(offset); local
[all...]
H A DDebug.h93 extern void dump_block_run(const char *prefix, const block_run &run);
H A DInode.cpp147 block_run& run, fs_vnode_ops* vnodeOps,
195 block_run& run, fs_vnode_ops* vnodeOps, Inode** _inode)
208 run = fRun;
210 volume->ToVnode(run), mode, run);
374 block_run& run)
404 Node().inode_num = run;
1472 Inode::FindBlockRun(off_t pos, block_run& run, off_t& offset) argument
1476 // find matching block run
1510 run
194 New(block_run* parentRun, mode_t mode, uint32 publishFlags, block_run& run, fs_vnode_ops* vnodeOps, Inode** _inode) argument
373 Inode(Volume* volume, Transaction& transaction, ino_t id, mode_t mode, block_run& run) argument
1694 _AllocateBlockArray(Transaction& transaction, block_run& run, size_t length, bool variableSize) argument
1811 block_run run; local
2079 _FreeStaticStreamArray(Transaction& transaction, int32 level, block_run run, off_t size, off_t offset, off_t& max) argument
2170 block_run run = array[i]; local
2717 block_run run; local
[all...]
H A DInode.h36 ino_t id, mode_t mode, block_run& run);
145 status_t FindBlockRun(off_t pos, block_run& run,
244 int32 level, block_run run, off_t size,
250 block_run& run, size_t length,
380 Vnode(Volume* volume, block_run run) argument
384 SetTo(volume, run);
420 status_t SetTo(Volume* volume, block_run run) argument
422 return SetTo(volume, volume->ToVnode(run));
H A DJournal.cpp24 void Insert(block_run& run);
35 int32 _FindInsertionIndex(block_run& run);
56 bool _ContainsRun(block_run& run);
57 bool _AddRun(block_run& run);
189 This makes a freshly allocated run_array ready to run.
204 run_array::Insert(block_run& run) argument
206 int32 index = _FindInsertionIndex(run);
209 runs[CountRuns()] = run;
214 runs[index] = run;
245 run_array::_FindInsertionIndex(block_run& run) argument
299 _ContainsRun(block_run& run) argument
325 _AddRun(block_run& run) argument
365 block_run run = volume->ToBlockRun(blockNumber); local
504 const block_run& run = array->RunAt(index); local
534 const block_run& run = array->RunAt(index); local
820 const block_run& run = array->RunAt(i); local
859 const block_run& run = array->RunAt(i); local
[all...]
H A DVolume.cpp320 Volume::ValidateBlockRun(block_run run) argument
322 if (run.AllocationGroup() < 0
323 || run.AllocationGroup() > (int32)AllocationGroups()
324 || run.Start() > (1UL << AllocationGroupShift())
325 || run.length == 0
326 || uint32(run.Length() + run.Start())
329 FATAL(("*** invalid run(%d,%d,%d)\n", (int)run.AllocationGroup(),
330 run
340 block_run run; local
390 AllocateForInode(Transaction& transaction, const Inode* parent, mode_t type, block_run& run) argument
[all...]
H A Dkernel_interface.cpp539 block_run run; local
545 status_t status = inode->FindBlockRun(offset, run, fileOffset);
549 vecs[index].offset = volume->ToOffset(run) + offset - fileOffset;
550 vecs[index].length = ((uint32)run.Length() << blockShift)
807 block_run run; local
808 while (allocator.AllocateBlocks(transaction, 8, 0, 64, 1, run)
811 ", %" B_PRIu16 ")\n", run.allocation_group, run.start,
812 run.length));
814 for (int32 i = 0;i < run
[all...]
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dlcnalloc.c118 int i, j, run = 0; local
130 run += 8;
135 if (run > max_range) {
136 max_range = run;
137 start_pos = (s64)i * 8 - run;
139 run = 0;
151 if (run > max_range) {
152 max_range = run;
153 start_pos = (s64)i * 8 + (j - run);
155 run
[all...]
/haiku/src/add-ons/translators/rtf/
H A Dconvert.cpp276 copy_text_run(text_run *run) argument
284 if (run != NULL) {
285 newRun->offset = run->offset;
286 newRun->font = run->font;
287 newRun->color = run->color;
299 dump_text_run(text_run *run)
301 if (run == NULL)
304 printf("run: offset = %ld, color = {%d,%d,%d}, font = ",
305 run->offset, run
363 text_run *run = (text_run *)fRuns.RemoveItem((int32)0); local
377 PrepareTextRun(text_run *run) argument
[all...]
/haiku/src/apps/icon-o-matic/import_export/styled_text/
H A DStyledTextImporter.cpp283 // import run colors as styles
293 text_run *run = NULL; local
295 run = &runs->runs[0];
302 // make sure we are still on the (good) run
303 while (run && currentRun < runs->count - 1 &&
305 run = &runs->runs[++currentRun];
306 //printf("switching to run %d\n", currentRun);
315 if (run)
316 font = run->font;
356 for (int j = 0; run
382 _AddStyle(Icon *icon, text_run *run) argument
429 _AddShape(Icon *icon, BShape *shape, text_run *run) argument
[all...]
H A DStyledTextImporter.h26 text_run *run; member in struct:style_map
48 status_t _AddStyle(Icon *icon, text_run *run);
50 status_t _AddShape(Icon *icon, BShape *shape, text_run *run);
/haiku/src/apps/poorman/
H A DPoorManWindow.cpp253 text_run run; local
256 run.offset = 0;
257 run.color = color;
260 runs.runs[0] = run;
/haiku/src/bin/bfs_tools/
H A Dbfswhich.cpp151 block_run run; local
152 while (directory->GetNextEntry(name, &run) == B_OK) {
159 Inode *inode = Inode::Factory(&disk, run);
174 name, run.allocation_group, run.start);
211 testBitmap(Disk& disk, const block_run& run) argument
220 printf("Block bitmap sees block %lld as %s.\n", disk.ToBlock(run),
221 bitmap.UsedAt(disk.ToBlock(run)) ? "used" : "free");
300 block_run run = parseBlockRun(disk, argv[1], argv[2]); local
301 off_t block = disk.ToBlock(run);
[all...]
H A Dchkindex.cpp44 bool Contains(block_run *run) argument
46 return ContainsKey((void *)run);
49 bool Put(block_run &run) argument
55 memcpy(value,&run,sizeof(block_run));
64 static uint32 BlockRunHash(const block_run *run) argument
66 return run->allocation_group << 16 | run->start;
97 block_run run; local
98 while (directory->GetNextEntry(name,&run) >= B_OK)
103 gHashtable.Put(run);
154 block_run run = disk.ToBlockRun(offset); local
198 block_run *run = NULL; local
365 checkIndex(Disk &disk,char *attribute,block_run &run,bool collect) argument
502 block_run run; local
[all...]
H A Drecover.cpp71 Inode* Get(block_run run) argument
73 return Acquire((Inode *)fHashtable.GetValue(&run));
121 static uint32 BlockRunHash(const block_run *run) argument
123 return (run->allocation_group << 16) | run->start;
140 InodeGetter(Disk& disk, block_run run) argument
142 fInode = Inode::Factory(&disk, run);
184 virtual Inode *InodeAt(block_run run) argument
187 if ((inode = gLogged.Get(run)) != NULL)
190 if ((inode = gMissing.Get(run)) !
325 block_run run; local
356 block_run run; local
457 block_run run = node->Parent(); local
619 block_run run; local
664 block_run run; local
[all...]
/haiku/src/bin/bfs_tools/lib/
H A DInode.cpp235 Inode::SetParent(const block_run& run) argument
237 fInode->parent = run;
243 Inode::SetBlockRun(const block_run& run) argument
245 fInode->inode_num = run;
246 fBlockRun = run;
399 block_run run;
400 status = fAttributes->GetNextEntry(name, &run);
407 Attribute *attribute = (Attribute *)Inode::Factory(fDisk, run);
571 Inode::Factory(Disk *disk, block_run run) argument
577 if (disk->ReadAt(disk->ToOffset(run), inod
1130 GetNextEntry(char *name, block_run *run) argument
1152 GetNextEntry(block_run *run) argument
1161 Contains(const block_run *run) argument
1210 FindEntry(const char *name, block_run *run) argument
[all...]
H A Dbfs.h25 inline bool operator==(const block_run &run) const;
26 inline bool operator!=(const block_run &run) const;
197 inline bool block_run::operator==(const block_run &run) const
199 return allocation_group == run.allocation_group
200 && start == run.start
201 && length == run.length;
204 inline bool block_run::operator!=(const block_run &run) const
206 return allocation_group != run.allocation_group
207 || start != run.start
208 || length != run
225 block_run run; local
[all...]
H A Ddump.cpp40 dump_block_run(const char *prefix, const block_run &run, const char *postfix) argument
42 Print("%s(%" B_PRId32 ", %d, %d)%s\n", prefix, run.allocation_group,
43 run.start, run.length, postfix);
270 block_run run = disk->ToBlockRun(offset); local
271 Print(" (%" B_PRId32 ", %d)", run.allocation_group, run.start);
/haiku/src/bin/
H A Dleak_analyser.sh14 To generate such a file run a program with the following
/haiku/src/kits/mail/
H A Dmail_util.cpp650 struct word *run; local
655 for (int32 g = i+1; (run = (struct word *) words.ItemAt (g)) != NULL; g++) {
656 if (!run->needsEncoding)
658 if ((currentWord->convertedWord.Length() + run->convertedWord.Length() <= 53)) {
659 currentWord->originalWord.Append (run->originalWord);
662 delete run;
/haiku/src/system/boot/loader/file_systems/bfs/
H A DStream.cpp27 CachedBlock(Volume& volume, block_run run);
30 uint8* SetTo(block_run run);
57 CachedBlock::CachedBlock(Volume &volume, block_run run) argument
63 SetTo(run);
101 CachedBlock::SetTo(block_run run) argument
103 return SetTo(fVolume.ToBlock(run));
110 Stream::Stream(Volume& volume, block_run run) argument
114 if (read_pos(volume.Device(), volume.ToOffset(run), this, sizeof(bfs_inode))
198 Stream::FindBlockRun(off_t pos, block_run& run, off_t& offset) argument
200 // find matching block run
312 block_run run; local
[all...]
/haiku/src/system/kernel/vm/
H A Dvm_page.cpp337 out.Print("page alloc run: start %#" B_PRIxPHYSADDR " length: %"
1157 kprintf("longest free pages run: %" B_PRIuPHYSADDR " pages (at %"
1160 kprintf("longest free/cached pages run: %" B_PRIuPHYSADDR " pages (at %"
1953 void SetTo(PageWriterRun* run, vm_page* page, int32 maxPages);
2111 PageWriteTransfer::SetTo(PageWriterRun* run, vm_page* page, int32 maxPages) argument
2113 fRun = run;
2345 PageWriterRun run; local
2346 if (run.Init(kNumPages) != B_OK) {
2392 run.PrepareNextRun();
2458 run
[all...]

Completed in 279 milliseconds

1234