bool for_insert, int *depth_required)
 {
        unsigned hash, incr, filter_idx, depth, depth_max;
-       struct efx_filter_spec *cmp;
 
        hash = efx_filter_hash(key);
        incr = efx_filter_increment(key);
-       depth_max = (spec->priority <= EFX_FILTER_PRI_HINT ?
-                    FILTER_CTL_SRCH_HINT_MAX : FILTER_CTL_SRCH_MAX);
-
-       for (depth = 1, filter_idx = hash & (table->size - 1);
-            depth <= depth_max && test_bit(filter_idx, table->used_bitmap);
-            ++depth) {
-               cmp = &table->spec[filter_idx];
-               if (efx_filter_equal(spec, cmp))
-                       goto found;
+
+       filter_idx = hash & (table->size - 1);
+       depth = 1;
+       depth_max = (for_insert ?
+                    (spec->priority <= EFX_FILTER_PRI_HINT ?
+                     FILTER_CTL_SRCH_HINT_MAX : FILTER_CTL_SRCH_MAX) :
+                    table->search_depth[spec->type]);
+
+       for (;;) {
+               /* Return success if entry is used and matches this spec
+                * or entry is unused and we are trying to insert.
+                */
+               if (test_bit(filter_idx, table->used_bitmap) ?
+                   efx_filter_equal(spec, &table->spec[filter_idx]) :
+                   for_insert) {
+                       *depth_required = depth;
+                       return filter_idx;
+               }
+
+               /* Return failure if we reached the maximum search depth */
+               if (depth == depth_max)
+                       return for_insert ? -EBUSY : -ENOENT;
+
                filter_idx = (filter_idx + incr) & (table->size - 1);
+               ++depth;
        }
-       if (!for_insert)
-               return -ENOENT;
-       if (depth > depth_max)
-               return -EBUSY;
-found:
-       *depth_required = depth;
-       return filter_idx;
 }
 
 /* Construct/deconstruct external filter IDs */