Lines Matching defs:vscan_svc_nodes
119 * in vscan_svc_nodes, and decremented on scan_complete.
122 * inserting them into vscan_svc_nodes and the task queue (QUEUED).
134 * the request is removed from vscan_svc_reql and vscan_svc_nodes
186 uint32_t vsr_idx; /* vscan_svc_nodes index */
197 * vscan_svc_nodes - table of files being scanned
219 static vscan_svc_node_t *vscan_svc_nodes;
226 /* counts of entries in vscan_svc_reql, vscan_svc_nodes & vscan_svc_taskq */
237 * node table - vscan_svc_nodes
254 /* thread to insert reql entries into vscan_svc_nodes & vscan_svc_taskq */
279 /* thread to insert reql entries into vscan_svc_nodes & vscan_svc_taskq */
300 vscan_svc_nodes = kmem_zalloc(vscan_svc_nodes_sz, KM_SLEEP);
324 kmem_free(vscan_svc_nodes, vscan_svc_nodes_sz);
442 if (vscan_svc_nodes[idx].vsn_req)
443 vp = vscan_svc_nodes[idx].vsn_req->vsr_vp;
520 access = vscan_svc_nodes[req->vsr_idx].vsn_access;
534 * vscan_svc_nodes and vscan_svc_taskq
557 * Otherwise insert pending requests into vscan_svc_nodes
559 * vscan_svc_nodes break loop and wait for one
570 /* insert request into vscan_svc_nodes */
638 node = &vscan_svc_nodes[idx];
668 vscan_svc_nodes[idx].vsn_result = result;
681 * from the data in vscan_svc_nodes[idx].
694 node = &vscan_svc_nodes[idx];
758 * vscan_svc_nodes entry the result is discarded.
768 node = &vscan_svc_nodes[scan_rsp->vsr_idx];
811 if ((req = vscan_svc_nodes[idx].vsn_req) == NULL)
854 node = &vscan_svc_nodes[idx];
926 node = &vscan_svc_nodes[idx];
986 node = &vscan_svc_nodes[idx];
1229 * Insert request in next available available slot in vscan_svc_nodes
1245 if (vscan_svc_nodes[idx].vsn_req == NULL) {
1248 node = &vscan_svc_nodes[idx];
1273 (void) memset(&vscan_svc_nodes[idx], 0,