HomeSort by: relevance | last modified time | path
    Searched defs:address_p (Results 1 - 8 of 8) sorted by relevancy

  /src/external/gpl3/gdb/dist/gdb/
solib-target.c 85 ULONGEST *address_p local
87 CORE_ADDR address = (CORE_ADDR) *address_p;
104 ULONGEST *address_p local
106 CORE_ADDR address = (CORE_ADDR) *address_p;
  /src/external/gpl3/gdb.old/dist/gdb/
solib-target.c 85 ULONGEST *address_p local
87 CORE_ADDR address = (CORE_ADDR) *address_p;
104 ULONGEST *address_p local
106 CORE_ADDR address = (CORE_ADDR) *address_p;
  /src/external/gpl3/gcc/dist/gcc/
genoutput.cc 57 c. `address_p' indicates that the operand appears within ADDRESS
121 char address_p;
460 d->operand[opno].address_p = this_address_p;
481 d->operand[opno].address_p = 0;
501 d->operand[opno].address_p = 0;
120 char address_p; member in struct:operand_data
tree-ssa-loop-ivopts.cc 562 address_p (use_type type) function
1608 if (address_p (type))
1622 if (!address_p (use->type))
2675 gcc_assert (address_p (group->type));
2727 gcc_assert (address_p (use->type));
3590 && address_p (use->type))
3635 if (use != NULL && address_p (use->type))
4903 from induction variable CAND. If ADDRESS_P is true, we just need
4912 struct iv_cand *cand, bool address_p, bitmap *inv_vars,
4936 if (address_p
    [all...]
tree-ssa-structalias.cc 3008 If address_p is true, the result will be taken its address of. */
3011 get_constraint_for_ssa_var (tree t, vec<ce_s> *results, bool address_p)
3027 get_constraint_for_ssa_var (SSA_NAME_VAR (t), results, address_p); local
3060 if (address_p
3077 if (!address_p
3286 If address_p is true the result will be taken its address of.
3292 bool address_p, bool lhs_p)
3397 if (address_p)
3404 if (address_p && results->length () == 0)
3517 get_constraint_for_1 (tree t, vec<ce_s> *results, bool address_p,
3638 get_constraint_for_1 (TREE_OPERAND (t, 0), results, address_p, local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
genoutput.cc 57 c. `address_p' indicates that the operand appears within ADDRESS
121 char address_p;
459 d->operand[opno].address_p = this_address_p;
480 d->operand[opno].address_p = 0;
500 d->operand[opno].address_p = 0;
120 char address_p; member in struct:operand_data
tree-ssa-loop-ivopts.cc 562 address_p (use_type type) function
1606 if (address_p (type))
1617 if (!address_p (use->type))
2660 gcc_assert (address_p (group->type));
2712 gcc_assert (address_p (use->type));
3550 && address_p (use->type))
3594 if (use != NULL && address_p (use->type))
4854 from induction variable CAND. If ADDRESS_P is true, we just need
4863 struct iv_cand *cand, bool address_p, bitmap *inv_vars,
4887 if (address_p
    [all...]
tree-ssa-structalias.cc 2975 If address_p is true, the result will be taken its address of. */
2978 get_constraint_for_ssa_var (tree t, vec<ce_s> *results, bool address_p)
2994 get_constraint_for_ssa_var (SSA_NAME_VAR (t), results, address_p); local
3027 if (address_p
3044 if (!address_p
3253 If address_p is true the result will be taken its address of.
3259 bool address_p, bool lhs_p)
3364 if (address_p)
3371 if (address_p && results->length () == 0)
3484 get_constraint_for_1 (tree t, vec<ce_s> *results, bool address_p,
3605 get_constraint_for_1 (TREE_OPERAND (t, 0), results, address_p, local
    [all...]

Completed in 42 milliseconds