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

  /src/external/gpl3/gcc/dist/gcc/c-family/
c-common.cc 2023 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2026 in PNO_SP.
2033 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2042 PNO_SP list. The function merge_tlist takes care of that by merging the
2047 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
2064 *pno_sp = new_tlist (*pno_sp, x, writer);
2085 merge_tlist (pno_sp, tmp_list2, 0);
2107 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2114 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x)
2111 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x); local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/c-family/
c-common.cc 1984 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1987 in PNO_SP.
1994 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2003 PNO_SP list. The function merge_tlist takes care of that by merging the
2008 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
2025 *pno_sp = new_tlist (*pno_sp, x, writer);
2046 merge_tlist (pno_sp, tmp_list2, 0);
2068 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2075 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x)
2072 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x); local
    [all...]

Completed in 27 milliseconds