| /src/common/lib/libc/gen/ |
| radixtree.c | 150 entry_ptr(void *p) function
174 KASSERT(entry_ptr(p) != NULL || entry_tagmask(p) == 0);
237 return entry_ptr(*path_pptr(t, p, height));
551 c = entry_ptr(entry);
613 n = entry_ptr(*pptr);
687 return entry_ptr(oldp);
721 n = entry_ptr(entry);
748 n = entry_ptr(entry);
761 return entry_ptr(oldp);
780 return entry_ptr(*vpp)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| read-md.cc | 818 void **entry_ptr; local
821 entry_ptr = htab_find_slot (defs, &tmp_def, INSERT);
822 if (*entry_ptr)
824 def = (struct md_constant *) *entry_ptr;
839 *entry_ptr = def;
|
| lra-remat.cc | 221 void **entry_ptr;
223 entry_ptr = htab_find_slot (cand_table, cand, INSERT);
224 if (*entry_ptr == NULL)
225 *entry_ptr = (void *) cand;
226 return (cand_t) *entry_ptr;
220 void **entry_ptr; local
|
| expmed.cc | 2779 struct alg_hash_entry *entry_ptr;
2834 entry_ptr = alg_hash_entry_ptr (hash_index);
2835 if (entry_ptr->t == t
2836 && entry_ptr->mode == mode
2837 && entry_ptr->speed == speed
2838 && entry_ptr->alg != alg_unknown)
2840 cache_alg = entry_ptr->alg;
2845 multiplication by T within entry_ptr->cost. */
2846 if (!CHEAPER_MULT_COST (&entry_ptr->cost, cost_limit))
2860 if (CHEAPER_MULT_COST (cost_limit, &entry_ptr->cost)
2769 struct alg_hash_entry *entry_ptr; local
[all...] |
| genautomata.cc | 1816 void **entry_ptr;
1818 entry_ptr = htab_find_slot (automaton_decl_table, automaton_decl, INSERT);
1819 if (*entry_ptr == NULL)
1820 *entry_ptr = (void *) automaton_decl;
1821 return (decl_t) *entry_ptr;
1916 void **entry_ptr;
1918 entry_ptr = htab_find_slot (insn_decl_table, insn_decl, INSERT);
1919 if (*entry_ptr == NULL)
1920 *entry_ptr = (void *) insn_decl;
1921 return (decl_t) *entry_ptr;
1810 void **entry_ptr; local
1909 void **entry_ptr; local
2010 void **entry_ptr; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| read-md.cc | 818 void **entry_ptr; local
821 entry_ptr = htab_find_slot (defs, &tmp_def, INSERT);
822 if (*entry_ptr)
824 def = (struct md_constant *) *entry_ptr;
839 *entry_ptr = def;
|
| lra-remat.cc | 221 void **entry_ptr;
223 entry_ptr = htab_find_slot (cand_table, cand, INSERT);
224 if (*entry_ptr == NULL)
225 *entry_ptr = (void *) cand;
226 return (cand_t) *entry_ptr;
220 void **entry_ptr; local
|
| expmed.cc | 2767 struct alg_hash_entry *entry_ptr;
2822 entry_ptr = alg_hash_entry_ptr (hash_index);
2823 if (entry_ptr->t == t
2824 && entry_ptr->mode == mode
2825 && entry_ptr->speed == speed
2826 && entry_ptr->alg != alg_unknown)
2828 cache_alg = entry_ptr->alg;
2833 multiplication by T within entry_ptr->cost. */
2834 if (!CHEAPER_MULT_COST (&entry_ptr->cost, cost_limit))
2848 if (CHEAPER_MULT_COST (cost_limit, &entry_ptr->cost)
2757 struct alg_hash_entry *entry_ptr; local
[all...] |
| genautomata.cc | 1816 void **entry_ptr;
1818 entry_ptr = htab_find_slot (automaton_decl_table, automaton_decl, INSERT);
1819 if (*entry_ptr == NULL)
1820 *entry_ptr = (void *) automaton_decl;
1821 return (decl_t) *entry_ptr;
1916 void **entry_ptr;
1918 entry_ptr = htab_find_slot (insn_decl_table, insn_decl, INSERT);
1919 if (*entry_ptr == NULL)
1920 *entry_ptr = (void *) insn_decl;
1921 return (decl_t) *entry_ptr;
1810 void **entry_ptr; local
1909 void **entry_ptr; local
2010 void **entry_ptr; local
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/CodeGen/ |
| CGBlocks.cpp | 1560 llvm::BasicBlock::iterator entry_ptr = Builder.GetInsertPoint(); local
1561 --entry_ptr;
1575 ++entry_ptr;
1576 Builder.SetInsertPoint(entry, entry_ptr);
1596 entry_ptr == entry->end() ? nullptr : &*entry_ptr);
|
