Lines Matching defs:NULL
464 static struct ls_expr * pre_ldst_mems = NULL;
467 static htab_t pre_ldst_table = NULL;
808 obstack_free (&gcse_obstack, NULL);
854 if (recog (PATTERN (insn), insn, NULL) >= 0)
959 reg_set_bitmap = BITMAP_ALLOC (NULL);
967 modify_mem_list_set = BITMAP_ALLOC (NULL);
968 blocks_with_calls = BITMAP_ALLOC (NULL);
1008 properties. If NULL, then it is not necessary to compute or record that
1039 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
1053 for (occr = expr->antic_occr; occr != NULL; occr = occr->next)
1065 for (occr = expr->avail_occr; occr != NULL; occr = occr->next)
1102 obstack_free (®_set_obstack, NULL);
1358 if (expr_equiv_p (dest, gcse_mem_operand) && pre_ldst_mems != NULL)
1415 note_stores (PATTERN (setter), mems_conflict_for_gcse_p, NULL);
1457 NULL, /*have_reg_qty=*/false);
1501 struct expr *cur_expr, *last_expr = NULL;
1527 if (table->table[hash] == NULL)
1537 cur_expr->next_same_hash = NULL;
1538 cur_expr->antic_occr = NULL;
1539 cur_expr->avail_occr = NULL;
1548 antic_occr = NULL;
1602 struct expr *cur_expr, *last_expr = NULL;
1624 if (table->table[hash] == NULL)
1636 cur_expr->next_same_hash = NULL;
1637 cur_expr->antic_occr = NULL;
1638 cur_expr->avail_occr = NULL;
1886 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
2055 reg_avail_info[i].last_bb = NULL;
2107 reg_avail_info = NULL;
2159 table entry, or NULL if not found. */
2204 *listp = NULL;
2463 for (r = reg_set_table[REGNO (x)]; r != NULL; r = r->next)
2477 for (r = reg_set_table[REGNO (x)]; r != NULL; r = r->next)
2579 compute_local_properties (cprop_absaltered, cprop_pavloc, NULL, &set_hash_table);
2711 NULL no such set is found. */
2778 JUMP_INSNS. JUMP must be a conditional jump. If SETCC is non-NULL
2863 if (setcc != NULL && CC0_P (SET_DEST (single_set (setcc))))
2870 if (dump_file != NULL)
2891 && (sset = single_set (insn)) != NULL
2913 return cprop_jump (BLOCK_FOR_INSN (insn), NULL, insn, from, to);
2931 note_uses (&PATTERN (insn), find_used_regs, NULL);
2937 find_used_regs (&XEXP (note, 0), NULL);
2975 if (dump_file != NULL)
2994 if (dump_file != NULL)
3064 rtx newreg = NULL, newcnst = NULL;
3111 if (dump_file != NULL)
3126 if (dump_file != NULL)
3217 NULL);
3219 local_cprop_find_used_regs (&XEXP (note, 0), NULL);
3268 if (dump_file != NULL)
3293 if (dump_file != NULL)
3312 return get_condition (jump, NULL, false, true);
3422 implicit_sets = NULL;
3465 block BB. Returns NULL if no such set is found. Based heavily upon
3522 basic block BB which has more than one predecessor. If not NULL, SETCC
3524 JUMP. Otherwise, SETCC is NULL, and JUMP is the first insn of BB.
3541 insn = (setcc != NULL) ? setcc : jump;
3545 note_uses (&PATTERN (insn), find_used_regs, NULL);
3548 find_used_regs (&XEXP (note, 0), NULL);
3608 if (setcc != NULL)
3624 dest = edest->insns.r ? NULL : edest->dest;
3632 dest = NULL;
3635 dest = NULL;
3643 dest = NULL;
3646 if (dest != NULL
3661 if (dump_file != NULL)
3792 pre_optimal = NULL;
3793 pre_redundant = NULL;
3794 pre_insert_map = NULL;
3795 pre_delete_map = NULL;
3820 transp = comp = NULL;
3821 pre_optimal = pre_redundant = pre_insert_map = pre_delete_map = NULL;
3842 for (e = expr_hash_table.table[ui]; e != NULL; e = e->next_same_hash)
3876 antloc = NULL;
3878 ae_kill = NULL;
3889 been visited. It is NULL for the top-level call.
4160 for (occr = expr->antic_occr; occr != NULL; occr = occr->next)
4338 for (expr = expr_hash_table.table[i]; expr != NULL; expr = expr->next_same_hash)
4345 if (expr->reaching_reg == NULL)
4351 for (occr = expr->antic_occr; occr != NULL; occr = occr->next)
4356 for (avail = expr->avail_occr; avail != NULL; avail = avail->next)
4434 expr != NULL;
4442 for (occr = expr->antic_occr; occr != NULL; occr = occr->next)
4455 if (expr->reaching_reg == NULL)
4514 for (expr = expr_hash_table.table[i]; expr != NULL; expr = expr->next_same_hash)
4798 if (visited == NULL)
4833 return (pred == NULL);
4856 for (expr = expr_hash_table.table[i]; expr != NULL; expr = expr->next_same_hash)
4896 if (hoist_expr_reaches_here_p (bb, i, dominated, NULL))
4955 if (hoist_expr_reaches_here_p (bb, i, dominated, NULL))
4974 if (expr->reaching_reg == NULL)
5054 return hash_rtx (x->pattern, GET_MODE (x->pattern), &do_not_record_p, NULL, false);
5077 NULL, /*have_reg_qty=*/false);
5087 ptr->expr = NULL;
5120 pre_ldst_table = NULL;
5131 pre_ldst_mems = NULL;
5143 for (ptr = first_ls_expr(); ptr != NULL; ptr = next_ls_expr (ptr))
5177 return NULL;
5181 return NULL;
5193 for (ptr = pre_ldst_mems; ptr != NULL; ptr = ptr->next)
5303 pre_ldst_mems = NULL;
5305 pre_ldst_expr_eq, NULL);
5367 while (ptr != NULL)
5378 expr != NULL;
5403 if (dump_file && pre_ldst_mems != NULL)
5766 pre_ldst_expr_eq, NULL);
5812 note_stores (pat, reg_set_info, NULL);
5836 for (ptr = first_ls_expr (); ptr != NULL; ptr = next_ls_expr (ptr))
5848 ptr != NULL;
6074 for (ptr = first_ls_expr (); ptr != NULL; ptr = next_ls_expr (ptr))
6076 for (st = AVAIL_STORE_LIST (ptr); st != NULL; st = XEXP (st, 1))
6096 for (st = ANTIC_STORE_LIST (ptr); st != NULL; st = XEXP (st, 1))
6116 for (ptr = first_ls_expr (); ptr != NULL; ptr = next_ls_expr (ptr))
6119 bb, regs_set_in_block, NULL))
6212 /* If tmp is NULL, we found an insertion on every edge, blank the
6263 act = (EDGE_COUNT (ei_container (ei)) > 0 ? EDGE_I (ei_container (ei), 0) : NULL);
6283 act = (! ei_end_p (ei)) ? ei_edge (ei) : NULL;
6314 act = (! ei_end_p (ei)) ? ei_edge (ei) : NULL;
6321 act = (EDGE_COUNT (ei_container (ei)) > 0 ? EDGE_I (ei_container (ei), 0) : NULL);
6447 ae_gen = ae_kill = transp = st_antloc = NULL;
6448 pre_insert_map = pre_delete_map = reg_set_in_block = NULL;
6475 pre_ldst_table = NULL;
6491 for (ptr = first_ls_expr (); ptr != NULL; ptr = next_ls_expr (ptr))
6502 if (dump_file != NULL)
6586 obstack_free (&gcse_obstack, NULL);
6664 NULL, /* sub */
6665 NULL, /* next */
6733 NULL, /* sub */
6734 NULL, /* next */