OSX/libsecurity_keychain/regressions/kc-20-item-find-stress.c

   1 /*
   2  * Copyright (c) 2016 Apple Inc. All Rights Reserved.
   3  *
   4  * @APPLE_LICENSE_HEADER_START@
   5  *
   6  * This file contains Original Code and/or Modifications of Original Code
   7  * as defined in and that are subject to the Apple Public Source License
   8  * Version 2.0 (the 'License'). You may not use this file except in
   9  * compliance with the License. Please obtain a copy of the License at
  10  * http://www.opensource.apple.com/apsl/ and read it before using this
  11  * file.
  12  *
  13  * The Original Code and all software distributed under the License are
  14  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  15  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  16  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  17  * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
  18  * Please see the License for the specific language governing rights and
  19  * limitations under the xLicense.
  20  *
  21  * @APPLE_LICENSE_HEADER_END@
  22  */
  23
  24 #import <Security/Security.h>
  25 #import <Security/SecCertificatePriv.h>
  26
  27 #include "keychain_regressions.h"
  28 #include "kc-helpers.h"
  29 #include "kc-item-helpers.h"
  30
  31 #include <Security/Security.h>
  32 #include <stdlib.h>
  33
  34 #define BLOCKS 7000
  35
  36 static long concurrentBlocks = 64;
  37
  38 static void tests() {
  39
  40     SecKeychainRef kc = getPopulatedTestKeychain();
  41
  42     static dispatch_once_t onceToken = 0;
  43     static dispatch_queue_t release_queue = NULL;
  44     dispatch_once(&onceToken, ^{
  45         release_queue = dispatch_queue_create("com.apple.security.identity-search-queue", DISPATCH_QUEUE_CONCURRENT);
  46     });
  47     dispatch_group_t g = dispatch_group_create();
  48
  49     __block int iteration = 0;
  50     dispatch_semaphore_t semaphore = dispatch_semaphore_create(concurrentBlocks);
  51
  52     dispatch_block_t findBlock = ^() {
  53         SecKeychainItemRef blockItem = NULL;
  54
  55         CFMutableDictionaryRef query = createQueryCustomItemDictionaryWithService(kc, kSecClassInternetPassword, CFSTR("test_service"), CFSTR("test_service"));
  56         CFDictionarySetValue(query, kSecMatchLimit, kSecMatchLimitOne);
  57
  58         ok_status(SecItemCopyMatching(query, (CFTypeRef*) &blockItem), "%s: SecItemCopyMatching (%d)", testName, iteration);
  59         CFReleaseNull(query);
  60
  61         CFReleaseNull(blockItem);
  62         dispatch_semaphore_signal(semaphore);
  63     };
  64
  65     // Send this to background queue, so that when we wait, it doesn't block main queue
  66
  67     dispatch_group_async(g, dispatch_get_global_queue(DISPATCH_QUEUE_PRIORITY_DEFAULT, 0), ^{
  68         for (iteration = 0; iteration < BLOCKS; iteration++) {
  69             // Wait until one of our concurrentBlocks "slots" are available
  70             dispatch_semaphore_wait(semaphore, DISPATCH_TIME_FOREVER);
  71
  72             dispatch_group_async(g, release_queue, findBlock);
  73         }
  74     });
  75
  76     dispatch_group_wait(g, DISPATCH_TIME_FOREVER);
  77
  78     ok_status(SecKeychainDelete(kc), "%s: SecKeychainDelete", testName);
  79     CFReleaseNull(kc);
  80 }
  81
  82 int kc_20_item_find_stress(int argc, char *const *argv)
  83 {
  84     plan_tests((1)*BLOCKS + getPopulatedTestKeychainTests + 1);
  85     initializeKeychainTests(__FUNCTION__);
  86
  87     tests();
  88
  89     deleteTestFiles();
  90     return 0;
  91 }