| /haiku/src/system/runtime_loader/ |
| H A D | elf_versioning.cpp | 60 // version index from the defined and needed versions (they use the same
83 elf_verneed* needed = image->needed_versions; local
85 if (needed->vn_version != 1) {
86 FATAL("%s: Unsupported version needed revision: %u\n",
87 image->path, needed->vn_version);
92 = (elf_vernaux*)((uint8*)needed + needed->vn_aux);
93 for (uint32 k = 0; k < needed->vn_cnt; k++) {
101 needed = (elf_verneed*)((uint8*)needed
144 elf_verneed* needed = image->needed_versions; local
[all...] |
| H A D | elf_symbol_lookup.cpp | 276 // push needed images
278 image_t* needed = image->needed[i]; local
279 if ((needed->flags & RFLAG_VISITED) == 0) {
280 queue[count++] = needed;
281 needed->flags |= RFLAG_VISITED;
334 if (image->needed[i]->dynamic_ptr) {
335 symbol = find_symbol(image->needed[i], lookupInfo);
337 *foundInImage = image->needed[i];
|
| H A D | images.cpp | 140 image_t* needed = image->needed[i]; local
141 if ((needed->flags & RFLAG_VISITED) == 0) {
142 queue[count++] = needed;
143 needed->flags |= RFLAG_VISITED;
165 slot = topological_sort(image->needed[i], slot, initList, sortFlag);
236 memset(image->needed, 0xa5, sizeof(image->needed[0]) * image->num_needed);
238 free(image->needed);
287 put_image(image->needed[
[all...] |
| H A D | elf.cpp | 182 image->needed = (image_t**)malloc(image->num_needed * sizeof(image_t *));
183 if (image->needed == NULL) {
184 FATAL("%s: Failed to allocate needed struct\n", image->path);
190 memset(image->needed, 0, image->num_needed * sizeof(image_t *));
192 preload_images(image->needed);
205 rpath, runpath, image->path, &image->needed[j]);
268 // Check the needed versions for the given image and all newly loaded
1227 // initialize error message if needed
|
| /haiku/src/system/libroot/posix/glibc/libio/ |
| H A D | vasprintf.c | 47 _IO_size_t needed; local
69 needed = sf._sbf._f._IO_write_ptr - sf._sbf._f._IO_write_base + 1;
71 if ((allocated << 1) <= needed)
72 *result_ptr = (char *) realloc (sf._sbf._f._IO_buf_base, needed);
75 *result_ptr = (char *) malloc (needed);
78 memcpy (*result_ptr, sf._sbf._f._IO_buf_base, needed - 1);
83 *result_ptr = (char *) realloc (sf._sbf._f._IO_buf_base, needed);
87 (*result_ptr)[needed - 1] = '\0';
|
| H A D | iogetdelim.c | 85 _IO_size_t needed; local
91 needed = cur_len + len + 1;
92 if (needed > *n)
96 if (needed < 2 * *n)
97 needed = 2 * *n; /* Be generous. */
98 new_lineptr = (char *) realloc (*lineptr, needed);
105 *n = needed;
|
| H A D | genops.c | 548 /* Seems not to be needed. --drepper */
759 /* Seems not to be needed. */
799 /* Seems not to be needed. --drepper */
996 if _sbuf has a backup area that is no longer needed, should we delete
1079 /* Seems not to be needed. --drepper */
|
| /haiku/src/bin/ |
| H A D | chop.c | 189 ssize_t needed; // how many bytes we can safely write to the current output file local
223 needed = chunk_size - curr_written;
225 if (needed > avail)
226 needed = avail;
228 if (needed > 0) {
229 put = write(fdout, beg, needed);
|
| /haiku/src/servers/midi/ |
| H A D | PortDrivers.cpp | 84 size_t needed = 0; local
148 needed = 2;
155 needed = 1;
176 needed = 2;
182 needed = 1;
186 } else if (needed > 0) {
189 if (--needed == 0) {
245 needed = msgSize - 2;
|
| /haiku/src/libs/stdc++/legacy/ |
| H A D | stream.cc | 59 int needed = size ? size local
62 if (space_left <= needed)
67 register char* ptr = buf+needed+1;
70 if (needed < (2+neg) || ptr > EndBuffer)
|
| /haiku/src/system/libroot/os/arch/generic/ |
| H A D | generic_stack_trace.cpp | 53 #error Implementation needed for upwards growing stacks
|
| /haiku/src/kits/package/solver/libsolv/ |
| H A D | LibsolvSolver.cpp | 912 uint32 needed = 0; local
918 needed = NEED_SOURCE;
922 needed = NEED_SOURCE;
926 needed = NEED_SOURCE;
933 needed = NEED_DEPENDENCY;
938 needed = NEED_DEPENDENCY;
945 needed = NEED_SOURCE;
949 needed = NEED_SOURCE | NEED_DEPENDENCY;
953 needed = NEED_SOURCE | NEED_TARGET;
957 needed
[all...] |
| /haiku/headers/private/kernel/ |
| H A D | elf_priv.h | 43 char* needed; member in struct:elf_image_info
|
| /haiku/src/system/kernel/ |
| H A D | elf.cpp | 533 kprintf(" needed %p\n", image->needed);
811 image->needed = STRING(image, neededOffset);
862 // version index from the defined and needed versions (they use the same
884 BytePointer<elf_verneed> needed(image->needed_versions);
886 if (needed->vn_version != 1) {
887 dprintf("Unsupported version needed revision: %u\n",
888 needed->vn_version);
892 BytePointer<elf_vernaux> vernaux(needed + needed
[all...] |
| H A D | team.cpp | 3590 size_t needed = ROUNDUP(sizeof(user_thread), CACHE_LINE_SIZE); local
3591 if (team->user_data_size - team->used_user_data < needed) {
3607 team->used_user_data += needed;
3783 // determine total needed size
4480 // allocate memory for a copy of the needed team data
4546 // copy the needed size and, if it fits, the message back to userland
|
| /haiku/src/system/kernel/debug/ |
| H A D | tracing.cpp | 109 bool _MakeSpace(size_t needed);
360 /*! Makes sure we have needed * 4 bytes of memory at fAfterLastEntry.
364 TracingMetaData::_MakeSpace(size_t needed) argument
368 needed++;
372 if (fAfterLastEntry + needed > fBuffer + kBufferSize) {
373 TRACE(("_MakeSpace(%lu), wrapping around: after last: %p\n", needed,
405 if (space < needed) {
406 TRACE(("_MakeSpace(%lu), left %ld\n", needed, space));
409 while (space < needed) {
|
| /haiku/headers/private/runtime_loader/ |
| H A D | runtime_loader.h | 87 const char *file_name; // dependency file name (needed versions only)
130 struct image_t **needed; member in struct:image_t
|
| /haiku/src/tests/system/kernel/file_corruption/fs/ |
| H A D | Directory.cpp | 104 LevelInfo& info, size_t needed,
1401 size_t needed, Transaction& transaction, Block& newBlock,
1405 needed);
1407 FUNCTION("level: %" B_PRId32 ", size needed: %" B_PRIuSIZE ", split index: "
1408 "%" B_PRId32 "/%" B_PRId32 "\n", level, needed, splitIndex,
|
| /haiku/3rdparty/mmu_man/onlinedemo/ |
| H A D | haiku.php | 728 //not needed
|
| /haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
| H A D | attrib.c | 235 * needed size, knowing that the whole attribute
659 VCN needed; local
677 needed = vcn;
686 needed, NULL, 0, ctx)) {
690 if (ntfs_rl_vcn_to_lcn(na->rl, needed)
700 if (highest_vcn < needed) {
710 needed = highest_vcn + 1;
717 } while (rl && !done && (needed < last_vcn));
725 if (done && newrunlist && (needed < last_vcn)) {
1507 * No cluster allocation is needed, thi
[all...] |
| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | Inode.cpp | 579 // Remove the first one large enough to free the needed amount of
755 // Make room for the new attribute if needed (and we are forced
760 // section into account, and request only what's really needed
761 uint32 needed = pos + length - item->DataSize() - local
765 if (_MakeSpaceForSmallData(transaction, node, name, needed)
1100 // needed to maintain the index
1622 // let's grow the data stream to the size needed
1736 // how many bytes are still needed? (unused ranges are always zero)
1817 // okay, we have the needed blocks, so just distribute them to the
1983 // new array blocks when needed
[all...] |
| /haiku/docs/develop/kits/storage/resources/ |
| H A D | ResourcesFormat.tex | 381 \code{kResourceIndexSectionAlignment}, some padding may be needed at the end
|