Lines Matching +defs:suffix +defs:string
40 /* Start of this string needs to be aligned to
47 /* Entry this is a suffix of (if alignment is 0). */
48 struct sec_merge_hash_entry *suffix;
93 /* First string in this section. */
104 struct bfd_hash_table *table, const char *string)
114 entry = bfd_hash_newfunc (entry, table, string);
121 ret->u.suffix = NULL;
133 sec_merge_hash_lookup (struct sec_merge_hash *table, const char *string,
145 s = (const unsigned char *) string;
199 && memcmp (hashp->root.string, string, len) == 0)
201 /* If the string we found does not have at least the required
221 sec_merge_hash_newfunc (NULL, &table->table, string));
224 hashp->root.string = string;
317 str = entry->root.string;
376 /* Sanity check. If string character size is smaller than
379 of alignment. For non-string constants, alignment must
531 const unsigned char *s = (const unsigned char *) A->root.string + lenA - 1;
532 const unsigned char *t = (const unsigned char *) B->root.string + lenB - 1;
556 const unsigned char *s = (const unsigned char *) A->root.string + lenA - 1;
557 const unsigned char *t = (const unsigned char *) B->root.string + lenB - 1;
580 /* B cannot be a suffix of A unless A is equal to B, which is guaranteed
584 return memcmp (A->root.string + (A->len - B->len),
585 B->root.string, B->len) == 0;
639 cmp->u.suffix = e;
690 e->secinfo = e->u.suffix->secinfo;
691 e->alignment = e->u.suffix->alignment;
692 e->u.index = e->u.suffix->u.index + (e->u.suffix->len - e->len);