Searched refs:elist (Results 1 - 5 of 5) sorted by relevance
| /haiku-buildtools/legacy/gcc/gcc/ |
| H A D | doschk.c | 240 ENT **elist, *ent; local
244 elist = (ENT **)malloc (sizeof (ENT *) * ecount);
246 elist[ecount] = ent;
248 qsort (elist, ecount, sizeof (ENT *), compare_ent_dosname);
254 if ((strcmp (elist[i]->dos_name, elist[i+1]->dos_name) == 0)
255 && (strcmp (elist[i]->path, elist[i+1]->path) == 0))
268 printf ("%14s : %s\n", elist[i]->dos_name, mpath (elist[
[all...] |
| /haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
| H A D | aliasing_dummy_1.f90 | 24 type(dtype) :: elist(2,2) variable in program:test_lex
32 elist = reshape (table%list, (/2,2/))
35 call foo3 (elist%word, 1)
36 call foo1 (elist%word, 3)
37 if (any (elist%word.ne.reshape ((/"i= 1","i= 2","i= 3","i= 4"/), (/2,2/)))) call abort ()
|
| /haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/g77/ |
| H A D | 980310-4.f | 20 * neval,ier,alist,blist,rlist,elist,iord,last)
131 c elist(1) and iord(1) are set to zero.
152 c elist - double precision
161 c such that elist(iord(1)), ...,
162 c elist(iord(k)) form a decreasing sequence,
176 * blist,b1,b2,dabs,defabs,defab1,defab2,dmax1,d1mach,elist,epmach, local in subroutine:dqage
182 dimension alist(limit),blist(limit),elist(limit),iord(limit),
196 c elist(i) - error estimate applying to rlist(i)
199 c errmax - elist(maxerr)
230 elist(
[all...] |
| /haiku-buildtools/gcc/gcc/ |
| H A D | cfganal.c | 227 struct edge_list *elist;
242 elist = XNEW (struct edge_list);
243 elist->num_edges = num_edges;
244 elist->index_to_edge = XNEWVEC (edge, num_edges);
252 elist->index_to_edge[num_edges++] = e;
254 return elist;
260 free_edge_list (struct edge_list *elist)
262 if (elist)
264 free (elist->index_to_edge);
265 free (elist);
225 struct edge_list *elist; local
258 free_edge_list(struct edge_list *elist) argument
270 print_edge_list(FILE *f, struct edge_list *elist) argument
297 verify_edge_list(FILE *f, struct edge_list *elist) argument
[all...] |
| /haiku-buildtools/legacy/gcc/gcc/ch/ |
| H A D | except.c | 298 tree elist = TREE_VALUE (t);
299 for ( ; elist != NULL_TREE; elist = TREE_CHAIN (elist))
302 build_chill_exception_decl (IDENTIFIER_POINTER(TREE_VALUE(elist)));
297 tree elist = TREE_VALUE (t); local
|
Completed in 103 milliseconds