| /src/tests/usr.bin/xlint/lint1/ |
| msg_318.c | 11 unsigned long arr[n]; local in function:example
13 arr[n - 1] = '\0';
14 arr[0] = sizeof(unsigned long[n]);
15 return arr[n - 1];
|
| msg_167.c | 11 int arr[6]; local in function:example
14 arr[-3] = 13;
17 * Since the pointer may have been initialized with "arr + 3",
|
| msg_318.c | 11 unsigned long arr[n]; local in function:example
13 arr[n - 1] = '\0';
14 arr[0] = sizeof(unsigned long[n]);
15 return arr[n - 1];
|
| msg_167.c | 11 int arr[6]; local in function:example
14 arr[-3] = 13;
17 * Since the pointer may have been initialized with "arr + 3",
|
| msg_346.c | 81 int arr[] = { 1 }; local in function:bsearch_example
85 take_const_void_ptr(bsearch("", arr, 4, 1, cmp));
86 take_void_ptr(bsearch("", arr, 4, 1, cmp));
|
| msg_346.c | 81 int arr[] = { 1 }; local in function:bsearch_example
85 take_const_void_ptr(bsearch("", arr, 4, 1, cmp));
86 take_void_ptr(bsearch("", arr, 4, 1, cmp));
|
| d_fold_test.c | 22 struct arr { struct
23 int arr[4]; member in struct:arr
60 void if_array(struct arr arr) { if (arr.arr) return; }
|
| msg_204.c | 51 struct arr { struct
52 int arr[4]; member in struct:arr
89 void if_array(struct arr arr) { if (arr.arr) return; }
|
| d_fold_test.c | 22 struct arr { struct
23 int arr[4]; member in struct:arr
60 void if_array(struct arr arr) { if (arr.arr) return; }
|
| msg_204.c | 51 struct arr { struct
52 int arr[4]; member in struct:arr
89 void if_array(struct arr arr) { if (arr.arr) return; }
|
| /src/lib/libexecinfo/ |
| unwind.c | 39 void **arr; member in struct:tracer_context
54 t->arr[t->n++] = (void *)_Unwind_GetIP(ctx);
61 backtrace(void **arr, size_t len)
65 ctx.arr = arr;
73 ctx.arr[--ctx.n] = NULL; /* Skip frame below __start */
|
| unwind.c | 39 void **arr; member in struct:tracer_context
54 t->arr[t->n++] = (void *)_Unwind_GetIP(ctx);
61 backtrace(void **arr, size_t len)
65 ctx.arr = arr;
73 ctx.arr[--ctx.n] = NULL; /* Skip frame below __start */
|
| /src/sys/external/bsd/sljit/dist/doc/tutorial/ |
| array_access.c | 6 typedef long SLJIT_CALL (*func_arr_t)(long *arr, long narr);
27 static int array_access(long *arr, long narr)
56 printf("func return %ld\n", func(arr, narr));
68 long arr[8] = { 3, -10, 4, 6, 8, 12, 2000 }; local in function:main
69 return array_access(arr, 8);
|
| array_access.c | 6 typedef long SLJIT_CALL (*func_arr_t)(long *arr, long narr);
27 static int array_access(long *arr, long narr)
56 printf("func return %ld\n", func(arr, narr));
68 long arr[8] = { 3, -10, 4, 6, 8, 12, 2000 }; local in function:main
69 return array_access(arr, 8);
|
| /src/tests/usr.bin/indent/ |
| lsym_comma.c | 155 int arr[] = {1, 2, 3}; variable in typeref:typename:int[]
156 int arr[] = { variable in typeref:typename:int[]
172 int arr[] = { variable in typeref:typename:int[]
|
| lsym_comma.c | 155 int arr[] = {1, 2, 3}; variable in typeref:typename:int[]
156 int arr[] = { variable in typeref:typename:int[]
172 int arr[] = { variable in typeref:typename:int[]
|
| lsym_lparen_or_lbracket.c | 350 int arr[] = {
357 int arr[] = {
348 int arr[] = { variable in typeref:typename:int[]
355 int arr[] = { variable in typeref:typename:int[]
|
| lsym_lparen_or_lbracket.c | 350 int arr[] = {
357 int arr[] = {
348 int arr[] = { variable in typeref:typename:int[]
355 int arr[] = { variable in typeref:typename:int[]
|
| /src/lib/libresolv/ |
| res_findzonecut.c | 259 rr_a *arr; local in function:add_addrs
262 TAILQ_FOREACH(arr, &nsrr->addrs, link) {
265 *addrs++ = arr->addr;
586 rr_a *arr; local in function:save_a
603 arr = malloc(sizeof *arr);
604 if (arr == NULL) {
608 memset(&arr->addr, 0, sizeof(arr->addr));
611 arr->addr.sin.sin_family = AF_INET
647 rr_a *arr, *n_arr; local in function:free_nsrr
[all...] |
| res_findzonecut.c | 259 rr_a *arr; local in function:add_addrs
262 TAILQ_FOREACH(arr, &nsrr->addrs, link) {
265 *addrs++ = arr->addr;
586 rr_a *arr; local in function:save_a
603 arr = malloc(sizeof *arr);
604 if (arr == NULL) {
608 memset(&arr->addr, 0, sizeof(arr->addr));
611 arr->addr.sin.sin_family = AF_INET
647 rr_a *arr, *n_arr; local in function:free_nsrr
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/asan/tests/ |
| asan_interface_test.cc | 245 char *arr = Ident((char*)malloc(kSize)); local in function:TEST
251 __asan_unpoison_memory_region(arr, kSize);
252 __asan_poison_memory_region(arr + l1, s1);
253 __asan_poison_memory_region(arr + l2, s2);
260 ASSERT_EQ(expected[i], __asan_address_is_poisoned(arr + i));
263 __asan_poison_memory_region(arr, kSize);
264 __asan_unpoison_memory_region(arr + l1, s1);
265 __asan_unpoison_memory_region(arr + l2, s2);
272 ASSERT_EQ(expected[i], __asan_address_is_poisoned(arr + i));
278 free(arr);
[all...] |
| asan_interface_test.cc | 245 char *arr = Ident((char*)malloc(kSize)); local in function:TEST
251 __asan_unpoison_memory_region(arr, kSize);
252 __asan_poison_memory_region(arr + l1, s1);
253 __asan_poison_memory_region(arr + l2, s2);
260 ASSERT_EQ(expected[i], __asan_address_is_poisoned(arr + i));
263 __asan_poison_memory_region(arr, kSize);
264 __asan_unpoison_memory_region(arr + l1, s1);
265 __asan_unpoison_memory_region(arr + l2, s2);
272 ASSERT_EQ(expected[i], __asan_address_is_poisoned(arr + i));
278 free(arr);
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| sanitizer_common_test.cc | 231 int arr[kSize]; local in function:__sanitizer::TEST
232 arr[0] = 1;
233 arr[1] = 3;
234 arr[2] = 5;
235 arr[3] = 7;
236 arr[4] = 11;
238 EXPECT_EQ(0u, InternalLowerBound(arr, 0, kSize, 0, UptrLess));
239 EXPECT_EQ(0u, InternalLowerBound(arr, 0, kSize, 1, UptrLess));
240 EXPECT_EQ(1u, InternalLowerBound(arr, 0, kSize, 2, UptrLess));
241 EXPECT_EQ(1u, InternalLowerBound(arr, 0, kSize, 3, UptrLess))
[all...] |
| sanitizer_thread_registry_test.cc | 63 bool *arr = (bool*)arg; local in function:__sanitizer::MarkUidAsPresent
64 arr[tctx->tid] = true;
|
| /src/usr.bin/indent/ |
| lexi.c | 279 const char **arr = typenames.items; local in function:bsearch_typenames
285 int cmp = strcmp(arr[mid], key);
|
