1*4fc55e3eSMaxim Sobolev /* 2*4fc55e3eSMaxim Sobolev * Copyright (c) 2016 Maxim Sobolev <sobomax@FreeBSD.org> 3*4fc55e3eSMaxim Sobolev * All rights reserved. 4*4fc55e3eSMaxim Sobolev * 5*4fc55e3eSMaxim Sobolev * Redistribution and use in source and binary forms, with or without 6*4fc55e3eSMaxim Sobolev * modification, are permitted provided that the following conditions 7*4fc55e3eSMaxim Sobolev * are met: 8*4fc55e3eSMaxim Sobolev * 1. Redistributions of source code must retain the above copyright 9*4fc55e3eSMaxim Sobolev * notice, this list of conditions and the following disclaimer. 10*4fc55e3eSMaxim Sobolev * 2. Redistributions in binary form must reproduce the above copyright 11*4fc55e3eSMaxim Sobolev * notice, this list of conditions and the following disclaimer in the 12*4fc55e3eSMaxim Sobolev * documentation and/or other materials provided with the distribution. 13*4fc55e3eSMaxim Sobolev * 14*4fc55e3eSMaxim Sobolev * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15*4fc55e3eSMaxim Sobolev * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16*4fc55e3eSMaxim Sobolev * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17*4fc55e3eSMaxim Sobolev * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18*4fc55e3eSMaxim Sobolev * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19*4fc55e3eSMaxim Sobolev * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20*4fc55e3eSMaxim Sobolev * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21*4fc55e3eSMaxim Sobolev * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22*4fc55e3eSMaxim Sobolev * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23*4fc55e3eSMaxim Sobolev * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24*4fc55e3eSMaxim Sobolev * SUCH DAMAGE. 25*4fc55e3eSMaxim Sobolev */ 26*4fc55e3eSMaxim Sobolev 27*4fc55e3eSMaxim Sobolev struct mkuz_fifo_queue; 28*4fc55e3eSMaxim Sobolev 29*4fc55e3eSMaxim Sobolev #define ITEMS_PER_WORKER 4 30*4fc55e3eSMaxim Sobolev 31*4fc55e3eSMaxim Sobolev #define MAX_WORKERS_AUTO 24 32*4fc55e3eSMaxim Sobolev 33*4fc55e3eSMaxim Sobolev struct mkuz_conveyor { 34*4fc55e3eSMaxim Sobolev /* 35*4fc55e3eSMaxim Sobolev * Work items are places in here, and picked up by workers in a FIFO 36*4fc55e3eSMaxim Sobolev * fashion. 37*4fc55e3eSMaxim Sobolev */ 38*4fc55e3eSMaxim Sobolev struct mkuz_fifo_queue *wrk_queue; 39*4fc55e3eSMaxim Sobolev /* 40*4fc55e3eSMaxim Sobolev * Results are dropped into this FIFO and consumer is buzzed to pick them 41*4fc55e3eSMaxim Sobolev * up 42*4fc55e3eSMaxim Sobolev */ 43*4fc55e3eSMaxim Sobolev struct mkuz_fifo_queue *results; 44*4fc55e3eSMaxim Sobolev 45*4fc55e3eSMaxim Sobolev pthread_t wthreads[]; 46*4fc55e3eSMaxim Sobolev }; 47*4fc55e3eSMaxim Sobolev 48*4fc55e3eSMaxim Sobolev struct mkuz_cfg; 49*4fc55e3eSMaxim Sobolev 50*4fc55e3eSMaxim Sobolev struct mkuz_conveyor *mkuz_conveyor_ctor(struct mkuz_cfg *); 51