Lines Matching defs:string
2341 fprintf (file, _("<corrupt string length: %#x>\n"), len);
2351 fprintf (file, _("<corrupt string offset: %#lx>\n"), entry);
2545 fprintf (file, " String table starts at offset: %#03x\n",
3143 bfd_byte * string;
3213 entry->name_id.name.string = address + 2;
3351 rsrc_string * string)
3353 bfd_put_16 (data->abfd, string->len, data->next_string);
3354 memcpy (data->next_string + 2, string->string, string->len * 2);
3355 data->next_string += (string->len + 1) * 2;
3549 /* We have to perform a case insenstive, unicode string comparison... */
3550 astring = a->name_id.name.string;
3552 bstring = b->name_id.name.string;
3557 unicode == UTF-16 == wchar_t. The case insensitive string comparison
3618 rsrc_print_name (char * buffer, rsrc_string string)
3621 bfd_byte * name = string.string;
3623 for (i = string.len; i--; name += 2)
3654 case 6: strcat (buffer, " (STRING)"); is_string = TRUE; break;
3708 an index into unicode string table that makes up the data of the leaf.
3709 So identical type-name-lang string resources may not actually be
3712 This function is called when we have detected two string resources with
3713 match top-28-bit IDs. We have to scan the string tables inside the leaves
3765 _bfd_error_handler (_(".rsrc merge failure: duplicate string resource: %d"),
3774 (We never get string resources with fully empty string
