ii 45 lib/util/tests/idtree.c int ii = random() % n; ii 46 lib/util/tests/idtree.c void *p = idr_find(idr, ids[ii]); ii 47 lib/util/tests/idtree.c if (present[ii]) { ii 48 lib/util/tests/idtree.c if (p != &ids[ii]) { ii 51 lib/util/tests/idtree.c ii, p, &ids[ii])); ii 54 lib/util/tests/idtree.c if (idr_remove(idr, ids[ii]) != 0) { ii 57 lib/util/tests/idtree.c i, ids[ii])); ii 59 lib/util/tests/idtree.c present[ii] = 0; ii 60 lib/util/tests/idtree.c ids[ii] = -1; ii 67 lib/util/tests/idtree.c ii, p, ii 71 lib/util/tests/idtree.c ids[ii] = idr_get_new(idr, &ids[ii], n); ii 72 lib/util/tests/idtree.c if (ids[ii] < 0) { ii 75 lib/util/tests/idtree.c ii, ids[ii])); ii 77 lib/util/tests/idtree.c present[ii] = 1; ii 208 source3/registry/reg_eventlog.c int mbytes, ii; ii 271 source3/registry/reg_eventlog.c ii = numsources; ii 275 source3/registry/reg_eventlog.c while ( ii && wp && *wp ) { ii 284 source3/registry/reg_eventlog.c ii--; ii 213 source3/rpc_server/srv_dfs_nt.c int ii; ii 238 source3/rpc_server/srv_dfs_nt.c for(ii=0;ii<j->referral_count;ii++) { ii 241 source3/rpc_server/srv_dfs_nt.c struct dfs_StorageInfo* stor = &(dfs3->stores[ii]); ii 242 source3/rpc_server/srv_dfs_nt.c struct referral* ref = &(j->referral_list[ii]); ii 255 source3/rpc_server/srv_dfs_nt.c DEBUG(5,("storage %d: %s.%s\n",ii,path,p+1));