51 	unsigned int num_locks;  member
81 	return brl->num_locks;  in brl_num_locks()
445 	for (i=0; i < br_lck->num_locks; i++) {  in brl_lock_windows_default()
479 				br_lck->num_locks,  in brl_lock_windows_default()
497 			       (br_lck->num_locks + 1));  in brl_lock_windows_default()
503 	memcpy(&locks[br_lck->num_locks], plock, sizeof(struct lock_struct));  in brl_lock_windows_default()
504 	br_lck->num_locks += 1;  in brl_lock_windows_default()
831 	tp = talloc_array(br_lck, struct lock_struct, br_lck->num_locks + 2);  in brl_lock_posix()
838 	for (i=0; i < br_lck->num_locks; i++) {  in brl_lock_posix()
948 	if (count < br_lck->num_locks + 2) {  in brl_lock_posix()
956 	br_lck->num_locks = count;  in brl_lock_posix()
1028 	TYPESAFE_QSORT(br_lck->lock_data, (size_t)br_lck->num_locks, lock_compare);  in brl_lock()
1039 				   unsigned num_locks,  in brl_delete_lock_struct()  argument
1042 	if (del_idx >= num_locks) {  in brl_delete_lock_struct()
1046 		sizeof(*locks) * (num_locks - del_idx - 1));  in brl_delete_lock_struct()
1066 	for (i = 0; i < br_lck->num_locks; i++) {  in brl_unlock_windows_default()
1082 	if (i != br_lck->num_locks) {  in brl_unlock_windows_default()
1088 	for (i = 0; i < br_lck->num_locks; i++) {  in brl_unlock_windows_default()
1102 	if (i == br_lck->num_locks) {  in brl_unlock_windows_default()
1111 	brl_delete_lock_struct(locks, br_lck->num_locks, i);  in brl_unlock_windows_default()
1112 	br_lck->num_locks -= 1;  in brl_unlock_windows_default()
1123 				br_lck->num_locks);  in brl_unlock_windows_default()
1158 	tp = talloc_array(br_lck, struct lock_struct, br_lck->num_locks + 1);  in brl_unlock_posix()
1165 	for (i = 0; i < br_lck->num_locks; i++) {  in brl_unlock_posix()
1212 			if (i < br_lck->num_locks - 1) {  in brl_unlock_posix()
1214 					sizeof(*locks)*((br_lck->num_locks-1) - i));  in brl_unlock_posix()
1215 				count += ((br_lck->num_locks-1) - i);  in brl_unlock_posix()
1255 	br_lck->num_locks = count;  in brl_unlock_posix()
1316 	for (i=0; i < br_lck->num_locks; i++) {  in brl_locktest()
1394 	for (i=0; i < br_lck->num_locks; i++) {  in brl_lockquery()
1455 	if (br_lck->num_locks) {  in brl_close_fnum()
1456 …locks_copy = (struct lock_struct *)talloc_memdup(br_lck, locks, br_lck->num_locks * sizeof(struct …  in brl_close_fnum()
1464 	num_locks_copy = br_lck->num_locks;  in brl_close_fnum()
1511 	for (i=0; i < br_lck->num_locks; i++) {  in brl_mark_disconnected()
1579 	if (br_lck->num_locks == 0) {  in brl_reconnect_disconnected()
1584 	for (i=0; i < br_lck->num_locks; i++) {  in brl_reconnect_disconnected()
1617 	fsp->current_lock_count = br_lck->num_locks;  in brl_reconnect_disconnected()
1643 	unsigned int num_locks = 0;  in brl_traverse_fn()  local
1660 	num_locks = value.dsize/sizeof(*locks);  in brl_traverse_fn()
1663 		for ( i=0; i<num_locks; i++) {  in brl_traverse_fn()
1725 	while (i < br_lck->num_locks) {  in byte_range_lock_flush()
1731 			locks[i] = locks[br_lck->num_locks-1];  in byte_range_lock_flush()
1732 			br_lck->num_locks -= 1;  in byte_range_lock_flush()
1738 	if (br_lck->num_locks == 0) {  in byte_range_lock_flush()
1748 			.dsize = br_lck->num_locks * sizeof(struct lock_struct),  in byte_range_lock_flush()
1785 	br_lck->num_locks = data.dsize / sizeof(struct lock_struct);  in brl_parse_data()
1786 	data_len = br_lck->num_locks * sizeof(struct lock_struct);  in brl_parse_data()
1839 			  br_lck->num_locks,  in brl_get_locks()
1841 		for( i = 0; i < br_lck->num_locks; i++) {  in brl_get_locks()