/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 921117-1.c | 4 } cell; variable in typeref:struct:s 16 cell.flag = 99; 17 strcpy (cell.text, "0123456789"); 19 if (check (cell))
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | overflow-1.c | 20 struct S* cell=H+k; local 21 cell->key=i*(0xffffffffUL/2); 22 cell->rnext=k+(1-i); 23 cell->rprev=k+(1-i);
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | dependency_26.f90 | 35 SUBROUTINE S1(cell) 36 TYPE(cell_type), POINTER :: cell local in subroutine:S1 39 a=MATMUL(cell%h,b) 45 TYPE(cell_type), POINTER :: cell variable 46 allocate (cell) 47 cell%h = reshape ([(real(i), i = 1, 9)], [3, 3]) 48 call s1 (cell)
|
H A D | use_only_3.inc | 151 LOGICAL :: tpre = .FALSE. ! calculate stress, and (in fpmd) variable cell dynamic 152 LOGICAL :: thdyn = .FALSE. ! variable-cell dynamics (only cp) 153 LOGICAL :: tsdc = .FALSE. ! cell geometry steepest descent 154 LOGICAL :: tzeroc = .FALSE. ! set to zero the cell geometry velocities 222 ! ... Read the cell from standard input 240 ! ... Flag controlling the Nose thermostat for the cell 612 REAl(DP) :: omega = 0.0d0 ! volume of the simulation cell 619 REAL(DP) :: h(3,3) = 0.0d0 ! simulation cell at time t 620 REAL(DP) :: hold(3,3) = 0.0d0 ! simulation cell at time t-delt 621 REAL(DP) :: hnew(3,3) = 0.0d0 ! simulation cell a [all...] |
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/ |
H A D | meteor-contest.c | 41 /* The board is a 50 cell hexagonal pattern. For . . . . . 107 * 12 rotations. However, not all 12 rotations will fit on every cell, so 111 * I'm also going to record the next possible open cell for each piece and 129 /* Returns the new cell index from the specified cell in the 131 * starting cell and direction have been checked by the 134 char shift(char cell, char dir) { argument 137 return cell + 1; 139 if((cell / 5) % 2) 140 return cell 193 out_of_bounds(char cell, char dir) argument 244 calc_cell_indices(char *cell, int piece, char index) argument 253 cells_fit_on_board(char *cell, int piece) argument 264 minimum_of_cells(char *cell) argument 277 first_empty_cell(char *cell, char minimum) argument 289 bitmask_from_cells(char *cell) argument 336 has_island(char *cell, int piece) argument 368 char rotation, cell[5]; local 512 boardHasIslands(char cell) argument 554 solve(int depth, int cell) argument [all...] |
H A D | meteor-contest.go | 53 /* The board is a 50 cell hexagonal pattern. For . . . . . 120 * 12 rotations. However, not all 12 rotations will fit on every cell, so 124 * I'm also going to record the next possible open cell for each piece and 139 /* Returns the new cell index from the specified cell in the 141 * starting cell and direction have been checked by the 144 func shift(cell, dir int8) int8 { 147 return cell + 1 149 if ((cell / 5) % 2) != 0 { 150 return cell [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/debug/dwarf2/ |
H A D | dwarf4-nested.C | 42 B*& cell = table[i]; local 43 if (cell == 0) 44 cell = new T(); 45 return static_cast<T*>(cell);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | loadpre6.c | 34 /* There are some reloaded loads of *cell, and cell->common.chain on various 39 tree var, *cell; local 41 for (cell = unexpanded_var_list; *cell; ) 43 var = (*cell)->list.value; 49 *cell = ((*cell)->common.chain); 53 cell = &((*cell) [all...] |
/haiku-buildtools/legacy/gcc/libobjc/objc/ |
H A D | objc-list.h | 36 /* Return a cons cell produced from (head . tail) */ 41 struct objc_list* cell; local 43 cell = (struct objc_list*)objc_malloc(sizeof(struct objc_list)); 44 cell->head = head; 45 cell->tail = tail; 46 return cell;
|
/haiku-buildtools/isl/include/isl/ |
H A D | vertices.h | 33 isl_ctx *isl_cell_get_ctx(__isl_keep isl_cell *cell); 34 __isl_give isl_basic_set *isl_cell_get_domain(__isl_keep isl_cell *cell); 35 int isl_cell_foreach_vertex(__isl_keep isl_cell *cell, 37 void isl_cell_free(__isl_take isl_cell *cell); 40 int (*fn)(__isl_take isl_cell *cell, void *user), void *user);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr32584.c | 56 int j , n , cell ; local 60 for( cell = 1 ; cell <= numcells + numterms ; cell++ ) {
|
/haiku-buildtools/isl/ |
H A D | isl_vertices.c | 1064 isl_ctx *isl_cell_get_ctx(__isl_keep isl_cell *cell) argument 1066 return cell ? cell->dom->ctx : NULL; 1069 __isl_give isl_basic_set *isl_cell_get_domain(__isl_keep isl_cell *cell) argument 1071 return cell ? isl_basic_set_copy(cell->dom) : NULL; 1078 isl_cell *cell = NULL; local 1083 cell = isl_calloc_type(dom->ctx, isl_cell); 1084 if (!cell) 1087 cell 1104 isl_cell_free(__isl_take isl_cell *cell) argument 1200 isl_vertices_foreach_disjoint_cell(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_cell *cell, void *user), void *user) argument 1206 isl_cell *cell; local 1261 isl_vertices_foreach_cell(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_cell *cell, void *user), void *user) argument 1265 isl_cell *cell; local 1316 isl_cell_foreach_vertex(__isl_keep isl_cell *cell, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user) argument 1398 call_on_simplex(__isl_keep isl_cell *cell, int *simplex_ids, int n_simplex, int *other_ids, int n_other, int (*fn)(__isl_take isl_cell *simplex, void *user), void *user) argument 1473 triangulate(__isl_keep isl_cell *cell, __isl_keep isl_vec *v, int *simplex_ids, int n_simplex, int *other_ids, int n_other, int (*fn)(__isl_take isl_cell *simplex, void *user), void *user) argument 1527 isl_cell_foreach_simplex(__isl_take isl_cell *cell, int (*fn)(__isl_take isl_cell *simplex, void *user), void *user) argument [all...] |
H A D | isl_vertices_private.h | 55 int (*fn)(__isl_take isl_cell *cell, void *user), void *user); 56 int isl_cell_foreach_simplex(__isl_take isl_cell *cell,
|
H A D | isl_bernstein.c | 32 isl_cell *cell; member in struct:bernstein_data 95 static int is_tight(int *k, int n, int d, isl_cell *cell) argument 106 v = cell->ids[n - 1 - i]; 107 return vertex_is_integral(cell->vertices->v[v].vertex); 120 if (data->check_tight && is_tight(k, n, d, data->cell)) 233 * on "cell". 244 static int bernstein_coefficients_cell(__isl_take isl_cell *cell, void *user) argument 262 n_vertices = cell->n_vertices; 266 return isl_cell_foreach_simplex(cell, 273 dim_param = isl_basic_set_get_space(cell [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | pr45580.C | 46 CollectorCell cell; local 47 void* storage = &cell;
|
/haiku-buildtools/legacy/gcc/libobjc/ |
H A D | init.c | 388 struct objc_list **cell = &uninitialized_statics; local 393 while (*cell) 397 for (statics_in_module = (*cell)->head; 431 struct objc_list *this = *cell; 432 *cell = this->tail; 436 cell = &(*cell)->tail; 464 struct objc_list** cell; local 602 for (cell = &unclaimed_categories; 603 *cell; [all...] |
/haiku-buildtools/legacy/binutils/gas/config/ |
H A D | tc-bfin.c | 993 INSTR_T cell = (INSTR_T) obstack_alloc (&mempool, sizeof (struct bfin_insn)); local 994 memset (cell, 0, sizeof (struct bfin_insn)); 995 cell->value = (x); 996 return cell;
|
/haiku-buildtools/binutils/gas/config/ |
H A D | tc-bfin.c | 931 INSTR_T cell = XOBNEW (&mempool, struct bfin_insn); local 932 memset (cell, 0, sizeof (struct bfin_insn)); 933 cell->value = (x); 934 return cell;
|