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

  /src/usr.bin/xlint/lint2/
hash.c 82 hte_t *hte; local in function:hash_search
88 for (hte = table[h]; hte != NULL; hte = hte->h_link) {
89 if (strcmp(hte->h_name, s) == 0)
93 if (hte != NULL || !mknew)
94 return hte;
96 /* create a new hte */
97 hte = xmalloc(sizeof(*hte))
154 hte_t *hte; local in function:symtab_forall
167 hte_t *hte; local in function:symtab_forall_sorted
191 hte_t *hte, *nexthte; local in function:hash_free
    [all...]
chk.c 84 hte_t *hte; local in function:mark_main_as_used
86 if ((hte = htab_search("main", false)) != NULL)
87 hte->h_used = true;
94 check_name(const hte_t *hte)
99 check_used_not_defined(hte);
100 check_defined_not_used(hte);
102 check_declared_not_used_or_defined(hte);
104 check_multiple_definitions(hte);
108 for (sym = hte->h_syms; sym != NULL; sym = sym->s_next) {
124 chkvtui(hte, def, decl)
    [all...]
read.c 318 hte_t *hte; local in function:funccall
376 hte = hash_search(renametab, name, false);
377 if (hte != NULL)
378 hte = hte->h_hte;
380 hte = htab_search(name, true);
381 hte->h_used = true;
385 *hte->h_lcall = fcall;
386 hte->h_lcall = &fcall->f_next;
471 hte_t *hte, *renamehte = NULL local in function:decldef
564 hte_t *hte; local in function:usedsym
    [all...]
lint2.h 50 struct hte *_t_tag; /* hash table entry of tag if
52 struct hte *_t_tynam; /* hash table entry of typename if
166 typedef struct hte { struct
177 struct hte *h_link; /* next hte with same hash function */
178 struct hte *h_hte; /* pointer to other htes (for renames) */
  /src/sys/external/bsd/ipf/netinet/
ip_htable.c 527 iphtent_t hte, *ent; local in function:ipf_htable_node_del
530 if (op->iplo_size != sizeof(hte)) {
535 err = COPYIN(op->iplo_struct, &hte, sizeof(hte));
547 ent = ipf_htent_find(iph, &hte);
819 iphtent_t hte; local in function:ipf_htable_node_add
822 if (op->iplo_size != sizeof(hte)) {
827 err = COPYIN(op->iplo_struct, &hte, sizeof(hte));
832 hte.ipe_uid = uid
    [all...]

Completed in 16 milliseconds