Home
last modified time | relevance | path

Searched refs:numProcesses (Results 1 – 25 of 75) sorted by relevance

123

/dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/mysql56-client/mysql-5.6.51/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp39 static int numProcesses; variable
89 numProcesses = 1; in parse_args()
104 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
105 numProcesses <= 0 || numProcesses > 127) { in parse_args()
309 numProcesses,
316 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
318 for(i = 0; i < numProcesses; i++) {
347 for(i = 0; i < numProcesses; i++) {
370 for(i = 0; i < numProcesses; i++) {
394 numProcesses,
/dports/databases/mysql55-client/mysql-5.5.62/storage/ndb/test/ndbapi/
H A DmainAsyncGenerator.cpp30 static int numProcesses; variable
80 numProcesses = 1; in parse_args()
95 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
96 numProcesses <= 0 || numProcesses > 127) { in parse_args()
300 numProcesses,
307 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
309 for(i = 0; i < numProcesses; i++) {
338 for(i = 0; i < numProcesses; i++) {
361 for(i = 0; i < numProcesses; i++) {
385 numProcesses,
/dports/sysutils/plasma5-libksysguard/libksysguard-5.23.5/processcore/
H A Dhelper.cpp42 int numProcesses = parameters.value(QStringLiteral("pidcount")).toInt(); in sendsignal() local
44 for (int i = 0; i < numProcesses; ++i) { in sendsignal()
69 int numProcesses = parameters.value(QStringLiteral("pidcount")).toInt(); in renice() local
70 for (int i = 0; i < numProcesses; ++i) { in renice()
90 const int numProcesses = parameters.value(QStringLiteral("pidcount")).toInt(); in changeioscheduler() local
91 for (int i = 0; i < numProcesses; ++i) { in changeioscheduler()
111 const int numProcesses = parameters.value(QStringLiteral("pidcount")).toInt(); in changecpuscheduler() local
112 for (int i = 0; i < numProcesses; ++i) { in changecpuscheduler()
/dports/databases/mysql55-client/mysql-5.5.62/storage/ndb/test/ndbapi/bench/
H A DmainAsyncGenerator.cpp30 static int numProcesses; variable
82 numProcesses = 1; in parse_args()
97 if (sscanf(argv[i+1], "%d", &numProcesses) == -1 || in parse_args()
98 numProcesses <= 0 || numProcesses > 127) { in parse_args()
302 numProcesses,
322 data = (ThreadData*)malloc((numProcesses*parallellism)*sizeof(ThreadData));
324 for(i = 0; i < numProcesses; i++) {
353 for(i = 0; i < numProcesses; i++) {
376 for(i = 0; i < numProcesses; i++) {
400 numProcesses,
/dports/biology/iqtree/IQ-TREE-2.0.6/utils/
H A DMPIHelper.h62 return numProcesses; in getNumProcesses()
65 void setNumProcesses(int numProcesses) { in setNumProcesses() argument
66 MPIHelper::numProcesses = numProcesses; in setNumProcesses()
160 int numProcesses; variable
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/Common/src/Interop/OSX/
H A DInterop.libproc.cs184 int numProcesses = proc_listallpids(null, 0); in proc_listallpids()
185 if (numProcesses <= 0) in proc_listallpids()
199 processes = new int[(int)(numProcesses * 1.10)]; in proc_listallpids()
203 numProcesses = proc_listallpids(pBuffer, processes.Length * sizeof(int)); in proc_listallpids()
204 if (numProcesses <= 0) in proc_listallpids()
210 while (numProcesses == processes.Length); in proc_listallpids()
213 Array.Resize<int>(ref processes, numProcesses); in proc_listallpids()
/dports/math/vtk8/VTK-8.2.0/Filters/ParallelStatistics/
H A DvtkPBivariateLinearTableThreshold.cxx75 int numProcesses = this->Controller->GetNumberOfProcesses(); in RequestData() local
88 std::vector<vtkIdType> recvLengths(numProcesses,0); in RequestData()
89 std::vector<vtkIdType> recvOffsets(numProcesses,0); in RequestData()
96 for (int j=0; j<numProcesses; j++) in RequestData()
/dports/math/vtk9/VTK-9.1.0/Filters/ParallelStatistics/
H A DvtkPBivariateLinearTableThreshold.cxx74 int numProcesses = this->Controller->GetNumberOfProcesses(); in RequestData() local
87 std::vector<vtkIdType> recvLengths(numProcesses, 0); in RequestData()
88 std::vector<vtkIdType> recvOffsets(numProcesses, 0); in RequestData()
95 for (int j = 0; j < numProcesses; j++) in RequestData()
/dports/math/vtk6/VTK-6.2.0/Filters/ParallelStatistics/
H A DvtkPBivariateLinearTableThreshold.cxx75 int numProcesses = this->Controller->GetNumberOfProcesses(); in RequestData() local
88 std::vector<vtkIdType> recvLengths(numProcesses,0); in RequestData()
89 std::vector<vtkIdType> recvOffsets(numProcesses,0); in RequestData()
96 for (int j=0; j<numProcesses; j++) in RequestData()
/dports/math/vtk9/VTK-9.1.0/Filters/ParallelImaging/
H A DvtkPComputeHistogram2DOutliers.cxx84 int numProcesses = this->Controller->GetNumberOfProcesses(); in RequestData() local
101 std::vector<vtkIdType> recvLengths(numProcesses, 0); in RequestData()
102 std::vector<vtkIdType> recvOffsets(numProcesses, 0); in RequestData()
109 for (int j = 0; j < numProcesses; j++) in RequestData()
/dports/math/vtk8/VTK-8.2.0/Filters/ParallelImaging/
H A DvtkPComputeHistogram2DOutliers.cxx87 int numProcesses = this->Controller->GetNumberOfProcesses(); in RequestData() local
104 std::vector<vtkIdType> recvLengths(numProcesses,0); in RequestData()
105 std::vector<vtkIdType> recvOffsets(numProcesses,0); in RequestData()
112 for (int j=0; j<numProcesses; j++) in RequestData()
/dports/math/vtk6/VTK-6.2.0/Filters/ParallelImaging/
H A DvtkPComputeHistogram2DOutliers.cxx87 int numProcesses = this->Controller->GetNumberOfProcesses(); in RequestData() local
104 std::vector<vtkIdType> recvLengths(numProcesses,0); in RequestData()
105 std::vector<vtkIdType> recvOffsets(numProcesses,0); in RequestData()
112 for (int j=0; j<numProcesses; j++) in RequestData()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/hotspot/jtreg/runtime/appcds/
H A DMultiProcessSharing.java68 int numProcesses = 3; in main() local
69 Thread[] threads = new Thread[numProcesses]; in main()
70 ProcessHandler[] processHandlers = new ProcessHandler[numProcesses]; in main()
71 for (int i = 0; i < numProcesses; i++) { in main()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/hotspot/jtreg/runtime/appcds/
H A DMultiProcessSharing.java68 int numProcesses = 3; in main() local
69 Thread[] threads = new Thread[numProcesses]; in main()
70 ProcessHandler[] processHandlers = new ProcessHandler[numProcesses]; in main()
71 for (int i = 0; i < numProcesses; i++) { in main()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/hotspot/jtreg/runtime/cds/appcds/
H A DMultiProcessSharing.java65 int numProcesses = 3; in main() local
66 Thread[] threads = new Thread[numProcesses]; in main()
67 ProcessHandler[] processHandlers = new ProcessHandler[numProcesses]; in main()
68 for (int i = 0; i < numProcesses; i++) { in main()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/hotspot/jtreg/runtime/cds/appcds/
H A DMultiProcessSharing.java65 int numProcesses = 3; in main() local
66 Thread[] threads = new Thread[numProcesses]; in main()
67 ProcessHandler[] processHandlers = new ProcessHandler[numProcesses]; in main()
68 for (int i = 0; i < numProcesses; i++) { in main()

123