/freebsd-10-stable/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-stable/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-stable/contrib/netbsd-tests/usr.bin/xlint/lint1/ |
H A D | d_gcc_variable_array_init.c | 1 /* gcc: variable array initializer */ 4 int array[i]; local 6 foo(array[i] = 0);
|
/freebsd-10-stable/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-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | bit_array.c | 2 * bit_array.c : implement a simple packed bit array 40 /* Initial array size (covers INITIAL_BLOCK_COUNT * BLOCK_SIZE_BITS bits). 45 /* We store the bits in a lazily allocated two-dimensional array. 47 * BLOCKS array. If index / BLOCK_SIZE_BITS exceeds BLOCK_COUNT-1, the 49 * BLOCKS array be auto-expanded. 67 /* Given that MAX shall be an actual bit index in a packed bit array, 89 svn_bit_array__t *array = apr_pcalloc(pool, sizeof(*array)); local 91 array->block_count = select_data_size(max); 92 array 100 svn_bit_array__set(svn_bit_array__t *array, apr_size_t idx, svn_boolean_t value) argument 168 svn_bit_array__get(svn_bit_array__t *array, apr_size_t idx) argument [all...] |
H A D | sorts.c | 54 ordered lists. However, what "keys" should we put in the array? 60 structures in our array. No such apr object exists... BUT... if we 62 *}. If store these objects in our array, we get the hash value 63 *for free*. When looping over the final array, we don't need to 140 svn_sort__array(apr_array_header_t *array, 144 qsort(array->elts, array->nelts, array->elt_size, comparison_func); 158 /* allocate an array with enough elements to hold all the keys. */ 161 /* loop over hash table and push all keys into the array */ 138 svn_sort__array(apr_array_header_t *array, int (*comparison_func)(const void *, const void *)) argument 225 svn_sort__bsearch_lower_bound(const apr_array_header_t *array, const void *key, int (*compare_func)(const void *, const void *)) argument 235 svn_sort__array_lookup(const apr_array_header_t *array, const void *key, int *hint, int (*compare_func)(const void *, const void *)) argument 303 svn_sort__array_insert(apr_array_header_t *array, const void *new_element, int insert_index) argument 353 svn_sort__array_reverse(apr_array_header_t *array, apr_pool_t *scratch_pool) argument [all...] |
/freebsd-10-stable/contrib/ipfilter/lib/ |
H A D | printipfexpr.c | 11 printipfexpr(array) 12 int *array; 17 nelems = array[0]; 20 ipfe = (ipfexp_t *)(array + i); 30 printhosts(array + i); 35 printsingle(array + i); 40 printhosts(array + i); 45 printhosts(array + i); 50 printport(array + i); 55 printport(array [all...] |
/freebsd-10-stable/contrib/ntp/sntp/libevent/test/ |
H A D | regress.rpc | 7 array struct[run] run = 4; 13 array int how_often = 3; 21 array string notes = 4; 24 array int other_numbers = 6;
|
/freebsd-10-stable/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 array_free(v->array); 72 v->array = NULL; 95 copy->array 312 array_grow(struct array *array, size_t newsize) argument 325 array_assign(struct array *array, size_t i, const struct value *v) argument 335 array_retrieve(const struct array *array, size_t i) argument [all...] |
/freebsd-10-stable/contrib/ntp/lib/isc/ |
H A D | heap.c | 41 * element of the heap array is not used; i.e. heap subscripts are 1-based, 60 ! heap->compare(heap->array[(i)], \ 61 heap->array[heap_parent(i)])) 70 void **array; member in struct:isc_heap 97 heap->array = NULL; 114 if (heap->array != NULL) 115 isc_mem_put(heap->mctx, heap->array, 134 if (heap->array != NULL) { 135 memcpy(new_array, heap->array, heap->size * sizeof(void *)); 136 isc_mem_put(heap->mctx, heap->array, [all...] |
/freebsd-10-stable/contrib/ntp/sntp/unity/auto/ |
H A D | parseOutput.rb | 59 def testPassed(array) 60 lastItem = array.length - 1 61 testName = array[lastItem - 1] 62 testSuiteVerify(array[@className]) 70 def testIgnored(array) 71 lastItem = array.length - 1 72 testName = array[lastItem - 2] 73 reason = array[lastItem].chomp 74 testSuiteVerify(array[@className]) 84 def testFailed(array) [all...] |
/freebsd-10-stable/contrib/ldns/ |
H A D | radix.c | 56 static int ldns_radix_str_create(ldns_radix_array_t* array, uint8_t* key, 61 static int ldns_radix_array_split(ldns_radix_array_t* array, uint8_t* key, 104 node->array = NULL; 202 /** Find some space in the array for the first byte */ 205 LDNS_FREE(prefix->array); 212 prefix->array[0].edge = add; 216 len, &prefix->array[0].str, 217 &prefix->array[0].len)) { 219 LDNS_FREE(prefix->array); 242 /** Find some space in the array fo 950 ldns_radix_str_create(ldns_radix_array_t* array, uint8_t* key, radix_strlen_t pos, radix_strlen_t len) argument 999 ldns_radix_array_split(ldns_radix_array_t* array, uint8_t* key, radix_strlen_t pos, radix_strlen_t len, ldns_radix_node_t* add) argument [all...] |
/freebsd-10-stable/contrib/top/ |
H A D | utils.h | 25 int string_index(char *string, char **array);
|
/freebsd-10-stable/contrib/subversion/subversion/include/private/ |
H A D | svn_sorts_private.h | 56 * (i.e. for each @c svn_sort__item_t @a item in the returned array, 76 /* Sort APR array @a array using ordering defined by @a comparison_func. 80 svn_sort__array(apr_array_header_t *array, 85 * the array @a array, according to the ordering defined by @a compare_func. 86 * The array must already be sorted in the ordering defined by @a compare_func. 93 svn_sort__bsearch_lower_bound(const apr_array_header_t *array, 98 * the array @a array, accordin [all...] |
/freebsd-10-stable/sys/ofed/drivers/infiniband/hw/mthca/ |
H A D | mthca_allocator.c | 112 * serialize access to the array. 117 void *mthca_array_get(struct mthca_array *array, int index) argument 121 if (array->page_list[p].page) 122 return array->page_list[p].page[index & MTHCA_ARRAY_MASK]; 127 int mthca_array_set(struct mthca_array *array, int index, void *value) argument 132 if (!array->page_list[p].page) 133 array->page_list[p].page = (void **) get_zeroed_page(GFP_ATOMIC); 135 if (!array->page_list[p].page) 138 array->page_list[p].page[index & MTHCA_ARRAY_MASK] = value; 139 ++array 144 mthca_array_clear(struct mthca_array *array, int index) argument 159 mthca_array_init(struct mthca_array *array, int nent) argument 176 mthca_array_cleanup(struct mthca_array *array, int nent) argument [all...] |
/freebsd-10-stable/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-stable/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...] |