Lines Matching full:string

18 	/* lookup index for each unique string in strings set */
67 			/* hashmap__add() returns EEXIST if string with the same  in strset__new()
110 /* Find string offset that corresponds to a given string *s*.
112  *   - >0 offset into string data, if string is found;
113  *   - -ENOENT, if string is not in the string data;
136 /* Add a string s to the string data. If the string already exists, return its
137  * offset within string data.
139  *   - > 0 offset into string data, on success;
149 	 * look up some string from the "outside", we need to first append it  in strset__add_str()
151 	 * until set->strs_data_len is incremented, that string is just a piece  in strset__add_str()
153 	 * other hand, if the string is unique, it's already appended and  in strset__add_str()
164 	/* Now attempt to add the string, but only if the string with the same  in strset__add_str()
166 	 * string exists, we'll get its offset in old_off (that's old_key).  in strset__add_str()
171 		return old_off; /* duplicated string, return existing offset */  in strset__add_str()
175 	set->strs_data_len += len; /* new unique string, adjust data length */  in strset__add_str()