Searched refs:use (Results 1 - 25 of 204) sorted by relevance

123456789

/freebsd-9.3-release/contrib/gcc/
H A Dweb.c25 serve as an example of use for the dataflow module.
40 - We may use profile information and ignore infrequent use for the
100 /* For each use, all possible defs reaching it must come in the same
105 union_defs (struct df *df, struct df_ref *use, struct web_entry *def_entry, argument
109 rtx insn = DF_REF_INSN (use);
110 struct df_link *link = DF_REF_CHAIN (use);
128 /* Some instructions may use match_dup for their operands. In case the
135 if (use != use_link
136 && DF_REF_REAL_REG (use)
[all...]
H A Dloop-invariant.c67 /* The description of an use. */
69 struct use struct
71 rtx *pos; /* Position of the use. */
72 rtx insn; /* The insn in that the use occurs. */
74 struct use *next; /* Next use in the list. */
81 struct use *uses; /* The list of uses that are uniquely reached
230 invariant_for_use (struct df_ref *use) argument
234 basic_block bb = BLOCK_FOR_INSN (use->insn), def_bb;
236 if (use
262 struct df_ref *use; local
672 record_use(struct def *def, rtx *use, rtx insn) argument
695 struct df_ref *use, *def; local
807 struct df_ref *use; local
899 free_use_list(struct use *use) argument
1137 struct use *use; local
[all...]
H A Dtree-ssa-loop-ivopts.c44 -- The use costs. Each of the interesting uses chooses the best induction
57 4) The trees are transformed to use the new variables, the dead code is
96 /* The expected number of loop iterations. TODO -- use profiling instead of
109 bool have_use_for; /* Do we already have a use for it? */
110 unsigned use_id; /* The identifier in the use if it is the case. */
147 unsigned id; /* The id of the use. */
148 enum use_type type; /* Type of the use. */
234 use. */
248 /* Candidate assigned to a use, together with the related costs. */
280 /* Changed use
281 struct iv_use *use; member in struct:iv_ca_delta
412 dump_use(FILE *file, struct iv_use *use) argument
459 struct iv_use *use; local
1140 struct iv_use *use = XCNEW (struct iv_use); local
1196 struct iv_use *use; local
1976 add_candidate_1(struct ivopts_data *data, tree base, tree step, bool important, enum iv_position pos, struct iv_use *use, tree incremented_at) argument
2107 add_candidate(struct ivopts_data *data, tree base, tree step, bool important, struct iv_use *use) argument
2191 add_iv_value_candidates(struct ivopts_data *data, struct iv *iv, struct iv_use *use) argument
2220 struct iv_use *use = iv_use (data, i); local
2247 struct iv_use *use; local
2308 struct iv_use *use = iv_use (data, i); local
2336 set_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, unsigned cost, bitmap depends_on, tree value) argument
2378 get_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
3031 get_computation_aff(struct loop *loop, struct iv_use *use, struct iv_cand *cand, tree at, struct affine_tree_combination *aff) argument
3198 get_computation_at(struct loop *loop, struct iv_use *use, struct iv_cand *cand, tree at) argument
3214 get_computation(struct loop *loop, struct iv_use *use, struct iv_cand *cand) argument
3846 get_computation_cost_at(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *depends_on, tree at) argument
4011 get_computation_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *depends_on) argument
4023 determine_use_iv_cost_generic(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
4049 determine_use_iv_cost_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
4114 iv_elimination_compare(struct ivopts_data *data, struct iv_use *use) argument
4132 may_eliminate_iv(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, tree *bound) argument
4191 determine_use_iv_cost_condition(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
4240 determine_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
4265 struct iv_use *use; local
4543 iv_ca_set_no_cp(struct ivopts_data *data, struct iv_ca *ivs, struct iv_use *use) argument
4598 iv_ca_set_cp(struct ivopts_data *data, struct iv_ca *ivs, struct iv_use *use, struct cost_pair *cp) argument
4638 iv_ca_add_use(struct ivopts_data *data, struct iv_ca *ivs, struct iv_use *use) argument
4696 iv_ca_delta_add(struct iv_use *use, struct cost_pair *old_cp, struct cost_pair *new_cp, struct iv_ca_delta *next_change) argument
4733 iv_ca_cand_for_use(struct iv_ca *ivs, struct iv_use *use) argument
4882 struct iv_use *use; local
4925 struct iv_use *use; local
5054 try_add_cand_for(struct ivopts_data *data, struct iv_ca *ivs, struct iv_use *use) argument
5235 struct iv_use *use; local
5360 rewrite_use_nonlinear_expr(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
5585 rewrite_use_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
5604 rewrite_use_compare(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
5652 rewrite_use(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
5682 struct iv_use *use; local
5744 struct iv_use *use = iv_use (data, i); local
[all...]
H A Dtree-ssa-sink.c102 /* When the first immediate use is in a statement, then return true if all
104 We could also do the case where the first immediate use is in a phi node,
271 tree use, def; local
339 tree use = USE_FROM_PTR (use_p); local
340 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use))
382 use = USE_STMT (one_use);
383 if (TREE_CODE (use) != PHI_NODE)
385 sinkbb = bb_for_stmt (use);
389 return use;
398 sinkbb = find_bb_for_arg (use, de
[all...]
H A Dtree-ssa-threadedge.c285 tree use = USE_FROM_PTR (use_p); local
287 copy[i++] = use;
288 if (TREE_CODE (use) == SSA_NAME)
289 tmp = SSA_NAME_VALUE (use);
345 is available to use/clobber in DUMMY_COND.
441 then use the pass specific callback to simplify the condition. */
447 rather than use a relational operator. These are simpler to handle. */
467 /* If we haven't simplified to an invariant yet, then use the
514 tree use = USE_FROM_PTR (use_p); local
516 if (TREE_CODE (use)
[all...]
H A Ddf-problems.c201 /* Dump a def-use or use-def chain for REF to FILE. */
288 Find the locations in the function where each use site for a pseudo
306 built on demand. This bitvector contains a 1 for each use or reg
312 for the register. The confluence and transfer functions use
507 struct df_ref *use,
510 while (use)
512 if (top_flag == (DF_REF_FLAGS (use) & DF_REF_AT_TOP))
514 /* Add use to set of gens in this BB unless we have seen a
516 unsigned int regno = DF_REF_REGNO (use);
504 df_ru_bb_local_compute_process_use(struct df_ru_bb_info *bb_info, struct df_ref *use, enum df_ref_flags top_flag) argument
1459 struct df_ref *use; local
1677 bitmap use = bb_info->use; local
2872 struct df_ref *use; local
2905 df_chain_create_bb_process_use(struct dataflow *dflow, bitmap local_rd, struct df_ref *use, enum df_ref_flags top_flag) argument
3085 struct df_ref *use = DF_USES_GET (df, j); local
3495 struct df_ref *use; local
[all...]
H A Dtree-phinodes.c51 We could also use a zone allocator for these objects since they have
115 /* Dump some simple statistics regarding the re-use of PHI nodes. */
143 /* If our free list has an element, then use it. */
231 imm->use = &(PHI_ARG_DEF_TREE (phi, i));
275 portion of the PHI node currently in use. */
288 imm->use = &(PHI_ARG_DEF_TREE (new_phi, i));
298 imm->use = &(PHI_ARG_DEF_TREE (new_phi, i));
420 /* Set use on new node, and link into last element's place. */
421 *(new_p->use) = *(old_p->use);
[all...]
H A Dtree-flow-inline.h342 if (linknode->use)
343 gcc_assert (*(linknode->use) == def);
349 /* Set the value of a use pointed to by USE to VAL. */
351 set_ssa_use_from_ptr (use_operand_p use, tree val) argument
353 delink_imm_use (use);
354 *(use->use) = val;
355 link_imm_use (use, val);
358 /* Link ssa_imm_use node LINKNODE into the chain for DEF, with use occurring
375 gcc_assert (*(old->use)
501 get_use_from_ptr(use_operand_p use) argument
560 phi_arg_index_from_use(use_operand_p use) argument
1022 op_iter_next_maymustdef(use_operand_p *use, def_operand_p *def, ssa_op_iter *ptr) argument
1054 op_iter_init_maydef(ssa_op_iter *ptr, tree stmt, use_operand_p *use, def_operand_p *def) argument
1359 tree use = USE_FROM_PTR (head); local
[all...]
H A Dtree-ssa-loop-unswitch.c117 tree stmt, def, cond, use; local
127 FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE)
129 def = SSA_NAME_DEF_STMT (use);
/freebsd-9.3-release/contrib/bmake/mk/
H A Dlibnames.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
H A Dhost.libnames.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
H A Dinc.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
H A Dinit.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
H A Dlinks.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
H A Drst2htm.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
H A Dauto.obj.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
50 # This causes make to use the specified directory as .OBJDIR
53 .error could not use ${__objdir}
H A Dautoconf.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
63 # use of acconfig.h is deprecated!
H A Doptions.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
50 # if neither WITH[OUT]_FOO_UTILS is set, use value of ${OPTION_PREFIX}FOO
H A Dsys.dependfile.mk6 # be of use. There is absolutely NO WARRANTY.
8 # use this file is hereby granted provided that
28 # The order of preference: we will use the first one of these we find.
/freebsd-9.3-release/contrib/gcc/config/rs6000/
H A Ddarwin.md314 (use (match_operand:SI 2 "immediate_operand" "O,O,n,n"))
326 (use (match_operand:SI 2 "immediate_operand" "O,n"))
344 (use (match_operand:SI 3 "immediate_operand" "O,O,n,n"))
357 (use (match_operand:SI 3 "immediate_operand" "O,n"))
374 (use (match_operand 2 "immediate_operand" "O,n"))
375 (use (match_operand:SI 3 "register_operand" "l,l"))
389 (use (match_operand:SI 3 "immediate_operand" "O,n"))
390 (use (match_operand:SI 4 "register_operand" "l,l"))
405 (use (match_operand 2 "" ""))
406 (use (match_operan
[all...]
/freebsd-9.3-release/contrib/libstdc++/include/backward/
H A Dbackward_warning.h19 // As a special exception, you may use this file as part of a free software
21 // templates or use macros or inline functions from this file, or you compile
36 <iostream.h>. To disable this warning use -Wno-deprecated.
/freebsd-9.3-release/contrib/dialog/
H A Drc.c459 * At startup, dialog determines the settings to use as follows:
464 * b) if the file in (a) can't be found, use the file $HOME/.dialogrc
470 * d) if the file in (c) cannot be found, use the compiled-in defaults.
493 return 0; /* step (c) failed, use default values */
/freebsd-9.3-release/share/mk/
H A Dbsd.libnames.mk53 LIBFL?= "don't use LIBFL, use LIBL"
85 LIBLN?= "don't use LIBLN, use LIBL"
155 LIBTERMLIB?= "don't use LIBTERMLIB, use LIBTERMCAP"
156 LIBTINFO?= "don't use LIBTINFO, use LIBNCURSES"
/freebsd-9.3-release/crypto/openssl/crypto/des/
H A DFILES06 Imakefile - For use with kerberos.
13 GNUmakefile - The makefile for use with glibc.
16 vms.com - For use when compiling under VMS
37 cbc3_enc.c - des_3cbc_encrypt() source, don't use this function.
85 /* The following are for use with sun RPC implementaions. */
91 * contained in them. They are for use in the most recent incarnation of
/freebsd-9.3-release/contrib/ofed/management/opensm/include/opensm/
H A Dosm_qos_policy.h12 * Redistribution and use in source and binary forms, with or
76 char *use; /* single string (description) */ member in struct:osm_qos_port_group
107 char *use; member in struct:osm_qos_level
127 char *use; member in struct:osm_qos_match_rule

Completed in 151 milliseconds

123456789