| 1836 | } |
| 1837 | |
| 1838 | int order_init(dohsql_t *conns, dohsql_node_t *node) |
| 1839 | { |
| 1840 | int i; |
| 1841 | conns->order = (int *)calloc(sizeof(int), conns->nconns); |
| 1842 | |
| 1843 | if (!conns->order) |
| 1844 | return SHARD_ERR_MALLOC; |
| 1845 | |
| 1846 | conns->active = conns->nconns; |
| 1847 | conns->filling = 0; |
| 1848 | conns->top_idx = 0; |
| 1849 | for (i = 0; i < conns->active; i++) { |
| 1850 | conns->order[i] = i; |
| 1851 | } |
| 1852 | |
| 1853 | conns->order_size = node->order_size; |
| 1854 | conns->order_dir = node->order_dir; |
| 1855 | node->order_size = 0; |
| 1856 | node->order_dir = NULL; |
| 1857 | |
| 1858 | return SHARD_NOERR; |
| 1859 | } |
| 1860 | |
| 1861 | int dohsql_is_parallel_shard(void) |
| 1862 | { |
no test coverage detected