Lines Matching refs:str
22 struct qstr str;
28 struct qstr str;
44 struct qstr str;
45 str.name = name;
46 str.len = strlen(name);
47 str.hash = make_hash(str.name, str.len);
49 return str;
71 bid_entry->str = make_qstr(bid_entry_name);
82 kfree(bid_entry->str.name);
104 bitem->str = make_qstr(bitem_name);
114 kfree(bitem->str.name);
124 static int query_##_attr_##_hash_entry(struct qstr *str) \
132 bid_entry, hash_node, node, str->hash) { \
133 if (qstr_case_eq(str, &bid_entry->str)) { \
143 static int insert_##_attr_##_hash_entry(struct qstr *str, int id) \
149 hmdfs_info("insert name = %s", str->name); \
153 bid_entry, hash_node, node, str->hash) { \
154 if (qstr_case_eq(str, &bid_entry->str)) { \
162 bid_entry = alloc_bid_entry(str->name, id); \
169 bid_entry->str.hash); \
174 static void remove_##_attr_##_hash_entry(struct qstr *str) \
179 hmdfs_info("remove name = %s", str->name); \
183 bid_entry, hash_node, node, str->hash) { \
184 if (qstr_case_eq(str, &bid_entry->str)) { \
205 kfree(bid_entry->str.name); \
213 struct qstr str; \
215 str = make_qstr(bname); \
216 return query_##_attr_##_hash_entry(&str); \
228 id = query_##_attr_##_hash_entry(&bitem->str); \
250 err = insert_##_attr_##_hash_entry(&bitem->str, id); \
283 remove_appid_hash_entry(&bitem->str);
284 remove_appid_hash_entry(&bitem->str);