Lines Matching refs:ab
36 Dwarf_Abbrev ab;
41 if ((ab = malloc(sizeof(struct _Dwarf_Abbrev))) == NULL) {
47 ab->ab_entry = entry;
48 ab->ab_tag = tag;
49 ab->ab_children = children;
50 ab->ab_offset = aboff;
51 ab->ab_length = 0; /* fill in later. */
52 ab->ab_atnum = 0; /* fill in later. */
55 STAILQ_INIT(&ab->ab_attrdef);
60 sizeof(ab->ab_entry), ab);
62 *abp = ab;
67 _dwarf_attrdef_add(Dwarf_Debug dbg, Dwarf_Abbrev ab, uint64_t attr,
72 if (ab == NULL) {
88 STAILQ_INSERT_TAIL(&ab->ab_attrdef, ad, ad_next);
91 ab->ab_atnum++;
158 Dwarf_Abbrev ab;
167 HASH_FIND(ab_hh, cu->cu_abbrev_hash, &entry, sizeof(entry), ab);
168 if (ab != NULL) {
169 *abp = ab;
184 ret = _dwarf_abbrev_parse(cu->cu_dbg, cu, &offset, &ab, error);
187 if (ab->ab_entry == entry) {
189 *abp = ab;
192 if (ab->ab_entry == 0) {
205 Dwarf_Abbrev ab, tab;
210 HASH_ITER(ab_hh, cu->cu_abbrev_hash, ab, tab) {
211 HASH_DELETE(ab_hh, cu->cu_abbrev_hash, ab);
212 STAILQ_FOREACH_SAFE(ad, &ab->ab_attrdef, ad_next, tad) {
213 STAILQ_REMOVE(&ab->ab_attrdef, ad, _Dwarf_AttrDef,
217 free(ab);
225 Dwarf_Abbrev ab;
239 for (ab = cu->cu_abbrev_hash; ab != NULL; ab = ab->ab_hh.next) {
240 RCHECK(WRITE_ULEB128(ab->ab_entry));
241 RCHECK(WRITE_ULEB128(ab->ab_tag));
242 RCHECK(WRITE_VALUE(ab->ab_children, 1));
243 STAILQ_FOREACH(ad, &ab->ab_attrdef, ad_next) {