HomeSort by relevance Sort by last modified time
    Searched defs:mem (Results 1 - 25 of 413) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/valgrind/memcheck/tests/
err_disable_arange1.c 13 volatile int* volatile mem local
15 free((void*)mem);
19 mem[123] = 0;
23 VALGRIND_DISABLE_ADDR_ERROR_REPORTING_IN_RANGE(mem, 1000 * sizeof(int));
27 mem[456] = 0;
31 VALGRIND_ENABLE_ADDR_ERROR_REPORTING_IN_RANGE(&mem[789], 1);
35 mem[789] = 0;
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/rx/
rx-asm-good.s 8 .GLB mem
9 mem: label
  /external/compiler-rt/test/tsan/
free_race2.c 4 void __attribute__((noinline)) foo(int *mem) {
5 free(mem);
8 void __attribute__((noinline)) bar(int *mem) {
9 mem[0] = 42;
13 int *mem = (int*)malloc(100); local
14 foo(mem);
15 bar(mem);
ignore_lib_lib.h 7 void *volatile mem; variable
11 while ((p = __atomic_load_n(&mem, __ATOMIC_ACQUIRE)) == 0)
21 __atomic_store_n(&mem, malloc(len), __ATOMIC_RELEASE);
23 free(mem);
free_race.c 7 int *mem; variable
12 free(mem);
21 mem[0] = 42;
28 mem = (int*)malloc(100);
signal_longjmp.cc 10 // "((volatile int *volatile)mem)[1] = 1".
62 void *mem = mmap(0, 4096, PROT_NONE, MAP_PRIVATE | MAP_ANON, local
65 MUST_FAULT(((volatile int *volatile)mem)[0] = 0);
66 MUST_FAULT(((volatile int *volatile)mem)[1] = 1);
67 MUST_FAULT(((volatile int *volatile)mem)[3] = 1);
  /external/valgrind/none/tests/mips32/
unaligned_load_store.c 2 unsigned int mem[] = { variable
12 printf("mem[%d]: 0x%x\n", i, mem[i]);
32 : "r" (mem)
37 mem[0] = 0xaabbccdd;
38 mem[1] = 0x11223344;
39 mem[2] = 0x01823194;
40 mem[3] = 0x01823a08;
41 mem[4] = 0x00000000;
42 mem[5] = 0x77ff528c
    [all...]
LoadStore.c 3 unsigned int mem[] = { variable
45 : "r" (mem), "r" (RTval) \
96 printf("MEM:\n");
122 printf("MEM:\n");
169 ppMem1(mem, 16);
196 ppMem1(mem, 16);
223 ppMem1(mem, 16);
250 ppMem1(mem, 16);
277 ppMem1(mem, 16);
304 ppMem1(mem, 16)
    [all...]
LoadStore1.c 3 unsigned int mem[] = { variable
45 : "r" (mem), "r" (RTval) \
96 printf("MEM:\n");
122 printf("MEM:\n");
169 ppMem1(mem, 16);
196 ppMem1(mem, 16);
223 ppMem1(mem, 16);
250 ppMem1(mem, 16);
277 ppMem1(mem, 16);
304 ppMem1(mem, 16)
    [all...]
MIPS32int.c 87 const unsigned int mem[] = { variable
104 : "r" (mem), "r" (RTval) \
    [all...]
  /external/valgrind/none/tests/mips64/
unaligned_load_store.c 2 unsigned int mem[] = { variable
12 printf("mem[%d]: 0x%x\n", i, mem[i]);
32 : "r" (mem)
37 mem[0] = 0xaabbccdd;
38 mem[1] = 0x11223344;
39 mem[2] = 0x01823194;
40 mem[3] = 0x01823a08;
41 mem[4] = 0x00000000;
42 mem[5] = 0x77ff528c
    [all...]
  /external/elfutils/libelf/
elf_readall.c 85 char *mem = NULL; local
110 mem = (char *) malloc (elf->maximum_size);
111 if (mem != NULL)
114 if (unlikely ((size_t) pread_retry (elf->fildes, mem,
122 free (mem);
127 elf->map_address = mem;
  /external/syslinux/gnu-efi/gnu-efi-3.0/apps/
t.c 7 static CHAR16 mem[2048]; local
11 mem[i] = (CHAR16) str[i];
12 mem[i] = 0;
13 return mem;
  /external/compiler-rt/lib/tsan/rtl/
tsan_rtl_proc.cc 22 void *mem = InternalAlloc(sizeof(Processor)); local
23 internal_memset(mem, 0, sizeof(Processor));
24 Processor *proc = new(mem) Processor;
  /external/compiler-rt/test/asan/TestCases/Darwin/
malloc_set_zone_name-mprotect.cc 17 char *mem[kNumIter * 2]; local
21 mem[i] = (char*)malloc(8 * i);
43 mem[i + kNumIter] = (char*)malloc(8 * i);
47 memset(mem[i], 'a', 8 * (i % kNumIter));
48 free(mem[i]);
  /external/compiler-rt/test/asan/TestCases/
debug_stacks.cc 12 char *mem; variable
14 mem = (char *)malloc(10);
18 free(mem);
31 num_frames = __asan_get_alloc_stack(mem, trace, num_frames, &thread_id);
44 num_frames = __asan_get_free_stack(mem, trace, num_frames, &thread_id);
56 mem[0] = 'A'; // BOOM
  /external/valgrind/gdbserver_tests/
clean_after_fork.c 8 int mem = 0, pid; local
11 mem = 1;
19 if (mem == 0)
32 mem = status;
34 if (mem == 0)
35 printf("mem is zero\n");
  /cts/tests/tests/security/jni/
android_security_cts_MMapExecutableTest.cpp 59 void * mem = local
62 if (mem == MAP_FAILED) {
67 if (munmap(mem, stat_buf.st_size - kOffset) == -1) {
  /external/autotest/client/tests/memory_api/
mremaps.c 16 char *mem; local
36 mem = mmap(0, memsize, PROT_READ | PROT_WRITE,
40 if (mem == (void*) -1) {
46 mem = mremap(mem , memsize * (i >> 1),
50 if (mem == MAP_FAILED) {
56 memsize * i, mem);
59 if (munmap(mem, memsize * 16)) {
64 mem = mmap(0, memsize, PROT_READ | PROT_WRITE,
68 if (mem == (void*) -1)
    [all...]
  /external/curl/docs/examples/
getinmemory.c 43 struct MemoryStruct *mem = (struct MemoryStruct *)userp; local
45 mem->memory = realloc(mem->memory, mem->size + realsize + 1);
46 if(mem->memory == NULL) {
52 memcpy(&(mem->memory[mem->size]), contents, realsize);
53 mem->size += realsize;
54 mem->memory[mem->size] = 0
    [all...]
  /external/libchrome/base/memory/
ref_counted_memory_unittest.cc 14 scoped_refptr<RefCountedMemory> mem = new RefCountedStaticMemory( local
17 EXPECT_EQ(10U, mem->size());
18 EXPECT_EQ("static mem", std::string(mem->front_as<char>(), mem->size()));
25 scoped_refptr<RefCountedMemory> mem = RefCountedBytes::TakeVector(&data); local
29 EXPECT_EQ(2U, mem->size());
30 EXPECT_EQ(45U, mem->front()[0]);
31 EXPECT_EQ(99U, mem->front()[1]);
46 scoped_refptr<RefCountedMemory> mem = RefCountedString::TakeString(&s) local
77 scoped_refptr<RefCountedMemory> mem = RefCountedString::TakeString(&s); local
    [all...]
  /external/libopus/silk/
LPC_analysis_filter.c 53 opus_int16 mem[SILK_MAX_ORDER_LPC]; local
71 mem[ j ] = in[ d - j - 1 ];
73 celt_fir( in + d, num, out + d, len - d, d, mem, arch );
  /external/libunwind/src/coredump/
_UCD_find_proc_info.c 135 void *mem = malloc (pi->unwind_info_size); local
137 if (!mem)
139 memcpy (mem, pi->unwind_info, pi->unwind_info_size);
140 pi->unwind_info = mem;
  /external/libunwind/src/ptrace/
_UPT_find_proc_info.c 124 void *mem = malloc (pi->unwind_info_size); local
126 if (!mem)
128 memcpy (mem, pi->unwind_info, pi->unwind_info_size);
129 pi->unwind_info = mem;
  /external/syslinux/com32/lib/sys/
argv.c 48 char *mem = __mem_end; local
50 char *q = mem;
84 if (mem < q)
85 *arg++ = mem; /* argv[1] */
87 for (r = mem; r < q; r++) {

Completed in 562 milliseconds

1 2 3 4 5 6 7 8 91011>>