Lines Matching refs:ab
39 Dwarf_Abbrev ab;
44 if ((ab = malloc(sizeof(struct _Dwarf_Abbrev))) == NULL) {
50 ab->ab_entry = entry;
51 ab->ab_tag = tag;
52 ab->ab_children = children;
53 ab->ab_offset = aboff;
54 ab->ab_length = 0; /* fill in later. */
55 ab->ab_atnum = 0; /* fill in later. */
58 STAILQ_INIT(&ab->ab_attrdef);
63 sizeof(ab->ab_entry), ab);
65 *abp = ab;
70 _dwarf_attrdef_add(Dwarf_Debug dbg, Dwarf_Abbrev ab, uint64_t attr,
76 if (ab == NULL) {
93 STAILQ_INSERT_TAIL(&ab->ab_attrdef, ad, ad_next);
96 ab->ab_atnum++;
174 Dwarf_Abbrev ab;
183 HASH_FIND(ab_hh, cu->cu_abbrev_hash, &entry, sizeof(entry), ab);
184 if (ab != NULL) {
185 *abp = ab;
200 ret = _dwarf_abbrev_parse(cu->cu_dbg, cu, &offset, &ab, error);
203 if (ab->ab_entry == entry) {
205 *abp = ab;
208 if (ab->ab_entry == 0) {
221 Dwarf_Abbrev ab, tab;
226 HASH_ITER(ab_hh, cu->cu_abbrev_hash, ab, tab) {
227 HASH_DELETE(ab_hh, cu->cu_abbrev_hash, ab);
228 STAILQ_FOREACH_SAFE(ad, &ab->ab_attrdef, ad_next, tad) {
229 STAILQ_REMOVE(&ab->ab_attrdef, ad, _Dwarf_AttrDef,
233 free(ab);
241 Dwarf_Abbrev ab;
255 for (ab = cu->cu_abbrev_hash; ab != NULL; ab = ab->ab_hh.next) {
256 RCHECK(WRITE_ULEB128(ab->ab_entry));
257 RCHECK(WRITE_ULEB128(ab->ab_tag));
258 RCHECK(WRITE_VALUE(ab->ab_children, 1));
259 STAILQ_FOREACH(ad, &ab->ab_attrdef, ad_next) {
Indexes created Sat Apr 11 00:22:22 UTC 2026