/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | 20030225-1.c | 26 static short *blk; local 32 blk = block + i; 34 if (! ((X1 = (blk[8 * 4] << 8)) | (X2 = blk[8 * 6]) 35 | (X3 = blk[8 * 2]) | (X4 = blk[8 * 1]) | (X5 = blk[8 * 7]) 36 | (X6 = blk[8 * 5]) | (X7 = blk[8 * 3]))) 38 blk[ [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | transfer_intrinsic_4.f | 15 character(len=8) :: blk local in subroutine:broken 22 & transfer(name2(nafix(bmix(idx1+i),1)),dum)//blk 23 & //blk), bmix(idx1+i+1), i = 1, n, 2 )
|
H A D | pr61209.f90 | 31 INTEGER :: blk local in subroutine:dbcsr_make_index_list 39 DO blk = 1, nblks 40 IF (td(local_rows(blki(1, blk))) .EQ. ithread) THEN
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/ |
H A D | pr24626-1.c | 8 static long F2(void *tree, long blk, bla after_node_func) argument
|
/haiku-buildtools/gcc/zlib/examples/ |
H A D | fitblk.c | 132 unsigned char *blk; /* intermediate and final stream */ local 147 blk = malloc(size + EXCESS); 152 if (ret != Z_OK || blk == NULL) 157 def.next_out = blk; 166 if (fwrite(blk, 1, have, stdout) != have || ferror(stdout)) 172 free(blk); 194 inf.next_in = blk; 211 def.next_out = blk; 219 if (fwrite(blk, 1, have, stdout) != have || ferror(stdout)) 228 free(blk); [all...] |
/haiku-buildtools/binutils/zlib/examples/ |
H A D | fitblk.c | 132 unsigned char *blk; /* intermediate and final stream */ local 147 blk = malloc(size + EXCESS); 152 if (ret != Z_OK || blk == NULL) 157 def.next_out = blk; 166 if (fwrite(blk, 1, have, stdout) != have || ferror(stdout)) 172 free(blk); 194 inf.next_in = blk; 211 def.next_out = blk; 219 if (fwrite(blk, 1, have, stdout) != have || ferror(stdout)) 228 free(blk); [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/other/ |
H A D | pr31078.C | 12 struct blk struct 15 template < class RPT, SSHORT BLOCK_TYPE = 0 > class pool_alloc_rpt:public blk
|
/haiku-buildtools/binutils/bfd/ |
H A D | vms-lib.c | 198 vms_read_block (bfd *abfd, unsigned int vbn, void *blk) argument 204 || bfd_bread (blk, VMS_BLOCK_SIZE, abfd) != VMS_BLOCK_SIZE) 213 vms_write_block (bfd *abfd, unsigned int vbn, void *blk) argument 219 || bfd_bwrite (blk, VMS_BLOCK_SIZE, abfd) != VMS_BLOCK_SIZE) 1609 } blk[MAX_LEVEL]; local 1634 blk[0].vbn = (*vbn)++; 1635 blk[0].len = 0; 1636 blk[0].lastlen = 0; 1725 if (blk[j].len + blk[ 2113 unsigned char blk[VMS_BLOCK_SIZE]; local 2235 unsigned char blk[VMS_BLOCK_SIZE]; local [all...] |
H A D | dwarf2.c | 64 struct dwarf_block *blk; member in union:attribute::__anon22 1010 struct dwarf_block *blk; local 1051 blk = (struct dwarf_block *) bfd_alloc (abfd, amt); 1052 if (blk == NULL) 1054 blk->size = read_2_bytes (abfd, info_ptr, info_ptr_end); 1056 blk->data = read_n_bytes (abfd, info_ptr, info_ptr_end, blk->size); 1057 info_ptr += blk->size; 1058 attr->u.blk = blk; [all...] |
H A D | vms-alpha.c | 548 vms_debug2 ((4, "EISD at 0x%x size 0x%x addr 0x%lx flags 0x%x blk %d\n", 3112 unsigned char blk[VMS_BLOCK_SIZE]; 3115 memset (blk, 0xff, sizeof (blk)); 3120 (struct vms_eisd *)(blk + (eisd->file_pos % VMS_BLOCK_SIZE))); 3127 if (bfd_bwrite (blk, sizeof (blk), abfd) != sizeof (blk)) 3130 memset (blk, 0xff, sizeof (blk)); 3107 unsigned char blk[VMS_BLOCK_SIZE]; local 3134 unsigned char blk[VMS_BLOCK_SIZE]; local [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | gcov.c | 1505 block_t *blk; 1555 for (ix = 0, blk = fn->blocks; ix != fn->num_blocks; ix++, blk++) 1561 for (arc = blk->succ; arc; arc = arc->succ_next) 1571 blk->num_succ--; 1582 for (arc = blk->succ; arc; arc = arc->succ_next) 1592 if (blk->is_call_site && arc->fall_through 1604 arc_t *start = blk->succ; 1632 blk->succ = start; 1637 blk 1504 block_t *blk; local [all...] |
H A D | sched-rgn.c | 581 /* Update_loop_relations(blk, hdr): Check if the loop headed by max_hdr[blk] 582 is still an inner loop. Put in max_hdr[blk] the header of the most inner 583 loop containing blk. */ 584 #define UPDATE_LOOP_RELATIONS(blk, hdr) \ 586 if (max_hdr[blk] == -1) \ 587 max_hdr[blk] = hdr; \ 588 else if (dfs_nr[max_hdr[blk]] > dfs_nr[hdr]) \ 590 else if (dfs_nr[max_hdr[blk]] < dfs_nr[hdr]) \ 592 bitmap_clear_bit (inner,max_hdr[blk]); \ [all...] |
/haiku-buildtools/legacy/binutils/bfd/ |
H A D | dwarf2.c | 63 struct dwarf_block *blk; member in union:attribute::__anon2347 557 struct dwarf_block *blk; local 572 blk = bfd_alloc (abfd, amt); 573 blk->size = read_2_bytes (abfd, info_ptr); 575 blk->data = read_n_bytes (abfd, info_ptr, blk->size); 576 info_ptr += blk->size; 577 attr->u.blk = blk; 581 blk [all...] |
H A D | elf32-xtensa.c | 581 int blk, block_count; 698 for (blk = 1; blk < block_count; blk++) 704 if (blocks[blk - 1].address == blocks[blk].address && 705 blocks[blk - 1].size != 0) 578 int blk, block_count; local
|
/haiku-buildtools/gcc/gcc/testsuite/jit.dg/ |
H A D | test-quadratic.c | 157 gcc_jit_block *blk = local 160 blk, NULL, 215 blk, NULL, 224 gcc_jit_block_end_with_void_return (blk, NULL);
|
H A D | test-nested-contexts.c | 179 gcc_jit_block *blk = local 182 blk, NULL, 202 blk, NULL, 240 gcc_jit_block_end_with_void_return (blk, NULL);
|
/haiku-buildtools/isl/include/isl/ |
H A D | vec.h | 17 #include <isl/blk.h>
|
H A D | ctx.h | 17 #include <isl/blk.h>
|
H A D | mat.h | 17 #include <isl/blk.h>
|
/haiku-buildtools/isl/ |
H A D | isl_blk.c | 10 #include <isl/blk.h>
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | libgcc2.c | 1912 long blk; 1923 for (blk = 0; blk < ptr->ncounts; blk++) 1925 if (!strcmp (p->funcname, ptr->functions[blk])) 2324 long blk, ncounts = blocks->ncounts; 2337 for (blk = 0; blk < ncounts; blk++) 2338 blocks->flags[blk] [all...] |
H A D | emit-rtl.c | 1857 unshare_all_decls (blk) 1858 tree blk; 1863 for (t = BLOCK_VARS (blk); t; t = TREE_CHAIN (t)) 1867 for (t = BLOCK_SUBBLOCKS (blk); t; t = TREE_CHAIN (t)) 1874 reset_used_decls (blk) 1875 tree blk; 1880 for (t = BLOCK_VARS (blk); t; t = TREE_CHAIN (t)) 1884 for (t = BLOCK_SUBBLOCKS (blk); t; t = TREE_CHAIN (t))
|
H A D | haifa-sched.c | 1428 /* Update_loop_relations(blk, hdr): Check if the loop headed by max_hdr[blk] 1429 is still an inner loop. Put in max_hdr[blk] the header of the most inner 1430 loop containing blk. */ 1431 #define UPDATE_LOOP_RELATIONS(blk, hdr) \ 1433 if (max_hdr[blk] == -1) \ 1434 max_hdr[blk] = hdr; \ 1435 else if (dfs_nr[max_hdr[blk]] > dfs_nr[hdr]) \ 1437 else if (dfs_nr[max_hdr[blk]] < dfs_nr[hdr]) \ 1439 RESET_BIT (inner,max_hdr[blk]); \ [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/goacc/ |
H A D | reduction.f95 | 25 common /blk/ i1 61 !$acc parallel reduction (+:/blk/) ! { dg-error "Syntax error" }
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/gomp/ |
H A D | target1.f90 | 392 common /blk/ i, j, q common in subroutine:bar
|