/freebsd-10.0-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/sizeof/ |
H A D | tst.SizeofArray.d | 31 * type. For a simpler array, the sizeof on the array variable itself gives 32 * the sum total of memory allocated to the array in bytes. With individual 33 * members of the array it gives their respective sizes. 40 int array[5]; 44 array[0] = 010; 45 array[1] = 100; 46 array[2] = 210; 48 printf("sizeof (array): %d\n", sizeof (array)); [all...] |
/freebsd-10.0-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/pointers/ |
H A D | err.D_DEREF_VOID.VoidPointerDeref.d | 40 int array[3]; 44 array[0] = 234; 45 array[1] = 334; 46 array[2] = 434; 48 p = &array[0]; 50 printf("array[0]: %d, p: %d\n", array[0], *p);
|
H A D | tst.VoidCast.d | 40 int array[3]; 44 array[0] = 234; 45 array[1] = 334; 46 array[2] = 434; 48 p = &array[0]; 51 printf("array[0]: %d, newp: %d\n", array[0], *newp);
|
H A D | tst.PointerAssignment.d | 41 int array[3]; 47 array[0] = 200; 48 array[1] = 400; 49 array[2] = 600; 51 ptr1 = array; 58 printf("array[0]: %d\tptr2[0]: %d\n", array[0], ptr2[0]); 59 printf("array[1]: %d\tptr2[1]: %d\n", array[1], ptr2[1]); 60 printf("array[ [all...] |
H A D | tst.ArrayPointer2.d | 30 * ASSERTION: D permits the use of array [] index notation with both pointer 31 * variables and array variables. 41 int array[5]; 44 array[0] = 100; 45 array[1] = 200; 46 array[2] = 300; 47 array[3] = 400; 48 array[4] = 500; 50 p = &array[0]; 52 printf("array[ [all...] |
H A D | tst.ArrayPointer3.d | 30 * ASSERTION: In D, the an array variable can be assigned to a pointer. 40 int array[5]; 45 array[0] = 100; 46 array[1] = 200; 47 array[2] = 300; 48 array[3] = 400; 49 array[4] = 500; 51 p = array; 53 printf("array[0]: %d\tp[0]: %d\n", array[ [all...] |
H A D | tst.PointerArithmetic2.d | 42 int array[5]; 45 array[0] = 100; 46 array[1] = 200; 47 array[2] = 300; 48 array[3] = 400; 49 array[4] = 500; 51 p = &array[0]; 53 printf("array[0]: %d\t*p: %d\n", array[0], *p); 54 printf("array[ [all...] |
H A D | tst.IntegerArithmetic1.d | 41 int array[3]; 49 array[0] = 20; 50 array[1] = 40; 51 array[2] = 80; 53 uptr = (uintptr_t) &array[0]; 59 printf("array[0]: %d\t*p: %d\n", array[0], *p); 60 printf("array[1]: %d\t*q: %d\n", array[1], *q); 61 printf("array[ [all...] |
H A D | err.InvalidAddress5.d | 45 int array[2]; 53 array[0] = 0x12345678; 54 array[1] = 0xabcdefff; 56 ptr = (char *) &array[0];
|
/freebsd-10.0-release/crypto/heimdal/base/ |
H A D | array.c | 50 heim_array_t array = ptr; local 52 for (n = 0; n < array->len; n++) 53 heim_release(array->val[n]); 54 free(array->val); 68 * Allocate an array 70 * @return A new allocated array, free with heim_release() 76 heim_array_t array; local 78 array = _heim_alloc_object(&array_object, sizeof(*array)); 79 if (array 110 heim_array_append_value(heim_array_t array, heim_object_t object) argument 132 heim_array_iterate_f(heim_array_t array, heim_array_iterator_f_t fn, void *ctx) argument 148 heim_array_iterate(heim_array_t array, void (^fn)(heim_object_t)) argument 165 heim_array_get_length(heim_array_t array) argument 181 heim_array_copy_value(heim_array_t array, size_t idx) argument 196 heim_array_delete_value(heim_array_t array, size_t idx) argument 221 heim_array_filter(heim_array_t array, int (^block)(heim_object_t)) argument [all...] |
/freebsd-10.0-release/contrib/atf/atf-c/ |
H A D | utils_test.c | 42 char **array = malloc(sizeof(char *) * 1); local 43 array[0] = NULL; 45 atf_utils_free_charpp(array); 51 char **array = malloc(sizeof(char *) * 4); local 52 array[0] = strdup("first"); 53 array[1] = strdup("second"); 54 array[2] = strdup("third"); 55 array[3] = NULL; 57 atf_utils_free_charpp(array);
|
/freebsd-10.0-release/contrib/ipfilter/lib/ |
H A D | printipfexpr.c | 9 printipfexpr(array) 10 int *array; 15 nelems = array[0]; 18 ipfe = (ipfexp_t *)(array + i); 28 printhosts(array + i); 33 printsingle(array + i); 38 printhosts(array + i); 43 printhosts(array + i); 48 printport(array + i); 53 printport(array [all...] |
/freebsd-10.0-release/usr.bin/dc/ |
H A D | stack.c | 30 static struct array *array_new(void); 31 static __inline void array_free(struct array *); 32 static struct array *array_dup(const struct array *); 33 static __inline void array_grow(struct array *, size_t); 34 static __inline void array_assign(struct array *, size_t, const struct value *); 35 static __inline struct value *array_retrieve(const struct array *, size_t); 71 if (v->array != NULL) { 72 array_free(v->array); 73 v->array 319 array_grow(struct array *array, size_t newsize) argument 332 array_assign(struct array *array, size_t i, const struct value *v) argument 342 array_retrieve(const struct array *array, size_t i) argument [all...] |
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_subr/ |
H A D | sorts.c | 53 ordered lists. However, what "keys" should we put in the array? 59 structures in our array. No such apr object exists... BUT... if we 61 *}. If store these objects in our array, we get the hash value 62 *for free*. When looping over the final array, we don't need to 149 /* allocate an array with enough elements to hold all the keys. */ 152 /* loop over hash table and push all keys into the array */ 174 /* quicksort the array if it isn't already sorted. */ 183 the array at BASE which has NELTS elements of size ELT_SIZE bytes each, 186 The array must already be sorted in the ordering defined by COMPARE_FUNC. 219 const apr_array_header_t *array, 216 svn_sort__bsearch_lower_bound(const void *key, const apr_array_header_t *array, int (*compare_func)(const void *, const void *)) argument 226 svn_sort__array_insert(const void *new_element, apr_array_header_t *array, int insert_index) argument 276 svn_sort__array_reverse(apr_array_header_t *array, apr_pool_t *scratch_pool) argument [all...] |
/freebsd-10.0-release/crypto/heimdal/lib/ipc/ |
H A D | heim_ipc_async.defs | 39 type heim_ipc_message_inband_t = array [ * : 2048 ] of char; 40 type heim_ipc_message_outband_t = array [] of char;
|
H A D | heim_ipc_reply.defs | 39 type heim_ipc_message_inband_t = array [ * : 2048 ] of char; 40 type heim_ipc_message_outband_t = array [] of char;
|
/freebsd-10.0-release/sys/dev/hptmv/ |
H A D | gui_lib.c | 92 if ((pVDevice->u.array.dArStamp != 0) && (pVDevice == p)) 120 /* The array is disabled */ 127 /* array need synchronizing */ 128 if(pVDevice->u.array.rf_need_rebuild && !pVDevice->u.array.rf_duplicate_and_create) 131 /* array is in rebuilding process */ 132 if(pVDevice->u.array.rf_rebuilding) 135 /* array is being verified */ 136 if(pVDevice->u.array.rf_verifying) 139 /* array i [all...] |
H A D | ioctl.c | 130 memcpy(e.Data, ((PVDevice)param)->u.array.ArrayName, MAX_ARRAY_NAME); 176 if (pArray->u.array.rf_rebuilding || pArray->u.array.rf_verifying || 177 pArray->u.array.rf_initializing) 180 for(i=0; i<pArray->u.array.bArnMember; i++) { 181 pa = pArray->u.array.pMember[i]; 183 if (pa->u.array.rf_rebuilding || pa->u.array.rf_verifying || 184 pa->u.array.rf_initializing) 407 (ID_TO_VDEV(*(DEVICEID *)lpOutBuffer))->u.array [all...] |
/freebsd-10.0-release/contrib/atf/atf-c++/ |
H A D | build_test.cpp | 84 equal_argvs(const atf::process::argv_array& aa, const char* const* array) argument 89 while (equal && (i < aa.size() && array[i] != NULL)) { 90 if (std::strcmp(aa[i], array[i]) != 0) 96 if (equal && (i < aa.size() || array[i] != NULL)) 104 check_equal_argvs(const atf::process::argv_array& aa, const char* const* array) argument 106 print_array("Expected arguments", array); 109 if (!equal_argvs(aa, array)) 125 const char* const array[] = { NULL }; local 128 ATF_REQUIRE(equal_argvs(atf::process::argv_array(argv), array)); 132 const char* const array[] local 139 const char* const array[] = { "foo", NULL }; local 146 const char* const array[] = { "foo", NULL }; local [all...] |
/freebsd-10.0-release/contrib/binutils/bfd/ |
H A D | elf-strtab.c | 52 /* Number of array entries alloced. */ 57 struct elf_strtab_hash_entry **array; member in struct:elf_strtab_hash 114 table->array = bfd_malloc (table->alloced * amt); 115 if (table->array == NULL) 121 table->array[0] = NULL; 132 free (tab->array); 168 tab->array = bfd_realloc (tab->array, tab->alloced * amt); 169 if (tab->array == NULL) 174 tab->array[entr 302 struct elf_strtab_hash_entry **array, **a, *e; local [all...] |
/freebsd-10.0-release/sys/ofed/drivers/infiniband/hw/mthca/ |
H A D | mthca_allocator.c | 113 * serialize access to the array. 118 void *mthca_array_get(struct mthca_array *array, int index) argument 122 if (array->page_list[p].page) 123 return array->page_list[p].page[index & MTHCA_ARRAY_MASK]; 128 int mthca_array_set(struct mthca_array *array, int index, void *value) argument 133 if (!array->page_list[p].page) 134 array->page_list[p].page = (void **) get_zeroed_page(GFP_ATOMIC); 136 if (!array->page_list[p].page) 139 array->page_list[p].page[index & MTHCA_ARRAY_MASK] = value; 140 ++array 145 mthca_array_clear(struct mthca_array *array, int index) argument 160 mthca_array_init(struct mthca_array *array, int nent) argument 177 mthca_array_cleanup(struct mthca_array *array, int nent) argument [all...] |
/freebsd-10.0-release/contrib/unbound/util/storage/ |
H A D | slabhash.c | 59 sl->array = (struct lruhash**)calloc(sl->size, sizeof(struct lruhash*)); 60 if(!sl->array) { 77 sl->array[i] = lruhash_create(start_size, maxmem / sl->size, 79 if(!sl->array[i]) { 91 if(sl->array) { 94 lruhash_delete(sl->array[i]); 95 free(sl->array); 106 lruhash_clear(sl->array[i]); 119 lruhash_insert(sl->array[slab_idx(sl, hash)], hash, entry, data, arg); 125 return lruhash_lookup(sl->array[slab_id [all...] |
/freebsd-10.0-release/contrib/binutils/ld/ |
H A D | sysdep.h | 58 # define __PAST_END(array, offset) (((typeof(*(array)) *)(array))[offset])
|
/freebsd-10.0-release/contrib/unbound/util/ |
H A D | timehist.h | 66 /** bucket array */ 119 * Export histogram to an array. 121 * @param array: the array to export to. 122 * @param sz: number of items in array. 124 void timehist_export(struct timehist* hist, size_t* array, size_t sz); 127 * Import histogram from an array. 129 * @param array: the array to import from. 130 * @param sz: number of items in array [all...] |
/freebsd-10.0-release/sys/compat/netbsd/ |
H A D | dvcfg.h | 51 #define DVCFG_HWSEL_SZ(array) (sizeof(array) / sizeof(dvcfg_hw_t))
|