Searched refs:chain (Results 1 - 25 of 160) sorted by relevance

1234567

/haiku-buildtools/legacy/gcc/gcc/
H A Dpcp.h32 STRINGDEF *chain; /* Global list of strings in natural order */ member in struct:stringdef
40 KEYDEF *chain; member in struct:keydef
H A Dcaller-save.c337 struct insn_chain *chain, *next;
342 for (chain = reload_insn_chain; chain != 0; chain = next)
344 rtx insn = chain->insn;
347 next = chain->next;
349 if (chain->is_caller_save_insn)
373 regno += insert_restore (chain, 1, regno, MOVE_MAX_WORDS);
384 REG_SET_TO_HARD_REG_SET (hard_regs_to_save, chain->live_before);
385 compute_use_by_pseudos (&hard_regs_to_save, chain
334 struct insn_chain *chain, *next; local
[all...]
H A Dstupid.c282 struct insn_chain *chain;
293 chain = new_insn_chain ();
295 reload_insn_chain->prev = chain;
296 chain->next = reload_insn_chain;
297 chain->prev = 0;
298 reload_insn_chain = chain;
299 chain->block = 0;
300 chain->insn = insn;
303 SET_REGNO_REG_SET (chain->live_before, i);
311 stupid_mark_refs (PATTERN (insn), chain);
279 struct insn_chain *chain; local
308 stupid_mark_refs (PATTERN (insn), chain); local
346 stupid_mark_refs (CALL_INSN_FUNCTION_USAGE (insn), chain); local
414 struct insn_chain *chain; local
708 stupid_mark_refs (SET_SRC (x), chain); local
710 stupid_mark_refs (SET_DEST (x), chain); local
762 stupid_mark_refs (XEXP (x, i), chain); local
767 stupid_mark_refs (XVECEXP (x, i, j), chain); local
[all...]
H A Dreload1.c382 static void find_reload_regs PROTO((struct insn_chain *chain,
624 /* Make sure that the last insn in the chain
881 struct insn_chain *chain;
1002 for (chain = insns_need_reload; chain != 0;
1003 chain = chain->next_need_reload)
1004 find_reload_regs (chain, dumpfile);
1257 struct insn_chain *chain;
1259 for (chain
876 struct insn_chain *chain; local
1252 struct insn_chain *chain; local
1369 struct insn_chain *chain; local
3847 struct insn_chain *chain; local
4211 struct insn_chain *chain; local
[all...]
/haiku-buildtools/gcc/gcc/objc/
H A Dobjc-runtime-shared-support.c115 add_field_decl (tree type, const char *name, tree **chain) argument
119 if (*chain != NULL)
120 **chain = field;
121 *chain = &DECL_CHAIN (field);
175 tree decls, *chain = NULL; local
180 decls = add_field_decl (objc_object_type, "self", &chain);
184 "super_class", &chain); local
201 tree decls, *chain = NULL; local
206 decls = add_field_decl (objc_selector_type, "_cmd", &chain);
209 add_field_decl (string_type_node, "method_types", &chain);
212 add_field_decl (build_pointer_type (void_type_node), "_imp", &chain); local
223 tree decls, *chain = NULL; local
248 tree array_type, decls, *chain = NULL; local
279 tree array_type, decls, *chain = NULL; local
309 tree *chain, decl, type; local
490 tree decls, *chain = NULL; local
585 tree array_type, decls, *chain = NULL; local
611 tree decls, *chain = NULL; local
634 tree chain; local
695 tree chain, string_expr; local
[all...]
H A Dobjc-gnu-runtime-abi-01.c334 tree decls, *chain = NULL; local
339 decls = add_field_decl (objc_selector_type, "sel_id", &chain);
342 add_field_decl (string_type_node, "sel_type", &chain);
366 tree ptype, decls, *chain = NULL; local
372 "isa", &chain);
376 "super_class", &chain); local
379 add_field_decl (string_type_node, "name", &chain);
382 add_field_decl (long_integer_type_node, "version", &chain);
385 add_field_decl (long_integer_type_node, "info", &chain);
388 add_field_decl (long_integer_type_node, "instance_size", &chain);
417 "gc_object_type", &chain); local
433 tree ptype, decls, *chain = NULL; local
467 tree ptype, decls, *chain = NULL; local
631 tree *chain = &sel_ref_chain; local
755 tree expr, protocol_struct_type, *chain; local
874 tree *chain, decl; local
1015 generate_classref_translation_entry(tree chain) argument
1211 generate_v1_meth_descriptor_table(tree chain, tree protocol, const char *prefix) argument
1360 generate_dispatch_table(tree chain, const char *name) argument
1595 generate_ivars_list(tree chain, const char *name) argument
1636 tree chain, inst_ivars = NULL_TREE, class_ivars = NULL_TREE; local
1763 handle_class_ref(tree chain) argument
1821 tree chain, expr; local
1985 tree fields, array_type, *chain = NULL; local
1994 add_field_decl (build_pointer_type (objc_selector_type), "refs", &chain); local
2075 tree chain; local
[all...]
H A Dobjc-next-runtime-abi-01.c434 tree ptype, decls, *chain = NULL; local
440 "isa", &chain);
444 "super_class", &chain); local
447 add_field_decl (string_type_node, "name", &chain);
450 add_field_decl (long_integer_type_node, "version", &chain);
453 add_field_decl (long_integer_type_node, "info", &chain);
456 add_field_decl (long_integer_type_node, "instance_size", &chain);
459 add_field_decl (objc_ivar_list_ptr,"ivars", &chain);
462 add_field_decl (objc_method_list_ptr, "methods", &chain);
467 add_field_decl (ptype, "cache", &chain);
488 add_field_decl (build_pointer_type (void_type_node), "sel_id", &chain); local
491 &chain); local
513 tree ptype, decls, *chain = NULL; local
567 tree ptype, decls, *chain = NULL; local
706 tree *chain; local
770 tree chain = cls_ref_chain ; local
803 tree *chain = &sel_ref_chain; local
1061 tree decls, *chain = NULL; local
1090 tree decls, *chain = NULL; local
1124 tree ptrt, decls, *chain = NULL; local
1156 generate_v1_meth_descriptor_table(tree chain, tree protocol, const char *prefix, tree attr) argument
1267 tree array_type, decls, *chain = NULL; local
1672 generate_dispatch_table(tree chain, const char *name, tree attr) argument
1976 generate_ivars_list(tree chain, const char *name, tree attr) argument
2018 tree chain, inst_ivars = NULL_TREE, class_ivars = NULL_TREE; local
2199 tree fields, *chain = NULL; local
2207 add_field_decl (build_pointer_type (objc_selector_type), "refs", &chain); local
2329 generate_classref_translation_entry(tree chain) argument
2351 tree chain, attr; local
2435 tree decls, temp_type, *chain = NULL; local
[all...]
H A Dobjc-next-runtime-abi-02.c557 tree decls, *chain = NULL; local
575 decls = add_field_decl (objc_v2_imp_type, "messenger", &chain);
578 add_field_decl (objc_selector_type, "name", &chain);
584 chain = NULL;
601 add_field_decl (objc_v2_super_imp_type, "messenger", &chain);
604 add_field_decl (objc_selector_type, "name", &chain);
648 tree decls, *chain = NULL; local
655 decls = add_field_decl (integer_type_node, "flags", &chain);
658 add_field_decl (integer_type_node, "instanceStart", &chain);
661 add_field_decl (integer_type_node, "instanceSize", &chain);
706 "superclass", &chain); local
709 add_field_decl (build_pointer_type (void_type_node), "cache", &chain); local
712 add_field_decl (build_pointer_type (objc_v2_imp_type), "vtable", &chain); local
715 add_field_decl (build_pointer_type (objc_v2_class_ro_template), "ro", &chain); local
728 tree decls, *chain = NULL; local
758 tree decls, *chain = NULL; local
771 "protocol_list", &chain); local
812 tree decls, *chain = NULL; local
821 add_field_decl (build_pointer_type (objc_v2_class_template), "cls", &chain); local
831 "protocol_list", &chain ); local
1162 tree *chain = &sel_ref_chain; local
1804 tree decls, *chain = NULL; local
1831 tree decls, *chain = NULL; local
2283 tree array_type, decls, *chain = NULL; local
2305 generate_v2_meth_descriptor_table(tree chain, tree protocol, const char *prefix, tree attr) argument
2394 tree array_type, decls, *chain = NULL; local
2621 generate_v2_dispatch_table(tree chain, const char *name, tree attr) argument
2893 tree decls, *chain = NULL; local
2906 "list", &chain); local
2918 generate_v2_ivars_list(tree chain, const char *name, tree attr, tree templ) argument
3096 tree field, firstIvar, chain; local
3414 tree decls, *chain = NULL; local
3424 add_field_decl (build_pointer_type (objc_v2_class_template), "cls", &chain); local
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D920428-6.c4 struct x *chain; member in struct:x
17 for (; t; t = t->chain )
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A D20040209-1.c8 tree chain; member in struct:tree_common
39 x = x->common.chain;
49 x = x->common.chain;
H A Dloadpre6.c10 tree chain; member in struct:tree_common
34 /* There are some reloaded loads of *cell, and cell->common.chain on various
49 *cell = ((*cell)->common.chain);
53 cell = &((*cell)->common.chain);
68 unexpanded_var_list->common.chain = last;
/haiku-buildtools/gcc/libgcc/config/nios2/
H A Dtramp.c24 R12 is the static chain register.
27 movhi r12,%hi(chain)
28 ori r12,%lo(chain)
47 unsigned int chain = (unsigned int) chainptr; local
50 addr[0] = MOVHI (SC_REGNO, ((chain >> 16) & 0xffff));
51 addr[1] = ORI (SC_REGNO, (chain & 0xffff));
/haiku-buildtools/gcc/gcc/
H A Dtree-predcom.c62 the same chain. The chains are then processed independently,
67 In our example, we get the following chains (the chain for c is invalid).
79 single root reference of the chain (adjusting their distance
99 and we can combine the chains for e and f into one chain.
101 5) For each root reference (end of the chain) R, let N be maximum distance
277 /* Distance of the reference from the root of the chain (in number of
293 /* Type of the chain of the references. */
297 /* The addresses of the references in the chain are constant. */
300 /* There are only loads in the chain. */
303 /* Root of the chain i
312 typedef struct chain struct
421 dump_chain(FILE *file, chain_p chain) argument
500 chain_p chain; local
538 release_chain(chain_p chain) argument
562 chain_p chain; variable
991 get_chain_root(chain_p chain) argument
999 add_ref_to_chain(chain_p chain, dref ref) argument
1034 chain_p chain = XCNEW (struct chain); local
1056 chain_p chain = XCNEW (struct chain); local
1071 nontrivial_chain_p(chain_p chain) argument
1206 insert_looparound_copy(chain_p chain, dref ref, gphi *phi) argument
1233 add_looparound_copies(struct loop *loop, chain_p chain) argument
1261 chain_p chain = NULL; local
1450 get_init_expr(chain_p chain, unsigned index) argument
1482 initialize_root_vars(struct loop *loop, chain_p chain, bitmap tmp_vars) argument
1536 initialize_root(struct loop *loop, chain_p chain, bitmap tmp_vars) argument
1604 execute_load_motion(struct loop *loop, chain_p chain, bitmap tmp_vars) argument
1738 execute_pred_commoning_chain(struct loop *loop, chain_p chain, bitmap tmp_vars) argument
1772 chain_p chain; variable
1814 chain_p chain; local
1849 chain_p chain; variable
1870 chain_p chain; variable
1984 chain_can_be_combined_p(chain_p chain) argument
2396 prepare_initializers_chain(struct loop *loop, chain_p chain) argument
2451 chain_p chain; local
[all...]
H A Dcaller-save.c345 /* True if it is first hard register in the chain of hard registers
349 slot in the chain. -1 represents end of the chain. */
451 struct insn_chain *chain, *next;
462 for (chain = reload_insn_chain; chain != 0; chain = next)
466 insn = chain->insn;
467 next = chain->next;
473 &chain
448 struct insn_chain *chain, *next; local
773 struct insn_chain *chain, *next, *last = NULL; local
1215 insert_restore(struct insn_chain *chain, int before_p, int regno, int maxrestore, machine_mode *save_mode) argument
1296 insert_save(struct insn_chain *chain, int before_p, int regno, HARD_REG_SET (*to_save), machine_mode *save_mode) argument
1398 insert_one_insn(struct insn_chain *chain, int before_p, int code, rtx pat) argument
[all...]
H A Dregrename.c58 opened and closed; if a chain isn't closed at the end of the block,
67 3. For each chain, the set of possible renaming registers is computed.
71 4. The best renaming register is computed for the chain in the above set,
76 5. If a renaming register has been found, it is substituted in the chain.
123 /* The id to be given to the next opened chain. */
148 /* Return the chain corresponding to id number ID. Take into account that
154 du_head_p chain = first_chain; local
155 while (chain->id != id)
157 id = chain->id;
158 chain
591 du_head_p chain; local
603 set_incoming_from_chain(struct bb_rename_info *ri, du_head_p chain) argument
759 struct du_head *chain; local
809 struct du_head *chain = regrename_chain_from_id (j); local
874 struct du_head *chain = regrename_chain_from_id (j); local
942 struct du_chain *chain; local
1024 struct du_head *chain; local
[all...]
H A Dincpath.c1 /* Set up combined include path chain for the preprocessor.
66 /* Free an element of the include chain, possibly giving a reason. */
97 add_env_var_paths (const char *env_var, int chain) argument
121 add_path (path, chain, chain == SYSTEM, false);
125 /* Append the standard include chain defined in cppdefault.c. */
235 /* For each duplicate path in chain HEAD, keep just the first one.
236 Remove each path in chain HEAD that also exists in chain SYSTEM.
237 Set the NEXT pointer of the last path in the resulting chain t
321 add_sysroot_to_chain(const char *sysroot, int chain) argument
410 add_cpp_dir_path(cpp_dir *p, int chain) argument
422 add_path(char *path, int chain, int cxx_aware, bool user_supplied_p) argument
497 get_added_cpp_dirs(int chain) argument
[all...]
/haiku-buildtools/jam/
H A Drules.c16 * targetlist() - turn list of target names into a TARGET chain
17 * targetentry() - add a TARGET to a chain of TARGETS
19 * actionlist() - append to an ACTION chain
146 * targetlist() - turn list of target names into a TARGET chain
149 * chain existing TARGETS to append to
155 TARGETS *chain,
159 chain = targetentry( chain, bindtarget( targets->string ) );
161 return chain;
165 * targetentry() - add a TARGET to a chain o
153 targetlist( TARGETS *chain, LIST *targets ) argument
172 targetentry( TARGETS *chain, TARGET *target ) argument
198 targetchain( TARGETS *chain, TARGETS *targets ) argument
220 actionlist( ACTIONS *chain, ACTION *action ) argument
[all...]
H A Drules.h17 * ACTIONS - a chain of ACTIONs
20 * TARGETS - a chain of TARGETs
76 /* ACTIONS - a chain of ACTIONs */
102 /* TARGETS - a chain of TARGETs */
181 TARGETS *targetlist( TARGETS *chain, LIST *targets );
182 TARGETS *targetentry( TARGETS *chain, TARGET *target );
183 TARGETS *targetchain( TARGETS *chain, TARGETS *targets );
184 ACTIONS *actionlist( ACTIONS *chain, ACTION *action );
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dcwsc1.c29 register void *chain __asm__(CHAIN);
30 return chain;
/haiku-buildtools/gcc/libstdc++-v3/include/ext/
H A Dtypelist.h67 struct chain struct in namespace:typelist
148 struct apply_<Fn, chain<Hd, Tl> >
170 struct apply_generator1_<Gn, chain<Hd, Tl> >
192 struct apply_generator2_<Gn, chain<Hd1, TlT>, chain<Hd2, TlV> >
214 struct append_<chain<Hd, Tl>, Typelist_Chain>
220 typedef chain<Hd, typename append_type::type> type;
245 struct append_typelist_<chain<Hd, null_type> >
247 typedef chain<Hd, null_type> type;
251 struct append_typelist_<chain< H
[all...]
/haiku-buildtools/legacy/gcc/gcc/objc/
H A Dobjc-act.c1034 /* Add this type to the chain of variants of TYPE. */
1084 /* Add this type to the chain of variants of TYPE. */
1335 /* Given a chain of OBJC_STRING_CST's, build a static instance of
1401 tree *chain, decl;
1409 for (chain = &objc_static_instances;
1410 *chain && TREE_VALUE (*chain) != class_decl;
1411 chain = &TREE_CHAIN (*chain));
1412 if (!*chain)
1397 tree *chain, decl; local
1853 tree chain; local
1956 tree chain, string_expr; local
2084 tree chain, initlist = NULL_TREE; local
2183 tree *chain = &sel_ref_chain; local
2210 tree *chain = &sel_ref_chain; local
2274 tree chain; local
2305 tree *chain; local
2350 tree *chain, decl; local
2466 tree chain; local
2490 tree chain; local
2962 tree initlist, chain, method_list_template; local
3916 tree initlist, ivar_list_template, chain; local
4090 tree initlist, chain, method_list_template; local
4636 tree declspecs, chain; local
4865 tree chain, exp, arg; local
4993 tree chain = args, prev = NULL_TREE; local
5569 tree chain = CLASS_NST_METHODS (inter); local
5622 tree chain = CLASS_CLS_METHODS (inter); local
6175 tree chain = implemented_classes; local
6446 tree chain; local
7508 tree chain = TREE_PURPOSE (TREE_OPERAND (decl, 1)); local
7523 tree chain = TYPE_ARG_TYPES (decl); local
7541 tree chain; local
7677 tree chain; local
7699 tree chain = protocol_list; local
7753 tree chain = protocol_list; local
7838 tree chain = protocol_list; local
7897 tree chain = protocol_list; local
7961 tree chain; local
8016 tree chain; local
8223 tree chain; local
[all...]
/haiku-buildtools/legacy/gcc/gcc/ch/
H A Dsatisfy.c29 #define SATISFY(ARG) ((ARG) = satisfy(ARG, chain))
42 #define LOOKUP_ONLY (chain==&dummy_chain)
44 /* Recursive helper routine to logically reverse the chain. */
46 cycle_error_print (chain, decl)
47 struct decl_chain *chain;
50 if (chain->decl != decl)
52 cycle_error_print (chain->prev, decl);
53 if (TREE_CODE_CLASS (TREE_CODE (chain->decl)) == 'd')
54 error_with_decl (chain->decl, " `%s', which depends on ...");
65 struct decl_chain *chain local
454 satisfy_list_values (TYPE_ARG_TYPES (exp), chain); local
576 satisfy_list (TYPE_TAG_VALUES (exp), chain); local
[all...]
/haiku-buildtools/legacy/gcc/libchill/
H A Drts.h89 struct EVENTQUEUE *chain; /* list of all events in an DELAY CASE */ member in struct:EVENTQUEUE
109 struct BUFFER_WAIT_QUEUE *chain; member in struct:BUFFER_WAIT_QUEUE
H A Dcontinue.c78 wrk = wrk->chain;
/haiku-buildtools/binutils/gas/
H A Dsubsegs.c78 frchainS *frcP; /* crawl frchain chain */
279 frchainS *chain;
285 for (chain = seginfo->frchainP; chain; chain = chain->frch_next)
287 for (frag = chain->frch_root; frag; frag = frag->fr_next)
290 if (obstack_next_free (&chain->frch_obstack)
291 != chain->frch_last->fr_literal)
276 frchainS *chain; local

Completed in 442 milliseconds

1234567