Lines Matching refs:abbrevs

122 struct abbrevs
124 /* The number of abbrevs in the vector. */
126 /* The abbrevs, sorted by the code field. */
127 struct abbrev *abbrevs;
332 struct abbrevs abbrevs;
732 free_abbrevs (struct backtrace_state *state, struct abbrevs *abbrevs,
737 for (i = 0; i < abbrevs->num_abbrevs; ++i)
738 backtrace_free (state, abbrevs->abbrevs[i].attrs,
739 abbrevs->abbrevs[i].num_attrs * sizeof (struct attr),
741 backtrace_free (state, abbrevs->abbrevs,
742 abbrevs->num_abbrevs * sizeof (struct abbrev),
744 abbrevs->num_abbrevs = 0;
745 abbrevs->abbrevs = NULL;
1316 /* Sort the abbrevs by the abbrev code. This function is passed to
1332 different abbrevs with the same code, and that means we don't
1345 void *data, struct abbrevs *abbrevs)
1351 abbrevs->num_abbrevs = 0;
1352 abbrevs->abbrevs = NULL;
1369 /* Count the number of abbrevs in this list. */
1401 abbrevs->abbrevs = ((struct abbrev *)
1405 if (abbrevs->abbrevs == NULL)
1407 abbrevs->num_abbrevs = num_abbrevs;
1408 memset (abbrevs->abbrevs, 0, num_abbrevs * sizeof (struct abbrev));
1477 abbrevs->abbrevs[num_abbrevs] = a;
1481 backtrace_qsort (abbrevs->abbrevs, abbrevs->num_abbrevs,
1487 free_abbrevs (state, abbrevs, error_callback, data);
1494 lookup_abbrev (struct abbrevs *abbrevs, uint64_t code,
1500 /* With GCC, where abbrevs are simply numbered in order, we should
1502 if (code - 1 < abbrevs->num_abbrevs
1503 && abbrevs->abbrevs[code - 1].code == code)
1504 return &abbrevs->abbrevs[code - 1];
1509 p = bsearch (&key, abbrevs->abbrevs, abbrevs->num_abbrevs,
1957 abbrev = lookup_abbrev (&u->abbrevs, code, error_callback, data);
2179 memset (&u->abbrevs, 0, sizeof u->abbrevs);
2184 is_bigendian, error_callback, data, &u->abbrevs))
2244 free_abbrevs (state, &pu[i]->abbrevs, error_callback, data);
3081 abbrev = lookup_abbrev (&u->abbrevs, code, error_callback, data);
3212 abbrev = lookup_abbrev (&u->abbrevs, code, error_callback, data);