Searched refs:array (Results 1 - 25 of 101) sorted by relevance

12345

/barrelfish-2018-10-04/lib/bomp_new/test/
H A Dtest.c18 uint32_t array[10]; local
19 memset(array, 0, sizeof(array));
26 array[omp_get_thread_num()]++;
34 debug_printf("array: %u %u %u %u", array[0], array[1], array[2], array[3]);
39 memset(array,
[all...]
/barrelfish-2018-10-04/lib/bench/
H A Dbench.c102 cycles_t bench_avg(cycles_t *array, size_t len) argument
109 if (array[i] != BENCH_IGNORE_WATERMARK) {
110 sum += array[i];
124 cycles_t bench_variance(cycles_t *array, size_t len) argument
126 cycles_t avg = bench_avg(array, len);
133 if (array[i] != BENCH_IGNORE_WATERMARK) {
134 sum += array[i] * array[i];
145 * \param array array o
151 bench_stddev(cycles_t *array, size_t len, uint8_t correction, cycles_t *ret_avg, cycles_t *ret_stddev) argument
193 bench_min(cycles_t *array, size_t len) argument
213 bench_max(cycles_t *array, size_t len) argument
[all...]
H A Dbench_ctl.c117 * Returns a newly allocated array of bins, filled with the desired values.
118 * The array has bin_count + 2 elements. result[bin_count] contains the number
120 * The caller is responsible for freeing the array.
145 cycles_t *array = calloc(ctl->result_count, sizeof(cycles_t)); local
146 assert(array != NULL);
149 array[i] = *(ctl->data + (ctl->result_dimensions * i
152 return array;
155 static cycles_t *do_sorting(cycles_t *array, argument
159 cycles_t *sorted_array = array;
163 // sort the array
182 cycles_t *array = get_array(ctl, dimension); local
[all...]
/barrelfish-2018-10-04/lib/compiler-rt/builtins/
H A Demutls.c101 uintptr_t size; /* number of elements in the 'data' array */
108 emutls_address_array* array = (emutls_address_array*)ptr; local
110 for (i = 0; i < array->size; ++i) {
111 if (array->data[i])
112 emutls_memalign_free(array->data[i]);
140 static __inline void emutls_check_array_set_size(emutls_address_array *array, argument
142 if (array == NULL)
144 array->size = size;
145 pthread_setspecific(emutls_pthread_key, (void*)array);
148 /* Returns the new 'data' array siz
164 emutls_address_array* array = pthread_getspecific(emutls_pthread_key); local
183 emutls_address_array* array = emutls_get_address_array(index); local
[all...]
/barrelfish-2018-10-04/lib/phoenix/
H A Dstruct.h35 void *array[]; member in struct:_val_t
38 /* A key and an array of values associated with it. */
H A Diterator.c128 __builtin_prefetch (itr->val->next_val->array, 0, 0);
140 __builtin_prefetch (itr->val->next_val->array, 0, 0);
151 *addr = itr->val->array[itr->current_index++];
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/
H A DIntegerSpreadSheetModel.java30 * Implements a SpreadSheetModel for an array of integers
36 int[][] array; field in class:IntegerSpreadSheetModel
40 /** We use this single object to return the contents of the int array */
46 array = new int[rows][cols];
58 value.setValue(array[row][col]);
63 array[row][col] = i;
86 int v = array[r][c];
89 array[r][c]++;
91 array[r][c]--;
H A DSpreadSheetSelectionViewletRange.java138 public Object[] toArray(Object[] array) { argument
139 return realList().toArray(array);
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mthca/
H A Dmthca_allocator.c112 * 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...]
/barrelfish-2018-10-04/include/bench/
H A Dbench.h28 cycles_t bench_avg(cycles_t *array, size_t len);
29 cycles_t bench_variance(cycles_t *array, size_t len);
30 void bench_stddev(cycles_t *array, size_t len, uint8_t correction,
32 cycles_t bench_min(cycles_t *array, size_t len);
33 cycles_t bench_max(cycles_t *array, size_t len);
/barrelfish-2018-10-04/usr/vmkitmon/
H A Dbenchmark.c7 static cycles_t my_bench_avg(cycles_t *array, size_t len) argument
13 sum += array[i];
19 static cycles_t my_bench_variance(cycles_t *array, size_t len) argument
21 cycles_t avg = bench_avg(array, len);
27 sum += array[i] * array[i];
33 static cycles_t my_bench_min(cycles_t *array, size_t len) argument
38 if (array[i] < min) {
39 min = array[i];
45 static cycles_t my_bench_max(cycles_t *array, size_ argument
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Darrays.pl16 % In this package an array is represented in the following notation
18 % array([1|_1],[2|_2],[3|_3])+0
21 % Updating the 2nd element to a 5 for example would make the array into
22 % array([1|_1],[2,5|_2],[3|_3])+1
23 % Function "list_to_array" converts list e.g. [1,2,3,4] to array in
38 functor(Array, array, Length).
42 Array =.. [array|Wrapped],
68 Array =.. [array|Wrapped].
77 functor(Array, array, Length),
85 Old =.. [array|OldLis
[all...]
H A Dlogarr.pl9 An array extends from 0 to 2**Size - 1, where Size is a multiple of 2.
14 new_array(A) returns a new empty array A.
16 is_array(A) checks whether A is an array.
22 Element with a new array if Array[Index] is undefined.
66 new_array(array($($,$,$,$),2)).
69 is_array(array(_,_)).
72 aref(Index, array(Array,Size), Item) :-
80 array_to_list(array($(A0,A1,A2,A3),Size), L0) :-
88 arefa(Index, array(Array,Size), Item) :-
98 arefl(Index, array(Arra
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ilog/
H A Doutof.cc33 OutOfI(IlcManager m, IlcIntVar var, IlcIntVarArray array): argument
34 IlcConstraintI(m), _var(var), _array(array) { first_time = IlcTrue;}
43 OutOf(IlcIntVar var, IlcIntVarArray array) argument
46 return new (m.getHeap()) OutOfI(m, var, array);
54 OneOfI(IlcManager m, IlcIntVar var, IlcIntVarArray array): argument
55 IlcConstraintI(m), _var(var), _array(array) { first_time = IlcTrue;}
64 OneOf(IlcIntVar var, IlcIntVarArray array) argument
67 return new (m.getHeap()) OneOfI(m, var, array);
H A Dec2il.cc88 IlcIntVarArray array(m, size);
90 // Store the variables or integers from the list in the array
96 array[index] = var_or_int(head);
98 } // array initialized
100 return array;
120 IlcIntArray array(m, size);
122 // Store the integers from the list in the array
130 array[index] = n;
135 } // array initialized
137 return array;
266 IlcIntArray array = int_array_of_list(List); local
[all...]
/barrelfish-2018-10-04/usr/bench/ump_bench/
H A Dump_bench.h35 extern struct bench_binding *array[MAX_CPUS];
H A Dmain.c23 struct bench_binding *array[MAX_CPUS] = {NULL}; variable in typeref:struct:bench_binding
30 array[id] = b;
36 if (array[i]) {
H A Dexchange.c43 static struct bench_binding *array[MAX_CPUS] = {NULL}; variable in typeref:struct:bench_binding
51 struct bench_ump_binding *bu = (struct bench_ump_binding*)array[idx];
95 array[id] = b;
100 if (array[i]) {
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/viewers/
H A DFadeViewletType.java297 * <p>Stores the data in an expanding 1D array of ints.
302 allows the 2D array to expand a few times without having
313 protected int[] array; field in class:FadeViewletType.Store
325 // allocate initial array
326 array = new int[arraySize];
343 // of elements taken up by a sub-array of the current
362 // need to allocate a new array and copy the data across
365 int oldArray[] = array;
370 // allocate new array
371 array
[all...]
/barrelfish-2018-10-04/include/sys/
H A Dsem.h72 unsigned short *array; /* array for GETALL & SETALL */ member in union:semun_old
82 unsigned short *array; /* array for GETALL & SETALL */ member in union:semun
91 #define GETALL 6 /* Return semvals into arg.array {READ} */
94 #define SETALL 9 /* Set semvals from arg.array {ALTER} */
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Declipse_cc.cc417 list(EC_refs& array);
428 list(EC_refs& array) argument
430 return EC_word(ec_listofrefs(array.r));
558 list(int size, double* array) argument
560 return EC_word(ec_listofdouble(size, array));
564 list(int size, long* array) argument
566 return EC_word(ec_listoflong(size, array));
570 list(int size, char* array) argument
572 return EC_word(ec_listofchar(size, array));
576 array(in argument
582 matrix(int rows, int cols, double* array) argument
[all...]
H A Dbip_shelf.c51 pword array[ 1 /* + arity */ ]; member in struct:__anon1623
71 pword *p = obj->array;
96 pword *p = obj->array;
171 p = obj->array;
202 pheap = obj->array;
266 if (vi.nint < 0 || vi.nint > DidArity(obj->array[0].val.did))
283 if (vi.nint < 1 || vi.nint > DidArity(obj->array[0].val.did))
285 pw = &obj->array[vi.nint];
302 if (vi.nint < 1 || vi.nint > DidArity(obj->array[0].val.did))
304 pw = &obj->array[v
[all...]
/barrelfish-2018-10-04/usr/bench/shared_mem_clock/
H A Dbench.c30 static struct bench_binding *array[MAX_CPUS]; variable in typeref:struct:bench_binding
82 if (array[j]) {
84 err = array[j]->tx_vtbl.shmc_start(array[j], NOP_CONT);
116 array[id] = b;
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dcolgen.tex63 \begin{array}{rcl}
66 \begin{array}{r@{}}
68 \end{array}&
69 \begin{array}{c}
71 \end{array}&
72 \left.\begin{array}{@{}l}
74 \end{array}\right.\qquad\qquad\forall i\\
75 \begin{array}{r@{}}
82 \end{array}&
83 \begin{array}{
[all...]
/barrelfish-2018-10-04/lib/lua/src/
H A Dltable.c10 ** Tables keep its elements in two parts: an array part and a hash part.
11 ** Non-negative integer keys are all candidates to be kept in the array
12 ** part. The actual size of the array is the largest `n' such that at
40 ** max size of array part is 2^MAXBITS
125 ** the array part of the table, -1 otherwise.
141 ** elements in the array part, then elements in the hash part. The
148 if (0 < i && i <= t->sizearray) /* is `key' inside array part? */
158 /* hash elements are numbered after array ones */
171 for (i++; i < t->sizearray; i++) { /* try first array part */
172 if (!ttisnil(&t->array[
[all...]

Completed in 162 milliseconds

12345