Searched refs:VEC_index (Results 26 - 50 of 59) sorted by relevance

123

/openbsd-current/gnu/gcc/gcc/cp/
H A Dtypeck2.c909 constructor_elt *ce = VEC_index (constructor_elt,
992 ce = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (init), 0);
H A Ddecl2.c595 for (fndecls = VEC_index (tree, methods, ix);
646 fndecls = VEC_index (tree, methods, ix);
656 fndecls = VEC_index (tree, methods, ix);
H A Dmangle.c638 tree candidate = VEC_index (tree, G.substitutions, i);
1439 tree type = VEC_index (tree, local_classes, ix);
H A Dmethod.c928 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
H A Ddecl.c891 t = VEC_index (tree, local_names, i);
4665 str_init = VEC_index (constructor_elt,
4754 d.cur = VEC_index (constructor_elt, v, 0);
5127 if (value_dependent_init_p (VEC_index (constructor_elt,
5889 tree value = VEC_index (constructor_elt, v, 0)->value;
H A Dclass.c989 current_fns = insert_p ? NULL_TREE : VEC_index (tree, method_vec, slot);
1857 (VEC_index (tree, ffod->path, depth), ffod, depth))
2314 for (methods = VEC_index (tree, CLASSTYPE_METHOD_VEC (t), i);
H A Dcp-tree.h1243 (VEC_index (tree, CLASSTYPE_METHOD_VEC (NODE), CLASSTYPE_CONSTRUCTOR_SLOT))
1251 ? VEC_index (tree, CLASSTYPE_METHOD_VEC (NODE), CLASSTYPE_DESTRUCTOR_SLOT) \
/openbsd-current/gnu/gcc/gcc/
H A Dtree-ssa.c581 debug_variable (VEC_index (tree, name_tag_reps, j));
611 debug_variable (VEC_index (tree, name_tag_reps, i));
H A Dtree-flow.h436 #define ssa_name(i) (VEC_index (tree, ssa_names, (i)))
H A Dtree-ssa-propagate.c218 bb = VEC_index (basic_block, cfg_blocks, cfg_blocks_head);
H A Dc-pragma.c777 handler = *VEC_index (pragma_handler, registered_pragmas, id);
H A Dtree-ssa-structalias.c288 return VEC_index (varinfo_t, varmap, n);
296 varinfo_t v = VEC_index (varinfo_t, varmap, n);
676 found = VEC_index (constraint_t, vec, place);
790 || !constraint_equal (*c, *VEC_index (constraint_t, complex, place)))
4170 fo = VEC_index (fieldoff_s, fieldstack, 0);
H A Dtree.h1377 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1387 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1388 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
2209 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2228 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
H A Dtree-ssa-alias.c1595 new_alias = VEC_index (tree, ann->may_aliases, 0);
2752 tree ali = VEC_index (tree, aliases, 0);
2823 ali = add_may_alias_for_new_tag (tag, VEC_index (tree, overlaps, 0));
H A Dtree-eh.c523 if (VEC_index (tree, tf->dest_array, index) == lab)
1010 if (VEC_index (tree, tf->dest_array, 0) == tf->fallthru_label)
H A Dtoplev.c1012 input_file_stack = VEC_index (fs_p, input_file_stack_history, tick - 1);
H A Dtree-dump.c280 tree access = (accesses ? VEC_index (tree, accesses, ix)
H A Dgimplify.c1391 tree elt = VEC_index (tree, labels, i);
1435 TREE_VEC_ELT (label_vec, i) = VEC_index (tree, labels, i);
1757 tree t = VEC_index (tree, stack, i);
3126 r = VEC_index (constructor_elt, elts, 0)->value;
3127 i = VEC_index (constructor_elt, elts, 1)->value;
H A Dvec.h175 #define VEC_index(T,V,I) (VEC_OP(T,base,index)(VEC_BASE(V),I VEC_CHECK_INFO)) macro
H A Dvarasm.c2633 constructor_elt *c1 = VEC_index (constructor_elt, v1, idx);
2634 constructor_elt *c2 = VEC_index (constructor_elt, v2, idx);
6162 anchor = VEC_index (rtx, block->anchors, middle);
H A Dfunction.c4649 == VEC_index (int, *vec, j))
4656 if (INSN_UID (insn) == VEC_index (int, *vec, j))
5553 *block = VEC_index (tree, cfun->ib_boundaries_block, uid);
H A Dloop-unroll.c1931 reg = VEC_index (rtx, ve->var_expansions, ve->reuse_expansion - 1);
H A Ddbxout.c2068 tree access = (accesses ? VEC_index (tree, accesses, i)
H A Dtree-cfg.c843 return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid);
2796 || !VEC_index (basic_block, label_to_block_map, uid));
H A Dtree-ssa-pre.c417 if (VEC_index (tree, ve2->vuses, i) != vuse1)
1701 first = VEC_index (basic_block, worklist, 0);

Completed in 610 milliseconds

123