/haiku-fatelf/src/add-ons/kernel/drivers/graphics/radeon/ |
H A D | mem_controller.c | 9 The memory controller of the Radeon provides a universal mapping 11 graphics chip to addresses in local/PCI/AGP memory. Here, we 15 means non-local memory interface). 44 // bug in asics mean memory must be aligned to memory size... 49 // set address range of video memory; 51 si->memory[mt_local].virtual_addr_start = aper0; 52 si->memory[mt_local].virtual_size = di->local_mem_size; 59 si->memory[mt_PCI].virtual_addr_start = (getTopOfRam() + 4095) & ~4095; 60 si->memory[mt_PC [all...] |
H A D | init.c | 51 si->ROM_area = si->regs_area = si->memory[mt_local].area = 0; 53 // enable memory mapped IO and frame buffer 63 SHOW_INFO( 1, "physical address of memory-mapped I/O: 0x%8lx-0x%8lx", 111 // only map the area that contains physical memory 132 si->memory[mt_local].area = map_physical_memory( 140 if( si->memory[mt_local].area < 0 ) { 142 si->memory[mt_local].area = map_physical_memory( 153 if( si->memory[mt_local].area < 0 ) { 154 result = si->memory[mt_local].area; 193 if( si->memory[mt_loca [all...] |
/haiku-fatelf/headers/cpp/ |
H A D | stl.h | 10 #include <memory>
|
/haiku-fatelf/src/add-ons/kernel/bus_managers/agp_gart/ |
H A D | agp_gart.cpp | 105 size_t Hash(aperture_memory *memory) const 106 { return (memory->base - fInfo.base) / B_PAGE_SIZE; } 107 bool Compare(const KeyType &base, aperture_memory *memory) const 108 { return base == memory->base; } 109 aperture_memory *&GetLink(aperture_memory *memory) const 110 { return memory->hash_link; } 130 void DeleteMemory(aperture_memory *memory); 133 status_t AllocateMemory(aperture_memory *memory, uint32 flags); 135 status_t UnbindMemory(aperture_memory *memory); 136 status_t BindMemory(aperture_memory *memory, addr_ 459 DeleteMemory(aperture_memory *memory) argument 474 aperture_memory *memory = new(std::nothrow) aperture_memory; local 522 AllocateMemory(aperture_memory *memory, uint32 flags) argument 602 UnbindMemory(aperture_memory *memory) argument 631 BindMemory(aperture_memory *memory, addr_t address, size_t size) argument 702 _Free(aperture_memory *memory) argument 745 _Remove(aperture_memory *memory) argument 766 _Insert(aperture_memory *memory, size_t size, size_t alignment, uint32 flags) argument 1044 aperture_memory *memory = aperture->CreateMemory(size, alignment, flags); local 1085 aperture_memory *memory = aperture->GetMemory(base); local 1140 aperture_memory *memory = NULL; local 1179 aperture_memory *memory = aperture->GetMemory(base); local [all...] |
/haiku-fatelf/src/bin/bash/ |
H A D | bashansi.h | 26 # include <memory.h>
|
/haiku-fatelf/src/libs/expat/lib/ |
H A D | winconfig.h | 17 #include <memory.h>
|
/haiku-fatelf/src/bin/gdb/gdb/ |
H A D | gdb_string.h | 46 #include <memory.h>
|
/haiku-fatelf/src/bin/coreutils/lib/ |
H A D | str-two-way.h | 66 memory required for the table is prohibitive. */ 233 period, so use memory to avoid rescanning known occurrences 235 size_t memory = 0; local 240 i = MAX (suffix, memory); 248 while (memory < i + 1 && (CANON_ELEMENT (needle[i]) 251 if (i + 1 < memory + 1) 256 memory = needle_len - period; 261 memory = 0; 267 /* The two halves of needle are distinct; no extra memory is 337 period, so use memory t 339 size_t memory = 0; local [all...] |
H A D | printf-parse.c | 97 /* Out of memory. */ 110 argument *memory; \ 117 /* Overflow, would lead to out of memory. */ \ 119 memory = (argument *) (a->arg \ 122 if (memory == NULL) \ 123 /* Out of memory. */ \ 125 a->arg = memory; \ 172 /* n too large, would lead to out of memory later. */ 242 /* n too large, would lead to out of memory later. */ 299 /* n too large, would lead to out of memory 580 DIRECTIVE *memory; local [all...] |
H A D | mbsstr.c | 37 Return false if it was aborted because not enough memory was available. */ 47 char *memory = (char *) nmalloca (m, sizeof (mbchar_t) + sizeof (size_t)); local 48 if (memory == NULL) 50 needle_mbchars = (mbchar_t *) memory; 51 table = (size_t *) (memory + m * sizeof (mbchar_t)); 175 freea (memory); 200 memory allocation. 202 memory allocation, we activate the Knuth-Morris-Pratt algorithm 208 But we try it only once. If the memory allocation attempt failed, 296 memory allocatio [all...] |
/haiku-fatelf/src/bin/network/wget/lib/ |
H A D | str-two-way.h | 63 memory required for the table is prohibitive. */ 230 period, so use memory to avoid rescanning known occurrences 232 size_t memory = 0; local 237 i = MAX (suffix, memory); 245 while (memory < i + 1 && (CANON_ELEMENT (needle[i]) 248 if (i + 1 < memory + 1) 253 memory = needle_len - period; 258 memory = 0; 264 /* The two halves of needle are distinct; no extra memory is 334 period, so use memory t 336 size_t memory = 0; local [all...] |
/haiku-fatelf/src/add-ons/accelerants/matrox/ |
H A D | GetDeviceInfo.c | 21 adi->memory = (si->ps.memory_size * 1024 * 1024);
|
/haiku-fatelf/src/add-ons/accelerants/neomagic/ |
H A D | GetDeviceInfo.c | 21 adi->memory = (si->ps.memory_size * 1024);
|
/haiku-fatelf/src/add-ons/accelerants/nvidia_gpgpu/ |
H A D | GetDeviceInfo.c | 21 adi->memory = si->ps.memory_size;
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/headers/shared/ |
H A D | AutoDeleter.h | 27 // MemoryDeleter - free()s malloc()ed memory 118 inline void operator()(void *memory) argument 120 free(memory); 127 MemoryDeleter(void *memory) : AutoDeleter<void, MemoryDelete >(memory) {} argument
|
/haiku-fatelf/src/bin/bash/lib/intl/ |
H A D | relocatable.c | 111 char *memory; local 115 memory = (char *) xmalloc (orig_prefix_len + 1 + curr_prefix_len + 1); 117 if (memory != NULL) 120 memcpy (memory, orig_prefix_arg, orig_prefix_len + 1); 121 orig_prefix = memory; 122 memory += orig_prefix_len + 1; 123 memcpy (memory, curr_prefix_arg, curr_prefix_len + 1); 124 curr_prefix = memory; 130 /* Don't worry about wasted memory here - this function is usually only
|
/haiku-fatelf/src/bin/gawk/intl/ |
H A D | relocatable.c | 110 char *memory; local 114 memory = (char *) xmalloc (orig_prefix_len + 1 + curr_prefix_len + 1); 116 if (memory != NULL) 119 memcpy (memory, orig_prefix_arg, orig_prefix_len + 1); 120 orig_prefix = memory; 121 memory += orig_prefix_len + 1; 122 memcpy (memory, curr_prefix_arg, curr_prefix_len + 1); 123 curr_prefix = memory; 129 /* Don't worry about wasted memory here - this function is usually only
|
/haiku-fatelf/src/system/kernel/slab/ |
H A D | HashedObjectCache.h | 87 void Free(void* memory) const 89 slab_internal_free(memory, 0);
|
/haiku-fatelf/headers/libs/print/libprint/ |
H A D | PrintProcess.h | 11 #include <memory>
|
/haiku-fatelf/headers/private/fs_shell/ |
H A D | fssh_auto_deleter.h | 11 MemoryDeleter - free()s malloc()ed memory 117 inline void operator()(void *memory) argument 119 free(memory); 126 MemoryDeleter(void *memory) : AutoDeleter<void, MemoryDelete >(memory) {} argument
|
/haiku-fatelf/headers/private/shared/ |
H A D | AutoDeleter.h | 12 MemoryDeleter - free()s malloc()ed memory 128 inline void operator()(void *memory) argument 130 free(memory); 137 MemoryDeleter(void *memory) : AutoDeleter<void, MemoryDelete >(memory) {} argument
|
/haiku-fatelf/src/add-ons/media/plugins/matroska/libebml/ebml/ |
H A D | EbmlConfig.h | 107 #include <memory.h> //memcpy()
|
/haiku-fatelf/src/add-ons/translators/icns/openjpeg/ |
H A D | opj_includes.h | 34 #include <memory.h>
|
/haiku-fatelf/src/bin/debug/ltrace/ |
H A D | ltrace_stub.cpp | 36 void* memory = malloc(_ALIGN(sizeof(PatchEntry)) local 38 if (memory == NULL) 41 PatchEntry* entry = new(memory) PatchEntry; 43 void* stub = (uint8*)memory + _ALIGN(sizeof(PatchEntry));
|
/haiku-fatelf/src/bin/network/tcpdump/ |
H A D | print-beep.c | 24 #include <memory.h>
|