-
Notifications
You must be signed in to change notification settings - Fork 120
/
Copy pathp4est.c
4253 lines (3866 loc) · 150 KB
/
p4est.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
This file is part of p4est.
p4est is a C library to manage a collection (a forest) of multiple
connected adaptive quadtrees or octrees in parallel.
Copyright (C) 2010 The University of Texas System
Additional copyright (C) 2011 individual authors
Written by Carsten Burstedde, Lucas C. Wilcox, and Tobin Isaac
p4est is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
p4est is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with p4est; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifdef P4_TO_P8
#include <p8est_algorithms.h>
#include <p8est_bits.h>
#include <p8est_communication.h>
#include <p8est_extended.h>
#include <p8est_ghost.h>
#include <p8est_io.h>
#include <p8est_search.h>
#else
#include <p4est_algorithms.h>
#include <p4est_bits.h>
#include <p4est_communication.h>
#include <p4est_extended.h>
#include <p4est_ghost.h>
#include <p4est_io.h>
#include <p4est_search.h>
#endif /* !P4_TO_P8 */
#include <sc_io.h>
#include <sc_notify.h>
#include <sc_ranges.h>
#include <sc_search.h>
#ifdef P4EST_HAVE_ZLIB
#include <zlib.h>
#endif
#ifdef P4EST_ENABLE_MPIIO
#define P4EST_MPIIO_WRITE
#endif
#ifdef P4EST_HAVE_UNISTD_H
#include <unistd.h>
#endif
typedef struct
{
int8_t have_first_count, have_first_load;
int8_t have_second_count, have_second_load;
int recv_first_count, recv_second_count;
int send_first_count, send_second_count;
sc_array_t send_first, send_second, recv_first, recv_second;
}
p4est_balance_peer_t;
#define p4est_num_ranges (25)
#ifndef P4_TO_P8
static int p4est_uninitialized_key;
void *P4EST_DATA_UNINITIALIZED = &p4est_uninitialized_key;
#endif /* P4_TO_P8 */
static const size_t number_toread_quadrants = 32;
static const int8_t fully_owned_flag = 0x01;
static const int8_t any_face_flag = 0x02;
void
p4est_qcoord_to_vertex (p4est_connectivity_t * connectivity,
p4est_topidx_t treeid,
p4est_qcoord_t x, p4est_qcoord_t y,
#ifdef P4_TO_P8
p4est_qcoord_t z,
#endif
double vxyz[3])
{
const double *vertices = connectivity->vertices;
#ifdef P4EST_ENABLE_DEBUG
const p4est_topidx_t num_vertices = connectivity->num_vertices;
#endif
const p4est_topidx_t *vindices;
int xi, yi;
double wx[2], wy[2];
#ifdef P4_TO_P8
int zi;
double wz[2];
#endif
double xfactor, yfactor;
p4est_topidx_t vindex;
P4EST_ASSERT (num_vertices > 0);
P4EST_ASSERT (vertices != NULL);
P4EST_ASSERT (treeid >= 0 && treeid < connectivity->num_trees);
P4EST_ASSERT (connectivity->tree_to_vertex != NULL);
vindices = connectivity->tree_to_vertex + P4EST_CHILDREN * treeid;
vxyz[0] = vxyz[1] = vxyz[2] = 0.;
P4EST_ASSERT (x >= 0 && x <= P4EST_ROOT_LEN);
wx[1] = (double) x / (double) P4EST_ROOT_LEN;
wx[0] = 1. - wx[1];
P4EST_ASSERT (y >= 0 && y <= P4EST_ROOT_LEN);
wy[1] = (double) y / (double) P4EST_ROOT_LEN;
wy[0] = 1. - wy[1];
#ifdef P4_TO_P8
P4EST_ASSERT (z >= 0 && z <= P4EST_ROOT_LEN);
wz[1] = (double) z / (double) P4EST_ROOT_LEN;
wz[0] = 1. - wz[1];
for (zi = 0; zi < 2; ++zi) {
#endif
for (yi = 0; yi < 2; ++yi) {
#ifdef P4_TO_P8
yfactor = wz[zi] * wy[yi];
#else
yfactor = wy[yi];
#endif
for (xi = 0; xi < 2; ++xi) {
xfactor = yfactor * wx[xi];
vindex = *vindices++;
P4EST_ASSERT (vindex >= 0 && vindex < num_vertices);
vxyz[0] += xfactor * vertices[3 * vindex + 0];
vxyz[1] += xfactor * vertices[3 * vindex + 1];
vxyz[2] += xfactor * vertices[3 * vindex + 2];
}
}
#ifdef P4_TO_P8
}
#endif
}
size_t
p4est_memory_used (p4est_t * p4est)
{
int mpisize;
size_t size;
p4est_topidx_t nt;
p4est_tree_t *tree;
/* do not assert p4est_is_valid since it is collective */
P4EST_ASSERT (p4est != NULL);
P4EST_ASSERT (p4est->connectivity != NULL);
P4EST_ASSERT (p4est->trees != NULL);
mpisize = p4est->mpisize;
size = sizeof (p4est_t) +
(mpisize + 1) * (sizeof (p4est_gloidx_t) + sizeof (p4est_quadrant_t));
size += sc_array_memory_used (p4est->trees, 1);
for (nt = 0; nt < p4est->connectivity->num_trees; ++nt) {
tree = p4est_tree_array_index (p4est->trees, nt);
size += sc_array_memory_used (&tree->quadrants, 0);
}
if (p4est->data_size > 0) {
P4EST_ASSERT (p4est->user_data_pool != NULL);
size += sc_mempool_memory_used (p4est->user_data_pool);
}
P4EST_ASSERT (p4est->quadrant_pool != NULL);
size += sc_mempool_memory_used (p4est->quadrant_pool);
return size;
}
long
p4est_revision (p4est_t * p4est)
{
/* do not assert p4est_is_valid since it is collective */
P4EST_ASSERT (p4est != NULL);
P4EST_ASSERT (p4est->revision >= 0);
return p4est->revision;
}
p4est_t *
p4est_new (sc_MPI_Comm mpicomm, p4est_connectivity_t * connectivity,
size_t data_size, p4est_init_t init_fn, void *user_pointer)
{
return p4est_new_ext (mpicomm, connectivity, 0, 0, 1,
data_size, init_fn, user_pointer);
}
p4est_t *
p4est_new_ext (sc_MPI_Comm mpicomm, p4est_connectivity_t * connectivity,
p4est_locidx_t min_quadrants, int min_level, int fill_uniform,
size_t data_size, p4est_init_t init_fn, void *user_pointer)
{
int num_procs, rank;
int i, must_remove_last_quadrant;
int level;
uint64_t first_morton, last_morton, miu, count;
p4est_topidx_t jt, num_trees;
p4est_gloidx_t tree_num_quadrants, global_num_quadrants;
p4est_gloidx_t first_tree, first_quadrant, first_tree_quadrant;
p4est_gloidx_t last_tree, last_quadrant, last_tree_quadrant;
p4est_gloidx_t quadrant_index;
p4est_t *p4est;
p4est_tree_t *tree;
p4est_quadrant_t *quad;
p4est_quadrant_t a, b, c;
p4est_quadrant_t *global_first_position;
sc_array_t *tquadrants;
P4EST_GLOBAL_PRODUCTIONF
("Into " P4EST_STRING
"_new with min quadrants %lld level %d uniform %d\n",
(long long) min_quadrants, SC_MAX (min_level, 0), fill_uniform);
p4est_log_indent_push ();
P4EST_ASSERT (p4est_connectivity_is_valid (connectivity));
P4EST_ASSERT (min_level <= P4EST_OLD_QMAXLEVEL);
/* create p4est object and assign some data members */
p4est = P4EST_ALLOC_ZERO (p4est_t, 1);
p4est->data_size = data_size;
p4est->user_pointer = user_pointer;
p4est->connectivity = connectivity;
num_trees = connectivity->num_trees;
/* set parallel environment */
p4est_comm_parallel_env_assign (p4est, mpicomm);
num_procs = p4est->mpisize;
rank = p4est->mpirank;
/* allocate memory pools */
if (p4est->data_size > 0) {
p4est->user_data_pool = sc_mempool_new (p4est->data_size);
}
else {
p4est->user_data_pool = NULL;
}
p4est->quadrant_pool = sc_mempool_new (sizeof (p4est_quadrant_t));
/* determine uniform level of initial tree */
tree_num_quadrants = 1;
for (level = 0; level < P4EST_QMAXLEVEL; ++level) {
if (tree_num_quadrants >=
(num_procs * (p4est_gloidx_t) min_quadrants + (num_trees - 1))
/ num_trees) {
break;
}
tree_num_quadrants *= P4EST_CHILDREN;
P4EST_ASSERT (tree_num_quadrants > 0);
}
for (; level < min_level; ++level) {
tree_num_quadrants *= P4EST_CHILDREN;
P4EST_ASSERT (tree_num_quadrants > 0);
}
P4EST_ASSERT (level <= P4EST_QMAXLEVEL
&& tree_num_quadrants <= (p4est_gloidx_t) P4EST_LOCIDX_MAX);
/* compute global number of quadrants */
global_num_quadrants = tree_num_quadrants * num_trees;
P4EST_GLOBAL_PRODUCTIONF ("New " P4EST_STRING
" with %lld trees on %d processors\n",
(long long) num_trees, num_procs);
P4EST_GLOBAL_INFOF ("Initial level %d potential global quadrants"
" %lld per tree %lld\n",
level, (long long) global_num_quadrants,
(long long) tree_num_quadrants);
/* compute index of first tree for this processor */
first_quadrant =
p4est_partition_cut_gloidx (global_num_quadrants, rank, num_procs);
first_tree = first_quadrant / tree_num_quadrants;
first_tree_quadrant = first_quadrant - first_tree * tree_num_quadrants;
last_quadrant = p4est_partition_cut_gloidx (global_num_quadrants, rank + 1,
num_procs) - 1;
P4EST_VERBOSEF
("first tree %lld first quadrant %lld global quadrant %lld\n",
(long long) first_tree, (long long) first_tree_quadrant,
(long long) first_quadrant);
P4EST_ASSERT (first_tree_quadrant < tree_num_quadrants);
/* compute index of last tree for this processor */
if (first_quadrant <= last_quadrant) {
last_tree = last_quadrant / tree_num_quadrants;
last_tree_quadrant = last_quadrant - last_tree * tree_num_quadrants;
P4EST_VERBOSEF
("last tree %lld last quadrant %lld global quadrant %lld\n",
(long long) last_tree, (long long) last_tree_quadrant,
(long long) last_quadrant);
/* check ranges of various integers to be 32bit compatible */
P4EST_ASSERT (first_tree <= last_tree && last_tree < num_trees);
P4EST_ASSERT (0 <= first_tree_quadrant && 0 <= last_tree_quadrant);
P4EST_ASSERT (last_tree_quadrant < tree_num_quadrants);
if (first_tree == last_tree) {
P4EST_ASSERT (first_tree_quadrant <= last_tree_quadrant);
}
}
else {
P4EST_VERBOSE ("Empty processor");
P4EST_ASSERT (0 <= first_tree && 0 <= first_tree_quadrant);
first_tree = -1;
last_tree = -2;
last_tree_quadrant = -1;
}
/* allocate trees and quadrants */
p4est->trees = sc_array_new (sizeof (p4est_tree_t));
sc_array_resize (p4est->trees, num_trees);
for (jt = 0; jt < num_trees; ++jt) {
tree = p4est_tree_array_index (p4est->trees, jt);
sc_array_init (&tree->quadrants, sizeof (p4est_quadrant_t));
P4EST_QUADRANT_INIT (&tree->first_desc);
P4EST_QUADRANT_INIT (&tree->last_desc);
tree->quadrants_offset = 0;
for (i = 0; i <= P4EST_QMAXLEVEL; ++i) {
tree->quadrants_per_level[i] = 0;
}
for (; i <= P4EST_MAXLEVEL; ++i) {
tree->quadrants_per_level[i] = -1;
}
tree->maxlevel = 0;
}
p4est->local_num_quadrants = 0;
p4est->global_num_quadrants = 0;
/* for every locally non-empty tree fill first and last quadrant */
P4EST_QUADRANT_INIT (&a);
P4EST_QUADRANT_INIT (&b);
P4EST_QUADRANT_INIT (&c);
for (jt = first_tree; jt <= last_tree; ++jt) {
tree = p4est_tree_array_index (p4est->trees, jt);
tquadrants = &tree->quadrants;
quad = NULL;
if (!fill_uniform) { /* fill with coarsest possible quadrants */
must_remove_last_quadrant = 0;
/* set morton id of first quadrant and initialize user data */
if (jt == first_tree) {
p4est_quadrant_set_morton (&a, level, first_tree_quadrant);
}
else {
p4est_quadrant_set_morton (&a, level, 0);
}
#ifdef P4_TO_P8
P4EST_LDEBUGF ("tree %lld first morton 0x%llx 0x%llx 0x%llx\n",
(long long) jt, (long long) a.x,
(long long) a.y, (long long) a.z);
#else
P4EST_LDEBUGF ("tree %lld first morton 0x%llx 0x%llx\n",
(long long) jt, (long long) a.x, (long long) a.y);
#endif
p4est_quadrant_first_descendant (&a, &tree->first_desc,
P4EST_QMAXLEVEL);
/* set morton id of last quadrant */
if (tree_num_quadrants == 1 ||
(jt == first_tree
&& first_tree_quadrant == tree_num_quadrants - 1)) {
/* There is only a in the tree */
quad = p4est_quadrant_array_push (tquadrants);
*quad = a;
p4est_quadrant_init_data (p4est, jt, quad, init_fn);
tree->maxlevel = a.level;
tree->quadrants_per_level[a.level] = 1;
}
else {
if (jt == last_tree) {
if (last_tree_quadrant == tree_num_quadrants - 1) {
quadrant_index = last_tree_quadrant;
}
else {
quadrant_index = last_tree_quadrant + 1;
must_remove_last_quadrant = 1;
}
p4est_quadrant_set_morton (&b, level, quadrant_index);
}
else {
p4est_quadrant_set_morton (&b, level, tree_num_quadrants - 1);
}
#ifdef P4_TO_P8
P4EST_LDEBUGF ("tree %lld last morton 0x%llx 0x%llx 0x%llx\n",
(long long) jt, (long long) b.x,
(long long) b.y, (long long) b.z);
#else
P4EST_LDEBUGF ("tree %lld last morton 0x%llx 0x%llx\n",
(long long) jt, (long long) b.x, (long long) b.y);
#endif
/* fill up tree between a and b with coarse quadrants */
p4est_complete_region (p4est, &a, 1, &b, !must_remove_last_quadrant,
tree, jt, init_fn);
quad = p4est_quadrant_array_index (tquadrants,
tquadrants->elem_count - 1);
}
}
else { /* fill tree with quadrants of given level */
/* determine range of quadrants in this tree */
first_morton = (uint64_t)
(jt == first_tree ? first_tree_quadrant : 0);
last_morton = (uint64_t)
(jt == last_tree ? last_tree_quadrant : tree_num_quadrants - 1);
count = last_morton - first_morton + 1;
P4EST_ASSERT (count > 0);
/* populate quadrant array in Morton order */
sc_array_resize (tquadrants, (size_t) count);
quad = p4est_quadrant_array_index (tquadrants, 0);
p4est_quadrant_set_morton (quad, level, first_morton);
p4est_quadrant_init_data (p4est, jt, quad, init_fn);
for (miu = 1; miu < count; ++miu) {
quad = p4est_quadrant_array_index (tquadrants, (size_t) miu);
p4est_quadrant_successor (quad - 1, quad);
p4est_quadrant_init_data (p4est, jt, quad, init_fn);
}
/* remember first tree position */
p4est_quadrant_first_descendant (p4est_quadrant_array_index
(tquadrants, 0), &tree->first_desc,
P4EST_QMAXLEVEL);
/* set tree counters */
tree->maxlevel = (int8_t) level;
tree->quadrants_per_level[level] = (p4est_locidx_t) count;
}
#if 0
P4EST_VERBOSEF ("tree %lld quadrants %llu\n", (long long) jt,
(unsigned long long) tquadrants->elem_count);
#endif
tree->quadrants_offset = p4est->local_num_quadrants;
p4est->local_num_quadrants += tquadrants->elem_count;
p4est_quadrant_last_descendant (quad, &tree->last_desc, P4EST_QMAXLEVEL);
}
if (last_tree >= 0) {
for (; jt < num_trees; ++jt) {
tree = p4est_tree_array_index (p4est->trees, jt);
tree->quadrants_offset = p4est->local_num_quadrants;
}
}
/* compute some member variables */
p4est->first_local_tree = first_tree;
p4est->last_local_tree = last_tree;
p4est->global_first_quadrant = P4EST_ALLOC (p4est_gloidx_t, num_procs + 1);
if (!fill_uniform && level > 0) {
/* this performs an allgather to count all quadrants */
p4est_comm_count_quadrants (p4est);
}
else {
/* for a uniform forest we know all global information a priori */
for (i = 0; i <= num_procs; ++i) {
p4est->global_first_quadrant[i] =
p4est_partition_cut_gloidx (global_num_quadrants, i, num_procs);
}
p4est->global_num_quadrants = global_num_quadrants;
}
/* fill in global partition information */
global_first_position = P4EST_ALLOC_ZERO (p4est_quadrant_t, num_procs + 1);
for (i = 0; i <= num_procs; ++i) {
first_quadrant =
p4est_partition_cut_gloidx (global_num_quadrants, i, num_procs);
first_tree = first_quadrant / tree_num_quadrants;
first_tree_quadrant = first_quadrant - first_tree * tree_num_quadrants;
p4est_quadrant_set_morton (&c, level, first_tree_quadrant);
global_first_position[i].x = c.x;
global_first_position[i].y = c.y;
#ifdef P4_TO_P8
global_first_position[i].z = c.z;
#endif
global_first_position[i].level = P4EST_QMAXLEVEL;
global_first_position[i].p.which_tree = first_tree;
}
p4est->global_first_position = global_first_position;
/* print more statistics */
P4EST_VERBOSEF ("total local quadrants %lld\n",
(long long) p4est->local_num_quadrants);
P4EST_ASSERT (p4est->revision == 0);
P4EST_ASSERT (p4est_is_valid (p4est));
p4est_log_indent_pop ();
P4EST_GLOBAL_PRODUCTIONF ("Done " P4EST_STRING
"_new with %lld total quadrants\n",
(long long) p4est->global_num_quadrants);
return p4est;
}
void
p4est_destroy (p4est_t * p4est)
{
#ifdef P4EST_ENABLE_DEBUG
size_t qz;
#endif
p4est_topidx_t jt;
p4est_tree_t *tree;
for (jt = 0; jt < p4est->connectivity->num_trees; ++jt) {
tree = p4est_tree_array_index (p4est->trees, jt);
#ifdef P4EST_ENABLE_DEBUG
for (qz = 0; qz < tree->quadrants.elem_count; ++qz) {
p4est_quadrant_t *quad =
p4est_quadrant_array_index (&tree->quadrants, qz);
p4est_quadrant_free_data (p4est, quad);
}
#endif
sc_array_reset (&tree->quadrants);
}
sc_array_destroy (p4est->trees);
if (p4est->user_data_pool != NULL) {
sc_mempool_destroy (p4est->user_data_pool);
}
sc_mempool_destroy (p4est->quadrant_pool);
p4est_comm_parallel_env_release (p4est);
P4EST_FREE (p4est->global_first_quadrant);
P4EST_FREE (p4est->global_first_position);
P4EST_FREE (p4est);
}
p4est_t *
p4est_copy (p4est_t * input, int copy_data)
{
return p4est_copy_ext (input, copy_data, 0 /* don't duplicate MPI comm */ );
}
p4est_t *
p4est_copy_ext (p4est_t * input, int copy_data, int duplicate_mpicomm)
{
const p4est_topidx_t num_trees = input->connectivity->num_trees;
const p4est_topidx_t first_tree = input->first_local_tree;
const p4est_topidx_t last_tree = input->last_local_tree;
size_t icount;
size_t zz;
p4est_topidx_t jt;
p4est_t *p4est;
p4est_tree_t *itree, *ptree;
p4est_quadrant_t *iq, *pq;
sc_array_t *iquadrants, *pquadrants;
/* create a shallow copy and zero out dependent fields */
p4est = P4EST_ALLOC (p4est_t, 1);
memcpy (p4est, input, sizeof (p4est_t));
p4est->global_first_quadrant = NULL;
p4est->global_first_position = NULL;
p4est->trees = NULL;
p4est->user_data_pool = NULL;
p4est->quadrant_pool = NULL;
/* set parallel environment */
p4est_comm_parallel_env_assign (p4est, input->mpicomm);
if (duplicate_mpicomm) {
p4est_comm_parallel_env_duplicate (p4est);
}
/* allocate a user data pool if necessary and a quadrant pool */
if (copy_data && p4est->data_size > 0) {
p4est->user_data_pool = sc_mempool_new (p4est->data_size);
}
else {
p4est->data_size = 0;
}
p4est->quadrant_pool = sc_mempool_new (sizeof (p4est_quadrant_t));
/* copy quadrants for each tree */
p4est->trees = sc_array_new (sizeof (p4est_tree_t));
sc_array_resize (p4est->trees, num_trees);
for (jt = 0; jt < num_trees; ++jt) {
itree = p4est_tree_array_index (input->trees, jt);
ptree = p4est_tree_array_index (p4est->trees, jt);
memcpy (ptree, itree, sizeof (p4est_tree_t));
sc_array_init (&ptree->quadrants, sizeof (p4est_quadrant_t));
}
for (jt = first_tree; jt <= last_tree; ++jt) {
itree = p4est_tree_array_index (input->trees, jt);
iquadrants = &itree->quadrants;
icount = iquadrants->elem_count;
ptree = p4est_tree_array_index (p4est->trees, jt);
pquadrants = &ptree->quadrants;
sc_array_resize (pquadrants, icount);
memcpy (pquadrants->array, iquadrants->array,
icount * sizeof (p4est_quadrant_t));
if (p4est->data_size > 0) {
P4EST_ASSERT (copy_data);
for (zz = 0; zz < icount; ++zz) {
iq = p4est_quadrant_array_index (iquadrants, zz);
pq = p4est_quadrant_array_index (pquadrants, zz);
pq->p.user_data = sc_mempool_alloc (p4est->user_data_pool);
memcpy (pq->p.user_data, iq->p.user_data, p4est->data_size);
}
}
}
/* allocate and copy global quadrant count */
p4est->global_first_quadrant =
P4EST_ALLOC (p4est_gloidx_t, p4est->mpisize + 1);
memcpy (p4est->global_first_quadrant, input->global_first_quadrant,
(p4est->mpisize + 1) * sizeof (p4est_gloidx_t));
/* allocate and copy global partition information */
p4est->global_first_position = P4EST_ALLOC (p4est_quadrant_t,
p4est->mpisize + 1);
memcpy (p4est->global_first_position, input->global_first_position,
(p4est->mpisize + 1) * sizeof (p4est_quadrant_t));
/* the copy starts with a revision count of zero */
p4est->revision = 0;
/* check for valid p4est and return */
P4EST_ASSERT (p4est_is_valid (p4est));
return p4est;
}
void
p4est_reset_data (p4est_t * p4est, size_t data_size,
p4est_init_t init_fn, void *user_pointer)
{
int doresize;
size_t zz;
p4est_topidx_t jt;
p4est_quadrant_t *q;
p4est_tree_t *tree;
sc_array_t *tquadrants;
doresize = (p4est->data_size != data_size);
p4est->data_size = data_size;
p4est->user_pointer = user_pointer;
if (doresize) {
if (p4est->user_data_pool != NULL) {
sc_mempool_destroy (p4est->user_data_pool);
}
if (p4est->data_size > 0) {
p4est->user_data_pool = sc_mempool_new (p4est->data_size);
}
else {
p4est->user_data_pool = NULL;
}
}
for (jt = p4est->first_local_tree; jt <= p4est->last_local_tree; ++jt) {
tree = p4est_tree_array_index (p4est->trees, jt);
tquadrants = &tree->quadrants;
for (zz = 0; zz < tquadrants->elem_count; ++zz) {
q = p4est_quadrant_array_index (tquadrants, zz);
if (doresize) {
if (p4est->data_size > 0) {
q->p.user_data = sc_mempool_alloc (p4est->user_data_pool);
}
else {
q->p.user_data = NULL;
}
}
if (init_fn != NULL) {
init_fn (p4est, jt, q);
}
}
}
}
void
p4est_refine (p4est_t * p4est, int refine_recursive,
p4est_refine_t refine_fn, p4est_init_t init_fn)
{
p4est_refine_ext (p4est, refine_recursive, -1, refine_fn, init_fn, NULL);
}
void
p4est_refine_ext (p4est_t * p4est, int refine_recursive, int allowed_level,
p4est_refine_t refine_fn, p4est_init_t init_fn,
p4est_replace_t replace_fn)
{
#ifdef P4EST_ENABLE_DEBUG
size_t quadrant_pool_size, data_pool_size;
#endif
int firsttime;
int i, maxlevel;
p4est_topidx_t nt;
p4est_gloidx_t old_gnq;
size_t incount, current, restpos, movecount;
sc_list_t *list;
p4est_tree_t *tree;
p4est_quadrant_t *q, *qalloc, *qpop;
p4est_quadrant_t *c0, *c1, *c2, *c3;
#ifdef P4_TO_P8
p4est_quadrant_t *c4, *c5, *c6, *c7;
#endif
sc_array_t *tquadrants;
p4est_quadrant_t *family[8];
p4est_quadrant_t parent, *pp = &parent;
if (allowed_level < 0) {
allowed_level = P4EST_QMAXLEVEL;
}
P4EST_GLOBAL_PRODUCTIONF ("Into " P4EST_STRING
"_refine with %lld total quadrants,"
" allowed level %d\n",
(long long) p4est->global_num_quadrants,
allowed_level);
p4est_log_indent_push ();
P4EST_ASSERT (p4est_is_valid (p4est));
P4EST_ASSERT (0 <= allowed_level && allowed_level <= P4EST_QMAXLEVEL);
P4EST_ASSERT (refine_fn != NULL);
/* remember input quadrant count; it will not decrease */
old_gnq = p4est->global_num_quadrants;
/*
q points to a quadrant that is an array member
qalloc is a quadrant that has been allocated through quadrant_pool
qpop is a quadrant that has been allocated through quadrant_pool
never mix these two types of quadrant pointers
The quadrant->pad8 field of list quadrants is interpreted as boolean
and set to true for quadrants that have already been refined.
*/
list = sc_list_new (NULL);
p4est->local_num_quadrants = 0;
/* loop over all local trees */
for (nt = p4est->first_local_tree; nt <= p4est->last_local_tree; ++nt) {
tree = p4est_tree_array_index (p4est->trees, nt);
tree->quadrants_offset = p4est->local_num_quadrants;
tquadrants = &tree->quadrants;
#ifdef P4EST_ENABLE_DEBUG
quadrant_pool_size = p4est->quadrant_pool->elem_count;
data_pool_size = 0;
if (p4est->user_data_pool != NULL) {
data_pool_size = p4est->user_data_pool->elem_count;
}
#endif
/* initial log message for this tree */
P4EST_VERBOSEF ("Into refine tree %lld with %llu\n", (long long) nt,
(unsigned long long) tquadrants->elem_count);
/* reset the quadrant counters */
maxlevel = 0;
for (i = 0; i <= P4EST_QMAXLEVEL; ++i) {
tree->quadrants_per_level[i] = 0;
}
/* run through the array to find first quadrant to be refined */
q = NULL;
incount = tquadrants->elem_count;
for (current = 0; current < incount; ++current) {
q = p4est_quadrant_array_index (tquadrants, current);
if (refine_fn (p4est, nt, q) && (int) q->level < allowed_level) {
break;
}
maxlevel = SC_MAX (maxlevel, (int) q->level);
++tree->quadrants_per_level[q->level];
}
if (current == incount) {
/* no refinement occurs in this tree */
p4est->local_num_quadrants += incount;
continue;
}
P4EST_ASSERT (q != NULL);
/* now we have a quadrant to refine, prepend it to the list */
qalloc = p4est_quadrant_mempool_alloc (p4est->quadrant_pool);
*qalloc = *q; /* never prepend array members directly */
qalloc->pad8 = 0; /* this quadrant has not been refined yet */
(void) sc_list_prepend (list, qalloc); /* only new quadrants */
P4EST_QUADRANT_INIT (&parent);
/*
current points to the next array member to write
restpos points to the next array member to read
*/
restpos = current + 1;
/* run through the list and refine recursively */
firsttime = 1;
while (list->elem_count > 0) {
qpop = p4est_quadrant_list_pop (list);
if (firsttime ||
((refine_recursive || !qpop->pad8) &&
refine_fn (p4est, nt, qpop) &&
(int) qpop->level < allowed_level)) {
firsttime = 0;
sc_array_resize (tquadrants,
tquadrants->elem_count + P4EST_CHILDREN - 1);
if (replace_fn != NULL) {
/* do not free qpop's data yet: we will do this when the parent
* is replaced */
parent = *qpop;
}
else {
p4est_quadrant_free_data (p4est, qpop);
}
c0 = qpop;
c1 = p4est_quadrant_mempool_alloc (p4est->quadrant_pool);
c2 = p4est_quadrant_mempool_alloc (p4est->quadrant_pool);
c3 = p4est_quadrant_mempool_alloc (p4est->quadrant_pool);
#ifdef P4_TO_P8
c4 = p4est_quadrant_mempool_alloc (p4est->quadrant_pool);
c5 = p4est_quadrant_mempool_alloc (p4est->quadrant_pool);
c6 = p4est_quadrant_mempool_alloc (p4est->quadrant_pool);
c7 = p4est_quadrant_mempool_alloc (p4est->quadrant_pool);
p8est_quadrant_children (qpop, c0, c1, c2, c3, c4, c5, c6, c7);
#else
p4est_quadrant_children (qpop, c0, c1, c2, c3);
#endif
p4est_quadrant_init_data (p4est, nt, c0, init_fn);
p4est_quadrant_init_data (p4est, nt, c1, init_fn);
p4est_quadrant_init_data (p4est, nt, c2, init_fn);
p4est_quadrant_init_data (p4est, nt, c3, init_fn);
c0->pad8 = c1->pad8 = c2->pad8 = c3->pad8 = 1;
#ifdef P4_TO_P8
p4est_quadrant_init_data (p4est, nt, c4, init_fn);
p4est_quadrant_init_data (p4est, nt, c5, init_fn);
p4est_quadrant_init_data (p4est, nt, c6, init_fn);
p4est_quadrant_init_data (p4est, nt, c7, init_fn);
c4->pad8 = c5->pad8 = c6->pad8 = c7->pad8 = 1;
(void) sc_list_prepend (list, c7);
(void) sc_list_prepend (list, c6);
(void) sc_list_prepend (list, c5);
(void) sc_list_prepend (list, c4);
#endif
(void) sc_list_prepend (list, c3);
(void) sc_list_prepend (list, c2);
(void) sc_list_prepend (list, c1);
(void) sc_list_prepend (list, c0);
if (replace_fn != NULL) {
/* in family mode we always call the replace callback right
* away */
family[0] = c0;
family[1] = c1;
family[2] = c2;
family[3] = c3;
#ifdef P4_TO_P8
family[4] = c4;
family[5] = c5;
family[6] = c6;
family[7] = c7;
#endif
replace_fn (p4est, nt, 1, &pp, P4EST_CHILDREN, family);
p4est_quadrant_free_data (p4est, &parent);
}
}
else {
/* need to make room in the array to store this new quadrant */
if (restpos < incount && current == restpos) {
movecount = SC_MIN (incount - restpos, number_toread_quadrants);
while (movecount > 0) {
q = p4est_quadrant_array_index (tquadrants, restpos);
qalloc = p4est_quadrant_mempool_alloc (p4est->quadrant_pool);
*qalloc = *q; /* never append array members directly */
qalloc->pad8 = 0; /* has not been refined yet */
(void) sc_list_append (list, qalloc); /* only new quadrants */
--movecount;
++restpos;
}
}
/* store new quadrant and update counters */
q = p4est_quadrant_array_index (tquadrants, current);
*q = *qpop;
maxlevel = SC_MAX (maxlevel, (int) qpop->level);
++tree->quadrants_per_level[qpop->level];
++current;
sc_mempool_free (p4est->quadrant_pool, qpop);
}
}
tree->maxlevel = (int8_t) maxlevel;
p4est->local_num_quadrants += tquadrants->elem_count;
P4EST_ASSERT (restpos == incount);
P4EST_ASSERT (current == tquadrants->elem_count);
P4EST_ASSERT (list->first == NULL && list->last == NULL);
P4EST_ASSERT (quadrant_pool_size == p4est->quadrant_pool->elem_count);
if (p4est->user_data_pool != NULL) {
P4EST_ASSERT (data_pool_size + tquadrants->elem_count ==
p4est->user_data_pool->elem_count + incount);
}
P4EST_ASSERT (p4est_tree_is_sorted (tree));
P4EST_ASSERT (p4est_tree_is_complete (tree));
/* final log message for this tree */
P4EST_VERBOSEF ("Done refine tree %lld now %llu\n", (long long) nt,
(unsigned long long) tquadrants->elem_count);
}
if (p4est->last_local_tree >= 0) {
for (; nt < p4est->connectivity->num_trees; ++nt) {
tree = p4est_tree_array_index (p4est->trees, nt);
tree->quadrants_offset = p4est->local_num_quadrants;
}
}
sc_list_destroy (list);
/* compute global number of quadrants */
p4est_comm_count_quadrants (p4est);
P4EST_ASSERT (p4est->global_num_quadrants >= old_gnq);
if (old_gnq != p4est->global_num_quadrants) {
++p4est->revision;
}
P4EST_ASSERT (p4est_is_valid (p4est));
p4est_log_indent_pop ();
P4EST_GLOBAL_PRODUCTIONF ("Done " P4EST_STRING
"_refine with %lld total quadrants\n",
(long long) p4est->global_num_quadrants);
}
void
p4est_coarsen (p4est_t * p4est, int coarsen_recursive,
p4est_coarsen_t coarsen_fn, p4est_init_t init_fn)
{
p4est_coarsen_ext (p4est, coarsen_recursive, 0, coarsen_fn, init_fn, NULL);
}
void
p4est_coarsen_ext (p4est_t * p4est,
int coarsen_recursive, int callback_orphans,
p4est_coarsen_t coarsen_fn, p4est_init_t init_fn,
p4est_replace_t replace_fn)
{
#ifdef P4EST_ENABLE_DEBUG
size_t data_pool_size;
#endif
int i, maxlevel;
int isfamily;
size_t zz;
size_t incount, removed;
size_t window, start, length, cidz;
p4est_locidx_t num_quadrants, prev_offset;
p4est_topidx_t jt;
p4est_gloidx_t old_gnq;
p4est_tree_t *tree;
p4est_quadrant_t *c[P4EST_CHILDREN];
p4est_quadrant_t *cfirst, *clast;
sc_array_t *tquadrants;
p4est_quadrant_t qtemp;
P4EST_GLOBAL_PRODUCTIONF ("Into " P4EST_STRING
"_coarsen with %lld total quadrants\n",
(long long) p4est->global_num_quadrants);
p4est_log_indent_push ();
P4EST_ASSERT (p4est_is_valid (p4est));
P4EST_ASSERT (coarsen_fn != NULL);
/* remember input quadrant count; it will not increase */
old_gnq = p4est->global_num_quadrants;
P4EST_QUADRANT_INIT (&qtemp);
/* loop over all local trees */
prev_offset = 0;
for (jt = p4est->first_local_tree; jt <= p4est->last_local_tree; ++jt) {
tree = p4est_tree_array_index (p4est->trees, jt);
tquadrants = &tree->quadrants;
#ifdef P4EST_ENABLE_DEBUG
data_pool_size = 0;
if (p4est->user_data_pool != NULL) {
data_pool_size = p4est->user_data_pool->elem_count;
}
#endif
removed = 0;
/* initial log message for this tree */
P4EST_VERBOSEF ("Into coarsen tree %lld with %llu\n", (long long) jt,
(unsigned long long) tquadrants->elem_count);
/* state information */
window = 0; /* start position of sliding window in array */
start = 1; /* start position of hole in window/array */
length = 0; /* length of hole in window/array */
/* run through the array and coarsen recursively */
incount = tquadrants->elem_count;
while (window + P4EST_CHILDREN + length <= incount) {
P4EST_ASSERT (window < start);