Lines Matching defs:entry
41 * struct reference - TIPC object reference entry
42 * @object: pointer to object associated with reference entry
56 * @capacity: array index of first unusable entry
57 * @init_point: array index of first uninitialized entry
58 * @first_free: array index of first unused object reference entry
59 * @last_free: array index of last unused object reference entry
88 /* account for unused entry, then round up size to a power of 2 */
143 struct reference *entry = NULL;
154 /* take a free entry, if available; otherwise initialize a new entry */
159 entry = &(tipc_ref_table.entries[index]);
161 next_plus_upper = entry->ref;
167 entry = &(tipc_ref_table.entries[index]);
168 spin_lock_init(&entry->lock);
177 * Grab the lock so no one else can modify this entry
180 if (entry) {
181 spin_lock_bh(&entry->lock);
182 entry->ref = ref;
183 entry->object = object;
184 *lock = &entry->lock;
197 * Disallow future references to an object and free up the entry for re-use.
198 * Note: The entry's spin_lock may still be busy after discard
203 struct reference *entry;
214 entry = &(tipc_ref_table.entries[index]);
218 if (!entry->object) {
222 if (entry->ref != ref) {
228 * mark entry as unused; increment instance part of entry's reference
232 entry->object = NULL;
233 entry->ref = (ref & ~index_mask) + (index_mask + 1);
235 /* append entry to free entry list */
254 struct reference *entry;
256 entry = &tipc_ref_table.entries[ref &
258 if (likely(entry->ref != 0)) {
259 spin_lock_bh(&entry->lock);
260 if (likely((entry->ref == ref) && (entry->object)))
261 return entry->object;
262 spin_unlock_bh(&entry->lock);
275 struct reference *entry;
277 entry = &tipc_ref_table.entries[ref &
279 if (likely((entry->ref == ref) && (entry->object)))
280 spin_unlock_bh(&entry->lock);
293 struct reference *entry;
295 entry = &tipc_ref_table.entries[ref &
297 if (likely(entry->ref == ref))
298 return entry->object;