/haiku-buildtools/binutils/gas/testsuite/gas/arm/ |
H A D | neon-vmov-bad.l | 2 [^:]*:3: Error: invalid instruction shape -- `vmov Q0,d0'
|
H A D | neon-vmov-bad.d | 1 # name: Bad shape for vmov
|
H A D | neon-suffix-bad.l | 5 [^:]*:6: Error: invalid instruction shape -- `vcvt.f64.s32 d0,s0,#11' 9 [^:]*:12: Error: invalid instruction shape -- `vcvt.f64.s32 d0,s0,#11'
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.law/ |
H A D | operators8.C | 5 class shape { class 13 class square :public shape { 29 class triangle :public shape { 47 shape* s1 = new square(4,4,5); 48 shape* s2 = new triangle(6,6,2,3);
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/ |
H A D | bug010.go | 23 bug10.go:7: error in shape across assignment
|
H A D | bug069.go | 18 i, ok = <-(ca[0]); // fails: c.go:11: bad shape across assignment - cr=1 cl=2
|
H A D | bug075.go | 15 x, ok = t.m[0]; //bug075.go:11: bad shape across assignment - cr=1 cl=2
|
H A D | bug331.go | 35 bug331.go:12: error in shape across RETURN
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/bug088.dir/ |
H A D | bug1.go | 18 bug1.go:8: shape error across :=
|
/haiku-buildtools/gcc/gcc/fortran/ |
H A D | iresolve.c | 148 f->shape = gfc_get_shape (1); 149 mpz_init_set_ui (f->shape[0], coarray ? gfc_get_corank (array) 181 f->shape = gfc_copy_shape_excluding (array->shape, array->rank, dim); 344 f->shape = gfc_copy_shape_excluding (mask->shape, mask->rank, dim); 393 f->shape = gfc_copy_shape_excluding (mask->shape, mask->rank, dim); 475 f->shape = gfc_get_shape (1); 476 mpz_init (f->shape[ 2112 gfc_resolve_reshape(gfc_expr *f, gfc_expr *source, gfc_expr *shape, gfc_expr *pad ATTRIBUTE_UNUSED, gfc_expr *order ATTRIBUTE_UNUSED) argument [all...] |
H A D | simplify.c | 407 result->shape = gfc_copy_shape_excluding (array->shape, array->rank, dim); 414 nelem *= mpz_get_ui (result->shape[i]); 575 tmpstride[i] = (i == 0) ? 1 : tmpstride[i-1] * mpz_get_si (array->shape[i-1]); 578 dim_extent = mpz_get_si (array->shape[i]); 583 extent[n] = mpz_get_si (array->shape[i]); 1253 result->shape = gfc_get_shape (1); 1254 mpz_init_set_ui (result->shape[0], MAX (n2-n1+1, 0)); 3491 e->shape = gfc_get_shape (1); 3492 mpz_init_set_ui (e->shape[ 5063 int order[GFC_MAX_DIMENSIONS], shape[GFC_MAX_DIMENSIONS]; local 5681 mpz_t shape[GFC_MAX_DIMENSIONS]; local [all...] |
H A D | check.c | 1840 "invalid shape in dimension %d (%ld/%ld)", 1843 mpz_get_si (array->shape[i]), 1844 mpz_get_si (shift->shape[j])); 1971 gfc_error ("Different shape for arguments %qs and %qs at %L for " 2091 "invalid shape in dimension %d (%ld/%ld)", 2094 mpz_get_si (array->shape[i]), 2095 mpz_get_si (shift->shape[j])); 3028 /* Check for case matrix_a has shape(m), matrix_b has shape (m, k). */ 3031 gfc_error ("Different shape o 3715 gfc_check_reshape(gfc_expr *source, gfc_expr *shape, gfc_expr *pad, gfc_expr *order) argument 4399 gfc_check_c_f_pointer(gfc_expr *cptr, gfc_expr *fptr, gfc_expr *shape) argument [all...] |
H A D | target-memory.c | 370 /* Calculate array size from its shape and rank. */ 371 gcc_assert (result->rank > 0 && result->shape); 374 array_size *= (int)mpz_get_ui (result->shape[i]); 529 /* Copy shape, if needed. */ 537 e->shape = gfc_get_shape (e->rank); 540 mpz_init_set_ui (e->shape[n], 1); 541 mpz_add (e->shape[n], e->shape[n], 543 mpz_sub (e->shape[n], e->shape[ [all...] |
H A D | array.c | 302 shape and check associated constraints. */ 330 the shape and make sure everything is integral. */ 499 and implied-shape specifications. If the rank is at least 2, we can 519 gfc_error ("Bad array specification for implied-shape" 545 gfc_error ("Bad array specification for assumed shape " 559 gfc_error ("Bad specification for deferred shape array at %C"); 658 gfc_error ("Bad array specification for assumed shape " 672 gfc_error ("Bad specification for deferred shape array at %C"); 720 /* If a lower bounds of an assumed shape array is blank, put in one. */ 864 shape 2487 gfc_array_ref_shape(gfc_array_ref *ar, mpz_t *shape) argument [all...] |
H A D | expr.c | 50 e->shape = NULL; 69 e->shape = NULL; 393 q->shape = gfc_copy_shape (p->shape, p->rank); 402 gfc_clear_shape (mpz_t *shape, int rank) argument 407 mpz_clear (shape[i]); 412 gfc_free_shape (mpz_t **shape, int rank) argument 414 if (*shape == NULL) 417 gfc_clear_shape (*shape, rank); 418 free (*shape); 697 gfc_copy_shape(mpz_t *shape, int rank) argument 727 gfc_copy_shape_excluding(mpz_t *shape, int rank, gfc_expr *dim) argument [all...] |
H A D | arith.c | 1246 r->shape = gfc_copy_shape (op->shape, op->rank); 1286 r->shape = gfc_copy_shape (op1->shape, op1->rank); 1326 r->shape = gfc_copy_shape (op2->shape, op2->rank); 1376 r->shape = gfc_copy_shape (op1->shape, op1->rank);
|
H A D | frontend-passes.c | 424 /* If we don't know the shape at compile time, we create an allocatable 428 if ((*e)->rank > 0 && (*e)->shape == NULL && !flag_realloc_lhs) 595 if (e->shape == NULL) 597 /* We don't know the shape at compile time, so we use an 605 /* Copy the shape. */ 617 mpz_set (q->value.integer, e->shape[i]); 647 result->shape = gfc_copy_shape (e->shape, e->rank); 1766 (*e)->shape = fn->shape; [all...] |
H A D | trans-io.c | 2042 ss_array->shape = gfc_get_shape (cm->as->rank); 2051 mpz_init (ss_array->shape[n]); 2052 mpz_sub (ss_array->shape[n], cm->as->upper[n]->value.integer, 2054 mpz_add_ui (ss_array->shape[n], ss_array->shape[n], 1); 2089 gcc_assert (ss_array->shape != NULL); 2090 gfc_free_shape (&ss_array->shape, cm->as->rank);
|
H A D | resolve.c | 341 shape until we know if it has the pointer or allocatable attributes. 1226 cons->expr->shape = gfc_copy_shape (para->shape, para->rank); 2077 /* Function specific; set the result rank and shape. */ 2081 if (!expr->shape && arg->expr->shape) 2083 expr->shape = gfc_get_shape (rank); 2085 mpz_init_set (expr->shape[i], arg->expr->shape[i]); 2280 strncpy (errmsg, _("assumed-shape argumen 8844 mpz_t shape[GFC_MAX_DIMENSIONS]; local [all...] |
H A D | module.c | 3081 /* Save and restore the shape of an array constructor. */ 3086 mpz_t *shape; local 3090 /* A NULL shape is represented by (). */ 3095 shape = *pshape; 3096 if (!shape) 3112 shape = gfc_get_shape (rank); 3113 *pshape = shape; 3117 mio_gmp_integer (&shape[n]); 3429 mio_shape (&e->shape, e->rank); 4912 read is an index for an assumed shape dumm [all...] |
H A D | intrinsic.c | 1200 *p = "p", *ar = "array", *shp = "shape", *src = "source", 2671 add_sym_2 ("shape", GFC_ISYM_SHAPE, CLASS_INQUIRY, ACTUAL_NO, BT_INTEGER, di, GFC_STD_F95, 2676 make_generic ("shape", GFC_ISYM_SHAPE, GFC_STD_F95); 3292 "shape", BT_INTEGER, di, OPTIONAL, INTENT_IN); 4597 mpz_t *shape; local 4697 shape = expr->shape; 4707 new_expr->shape = gfc_copy_shape (shape, rank); 4758 mpz_t *shape; local [all...] |
/haiku-buildtools/gcc/gcc/config/arm/ |
H A D | neon.ml | 269 (* A specification as to the shape of instruction expected upon 270 disassembly, used if it differs from the shape used to build the 273 instruction, each with a corresponding shape specified here. *) 403 SHAPE. For a Use_operands shape, if ARGPOS is passed then return the mode 407 let rec mode_of_elt ?argpos elt shape = 414 in match shape with 435 | _ -> failwith "invalid shape" 437 (* Modify an element type dependent on the shape of the instruction and the 440 let shapemap shape no = 442 match shape wit [all...] |
H A D | neon-testgen.ml | 186 (* Given an intrinsic shape, produce a regexp that will match 188 that shape. *) 189 let rec analyze_shape shape = 216 match shape with 245 let test_intrinsic dir opcode features shape name munge elt_ty = 250 let c_arity, new_elt_ty = munge shape elt_ty in 291 (analyze_all_shapes features shape analyze_shape) 318 let test_intrinsic_group dir (opcode, features, shape, name, munge, types) = 319 List.iter (test_intrinsic dir opcode features shape name munge) types
|
/haiku-buildtools/gcc/gcc/ |
H A D | graph.c | 76 const char *shape; local 81 shape = "Mdiamond"; 86 shape = "record"; 95 "[shape=%s,style=filled,fillcolor=%s,label=\"", 96 funcdef_no, bb->index, shape, fillcolor);
|
H A D | reginfo.c | 85 subreg_shape shape; member in struct:simplifiable_subreg 1246 return value->shape.unique_id (); 1253 return value->shape == *compare; 1257 : shape (shape_in) 1266 simplifiable_subregs (const subreg_shape &shape) 1273 ->find_slot_with_hash (&shape, shape.unique_id (), INSERT)); 1277 simplifiable_subreg *info = new simplifiable_subreg (shape); 1279 if (HARD_REGNO_MODE_OK (i, shape.inner_mode) 1280 && simplify_subreg_regno (i, shape 1259 simplifiable_subregs(const subreg_shape &shape) argument [all...] |