Lines Matching full:keyword
454 const char *keyword; /* keyword, or NULL if none */
455 const char *value; /* keyword value, or NULL if kw==NULL */
520 const char *keyword; /* keyword, or NULL if none */
521 const char *value; /* keyword value, or NULL if kw==NULL */
598 * @param status return status (keyword too long)
599 * @return length of the keyword name
607 /* keyword name too long for internal buffer */
612 /* normalize the keyword name */
622 char keyword[ULOC_KEYWORD_BUFFER_LEN];
630 const char* leftString = ((const KeywordStruct *)left)->keyword;
631 const char* rightString = ((const KeywordStruct *)right)->keyword;
639 * If addKeyword is not NULL is must have length small enough to fit in KeywordStruct.keyword.
662 if(prev == '@') { /* start of keyword definition */
685 /* need to normalize both keyword and keyword name */
687 /* keyword name too long for internal buffer */
693 keywordList[numKeywords].keyword[n++] = uprv_tolower(pos[i]);
696 keywordList[numKeywords].keyword[n] = 0;
724 /* If this is a duplicate keyword, then ignore it */
726 if (uprv_strcmp(keywordList[j].keyword, keywordList[numKeywords].keyword) == 0) {
740 /* Search for duplicate; if found, do nothing. Explicit keyword
743 if (uprv_strcmp(keywordList[j].keyword, addKeyword) == 0) {
753 uprv_strcpy(keywordList[numKeywords].keyword, addKeyword);
767 /* Now construct the keyword part */
770 uprv_strcpy(keywords+keywordsLen, keywordList[i].keyword);
857 /* find the first keyword */
865 /* need to normalize both keyword and keyword name */
870 /* keyword name too long for internal buffer */
890 /* we actually found the keyword. Copy the value */
932 int32_t keywordAtEnd = 0; /* is the keyword at the end of the string? */
997 /* search for keyword */
1005 /* need to normalize both keyword and keyword name */
1010 /* keyword name too long for internal buffer */
1030 /* we actually found the keyword. Change the value */
1065 } else { /* removing a keyword */
1069 return (int32_t)((keywordStart-buffer)-1); /* (string length without keyword) minus separator */
1076 } else if(rc<0){ /* end match keyword */
1084 return bufLen; /* removal of non-extant keyword - no change */
1087 /* we know there is at least one keyword. */
1459 /* Keyword enumeration */
1809 addKeyword = VARIANT_MAP[j].keyword;
1831 if (CANONICALIZE_MAP[j].keyword) {
1832 addKeyword = CANONICALIZE_MAP[j].keyword;
