Lines Matching refs:keyword
460 const char *keyword; /* keyword, or NULL if none */
461 const char *value; /* keyword value, or NULL if kw==NULL */
519 const char *keyword; /* keyword, or NULL if none */
520 const char *value; /* keyword value, or NULL if kw==NULL */
603 * @param status return status (keyword too long)
604 * @return length of the keyword name
612 *status = U_ILLEGAL_ARGUMENT_ERROR; /* malformed keyword name */
618 /* keyword name too long for internal buffer */
624 *status = U_ILLEGAL_ARGUMENT_ERROR; /* empty keyword name */
633 char keyword[ULOC_KEYWORD_BUFFER_LEN];
641 const char* leftString = ((const KeywordStruct *)left)->keyword;
642 const char* rightString = ((const KeywordStruct *)right)->keyword;
650 * If addKeyword is not NULL is must have length small enough to fit in KeywordStruct.keyword.
673 if(prev == '@') { /* start of keyword definition */
696 /* need to normalize both keyword and keyword name */
698 /* keyword name too long for internal buffer */
704 keywordList[numKeywords].keyword[n++] = uprv_tolower(pos[i]);
708 /* zero-length keyword is an error. */
714 keywordList[numKeywords].keyword[n] = 0;
746 /* If this is a duplicate keyword, then ignore it */
748 if (uprv_strcmp(keywordList[j].keyword, keywordList[numKeywords].keyword) == 0) {
762 /* Search for duplicate; if found, do nothing. Explicit keyword
765 if (uprv_strcmp(keywordList[j].keyword, addKeyword) == 0) {
775 uprv_strcpy(keywordList[numKeywords].keyword, addKeyword);
789 /* Now construct the keyword part */
792 uprv_strcpy(keywords+keywordsLen, keywordList[i].keyword);
883 /* find the first keyword */
905 *status = U_ILLEGAL_ARGUMENT_ERROR; /* empty keyword name in passed-in locale */
911 *status = U_ILLEGAL_ARGUMENT_ERROR; /* malformed keyword name */
917 /* keyword name too long for internal buffer */
927 /* current entry matches the keyword. */
1051 /* search for keyword */
1073 *status = U_ILLEGAL_ARGUMENT_ERROR; /* empty keyword name in passed-in locale */
1079 *status = U_ILLEGAL_ARGUMENT_ERROR; /* malformed keyword name */
1085 /* keyword name too long for internal buffer */
1111 /* Current entry matches the input keyword. Update the entry */
1121 /* input keyword sorts earlier than current entry, add before current entry */
1159 /* if input key/value specified removal of a keyword not present in locale, or
1523 /* Keyword enumeration */
1878 addKeyword = VARIANT_MAP[j].keyword;
1897 if (CANONICALIZE_MAP[j].keyword) {
1898 addKeyword = CANONICALIZE_MAP[j].keyword;
2578 uloc_toUnicodeLocaleKey(const char* keyword)
2580 const char* bcpKey = ulocimp_toBcpKey(keyword);
2581 if (bcpKey == NULL && ultag_isUnicodeLocaleKey(keyword, -1)) {
2582 // unknown keyword, but syntax is fine..
2583 return keyword;
2589 uloc_toUnicodeLocaleType(const char* keyword, const char* value)
2591 const char* bcpType = ulocimp_toBcpType(keyword, value, NULL, NULL);
2593 // unknown keyword, but syntax is fine..
2634 uloc_toLegacyKey(const char* keyword)
2636 const char* legacyKey = ulocimp_toLegacyKey(keyword);
2641 // LDML/CLDR provides some definition of keyword syntax in
2645 if (isWellFormedLegacyKey(keyword)) {
2646 return keyword;
2653 uloc_toLegacyType(const char* keyword, const char* value)
2655 const char* legacyType = ulocimp_toLegacyType(keyword, value, NULL, NULL);
2660 // LDML/CLDR provides some definition of keyword syntax in
