Lines Matching refs:str
19 struct qstr str;
25 struct qstr str;
41 struct qstr str;
42 str.name = name;
43 str.len = strlen(name);
44 str.hash = make_hash(str.name, str.len);
46 return str;
68 bid_entry->str = make_qstr(bid_entry_name);
79 kfree(bid_entry->str.name);
101 bitem->str = make_qstr(bitem_name);
111 kfree(bitem->str.name);
121 static int query_##_attr_##_hash_entry(struct qstr *str) \
129 bid_entry, hash_node, node, str->hash) { \
130 if (qstr_case_eq(str, &bid_entry->str)) { \
140 static int insert_##_attr_##_hash_entry(struct qstr *str, int id) \
146 sharefs_info("insert name = %s", str->name); \
150 bid_entry, hash_node, node, str->hash) { \
151 if (qstr_case_eq(str, &bid_entry->str)) { \
159 bid_entry = alloc_bid_entry(str->name, id); \
166 bid_entry->str.hash); \
171 static void remove_##_attr_##_hash_entry(struct qstr *str) \
176 sharefs_info("remove name = %s", str->name); \
180 bid_entry, hash_node, node, str->hash) { \
181 if (qstr_case_eq(str, &bid_entry->str)) { \
202 kfree(bid_entry->str.name); \
210 struct qstr str; \
212 str = make_qstr(bname); \
213 return query_##_attr_##_hash_entry(&str); \
225 id = query_##_attr_##_hash_entry(&bitem->str); \
247 err = insert_##_attr_##_hash_entry(&bitem->str, id); \
280 remove_appid_hash_entry(&bitem->str);
281 remove_appid_hash_entry(&bitem->str);