binutils/bfd/syms.c

846 /* We keep an array of indexentry structures to record where in the
850 struct indexentry
860 /* Compare two indexentry structures.  This is called via qsort.  */
865   const struct indexentry *contestantA = a;
866   const struct indexentry *contestantB = b;
890   struct indexentry *indextable;
896   struct indexentry *cached_indexentry;
922   struct indexentry *indexentry;
1118       amt *= sizeof (struct indexentry);
1237       qsort (info->indextable, (size_t) i, sizeof (struct indexentry),
1253       indexentry = info->cached_indexentry;
1264       indexentry = NULL;
1274 	      indexentry = &info->indextable[mid];
1284       if (indexentry == NULL)
1287       stab = indexentry->stab + STABSIZE;
1288       file_name = indexentry->file_name;
1291   directory_name = indexentry->directory_name;
1292   str = indexentry->str;
1296   for (; stab < (indexentry+1)->stab; stab += STABSIZE)
1321 	  val = ((indexentry->function_name ? indexentry->val : 0)
1335 	      info->cached_indexentry = indexentry;
1384   if (indexentry->function_name != NULL)
1391       s = strchr (indexentry->function_name, ':');
1395       *pfnname = indexentry->function_name;