{"diffoscope-json-version": 1, "source1": "/srv/reproducible-results/rbuild-debian/r-b-build.kqliqnAN/b1/opensubdiv_3.5.0-2.1_arm64.changes", "source2": "/srv/reproducible-results/rbuild-debian/r-b-build.kqliqnAN/b2/opensubdiv_3.5.0-2.1_arm64.changes", "unified_diff": null, "details": [{"source1": "Files", "source2": "Files", "unified_diff": "@@ -1,9 +1,9 @@\n \n 586e058538ecda783c7cff3fe99f3fc4 144000 libdevel optional libosd-dev_3.5.0-2.1_arm64.deb\n- 1d2ad951cbd316e007166759fd8e3b79 31489476 doc optional libosd-doc_3.5.0-2.1_all.deb\n+ c6c95fa84d3a75395ad851b3ce8bf9da 31489280 doc optional libosd-doc_3.5.0-2.1_all.deb\n 57479c958eb5186d29c00712af20ddad 3444036 debug optional libosdcpu3.5.0t64-dbgsym_3.5.0-2.1_arm64.deb\n 5eeabe44bf1b51a7782fee606e1a5b5f 291076 libs optional libosdcpu3.5.0t64_3.5.0-2.1_arm64.deb\n a2b27832cae204a1d30e255bbe07b8f4 534708 debug optional libosdgpu3.5.0t64-dbgsym_3.5.0-2.1_arm64.deb\n 68033badfdfa00c510708bd825a78b8b 132660 libs optional libosdgpu3.5.0t64_3.5.0-2.1_arm64.deb\n 44b7071c16b39a779d3cccc9b19de2c9 12008536 debug optional opensubdiv-tools-dbgsym_3.5.0-2.1_arm64.deb\n 86cfb3efb3d8511df9aed41ff02e9b98 569892 graphics optional opensubdiv-tools_3.5.0-2.1_arm64.deb\n"}, {"source1": "libosd-doc_3.5.0-2.1_all.deb", "source2": "libosd-doc_3.5.0-2.1_all.deb", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,3 +1,3 @@\n -rw-r--r-- 0 0 0 4 2024-02-29 12:58:19.000000 debian-binary\n--rw-r--r-- 0 0 0 25536 2024-02-29 12:58:19.000000 control.tar.xz\n--rw-r--r-- 0 0 0 31463748 2024-02-29 12:58:19.000000 data.tar.xz\n+-rw-r--r-- 0 0 0 25476 2024-02-29 12:58:19.000000 control.tar.xz\n+-rw-r--r-- 0 0 0 31463612 2024-02-29 12:58:19.000000 data.tar.xz\n"}, {"source1": "control.tar.xz", "source2": "control.tar.xz", "unified_diff": null, "details": [{"source1": "control.tar", "source2": "control.tar", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}, {"source1": "line order", "source2": "line order", "unified_diff": "@@ -125,20 +125,20 @@\n usr/share/doc/opensubdiv/doxy_html/a00782_source.html\n usr/share/doc/opensubdiv/doxy_html/a00785.html\n usr/share/doc/opensubdiv/doxy_html/a00785_source.html\n usr/share/doc/opensubdiv/doxy_html/a00788.html\n usr/share/doc/opensubdiv/doxy_html/a00788.js\n usr/share/doc/opensubdiv/doxy_html/a00788_source.html\n usr/share/doc/opensubdiv/doxy_html/a00791.html\n-usr/share/doc/opensubdiv/doxy_html/a00791.js\n usr/share/doc/opensubdiv/doxy_html/a00791_source.html\n usr/share/doc/opensubdiv/doxy_html/a00794.html\n usr/share/doc/opensubdiv/doxy_html/a00794.js\n usr/share/doc/opensubdiv/doxy_html/a00794_source.html\n usr/share/doc/opensubdiv/doxy_html/a00797.html\n+usr/share/doc/opensubdiv/doxy_html/a00797.js\n usr/share/doc/opensubdiv/doxy_html/a00797_source.html\n usr/share/doc/opensubdiv/doxy_html/a00800.html\n usr/share/doc/opensubdiv/doxy_html/a00800.js\n usr/share/doc/opensubdiv/doxy_html/a00800_source.html\n usr/share/doc/opensubdiv/doxy_html/a00803.html\n usr/share/doc/opensubdiv/doxy_html/a00803.js\n usr/share/doc/opensubdiv/doxy_html/a00803_source.html\n"}]}]}, {"source1": "xz --list", "source2": "xz --list", "unified_diff": "@@ -1,13 +1,13 @@\n Streams: 1\n Blocks: 1\n- Compressed size: 24.9 KiB (25536 B)\n+ Compressed size: 24.9 KiB (25476 B)\n Uncompressed size: 100.0 KiB (102400 B)\n Ratio: 0.249\n Check: CRC64\n Stream Padding: 0 B\n Streams:\n Stream Blocks CompOffset UncompOffset CompSize UncompSize Ratio Check Padding\n- 1 1 0 0 25536 102400 0.249 CRC64 0\n+ 1 1 0 0 25476 102400 0.249 CRC64 0\n Blocks:\n Stream Block CompOffset UncompOffset TotalSize UncompSize Ratio Check\n- 1 1 12 0 25500 102400 0.249 CRC64\n+ 1 1 12 0 25440 102400 0.248 CRC64\n"}]}, {"source1": "data.tar.xz", "source2": "data.tar.xz", "unified_diff": null, "details": [{"source1": "data.tar", "source2": "data.tar", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -33,62 +33,62 @@\n drwxr-xr-x 0 root (0) root (0) 0 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/\n -rw-r--r-- 0 root (0) root (0) 6576 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00674.html\n -rw-r--r-- 0 root (0) root (0) 69 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00674.js\n -rw-r--r-- 0 root (0) root (0) 76687 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00674_source.html\n -rw-r--r-- 0 root (0) root (0) 7385 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00677.html\n -rw-r--r-- 0 root (0) root (0) 109 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00677.js\n -rw-r--r-- 0 root (0) root (0) 65516 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00677_source.html\n--rw-r--r-- 0 root (0) root (0) 7504 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00680.html\n--rw-r--r-- 0 root (0) root (0) 111 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00680.js\n--rw-r--r-- 0 root (0) root (0) 88831 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00680_source.html\n--rw-r--r-- 0 root (0) root (0) 7311 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00683.html\n--rw-r--r-- 0 root (0) root (0) 195 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00683.js\n--rw-r--r-- 0 root (0) root (0) 27167 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00683_source.html\n--rw-r--r-- 0 root (0) root (0) 6558 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00686.html\n--rw-r--r-- 0 root (0) root (0) 78 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00686.js\n--rw-r--r-- 0 root (0) root (0) 35228 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00686_source.html\n+-rw-r--r-- 0 root (0) root (0) 7311 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00680.html\n+-rw-r--r-- 0 root (0) root (0) 195 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00680.js\n+-rw-r--r-- 0 root (0) root (0) 27167 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00680_source.html\n+-rw-r--r-- 0 root (0) root (0) 6558 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00683.html\n+-rw-r--r-- 0 root (0) root (0) 78 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00683.js\n+-rw-r--r-- 0 root (0) root (0) 35228 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00683_source.html\n+-rw-r--r-- 0 root (0) root (0) 7504 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00686.html\n+-rw-r--r-- 0 root (0) root (0) 111 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00686.js\n+-rw-r--r-- 0 root (0) root (0) 88831 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00686_source.html\n -rw-r--r-- 0 root (0) root (0) 7075 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00689.html\n -rw-r--r-- 0 root (0) root (0) 120 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00689.js\n -rw-r--r-- 0 root (0) root (0) 75919 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00689_source.html\n--rw-r--r-- 0 root (0) root (0) 7765 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00692.html\n--rw-r--r-- 0 root (0) root (0) 150 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00692.js\n--rw-r--r-- 0 root (0) root (0) 40418 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00692_source.html\n--rw-r--r-- 0 root (0) root (0) 6436 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00695.html\n--rw-r--r-- 0 root (0) root (0) 69 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00695.js\n--rw-r--r-- 0 root (0) root (0) 45702 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00695_source.html\n+-rw-r--r-- 0 root (0) root (0) 6436 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00692.html\n+-rw-r--r-- 0 root (0) root (0) 69 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00692.js\n+-rw-r--r-- 0 root (0) root (0) 45702 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00692_source.html\n+-rw-r--r-- 0 root (0) root (0) 7765 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00695.html\n+-rw-r--r-- 0 root (0) root (0) 150 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00695.js\n+-rw-r--r-- 0 root (0) root (0) 40418 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00695_source.html\n -rw-r--r-- 0 root (0) root (0) 6387 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00698.html\n -rw-r--r-- 0 root (0) root (0) 55 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00698.js\n -rw-r--r-- 0 root (0) root (0) 14299 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00698_source.html\n -rw-r--r-- 0 root (0) root (0) 8007 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00704.html\n -rw-r--r-- 0 root (0) root (0) 171 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00704.js\n -rw-r--r-- 0 root (0) root (0) 74098 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00704_source.html\n -rw-r--r-- 0 root (0) root (0) 7837 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00707.html\n -rw-r--r-- 0 root (0) root (0) 190 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00707.js\n -rw-r--r-- 0 root (0) root (0) 147347 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00707_source.html\n -rw-r--r-- 0 root (0) root (0) 6698 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00710.html\n -rw-r--r-- 0 root (0) root (0) 66 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00710.js\n -rw-r--r-- 0 root (0) root (0) 66668 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00710_source.html\n--rw-r--r-- 0 root (0) root (0) 9468 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713.html\n--rw-r--r-- 0 root (0) root (0) 404 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713.js\n--rw-r--r-- 0 root (0) root (0) 84414 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713_source.html\n--rw-r--r-- 0 root (0) root (0) 7136 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716.html\n--rw-r--r-- 0 root (0) root (0) 119 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716.js\n--rw-r--r-- 0 root (0) root (0) 38039 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716_source.html\n+-rw-r--r-- 0 root (0) root (0) 7136 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713.html\n+-rw-r--r-- 0 root (0) root (0) 119 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713.js\n+-rw-r--r-- 0 root (0) root (0) 38039 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713_source.html\n+-rw-r--r-- 0 root (0) root (0) 9468 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716.html\n+-rw-r--r-- 0 root (0) root (0) 404 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716.js\n+-rw-r--r-- 0 root (0) root (0) 84414 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716_source.html\n -rw-r--r-- 0 root (0) root (0) 9923 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00719.html\n -rw-r--r-- 0 root (0) root (0) 456 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00719.js\n -rw-r--r-- 0 root (0) root (0) 177059 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00719_source.html\n -rw-r--r-- 0 root (0) root (0) 6563 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00722.html\n -rw-r--r-- 0 root (0) root (0) 64 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00722.js\n -rw-r--r-- 0 root (0) root (0) 19420 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00722_source.html\n--rw-r--r-- 0 root (0) root (0) 8223 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725.html\n--rw-r--r-- 0 root (0) root (0) 130 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725.js\n--rw-r--r-- 0 root (0) root (0) 212261 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725_source.html\n--rw-r--r-- 0 root (0) root (0) 7813 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728.html\n--rw-r--r-- 0 root (0) root (0) 163 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728.js\n--rw-r--r-- 0 root (0) root (0) 67819 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728_source.html\n+-rw-r--r-- 0 root (0) root (0) 7813 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725.html\n+-rw-r--r-- 0 root (0) root (0) 163 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725.js\n+-rw-r--r-- 0 root (0) root (0) 67819 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725_source.html\n+-rw-r--r-- 0 root (0) root (0) 8223 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728.html\n+-rw-r--r-- 0 root (0) root (0) 130 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728.js\n+-rw-r--r-- 0 root (0) root (0) 212261 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728_source.html\n -rw-r--r-- 0 root (0) root (0) 7336 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00731.html\n -rw-r--r-- 0 root (0) root (0) 111 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00731.js\n -rw-r--r-- 0 root (0) root (0) 159214 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00731_source.html\n -rw-r--r-- 0 root (0) root (0) 6745 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00734.html\n -rw-r--r-- 0 root (0) root (0) 103 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00734.js\n -rw-r--r-- 0 root (0) root (0) 42247 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00734_source.html\n -rw-r--r-- 0 root (0) root (0) 8124 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00737.html\n@@ -104,18 +104,18 @@\n -rw-r--r-- 0 root (0) root (0) 38294 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00746_source.html\n -rw-r--r-- 0 root (0) root (0) 5899 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00749.html\n -rw-r--r-- 0 root (0) root (0) 22113 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00749_source.html\n -rw-r--r-- 0 root (0) root (0) 6082 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00752.html\n -rw-r--r-- 0 root (0) root (0) 85953 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00752_source.html\n -rw-r--r-- 0 root (0) root (0) 6202 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00755.html\n -rw-r--r-- 0 root (0) root (0) 163473 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00755_source.html\n--rw-r--r-- 0 root (0) root (0) 6267 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00758.html\n--rw-r--r-- 0 root (0) root (0) 81483 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00758_source.html\n--rw-r--r-- 0 root (0) root (0) 6289 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00761.html\n--rw-r--r-- 0 root (0) root (0) 24307 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00761_source.html\n+-rw-r--r-- 0 root (0) root (0) 6289 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00758.html\n+-rw-r--r-- 0 root (0) root (0) 24307 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00758_source.html\n+-rw-r--r-- 0 root (0) root (0) 6267 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00761.html\n+-rw-r--r-- 0 root (0) root (0) 81483 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00761_source.html\n -rw-r--r-- 0 root (0) root (0) 6114 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00764.html\n -rw-r--r-- 0 root (0) root (0) 29126 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00764_source.html\n -rw-r--r-- 0 root (0) root (0) 6437 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00767.html\n -rw-r--r-- 0 root (0) root (0) 121 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00767.js\n -rw-r--r-- 0 root (0) root (0) 46438 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00767_source.html\n -rw-r--r-- 0 root (0) root (0) 7580 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00770.html\n -rw-r--r-- 0 root (0) root (0) 130 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00770.js\n@@ -124,113 +124,113 @@\n -rw-r--r-- 0 root (0) root (0) 60 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00773.js\n -rw-r--r-- 0 root (0) root (0) 38674 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00773_source.html\n -rw-r--r-- 0 root (0) root (0) 5827 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00776.html\n -rw-r--r-- 0 root (0) root (0) 100442 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00776_source.html\n -rw-r--r-- 0 root (0) root (0) 6474 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00779.html\n -rw-r--r-- 0 root (0) root (0) 59 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00779.js\n -rw-r--r-- 0 root (0) root (0) 53913 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00779_source.html\n--rw-r--r-- 0 root (0) root (0) 5836 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00782.html\n--rw-r--r-- 0 root (0) root (0) 89790 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00782_source.html\n--rw-r--r-- 0 root (0) root (0) 5753 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00785.html\n--rw-r--r-- 0 root (0) root (0) 38297 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00785_source.html\n+-rw-r--r-- 0 root (0) root (0) 5753 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00782.html\n+-rw-r--r-- 0 root (0) root (0) 38297 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00782_source.html\n+-rw-r--r-- 0 root (0) root (0) 5836 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00785.html\n+-rw-r--r-- 0 root (0) root (0) 89790 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00785_source.html\n -rw-r--r-- 0 root (0) root (0) 6807 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00788.html\n -rw-r--r-- 0 root (0) root (0) 67 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00788.js\n -rw-r--r-- 0 root (0) root (0) 33910 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00788_source.html\n--rw-r--r-- 0 root (0) root (0) 7125 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00791.html\n--rw-r--r-- 0 root (0) root (0) 115 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00791.js\n--rw-r--r-- 0 root (0) root (0) 128979 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00791_source.html\n--rw-r--r-- 0 root (0) root (0) 6425 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00794.html\n--rw-r--r-- 0 root (0) root (0) 67 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00794.js\n--rw-r--r-- 0 root (0) root (0) 23841 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00794_source.html\n--rw-r--r-- 0 root (0) root (0) 4478 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00797.html\n--rw-r--r-- 0 root (0) root (0) 10583 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00797_source.html\n+-rw-r--r-- 0 root (0) root (0) 4478 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00791.html\n+-rw-r--r-- 0 root (0) root (0) 10583 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00791_source.html\n+-rw-r--r-- 0 root (0) root (0) 7125 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00794.html\n+-rw-r--r-- 0 root (0) root (0) 115 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00794.js\n+-rw-r--r-- 0 root (0) root (0) 128979 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00794_source.html\n+-rw-r--r-- 0 root (0) root (0) 6425 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00797.html\n+-rw-r--r-- 0 root (0) root (0) 67 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00797.js\n+-rw-r--r-- 0 root (0) root (0) 23841 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00797_source.html\n -rw-r--r-- 0 root (0) root (0) 6897 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00800.html\n -rw-r--r-- 0 root (0) root (0) 65 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00800.js\n -rw-r--r-- 0 root (0) root (0) 34223 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00800_source.html\n--rw-r--r-- 0 root (0) root (0) 6161 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803.html\n--rw-r--r-- 0 root (0) root (0) 63 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803.js\n--rw-r--r-- 0 root (0) root (0) 14083 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803_source.html\n--rw-r--r-- 0 root (0) root (0) 7174 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806.html\n--rw-r--r-- 0 root (0) root (0) 115 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806.js\n--rw-r--r-- 0 root (0) root (0) 252040 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806_source.html\n--rw-r--r-- 0 root (0) root (0) 6580 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00809.html\n--rw-r--r-- 0 root (0) root (0) 99 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00809.js\n--rw-r--r-- 0 root (0) root (0) 12709 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00809_source.html\n--rw-r--r-- 0 root (0) root (0) 6306 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00812.html\n--rw-r--r-- 0 root (0) root (0) 69 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00812.js\n--rw-r--r-- 0 root (0) root (0) 20385 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00812_source.html\n+-rw-r--r-- 0 root (0) root (0) 7174 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803.html\n+-rw-r--r-- 0 root (0) root (0) 115 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803.js\n+-rw-r--r-- 0 root (0) root (0) 252040 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803_source.html\n+-rw-r--r-- 0 root (0) root (0) 6161 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806.html\n+-rw-r--r-- 0 root (0) root (0) 63 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806.js\n+-rw-r--r-- 0 root (0) root (0) 14083 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806_source.html\n+-rw-r--r-- 0 root (0) root (0) 6306 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00809.html\n+-rw-r--r-- 0 root (0) root (0) 69 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00809.js\n+-rw-r--r-- 0 root (0) root (0) 20385 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00809_source.html\n+-rw-r--r-- 0 root (0) root (0) 6580 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00812.html\n+-rw-r--r-- 0 root (0) root (0) 99 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00812.js\n+-rw-r--r-- 0 root (0) root (0) 12709 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00812_source.html\n -rw-r--r-- 0 root (0) root (0) 6818 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00815.html\n -rw-r--r-- 0 root (0) root (0) 66 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00815.js\n -rw-r--r-- 0 root (0) root (0) 35394 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00815_source.html\n -rw-r--r-- 0 root (0) root (0) 6452 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00818.html\n -rw-r--r-- 0 root (0) root (0) 79 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00818.js\n -rw-r--r-- 0 root (0) root (0) 25442 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00818_source.html\n -rw-r--r-- 0 root (0) root (0) 7052 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00821.html\n -rw-r--r-- 0 root (0) root (0) 124 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00821.js\n -rw-r--r-- 0 root (0) root (0) 223874 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00821_source.html\n -rw-r--r-- 0 root (0) root (0) 6246 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00824.html\n -rw-r--r-- 0 root (0) root (0) 71 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00824.js\n -rw-r--r-- 0 root (0) root (0) 22526 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00824_source.html\n--rw-r--r-- 0 root (0) root (0) 6592 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827.html\n--rw-r--r-- 0 root (0) root (0) 101 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827.js\n--rw-r--r-- 0 root (0) root (0) 12826 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827_source.html\n--rw-r--r-- 0 root (0) root (0) 6316 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830.html\n--rw-r--r-- 0 root (0) root (0) 70 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830.js\n--rw-r--r-- 0 root (0) root (0) 16843 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830_source.html\n+-rw-r--r-- 0 root (0) root (0) 6316 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827.html\n+-rw-r--r-- 0 root (0) root (0) 70 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827.js\n+-rw-r--r-- 0 root (0) root (0) 16843 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827_source.html\n+-rw-r--r-- 0 root (0) root (0) 6592 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830.html\n+-rw-r--r-- 0 root (0) root (0) 101 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830.js\n+-rw-r--r-- 0 root (0) root (0) 12826 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830_source.html\n -rw-r--r-- 0 root (0) root (0) 6358 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00833.html\n -rw-r--r-- 0 root (0) root (0) 70 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00833.js\n -rw-r--r-- 0 root (0) root (0) 22933 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00833_source.html\n -rw-r--r-- 0 root (0) root (0) 6766 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00836.html\n -rw-r--r-- 0 root (0) root (0) 68 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00836.js\n -rw-r--r-- 0 root (0) root (0) 27921 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00836_source.html\n -rw-r--r-- 0 root (0) root (0) 6357 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00839.html\n -rw-r--r-- 0 root (0) root (0) 81 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00839.js\n -rw-r--r-- 0 root (0) root (0) 26984 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00839_source.html\n--rw-r--r-- 0 root (0) root (0) 7017 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842.html\n--rw-r--r-- 0 root (0) root (0) 128 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842.js\n--rw-r--r-- 0 root (0) root (0) 49761 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842_source.html\n--rw-r--r-- 0 root (0) root (0) 6410 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845.html\n--rw-r--r-- 0 root (0) root (0) 73 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845.js\n--rw-r--r-- 0 root (0) root (0) 22723 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845_source.html\n+-rw-r--r-- 0 root (0) root (0) 6410 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842.html\n+-rw-r--r-- 0 root (0) root (0) 73 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842.js\n+-rw-r--r-- 0 root (0) root (0) 22723 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842_source.html\n+-rw-r--r-- 0 root (0) root (0) 7017 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845.html\n+-rw-r--r-- 0 root (0) root (0) 128 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845.js\n+-rw-r--r-- 0 root (0) root (0) 49761 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845_source.html\n -rw-r--r-- 0 root (0) root (0) 7225 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00848.html\n -rw-r--r-- 0 root (0) root (0) 126 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00848.js\n -rw-r--r-- 0 root (0) root (0) 224157 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00848_source.html\n -rw-r--r-- 0 root (0) root (0) 7199 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00851.html\n -rw-r--r-- 0 root (0) root (0) 121 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00851.js\n -rw-r--r-- 0 root (0) root (0) 239108 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00851_source.html\n -rw-r--r-- 0 root (0) root (0) 6316 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00854.html\n -rw-r--r-- 0 root (0) root (0) 70 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00854.js\n -rw-r--r-- 0 root (0) root (0) 17165 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00854_source.html\n -rw-r--r-- 0 root (0) root (0) 6574 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00857.html\n -rw-r--r-- 0 root (0) root (0) 98 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00857.js\n -rw-r--r-- 0 root (0) root (0) 12790 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00857_source.html\n--rw-r--r-- 0 root (0) root (0) 6486 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00860.html\n--rw-r--r-- 0 root (0) root (0) 67 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00860.js\n--rw-r--r-- 0 root (0) root (0) 19962 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00860_source.html\n--rw-r--r-- 0 root (0) root (0) 6445 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00863.html\n--rw-r--r-- 0 root (0) root (0) 78 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00863.js\n--rw-r--r-- 0 root (0) root (0) 23459 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00863_source.html\n--rw-r--r-- 0 root (0) root (0) 6745 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00866.html\n--rw-r--r-- 0 root (0) root (0) 65 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00866.js\n--rw-r--r-- 0 root (0) root (0) 47052 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00866_source.html\n+-rw-r--r-- 0 root (0) root (0) 6745 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00860.html\n+-rw-r--r-- 0 root (0) root (0) 65 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00860.js\n+-rw-r--r-- 0 root (0) root (0) 47052 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00860_source.html\n+-rw-r--r-- 0 root (0) root (0) 6486 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00863.html\n+-rw-r--r-- 0 root (0) root (0) 67 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00863.js\n+-rw-r--r-- 0 root (0) root (0) 19962 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00863_source.html\n+-rw-r--r-- 0 root (0) root (0) 6445 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00866.html\n+-rw-r--r-- 0 root (0) root (0) 78 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00866.js\n+-rw-r--r-- 0 root (0) root (0) 23459 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00866_source.html\n -rw-r--r-- 0 root (0) root (0) 6497 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00869.html\n -rw-r--r-- 0 root (0) root (0) 70 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00869.js\n -rw-r--r-- 0 root (0) root (0) 21040 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00869_source.html\n -rw-r--r-- 0 root (0) root (0) 11270 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00872.html\n -rw-r--r-- 0 root (0) root (0) 424 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00872.js\n -rw-r--r-- 0 root (0) root (0) 29216 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00872_source.html\n -rw-r--r-- 0 root (0) root (0) 6381 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00875.html\n -rw-r--r-- 0 root (0) root (0) 61 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00875.js\n -rw-r--r-- 0 root (0) root (0) 111096 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00875_source.html\n--rw-r--r-- 0 root (0) root (0) 6381 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00878.html\n--rw-r--r-- 0 root (0) root (0) 61 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00878.js\n--rw-r--r-- 0 root (0) root (0) 110902 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00878_source.html\n--rw-r--r-- 0 root (0) root (0) 8721 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00881.html\n--rw-r--r-- 0 root (0) root (0) 262 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00881.js\n--rw-r--r-- 0 root (0) root (0) 21259 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00881_source.html\n+-rw-r--r-- 0 root (0) root (0) 8721 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00878.html\n+-rw-r--r-- 0 root (0) root (0) 262 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00878.js\n+-rw-r--r-- 0 root (0) root (0) 21259 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00878_source.html\n+-rw-r--r-- 0 root (0) root (0) 6381 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00881.html\n+-rw-r--r-- 0 root (0) root (0) 61 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00881.js\n+-rw-r--r-- 0 root (0) root (0) 110902 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00881_source.html\n -rw-r--r-- 0 root (0) root (0) 4474 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00884.html\n -rw-r--r-- 0 root (0) root (0) 12883 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00884_source.html\n -rw-r--r-- 0 root (0) root (0) 14201 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00887.html\n -rw-r--r-- 0 root (0) root (0) 2466 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00887.js\n -rw-r--r-- 0 root (0) root (0) 182425 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00887_source.html\n -rw-r--r-- 0 root (0) root (0) 6370 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00890.html\n -rw-r--r-- 0 root (0) root (0) 68 2024-02-29 12:58:19.000000 ./usr/share/doc/opensubdiv/doxy_html/a00890.js\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00677.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00677.html", "unified_diff": "@@ -94,15 +94,15 @@\n
\n Classes |\n Namespaces
\n
tessellation.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../bfr/parameterization.h"
\n+#include "../bfr/parameterization.h"
\n
\n

Go to the source code of this file.

\n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00677_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00677_source.html", "unified_diff": "@@ -341,16 +341,16 @@\n
380} // end namespace OPENSUBDIV_VERSION
\n
381using namespace OPENSUBDIV_VERSION;
\n
382
\n
383} // end namespace OpenSubdiv
\n
384
\n
385#endif /* OPENSUBDIV3_BFR_TESSELLATION */
\n
Definition limits.h:32
\n-
Simple class defining the 2D parameterization of a face.
\n-
int GetFaceSize() const
Returns the size (number of vertices) of the corresponding face.
\n+
Simple class defining the 2D parameterization of a face.
\n+
int GetFaceSize() const
Returns the size (number of vertices) of the corresponding face.
\n
void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const
Returns the (u,v) coordinate of a given vertex.
\n
Encapsulates a specific tessellation pattern of a Parameterization.
\n
int GetFaceSize() const
Return the size of the face.
\n
int GetNumBoundaryCoords() const
Return the number of boundary coordinates.
\n
~Tessellation()
\n
void TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[], int const interiorIndices[])
Reassign all facet coordinate indices.
\n
int GetCoordStride() const
Return the number of elements between each coordinate.
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00680.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00680.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/surfaceFactory.h File Reference\n+OpenSubdiv: opensubdiv/bfr/surfaceFactoryCache.h File Reference\n \n \n \n \n \n \n \n@@ -90,33 +90,31 @@\n \n \n \n
\n \n-
surfaceFactory.h File Reference
\n+
surfaceFactoryCache.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../bfr/surface.h"
\n-#include "../bfr/surfaceFactoryMeshAdapter.h"
\n-#include "../sdc/options.h"
\n-#include "../sdc/types.h"
\n+#include "../bfr/irregularPatchType.h"
\n+#include <map>
\n #include <cstdint>
\n
\n

Go to the source code of this file.

\n

\n Classes

class  Tessellation
 Encapsulates a specific tessellation pattern of a Parameterization. More...
\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

\n Classes

class  SurfaceFactory
 Base class providing initialization of a Surface for each face of a mesh. More...
class  SurfaceFactoryCache
 Container used internally by SurfaceFactory to store reusable information. More...
 
class  SurfaceFactory::Options
 Simple set of options assigned to instances of SurfaceFactory. More...
class  SurfaceFactoryCacheThreaded< MUTEX_TYPE, READ_LOCK_GUARD_TYPE, WRITE_LOCK_GUARD_TYPE >
 Template for declaring thread-safe subclasses of SurfaceFactoryCache. More...
 
\n \n \n \n \n@@ -125,13 +123,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,32 +1,32 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-surfaceFactory.h File Reference\n+surfaceFactoryCache.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bs_\bu_\br_\bf_\ba_\bc_\be_\b._\bh\"\n-#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"../bfr/irregularPatchType.h\"\n+#include \n #include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-\u00a0 Base class providing initialization of a _\bS_\bu_\br_\bf_\ba_\bc_\be for each face of a\n- mesh. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n+\u00a0 Container used internally by _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by to store reusable\n+ information. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0 Simple set of options assigned to instances of _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd_\b<_\b _\bM_\bU_\bT_\bE_\bX_\b__\bT_\bY_\bP_\bE_\b,_\b _\bR_\bE_\bA_\bD_\b__\bL_\bO_\bC_\bK_\b__\bG_\bU_\bA_\bR_\bD_\b__\bT_\bY_\bP_\bE_\b,\n+ _\bW_\bR_\bI_\bT_\bE_\b__\bL_\bO_\bC_\bK_\b__\bG_\bU_\bA_\bR_\bD_\b__\bT_\bY_\bP_\bE_\b _\b>\n+\u00a0 Template for declaring thread-safe subclasses of _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00680.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00680.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,4 @@\n var a00680 = [\n- [\"SurfaceFactory\", \"a00941.html\", \"a00941\"],\n- [\"Options\", \"a00945.html\", \"a00945\"]\n+ [\"SurfaceFactoryCache\", \"a00949.html\", \"a00949\"],\n+ [\"SurfaceFactoryCacheThreaded< MUTEX_TYPE, READ_LOCK_GUARD_TYPE, WRITE_LOCK_GUARD_TYPE >\", \"a00953.html\", \"a00953\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00680_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00680_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/surfaceFactory.h Source File\n+OpenSubdiv: opensubdiv/bfr/surfaceFactoryCache.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
surfaceFactory.h
\n+
surfaceFactoryCache.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2021 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,412 +119,126 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_H
\n-
26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_H
\n+
25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H
\n+
26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../bfr/surface.h"
\n-
31#include "../bfr/surfaceFactoryMeshAdapter.h"
\n-
32#include "../sdc/options.h"
\n-
33#include "../sdc/types.h"
\n+
30#include "../bfr/irregularPatchType.h"
\n+
31
\n+
32#include <map>
\n+
33#include <cstdint>
\n
34
\n-
35#include <cstdint>
\n-
36
\n-
37namespace OpenSubdiv {
\n-
38namespace OPENSUBDIV_VERSION {
\n+
35namespace OpenSubdiv {
\n+
36namespace OPENSUBDIV_VERSION {
\n+
37
\n+
38namespace Bfr {
\n
39
\n-
40namespace Bfr {
\n-
41
\n-
42//
\n-
43// Forward declarations of public and internal classes used by factories:
\n-
44//
\n-
45class SurfaceFactoryCache;
\n-
46class FaceTopology;
\n-
47class FaceSurface;
\n-
48
\n-
\n-\n-
104public:
\n-
\n-
116 class Options {
\n-
117 public:
\n-
\n-
118 Options() : _dfltFVarID(-1), _externCache(0), _enableCache(true),
\n-
119 _approxLevelSmooth(2), _approxLevelSharp(6) { }
\n-
\n-
120
\n-\n-
125 FVarID GetDefaultFVarID() const { return _dfltFVarID; }
\n-
126
\n-
128 Options & EnableCaching(bool on);
\n-
130 bool IsCachingEnabled() const { return _enableCache; }
\n-
131
\n-\n-
135 SurfaceFactoryCache * GetExternalCache() const { return _externCache; }
\n-
136
\n-
137 // Set refinement levels used to approximate the limit surface
\n-
138 // for smooth and sharp features (reasonable defaults assigned):
\n-
140 Options & SetApproxLevelSmooth(int level);
\n-
142 int GetApproxLevelSmooth() const { return _approxLevelSmooth; }
\n-
143
\n-
145 Options & SetApproxLevelSharp(int level);
\n-
147 int GetApproxLevelSharp() const { return _approxLevelSharp; }
\n-
148
\n-
149 private:
\n-
150 // Member variables:
\n-
151 FVarID _dfltFVarID;
\n-
152
\n-
153 SurfaceFactoryCache * _externCache;
\n-
154
\n-
155 unsigned char _enableCache : 1;
\n-
156 unsigned char _approxLevelSmooth;
\n-
157 unsigned char _approxLevelSharp;
\n-
158 };
\n-
\n-
159
\n-
160public:
\n-
161 ~SurfaceFactory() override;
\n-
162
\n-
164
\n-
168
\n-
170 Sdc::SchemeType GetSchemeType() const { return _subdivScheme; }
\n-
171
\n-
173 Sdc::Options GetSchemeOptions() const { return _subdivOptions; }
\n-
175
\n-
176public:
\n-
178
\n-
190
\n-
200 bool FaceHasLimitSurface(Index faceIndex) const;
\n-
201
\n-\n-
210
\n-
211public:
\n-
213
\n-
233
\n-
241 template <typename REAL>
\n-
242 bool InitVertexSurface(Index faceIndex, Surface<REAL> * surface) const;
\n-
243
\n-
251 template <typename REAL>
\n-
252 bool InitVaryingSurface(Index faceIndex, Surface<REAL> * surface) const;
\n-
253
\n-
266 template <typename REAL>
\n-
267 bool InitFaceVaryingSurface(Index faceIndex, Surface<REAL> * surface) const;
\n-
268
\n-
278 template <typename REAL>
\n-
279 bool InitFaceVaryingSurface(Index faceIndex, Surface<REAL> * surface,
\n-
280 FVarID fvarID) const;
\n-
281
\n-
307 template <typename REAL>
\n-
308 bool InitSurfaces(Index faceIndex, Surface<REAL> * vtxSurface,
\n-
309 Surface<REAL> * fvarSurfaces,
\n-
310 FVarID const fvarIDs[] = 0,
\n-
311 int fvarCount = 0,
\n-
312 Surface<REAL> * varSurface = 0) const;
\n-
314
\n-
316
\n-
319 //
\n-
320 // WIP - considering removing these since non-essential
\n-
321 //
\n-
322
\n-
324 template <typename REAL=float>
\n-
325 Surface<REAL> * CreateVertexSurface(Index faceIndex) const;
\n-
326
\n-
328 template <typename REAL=float>
\n-
329 Surface<REAL> * CreateVaryingSurface(Index faceIndex) const;
\n-
330
\n-
332 template <typename REAL=float>
\n-\n-
334
\n-
336 template <typename REAL=float>
\n-
337 Surface<REAL> * CreateFaceVaryingSurface(Index faceIndex, FVarID id) const;
\n-
339
\n-
340protected:
\n-
342
\n-
346
\n-\n-
359 Sdc::Options const & schemeOptions,
\n-
360 Options const & limitOptions);
\n-
361
\n-\n-
364
\n-\n-\n-
368
\n-
369private:
\n-
370 // Supporting internal methods:
\n-
371 void setSubdivisionOptions(Sdc::SchemeType, Sdc::Options const & options);
\n-
372 void setFactoryOptions(Options const & factoryOptions);
\n-
373
\n-
374 bool faceHasLimitSimple(Index faceIndex, int faceSize) const;
\n-
375
\n-
376 bool faceHasLimitNeighborhood(Index faceIndex) const;
\n-
377 bool faceHasLimitNeighborhood(FaceTopology const & faceTopology) const;
\n-
378
\n-
379 class SurfaceSet;
\n-
380
\n-
381 bool populateAllSurfaces( Index faceIndex, SurfaceSet * sSetPtr) const;
\n-
382 bool populateLinearSurfaces( Index faceIndex, SurfaceSet * sSetPtr) const;
\n-
383 bool populateNonLinearSurfaces(Index faceIndex, SurfaceSet * sSetPtr) const;
\n-
384
\n-
385 bool initSurfaces(Index faceIndex, internal::SurfaceData * vtxSurface,
\n-
386 internal::SurfaceData * varSurface,
\n-
387 internal::SurfaceData * fvarSurfaces,
\n-
388 int fvarCount,
\n-
389 FVarID const fvarIDs[]) const;
\n-
390
\n-
391 // Methods to assemble topology and corresponding indices for entire face:
\n-
392 bool isFaceNeighborhoodRegular(Index faceIndex,
\n-
393 FVarID const * fvarPtrOrVtx,
\n-
394 Index indices[]) const;
\n-
395
\n-
396 bool initFaceNeighborhoodTopology(Index faceIndex,
\n-
397 FaceTopology * topology) const;
\n-
398
\n-
399 bool gatherFaceNeighborhoodTopology(Index faceIndex,
\n-
400 FaceTopology * topology) const;
\n-
401
\n-
402 int gatherFaceNeighborhoodIndices(Index faceIndex,
\n-
403 FaceTopology const & topology,
\n-
404 FVarID const * fvarPtrOrVtx,
\n-
405 Index indices[]) const;
\n-
406
\n-
407 // Methods to assemble Surfaces for the different categories of patch:
\n-
408 typedef internal::SurfaceData SurfaceType;
\n-
409
\n-
410 void assignLinearSurface(SurfaceType * surfacePtr,
\n-
411 Index faceIndex,
\n-
412 FVarID const * fvarPtrOrVtx) const;
\n-
413
\n-
414 void assignRegularSurface(SurfaceType * surfacePtr,
\n-
415 Index const surfacePatchPoints[]) const;
\n-
416
\n-
417 void assignRegularSurface(SurfaceType * surfacePtr,
\n-
418 FaceSurface const & surfaceDescription) const;
\n-
419
\n-
420 void assignIrregularSurface(SurfaceType * surfacePtr,
\n-
421 FaceSurface const & surfaceDescription) const;
\n-
422
\n-
423 void copyNonLinearSurface(SurfaceType * surfacePtr,
\n-
424 SurfaceType const & surfaceSource,
\n-
425 FaceSurface const & surfaceDescription) const;
\n-
426
\n-
427private:
\n-
428 // Members describing options and subdivision properties (very little
\n-
429 // memory and low initialization cost)
\n-
430 Sdc::SchemeType _subdivScheme;
\n-
431 Sdc::Options _subdivOptions;
\n-
432 Options _factoryOptions;
\n-
433
\n-
434 // Members related to subdivision topology, options and limit tests:
\n-
435 unsigned int _linearScheme : 1;
\n-
436 unsigned int _linearFVarInterp : 1;
\n-
437
\n-
438 unsigned int _testNeighborhoodForLimit : 1;
\n-
439 unsigned int _rejectSmoothBoundariesForLimit : 1;
\n-
440 unsigned int _rejectIrregularFacesForLimit : 1;
\n-
441
\n-
442 int _regFaceSize;
\n-
443
\n-
444 // Members related to caching:
\n-
445 SurfaceFactoryCache mutable * _topologyCache;
\n-
446};
\n-
\n-
447
\n-
448//
\n-
449// Inline methods for Options:
\n-
450//
\n-\n-
\n-\n-
453 _dfltFVarID = id;
\n-
454 return *this;
\n-
455}
\n-
\n-\n-
\n-\n-
458 _enableCache = on;
\n-
459 return *this;
\n-
460}
\n-
\n-\n-
\n-\n-
463 _externCache = c;
\n-
464 return *this;
\n-
465}
\n-
\n-\n-
\n-\n-
468 _approxLevelSmooth = (unsigned char) level;
\n-
469 return *this;
\n-
470}
\n-
\n-\n-
\n-\n-
473 _approxLevelSharp = (unsigned char) level;
\n-
474 return *this;
\n-
475}
\n-
\n-
476
\n-
477//
\n-
478// Inline methods to initializes Surfaces:
\n-
479//
\n-
480template <typename REAL>
\n-
481inline bool
\n-
\n-\n-
483
\n-
484 return initSurfaces(face, &s->getSurfaceData(), 0, 0, 0, 0);
\n-
485}
\n-
\n-
486template <typename REAL>
\n-
487inline bool
\n-
\n-\n-
489
\n-
490 return initSurfaces(face, 0, &s->getSurfaceData(), 0, 0, 0);
\n-
491}
\n-
\n-
492template <typename REAL>
\n-
493inline bool
\n-
\n-\n-
495 FVarID fvarID) const {
\n-
496 return initSurfaces(face, 0, 0, &s->getSurfaceData(), 1, &fvarID);
\n-
497}
\n-
\n-
498template <typename REAL>
\n-
499inline bool
\n-
\n-\n-
501 FVarID dfltID = _factoryOptions.GetDefaultFVarID();
\n-
502 return initSurfaces(face, 0, 0, &s->getSurfaceData(), 1, &dfltID);
\n-
503}
\n-
\n-
504
\n-
505template <typename REAL>
\n-
506inline bool
\n-
\n-\n-
508 Surface<REAL> * fvarSurfaces, FVarID const fvarIDs[], int fvarCount,
\n-
509 Surface<REAL> * varSurface) const {
\n-
510
\n-
511 bool useDfltFVarID = fvarSurfaces && (fvarIDs == 0) && (fvarCount == 0);
\n-
512 FVarID dfltFVarID = useDfltFVarID ? _factoryOptions.GetDefaultFVarID() : 0;
\n-
513
\n-
514 return initSurfaces(faceIndex,
\n-
515 vtxSurface ? &vtxSurface->getSurfaceData() : 0,
\n-
516 varSurface ? &varSurface->getSurfaceData() : 0,
\n-
517 fvarSurfaces ? &fvarSurfaces->getSurfaceData() : 0,
\n-
518 fvarCount ? fvarCount : (fvarSurfaces != 0),
\n-
519 useDfltFVarID ? &dfltFVarID : fvarIDs);
\n-
520}
\n-
\n-
521
\n-
522//
\n-
523// Inline methods to allocate and initialize Surfaces:
\n-
524//
\n-
525template <typename REAL>
\n-
526inline Surface<REAL> *
\n-
\n-\n-
528 Surface<REAL> * s = new Surface<REAL>();
\n-
529 if (InitVertexSurface<REAL>(faceIndex, s)) return s;
\n-
530 delete s;
\n-
531 return 0;
\n-
532}
\n-
\n-
533template <typename REAL>
\n-
534inline Surface<REAL> *
\n-
\n-\n-
536 Surface<REAL> * s = new Surface<REAL>();
\n-
537 if (InitVaryingSurface<REAL>(faceIndex, s)) return s;
\n-
538 delete s;
\n-
539 return 0;
\n-
540}
\n-
\n-
541template <typename REAL>
\n-
542inline Surface<REAL> *
\n-
\n-\n-
544 Surface<REAL> * s = new Surface<REAL>();
\n-
545 if (InitFaceVaryingSurface<REAL>(faceIndex, s, fvarID)) return s;
\n-
546 delete s;
\n-
547 return 0;
\n-
548}
\n-
\n-
549template <typename REAL>
\n-
550inline Surface<REAL> *
\n-
\n-\n-
552 FVarID dfltID = _factoryOptions.GetDefaultFVarID();
\n-
553 return CreateFaceVaryingSurface<REAL>(face, dfltID);
\n-
554}
\n-
\n-
555
\n-
556} // end namespace Bfr
\n-
557
\n-
558} // end namespace OPENSUBDIV_VERSION
\n-
559using namespace OPENSUBDIV_VERSION;
\n-
560
\n-
561} // end namespace OpenSubdiv
\n-
562
\n-
563#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_H */
\n+
52//
\n+
53// Initial/expected use requires simple searches of and additions to the
\n+
54// cache by the SurfaceFactory or its Builders. Longer term, with the
\n+
55// possibility of instances of caches being shared between meshes and
\n+
56// factories, additional options and/or public methods may be warranted
\n+
57// to limit what is cached or to prune the cache if it gets too large.
\n+
58//
\n+
\n+\n+
60public:
\n+\n+\n+
63
\n+\n+\n+
66
\n+
67protected:
\n+
69 // Access restricted to the Factory, its Builders, etc.
\n+
70 friend class SurfaceFactory;
\n+
71
\n+
72 typedef std::uint64_t KeyType;
\n+
73 typedef internal::IrregularPatchSharedPtr DataType;
\n+
75
\n+
76protected:
\n+
78 size_t Size() const { return _map.size(); }
\n+
79
\n+
80 //
\n+
81 // Potential overrides by subclasses for thread-safety:
\n+
82 //
\n+
83 virtual DataType Find(KeyType const & key) const;
\n+
84 virtual DataType Add(KeyType const & key, DataType const & data);
\n+
85
\n+
86 //
\n+
87 // Common implementation used by all subclasses:
\n+
88 //
\n+
89 DataType find(KeyType const & key) const;
\n+
90 DataType add(KeyType const & key, DataType const & data);
\n+
92
\n+
93private:
\n+
94 typedef std::map<KeyType, DataType> MapType;
\n+
95
\n+
96 MapType _map;
\n+
97};
\n+
\n+
98
\n+
113// Separate read and write locks are provided to support mutex types
\n+
114// allowing shared (read) or exclusive (write) access.
\n+
115//
\n+
116template <class MUTEX_TYPE, class READ_LOCK_GUARD_TYPE,
\n+
117 class WRITE_LOCK_GUARD_TYPE>
\n+
\n+\n+
119public:
\n+\n+
121 ~SurfaceFactoryCacheThreaded() override = default;
\n+
122
\n+
123protected:
\n+
125 //
\n+
126 // Virtual overrides from base:
\n+
127 //
\n+
128 DataType Find(KeyType const & key) const override {
\n+
129 READ_LOCK_GUARD_TYPE lockGuard(_mutex);
\n+
130 return find(key);
\n+
131 }
\n+
132
\n+
133 DataType Add(KeyType const & key, DataType const & data) override {
\n+
134 WRITE_LOCK_GUARD_TYPE lockGuard(_mutex);
\n+
135 return add(key, data);
\n+
136 }
\n+
138
\n+
139private:
\n+
140 MUTEX_TYPE mutable _mutex;
\n+
141};
\n+
\n+
142
\n+
143} // end namespace Bfr
\n+
144
\n+
145} // end namespace OPENSUBDIV_VERSION
\n+
146using namespace OPENSUBDIV_VERSION;
\n+
147
\n+
148} // end namespace OpenSubdiv
\n+
149
\n+
150#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H */
\n \n-
SchemeType
Enumerated type for all subdivision schemes supported by OpenSubdiv.
Definition types.h:37
\n-
Simple class defining the 2D parameterization of a face.
\n-
Encapsulates the limit surface for a face of a mesh.
Definition surface.h:59
\n-
Base class providing initialization of a Surface for each face of a mesh.
\n-
void setInternalCache(SurfaceFactoryCache *cache)
Subclass to identify an internal cache for use by base class.
\n-\n-
bool InitFaceVaryingSurface(Index faceIndex, Surface< REAL > *surface) const
Initialize a Surface for the default face-varying data.
\n-
Sdc::Options GetSchemeOptions() const
Return the set of subdivision options.
\n-
Parameterization GetFaceParameterization(Index faceIndex) const
Return the Parameterization of a face with a limit surface.
\n-
SurfaceFactory(SurfaceFactory const &)=delete
\n-
bool FaceHasLimitSurface(Index faceIndex) const
Return if a specified face has a limit surface.
\n-
SurfaceFactory & operator=(SurfaceFactory const &)=delete
\n-
Surface< REAL > * CreateVertexSurface(Index faceIndex) const
Construct a Surface for vertex data.
\n-
Surface< REAL > * CreateFaceVaryingSurface(Index faceIndex) const
Construct a Surface for the default face-varying data.
\n-
bool InitSurfaces(Index faceIndex, Surface< REAL > *vtxSurface, Surface< REAL > *fvarSurfaces, FVarID const fvarIDs[]=0, int fvarCount=0, Surface< REAL > *varSurface=0) const
Initialize multiple Surfaces at once.
\n-
Sdc::SchemeType GetSchemeType() const
Return the subdivision scheme.
\n-
Surface< REAL > * CreateVaryingSurface(Index faceIndex) const
Construct a Surface for varying data.
\n-
bool InitVertexSurface(Index faceIndex, Surface< REAL > *surface) const
Initialize a Surface for vertex data.
\n-
bool InitVaryingSurface(Index faceIndex, Surface< REAL > *surface) const
Initialize a Surface for varying data.
\n-
SurfaceFactory(Sdc::SchemeType schemeType, Sdc::Options const &schemeOptions, Options const &limitOptions)
Constructor to be used by subclasses.
\n-
Simple set of options assigned to instances of SurfaceFactory.
\n-
Options & SetExternalCache(SurfaceFactoryCache *c)
Assign an external cache to override the internal.
\n-
Options & EnableCaching(bool on)
Enable or disable caching (default is true):
\n-
Options & SetApproxLevelSmooth(int level)
Assign maximum refinement level for smooth features.
\n-
int GetApproxLevelSmooth() const
Return maximum refinement level for smooth features.
\n-\n-
bool IsCachingEnabled() const
Return if caching is enable.
\n-
Options & SetDefaultFVarID(FVarID id)
Assign the default face-varying ID (none assigned by default)
\n-
Options & SetApproxLevelSharp(int level)
Assign maximum refinement level for sharp features.
\n-
FVarID GetDefaultFVarID() const
Return the default face-varying ID.
\n-
int GetApproxLevelSharp() const
Return maximum refinement level for sharp features.
\n-
SurfaceFactoryCache * GetExternalCache() const
Return any assigned external cache.
\n-
Container used internally by SurfaceFactory to store reusable information.
\n-
Abstract interface adapting SurfaceFactory to a connected mesh representation.
\n-\n-
std::intptr_t FVarID
Type used to identify and specify face-varying primvars.
\n-
All supported options applying to subdivision scheme.
Definition options.h:51
\n+
Base class providing initialization of a Surface for each face of a mesh.
\n+
Container used internally by SurfaceFactory to store reusable information.
\n+\n+\n+
SurfaceFactoryCache(SurfaceFactoryCache const &)=delete
\n+
SurfaceFactoryCache & operator=(SurfaceFactoryCache const &)=delete
\n+
Template for declaring thread-safe subclasses of SurfaceFactoryCache.
\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-surfaceFactory.h\n+surfaceFactoryCache.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2021 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,476 +24,131 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_H\n-26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_H\n+25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H\n+26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../bfr/surface.h\"\n-31#include \"../bfr/surfaceFactoryMeshAdapter.h\"\n-32#include \"../sdc/options.h\"\n-33#include \"../sdc/types.h\"\n+30#include \"../bfr/irregularPatchType.h\"\n+31\n+32#include \n+33#include \n 34\n-35#include \n-36\n-37namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-38namespace OPENSUBDIV_VERSION {\n+35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+36namespace OPENSUBDIV_VERSION {\n+37\n+38namespace Bfr {\n 39\n-40namespace Bfr {\n-41\n-42//\n-43// Forward declarations of public and internal classes used by factories:\n-44//\n-45class SurfaceFactoryCache;\n-46class FaceTopology;\n-47class FaceSurface;\n-48\n-_\b1_\b0_\b3class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br {\n-104public:\n-_\b1_\b1_\b6 class _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n-117 public:\n-_\b1_\b1_\b8 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _dfltFVarID(-1), _externCache(0), _enableCache(true),\n-119 _approxLevelSmooth(2), _approxLevelSharp(6) { }\n-120\n-123 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD(_\bF_\bV_\ba_\br_\bI_\bD id);\n-_\b1_\b2_\b5 _\bF_\bV_\ba_\br_\bI_\bD _\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD() const { return _dfltFVarID; }\n-126\n-128 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bE_\bn_\ba_\bb_\bl_\be_\bC_\ba_\bc_\bh_\bi_\bn_\bg(bool on);\n-_\b1_\b3_\b0 bool _\bI_\bs_\bC_\ba_\bc_\bh_\bi_\bn_\bg_\bE_\bn_\ba_\bb_\bl_\be_\bd() const { return _enableCache; }\n-131\n-133 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * c);\n-_\b1_\b3_\b5 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * _\bG_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be() const { return _externCache; }\n-136\n-137 // Set refinement levels used to approximate the limit surface\n-138 // for smooth and sharp features (reasonable defaults assigned):\n-140 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh(int level);\n-_\b1_\b4_\b2 int _\bG_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh() const { return _approxLevelSmooth; }\n-143\n-145 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp(int level);\n-_\b1_\b4_\b7 int _\bG_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp() const { return _approxLevelSharp; }\n-148\n-149 private:\n-150 // Member variables:\n-151 _\bF_\bV_\ba_\br_\bI_\bD _dfltFVarID;\n-152\n-153 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * _externCache;\n-154\n-155 unsigned char _enableCache : 1;\n-156 unsigned char _approxLevelSmooth;\n-157 unsigned char _approxLevelSharp;\n-158 };\n-159\n-160public:\n-_\b1_\b6_\b1 _\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by() override;\n-162\n-164\n-168\n-_\b1_\b7_\b0 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be _\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be() const { return _subdivScheme; }\n-171\n-_\b1_\b7_\b3 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs() const { return _subdivOptions; }\n-175\n-176public:\n-178\n-190\n-_\b2_\b0_\b0 bool _\bF_\ba_\bc_\be_\bH_\ba_\bs_\bL_\bi_\bm_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n-201\n-_\b2_\b0_\b8 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn _\bG_\be_\bt_\bF_\ba_\bc_\be_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n-210\n-211public:\n-213\n-233\n-241 template \n-242 bool _\bI_\bn_\bi_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * surface) const;\n-243\n-251 template \n-252 bool _\bI_\bn_\bi_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * surface) const;\n-253\n-266 template \n-267 bool _\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * surface)\n-const;\n-268\n-278 template \n-279 bool _\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * surface,\n-280 _\bF_\bV_\ba_\br_\bI_\bD fvarID) const;\n-281\n-307 template \n-308 bool _\bI_\bn_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * vtxSurface,\n-309 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * fvarSurfaces,\n-310 _\bF_\bV_\ba_\br_\bI_\bD const fvarIDs[] = 0,\n-311 int fvarCount = 0,\n-312 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * varSurface = 0) const;\n-314\n-316\n-319 //\n-320 // WIP - considering removing these since non-essential\n-321 //\n-322\n-324 template \n-325 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * _\bC_\br_\be_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n-326\n-328 template \n-329 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * _\bC_\br_\be_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n-330\n-332 template \n-333 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * _\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n-334\n-336 template \n-337 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * _\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bF_\bV_\ba_\br_\bI_\bD id) const;\n-339\n-340protected:\n-342\n-346\n-_\b3_\b5_\b8 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by(_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be schemeType,\n-359 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs const & schemeOptions,\n-360 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & limitOptions);\n-361\n-_\b3_\b6_\b3 void _\bs_\be_\bt_\bI_\bn_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * cache);\n-364\n-_\b3_\b6_\b5 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by const &) = delete;\n-_\b3_\b6_\b6 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by const &) = delete;\n-368\n-369private:\n-370 // Supporting internal methods:\n-371 void setSubdivisionOptions(_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be, _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options);\n-372 void setFactoryOptions(_\bO_\bp_\bt_\bi_\bo_\bn_\bs const & factoryOptions);\n-373\n-374 bool faceHasLimitSimple(_\bI_\bn_\bd_\be_\bx faceIndex, int faceSize) const;\n-375\n-376 bool faceHasLimitNeighborhood(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n-377 bool faceHasLimitNeighborhood(FaceTopology const & faceTopology) const;\n-378\n-379 class SurfaceSet;\n-380\n-381 bool populateAllSurfaces( _\bI_\bn_\bd_\be_\bx faceIndex, SurfaceSet * sSetPtr) const;\n-382 bool populateLinearSurfaces( _\bI_\bn_\bd_\be_\bx faceIndex, SurfaceSet * sSetPtr) const;\n-383 bool populateNonLinearSurfaces(_\bI_\bn_\bd_\be_\bx faceIndex, SurfaceSet * sSetPtr)\n-const;\n-384\n-385 bool initSurfaces(_\bI_\bn_\bd_\be_\bx faceIndex, internal::SurfaceData * vtxSurface,\n-386 internal::SurfaceData * varSurface,\n-387 internal::SurfaceData * fvarSurfaces,\n-388 int fvarCount,\n-389 _\bF_\bV_\ba_\br_\bI_\bD const fvarIDs[]) const;\n-390\n-391 // Methods to assemble topology and corresponding indices for entire face:\n-392 bool isFaceNeighborhoodRegular(_\bI_\bn_\bd_\be_\bx faceIndex,\n-393 _\bF_\bV_\ba_\br_\bI_\bD const * fvarPtrOrVtx,\n-394 _\bI_\bn_\bd_\be_\bx indices[]) const;\n-395\n-396 bool initFaceNeighborhoodTopology(_\bI_\bn_\bd_\be_\bx faceIndex,\n-397 FaceTopology * topology) const;\n-398\n-399 bool gatherFaceNeighborhoodTopology(_\bI_\bn_\bd_\be_\bx faceIndex,\n-400 FaceTopology * topology) const;\n-401\n-402 int gatherFaceNeighborhoodIndices(_\bI_\bn_\bd_\be_\bx faceIndex,\n-403 FaceTopology const & topology,\n-404 _\bF_\bV_\ba_\br_\bI_\bD const * fvarPtrOrVtx,\n-405 _\bI_\bn_\bd_\be_\bx indices[]) const;\n-406\n-407 // Methods to assemble Surfaces for the different categories of patch:\n-408 typedef internal::SurfaceData SurfaceType;\n-409\n-410 void assignLinearSurface(SurfaceType * surfacePtr,\n-411 _\bI_\bn_\bd_\be_\bx faceIndex,\n-412 _\bF_\bV_\ba_\br_\bI_\bD const * fvarPtrOrVtx) const;\n-413\n-414 void assignRegularSurface(SurfaceType * surfacePtr,\n-415 _\bI_\bn_\bd_\be_\bx const surfacePatchPoints[]) const;\n-416\n-417 void assignRegularSurface(SurfaceType * surfacePtr,\n-418 FaceSurface const & surfaceDescription) const;\n-419\n-420 void assignIrregularSurface(SurfaceType * surfacePtr,\n-421 FaceSurface const & surfaceDescription) const;\n-422\n-423 void copyNonLinearSurface(SurfaceType * surfacePtr,\n-424 SurfaceType const & surfaceSource,\n-425 FaceSurface const & surfaceDescription) const;\n-426\n-427private:\n-428 // Members describing options and subdivision properties (very little\n-429 // memory and low initialization cost)\n-430 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be _subdivScheme;\n-431 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs _subdivOptions;\n-432 _\bO_\bp_\bt_\bi_\bo_\bn_\bs _factoryOptions;\n-433\n-434 // Members related to subdivision topology, options and limit tests:\n-435 unsigned int _linearScheme : 1;\n-436 unsigned int _linearFVarInterp : 1;\n-437\n-438 unsigned int _testNeighborhoodForLimit : 1;\n-439 unsigned int _rejectSmoothBoundariesForLimit : 1;\n-440 unsigned int _rejectIrregularFacesForLimit : 1;\n-441\n-442 int _regFaceSize;\n-443\n-444 // Members related to caching:\n-445 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be mutable * _topologyCache;\n-446};\n-447\n-448//\n-449// Inline methods for Options:\n-450//\n-451inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n-_\b4_\b5_\b2_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD(_\bF_\bV_\ba_\br_\bI_\bD id) {\n-453 _dfltFVarID = id;\n-454 return *this;\n-455}\n-456inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n-_\b4_\b5_\b7_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bn_\ba_\bb_\bl_\be_\bC_\ba_\bc_\bh_\bi_\bn_\bg(bool on) {\n-458 _enableCache = on;\n-459 return *this;\n-460}\n-461inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n-_\b4_\b6_\b2_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * c) {\n-463 _externCache = c;\n-464 return *this;\n-465}\n-466inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n-_\b4_\b6_\b7_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh(int level) {\n-468 _approxLevelSmooth = (unsigned char) level;\n-469 return *this;\n-470}\n-471inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n-_\b4_\b7_\b2_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp(int level) {\n-473 _approxLevelSharp = (unsigned char) level;\n-474 return *this;\n-475}\n-476\n-477//\n-478// Inline methods to initializes Surfaces:\n-479//\n-480template \n-481inline bool\n-_\b4_\b8_\b2_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s) const {\n-483\n-484 return initSurfaces(face, &s->getSurfaceData(), 0, 0, 0, 0);\n-485}\n-486template \n-487inline bool\n-_\b4_\b8_\b8_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s) const {\n-489\n-490 return initSurfaces(face, 0, &s->getSurfaceData(), 0, 0, 0);\n-491}\n-492template \n-493inline bool\n-_\b4_\b9_\b4_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s,\n-495 _\bF_\bV_\ba_\br_\bI_\bD fvarID) const {\n-496 return initSurfaces(face, 0, 0, &s->getSurfaceData(), 1, &fvarID);\n-497}\n-498template \n-499inline bool\n-_\b5_\b0_\b0_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s) const\n-{\n-501 _\bF_\bV_\ba_\br_\bI_\bD dfltID = _factoryOptions._\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD();\n-502 return initSurfaces(face, 0, 0, &s->getSurfaceData(), 1, &dfltID);\n-503}\n-504\n-505template \n-506inline bool\n-_\b5_\b0_\b7_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * vtxSurface,\n-508 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * fvarSurfaces, _\bF_\bV_\ba_\br_\bI_\bD const fvarIDs[], int fvarCount,\n-509 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * varSurface) const {\n-510\n-511 bool useDfltFVarID = fvarSurfaces && (fvarIDs == 0) && (fvarCount == 0);\n-512 _\bF_\bV_\ba_\br_\bI_\bD dfltFVarID = useDfltFVarID ? _factoryOptions._\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD() : 0;\n-513\n-514 return initSurfaces(faceIndex,\n-515 vtxSurface ? &vtxSurface->getSurfaceData() : 0,\n-516 varSurface ? &varSurface->getSurfaceData() : 0,\n-517 fvarSurfaces ? &fvarSurfaces->getSurfaceData() : 0,\n-518 fvarCount ? fvarCount : (fvarSurfaces != 0),\n-519 useDfltFVarID ? &dfltFVarID : fvarIDs);\n-520}\n-521\n-522//\n-523// Inline methods to allocate and initialize Surfaces:\n-524//\n-525template \n-526inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> *\n-_\b5_\b2_\b7_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const {\n-528 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s = new _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b>();\n-529 if (InitVertexSurface(faceIndex, s)) return s;\n-530 delete s;\n-531 return 0;\n-532}\n-533template \n-534inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> *\n-_\b5_\b3_\b5_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const {\n-536 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s = new _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b>();\n-537 if (InitVaryingSurface(faceIndex, s)) return s;\n-538 delete s;\n-539 return 0;\n-540}\n-541template \n-542inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> *\n-_\b5_\b4_\b3_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bF_\bV_\ba_\br_\bI_\bD fvarID)\n-const {\n-544 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s = new _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b>();\n-545 if (InitFaceVaryingSurface(faceIndex, s, fvarID)) return s;\n-546 delete s;\n-547 return 0;\n-548}\n-549template \n-550inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> *\n-_\b5_\b5_\b1_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face) const {\n-552 _\bF_\bV_\ba_\br_\bI_\bD dfltID = _factoryOptions._\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD();\n-553 return CreateFaceVaryingSurface(face, dfltID);\n-554}\n-555\n-556} // end namespace Bfr\n-557\n-558} // end namespace OPENSUBDIV_VERSION\n-559using namespace OPENSUBDIV_VERSION;\n-560\n-561} // end namespace OpenSubdiv\n-562\n-563#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_H */\n+52//\n+53// Initial/expected use requires simple searches of and additions to the\n+54// cache by the SurfaceFactory or its Builders. Longer term, with the\n+55// possibility of instances of caches being shared between meshes and\n+56// factories, additional options and/or public methods may be warranted\n+57// to limit what is cached or to prune the cache if it gets too large.\n+58//\n+_\b5_\b9class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be {\n+60public:\n+_\b6_\b1 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be();\n+_\b6_\b2 virtual _\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be();\n+63\n+_\b6_\b4 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be const &) = delete;\n+_\b6_\b5 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be const &) = delete;\n+66\n+67protected:\n+69 // Access restricted to the Factory, its Builders, etc.\n+70 friend class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n+71\n+72 typedef std::uint64_t KeyType;\n+73 typedef internal::IrregularPatchSharedPtr DataType;\n+75\n+76protected:\n+78 size_t Size() const { return _map.size(); }\n+79\n+80 //\n+81 // Potential overrides by subclasses for thread-safety:\n+82 //\n+83 virtual DataType Find(KeyType const & key) const;\n+84 virtual DataType Add(KeyType const & key, DataType const & data);\n+85\n+86 //\n+87 // Common implementation used by all subclasses:\n+88 //\n+89 DataType find(KeyType const & key) const;\n+90 DataType add(KeyType const & key, DataType const & data);\n+92\n+93private:\n+94 typedef std::map MapType;\n+95\n+96 MapType _map;\n+97};\n+98\n+113// Separate read and write locks are provided to support mutex types\n+114// allowing shared (read) or exclusive (write) access.\n+115//\n+116template \n+_\b1_\b1_\b8class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd : public _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be {\n+119public:\n+_\b1_\b2_\b0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd() : _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be() { }\n+_\b1_\b2_\b1 _\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd() override = default;\n+122\n+123protected:\n+125 //\n+126 // Virtual overrides from base:\n+127 //\n+128 DataType Find(KeyType const & key) const override {\n+129 READ_LOCK_GUARD_TYPE lockGuard(_mutex);\n+130 return find(key);\n+131 }\n+132\n+133 DataType Add(KeyType const & key, DataType const & data) override {\n+134 WRITE_LOCK_GUARD_TYPE lockGuard(_mutex);\n+135 return add(key, data);\n+136 }\n+138\n+139private:\n+140 MUTEX_TYPE mutable _mutex;\n+141};\n+142\n+143} // end namespace Bfr\n+144\n+145} // end namespace OPENSUBDIV_VERSION\n+146using namespace OPENSUBDIV_VERSION;\n+147\n+148} // end namespace OpenSubdiv\n+149\n+150#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n-SchemeType\n-Enumerated type for all subdivision schemes supported by OpenSubdiv.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-Simple class defining the 2D parameterization of a face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be\n-Encapsulates the limit surface for a face of a mesh.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\b._\bh_\b:_\b5_\b9\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n Base class providing initialization of a Surface for each face of a mesh.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bI_\bn_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be\n-void setInternalCache(SurfaceFactoryCache *cache)\n-Subclass to identify an internal cache for use by base class.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-~SurfaceFactory() override\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be\n-bool InitFaceVaryingSurface(Index faceIndex, Surface< REAL > *surface) const\n-Initialize a Surface for the default face-varying data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Sdc::Options GetSchemeOptions() const\n-Return the set of subdivision options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-Parameterization GetFaceParameterization(Index faceIndex) const\n-Return the Parameterization of a face with a limit surface.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-SurfaceFactory(SurfaceFactory const &)=delete\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bF_\ba_\bc_\be_\bH_\ba_\bs_\bL_\bi_\bm_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be\n-bool FaceHasLimitSurface(Index faceIndex) const\n-Return if a specified face has a limit surface.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-SurfaceFactory & operator=(SurfaceFactory const &)=delete\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be\n-Surface< REAL > * CreateVertexSurface(Index faceIndex) const\n-Construct a Surface for vertex data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b2_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be\n-Surface< REAL > * CreateFaceVaryingSurface(Index faceIndex) const\n-Construct a Surface for the default face-varying data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be_\bs\n-bool InitSurfaces(Index faceIndex, Surface< REAL > *vtxSurface, Surface< REAL >\n-*fvarSurfaces, FVarID const fvarIDs[]=0, int fvarCount=0, Surface< REAL >\n-*varSurface=0) const\n-Initialize multiple Surfaces at once.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b0_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n-Sdc::SchemeType GetSchemeType() const\n-Return the subdivision scheme.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b7_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be\n-Surface< REAL > * CreateVaryingSurface(Index faceIndex) const\n-Construct a Surface for varying data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b3_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be\n-bool InitVertexSurface(Index faceIndex, Surface< REAL > *surface) const\n-Initialize a Surface for vertex data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be\n-bool InitVaryingSurface(Index faceIndex, Surface< REAL > *surface) const\n-Initialize a Surface for varying data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-SurfaceFactory(Sdc::SchemeType schemeType, Sdc::Options const &schemeOptions,\n-Options const &limitOptions)\n-Constructor to be used by subclasses.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Simple set of options assigned to instances of SurfaceFactory.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be\n-Options & SetExternalCache(SurfaceFactoryCache *c)\n-Assign an external cache to override the internal.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bn_\ba_\bb_\bl_\be_\bC_\ba_\bc_\bh_\bi_\bn_\bg\n-Options & EnableCaching(bool on)\n-Enable or disable caching (default is true):\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh\n-Options & SetApproxLevelSmooth(int level)\n-Assign maximum refinement level for smooth features.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bG_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh\n-int GetApproxLevelSmooth() const\n-Return maximum refinement level for smooth features.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Options()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bI_\bs_\bC_\ba_\bc_\bh_\bi_\bn_\bg_\bE_\bn_\ba_\bb_\bl_\be_\bd\n-bool IsCachingEnabled() const\n-Return if caching is enable.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD\n-Options & SetDefaultFVarID(FVarID id)\n-Assign the default face-varying ID (none assigned by default)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp\n-Options & SetApproxLevelSharp(int level)\n-Assign maximum refinement level for sharp features.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD\n-FVarID GetDefaultFVarID() const\n-Return the default face-varying ID.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bG_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp\n-int GetApproxLevelSharp() const\n-Return maximum refinement level for sharp features.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be\n-SurfaceFactoryCache * GetExternalCache() const\n-Return any assigned external cache.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b5\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n Container used internally by SurfaceFactory to store reusable information.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br\n-Abstract interface adapting SurfaceFactory to a connected mesh representation.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-int Index\n-Integer type representing a mesh index.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bF_\bV_\ba_\br_\bI_\bD\n-std::intptr_t FVarID\n-Type used to identify and specify face-varying primvars.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-All supported options applying to subdivision scheme.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n+SurfaceFactoryCache()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b:_\b:_\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n+virtual ~SurfaceFactoryCache()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n+SurfaceFactoryCache(SurfaceFactoryCache const &)=delete\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n+SurfaceFactoryCache & operator=(SurfaceFactoryCache const &)=delete\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd\n+Template for declaring thread-safe subclasses of SurfaceFactoryCache.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh_\b:_\b1_\b1_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd_\b:_\b:\n+_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd\n+SurfaceFactoryCacheThreaded()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh_\b:_\b1_\b2_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd_\b:_\b:\n+_\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd\n+~SurfaceFactoryCacheThreaded() override=default\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00683.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00683.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/surfaceFactoryCache.h File Reference\n+OpenSubdiv: opensubdiv/bfr/surfaceFactoryMeshAdapter.h File Reference\n \n \n \n \n \n \n \n@@ -90,31 +90,26 @@\n \n \n \n
\n \n-
surfaceFactoryCache.h File Reference
\n+
surfaceFactoryMeshAdapter.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../bfr/irregularPatchType.h"
\n-#include <map>
\n #include <cstdint>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n-\n-\n-\n+\n+\n \n

\n Classes

class  SurfaceFactoryCache
 Container used internally by SurfaceFactory to store reusable information. More...
 
class  SurfaceFactoryCacheThreaded< MUTEX_TYPE, READ_LOCK_GUARD_TYPE, WRITE_LOCK_GUARD_TYPE >
 Template for declaring thread-safe subclasses of SurfaceFactoryCache. More...
class  SurfaceFactoryMeshAdapter
 Abstract interface adapting SurfaceFactory to a connected mesh representation. More...
 
\n \n \n \n \n@@ -123,13 +118,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,32 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-surfaceFactoryCache.h File Reference\n+surfaceFactoryMeshAdapter.h File Reference\n #include \"../version.h\"\n-#include \"../bfr/irregularPatchType.h\"\n-#include \n #include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n-\u00a0 Container used internally by _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by to store reusable\n- information. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd_\b<_\b _\bM_\bU_\bT_\bE_\bX_\b__\bT_\bY_\bP_\bE_\b,_\b _\bR_\bE_\bA_\bD_\b__\bL_\bO_\bC_\bK_\b__\bG_\bU_\bA_\bR_\bD_\b__\bT_\bY_\bP_\bE_\b,\n- _\bW_\bR_\bI_\bT_\bE_\b__\bL_\bO_\bC_\bK_\b__\bG_\bU_\bA_\bR_\bD_\b__\bT_\bY_\bP_\bE_\b _\b>\n-\u00a0 Template for declaring thread-safe subclasses of _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br\n+\u00a0 Abstract interface adapting _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by to a connected mesh\n+ representation. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh\n+ * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00683.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00683.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,3 @@\n var a00683 = [\n- [\"SurfaceFactoryCache\", \"a00949.html\", \"a00949\"],\n- [\"SurfaceFactoryCacheThreaded< MUTEX_TYPE, READ_LOCK_GUARD_TYPE, WRITE_LOCK_GUARD_TYPE >\", \"a00953.html\", \"a00953\"]\n+ [\"SurfaceFactoryMeshAdapter\", \"a00957.html\", \"a00957\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00683_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00683_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/surfaceFactoryCache.h Source File\n+OpenSubdiv: opensubdiv/bfr/surfaceFactoryMeshAdapter.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
surfaceFactoryCache.h
\n+
surfaceFactoryMeshAdapter.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2021 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,126 +119,149 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H
\n-
26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H
\n+
25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H
\n+
26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../bfr/irregularPatchType.h"
\n+
30#include <cstdint>
\n
31
\n-
32#include <map>
\n-
33#include <cstdint>
\n+
32namespace OpenSubdiv {
\n+
33namespace OPENSUBDIV_VERSION {
\n
34
\n-
35namespace OpenSubdiv {
\n-
36namespace OPENSUBDIV_VERSION {
\n-
37
\n-
38namespace Bfr {
\n-
39
\n-
52//
\n-
53// Initial/expected use requires simple searches of and additions to the
\n-
54// cache by the SurfaceFactory or its Builders. Longer term, with the
\n-
55// possibility of instances of caches being shared between meshes and
\n-
56// factories, additional options and/or public methods may be warranted
\n-
57// to limit what is cached or to prune the cache if it gets too large.
\n-
58//
\n-
\n-\n-
60public:
\n-\n-\n-
63
\n-\n-\n-
66
\n-
67protected:
\n-
69 // Access restricted to the Factory, its Builders, etc.
\n-
70 friend class SurfaceFactory;
\n-
71
\n-
72 typedef std::uint64_t KeyType;
\n-
73 typedef internal::IrregularPatchSharedPtr DataType;
\n-
75
\n-
76protected:
\n-
78 size_t Size() const { return _map.size(); }
\n-
79
\n-
80 //
\n-
81 // Potential overrides by subclasses for thread-safety:
\n-
82 //
\n-
83 virtual DataType Find(KeyType const & key) const;
\n-
84 virtual DataType Add(KeyType const & key, DataType const & data);
\n-
85
\n-
86 //
\n-
87 // Common implementation used by all subclasses:
\n-
88 //
\n-
89 DataType find(KeyType const & key) const;
\n-
90 DataType add(KeyType const & key, DataType const & data);
\n-
92
\n-
93private:
\n-
94 typedef std::map<KeyType, DataType> MapType;
\n-
95
\n-
96 MapType _map;
\n-
97};
\n-
\n-
98
\n-
113// Separate read and write locks are provided to support mutex types
\n-
114// allowing shared (read) or exclusive (write) access.
\n-
115//
\n-
116template <class MUTEX_TYPE, class READ_LOCK_GUARD_TYPE,
\n-
117 class WRITE_LOCK_GUARD_TYPE>
\n-
\n-\n-
119public:
\n-\n-
121 ~SurfaceFactoryCacheThreaded() override = default;
\n-
122
\n-
123protected:
\n-
125 //
\n-
126 // Virtual overrides from base:
\n-
127 //
\n-
128 DataType Find(KeyType const & key) const override {
\n-
129 READ_LOCK_GUARD_TYPE lockGuard(_mutex);
\n-
130 return find(key);
\n-
131 }
\n-
132
\n-
133 DataType Add(KeyType const & key, DataType const & data) override {
\n-
134 WRITE_LOCK_GUARD_TYPE lockGuard(_mutex);
\n-
135 return add(key, data);
\n-
136 }
\n-
138
\n-
139private:
\n-
140 MUTEX_TYPE mutable _mutex;
\n-
141};
\n-
\n-
142
\n-
143} // end namespace Bfr
\n-
144
\n-
145} // end namespace OPENSUBDIV_VERSION
\n-
146using namespace OPENSUBDIV_VERSION;
\n-
147
\n-
148} // end namespace OpenSubdiv
\n-
149
\n-
150#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H */
\n+
35namespace Bfr {
\n+
36
\n+
37class VertexDescriptor;
\n+
38
\n+
43// SurfaceFactoryMeshAdapter is an abstract class that defines the interface
\n+
44// through which subclasses of SurfaceFactory adapt to a connected mesh
\n+
45// representation. The interface defines methods that describe the mesh
\n+
46// topology and control indices in the neighborhood of a mesh -- from
\n+
47// which the SurfaceFactory to identifies an appropriate limit surface.
\n+
48//
\n+
49// SurfaceFactoryMeshAdapter methods require a subclass to provide a complete
\n+
50// description of the topology around a base face, as well as indices
\n+
51// associated with it (both vertex and face-varying). The intent here is
\n+
52// to keep the number of methods required to a minimum, and also to minimize
\n+
53// the number of invocations required by the factory.
\n+
54//
\n+
55// With the need to support both linear and non-linear cases (for which
\n+
56// linear is trivial by comparison) and the limit surface for both vertex
\n+
57// and face-varying topologies, the result is a small set of methods
\n+
58// covering this matrix of functionality.
\n+
59//
\n+
60// Since face-varying data may differ in topology from the vertex data --
\n+
61// with each set of face-varying data potentially having its own unique
\n+
62// topology -- sets of face-varying data are uniquely distinguished by an
\n+
63// associated integer (a face-varying ID).
\n+
64//
\n+
\n+\n+
66public:
\n+
68 typedef int Index;
\n+
69
\n+
80 typedef std::intptr_t FVarID;
\n+
81
\n+
82protected:
\n+\n+
85 virtual ~SurfaceFactoryMeshAdapter() { }
\n+
87
\n+
88protected:
\n+
90
\n+
94
\n+
96 virtual bool isFaceHole(Index faceIndex) const = 0;
\n+
97
\n+
99 virtual int getFaceSize(Index faceIndex) const = 0;
\n+
101
\n+
103
\n+
111
\n+
113 virtual int getFaceVertexIndices(Index faceIndex,
\n+
114 Index vertexIndices[]) const = 0;
\n+
115
\n+
117 virtual int getFaceFVarValueIndices(Index faceIndex,
\n+
118 FVarID fvarID, Index fvarValueIndices[]) const = 0;
\n+
120
\n+
121protected:
\n+
123
\n+
159
\n+\n+
162 Index faceIndex, int faceVertex,
\n+
163 VertexDescriptor * vertexDescriptor) const = 0;
\n+
164
\n+\n+
167 Index faceIndex, int faceVertex,
\n+
168 Index vertexIndices[]) const = 0;
\n+
169
\n+\n+
173 Index faceIndex, int faceVertex,
\n+
174 FVarID fvarID, Index fvarValueIndices[]) const = 0;
\n+
176
\n+
177protected:
\n+
179
\n+\n+
204 Index faceIndex, Index vertexIndices[]) const;
\n+
205
\n+\n+
207 Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const;
\n+
209
\n+
210private:
\n+
211 // No private members
\n+
212};
\n+
\n+
213
\n+
214//
\n+
215// Inline defaults for optional methods:
\n+
216//
\n+
217inline bool
\n+
\n+\n+
219 Index, Index[]) const {
\n+
220 return false;
\n+
221}
\n+
\n+
222
\n+
223inline bool
\n+\n+
228
\n+
229} // end namespace Bfr
\n+
230
\n+
231} // end namespace OPENSUBDIV_VERSION
\n+
232using namespace OPENSUBDIV_VERSION;
\n+
233
\n+
234} // end namespace OpenSubdiv
\n+
235
\n+
236#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H */
\n \n-
Base class providing initialization of a Surface for each face of a mesh.
\n-
Container used internally by SurfaceFactory to store reusable information.
\n-\n-\n-
SurfaceFactoryCache(SurfaceFactoryCache const &)=delete
\n-
SurfaceFactoryCache & operator=(SurfaceFactoryCache const &)=delete
\n-
Template for declaring thread-safe subclasses of SurfaceFactoryCache.
\n-\n-\n+
Abstract interface adapting SurfaceFactory to a connected mesh representation.
\n+
virtual int getFaceVertexIncidentFaceFVarValueIndices(Index faceIndex, int faceVertex, FVarID fvarID, Index fvarValueIndices[]) const =0
Gather face-varying indices of incident faces around a face-vertex.
\n+
virtual int getFaceVertexIncidentFaceVertexIndices(Index faceIndex, int faceVertex, Index vertexIndices[]) const =0
Gather vertex indices of incident faces around a face-vertex.
\n+
virtual int getFaceSize(Index faceIndex) const =0
Returns the size of a face (number of vertices)
\n+\n+
virtual int populateFaceVertexDescriptor(Index faceIndex, int faceVertex, VertexDescriptor *vertexDescriptor) const =0
Describe the topology of incident faces around a face-vertex.
\n+
virtual bool getFaceNeighborhoodVertexIndicesIfRegular(Index faceIndex, Index vertexIndices[]) const
\n+
virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const
\n+
virtual int getFaceFVarValueIndices(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const =0
Gather the face-varying indices of the face's vertices.
\n+
virtual int getFaceVertexIndices(Index faceIndex, Index vertexIndices[]) const =0
Gather the indices of the face's vertices.
\n+
virtual bool isFaceHole(Index faceIndex) const =0
Returns if a face is a hole.
\n+
std::intptr_t FVarID
Type used to identify and specify face-varying primvars.
\n+
Simple class used by subclasses of SurfaceFactory to describe a vertex.
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-surfaceFactoryCache.h\n+surfaceFactoryMeshAdapter.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2021 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,131 +24,179 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H\n-26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H\n+25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H\n+26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../bfr/irregularPatchType.h\"\n+30#include \n 31\n-32#include \n-33#include \n+32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+33namespace OPENSUBDIV_VERSION {\n 34\n-35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-36namespace OPENSUBDIV_VERSION {\n-37\n-38namespace Bfr {\n-39\n-52//\n-53// Initial/expected use requires simple searches of and additions to the\n-54// cache by the SurfaceFactory or its Builders. Longer term, with the\n-55// possibility of instances of caches being shared between meshes and\n-56// factories, additional options and/or public methods may be warranted\n-57// to limit what is cached or to prune the cache if it gets too large.\n-58//\n-_\b5_\b9class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be {\n-60public:\n-_\b6_\b1 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be();\n-_\b6_\b2 virtual _\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be();\n-63\n-_\b6_\b4 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be const &) = delete;\n-_\b6_\b5 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be const &) = delete;\n-66\n-67protected:\n-69 // Access restricted to the Factory, its Builders, etc.\n-70 friend class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n-71\n-72 typedef std::uint64_t KeyType;\n-73 typedef internal::IrregularPatchSharedPtr DataType;\n-75\n-76protected:\n-78 size_t Size() const { return _map.size(); }\n-79\n-80 //\n-81 // Potential overrides by subclasses for thread-safety:\n-82 //\n-83 virtual DataType Find(KeyType const & key) const;\n-84 virtual DataType Add(KeyType const & key, DataType const & data);\n-85\n-86 //\n-87 // Common implementation used by all subclasses:\n-88 //\n-89 DataType find(KeyType const & key) const;\n-90 DataType add(KeyType const & key, DataType const & data);\n-92\n-93private:\n-94 typedef std::map MapType;\n-95\n-96 MapType _map;\n-97};\n-98\n-113// Separate read and write locks are provided to support mutex types\n-114// allowing shared (read) or exclusive (write) access.\n-115//\n-116template \n-_\b1_\b1_\b8class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd : public _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be {\n-119public:\n-_\b1_\b2_\b0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd() : _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be() { }\n-_\b1_\b2_\b1 _\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd() override = default;\n-122\n-123protected:\n-125 //\n-126 // Virtual overrides from base:\n-127 //\n-128 DataType Find(KeyType const & key) const override {\n-129 READ_LOCK_GUARD_TYPE lockGuard(_mutex);\n-130 return find(key);\n-131 }\n-132\n-133 DataType Add(KeyType const & key, DataType const & data) override {\n-134 WRITE_LOCK_GUARD_TYPE lockGuard(_mutex);\n-135 return add(key, data);\n-136 }\n-138\n-139private:\n-140 MUTEX_TYPE mutable _mutex;\n-141};\n-142\n-143} // end namespace Bfr\n-144\n-145} // end namespace OPENSUBDIV_VERSION\n-146using namespace OPENSUBDIV_VERSION;\n-147\n-148} // end namespace OpenSubdiv\n-149\n-150#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_CACHE_H */\n+35namespace Bfr {\n+36\n+37class VertexDescriptor;\n+38\n+43// SurfaceFactoryMeshAdapter is an abstract class that defines the interface\n+44// through which subclasses of SurfaceFactory adapt to a connected mesh\n+45// representation. The interface defines methods that describe the mesh\n+46// topology and control indices in the neighborhood of a mesh -- from\n+47// which the SurfaceFactory to identifies an appropriate limit surface.\n+48//\n+49// SurfaceFactoryMeshAdapter methods require a subclass to provide a complete\n+50// description of the topology around a base face, as well as indices\n+51// associated with it (both vertex and face-varying). The intent here is\n+52// to keep the number of methods required to a minimum, and also to minimize\n+53// the number of invocations required by the factory.\n+54//\n+55// With the need to support both linear and non-linear cases (for which\n+56// linear is trivial by comparison) and the limit surface for both vertex\n+57// and face-varying topologies, the result is a small set of methods\n+58// covering this matrix of functionality.\n+59//\n+60// Since face-varying data may differ in topology from the vertex data --\n+61// with each set of face-varying data potentially having its own unique\n+62// topology -- sets of face-varying data are uniquely distinguished by an\n+63// associated integer (a face-varying ID).\n+64//\n+_\b6_\b5class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br {\n+66public:\n+_\b6_\b8 typedef int _\bI_\bn_\bd_\be_\bx;\n+69\n+_\b8_\b0 typedef std::intptr_t _\bF_\bV_\ba_\br_\bI_\bD;\n+81\n+82protected:\n+84 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br() { }\n+85 virtual _\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br() { }\n+87\n+88protected:\n+90\n+94\n+_\b9_\b6 virtual bool _\bi_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const = 0;\n+97\n+_\b9_\b9 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const = 0;\n+101\n+103\n+111\n+_\b1_\b1_\b3 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex,\n+114 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const = 0;\n+115\n+_\b1_\b1_\b7 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex,\n+118 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const = 0;\n+120\n+121protected:\n+123\n+159\n+_\b1_\b6_\b1 virtual int _\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(\n+162 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n+163 _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br * vertexDescriptor) const = 0;\n+164\n+_\b1_\b6_\b6 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(\n+167 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n+168 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const = 0;\n+169\n+_\b1_\b7_\b2 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(\n+173 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n+174 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const = 0;\n+176\n+177protected:\n+179\n+203 virtual bool _\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n+204 _\bI_\bn_\bd_\be_\bx faceIndex, _\bI_\bn_\bd_\be_\bx vertexIndices[]) const;\n+205\n+206 virtual bool _\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n+207 _\bI_\bn_\bd_\be_\bx faceIndex, _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const;\n+209\n+210private:\n+211 // No private members\n+212};\n+213\n+214//\n+215// Inline defaults for optional methods:\n+216//\n+217inline bool\n+_\b2_\b1_\b8_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n+219 _\bI_\bn_\bd_\be_\bx, _\bI_\bn_\bd_\be_\bx[]) const {\n+220 return false;\n+221}\n+222\n+223inline bool\n+_\b2_\b2_\b4_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n+225 _\bI_\bn_\bd_\be_\bx, _\bF_\bV_\ba_\br_\bI_\bD, _\bI_\bn_\bd_\be_\bx[]) const {\n+226 return false;\n+227}\n+228\n+229} // end namespace Bfr\n+230\n+231} // end namespace OPENSUBDIV_VERSION\n+232using namespace OPENSUBDIV_VERSION;\n+233\n+234} // end namespace OpenSubdiv\n+235\n+236#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Base class providing initialization of a Surface for each face of a mesh.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n-Container used internally by SurfaceFactory to store reusable information.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n-SurfaceFactoryCache()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b:_\b:_\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n-virtual ~SurfaceFactoryCache()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n-SurfaceFactoryCache(SurfaceFactoryCache const &)=delete\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-SurfaceFactoryCache & operator=(SurfaceFactoryCache const &)=delete\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd\n-Template for declaring thread-safe subclasses of SurfaceFactoryCache.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh_\b:_\b1_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd_\b:_\b:\n-_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd\n-SurfaceFactoryCacheThreaded()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh_\b:_\b1_\b2_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd_\b:_\b:\n-_\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\bT_\bh_\br_\be_\ba_\bd_\be_\bd\n-~SurfaceFactoryCacheThreaded() override=default\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br\n+Abstract interface adapting SurfaceFactory to a connected mesh representation.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+virtual int getFaceVertexIncidentFaceFVarValueIndices(Index faceIndex, int\n+faceVertex, FVarID fvarID, Index fvarValueIndices[]) const =0\n+Gather face-varying indices of incident faces around a face-vertex.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+virtual int getFaceVertexIncidentFaceVertexIndices(Index faceIndex, int\n+faceVertex, Index vertexIndices[]) const =0\n+Gather vertex indices of incident faces around a face-vertex.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bg_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n+virtual int getFaceSize(Index faceIndex) const =0\n+Returns the size of a face (number of vertices)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+int Index\n+Integer type representing a mesh index.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+virtual int populateFaceVertexDescriptor(Index faceIndex, int faceVertex,\n+VertexDescriptor *vertexDescriptor) const =0\n+Describe the topology of incident faces around a face-vertex.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br\n+virtual bool getFaceNeighborhoodVertexIndicesIfRegular(Index faceIndex, Index\n+vertexIndices[]) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b2_\b1_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br\n+virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular(Index faceIndex,\n+FVarID fvarID, Index fvarValueIndices[]) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b2_\b2_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+virtual int getFaceFVarValueIndices(Index faceIndex, FVarID fvarID, Index\n+fvarValueIndices[]) const =0\n+Gather the face-varying indices of the face's vertices.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+virtual int getFaceVertexIndices(Index faceIndex, Index vertexIndices[]) const\n+=0\n+Gather the indices of the face's vertices.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bi_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be\n+virtual bool isFaceHole(Index faceIndex) const =0\n+Returns if a face is a hole.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bF_\bV_\ba_\br_\bI_\bD\n+std::intptr_t FVarID\n+Type used to identify and specify face-varying primvars.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+Simple class used by subclasses of SurfaceFactory to describe a vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh\n+ * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00686.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00686.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/surfaceFactoryMeshAdapter.h File Reference\n+OpenSubdiv: opensubdiv/bfr/surfaceFactory.h File Reference\n \n \n \n \n \n \n \n@@ -90,26 +90,33 @@\n \n \n \n
\n \n-
surfaceFactoryMeshAdapter.h File Reference
\n+
surfaceFactory.h File Reference
\n
\n
\n
#include "../version.h"
\n+#include "../bfr/surface.h"
\n+#include "../bfr/surfaceFactoryMeshAdapter.h"
\n+#include "../sdc/options.h"
\n+#include "../sdc/types.h"
\n #include <cstdint>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n+\n \n

\n Classes

class  SurfaceFactoryMeshAdapter
 Abstract interface adapting SurfaceFactory to a connected mesh representation. More...
class  SurfaceFactory
 Base class providing initialization of a Surface for each face of a mesh. More...
 
class  SurfaceFactory::Options
 Simple set of options assigned to instances of SurfaceFactory. More...
 
\n \n \n \n \n@@ -118,13 +125,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,32 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-surfaceFactoryMeshAdapter.h File Reference\n+surfaceFactory.h File Reference\n #include \"../version.h\"\n+#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bs_\bu_\br_\bf_\ba_\bc_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n #include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br\n-\u00a0 Abstract interface adapting _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by to a connected mesh\n- representation. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+\u00a0 Base class providing initialization of a _\bS_\bu_\br_\bf_\ba_\bc_\be for each face of a\n+ mesh. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+\u00a0 Simple set of options assigned to instances of _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh\n+ * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00686.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00686.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,4 @@\n var a00686 = [\n- [\"SurfaceFactoryMeshAdapter\", \"a00957.html\", \"a00957\"]\n+ [\"SurfaceFactory\", \"a00941.html\", \"a00941\"],\n+ [\"Options\", \"a00945.html\", \"a00945\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00686_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00686_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/surfaceFactoryMeshAdapter.h Source File\n+OpenSubdiv: opensubdiv/bfr/surfaceFactory.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
surfaceFactoryMeshAdapter.h
\n+
surfaceFactory.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2021 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,149 +119,412 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H
\n-
26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H
\n+
25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_H
\n+
26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include <cstdint>
\n-
31
\n-
32namespace OpenSubdiv {
\n-
33namespace OPENSUBDIV_VERSION {
\n+
30#include "../bfr/surface.h"
\n+
31#include "../bfr/surfaceFactoryMeshAdapter.h"
\n+
32#include "../sdc/options.h"
\n+
33#include "../sdc/types.h"
\n
34
\n-
35namespace Bfr {
\n+
35#include <cstdint>
\n
36
\n-
37class VertexDescriptor;
\n-
38
\n-
43// SurfaceFactoryMeshAdapter is an abstract class that defines the interface
\n-
44// through which subclasses of SurfaceFactory adapt to a connected mesh
\n-
45// representation. The interface defines methods that describe the mesh
\n-
46// topology and control indices in the neighborhood of a mesh -- from
\n-
47// which the SurfaceFactory to identifies an appropriate limit surface.
\n-
48//
\n-
49// SurfaceFactoryMeshAdapter methods require a subclass to provide a complete
\n-
50// description of the topology around a base face, as well as indices
\n-
51// associated with it (both vertex and face-varying). The intent here is
\n-
52// to keep the number of methods required to a minimum, and also to minimize
\n-
53// the number of invocations required by the factory.
\n-
54//
\n-
55// With the need to support both linear and non-linear cases (for which
\n-
56// linear is trivial by comparison) and the limit surface for both vertex
\n-
57// and face-varying topologies, the result is a small set of methods
\n-
58// covering this matrix of functionality.
\n-
59//
\n-
60// Since face-varying data may differ in topology from the vertex data --
\n-
61// with each set of face-varying data potentially having its own unique
\n-
62// topology -- sets of face-varying data are uniquely distinguished by an
\n-
63// associated integer (a face-varying ID).
\n-
64//
\n-
\n-\n-
66public:
\n-
68 typedef int Index;
\n-
69
\n-
80 typedef std::intptr_t FVarID;
\n-
81
\n-
82protected:
\n-\n-
85 virtual ~SurfaceFactoryMeshAdapter() { }
\n-
87
\n-
88protected:
\n-
90
\n-
94
\n-
96 virtual bool isFaceHole(Index faceIndex) const = 0;
\n-
97
\n-
99 virtual int getFaceSize(Index faceIndex) const = 0;
\n-
101
\n-
103
\n-
111
\n-
113 virtual int getFaceVertexIndices(Index faceIndex,
\n-
114 Index vertexIndices[]) const = 0;
\n-
115
\n-
117 virtual int getFaceFVarValueIndices(Index faceIndex,
\n-
118 FVarID fvarID, Index fvarValueIndices[]) const = 0;
\n+
37namespace OpenSubdiv {
\n+
38namespace OPENSUBDIV_VERSION {
\n+
39
\n+
40namespace Bfr {
\n+
41
\n+
42//
\n+
43// Forward declarations of public and internal classes used by factories:
\n+
44//
\n+
45class SurfaceFactoryCache;
\n+
46class FaceTopology;
\n+
47class FaceSurface;
\n+
48
\n+
\n+\n+
104public:
\n+
\n+
116 class Options {
\n+
117 public:
\n+
\n+
118 Options() : _dfltFVarID(-1), _externCache(0), _enableCache(true),
\n+
119 _approxLevelSmooth(2), _approxLevelSharp(6) { }
\n+
\n
120
\n-
121protected:
\n-
123
\n+\n+
125 FVarID GetDefaultFVarID() const { return _dfltFVarID; }
\n+
126
\n+
128 Options & EnableCaching(bool on);
\n+
130 bool IsCachingEnabled() const { return _enableCache; }
\n+
131
\n+\n+
135 SurfaceFactoryCache * GetExternalCache() const { return _externCache; }
\n+
136
\n+
137 // Set refinement levels used to approximate the limit surface
\n+
138 // for smooth and sharp features (reasonable defaults assigned):
\n+
140 Options & SetApproxLevelSmooth(int level);
\n+
142 int GetApproxLevelSmooth() const { return _approxLevelSmooth; }
\n+
143
\n+
145 Options & SetApproxLevelSharp(int level);
\n+
147 int GetApproxLevelSharp() const { return _approxLevelSharp; }
\n+
148
\n+
149 private:
\n+
150 // Member variables:
\n+
151 FVarID _dfltFVarID;
\n+
152
\n+
153 SurfaceFactoryCache * _externCache;
\n+
154
\n+
155 unsigned char _enableCache : 1;
\n+
156 unsigned char _approxLevelSmooth;
\n+
157 unsigned char _approxLevelSharp;
\n+
158 };
\n+
\n
159
\n-\n-
162 Index faceIndex, int faceVertex,
\n-
163 VertexDescriptor * vertexDescriptor) const = 0;
\n+
160public:
\n+
161 ~SurfaceFactory() override;
\n+
162
\n
164
\n-\n-
167 Index faceIndex, int faceVertex,
\n-
168 Index vertexIndices[]) const = 0;
\n-
169
\n-\n-
173 Index faceIndex, int faceVertex,
\n-
174 FVarID fvarID, Index fvarValueIndices[]) const = 0;
\n-
176
\n-
177protected:
\n-
179
\n-\n-
204 Index faceIndex, Index vertexIndices[]) const;
\n-
205
\n-\n-
207 Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const;
\n-
209
\n-
210private:
\n-
211 // No private members
\n-
212};
\n-
\n+
168
\n+
170 Sdc::SchemeType GetSchemeType() const { return _subdivScheme; }
\n+
171
\n+
173 Sdc::Options GetSchemeOptions() const { return _subdivOptions; }
\n+
175
\n+
176public:
\n+
178
\n+
190
\n+
200 bool FaceHasLimitSurface(Index faceIndex) const;
\n+
201
\n+\n+
210
\n+
211public:
\n
213
\n-
214//
\n-
215// Inline defaults for optional methods:
\n-
216//
\n-
217inline bool
\n-
\n-\n-
219 Index, Index[]) const {
\n-
220 return false;
\n-
221}
\n-
\n-
222
\n-
223inline bool
\n-\n-
228
\n-
229} // end namespace Bfr
\n-
230
\n-
231} // end namespace OPENSUBDIV_VERSION
\n-
232using namespace OPENSUBDIV_VERSION;
\n
233
\n-
234} // end namespace OpenSubdiv
\n-
235
\n-
236#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H */
\n+
241 template <typename REAL>
\n+
242 bool InitVertexSurface(Index faceIndex, Surface<REAL> * surface) const;
\n+
243
\n+
251 template <typename REAL>
\n+
252 bool InitVaryingSurface(Index faceIndex, Surface<REAL> * surface) const;
\n+
253
\n+
266 template <typename REAL>
\n+
267 bool InitFaceVaryingSurface(Index faceIndex, Surface<REAL> * surface) const;
\n+
268
\n+
278 template <typename REAL>
\n+
279 bool InitFaceVaryingSurface(Index faceIndex, Surface<REAL> * surface,
\n+
280 FVarID fvarID) const;
\n+
281
\n+
307 template <typename REAL>
\n+
308 bool InitSurfaces(Index faceIndex, Surface<REAL> * vtxSurface,
\n+
309 Surface<REAL> * fvarSurfaces,
\n+
310 FVarID const fvarIDs[] = 0,
\n+
311 int fvarCount = 0,
\n+
312 Surface<REAL> * varSurface = 0) const;
\n+
314
\n+
316
\n+
319 //
\n+
320 // WIP - considering removing these since non-essential
\n+
321 //
\n+
322
\n+
324 template <typename REAL=float>
\n+
325 Surface<REAL> * CreateVertexSurface(Index faceIndex) const;
\n+
326
\n+
328 template <typename REAL=float>
\n+
329 Surface<REAL> * CreateVaryingSurface(Index faceIndex) const;
\n+
330
\n+
332 template <typename REAL=float>
\n+\n+
334
\n+
336 template <typename REAL=float>
\n+
337 Surface<REAL> * CreateFaceVaryingSurface(Index faceIndex, FVarID id) const;
\n+
339
\n+
340protected:
\n+
342
\n+
346
\n+\n+
359 Sdc::Options const & schemeOptions,
\n+
360 Options const & limitOptions);
\n+
361
\n+\n+
364
\n+\n+\n+
368
\n+
369private:
\n+
370 // Supporting internal methods:
\n+
371 void setSubdivisionOptions(Sdc::SchemeType, Sdc::Options const & options);
\n+
372 void setFactoryOptions(Options const & factoryOptions);
\n+
373
\n+
374 bool faceHasLimitSimple(Index faceIndex, int faceSize) const;
\n+
375
\n+
376 bool faceHasLimitNeighborhood(Index faceIndex) const;
\n+
377 bool faceHasLimitNeighborhood(FaceTopology const & faceTopology) const;
\n+
378
\n+
379 class SurfaceSet;
\n+
380
\n+
381 bool populateAllSurfaces( Index faceIndex, SurfaceSet * sSetPtr) const;
\n+
382 bool populateLinearSurfaces( Index faceIndex, SurfaceSet * sSetPtr) const;
\n+
383 bool populateNonLinearSurfaces(Index faceIndex, SurfaceSet * sSetPtr) const;
\n+
384
\n+
385 bool initSurfaces(Index faceIndex, internal::SurfaceData * vtxSurface,
\n+
386 internal::SurfaceData * varSurface,
\n+
387 internal::SurfaceData * fvarSurfaces,
\n+
388 int fvarCount,
\n+
389 FVarID const fvarIDs[]) const;
\n+
390
\n+
391 // Methods to assemble topology and corresponding indices for entire face:
\n+
392 bool isFaceNeighborhoodRegular(Index faceIndex,
\n+
393 FVarID const * fvarPtrOrVtx,
\n+
394 Index indices[]) const;
\n+
395
\n+
396 bool initFaceNeighborhoodTopology(Index faceIndex,
\n+
397 FaceTopology * topology) const;
\n+
398
\n+
399 bool gatherFaceNeighborhoodTopology(Index faceIndex,
\n+
400 FaceTopology * topology) const;
\n+
401
\n+
402 int gatherFaceNeighborhoodIndices(Index faceIndex,
\n+
403 FaceTopology const & topology,
\n+
404 FVarID const * fvarPtrOrVtx,
\n+
405 Index indices[]) const;
\n+
406
\n+
407 // Methods to assemble Surfaces for the different categories of patch:
\n+
408 typedef internal::SurfaceData SurfaceType;
\n+
409
\n+
410 void assignLinearSurface(SurfaceType * surfacePtr,
\n+
411 Index faceIndex,
\n+
412 FVarID const * fvarPtrOrVtx) const;
\n+
413
\n+
414 void assignRegularSurface(SurfaceType * surfacePtr,
\n+
415 Index const surfacePatchPoints[]) const;
\n+
416
\n+
417 void assignRegularSurface(SurfaceType * surfacePtr,
\n+
418 FaceSurface const & surfaceDescription) const;
\n+
419
\n+
420 void assignIrregularSurface(SurfaceType * surfacePtr,
\n+
421 FaceSurface const & surfaceDescription) const;
\n+
422
\n+
423 void copyNonLinearSurface(SurfaceType * surfacePtr,
\n+
424 SurfaceType const & surfaceSource,
\n+
425 FaceSurface const & surfaceDescription) const;
\n+
426
\n+
427private:
\n+
428 // Members describing options and subdivision properties (very little
\n+
429 // memory and low initialization cost)
\n+
430 Sdc::SchemeType _subdivScheme;
\n+
431 Sdc::Options _subdivOptions;
\n+
432 Options _factoryOptions;
\n+
433
\n+
434 // Members related to subdivision topology, options and limit tests:
\n+
435 unsigned int _linearScheme : 1;
\n+
436 unsigned int _linearFVarInterp : 1;
\n+
437
\n+
438 unsigned int _testNeighborhoodForLimit : 1;
\n+
439 unsigned int _rejectSmoothBoundariesForLimit : 1;
\n+
440 unsigned int _rejectIrregularFacesForLimit : 1;
\n+
441
\n+
442 int _regFaceSize;
\n+
443
\n+
444 // Members related to caching:
\n+
445 SurfaceFactoryCache mutable * _topologyCache;
\n+
446};
\n+
\n+
447
\n+
448//
\n+
449// Inline methods for Options:
\n+
450//
\n+\n+
\n+\n+
453 _dfltFVarID = id;
\n+
454 return *this;
\n+
455}
\n+
\n+\n+
\n+\n+
458 _enableCache = on;
\n+
459 return *this;
\n+
460}
\n+
\n+\n+
\n+\n+
463 _externCache = c;
\n+
464 return *this;
\n+
465}
\n+
\n+\n+
\n+\n+
468 _approxLevelSmooth = (unsigned char) level;
\n+
469 return *this;
\n+
470}
\n+
\n+\n+
\n+\n+
473 _approxLevelSharp = (unsigned char) level;
\n+
474 return *this;
\n+
475}
\n+
\n+
476
\n+
477//
\n+
478// Inline methods to initializes Surfaces:
\n+
479//
\n+
480template <typename REAL>
\n+
481inline bool
\n+
\n+\n+
483
\n+
484 return initSurfaces(face, &s->getSurfaceData(), 0, 0, 0, 0);
\n+
485}
\n+
\n+
486template <typename REAL>
\n+
487inline bool
\n+
\n+\n+
489
\n+
490 return initSurfaces(face, 0, &s->getSurfaceData(), 0, 0, 0);
\n+
491}
\n+
\n+
492template <typename REAL>
\n+
493inline bool
\n+
\n+\n+
495 FVarID fvarID) const {
\n+
496 return initSurfaces(face, 0, 0, &s->getSurfaceData(), 1, &fvarID);
\n+
497}
\n+
\n+
498template <typename REAL>
\n+
499inline bool
\n+
\n+\n+
501 FVarID dfltID = _factoryOptions.GetDefaultFVarID();
\n+
502 return initSurfaces(face, 0, 0, &s->getSurfaceData(), 1, &dfltID);
\n+
503}
\n+
\n+
504
\n+
505template <typename REAL>
\n+
506inline bool
\n+
\n+\n+
508 Surface<REAL> * fvarSurfaces, FVarID const fvarIDs[], int fvarCount,
\n+
509 Surface<REAL> * varSurface) const {
\n+
510
\n+
511 bool useDfltFVarID = fvarSurfaces && (fvarIDs == 0) && (fvarCount == 0);
\n+
512 FVarID dfltFVarID = useDfltFVarID ? _factoryOptions.GetDefaultFVarID() : 0;
\n+
513
\n+
514 return initSurfaces(faceIndex,
\n+
515 vtxSurface ? &vtxSurface->getSurfaceData() : 0,
\n+
516 varSurface ? &varSurface->getSurfaceData() : 0,
\n+
517 fvarSurfaces ? &fvarSurfaces->getSurfaceData() : 0,
\n+
518 fvarCount ? fvarCount : (fvarSurfaces != 0),
\n+
519 useDfltFVarID ? &dfltFVarID : fvarIDs);
\n+
520}
\n+
\n+
521
\n+
522//
\n+
523// Inline methods to allocate and initialize Surfaces:
\n+
524//
\n+
525template <typename REAL>
\n+
526inline Surface<REAL> *
\n+
\n+\n+
528 Surface<REAL> * s = new Surface<REAL>();
\n+
529 if (InitVertexSurface<REAL>(faceIndex, s)) return s;
\n+
530 delete s;
\n+
531 return 0;
\n+
532}
\n+
\n+
533template <typename REAL>
\n+
534inline Surface<REAL> *
\n+
\n+\n+
536 Surface<REAL> * s = new Surface<REAL>();
\n+
537 if (InitVaryingSurface<REAL>(faceIndex, s)) return s;
\n+
538 delete s;
\n+
539 return 0;
\n+
540}
\n+
\n+
541template <typename REAL>
\n+
542inline Surface<REAL> *
\n+
\n+\n+
544 Surface<REAL> * s = new Surface<REAL>();
\n+
545 if (InitFaceVaryingSurface<REAL>(faceIndex, s, fvarID)) return s;
\n+
546 delete s;
\n+
547 return 0;
\n+
548}
\n+
\n+
549template <typename REAL>
\n+
550inline Surface<REAL> *
\n+
\n+\n+
552 FVarID dfltID = _factoryOptions.GetDefaultFVarID();
\n+
553 return CreateFaceVaryingSurface<REAL>(face, dfltID);
\n+
554}
\n+
\n+
555
\n+
556} // end namespace Bfr
\n+
557
\n+
558} // end namespace OPENSUBDIV_VERSION
\n+
559using namespace OPENSUBDIV_VERSION;
\n+
560
\n+
561} // end namespace OpenSubdiv
\n+
562
\n+
563#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_H */
\n \n-
Abstract interface adapting SurfaceFactory to a connected mesh representation.
\n-
virtual int getFaceVertexIncidentFaceFVarValueIndices(Index faceIndex, int faceVertex, FVarID fvarID, Index fvarValueIndices[]) const =0
Gather face-varying indices of incident faces around a face-vertex.
\n-
virtual int getFaceVertexIncidentFaceVertexIndices(Index faceIndex, int faceVertex, Index vertexIndices[]) const =0
Gather vertex indices of incident faces around a face-vertex.
\n-
virtual int getFaceSize(Index faceIndex) const =0
Returns the size of a face (number of vertices)
\n-\n-
virtual int populateFaceVertexDescriptor(Index faceIndex, int faceVertex, VertexDescriptor *vertexDescriptor) const =0
Describe the topology of incident faces around a face-vertex.
\n-
virtual bool getFaceNeighborhoodVertexIndicesIfRegular(Index faceIndex, Index vertexIndices[]) const
\n-
virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const
\n-
virtual int getFaceFVarValueIndices(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const =0
Gather the face-varying indices of the face's vertices.
\n-
virtual int getFaceVertexIndices(Index faceIndex, Index vertexIndices[]) const =0
Gather the indices of the face's vertices.
\n-
virtual bool isFaceHole(Index faceIndex) const =0
Returns if a face is a hole.
\n-
std::intptr_t FVarID
Type used to identify and specify face-varying primvars.
\n-
Simple class used by subclasses of SurfaceFactory to describe a vertex.
\n+
SchemeType
Enumerated type for all subdivision schemes supported by OpenSubdiv.
Definition types.h:37
\n+
Simple class defining the 2D parameterization of a face.
\n+
Encapsulates the limit surface for a face of a mesh.
Definition surface.h:59
\n+
Base class providing initialization of a Surface for each face of a mesh.
\n+
void setInternalCache(SurfaceFactoryCache *cache)
Subclass to identify an internal cache for use by base class.
\n+\n+
bool InitFaceVaryingSurface(Index faceIndex, Surface< REAL > *surface) const
Initialize a Surface for the default face-varying data.
\n+
Sdc::Options GetSchemeOptions() const
Return the set of subdivision options.
\n+
Parameterization GetFaceParameterization(Index faceIndex) const
Return the Parameterization of a face with a limit surface.
\n+
SurfaceFactory(SurfaceFactory const &)=delete
\n+
bool FaceHasLimitSurface(Index faceIndex) const
Return if a specified face has a limit surface.
\n+
SurfaceFactory & operator=(SurfaceFactory const &)=delete
\n+
Surface< REAL > * CreateVertexSurface(Index faceIndex) const
Construct a Surface for vertex data.
\n+
Surface< REAL > * CreateFaceVaryingSurface(Index faceIndex) const
Construct a Surface for the default face-varying data.
\n+
bool InitSurfaces(Index faceIndex, Surface< REAL > *vtxSurface, Surface< REAL > *fvarSurfaces, FVarID const fvarIDs[]=0, int fvarCount=0, Surface< REAL > *varSurface=0) const
Initialize multiple Surfaces at once.
\n+
Sdc::SchemeType GetSchemeType() const
Return the subdivision scheme.
\n+
Surface< REAL > * CreateVaryingSurface(Index faceIndex) const
Construct a Surface for varying data.
\n+
bool InitVertexSurface(Index faceIndex, Surface< REAL > *surface) const
Initialize a Surface for vertex data.
\n+
bool InitVaryingSurface(Index faceIndex, Surface< REAL > *surface) const
Initialize a Surface for varying data.
\n+
SurfaceFactory(Sdc::SchemeType schemeType, Sdc::Options const &schemeOptions, Options const &limitOptions)
Constructor to be used by subclasses.
\n+
Simple set of options assigned to instances of SurfaceFactory.
\n+
Options & SetExternalCache(SurfaceFactoryCache *c)
Assign an external cache to override the internal.
\n+
Options & EnableCaching(bool on)
Enable or disable caching (default is true):
\n+
Options & SetApproxLevelSmooth(int level)
Assign maximum refinement level for smooth features.
\n+
int GetApproxLevelSmooth() const
Return maximum refinement level for smooth features.
\n+\n+
bool IsCachingEnabled() const
Return if caching is enable.
\n+
Options & SetDefaultFVarID(FVarID id)
Assign the default face-varying ID (none assigned by default)
\n+
Options & SetApproxLevelSharp(int level)
Assign maximum refinement level for sharp features.
\n+
FVarID GetDefaultFVarID() const
Return the default face-varying ID.
\n+
int GetApproxLevelSharp() const
Return maximum refinement level for sharp features.
\n+
SurfaceFactoryCache * GetExternalCache() const
Return any assigned external cache.
\n+
Container used internally by SurfaceFactory to store reusable information.
\n+
Abstract interface adapting SurfaceFactory to a connected mesh representation.
\n+\n+
std::intptr_t FVarID
Type used to identify and specify face-varying primvars.
\n+
All supported options applying to subdivision scheme.
Definition options.h:51
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-surfaceFactoryMeshAdapter.h\n+surfaceFactory.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2021 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,179 +24,476 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H\n-26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H\n+25#ifndef OPENSUBDIV3_BFR_SURFACE_FACTORY_H\n+26#define OPENSUBDIV3_BFR_SURFACE_FACTORY_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \n-31\n-32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-33namespace OPENSUBDIV_VERSION {\n+30#include \"../bfr/surface.h\"\n+31#include \"../bfr/surfaceFactoryMeshAdapter.h\"\n+32#include \"../sdc/options.h\"\n+33#include \"../sdc/types.h\"\n 34\n-35namespace Bfr {\n+35#include \n 36\n-37class VertexDescriptor;\n-38\n-43// SurfaceFactoryMeshAdapter is an abstract class that defines the interface\n-44// through which subclasses of SurfaceFactory adapt to a connected mesh\n-45// representation. The interface defines methods that describe the mesh\n-46// topology and control indices in the neighborhood of a mesh -- from\n-47// which the SurfaceFactory to identifies an appropriate limit surface.\n-48//\n-49// SurfaceFactoryMeshAdapter methods require a subclass to provide a complete\n-50// description of the topology around a base face, as well as indices\n-51// associated with it (both vertex and face-varying). The intent here is\n-52// to keep the number of methods required to a minimum, and also to minimize\n-53// the number of invocations required by the factory.\n-54//\n-55// With the need to support both linear and non-linear cases (for which\n-56// linear is trivial by comparison) and the limit surface for both vertex\n-57// and face-varying topologies, the result is a small set of methods\n-58// covering this matrix of functionality.\n-59//\n-60// Since face-varying data may differ in topology from the vertex data --\n-61// with each set of face-varying data potentially having its own unique\n-62// topology -- sets of face-varying data are uniquely distinguished by an\n-63// associated integer (a face-varying ID).\n-64//\n-_\b6_\b5class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br {\n-66public:\n-_\b6_\b8 typedef int _\bI_\bn_\bd_\be_\bx;\n-69\n-_\b8_\b0 typedef std::intptr_t _\bF_\bV_\ba_\br_\bI_\bD;\n-81\n-82protected:\n-84 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br() { }\n-85 virtual _\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br() { }\n-87\n-88protected:\n-90\n-94\n-_\b9_\b6 virtual bool _\bi_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const = 0;\n-97\n-_\b9_\b9 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const = 0;\n-101\n-103\n-111\n-_\b1_\b1_\b3 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex,\n-114 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const = 0;\n-115\n-_\b1_\b1_\b7 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex,\n-118 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const = 0;\n+37namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+38namespace OPENSUBDIV_VERSION {\n+39\n+40namespace Bfr {\n+41\n+42//\n+43// Forward declarations of public and internal classes used by factories:\n+44//\n+45class SurfaceFactoryCache;\n+46class FaceTopology;\n+47class FaceSurface;\n+48\n+_\b1_\b0_\b3class _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br {\n+104public:\n+_\b1_\b1_\b6 class _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n+117 public:\n+_\b1_\b1_\b8 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _dfltFVarID(-1), _externCache(0), _enableCache(true),\n+119 _approxLevelSmooth(2), _approxLevelSharp(6) { }\n 120\n-121protected:\n-123\n+123 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD(_\bF_\bV_\ba_\br_\bI_\bD id);\n+_\b1_\b2_\b5 _\bF_\bV_\ba_\br_\bI_\bD _\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD() const { return _dfltFVarID; }\n+126\n+128 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bE_\bn_\ba_\bb_\bl_\be_\bC_\ba_\bc_\bh_\bi_\bn_\bg(bool on);\n+_\b1_\b3_\b0 bool _\bI_\bs_\bC_\ba_\bc_\bh_\bi_\bn_\bg_\bE_\bn_\ba_\bb_\bl_\be_\bd() const { return _enableCache; }\n+131\n+133 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * c);\n+_\b1_\b3_\b5 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * _\bG_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be() const { return _externCache; }\n+136\n+137 // Set refinement levels used to approximate the limit surface\n+138 // for smooth and sharp features (reasonable defaults assigned):\n+140 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh(int level);\n+_\b1_\b4_\b2 int _\bG_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh() const { return _approxLevelSmooth; }\n+143\n+145 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp(int level);\n+_\b1_\b4_\b7 int _\bG_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp() const { return _approxLevelSharp; }\n+148\n+149 private:\n+150 // Member variables:\n+151 _\bF_\bV_\ba_\br_\bI_\bD _dfltFVarID;\n+152\n+153 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * _externCache;\n+154\n+155 unsigned char _enableCache : 1;\n+156 unsigned char _approxLevelSmooth;\n+157 unsigned char _approxLevelSharp;\n+158 };\n 159\n-_\b1_\b6_\b1 virtual int _\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(\n-162 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n-163 _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br * vertexDescriptor) const = 0;\n+160public:\n+_\b1_\b6_\b1 _\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by() override;\n+162\n 164\n-_\b1_\b6_\b6 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(\n-167 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n-168 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const = 0;\n-169\n-_\b1_\b7_\b2 virtual int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(\n-173 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n-174 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const = 0;\n-176\n-177protected:\n-179\n-203 virtual bool _\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n-204 _\bI_\bn_\bd_\be_\bx faceIndex, _\bI_\bn_\bd_\be_\bx vertexIndices[]) const;\n-205\n-206 virtual bool _\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n-207 _\bI_\bn_\bd_\be_\bx faceIndex, _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const;\n-209\n-210private:\n-211 // No private members\n-212};\n+168\n+_\b1_\b7_\b0 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be _\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be() const { return _subdivScheme; }\n+171\n+_\b1_\b7_\b3 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs() const { return _subdivOptions; }\n+175\n+176public:\n+178\n+190\n+_\b2_\b0_\b0 bool _\bF_\ba_\bc_\be_\bH_\ba_\bs_\bL_\bi_\bm_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n+201\n+_\b2_\b0_\b8 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn _\bG_\be_\bt_\bF_\ba_\bc_\be_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n+210\n+211public:\n 213\n-214//\n-215// Inline defaults for optional methods:\n-216//\n-217inline bool\n-_\b2_\b1_\b8_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n-219 _\bI_\bn_\bd_\be_\bx, _\bI_\bn_\bd_\be_\bx[]) const {\n-220 return false;\n-221}\n-222\n-223inline bool\n-_\b2_\b2_\b4_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n-225 _\bI_\bn_\bd_\be_\bx, _\bF_\bV_\ba_\br_\bI_\bD, _\bI_\bn_\bd_\be_\bx[]) const {\n-226 return false;\n-227}\n-228\n-229} // end namespace Bfr\n-230\n-231} // end namespace OPENSUBDIV_VERSION\n-232using namespace OPENSUBDIV_VERSION;\n 233\n-234} // end namespace OpenSubdiv\n-235\n-236#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_ADAPTER_H */\n+241 template \n+242 bool _\bI_\bn_\bi_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * surface) const;\n+243\n+251 template \n+252 bool _\bI_\bn_\bi_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * surface) const;\n+253\n+266 template \n+267 bool _\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * surface)\n+const;\n+268\n+278 template \n+279 bool _\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * surface,\n+280 _\bF_\bV_\ba_\br_\bI_\bD fvarID) const;\n+281\n+307 template \n+308 bool _\bI_\bn_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * vtxSurface,\n+309 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * fvarSurfaces,\n+310 _\bF_\bV_\ba_\br_\bI_\bD const fvarIDs[] = 0,\n+311 int fvarCount = 0,\n+312 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * varSurface = 0) const;\n+314\n+316\n+319 //\n+320 // WIP - considering removing these since non-essential\n+321 //\n+322\n+324 template \n+325 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * _\bC_\br_\be_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n+326\n+328 template \n+329 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * _\bC_\br_\be_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n+330\n+332 template \n+333 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * _\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n+334\n+336 template \n+337 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * _\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bF_\bV_\ba_\br_\bI_\bD id) const;\n+339\n+340protected:\n+342\n+346\n+_\b3_\b5_\b8 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by(_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be schemeType,\n+359 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs const & schemeOptions,\n+360 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & limitOptions);\n+361\n+_\b3_\b6_\b3 void _\bs_\be_\bt_\bI_\bn_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * cache);\n+364\n+_\b3_\b6_\b5 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by const &) = delete;\n+_\b3_\b6_\b6 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by const &) = delete;\n+368\n+369private:\n+370 // Supporting internal methods:\n+371 void setSubdivisionOptions(_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be, _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options);\n+372 void setFactoryOptions(_\bO_\bp_\bt_\bi_\bo_\bn_\bs const & factoryOptions);\n+373\n+374 bool faceHasLimitSimple(_\bI_\bn_\bd_\be_\bx faceIndex, int faceSize) const;\n+375\n+376 bool faceHasLimitNeighborhood(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n+377 bool faceHasLimitNeighborhood(FaceTopology const & faceTopology) const;\n+378\n+379 class SurfaceSet;\n+380\n+381 bool populateAllSurfaces( _\bI_\bn_\bd_\be_\bx faceIndex, SurfaceSet * sSetPtr) const;\n+382 bool populateLinearSurfaces( _\bI_\bn_\bd_\be_\bx faceIndex, SurfaceSet * sSetPtr) const;\n+383 bool populateNonLinearSurfaces(_\bI_\bn_\bd_\be_\bx faceIndex, SurfaceSet * sSetPtr)\n+const;\n+384\n+385 bool initSurfaces(_\bI_\bn_\bd_\be_\bx faceIndex, internal::SurfaceData * vtxSurface,\n+386 internal::SurfaceData * varSurface,\n+387 internal::SurfaceData * fvarSurfaces,\n+388 int fvarCount,\n+389 _\bF_\bV_\ba_\br_\bI_\bD const fvarIDs[]) const;\n+390\n+391 // Methods to assemble topology and corresponding indices for entire face:\n+392 bool isFaceNeighborhoodRegular(_\bI_\bn_\bd_\be_\bx faceIndex,\n+393 _\bF_\bV_\ba_\br_\bI_\bD const * fvarPtrOrVtx,\n+394 _\bI_\bn_\bd_\be_\bx indices[]) const;\n+395\n+396 bool initFaceNeighborhoodTopology(_\bI_\bn_\bd_\be_\bx faceIndex,\n+397 FaceTopology * topology) const;\n+398\n+399 bool gatherFaceNeighborhoodTopology(_\bI_\bn_\bd_\be_\bx faceIndex,\n+400 FaceTopology * topology) const;\n+401\n+402 int gatherFaceNeighborhoodIndices(_\bI_\bn_\bd_\be_\bx faceIndex,\n+403 FaceTopology const & topology,\n+404 _\bF_\bV_\ba_\br_\bI_\bD const * fvarPtrOrVtx,\n+405 _\bI_\bn_\bd_\be_\bx indices[]) const;\n+406\n+407 // Methods to assemble Surfaces for the different categories of patch:\n+408 typedef internal::SurfaceData SurfaceType;\n+409\n+410 void assignLinearSurface(SurfaceType * surfacePtr,\n+411 _\bI_\bn_\bd_\be_\bx faceIndex,\n+412 _\bF_\bV_\ba_\br_\bI_\bD const * fvarPtrOrVtx) const;\n+413\n+414 void assignRegularSurface(SurfaceType * surfacePtr,\n+415 _\bI_\bn_\bd_\be_\bx const surfacePatchPoints[]) const;\n+416\n+417 void assignRegularSurface(SurfaceType * surfacePtr,\n+418 FaceSurface const & surfaceDescription) const;\n+419\n+420 void assignIrregularSurface(SurfaceType * surfacePtr,\n+421 FaceSurface const & surfaceDescription) const;\n+422\n+423 void copyNonLinearSurface(SurfaceType * surfacePtr,\n+424 SurfaceType const & surfaceSource,\n+425 FaceSurface const & surfaceDescription) const;\n+426\n+427private:\n+428 // Members describing options and subdivision properties (very little\n+429 // memory and low initialization cost)\n+430 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be _subdivScheme;\n+431 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs _subdivOptions;\n+432 _\bO_\bp_\bt_\bi_\bo_\bn_\bs _factoryOptions;\n+433\n+434 // Members related to subdivision topology, options and limit tests:\n+435 unsigned int _linearScheme : 1;\n+436 unsigned int _linearFVarInterp : 1;\n+437\n+438 unsigned int _testNeighborhoodForLimit : 1;\n+439 unsigned int _rejectSmoothBoundariesForLimit : 1;\n+440 unsigned int _rejectIrregularFacesForLimit : 1;\n+441\n+442 int _regFaceSize;\n+443\n+444 // Members related to caching:\n+445 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be mutable * _topologyCache;\n+446};\n+447\n+448//\n+449// Inline methods for Options:\n+450//\n+451inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n+_\b4_\b5_\b2_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD(_\bF_\bV_\ba_\br_\bI_\bD id) {\n+453 _dfltFVarID = id;\n+454 return *this;\n+455}\n+456inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n+_\b4_\b5_\b7_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bn_\ba_\bb_\bl_\be_\bC_\ba_\bc_\bh_\bi_\bn_\bg(bool on) {\n+458 _enableCache = on;\n+459 return *this;\n+460}\n+461inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n+_\b4_\b6_\b2_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be(_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be * c) {\n+463 _externCache = c;\n+464 return *this;\n+465}\n+466inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n+_\b4_\b6_\b7_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh(int level) {\n+468 _approxLevelSmooth = (unsigned char) level;\n+469 return *this;\n+470}\n+471inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n+_\b4_\b7_\b2_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp(int level) {\n+473 _approxLevelSharp = (unsigned char) level;\n+474 return *this;\n+475}\n+476\n+477//\n+478// Inline methods to initializes Surfaces:\n+479//\n+480template \n+481inline bool\n+_\b4_\b8_\b2_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s) const {\n+483\n+484 return initSurfaces(face, &s->getSurfaceData(), 0, 0, 0, 0);\n+485}\n+486template \n+487inline bool\n+_\b4_\b8_\b8_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s) const {\n+489\n+490 return initSurfaces(face, 0, &s->getSurfaceData(), 0, 0, 0);\n+491}\n+492template \n+493inline bool\n+_\b4_\b9_\b4_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s,\n+495 _\bF_\bV_\ba_\br_\bI_\bD fvarID) const {\n+496 return initSurfaces(face, 0, 0, &s->getSurfaceData(), 1, &fvarID);\n+497}\n+498template \n+499inline bool\n+_\b5_\b0_\b0_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s) const\n+{\n+501 _\bF_\bV_\ba_\br_\bI_\bD dfltID = _factoryOptions._\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD();\n+502 return initSurfaces(face, 0, 0, &s->getSurfaceData(), 1, &dfltID);\n+503}\n+504\n+505template \n+506inline bool\n+_\b5_\b0_\b7_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex, _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * vtxSurface,\n+508 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * fvarSurfaces, _\bF_\bV_\ba_\br_\bI_\bD const fvarIDs[], int fvarCount,\n+509 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * varSurface) const {\n+510\n+511 bool useDfltFVarID = fvarSurfaces && (fvarIDs == 0) && (fvarCount == 0);\n+512 _\bF_\bV_\ba_\br_\bI_\bD dfltFVarID = useDfltFVarID ? _factoryOptions._\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD() : 0;\n+513\n+514 return initSurfaces(faceIndex,\n+515 vtxSurface ? &vtxSurface->getSurfaceData() : 0,\n+516 varSurface ? &varSurface->getSurfaceData() : 0,\n+517 fvarSurfaces ? &fvarSurfaces->getSurfaceData() : 0,\n+518 fvarCount ? fvarCount : (fvarSurfaces != 0),\n+519 useDfltFVarID ? &dfltFVarID : fvarIDs);\n+520}\n+521\n+522//\n+523// Inline methods to allocate and initialize Surfaces:\n+524//\n+525template \n+526inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> *\n+_\b5_\b2_\b7_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const {\n+528 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s = new _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b>();\n+529 if (InitVertexSurface(faceIndex, s)) return s;\n+530 delete s;\n+531 return 0;\n+532}\n+533template \n+534inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> *\n+_\b5_\b3_\b5_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const {\n+536 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s = new _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b>();\n+537 if (InitVaryingSurface(faceIndex, s)) return s;\n+538 delete s;\n+539 return 0;\n+540}\n+541template \n+542inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> *\n+_\b5_\b4_\b3_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx faceIndex, _\bF_\bV_\ba_\br_\bI_\bD fvarID)\n+const {\n+544 _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> * s = new _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b>();\n+545 if (InitFaceVaryingSurface(faceIndex, s, fvarID)) return s;\n+546 delete s;\n+547 return 0;\n+548}\n+549template \n+550inline _\bS_\bu_\br_\bf_\ba_\bc_\be_\b<_\bR_\bE_\bA_\bL_\b> *\n+_\b5_\b5_\b1_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx face) const {\n+552 _\bF_\bV_\ba_\br_\bI_\bD dfltID = _factoryOptions._\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD();\n+553 return CreateFaceVaryingSurface(face, dfltID);\n+554}\n+555\n+556} // end namespace Bfr\n+557\n+558} // end namespace OPENSUBDIV_VERSION\n+559using namespace OPENSUBDIV_VERSION;\n+560\n+561} // end namespace OpenSubdiv\n+562\n+563#endif /* OPENSUBDIV3_BFR_SURFACE_FACTORY_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n+SchemeType\n+Enumerated type for all subdivision schemes supported by OpenSubdiv.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+Simple class defining the 2D parameterization of a face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be\n+Encapsulates the limit surface for a face of a mesh.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Base class providing initialization of a Surface for each face of a mesh.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b0_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bI_\bn_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be\n+void setInternalCache(SurfaceFactoryCache *cache)\n+Subclass to identify an internal cache for use by base class.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\b~_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+~SurfaceFactory() override\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be\n+bool InitFaceVaryingSurface(Index faceIndex, Surface< REAL > *surface) const\n+Initialize a Surface for the default face-varying data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Sdc::Options GetSchemeOptions() const\n+Return the set of subdivision options.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+Parameterization GetFaceParameterization(Index faceIndex) const\n+Return the Parameterization of a face with a limit surface.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+SurfaceFactory(SurfaceFactory const &)=delete\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bF_\ba_\bc_\be_\bH_\ba_\bs_\bL_\bi_\bm_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be\n+bool FaceHasLimitSurface(Index faceIndex) const\n+Return if a specified face has a limit surface.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n+SurfaceFactory & operator=(SurfaceFactory const &)=delete\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be\n+Surface< REAL > * CreateVertexSurface(Index faceIndex) const\n+Construct a Surface for vertex data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b2_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be\n+Surface< REAL > * CreateFaceVaryingSurface(Index faceIndex) const\n+Construct a Surface for the default face-varying data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bS_\bu_\br_\bf_\ba_\bc_\be_\bs\n+bool InitSurfaces(Index faceIndex, Surface< REAL > *vtxSurface, Surface< REAL >\n+*fvarSurfaces, FVarID const fvarIDs[]=0, int fvarCount=0, Surface< REAL >\n+*varSurface=0) const\n+Initialize multiple Surfaces at once.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b0_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n+Sdc::SchemeType GetSchemeType() const\n+Return the subdivision scheme.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b7_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be\n+Surface< REAL > * CreateVaryingSurface(Index faceIndex) const\n+Construct a Surface for varying data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b3_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bu_\br_\bf_\ba_\bc_\be\n+bool InitVertexSurface(Index faceIndex, Surface< REAL > *surface) const\n+Initialize a Surface for vertex data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bI_\bn_\bi_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bu_\br_\bf_\ba_\bc_\be\n+bool InitVaryingSurface(Index faceIndex, Surface< REAL > *surface) const\n+Initialize a Surface for varying data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+SurfaceFactory(Sdc::SchemeType schemeType, Sdc::Options const &schemeOptions,\n+Options const &limitOptions)\n+Constructor to be used by subclasses.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Simple set of options assigned to instances of SurfaceFactory.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be\n+Options & SetExternalCache(SurfaceFactoryCache *c)\n+Assign an external cache to override the internal.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bn_\ba_\bb_\bl_\be_\bC_\ba_\bc_\bh_\bi_\bn_\bg\n+Options & EnableCaching(bool on)\n+Enable or disable caching (default is true):\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh\n+Options & SetApproxLevelSmooth(int level)\n+Assign maximum refinement level for smooth features.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bG_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bm_\bo_\bo_\bt_\bh\n+int GetApproxLevelSmooth() const\n+Return maximum refinement level for smooth features.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bI_\bs_\bC_\ba_\bc_\bh_\bi_\bn_\bg_\bE_\bn_\ba_\bb_\bl_\be_\bd\n+bool IsCachingEnabled() const\n+Return if caching is enable.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD\n+Options & SetDefaultFVarID(FVarID id)\n+Assign the default face-varying ID (none assigned by default)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bS_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp\n+Options & SetApproxLevelSharp(int level)\n+Assign maximum refinement level for sharp features.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b7_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bF_\bV_\ba_\br_\bI_\bD\n+FVarID GetDefaultFVarID() const\n+Return the default face-varying ID.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bG_\be_\bt_\bA_\bp_\bp_\br_\bo_\bx_\bL_\be_\bv_\be_\bl_\bS_\bh_\ba_\br_\bp\n+int GetApproxLevelSharp() const\n+Return maximum refinement level for sharp features.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bE_\bx_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be\n+SurfaceFactoryCache * GetExternalCache() const\n+Return any assigned external cache.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be\n+Container used internally by SurfaceFactory to store reusable information.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh_\b:_\b5_\b9\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br\n Abstract interface adapting SurfaceFactory to a connected mesh representation.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-virtual int getFaceVertexIncidentFaceFVarValueIndices(Index faceIndex, int\n-faceVertex, FVarID fvarID, Index fvarValueIndices[]) const =0\n-Gather face-varying indices of incident faces around a face-vertex.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-virtual int getFaceVertexIncidentFaceVertexIndices(Index faceIndex, int\n-faceVertex, Index vertexIndices[]) const =0\n-Gather vertex indices of incident faces around a face-vertex.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bg_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n-virtual int getFaceSize(Index faceIndex) const =0\n-Returns the size of a face (number of vertices)\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n int Index\n Integer type representing a mesh index.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-virtual int populateFaceVertexDescriptor(Index faceIndex, int faceVertex,\n-VertexDescriptor *vertexDescriptor) const =0\n-Describe the topology of incident faces around a face-vertex.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br\n-virtual bool getFaceNeighborhoodVertexIndicesIfRegular(Index faceIndex, Index\n-vertexIndices[]) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b2_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br\n-virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular(Index faceIndex,\n-FVarID fvarID, Index fvarValueIndices[]) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b2_\b2_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-virtual int getFaceFVarValueIndices(Index faceIndex, FVarID fvarID, Index\n-fvarValueIndices[]) const =0\n-Gather the face-varying indices of the face's vertices.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-virtual int getFaceVertexIndices(Index faceIndex, Index vertexIndices[]) const\n-=0\n-Gather the indices of the face's vertices.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bi_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be\n-virtual bool isFaceHole(Index faceIndex) const =0\n-Returns if a face is a hole.\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bF_\bV_\ba_\br_\bI_\bD\n std::intptr_t FVarID\n Type used to identify and specify face-varying primvars.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-Simple class used by subclasses of SurfaceFactory to describe a vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+All supported options applying to subdivision scheme.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b5_\b1\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh\n+ * _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00689.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00689.html", "unified_diff": "@@ -95,15 +95,15 @@\n Classes |\n Namespaces \n
surface.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../bfr/surfaceData.h"
\n-#include "../bfr/parameterization.h"
\n+#include "../bfr/parameterization.h"
\n #include "../vtr/array.h"
\n
\n

Go to the source code of this file.

\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00689_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00689_source.html", "unified_diff": "@@ -425,16 +425,16 @@\n
441} // end namespace OPENSUBDIV_VERSION
\n
442using namespace OPENSUBDIV_VERSION;
\n
443
\n
444} // end namespace OpenSubdiv
\n
445
\n
446#endif /* OPENSUBDIV3_BFR_SURFACE */
\n \n-
Simple class defining the 2D parameterization of a face.
\n-
int GetFaceSize() const
Returns the size (number of vertices) of the corresponding face.
\n+
Simple class defining the 2D parameterization of a face.
\n+
int GetFaceSize() const
Returns the size (number of vertices) of the corresponding face.
\n
Encapsulates the limit surface for a face of a mesh.
Definition surface.h:59
\n
int GetNumControlPoints() const
Return the number of control points affecting the Surface.
Definition surface.h:137
\n
void Evaluate(REAL const uv[2], REAL const patchPoints[], PointDescriptor const &pointDesc, REAL P[]) const
Evaluation of position.
Definition surface.h:372
\n
int GetFaceSize() const
Return the size of the face.
Definition surface.h:109
\n
bool IsRegular() const
Return if the Surface is a single regular patch.
Definition surface.h:112
\n
void BoundControlPoints(REAL const controlPoints[], PointDescriptor const &controlPointDesc, REAL minExtent[], REAL maxExtent[]) const
Compute bounds of control points from a local array.
\n
int GetControlPointIndices(Index meshPointIndices[]) const
Identify indices of control points in the mesh.
\n@@ -457,15 +457,15 @@\n
int EvaluateStencil(REAL const uv[2], REAL sP[]) const
Evaluation of the limit stencil for position.
Definition surface.h:416
\n
Simple struct defining the size and stride of points in arrays.
Definition surface.h:63
\n \n \n \n \n \n-
Base class providing initialization of a Surface for each face of a mesh.
\n+
Base class providing initialization of a Surface for each face of a mesh.
\n \n \n \n \n
\n
    \n
  • opensubdiv
  • bfr
  • surface.h
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00692.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00692.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/refinerSurfaceFactory.h File Reference\n+OpenSubdiv: opensubdiv/bfr/parameterization.h File Reference\n \n \n \n \n \n \n \n@@ -90,47 +90,41 @@\n
\n \n \n
\n \n-
refinerSurfaceFactory.h File Reference
\n+
parameterization.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../bfr/surfaceFactory.h"
\n-#include "../bfr/surfaceFactoryCache.h"
\n+#include "../sdc/types.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

class  Surface< REAL >
\n \n-\n-\n-\n-\n-\n+\n+\n \n

\n Classes

class  RefinerSurfaceFactoryBase
 Intermediate subclass of SurfaceFactory with Far::TopologyRefiner as the mesh. More...
 
class  RefinerSurfaceFactory< CACHE_TYPE >
 Template for concrete subclasses of RefinerSurfaceFactoryBase. More...
class  Parameterization
 Simple class defining the 2D parameterization of a face. More...
 
\n \n \n \n \n \n-\n-\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Bfr
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,31 +1,24 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-refinerSurfaceFactory.h File Reference\n+parameterization.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\"\n-#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n-\u00a0 Intermediate subclass of _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by with _\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br as\n- the mesh. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bC_\bA_\bC_\bH_\bE_\b__\bT_\bY_\bP_\bE_\b _\b>\n-\u00a0 Template for concrete subclasses of _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+\u00a0 Simple class defining the 2D parameterization of a face. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n-\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00692.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00692.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,3 @@\n var a00692 = [\n- [\"RefinerSurfaceFactoryBase\", \"a00925.html\", \"a00925\"],\n- [\"RefinerSurfaceFactory< CACHE_TYPE >\", \"a00929.html\", \"a00929\"]\n+ [\"Parameterization\", \"a00921.html\", \"a00921\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00692_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00692_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/refinerSurfaceFactory.h Source File\n+OpenSubdiv: opensubdiv/bfr/parameterization.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
refinerSurfaceFactory.h
\n+
parameterization.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2021 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,163 +119,200 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H
\n-
26#define OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H
\n+
25#ifndef OPENSUBDIV3_BFR_PARAMETERIZATION_H
\n+
26#define OPENSUBDIV3_BFR_PARAMETERIZATION_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../bfr/surfaceFactory.h"
\n-
31#include "../bfr/surfaceFactoryCache.h"
\n-
32
\n-
33namespace OpenSubdiv {
\n-
34namespace OPENSUBDIV_VERSION {
\n-
35
\n-
\n-
36namespace Far {
\n-
37 class TopologyRefiner;
\n-
38}
\n-
\n-
39
\n-
40namespace Bfr {
\n-
41
\n-
\n-\n-
59public:
\n-
61
\n-
65
\n-\n-
67 Options const & options);
\n-
68
\n-
69 ~RefinerSurfaceFactoryBase() override = default;
\n-
71
\n-
73
\n-
77
\n-
79 Far::TopologyRefiner const & GetMesh() const { return _mesh; }
\n-
80
\n-
82 int GetNumFaces() const { return _numFaces; }
\n-
83
\n-
85 int GetNumFVarChannels() const { return _numFVarChannels; }
\n-
87
\n-
88protected:
\n-
90 //
\n-
91 // Virtual overrides to satisfy the SurfaceFactoryMeshAdapter interface:
\n-
92 //
\n-
93 bool isFaceHole( Index faceIndex) const override;
\n-
94 int getFaceSize(Index faceIndex) const override;
\n-
95
\n-
96 int getFaceVertexIndices(Index faceIndex,
\n-
97 Index vertexIndices[]) const override;
\n-
98 int getFaceFVarValueIndices(Index faceIndex,
\n-
99 FVarID fvarID, Index fvarValueIndices[]) const override;
\n-
100
\n-
101 int populateFaceVertexDescriptor(Index faceIndex, int faceVertex,
\n-
102 VertexDescriptor * vertexDescriptor) const override;
\n+
30#include "../sdc/types.h"
\n+
31
\n+
32namespace OpenSubdiv {
\n+
33namespace OPENSUBDIV_VERSION {
\n+
34
\n+
35namespace Bfr {
\n+
36
\n+
\n+\n+
53public:
\n+
62 enum Type { QUAD,
\n+\n+\n+
65 };
\n+
66
\n+
67public:
\n+
69
\n+
76
\n+
78 Parameterization(Sdc::SchemeType scheme, int faceSize);
\n+
79
\n+
81 bool IsValid() const { return (_faceSize > 0); }
\n+
82
\n+
84 Parameterization() : _type(0), _uDim(0), _faceSize(0) { }
\n+
85
\n+\n+\n+
88 ~Parameterization() = default;
\n+
90
\n+
92
\n+
96
\n+
98 Type GetType() const { return (Type) _type; }
\n+
99
\n+
101 int GetFaceSize() const { return _faceSize; }
\n
103
\n-\n-
105 Index faceIndex, int faceVertex,
\n-
106 Index vertexIndices[]) const override;
\n-\n-
108 Index faceIndex, int faceVertex,
\n-
109 FVarID fvarID, Index fvarValueIndices[]) const override;
\n-
110
\n-
111 // Optional SurfaceFactoryMeshAdapter overrides for regular patches:
\n-\n-
113 Index faceIndex,
\n-
114 Index vertexIndices[]) const override;
\n-
115
\n-\n-
117 Index faceIndex,
\n-
118 FVarID fvarID, Index fvarValueIndices[]) const override;
\n+
104public:
\n+
106
\n+
116
\n+
118 template <typename REAL>
\n+
119 void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const;
\n
120
\n-
121private:
\n-
122 //
\n-
123 // Internal supporting methods:
\n-
124 //
\n-
125 int getFaceVaryingChannel(FVarID fvarID) const;
\n-
126
\n-
127 int getFaceVertexPointIndices(Index faceIndex, int faceVertex,
\n-
128 Index indices[], int vtxOrFVarChannel) const;
\n+
122 template <typename REAL>
\n+
123 void GetEdgeCoord(int edgeIndex, REAL t, REAL uvCoord[2]) const;
\n+
124
\n+
126 template <typename REAL>
\n+
127 void GetCenterCoord(REAL uvCoord[2]) const;
\n
129
\n-
130 int getFacePatchPointIndices(Index faceIndex,
\n-
131 Index indices[], int vtxOrFVarChannel) const;
\n+
130public:
\n
132
\n-
133private:
\n-
134 // Additional members for the subclass:
\n-
135 Far::TopologyRefiner const & _mesh;
\n-
136
\n-
137 int _numFaces;
\n-
138 int _numFVarChannels;
\n-
139};
\n-
\n-
140
\n-
141
\n-
142//
\n-
156template <class CACHE_TYPE = SurfaceFactoryCache>
\n-
\n-\n-
158public:
\n-
\n-\n-
160 Options const & options = Options()) :
\n-
161 RefinerSurfaceFactoryBase(mesh, options),
\n-
162 _localCache() {
\n-
163
\n-\n-
165 }
\n-
\n-
166 ~RefinerSurfaceFactory() override = default;
\n-
167
\n-
168private:
\n-
169 CACHE_TYPE _localCache;
\n-
170};
\n-
\n+
147
\n+
149 bool HasSubFaces() const;
\n+
150
\n+
152 template <typename REAL>
\n+
153 int GetSubFace(REAL const uvCoord[2]) const;
\n+
154
\n+
157 template <typename REAL>
\n+\n+
159 REAL const uvCoord[2], REAL subFaceCoord[2]) const;
\n+
160
\n+
162 template <typename REAL>
\n+
163 void ConvertSubFaceToCoord(int subFace,
\n+
164 REAL const subFaceCoord[2], REAL uvCoord[2]) const;
\n+
165
\n+
168 template <typename REAL>
\n+\n+
170 REAL const uvCoord[2], REAL subFaceCoord[2]) const;
\n
171
\n-
172} // end namespace Bfr
\n-
173
\n-
174} // end namespace OPENSUBDIV_VERSION
\n-
175using namespace OPENSUBDIV_VERSION;
\n-
176
\n-
177} // end namespace OpenSubdiv
\n-
178
\n-
179#endif /* OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H */
\n+
173 template <typename REAL>
\n+
174 void ConvertNormalizedSubFaceToCoord(int subFace,
\n+
175 REAL const subFaceCoord[2], REAL uvCoord[2]) const;
\n+
177
\n+
178private:
\n+
179 template <typename REAL>
\n+
180 int convertCoordToSubFace(bool normalized,
\n+
181 REAL const uvCoord[2], REAL subFaceCoord[2]) const;
\n+
182 template <typename REAL>
\n+
183 void convertSubFaceToCoord(bool normalized, int subFace,
\n+
184 REAL const subFaceCoord[2], REAL uvCoord[2]) const;
\n+
185
\n+
186private:
\n+
187 unsigned char _type;
\n+
188 unsigned char _uDim;
\n+
189 unsigned short _faceSize;
\n+
190};
\n+
\n+
191
\n+
192//
\n+
193// Inline sub-face coordinate conversion methods:
\n+
194//
\n+
195inline bool
\n+
\n+\n+
197 return (_type == QUAD_SUBFACES);
\n+
198}
\n+
\n+
199
\n+
200template <typename REAL>
\n+
201inline int
\n+
\n+
202Parameterization::GetSubFace(REAL const uvCoord[2]) const {
\n+
203
\n+
204 if (!HasSubFaces()) return 0;
\n+
205
\n+
206 int uTile = (int) uvCoord[0];
\n+
207 int vTile = (int) uvCoord[1];
\n+
208 return (vTile + ((uvCoord[1] - (REAL) vTile) > 0.75f)) * _uDim +
\n+
209 (uTile + ((uvCoord[0] - (REAL) uTile) > 0.75f));
\n+
210}
\n+
\n+
211
\n+
212// Conversions to unnormalized sub-face coordinates:
\n+
213template <typename REAL>
\n+
214inline int
\n+
\n+\n+
216 REAL const uvCoord[2], REAL subCoord[2]) const {
\n+
217 return convertCoordToSubFace<REAL>(false, uvCoord, subCoord);
\n+
218}
\n+
\n+
219template <typename REAL>
\n+
220inline void
\n+
\n+\n+
222 int subFace, REAL const subCoord[2], REAL uvCoord[2]) const {
\n+
223 convertSubFaceToCoord<REAL>(false, subFace, subCoord, uvCoord);
\n+
224}
\n+
\n+
225
\n+
226// Conversions to normalized sub-face coordinates:
\n+
227template <typename REAL>
\n+
228inline int
\n+
\n+\n+
230 REAL const uvCoord[2], REAL subCoord[2]) const {
\n+
231 return convertCoordToSubFace<REAL>(true, uvCoord, subCoord);
\n+
232}
\n+
\n+
233template <typename REAL>
\n+
234inline void
\n+
\n+\n+
236 int subFace, REAL const subCoord[2], REAL uvCoord[2]) const {
\n+
237 convertSubFaceToCoord<REAL>(true, subFace, subCoord, uvCoord);
\n+
238}
\n+
\n+
239
\n+
240} // end namespace Bfr
\n+
241
\n+
242} // end namespace OPENSUBDIV_VERSION
\n+
243using namespace OPENSUBDIV_VERSION;
\n+
244
\n+
245} // end namespace OpenSubdiv
\n+
246
\n+
247#endif /* OPENSUBDIV3_BFR_PARAMETERIZATION */
\n \n-
Intermediate subclass of SurfaceFactory with Far::TopologyRefiner as the mesh.
\n-\n-
int GetNumFVarChannels() const
Return the number of face-varying channels.
\n-
Far::TopologyRefiner const & GetMesh() const
Return the instance of the mesh.
\n-\n-
RefinerSurfaceFactoryBase(Far::TopologyRefiner const &mesh, Options const &options)
\n-
Template for concrete subclasses of RefinerSurfaceFactoryBase.
\n-\n-
RefinerSurfaceFactory(Far::TopologyRefiner const &mesh, Options const &options=Options())
\n-
Base class providing initialization of a Surface for each face of a mesh.
\n-
void setInternalCache(SurfaceFactoryCache *cache)
Subclass to identify an internal cache for use by base class.
\n-
Simple set of options assigned to instances of SurfaceFactory.
\n-
virtual int getFaceVertexIncidentFaceFVarValueIndices(Index faceIndex, int faceVertex, FVarID fvarID, Index fvarValueIndices[]) const =0
Gather face-varying indices of incident faces around a face-vertex.
\n-
virtual int getFaceVertexIncidentFaceVertexIndices(Index faceIndex, int faceVertex, Index vertexIndices[]) const =0
Gather vertex indices of incident faces around a face-vertex.
\n-
virtual int getFaceSize(Index faceIndex) const =0
Returns the size of a face (number of vertices)
\n-\n-
virtual int populateFaceVertexDescriptor(Index faceIndex, int faceVertex, VertexDescriptor *vertexDescriptor) const =0
Describe the topology of incident faces around a face-vertex.
\n-
virtual bool getFaceNeighborhoodVertexIndicesIfRegular(Index faceIndex, Index vertexIndices[]) const
\n-
virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const
\n-
virtual int getFaceFVarValueIndices(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const =0
Gather the face-varying indices of the face's vertices.
\n-
virtual int getFaceVertexIndices(Index faceIndex, Index vertexIndices[]) const =0
Gather the indices of the face's vertices.
\n-
virtual bool isFaceHole(Index faceIndex) const =0
Returns if a face is a hole.
\n-
std::intptr_t FVarID
Type used to identify and specify face-varying primvars.
\n-
Simple class used by subclasses of SurfaceFactory to describe a vertex.
\n-
Stores topology data for a specified set of refinement options.
\n+
SchemeType
Enumerated type for all subdivision schemes supported by OpenSubdiv.
Definition types.h:37
\n+
Simple class defining the 2D parameterization of a face.
\n+
int GetSubFace(REAL const uvCoord[2]) const
Returns the integer sub-face containing the given (u,v)
\n+
int GetFaceSize() const
Returns the size (number of vertices) of the corresponding face.
\n+
Type
Enumerated type for the different kinds of Parameterizations.
\n+
@ QUAD_SUBFACES
Partitioned into quadrilateral sub-faces.
\n+\n+\n+
Parameterization(Sdc::SchemeType scheme, int faceSize)
Primary constructor with subdivision scheme and face size.
\n+
int ConvertCoordToSubFace(REAL const uvCoord[2], REAL subFaceCoord[2]) const
Convert (u,v) to a sub-face (return value) and its local (u,v) coordinate.
\n+
void GetCenterCoord(REAL uvCoord[2]) const
Returns the (u,v) coordinate for the center of the face.
\n+
Type GetType() const
Returns the type of parameterization assigned.
\n+\n+
Parameterization(Parameterization const &)=default
\n+
void GetEdgeCoord(int edgeIndex, REAL t, REAL uvCoord[2]) const
Returns the (u,v) coordinate at any point on a given edge.
\n+
void ConvertNormalizedSubFaceToCoord(int subFace, REAL const subFaceCoord[2], REAL uvCoord[2]) const
Convert a sub-face and its normalized (u,v) coordinate to (u,v)
\n+
void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const
Returns the (u,v) coordinate of a given vertex.
\n+
Parameterization()
Default construction produces an invalid instance.
\n+
bool IsValid() const
Returns true if correctly initialized.
\n+
bool HasSubFaces() const
Returns if Parameterization has been partitioned into sub-faces.
\n+
int ConvertCoordToNormalizedSubFace(REAL const uvCoord[2], REAL subFaceCoord[2]) const
Convert (u,v) to a sub-face (return value) and its normalized (u,v) coordinate.
\n+
void ConvertSubFaceToCoord(int subFace, REAL const subFaceCoord[2], REAL uvCoord[2]) const
Convert a sub-face and its local (u,v) coordinate to (u,v)
\n+
Parameterization & operator=(Parameterization const &)=default
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-refinerSurfaceFactory.h\n+parameterization.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2021 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,222 +24,243 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H\n-26#define OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H\n+25#ifndef OPENSUBDIV3_BFR_PARAMETERIZATION_H\n+26#define OPENSUBDIV3_BFR_PARAMETERIZATION_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../bfr/surfaceFactory.h\"\n-31#include \"../bfr/surfaceFactoryCache.h\"\n-32\n-33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-34namespace OPENSUBDIV_VERSION {\n-35\n-_\b3_\b6namespace Far {\n-37 class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br;\n-38}\n-39\n-40namespace Bfr {\n-41\n-_\b5_\b8class _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be : public _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n-59public:\n-61\n-65\n-_\b6_\b6 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be(_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & mesh,\n-67 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options);\n-68\n-_\b6_\b9 _\b~_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be() override = default;\n-71\n-73\n-77\n-_\b7_\b9 _\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & _\bG_\be_\bt_\bM_\be_\bs_\bh() const { return _mesh; }\n-80\n-_\b8_\b2 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs() const { return _numFaces; }\n-83\n-_\b8_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const { return _numFVarChannels; }\n-87\n-88protected:\n-90 //\n-91 // Virtual overrides to satisfy the SurfaceFactoryMeshAdapter interface:\n-92 //\n-93 bool _\bi_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be( _\bI_\bn_\bd_\be_\bx faceIndex) const override;\n-94 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const override;\n-95\n-96 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex,\n-97 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const override;\n-98 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex,\n-99 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const override;\n-100\n-101 int _\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(_\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n-102 _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br * vertexDescriptor) const override;\n+30#include \"../sdc/types.h\"\n+31\n+32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+33namespace OPENSUBDIV_VERSION {\n+34\n+35namespace Bfr {\n+36\n+_\b5_\b2class _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn {\n+53public:\n+_\b6_\b2 enum _\bT_\by_\bp_\be { _\bQ_\bU_\bA_\bD,\n+_\b6_\b3 _\bT_\bR_\bI,\n+64 _\bQ_\bU_\bA_\bD_\b__\bS_\bU_\bB_\bF_\bA_\bC_\bE_\bS\n+_\b6_\b5 };\n+66\n+67public:\n+69\n+76\n+_\b7_\b8 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn(_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be scheme, int faceSize);\n+79\n+_\b8_\b1 bool _\bI_\bs_\bV_\ba_\bl_\bi_\bd() const { return (_faceSize > 0); }\n+82\n+_\b8_\b4 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn() : _type(0), _uDim(0), _faceSize(0) { }\n+85\n+_\b8_\b6 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const &) = default;\n+_\b8_\b7 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const &) = default;\n+_\b8_\b8 _\b~_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn() = default;\n+90\n+92\n+96\n+_\b9_\b8 _\bT_\by_\bp_\be _\bG_\be_\bt_\bT_\by_\bp_\be() const { return (_\bT_\by_\bp_\be) _type; }\n+99\n+_\b1_\b0_\b1 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() const { return _faceSize; }\n 103\n-104 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(\n-105 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n-106 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const override;\n-107 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(\n-108 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n-109 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const override;\n-110\n-111 // Optional SurfaceFactoryMeshAdapter overrides for regular patches:\n-112 bool _\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n-113 _\bI_\bn_\bd_\be_\bx faceIndex,\n-114 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const override;\n-115\n-116 bool _\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n-117 _\bI_\bn_\bd_\be_\bx faceIndex,\n-118 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const override;\n+104public:\n+106\n+116\n+118 template \n+_\b1_\b1_\b9 void _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd(int vertexIndex, REAL uvCoord[2]) const;\n 120\n-121private:\n-122 //\n-123 // Internal supporting methods:\n-124 //\n-125 int getFaceVaryingChannel(_\bF_\bV_\ba_\br_\bI_\bD fvarID) const;\n-126\n-127 int getFaceVertexPointIndices(_\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n-128 _\bI_\bn_\bd_\be_\bx indices[], int vtxOrFVarChannel) const;\n+122 template \n+_\b1_\b2_\b3 void _\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd(int edgeIndex, REAL t, REAL uvCoord[2]) const;\n+124\n+126 template \n+_\b1_\b2_\b7 void _\bG_\be_\bt_\bC_\be_\bn_\bt_\be_\br_\bC_\bo_\bo_\br_\bd(REAL uvCoord[2]) const;\n 129\n-130 int getFacePatchPointIndices(_\bI_\bn_\bd_\be_\bx faceIndex,\n-131 _\bI_\bn_\bd_\be_\bx indices[], int vtxOrFVarChannel) const;\n+130public:\n 132\n-133private:\n-134 // Additional members for the subclass:\n-135 _\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & _mesh;\n-136\n-137 int _numFaces;\n-138 int _numFVarChannels;\n-139};\n-140\n-141\n-142//\n-156template \n-_\b1_\b5_\b7class _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be {\n-158public:\n-_\b1_\b5_\b9 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by(_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & mesh,\n-160 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs()) :\n-161 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be(mesh, options),\n-162 _localCache() {\n-163\n-164 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bI_\bn_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be(&_localCache);\n-165 }\n-_\b1_\b6_\b6 _\b~_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by() override = default;\n-167\n-168private:\n-169 CACHE_TYPE _localCache;\n-170};\n+147\n+149 bool _\bH_\ba_\bs_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bs() const;\n+150\n+152 template \n+153 int _\bG_\be_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be(REAL const uvCoord[2]) const;\n+154\n+157 template \n+158 int _\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bS_\bu_\bb_\bF_\ba_\bc_\be(\n+159 REAL const uvCoord[2], REAL subFaceCoord[2]) const;\n+160\n+162 template \n+163 void _\bC_\bo_\bn_\bv_\be_\br_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd(int subFace,\n+164 REAL const subFaceCoord[2], REAL uvCoord[2]) const;\n+165\n+168 template \n+169 int _\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be(\n+170 REAL const uvCoord[2], REAL subFaceCoord[2]) const;\n 171\n-172} // end namespace Bfr\n-173\n-174} // end namespace OPENSUBDIV_VERSION\n-175using namespace OPENSUBDIV_VERSION;\n-176\n-177} // end namespace OpenSubdiv\n-178\n-179#endif /* OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H */\n+173 template \n+174 void _\bC_\bo_\bn_\bv_\be_\br_\bt_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd(int subFace,\n+175 REAL const subFaceCoord[2], REAL uvCoord[2]) const;\n+177\n+178private:\n+179 template \n+180 int convertCoordToSubFace(bool normalized,\n+181 REAL const uvCoord[2], REAL subFaceCoord[2]) const;\n+182 template \n+183 void convertSubFaceToCoord(bool normalized, int subFace,\n+184 REAL const subFaceCoord[2], REAL uvCoord[2]) const;\n+185\n+186private:\n+187 unsigned char _type;\n+188 unsigned char _uDim;\n+189 unsigned short _faceSize;\n+190};\n+191\n+192//\n+193// Inline sub-face coordinate conversion methods:\n+194//\n+195inline bool\n+_\b1_\b9_\b6_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bH_\ba_\bs_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bs() const {\n+197 return (_type == _\bQ_\bU_\bA_\bD_\b__\bS_\bU_\bB_\bF_\bA_\bC_\bE_\bS);\n+198}\n+199\n+200template \n+201inline int\n+_\b2_\b0_\b2_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be(REAL const uvCoord[2]) const {\n+203\n+204 if (!_\bH_\ba_\bs_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bs()) return 0;\n+205\n+206 int uTile = (int) uvCoord[0];\n+207 int vTile = (int) uvCoord[1];\n+208 return (vTile + ((uvCoord[1] - (REAL) vTile) > 0.75f)) * _uDim +\n+209 (uTile + ((uvCoord[0] - (REAL) uTile) > 0.75f));\n+210}\n+211\n+212// Conversions to unnormalized sub-face coordinates:\n+213template \n+214inline int\n+_\b2_\b1_\b5_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bS_\bu_\bb_\bF_\ba_\bc_\be(\n+216 REAL const uvCoord[2], REAL subCoord[2]) const {\n+217 return convertCoordToSubFace(false, uvCoord, subCoord);\n+218}\n+219template \n+220inline void\n+_\b2_\b2_\b1_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd(\n+222 int subFace, REAL const subCoord[2], REAL uvCoord[2]) const {\n+223 convertSubFaceToCoord(false, subFace, subCoord, uvCoord);\n+224}\n+225\n+226// Conversions to normalized sub-face coordinates:\n+227template \n+228inline int\n+_\b2_\b2_\b9_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be(\n+230 REAL const uvCoord[2], REAL subCoord[2]) const {\n+231 return convertCoordToSubFace(true, uvCoord, subCoord);\n+232}\n+233template \n+234inline void\n+_\b2_\b3_\b5_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd(\n+236 int subFace, REAL const subCoord[2], REAL uvCoord[2]) const {\n+237 convertSubFaceToCoord(true, subFace, subCoord, uvCoord);\n+238}\n+239\n+240} // end namespace Bfr\n+241\n+242} // end namespace OPENSUBDIV_VERSION\n+243using namespace OPENSUBDIV_VERSION;\n+244\n+245} // end namespace OpenSubdiv\n+246\n+247#endif /* OPENSUBDIV3_BFR_PARAMETERIZATION */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n-Intermediate subclass of SurfaceFactory with Far::TopologyRefiner as the mesh.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs\n-int GetNumFaces() const\n-Return the number of faces.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n-_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int GetNumFVarChannels() const\n-Return the number of face-varying channels.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:_\bG_\be_\bt_\bM_\be_\bs_\bh\n-Far::TopologyRefiner const & GetMesh() const\n-Return the instance of the mesh.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n-_\b~_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n-~RefinerSurfaceFactoryBase() override=default\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n-_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n-RefinerSurfaceFactoryBase(Far::TopologyRefiner const &mesh, Options const\n-&options)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Template for concrete subclasses of RefinerSurfaceFactoryBase.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\b~_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-~RefinerSurfaceFactory() override=default\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-RefinerSurfaceFactory(Far::TopologyRefiner const &mesh, Options const\n-&options=Options())\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Base class providing initialization of a Surface for each face of a mesh.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bI_\bn_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be\n-void setInternalCache(SurfaceFactoryCache *cache)\n-Subclass to identify an internal cache for use by base class.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Simple set of options assigned to instances of SurfaceFactory.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-virtual int getFaceVertexIncidentFaceFVarValueIndices(Index faceIndex, int\n-faceVertex, FVarID fvarID, Index fvarValueIndices[]) const =0\n-Gather face-varying indices of incident faces around a face-vertex.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-virtual int getFaceVertexIncidentFaceVertexIndices(Index faceIndex, int\n-faceVertex, Index vertexIndices[]) const =0\n-Gather vertex indices of incident faces around a face-vertex.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bg_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n-virtual int getFaceSize(Index faceIndex) const =0\n-Returns the size of a face (number of vertices)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-int Index\n-Integer type representing a mesh index.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-virtual int populateFaceVertexDescriptor(Index faceIndex, int faceVertex,\n-VertexDescriptor *vertexDescriptor) const =0\n-Describe the topology of incident faces around a face-vertex.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br\n-virtual bool getFaceNeighborhoodVertexIndicesIfRegular(Index faceIndex, Index\n-vertexIndices[]) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b2_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br\n-virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular(Index faceIndex,\n-FVarID fvarID, Index fvarValueIndices[]) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b2_\b2_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-virtual int getFaceFVarValueIndices(Index faceIndex, FVarID fvarID, Index\n-fvarValueIndices[]) const =0\n-Gather the face-varying indices of the face's vertices.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n-_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-virtual int getFaceVertexIndices(Index faceIndex, Index vertexIndices[]) const\n-=0\n-Gather the indices of the face's vertices.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bi_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be\n-virtual bool isFaceHole(Index faceIndex) const =0\n-Returns if a face is a hole.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bF_\bV_\ba_\br_\bI_\bD\n-std::intptr_t FVarID\n-Type used to identify and specify face-varying primvars.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-Simple class used by subclasses of SurfaceFactory to describe a vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n-Stores topology data for a specified set of refinement options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n+SchemeType\n+Enumerated type for all subdivision schemes supported by OpenSubdiv.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+Simple class defining the 2D parameterization of a face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be\n+int GetSubFace(REAL const uvCoord[2]) const\n+Returns the integer sub-face containing the given (u,v)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b0_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n+int GetFaceSize() const\n+Returns the size (number of vertices) of the corresponding face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b0_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\by_\bp_\be\n+Type\n+Enumerated type for the different kinds of Parameterizations.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bQ_\bU_\bA_\bD_\b__\bS_\bU_\bB_\bF_\bA_\bC_\bE_\bS\n+@ QUAD_SUBFACES\n+Partitioned into quadrilateral sub-faces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\bR_\bI\n+@ TRI\n+Triangle.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bQ_\bU_\bA_\bD\n+@ QUAD\n+Quadrilateral.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+Parameterization(Sdc::SchemeType scheme, int faceSize)\n+Primary constructor with subdivision scheme and face size.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bS_\bu_\bb_\bF_\ba_\bc_\be\n+int ConvertCoordToSubFace(REAL const uvCoord[2], REAL subFaceCoord[2]) const\n+Convert (u,v) to a sub-face (return value) and its local (u,v) coordinate.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b1_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bC_\be_\bn_\bt_\be_\br_\bC_\bo_\bo_\br_\bd\n+void GetCenterCoord(REAL uvCoord[2]) const\n+Returns the (u,v) coordinate for the center of the face.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bT_\by_\bp_\be\n+Type GetType() const\n+Returns the type of parameterization assigned.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b~_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+~Parameterization()=default\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+Parameterization(Parameterization const &)=default\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd\n+void GetEdgeCoord(int edgeIndex, REAL t, REAL uvCoord[2]) const\n+Returns the (u,v) coordinate at any point on a given edge.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+_\bC_\bo_\bn_\bv_\be_\br_\bt_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd\n+void ConvertNormalizedSubFaceToCoord(int subFace, REAL const subFaceCoord[2],\n+REAL uvCoord[2]) const\n+Convert a sub-face and its normalized (u,v) coordinate to (u,v)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b3_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd\n+void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const\n+Returns the (u,v) coordinate of a given vertex.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+Parameterization()\n+Default construction produces an invalid instance.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b8_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n+bool IsValid() const\n+Returns true if correctly initialized.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bH_\ba_\bs_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bs\n+bool HasSubFaces() const\n+Returns if Parameterization has been partitioned into sub-faces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b9_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n+_\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be\n+int ConvertCoordToNormalizedSubFace(REAL const uvCoord[2], REAL subFaceCoord\n+[2]) const\n+Convert (u,v) to a sub-face (return value) and its normalized (u,v) coordinate.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b2_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd\n+void ConvertSubFaceToCoord(int subFace, REAL const subFaceCoord[2], REAL\n+uvCoord[2]) const\n+Convert a sub-face and its local (u,v) coordinate to (u,v)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n+Parameterization & operator=(Parameterization const &)=default\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00695.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00695.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/parameterization.h File Reference\n+OpenSubdiv: opensubdiv/bfr/refinerSurfaceFactory.h File Reference\n \n \n \n \n \n \n \n@@ -90,41 +90,47 @@\n \n \n \n
\n \n-
parameterization.h File Reference
\n+
refinerSurfaceFactory.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../sdc/types.h"
\n+#include "../bfr/surfaceFactory.h"
\n+#include "../bfr/surfaceFactoryCache.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n+\n \n

\n Classes

class  Parameterization
 Simple class defining the 2D parameterization of a face. More...
class  RefinerSurfaceFactoryBase
 Intermediate subclass of SurfaceFactory with Far::TopologyRefiner as the mesh. More...
 
class  RefinerSurfaceFactory< CACHE_TYPE >
 Template for concrete subclasses of RefinerSurfaceFactoryBase. More...
 
\n \n \n \n \n \n+\n+\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Bfr
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,24 +1,31 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-parameterization.h File Reference\n+refinerSurfaceFactory.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\"\n+#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bC_\ba_\bc_\bh_\be_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-\u00a0 Simple class defining the 2D parameterization of a face. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n+\u00a0 Intermediate subclass of _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by with _\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br as\n+ the mesh. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bC_\bA_\bC_\bH_\bE_\b__\bT_\bY_\bP_\bE_\b _\b>\n+\u00a0 Template for concrete subclasses of _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n+\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh\n+ * _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00695.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00695.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,4 @@\n var a00695 = [\n- [\"Parameterization\", \"a00921.html\", \"a00921\"]\n+ [\"RefinerSurfaceFactoryBase\", \"a00925.html\", \"a00925\"],\n+ [\"RefinerSurfaceFactory< CACHE_TYPE >\", \"a00929.html\", \"a00929\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00695_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00695_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/parameterization.h Source File\n+OpenSubdiv: opensubdiv/bfr/refinerSurfaceFactory.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
parameterization.h
\n+
refinerSurfaceFactory.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2021 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,200 +119,163 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_BFR_PARAMETERIZATION_H
\n-
26#define OPENSUBDIV3_BFR_PARAMETERIZATION_H
\n+
25#ifndef OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H
\n+
26#define OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../sdc/types.h"
\n-
31
\n-
32namespace OpenSubdiv {
\n-
33namespace OPENSUBDIV_VERSION {
\n-
34
\n-
35namespace Bfr {
\n-
36
\n-
\n-\n-
53public:
\n-
62 enum Type { QUAD,
\n-\n-\n-
65 };
\n-
66
\n-
67public:
\n-
69
\n-
76
\n-
78 Parameterization(Sdc::SchemeType scheme, int faceSize);
\n-
79
\n-
81 bool IsValid() const { return (_faceSize > 0); }
\n-
82
\n-
84 Parameterization() : _type(0), _uDim(0), _faceSize(0) { }
\n-
85
\n-\n-\n-
88 ~Parameterization() = default;
\n-
90
\n-
92
\n-
96
\n-
98 Type GetType() const { return (Type) _type; }
\n-
99
\n-
101 int GetFaceSize() const { return _faceSize; }
\n+
30#include "../bfr/surfaceFactory.h"
\n+
31#include "../bfr/surfaceFactoryCache.h"
\n+
32
\n+
33namespace OpenSubdiv {
\n+
34namespace OPENSUBDIV_VERSION {
\n+
35
\n+
\n+
36namespace Far {
\n+
37 class TopologyRefiner;
\n+
38}
\n+
\n+
39
\n+
40namespace Bfr {
\n+
41
\n+
\n+\n+
59public:
\n+
61
\n+
65
\n+\n+
67 Options const & options);
\n+
68
\n+
69 ~RefinerSurfaceFactoryBase() override = default;
\n+
71
\n+
73
\n+
77
\n+
79 Far::TopologyRefiner const & GetMesh() const { return _mesh; }
\n+
80
\n+
82 int GetNumFaces() const { return _numFaces; }
\n+
83
\n+
85 int GetNumFVarChannels() const { return _numFVarChannels; }
\n+
87
\n+
88protected:
\n+
90 //
\n+
91 // Virtual overrides to satisfy the SurfaceFactoryMeshAdapter interface:
\n+
92 //
\n+
93 bool isFaceHole( Index faceIndex) const override;
\n+
94 int getFaceSize(Index faceIndex) const override;
\n+
95
\n+
96 int getFaceVertexIndices(Index faceIndex,
\n+
97 Index vertexIndices[]) const override;
\n+
98 int getFaceFVarValueIndices(Index faceIndex,
\n+
99 FVarID fvarID, Index fvarValueIndices[]) const override;
\n+
100
\n+
101 int populateFaceVertexDescriptor(Index faceIndex, int faceVertex,
\n+
102 VertexDescriptor * vertexDescriptor) const override;
\n
103
\n-
104public:
\n-
106
\n-
116
\n-
118 template <typename REAL>
\n-
119 void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const;
\n+\n+
105 Index faceIndex, int faceVertex,
\n+
106 Index vertexIndices[]) const override;
\n+\n+
108 Index faceIndex, int faceVertex,
\n+
109 FVarID fvarID, Index fvarValueIndices[]) const override;
\n+
110
\n+
111 // Optional SurfaceFactoryMeshAdapter overrides for regular patches:
\n+\n+
113 Index faceIndex,
\n+
114 Index vertexIndices[]) const override;
\n+
115
\n+\n+
117 Index faceIndex,
\n+
118 FVarID fvarID, Index fvarValueIndices[]) const override;
\n
120
\n-
122 template <typename REAL>
\n-
123 void GetEdgeCoord(int edgeIndex, REAL t, REAL uvCoord[2]) const;
\n-
124
\n-
126 template <typename REAL>
\n-
127 void GetCenterCoord(REAL uvCoord[2]) const;
\n+
121private:
\n+
122 //
\n+
123 // Internal supporting methods:
\n+
124 //
\n+
125 int getFaceVaryingChannel(FVarID fvarID) const;
\n+
126
\n+
127 int getFaceVertexPointIndices(Index faceIndex, int faceVertex,
\n+
128 Index indices[], int vtxOrFVarChannel) const;
\n
129
\n-
130public:
\n+
130 int getFacePatchPointIndices(Index faceIndex,
\n+
131 Index indices[], int vtxOrFVarChannel) const;
\n
132
\n-
147
\n-
149 bool HasSubFaces() const;
\n-
150
\n-
152 template <typename REAL>
\n-
153 int GetSubFace(REAL const uvCoord[2]) const;
\n-
154
\n-
157 template <typename REAL>
\n-\n-
159 REAL const uvCoord[2], REAL subFaceCoord[2]) const;
\n-
160
\n-
162 template <typename REAL>
\n-
163 void ConvertSubFaceToCoord(int subFace,
\n-
164 REAL const subFaceCoord[2], REAL uvCoord[2]) const;
\n-
165
\n-
168 template <typename REAL>
\n-\n-
170 REAL const uvCoord[2], REAL subFaceCoord[2]) const;
\n+
133private:
\n+
134 // Additional members for the subclass:
\n+
135 Far::TopologyRefiner const & _mesh;
\n+
136
\n+
137 int _numFaces;
\n+
138 int _numFVarChannels;
\n+
139};
\n+
\n+
140
\n+
141
\n+
142//
\n+
156template <class CACHE_TYPE = SurfaceFactoryCache>
\n+
\n+\n+
158public:
\n+
\n+\n+
160 Options const & options = Options()) :
\n+
161 RefinerSurfaceFactoryBase(mesh, options),
\n+
162 _localCache() {
\n+
163
\n+\n+
165 }
\n+
\n+
166 ~RefinerSurfaceFactory() override = default;
\n+
167
\n+
168private:
\n+
169 CACHE_TYPE _localCache;
\n+
170};
\n+
\n
171
\n-
173 template <typename REAL>
\n-
174 void ConvertNormalizedSubFaceToCoord(int subFace,
\n-
175 REAL const subFaceCoord[2], REAL uvCoord[2]) const;
\n-
177
\n-
178private:
\n-
179 template <typename REAL>
\n-
180 int convertCoordToSubFace(bool normalized,
\n-
181 REAL const uvCoord[2], REAL subFaceCoord[2]) const;
\n-
182 template <typename REAL>
\n-
183 void convertSubFaceToCoord(bool normalized, int subFace,
\n-
184 REAL const subFaceCoord[2], REAL uvCoord[2]) const;
\n-
185
\n-
186private:
\n-
187 unsigned char _type;
\n-
188 unsigned char _uDim;
\n-
189 unsigned short _faceSize;
\n-
190};
\n-
\n-
191
\n-
192//
\n-
193// Inline sub-face coordinate conversion methods:
\n-
194//
\n-
195inline bool
\n-
\n-\n-
197 return (_type == QUAD_SUBFACES);
\n-
198}
\n-
\n-
199
\n-
200template <typename REAL>
\n-
201inline int
\n-
\n-
202Parameterization::GetSubFace(REAL const uvCoord[2]) const {
\n-
203
\n-
204 if (!HasSubFaces()) return 0;
\n-
205
\n-
206 int uTile = (int) uvCoord[0];
\n-
207 int vTile = (int) uvCoord[1];
\n-
208 return (vTile + ((uvCoord[1] - (REAL) vTile) > 0.75f)) * _uDim +
\n-
209 (uTile + ((uvCoord[0] - (REAL) uTile) > 0.75f));
\n-
210}
\n-
\n-
211
\n-
212// Conversions to unnormalized sub-face coordinates:
\n-
213template <typename REAL>
\n-
214inline int
\n-
\n-\n-
216 REAL const uvCoord[2], REAL subCoord[2]) const {
\n-
217 return convertCoordToSubFace<REAL>(false, uvCoord, subCoord);
\n-
218}
\n-
\n-
219template <typename REAL>
\n-
220inline void
\n-
\n-\n-
222 int subFace, REAL const subCoord[2], REAL uvCoord[2]) const {
\n-
223 convertSubFaceToCoord<REAL>(false, subFace, subCoord, uvCoord);
\n-
224}
\n-
\n-
225
\n-
226// Conversions to normalized sub-face coordinates:
\n-
227template <typename REAL>
\n-
228inline int
\n-
\n-\n-
230 REAL const uvCoord[2], REAL subCoord[2]) const {
\n-
231 return convertCoordToSubFace<REAL>(true, uvCoord, subCoord);
\n-
232}
\n-
\n-
233template <typename REAL>
\n-
234inline void
\n-
\n-\n-
236 int subFace, REAL const subCoord[2], REAL uvCoord[2]) const {
\n-
237 convertSubFaceToCoord<REAL>(true, subFace, subCoord, uvCoord);
\n-
238}
\n-
\n-
239
\n-
240} // end namespace Bfr
\n-
241
\n-
242} // end namespace OPENSUBDIV_VERSION
\n-
243using namespace OPENSUBDIV_VERSION;
\n-
244
\n-
245} // end namespace OpenSubdiv
\n-
246
\n-
247#endif /* OPENSUBDIV3_BFR_PARAMETERIZATION */
\n+
172} // end namespace Bfr
\n+
173
\n+
174} // end namespace OPENSUBDIV_VERSION
\n+
175using namespace OPENSUBDIV_VERSION;
\n+
176
\n+
177} // end namespace OpenSubdiv
\n+
178
\n+
179#endif /* OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H */
\n \n-
SchemeType
Enumerated type for all subdivision schemes supported by OpenSubdiv.
Definition types.h:37
\n-
Simple class defining the 2D parameterization of a face.
\n-
int GetSubFace(REAL const uvCoord[2]) const
Returns the integer sub-face containing the given (u,v)
\n-
int GetFaceSize() const
Returns the size (number of vertices) of the corresponding face.
\n-
Type
Enumerated type for the different kinds of Parameterizations.
\n-
@ QUAD_SUBFACES
Partitioned into quadrilateral sub-faces.
\n-\n-\n-
Parameterization(Sdc::SchemeType scheme, int faceSize)
Primary constructor with subdivision scheme and face size.
\n-
int ConvertCoordToSubFace(REAL const uvCoord[2], REAL subFaceCoord[2]) const
Convert (u,v) to a sub-face (return value) and its local (u,v) coordinate.
\n-
void GetCenterCoord(REAL uvCoord[2]) const
Returns the (u,v) coordinate for the center of the face.
\n-
Type GetType() const
Returns the type of parameterization assigned.
\n-\n-
Parameterization(Parameterization const &)=default
\n-
void GetEdgeCoord(int edgeIndex, REAL t, REAL uvCoord[2]) const
Returns the (u,v) coordinate at any point on a given edge.
\n-
void ConvertNormalizedSubFaceToCoord(int subFace, REAL const subFaceCoord[2], REAL uvCoord[2]) const
Convert a sub-face and its normalized (u,v) coordinate to (u,v)
\n-
void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const
Returns the (u,v) coordinate of a given vertex.
\n-
Parameterization()
Default construction produces an invalid instance.
\n-
bool IsValid() const
Returns true if correctly initialized.
\n-
bool HasSubFaces() const
Returns if Parameterization has been partitioned into sub-faces.
\n-
int ConvertCoordToNormalizedSubFace(REAL const uvCoord[2], REAL subFaceCoord[2]) const
Convert (u,v) to a sub-face (return value) and its normalized (u,v) coordinate.
\n-
void ConvertSubFaceToCoord(int subFace, REAL const subFaceCoord[2], REAL uvCoord[2]) const
Convert a sub-face and its local (u,v) coordinate to (u,v)
\n-
Parameterization & operator=(Parameterization const &)=default
\n+
Intermediate subclass of SurfaceFactory with Far::TopologyRefiner as the mesh.
\n+\n+
int GetNumFVarChannels() const
Return the number of face-varying channels.
\n+
Far::TopologyRefiner const & GetMesh() const
Return the instance of the mesh.
\n+\n+
RefinerSurfaceFactoryBase(Far::TopologyRefiner const &mesh, Options const &options)
\n+
Template for concrete subclasses of RefinerSurfaceFactoryBase.
\n+\n+
RefinerSurfaceFactory(Far::TopologyRefiner const &mesh, Options const &options=Options())
\n+
Base class providing initialization of a Surface for each face of a mesh.
\n+
void setInternalCache(SurfaceFactoryCache *cache)
Subclass to identify an internal cache for use by base class.
\n+
Simple set of options assigned to instances of SurfaceFactory.
\n+
virtual int getFaceVertexIncidentFaceFVarValueIndices(Index faceIndex, int faceVertex, FVarID fvarID, Index fvarValueIndices[]) const =0
Gather face-varying indices of incident faces around a face-vertex.
\n+
virtual int getFaceVertexIncidentFaceVertexIndices(Index faceIndex, int faceVertex, Index vertexIndices[]) const =0
Gather vertex indices of incident faces around a face-vertex.
\n+
virtual int getFaceSize(Index faceIndex) const =0
Returns the size of a face (number of vertices)
\n+\n+
virtual int populateFaceVertexDescriptor(Index faceIndex, int faceVertex, VertexDescriptor *vertexDescriptor) const =0
Describe the topology of incident faces around a face-vertex.
\n+
virtual bool getFaceNeighborhoodVertexIndicesIfRegular(Index faceIndex, Index vertexIndices[]) const
\n+
virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const
\n+
virtual int getFaceFVarValueIndices(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const =0
Gather the face-varying indices of the face's vertices.
\n+
virtual int getFaceVertexIndices(Index faceIndex, Index vertexIndices[]) const =0
Gather the indices of the face's vertices.
\n+
virtual bool isFaceHole(Index faceIndex) const =0
Returns if a face is a hole.
\n+
std::intptr_t FVarID
Type used to identify and specify face-varying primvars.
\n+
Simple class used by subclasses of SurfaceFactory to describe a vertex.
\n+
Stores topology data for a specified set of refinement options.
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-parameterization.h\n+refinerSurfaceFactory.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2021 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,243 +24,222 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_BFR_PARAMETERIZATION_H\n-26#define OPENSUBDIV3_BFR_PARAMETERIZATION_H\n+25#ifndef OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H\n+26#define OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../sdc/types.h\"\n-31\n-32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-33namespace OPENSUBDIV_VERSION {\n-34\n-35namespace Bfr {\n-36\n-_\b5_\b2class _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn {\n-53public:\n-_\b6_\b2 enum _\bT_\by_\bp_\be { _\bQ_\bU_\bA_\bD,\n-_\b6_\b3 _\bT_\bR_\bI,\n-64 _\bQ_\bU_\bA_\bD_\b__\bS_\bU_\bB_\bF_\bA_\bC_\bE_\bS\n-_\b6_\b5 };\n-66\n-67public:\n-69\n-76\n-_\b7_\b8 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn(_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be scheme, int faceSize);\n-79\n-_\b8_\b1 bool _\bI_\bs_\bV_\ba_\bl_\bi_\bd() const { return (_faceSize > 0); }\n-82\n-_\b8_\b4 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn() : _type(0), _uDim(0), _faceSize(0) { }\n-85\n-_\b8_\b6 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const &) = default;\n-_\b8_\b7 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const &) = default;\n-_\b8_\b8 _\b~_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn() = default;\n-90\n-92\n-96\n-_\b9_\b8 _\bT_\by_\bp_\be _\bG_\be_\bt_\bT_\by_\bp_\be() const { return (_\bT_\by_\bp_\be) _type; }\n-99\n-_\b1_\b0_\b1 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() const { return _faceSize; }\n+30#include \"../bfr/surfaceFactory.h\"\n+31#include \"../bfr/surfaceFactoryCache.h\"\n+32\n+33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+34namespace OPENSUBDIV_VERSION {\n+35\n+_\b3_\b6namespace Far {\n+37 class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br;\n+38}\n+39\n+40namespace Bfr {\n+41\n+_\b5_\b8class _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be : public _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n+59public:\n+61\n+65\n+_\b6_\b6 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be(_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & mesh,\n+67 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options);\n+68\n+_\b6_\b9 _\b~_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be() override = default;\n+71\n+73\n+77\n+_\b7_\b9 _\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & _\bG_\be_\bt_\bM_\be_\bs_\bh() const { return _mesh; }\n+80\n+_\b8_\b2 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs() const { return _numFaces; }\n+83\n+_\b8_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const { return _numFVarChannels; }\n+87\n+88protected:\n+90 //\n+91 // Virtual overrides to satisfy the SurfaceFactoryMeshAdapter interface:\n+92 //\n+93 bool _\bi_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be( _\bI_\bn_\bd_\be_\bx faceIndex) const override;\n+94 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(_\bI_\bn_\bd_\be_\bx faceIndex) const override;\n+95\n+96 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex,\n+97 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const override;\n+98 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx faceIndex,\n+99 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const override;\n+100\n+101 int _\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(_\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n+102 _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br * vertexDescriptor) const override;\n 103\n-104public:\n-106\n-116\n-118 template \n-_\b1_\b1_\b9 void _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd(int vertexIndex, REAL uvCoord[2]) const;\n+104 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(\n+105 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n+106 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const override;\n+107 int _\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(\n+108 _\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n+109 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const override;\n+110\n+111 // Optional SurfaceFactoryMeshAdapter overrides for regular patches:\n+112 bool _\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n+113 _\bI_\bn_\bd_\be_\bx faceIndex,\n+114 _\bI_\bn_\bd_\be_\bx vertexIndices[]) const override;\n+115\n+116 bool _\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br(\n+117 _\bI_\bn_\bd_\be_\bx faceIndex,\n+118 _\bF_\bV_\ba_\br_\bI_\bD fvarID, _\bI_\bn_\bd_\be_\bx fvarValueIndices[]) const override;\n 120\n-122 template \n-_\b1_\b2_\b3 void _\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd(int edgeIndex, REAL t, REAL uvCoord[2]) const;\n-124\n-126 template \n-_\b1_\b2_\b7 void _\bG_\be_\bt_\bC_\be_\bn_\bt_\be_\br_\bC_\bo_\bo_\br_\bd(REAL uvCoord[2]) const;\n+121private:\n+122 //\n+123 // Internal supporting methods:\n+124 //\n+125 int getFaceVaryingChannel(_\bF_\bV_\ba_\br_\bI_\bD fvarID) const;\n+126\n+127 int getFaceVertexPointIndices(_\bI_\bn_\bd_\be_\bx faceIndex, int faceVertex,\n+128 _\bI_\bn_\bd_\be_\bx indices[], int vtxOrFVarChannel) const;\n 129\n-130public:\n+130 int getFacePatchPointIndices(_\bI_\bn_\bd_\be_\bx faceIndex,\n+131 _\bI_\bn_\bd_\be_\bx indices[], int vtxOrFVarChannel) const;\n 132\n-147\n-149 bool _\bH_\ba_\bs_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bs() const;\n-150\n-152 template \n-153 int _\bG_\be_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be(REAL const uvCoord[2]) const;\n-154\n-157 template \n-158 int _\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bS_\bu_\bb_\bF_\ba_\bc_\be(\n-159 REAL const uvCoord[2], REAL subFaceCoord[2]) const;\n-160\n-162 template \n-163 void _\bC_\bo_\bn_\bv_\be_\br_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd(int subFace,\n-164 REAL const subFaceCoord[2], REAL uvCoord[2]) const;\n-165\n-168 template \n-169 int _\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be(\n-170 REAL const uvCoord[2], REAL subFaceCoord[2]) const;\n+133private:\n+134 // Additional members for the subclass:\n+135 _\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & _mesh;\n+136\n+137 int _numFaces;\n+138 int _numFVarChannels;\n+139};\n+140\n+141\n+142//\n+156template \n+_\b1_\b5_\b7class _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be {\n+158public:\n+_\b1_\b5_\b9 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by(_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & mesh,\n+160 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs()) :\n+161 _\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be(mesh, options),\n+162 _localCache() {\n+163\n+164 _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bI_\bn_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be(&_localCache);\n+165 }\n+_\b1_\b6_\b6 _\b~_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by() override = default;\n+167\n+168private:\n+169 CACHE_TYPE _localCache;\n+170};\n 171\n-173 template \n-174 void _\bC_\bo_\bn_\bv_\be_\br_\bt_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd(int subFace,\n-175 REAL const subFaceCoord[2], REAL uvCoord[2]) const;\n-177\n-178private:\n-179 template \n-180 int convertCoordToSubFace(bool normalized,\n-181 REAL const uvCoord[2], REAL subFaceCoord[2]) const;\n-182 template \n-183 void convertSubFaceToCoord(bool normalized, int subFace,\n-184 REAL const subFaceCoord[2], REAL uvCoord[2]) const;\n-185\n-186private:\n-187 unsigned char _type;\n-188 unsigned char _uDim;\n-189 unsigned short _faceSize;\n-190};\n-191\n-192//\n-193// Inline sub-face coordinate conversion methods:\n-194//\n-195inline bool\n-_\b1_\b9_\b6_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bH_\ba_\bs_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bs() const {\n-197 return (_type == _\bQ_\bU_\bA_\bD_\b__\bS_\bU_\bB_\bF_\bA_\bC_\bE_\bS);\n-198}\n-199\n-200template \n-201inline int\n-_\b2_\b0_\b2_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be(REAL const uvCoord[2]) const {\n-203\n-204 if (!_\bH_\ba_\bs_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bs()) return 0;\n-205\n-206 int uTile = (int) uvCoord[0];\n-207 int vTile = (int) uvCoord[1];\n-208 return (vTile + ((uvCoord[1] - (REAL) vTile) > 0.75f)) * _uDim +\n-209 (uTile + ((uvCoord[0] - (REAL) uTile) > 0.75f));\n-210}\n-211\n-212// Conversions to unnormalized sub-face coordinates:\n-213template \n-214inline int\n-_\b2_\b1_\b5_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bS_\bu_\bb_\bF_\ba_\bc_\be(\n-216 REAL const uvCoord[2], REAL subCoord[2]) const {\n-217 return convertCoordToSubFace(false, uvCoord, subCoord);\n-218}\n-219template \n-220inline void\n-_\b2_\b2_\b1_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd(\n-222 int subFace, REAL const subCoord[2], REAL uvCoord[2]) const {\n-223 convertSubFaceToCoord(false, subFace, subCoord, uvCoord);\n-224}\n-225\n-226// Conversions to normalized sub-face coordinates:\n-227template \n-228inline int\n-_\b2_\b2_\b9_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be(\n-230 REAL const uvCoord[2], REAL subCoord[2]) const {\n-231 return convertCoordToSubFace(true, uvCoord, subCoord);\n-232}\n-233template \n-234inline void\n-_\b2_\b3_\b5_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd(\n-236 int subFace, REAL const subCoord[2], REAL uvCoord[2]) const {\n-237 convertSubFaceToCoord(true, subFace, subCoord, uvCoord);\n-238}\n-239\n-240} // end namespace Bfr\n-241\n-242} // end namespace OPENSUBDIV_VERSION\n-243using namespace OPENSUBDIV_VERSION;\n-244\n-245} // end namespace OpenSubdiv\n-246\n-247#endif /* OPENSUBDIV3_BFR_PARAMETERIZATION */\n+172} // end namespace Bfr\n+173\n+174} // end namespace OPENSUBDIV_VERSION\n+175using namespace OPENSUBDIV_VERSION;\n+176\n+177} // end namespace OpenSubdiv\n+178\n+179#endif /* OPENSUBDIV3_BFR_REFINER_SURFACE_FACTORY_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n-SchemeType\n-Enumerated type for all subdivision schemes supported by OpenSubdiv.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-Simple class defining the 2D parameterization of a face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be\n-int GetSubFace(REAL const uvCoord[2]) const\n-Returns the integer sub-face containing the given (u,v)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b0_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n-int GetFaceSize() const\n-Returns the size (number of vertices) of the corresponding face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b0_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\by_\bp_\be\n-Type\n-Enumerated type for the different kinds of Parameterizations.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bQ_\bU_\bA_\bD_\b__\bS_\bU_\bB_\bF_\bA_\bC_\bE_\bS\n-@ QUAD_SUBFACES\n-Partitioned into quadrilateral sub-faces.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\bR_\bI\n-@ TRI\n-Triangle.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bQ_\bU_\bA_\bD\n-@ QUAD\n-Quadrilateral.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-Parameterization(Sdc::SchemeType scheme, int faceSize)\n-Primary constructor with subdivision scheme and face size.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bS_\bu_\bb_\bF_\ba_\bc_\be\n-int ConvertCoordToSubFace(REAL const uvCoord[2], REAL subFaceCoord[2]) const\n-Convert (u,v) to a sub-face (return value) and its local (u,v) coordinate.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b1_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bC_\be_\bn_\bt_\be_\br_\bC_\bo_\bo_\br_\bd\n-void GetCenterCoord(REAL uvCoord[2]) const\n-Returns the (u,v) coordinate for the center of the face.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bT_\by_\bp_\be\n-Type GetType() const\n-Returns the type of parameterization assigned.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b~_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-~Parameterization()=default\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-Parameterization(Parameterization const &)=default\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd\n-void GetEdgeCoord(int edgeIndex, REAL t, REAL uvCoord[2]) const\n-Returns the (u,v) coordinate at any point on a given edge.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n-_\bC_\bo_\bn_\bv_\be_\br_\bt_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd\n-void ConvertNormalizedSubFaceToCoord(int subFace, REAL const subFaceCoord[2],\n-REAL uvCoord[2]) const\n-Convert a sub-face and its normalized (u,v) coordinate to (u,v)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b3_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd\n-void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const\n-Returns the (u,v) coordinate of a given vertex.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-Parameterization()\n-Default construction produces an invalid instance.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b8_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n-bool IsValid() const\n-Returns true if correctly initialized.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bH_\ba_\bs_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bs\n-bool HasSubFaces() const\n-Returns if Parameterization has been partitioned into sub-faces.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b9_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:\n-_\bC_\bo_\bn_\bv_\be_\br_\bt_\bC_\bo_\bo_\br_\bd_\bT_\bo_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bd_\bS_\bu_\bb_\bF_\ba_\bc_\be\n-int ConvertCoordToNormalizedSubFace(REAL const uvCoord[2], REAL subFaceCoord\n-[2]) const\n-Convert (u,v) to a sub-face (return value) and its normalized (u,v) coordinate.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b2_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bC_\bo_\bn_\bv_\be_\br_\bt_\bS_\bu_\bb_\bF_\ba_\bc_\be_\bT_\bo_\bC_\bo_\bo_\br_\bd\n-void ConvertSubFaceToCoord(int subFace, REAL const subFaceCoord[2], REAL\n-uvCoord[2]) const\n-Convert a sub-face and its local (u,v) coordinate to (u,v)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-Parameterization & operator=(Parameterization const &)=default\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n+Intermediate subclass of SurfaceFactory with Far::TopologyRefiner as the mesh.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs\n+int GetNumFaces() const\n+Return the number of faces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n+_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+int GetNumFVarChannels() const\n+Return the number of face-varying channels.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:_\bG_\be_\bt_\bM_\be_\bs_\bh\n+Far::TopologyRefiner const & GetMesh() const\n+Return the instance of the mesh.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n+_\b~_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n+~RefinerSurfaceFactoryBase() override=default\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n+_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n+RefinerSurfaceFactoryBase(Far::TopologyRefiner const &mesh, Options const\n+&options)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Template for concrete subclasses of RefinerSurfaceFactoryBase.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\b~_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+~RefinerSurfaceFactory() override=default\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bR_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+RefinerSurfaceFactory(Far::TopologyRefiner const &mesh, Options const\n+&options=Options())\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Base class providing initialization of a Surface for each face of a mesh.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b0_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bI_\bn_\bt_\be_\br_\bn_\ba_\bl_\bC_\ba_\bc_\bh_\be\n+void setInternalCache(SurfaceFactoryCache *cache)\n+Subclass to identify an internal cache for use by base class.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Simple set of options assigned to instances of SurfaceFactory.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+virtual int getFaceVertexIncidentFaceFVarValueIndices(Index faceIndex, int\n+faceVertex, FVarID fvarID, Index fvarValueIndices[]) const =0\n+Gather face-varying indices of incident faces around a face-vertex.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+virtual int getFaceVertexIncidentFaceVertexIndices(Index faceIndex, int\n+faceVertex, Index vertexIndices[]) const =0\n+Gather vertex indices of incident faces around a face-vertex.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bg_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n+virtual int getFaceSize(Index faceIndex) const =0\n+Returns the size of a face (number of vertices)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+int Index\n+Integer type representing a mesh index.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+virtual int populateFaceVertexDescriptor(Index faceIndex, int faceVertex,\n+VertexDescriptor *vertexDescriptor) const =0\n+Describe the topology of incident faces around a face-vertex.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br\n+virtual bool getFaceNeighborhoodVertexIndicesIfRegular(Index faceIndex, Index\n+vertexIndices[]) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b2_\b1_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bI_\bf_\bR_\be_\bg_\bu_\bl_\ba_\br\n+virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular(Index faceIndex,\n+FVarID fvarID, Index fvarValueIndices[]) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b2_\b2_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+virtual int getFaceFVarValueIndices(Index faceIndex, FVarID fvarID, Index\n+fvarValueIndices[]) const =0\n+Gather the face-varying indices of the face's vertices.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:\n+_\bg_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+virtual int getFaceVertexIndices(Index faceIndex, Index vertexIndices[]) const\n+=0\n+Gather the indices of the face's vertices.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bi_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be\n+virtual bool isFaceHole(Index faceIndex) const =0\n+Returns if a face is a hole.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b:_\b:_\bF_\bV_\ba_\br_\bI_\bD\n+std::intptr_t FVarID\n+Type used to identify and specify face-varying primvars.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bM_\be_\bs_\bh_\bA_\bd_\ba_\bp_\bt_\be_\br_\b._\bh_\b:_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+Simple class used by subclasses of SurfaceFactory to describe a vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n+Stores topology data for a specified set of refinement options.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh\n+ * _\br_\be_\bf_\bi_\bn_\be_\br_\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00704_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00704_source.html", "unified_diff": "@@ -351,15 +351,15 @@\n
306using namespace OPENSUBDIV_VERSION;
\n
307} // end namespace OpenSubdiv
\n
308
\n
309#endif /* OPENSUBDIV3_FAR_TOPOLOGY_REFINER_H */
\n \n
Vtr::ConstIndexArray ConstIndexArray
Definition types.h:47
\n
SchemeType
Enumerated type for all subdivision schemes supported by OpenSubdiv.
Definition types.h:37
\n-
Applies refinement operations to generic primvar data.
\n+
Applies refinement operations to generic primvar data.
\n
Object used to compute and query ptex face indices.
Definition ptexIndices.h:46
\n
An interface for accessing data in a specific level of a refined topology hierarchy.
\n
Factory for constructing TopologyRefiners from specific mesh classes.
\n
Stores topology data for a specified set of refinement options.
\n
TopologyRefiner(TopologyRefiner const &source)
\n
int GetMaxValence() const
Returns the maximum vertex valence in all levels.
\n
Vtr::internal::Level const & getLevel(int l) const
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00713.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00713.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/stencilTableFactory.h File Reference\n+OpenSubdiv: opensubdiv/far/topologyDescriptor.h File Reference\n \n \n \n \n \n \n \n@@ -90,43 +90,31 @@\n \n \n \n
\n \n-
stencilTableFactory.h File Reference
\n+
topologyDescriptor.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/patchTable.h"
\n-#include <vector>
\n+#include "../far/topologyRefiner.h"
\n+#include "../far/topologyRefinerFactory.h"
\n+#include "../far/error.h"
\n+#include <cassert>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n \n

\n Classes

class  StencilTableFactoryReal< REAL >
 A specialized factory for StencilTable. More...
struct  TopologyDescriptor
 A simple reference to raw topology data for use with TopologyRefinerFactory. More...
 
struct  StencilTableFactoryReal< REAL >::Options
 
class  LimitStencilTableFactoryReal< REAL >
 A specialized factory for LimitStencilTable. More...
 
struct  LimitStencilTableFactoryReal< REAL >::Options
 
struct  LimitStencilTableFactoryReal< REAL >::LocationArray
 Descriptor for limit surface locations. More...
 
class  StencilTableFactory
 Stencil table factory class wrapping the template for compatibility. More...
 
class  LimitStencilTableFactory
 Stencil table factory class wrapping the template for compatibility. More...
struct  TopologyDescriptor::FVarChannel
 
\n \n \n \n \n@@ -135,13 +123,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,43 +1,30 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-stencilTableFactory.h File Reference\n+topologyDescriptor.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 A specialized factory for _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+\u00a0 A simple reference to raw topology data for use with\n+ _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0\n- class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 A specialized factory for _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0\n-struct \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n-\u00a0 Descriptor for limit surface locations. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table factory class wrapping the template for compatibility.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table factory class wrapping the template for compatibility.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00713.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00713.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,4 @@\n var a00713 = [\n- [\"StencilTableFactoryReal< REAL >\", \"a01037.html\", \"a01037\"],\n- [\"Options\", \"a01077.html\", \"a01077\"],\n- [\"LimitStencilTableFactoryReal< REAL >\", \"a01041.html\", \"a01041\"],\n- [\"Options\", \"a01081.html\", \"a01081\"],\n- [\"LocationArray\", \"a01085.html\", \"a01085\"],\n- [\"StencilTableFactory\", \"a01089.html\", null],\n- [\"LimitStencilTableFactory\", \"a01093.html\", null]\n+ [\"TopologyDescriptor\", \"a01097.html\", \"a01097\"],\n+ [\"FVarChannel\", \"a01101.html\", \"a01101\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00713_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00713_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/stencilTableFactory.h Source File\n+OpenSubdiv: opensubdiv/far/topologyDescriptor.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
stencilTableFactory.h
\n+
topologyDescriptor.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2014 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,358 +118,146 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24
\n-
25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n-
26#define OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n-
27
\n-
28#include "../version.h"
\n-
29
\n-
30#include "../far/patchTable.h"
\n-
31
\n-
32#include <vector>
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Far {
\n-
38
\n-
39class TopologyRefiner;
\n-
40
\n-
41template <typename REAL> class StencilReal;
\n-
42template <typename REAL> class StencilTableReal;
\n-
43
\n-
44template <typename REAL> class LimitStencilReal;
\n-
45template <typename REAL> class LimitStencilTableReal;
\n-
46
\n-
47
\n-
50template <typename REAL>
\n-
\n-\n-
52
\n-
53public:
\n-
54
\n-\n+
24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H
\n+
25#define OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H
\n+
26
\n+
27#include "../version.h"
\n+
28
\n+
29#include "../far/topologyRefiner.h"
\n+
30#include "../far/topologyRefinerFactory.h"
\n+
31#include "../far/error.h"
\n+
32
\n+
33#include <cassert>
\n+
34
\n+
35namespace OpenSubdiv {
\n+
36namespace OPENSUBDIV_VERSION {
\n+
37
\n+
38namespace Far {
\n+
39
\n+
\n+\n+
50
\n+\n+\n+
53
\n+
54 int const * numVertsPerFace;
\n+\n+
56
\n+\n+\n+
59 float const * creaseWeights;
\n
60
\n-
\n-
61 struct Options {
\n-
62
\n-\n-
70
\n-
71 unsigned int interpolationMode : 2,
\n-\n-\n-\n-\n-\n-
79 unsigned int fvarChannel;
\n-
81 };
\n-
\n-
82
\n-\n-
95 TopologyRefiner const & refiner, Options options = Options());
\n-
96
\n-
97
\n-\n-
111 int numTables, StencilTableReal<REAL> const ** tables);
\n-
112
\n+\n+\n+
63 float const * cornerWeights;
\n+
64
\n+\n+\n+
67
\n+\n+
69
\n+
70 // Face-varying data channel -- value indices correspond to vertex indices,
\n+
71 // i.e. one for every vertex of every face:
\n+
72 //
\n+
\n+
73 struct FVarChannel {
\n+
74
\n+\n+\n+
77
\n+\n+
79 };
\n+
\n+
80
\n+\n+\n+
83
\n+\n+
85};
\n+
\n+
86
\n+
87
\n+
88//
\n+
89// Forward declarations of required TopologyRefinerFactory<TopologyDescriptor>
\n+
90// specializations (defined internally):
\n+
91//
\n+
92// @cond EXCLUDE_DOXYGEN
\n+
93
\n+
94template <>
\n+
95bool
\n+\n+
97 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n+
98
\n+
99template <>
\n+
100bool
\n+\n+
102 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n+
103
\n+
104template <>
\n+
105bool
\n+\n+
107 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n+
108
\n+
109template <>
\n+
110bool
\n+\n+
112 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n
113
\n-\n-
129 TopologyRefiner const &refiner,
\n-
130 StencilTableReal<REAL> const *baseStencilTable,
\n-
131 StencilTableReal<REAL> const *localPointStencilTable,
\n-
132 bool factorize = true);
\n-
133
\n-
\n-\n-
149 TopologyRefiner const &refiner,
\n-
150 StencilTableReal<REAL> const *baseStencilTable,
\n-
151 StencilTableReal<REAL> const *localPointStencilTable,
\n-
152 bool factorize = true) {
\n-\n-
154 refiner, baseStencilTable, localPointStencilTable, factorize);
\n-
155 }
\n-
\n-
156
\n-\n-
175 TopologyRefiner const &refiner,
\n-
176 StencilTableReal<REAL> const *baseStencilTable,
\n-
177 StencilTableReal<REAL> const *localPointStencilTable,
\n-
178 int channel = 0,
\n-
179 bool factorize = true);
\n-
180
\n-
181private:
\n-
182
\n-
183 // Generate stencils for the coarse control-vertices (single weight = 1.0f)
\n-
184 static void generateControlVertStencils(
\n-
185 int numControlVerts,
\n-
186 StencilReal<REAL> & dst);
\n-
187
\n-
188 // Internal method to splice local point stencils
\n-
189 static StencilTableReal<REAL> const * appendLocalPointStencilTable(
\n-
190 TopologyRefiner const &refiner,
\n-
191 StencilTableReal<REAL> const * baseStencilTable,
\n-
192 StencilTableReal<REAL> const * localPointStencilTable,
\n-
193 int channel,
\n-
194 bool factorize);
\n-
195};
\n-
\n-
196
\n-
208template <typename REAL>
\n-
\n-\n-
210
\n-
211public:
\n-
212
\n-\n-
218
\n-
\n-
219 struct Options {
\n-
220
\n-\n-
225
\n-
226 unsigned int interpolationMode : 2,
\n-\n-\n-
229 unsigned int fvarChannel;
\n-
230 };
\n-
\n-
231
\n-
\n-\n-
234
\n-
235 LocationArray() : ptexIdx(-1), numLocations(0), s(0), t(0) { }
\n-
236
\n-\n-\n-
239
\n-
240 REAL const * s,
\n-
241 * t;
\n-
242 };
\n-
\n-
243
\n-
244 typedef std::vector<LocationArray> LocationArrayVec;
\n-
245
\n-\n-
270 TopologyRefiner const & refiner,
\n-
271 LocationArrayVec const & locationArrays,
\n-
272 StencilTableReal<REAL> const * cvStencils = 0,
\n-
273 PatchTable const * patchTable = 0,
\n-
274 Options options = Options());
\n-
275
\n-
276};
\n-
\n-
277
\n-
278
\n-
279//
\n-
280// Public wrapper classes for the templates
\n-
281//
\n-
282class Stencil;
\n-
283class StencilTable;
\n-
284
\n-
\n-\n-
288private:
\n-\n-\n-
291
\n-
292public:
\n-
\n-
293 static StencilTable const * Create(
\n-
294 TopologyRefiner const & refiner, Options options = Options()) {
\n-
295
\n-
296 return static_cast<StencilTable const *>(
\n-
297 BaseFactory::Create(refiner, options));
\n-
298 }
\n-
\n-
299
\n-
\n-
300 static StencilTable const * Create(
\n-
301 int numTables, StencilTable const ** tables) {
\n-
302
\n-
303 return static_cast<StencilTable const *>(
\n-
304 BaseFactory::Create(numTables,
\n-
305 reinterpret_cast<BaseTable const **>(tables)));
\n-
306 }
\n-
\n-
307
\n-
\n-\n-
309 TopologyRefiner const &refiner,
\n-
310 StencilTable const *baseStencilTable,
\n-
311 StencilTable const *localPointStencilTable,
\n-
312 bool factorize = true) {
\n-
313
\n-
314 return static_cast<StencilTable const *>(
\n-\n-
316 static_cast<BaseTable const *>(baseStencilTable),
\n-
317 static_cast<BaseTable const *>(localPointStencilTable),
\n-
318 factorize));
\n-
319 }
\n-
\n-
320
\n-
\n-\n-
322 TopologyRefiner const &refiner,
\n-
323 StencilTable const *baseStencilTable,
\n-
324 StencilTable const *localPointStencilTable,
\n-
325 bool factorize = true) {
\n-
326
\n-
327 return static_cast<StencilTable const *>(
\n-\n-
329 static_cast<BaseTable const *>(baseStencilTable),
\n-
330 static_cast<BaseTable const *>(localPointStencilTable),
\n-
331 factorize));
\n-
332 }
\n-
\n-
333
\n-
\n-\n-
335 TopologyRefiner const &refiner,
\n-
336 StencilTable const *baseStencilTable,
\n-
337 StencilTable const *localPointStencilTable,
\n-
338 int channel = 0,
\n-
339 bool factorize = true) {
\n-
340
\n-
341 return static_cast<StencilTable const *>(
\n-\n-
343 static_cast<BaseTable const *>(baseStencilTable),
\n-
344 static_cast<BaseTable const *>(localPointStencilTable),
\n-
345 channel, factorize));
\n-
346 }
\n-
\n-
347};
\n-
\n-
348
\n-
349class LimitStencil;
\n-
350class LimitStencilTable;
\n-
351
\n-
\n-\n-
355private:
\n-\n-\n-
358
\n-
359public:
\n-
\n-
360 static LimitStencilTable const * Create(
\n-
361 TopologyRefiner const & refiner,
\n-
362 LocationArrayVec const & locationArrays,
\n-
363 StencilTable const * cvStencils = 0,
\n-
364 PatchTable const * patchTable = 0,
\n-
365 Options options = Options()) {
\n-
366
\n-
367 return static_cast<LimitStencilTable const *>(
\n-\n-
369 refiner,
\n-
370 locationArrays,
\n-
371 static_cast<BaseTable const *>(cvStencils),
\n-
372 patchTable,
\n-
373 options));
\n-
374 }
\n-
\n-
375};
\n-
\n-
376
\n-
377} // end namespace Far
\n-
378
\n-
379} // end namespace OPENSUBDIV_VERSION
\n-
380using namespace OPENSUBDIV_VERSION;
\n-
381
\n-
382} // end namespace OpenSubdiv
\n-
383
\n-
384#endif // OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n+
114template <>
\n+
115void
\n+\n+
117 TopologyError errCode, char const * msg, TopologyDescriptor const & desc);
\n+
118
\n+
119// @endcond
\n+
120
\n+
121} // end namespace Far
\n+
122
\n+
123} // end namespace OPENSUBDIV_VERSION
\n+
124using namespace OPENSUBDIV_VERSION;
\n+
125} // end namespace OpenSubdiv
\n+
126
\n+
127#endif /* OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H */
\n \n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-\n-
static StencilTableReal< REAL > const * Create(TopologyRefiner const &refiner, Options options=Options())
Instantiates StencilTable from TopologyRefiner that have been refined uniformly or adaptively.
\n-
static StencilTableReal< REAL > const * AppendLocalPointStencilTableFaceVarying(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, int channel=0, bool factorize=true)
Utility function for stencil splicing for local point face-varying stencils.
\n-\n-\n-\n-\n-
static StencilTableReal< REAL > const * AppendLocalPointStencilTableVarying(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool factorize=true)
Utility function for stencil splicing for local point varying stencils.
\n-
static StencilTableReal< REAL > const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool factorize=true)
Utility function for stencil splicing for local point stencils.
\n-
static StencilTableReal< REAL > const * Create(int numTables, StencilTableReal< REAL > const **tables)
Instantiates StencilTable by concatenating an array of existing stencil tables.
\n-\n-\n-\n-\n-\n-\n-
static LimitStencilTableReal< REAL > const * Create(TopologyRefiner const &refiner, LocationArrayVec const &locationArrays, StencilTableReal< REAL > const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())
Instantiates LimitStencilTable from a TopologyRefiner that has been refined either uniformly or adapt...
\n-\n-
Vertex stencil class wrapping the template for compatibility.
\n-\n-
Stencil table class wrapping the template for compatibility.
\n-\n-
Limit stencil table class wrapping the template for compatibility.
\n-\n-\n-\n-\n-
unsigned int generateIntermediateLevels
vertices at all levels or highest only
\n-
unsigned int generateControlVerts
generate stencils for control-vertices
\n-\n-\n-\n-\n-\n-\n-\n-
unsigned int generate2ndDerivatives
Generate weights for 2nd derivatives.
\n-
unsigned int generate1stDerivatives
Generate weights for 1st derivatives.
\n-\n-\n-\n-\n-\n-\n-
Stencil table factory class wrapping the template for compatibility.
\n-
static StencilTable const * AppendLocalPointStencilTableVarying(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n-
static StencilTable const * Create(TopologyRefiner const &refiner, Options options=Options())
\n-
static StencilTable const * AppendLocalPointStencilTableFaceVarying(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, int channel=0, bool factorize=true)
\n-
static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n-
static StencilTable const * Create(int numTables, StencilTable const **tables)
\n-
Stencil table factory class wrapping the template for compatibility.
\n-
static LimitStencilTable const * Create(TopologyRefiner const &refiner, LocationArrayVec const &locationArrays, StencilTable const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())
\n+\n+
A simple reference to raw topology data for use with TopologyRefinerFactory.
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the relationships between vertices, faces, etc. ie the face-vertices, vertex-faces,...
\n+
static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH const &mesh)
(Optional) Control run-time topology validation and error reporting
\n+
static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify edge or vertex sharpness or face holes
\n+
static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the number of vertices, faces, face-vertices, etc.
\n+
static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify face-varying data per face
\n
Stores topology data for a specified set of refinement options.
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-stencilTableFactory.h\n+topologyDescriptor.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2014 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,498 +23,208 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24\n-25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n-26#define OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n-27\n-28#include \"../version.h\"\n-29\n-30#include \"../far/patchTable.h\"\n-31\n-32#include \n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Far {\n-38\n-39class TopologyRefiner;\n-40\n-41template class StencilReal;\n-42template class StencilTableReal;\n-43\n-44template class LimitStencilReal;\n-45template class LimitStencilTableReal;\n-46\n-47\n-50template \n-_\b5_\b1class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n-52\n-53public:\n-54\n-_\b5_\b5 enum _\bM_\bo_\bd_\be {\n-_\b5_\b6 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX=0,\n-_\b5_\b7 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG,\n-58 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-_\b5_\b9 };\n+24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H\n+25#define OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H\n+26\n+27#include \"../version.h\"\n+28\n+29#include \"../far/topologyRefiner.h\"\n+30#include \"../far/topologyRefinerFactory.h\"\n+31#include \"../far/error.h\"\n+32\n+33#include \n+34\n+35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+36namespace OPENSUBDIV_VERSION {\n+37\n+38namespace Far {\n+39\n+_\b4_\b9struct _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n+50\n+_\b5_\b1 int _\bn_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs,\n+_\b5_\b2 _\bn_\bu_\bm_\bF_\ba_\bc_\be_\bs;\n+53\n+_\b5_\b4 int const * _\bn_\bu_\bm_\bV_\be_\br_\bt_\bs_\bP_\be_\br_\bF_\ba_\bc_\be;\n+_\b5_\b5 _\bI_\bn_\bd_\be_\bx const * _\bv_\be_\br_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bP_\be_\br_\bF_\ba_\bc_\be;\n+56\n+_\b5_\b7 int _\bn_\bu_\bm_\bC_\br_\be_\ba_\bs_\be_\bs;\n+_\b5_\b8 _\bI_\bn_\bd_\be_\bx const * _\bc_\br_\be_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\be_\bx_\bP_\ba_\bi_\br_\bs;\n+_\b5_\b9 float const * _\bc_\br_\be_\ba_\bs_\be_\bW_\be_\bi_\bg_\bh_\bt_\bs;\n 60\n-_\b6_\b1 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n-62\n-_\b6_\b3 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be(_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX),\n-64 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs(false),\n-65 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs(false),\n-66 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs(true),\n-67 _\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs(true),\n-68 _\bm_\ba_\bx_\bL_\be_\bv_\be_\bl(10),\n-69 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(0) { }\n-70\n-_\b7_\b1 unsigned int _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be : 2,\n-_\b7_\b2 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs : 1,\n-_\b7_\b3 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs : 1,\n-_\b7_\b4 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs : 1,\n-_\b7_\b5 _\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs : 1,\n-_\b7_\b8 _\bm_\ba_\bx_\bL_\be_\bv_\be_\bl : 4;\n-_\b7_\b9 unsigned int _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl;\n-81 };\n-82\n-_\b9_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n-95 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner, _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n-96\n-97\n-_\b1_\b1_\b0 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n-111 int numTables, _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const ** tables);\n-112\n+_\b6_\b1 int _\bn_\bu_\bm_\bC_\bo_\br_\bn_\be_\br_\bs;\n+_\b6_\b2 _\bI_\bn_\bd_\be_\bx const * _\bc_\bo_\br_\bn_\be_\br_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n+_\b6_\b3 float const * _\bc_\bo_\br_\bn_\be_\br_\bW_\be_\bi_\bg_\bh_\bt_\bs;\n+64\n+_\b6_\b5 int _\bn_\bu_\bm_\bH_\bo_\bl_\be_\bs;\n+_\b6_\b6 _\bI_\bn_\bd_\be_\bx const * _\bh_\bo_\bl_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n+67\n+_\b6_\b8 bool _\bi_\bs_\bL_\be_\bf_\bt_\bH_\ba_\bn_\bd_\be_\bd;\n+69\n+70 // Face-varying data channel -- value indices correspond to vertex indices,\n+71 // i.e. one for every vertex of every face:\n+72 //\n+_\b7_\b3 struct _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl {\n+74\n+_\b7_\b5 int _\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs;\n+_\b7_\b6 _\bI_\bn_\bd_\be_\bx const * _\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n+77\n+_\b7_\b8 _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl() : _\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs(0), _\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(0) { }\n+79 };\n+80\n+_\b8_\b1 int _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n+_\b8_\b2 _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl const * _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n+83\n+_\b8_\b4 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br();\n+85};\n+86\n+87\n+88//\n+89// Forward declarations of required\n+TopologyRefinerFactory\n+90// specializations (defined internally):\n+91//\n+92// @cond EXCLUDE_DOXYGEN\n+93\n+94template <>\n+95bool\n+96_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n+97 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+98\n+99template <>\n+100bool\n+101_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n+102 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+103\n+104template <>\n+105bool\n+106_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs(\n+107 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+108\n+109template <>\n+110bool\n+111_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n+112 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n 113\n-_\b1_\b2_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n-129 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-130 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n-131 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n-132 bool factorize = true);\n-133\n-_\b1_\b4_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-149 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-150 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n-151 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n-152 bool factorize = true) {\n-153 return _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n-154 refiner, baseStencilTable, localPointStencilTable, factorize);\n-155 }\n-156\n-_\b1_\b7_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-175 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-176 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n-177 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n-178 int channel = 0,\n-179 bool factorize = true);\n-180\n-181private:\n-182\n-183 // Generate stencils for the coarse control-vertices (single weight = 1.0f)\n-184 static void generateControlVertStencils(\n-185 int numControlVerts,\n-186 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> & dst);\n-187\n-188 // Internal method to splice local point stencils\n-189 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * appendLocalPointStencilTable(\n-190 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-191 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * baseStencilTable,\n-192 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * localPointStencilTable,\n-193 int channel,\n-194 bool factorize);\n-195};\n-196\n-208template \n-_\b2_\b0_\b9class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n-210\n-211public:\n-212\n-_\b2_\b1_\b3 enum _\bM_\bo_\bd_\be {\n-_\b2_\b1_\b4 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX=0,\n-_\b2_\b1_\b5 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG,\n-216 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-_\b2_\b1_\b7 };\n-218\n-_\b2_\b1_\b9 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n-220\n-_\b2_\b2_\b1 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be(_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX),\n-222 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs(true),\n-223 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs(false),\n-224 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(0) { }\n-225\n-_\b2_\b2_\b6 unsigned int _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be : 2,\n-_\b2_\b2_\b7 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs : 1,\n-_\b2_\b2_\b8 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs : 1;\n-_\b2_\b2_\b9 unsigned int _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl;\n-230 };\n-231\n-_\b2_\b3_\b3 struct _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by {\n-234\n-_\b2_\b3_\b5 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by() : _\bp_\bt_\be_\bx_\bI_\bd_\bx(-1), _\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs(0), _\bs(0), _\bt(0) { }\n-236\n-_\b2_\b3_\b7 int _\bp_\bt_\be_\bx_\bI_\bd_\bx,\n-_\b2_\b3_\b8 _\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs;\n-239\n-_\b2_\b4_\b0 REAL const * _\bs,\n-_\b2_\b4_\b1 * _\bt;\n-242 };\n-243\n-_\b2_\b4_\b4 typedef std::vector _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc;\n-245\n-_\b2_\b6_\b9 static _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n-270 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n-271 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc const & locationArrays,\n-272 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * cvStencils = 0,\n-273 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const * patchTable = 0,\n-274 _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n-275\n-276};\n-277\n-278\n-279//\n-280// Public wrapper classes for the templates\n-281//\n-282class _\bS_\bt_\be_\bn_\bc_\bi_\bl;\n-283class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be;\n-284\n-_\b2_\b8_\b7class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n-288private:\n-289 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n-290 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n-291\n-292public:\n-_\b2_\b9_\b3 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n-294 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner, Options options = Options()) {\n-295\n-296 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-297 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(refiner, options));\n-298 }\n-299\n-_\b3_\b0_\b0 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n-301 int numTables, _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const ** tables) {\n-302\n-303 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-304 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(numTables,\n-305 reinterpret_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const **>(tables)));\n-306 }\n-307\n-_\b3_\b0_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n-309 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-310 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n-311 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n-312 bool factorize = true) {\n-313\n-314 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-315 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(refiner,\n-316 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n-317 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n-318 factorize));\n-319 }\n-320\n-_\b3_\b2_\b1 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-322 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-323 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n-324 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n-325 bool factorize = true) {\n-326\n-327 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-328 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(refiner,\n-329 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n-330 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n-331 factorize));\n-332 }\n-333\n-_\b3_\b3_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-335 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-336 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n-337 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n-338 int channel = 0,\n-339 bool factorize = true) {\n-340\n-341 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-342 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(refiner,\n-343 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n-344 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n-345 channel, factorize));\n-346 }\n-347};\n-348\n-349class LimitStencil;\n-350class LimitStencilTable;\n-351\n-_\b3_\b5_\b4class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n-{\n-355private:\n-356 typedef _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n-357 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n-358\n-359public:\n-_\b3_\b6_\b0 static _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n-361 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n-362 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc const & locationArrays,\n-363 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * cvStencils = 0,\n-364 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const * patchTable = 0,\n-365 Options options = Options()) {\n-366\n-367 return static_cast<_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-368 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(\n-369 refiner,\n-370 locationArrays,\n-371 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(cvStencils),\n-372 patchTable,\n-373 options));\n-374 }\n-375};\n-376\n-377} // end namespace Far\n-378\n-379} // end namespace OPENSUBDIV_VERSION\n-380using namespace OPENSUBDIV_VERSION;\n-381\n-382} // end namespace OpenSubdiv\n-383\n-384#endif // OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n+114template <>\n+115void\n+116_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n+117 TopologyError errCode, char const * msg, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+118\n+119// @endcond\n+120\n+121} // end namespace Far\n+122\n+123} // end namespace OPENSUBDIV_VERSION\n+124using namespace OPENSUBDIV_VERSION;\n+125} // end namespace OpenSubdiv\n+126\n+127#endif /* OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-Container for arrays of parametric patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n-A specialized factory for StencilTable.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static StencilTableReal< REAL > const * Create(TopologyRefiner const &refiner,\n-Options options=Options())\n-Instantiates StencilTable from TopologyRefiner that have been refined uniformly\n-or adaptively.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static StencilTableReal< REAL > const * AppendLocalPointStencilTableFaceVarying\n-(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n-*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, int\n-channel=0, bool factorize=true)\n-Utility function for stencil splicing for local point face-varying stencils.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bM_\bo_\bd_\be\n-Mode\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-@ INTERPOLATE_FACE_VARYING\n-face-varying primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-@ INTERPOLATE_VARYING\n-varying primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX\n-@ INTERPOLATE_VERTEX\n-vertex primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static StencilTableReal< REAL > const * AppendLocalPointStencilTableVarying\n-(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n-*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool\n-factorize=true)\n-Utility function for stencil splicing for local point varying stencils.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-static StencilTableReal< REAL > const * AppendLocalPointStencilTable\n-(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n-*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool\n-factorize=true)\n-Utility function for stencil splicing for local point stencils.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static StencilTableReal< REAL > const * Create(int numTables, StencilTableReal<\n-REAL > const **tables)\n-Instantiates StencilTable by concatenating an array of existing stencil tables.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n-A specialized factory for LimitStencilTable.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bM_\bo_\bd_\be\n-Mode\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-@ INTERPOLATE_FACE_VARYING\n-face-varying primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-@ INTERPOLATE_VARYING\n-varying primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX\n-@ INTERPOLATE_VERTEX\n-vertex primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc\n-std::vector< LocationArray > LocationArrayVec\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static LimitStencilTableReal< REAL > const * Create(TopologyRefiner const\n-&refiner, LocationArrayVec const &locationArrays, StencilTableReal< REAL >\n-const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())\n-Instantiates LimitStencilTable from a TopologyRefiner that has been refined\n-either uniformly or adapt...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n-Vertex stencil descriptor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-Vertex stencil class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n-Table of subdivision stencils.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n-Table of limit subdivision stencils.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b0_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Limit stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs\n-unsigned int factorizeIntermediateLevels\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bm_\ba_\bx_\bL_\be_\bv_\be_\bl\n-unsigned int maxLevel\n-generate stencils up to 'maxLevel'\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Options()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs\n-unsigned int generateIntermediateLevels\n-vertices at all levels or highest only\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs\n-unsigned int generateControlVerts\n-generate stencils for control-vertices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs\n-unsigned int generateOffsets\n-populate optional \"_offsets\" field\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n-unsigned int fvarChannel\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be\n-unsigned int interpolationMode\n-interpolation mode\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Options()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n-unsigned int fvarChannel\n-face-varying channel to use\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be\n-unsigned int interpolationMode\n-interpolation mode\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs\n-unsigned int generate2ndDerivatives\n-Generate weights for 2nd derivatives.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs\n-unsigned int generate1stDerivatives\n-Generate weights for 1st derivatives.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n-Descriptor for limit surface locations.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bt\n-REAL const * t\n-array of v coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bs\n-REAL const * s\n-array of u coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n-LocationArray()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs\n-int numLocations\n-number of (u,v) coordinates in the array\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bp_\bt_\be_\bx_\bI_\bd_\bx\n-int ptexIdx\n-ptex face index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Stencil table factory class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static StencilTable const * AppendLocalPointStencilTableVarying(TopologyRefiner\n-const &refiner, StencilTable const *baseStencilTable, StencilTable const\n-*localPointStencilTable, bool factorize=true)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static StencilTable const * Create(TopologyRefiner const &refiner, Options\n-options=Options())\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static StencilTable const * AppendLocalPointStencilTableFaceVarying\n-(TopologyRefiner const &refiner, StencilTable const *baseStencilTable,\n-StencilTable const *localPointStencilTable, int channel=0, bool factorize=true)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const\n-&refiner, StencilTable const *baseStencilTable, StencilTable const\n-*localPointStencilTable, bool factorize=true)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b0_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static StencilTable const * Create(int numTables, StencilTable const **tables)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Stencil table factory class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static LimitStencilTable const * Create(TopologyRefiner const &refiner,\n-LocationArrayVec const &locationArrays, StencilTable const *cvStencils=0,\n-PatchTable const *patchTable=0, Options options=Options())\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+Vtr::Index Index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+A simple reference to raw topology data for use with TopologyRefinerFactory.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+FVarChannel const * fvarChannels\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int numVertices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+Index const * cornerVertexIndices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bv_\be_\br_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bP_\be_\br_\bF_\ba_\bc_\be\n+Index const * vertIndicesPerFace\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\be_\bx_\bP_\ba_\bi_\br_\bs\n+Index const * creaseVertexIndexPairs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bh_\bo_\bl_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+Index const * holeIndices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bF_\ba_\bc_\be_\bs\n+int numFaces\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bC_\bo_\br_\bn_\be_\br_\bs\n+int numCorners\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+float const * cornerWeights\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bL_\be_\bf_\bt_\bH_\ba_\bn_\bd_\be_\bd\n+bool isLeftHanded\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bV_\be_\br_\bt_\bs_\bP_\be_\br_\bF_\ba_\bc_\be\n+int const * numVertsPerFace\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+TopologyDescriptor()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bs_\be_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+float const * creaseWeights\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bC_\br_\be_\ba_\bs_\be_\bs\n+int numCreases\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bH_\bo_\bl_\be_\bs\n+int numHoles\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+int numFVarChannels\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:\n+_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+FVarChannel()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:\n+_\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+Index const * valueIndices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:_\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs\n+int numValues\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const\n+&mesh)\n+Specify the relationships between vertices, faces, etc. ie the face-vertices,\n+vertex-faces,...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH\n+const &mesh)\n+(Optional) Control run-time topology validation and error reporting\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b0_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs\n+static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)\n+(Optional) Specify edge or vertex sharpness or face holes\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b9_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const\n+&mesh)\n+Specify the number of vertices, faces, face-vertices, etc.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const\n+&mesh)\n+(Optional) Specify face-varying data per face\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b7_\b4\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00716.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00716.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/topologyDescriptor.h File Reference\n+OpenSubdiv: opensubdiv/far/stencilTableFactory.h File Reference\n \n \n \n \n \n \n \n@@ -90,31 +90,43 @@\n \n \n \n
\n \n-
topologyDescriptor.h File Reference
\n+
stencilTableFactory.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/topologyRefiner.h"
\n-#include "../far/topologyRefinerFactory.h"
\n-#include "../far/error.h"
\n-#include <cassert>
\n+#include "../far/patchTable.h"
\n+#include <vector>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

\n Classes

struct  TopologyDescriptor
 A simple reference to raw topology data for use with TopologyRefinerFactory. More...
class  StencilTableFactoryReal< REAL >
 A specialized factory for StencilTable. More...
 
struct  TopologyDescriptor::FVarChannel
struct  StencilTableFactoryReal< REAL >::Options
 
class  LimitStencilTableFactoryReal< REAL >
 A specialized factory for LimitStencilTable. More...
 
struct  LimitStencilTableFactoryReal< REAL >::Options
 
struct  LimitStencilTableFactoryReal< REAL >::LocationArray
 Descriptor for limit surface locations. More...
 
class  StencilTableFactory
 Stencil table factory class wrapping the template for compatibility. More...
 
class  LimitStencilTableFactory
 Stencil table factory class wrapping the template for compatibility. More...
 
\n \n \n \n \n@@ -123,13 +135,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,43 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-topologyDescriptor.h File Reference\n+stencilTableFactory.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-\u00a0 A simple reference to raw topology data for use with\n- _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 A specialized factory for _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+struct \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+\u00a0\n+ class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 A specialized factory for _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+\u00a0\n+struct \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n+\u00a0 Descriptor for limit surface locations. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table factory class wrapping the template for compatibility.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table factory class wrapping the template for compatibility.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00716.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00716.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,9 @@\n var a00716 = [\n- [\"TopologyDescriptor\", \"a01097.html\", \"a01097\"],\n- [\"FVarChannel\", \"a01101.html\", \"a01101\"]\n+ [\"StencilTableFactoryReal< REAL >\", \"a01037.html\", \"a01037\"],\n+ [\"Options\", \"a01077.html\", \"a01077\"],\n+ [\"LimitStencilTableFactoryReal< REAL >\", \"a01041.html\", \"a01041\"],\n+ [\"Options\", \"a01081.html\", \"a01081\"],\n+ [\"LocationArray\", \"a01085.html\", \"a01085\"],\n+ [\"StencilTableFactory\", \"a01089.html\", null],\n+ [\"LimitStencilTableFactory\", \"a01093.html\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00716_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00716_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/topologyDescriptor.h Source File\n+OpenSubdiv: opensubdiv/far/stencilTableFactory.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
topologyDescriptor.h
\n+
stencilTableFactory.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2014 DreamWorks Animation LLC.
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,146 +118,358 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H
\n-
25#define OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H
\n-
26
\n-
27#include "../version.h"
\n-
28
\n-
29#include "../far/topologyRefiner.h"
\n-
30#include "../far/topologyRefinerFactory.h"
\n-
31#include "../far/error.h"
\n-
32
\n-
33#include <cassert>
\n-
34
\n-
35namespace OpenSubdiv {
\n-
36namespace OPENSUBDIV_VERSION {
\n-
37
\n-
38namespace Far {
\n-
39
\n-
\n-\n-
50
\n-\n-\n-
53
\n-
54 int const * numVertsPerFace;
\n-\n-
56
\n-\n-\n-
59 float const * creaseWeights;
\n+
24
\n+
25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n+
26#define OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n+
27
\n+
28#include "../version.h"
\n+
29
\n+
30#include "../far/patchTable.h"
\n+
31
\n+
32#include <vector>
\n+
33
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Far {
\n+
38
\n+
39class TopologyRefiner;
\n+
40
\n+
41template <typename REAL> class StencilReal;
\n+
42template <typename REAL> class StencilTableReal;
\n+
43
\n+
44template <typename REAL> class LimitStencilReal;
\n+
45template <typename REAL> class LimitStencilTableReal;
\n+
46
\n+
47
\n+
50template <typename REAL>
\n+
\n+\n+
52
\n+
53public:
\n+
54
\n+\n
60
\n-\n-\n-
63 float const * cornerWeights;
\n-
64
\n-\n-\n-
67
\n-\n-
69
\n-
70 // Face-varying data channel -- value indices correspond to vertex indices,
\n-
71 // i.e. one for every vertex of every face:
\n-
72 //
\n-
\n-
73 struct FVarChannel {
\n-
74
\n-\n-\n-
77
\n-\n-
79 };
\n-
\n-
80
\n-\n-\n-
83
\n-\n-
85};
\n-
\n-
86
\n-
87
\n-
88//
\n-
89// Forward declarations of required TopologyRefinerFactory<TopologyDescriptor>
\n-
90// specializations (defined internally):
\n-
91//
\n-
92// @cond EXCLUDE_DOXYGEN
\n-
93
\n-
94template <>
\n-
95bool
\n-\n-
97 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n-
98
\n-
99template <>
\n-
100bool
\n-\n-
102 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n-
103
\n-
104template <>
\n-
105bool
\n-\n-
107 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n-
108
\n-
109template <>
\n-
110bool
\n-\n-
112 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n+
\n+
61 struct Options {
\n+
62
\n+\n+
70
\n+
71 unsigned int interpolationMode : 2,
\n+\n+\n+\n+\n+\n+
79 unsigned int fvarChannel;
\n+
81 };
\n+
\n+
82
\n+\n+
95 TopologyRefiner const & refiner, Options options = Options());
\n+
96
\n+
97
\n+\n+
111 int numTables, StencilTableReal<REAL> const ** tables);
\n+
112
\n
113
\n-
114template <>
\n-
115void
\n-\n-
117 TopologyError errCode, char const * msg, TopologyDescriptor const & desc);
\n-
118
\n-
119// @endcond
\n-
120
\n-
121} // end namespace Far
\n-
122
\n-
123} // end namespace OPENSUBDIV_VERSION
\n-
124using namespace OPENSUBDIV_VERSION;
\n-
125} // end namespace OpenSubdiv
\n-
126
\n-
127#endif /* OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H */
\n+\n+
129 TopologyRefiner const &refiner,
\n+
130 StencilTableReal<REAL> const *baseStencilTable,
\n+
131 StencilTableReal<REAL> const *localPointStencilTable,
\n+
132 bool factorize = true);
\n+
133
\n+
\n+\n+
149 TopologyRefiner const &refiner,
\n+
150 StencilTableReal<REAL> const *baseStencilTable,
\n+
151 StencilTableReal<REAL> const *localPointStencilTable,
\n+
152 bool factorize = true) {
\n+\n+
154 refiner, baseStencilTable, localPointStencilTable, factorize);
\n+
155 }
\n+
\n+
156
\n+\n+
175 TopologyRefiner const &refiner,
\n+
176 StencilTableReal<REAL> const *baseStencilTable,
\n+
177 StencilTableReal<REAL> const *localPointStencilTable,
\n+
178 int channel = 0,
\n+
179 bool factorize = true);
\n+
180
\n+
181private:
\n+
182
\n+
183 // Generate stencils for the coarse control-vertices (single weight = 1.0f)
\n+
184 static void generateControlVertStencils(
\n+
185 int numControlVerts,
\n+
186 StencilReal<REAL> & dst);
\n+
187
\n+
188 // Internal method to splice local point stencils
\n+
189 static StencilTableReal<REAL> const * appendLocalPointStencilTable(
\n+
190 TopologyRefiner const &refiner,
\n+
191 StencilTableReal<REAL> const * baseStencilTable,
\n+
192 StencilTableReal<REAL> const * localPointStencilTable,
\n+
193 int channel,
\n+
194 bool factorize);
\n+
195};
\n+
\n+
196
\n+
208template <typename REAL>
\n+
\n+\n+
210
\n+
211public:
\n+
212
\n+\n+
218
\n+
\n+
219 struct Options {
\n+
220
\n+\n+
225
\n+
226 unsigned int interpolationMode : 2,
\n+\n+\n+
229 unsigned int fvarChannel;
\n+
230 };
\n+
\n+
231
\n+
\n+\n+
234
\n+
235 LocationArray() : ptexIdx(-1), numLocations(0), s(0), t(0) { }
\n+
236
\n+\n+\n+
239
\n+
240 REAL const * s,
\n+
241 * t;
\n+
242 };
\n+
\n+
243
\n+
244 typedef std::vector<LocationArray> LocationArrayVec;
\n+
245
\n+\n+
270 TopologyRefiner const & refiner,
\n+
271 LocationArrayVec const & locationArrays,
\n+
272 StencilTableReal<REAL> const * cvStencils = 0,
\n+
273 PatchTable const * patchTable = 0,
\n+
274 Options options = Options());
\n+
275
\n+
276};
\n+
\n+
277
\n+
278
\n+
279//
\n+
280// Public wrapper classes for the templates
\n+
281//
\n+
282class Stencil;
\n+
283class StencilTable;
\n+
284
\n+
\n+\n+
288private:
\n+\n+\n+
291
\n+
292public:
\n+
\n+
293 static StencilTable const * Create(
\n+
294 TopologyRefiner const & refiner, Options options = Options()) {
\n+
295
\n+
296 return static_cast<StencilTable const *>(
\n+
297 BaseFactory::Create(refiner, options));
\n+
298 }
\n+
\n+
299
\n+
\n+
300 static StencilTable const * Create(
\n+
301 int numTables, StencilTable const ** tables) {
\n+
302
\n+
303 return static_cast<StencilTable const *>(
\n+
304 BaseFactory::Create(numTables,
\n+
305 reinterpret_cast<BaseTable const **>(tables)));
\n+
306 }
\n+
\n+
307
\n+
\n+\n+
309 TopologyRefiner const &refiner,
\n+
310 StencilTable const *baseStencilTable,
\n+
311 StencilTable const *localPointStencilTable,
\n+
312 bool factorize = true) {
\n+
313
\n+
314 return static_cast<StencilTable const *>(
\n+\n+
316 static_cast<BaseTable const *>(baseStencilTable),
\n+
317 static_cast<BaseTable const *>(localPointStencilTable),
\n+
318 factorize));
\n+
319 }
\n+
\n+
320
\n+
\n+\n+
322 TopologyRefiner const &refiner,
\n+
323 StencilTable const *baseStencilTable,
\n+
324 StencilTable const *localPointStencilTable,
\n+
325 bool factorize = true) {
\n+
326
\n+
327 return static_cast<StencilTable const *>(
\n+\n+
329 static_cast<BaseTable const *>(baseStencilTable),
\n+
330 static_cast<BaseTable const *>(localPointStencilTable),
\n+
331 factorize));
\n+
332 }
\n+
\n+
333
\n+
\n+\n+
335 TopologyRefiner const &refiner,
\n+
336 StencilTable const *baseStencilTable,
\n+
337 StencilTable const *localPointStencilTable,
\n+
338 int channel = 0,
\n+
339 bool factorize = true) {
\n+
340
\n+
341 return static_cast<StencilTable const *>(
\n+\n+
343 static_cast<BaseTable const *>(baseStencilTable),
\n+
344 static_cast<BaseTable const *>(localPointStencilTable),
\n+
345 channel, factorize));
\n+
346 }
\n+
\n+
347};
\n+
\n+
348
\n+
349class LimitStencil;
\n+
350class LimitStencilTable;
\n+
351
\n+
\n+\n+
355private:
\n+\n+\n+
358
\n+
359public:
\n+
\n+
360 static LimitStencilTable const * Create(
\n+
361 TopologyRefiner const & refiner,
\n+
362 LocationArrayVec const & locationArrays,
\n+
363 StencilTable const * cvStencils = 0,
\n+
364 PatchTable const * patchTable = 0,
\n+
365 Options options = Options()) {
\n+
366
\n+
367 return static_cast<LimitStencilTable const *>(
\n+\n+
369 refiner,
\n+
370 locationArrays,
\n+
371 static_cast<BaseTable const *>(cvStencils),
\n+
372 patchTable,
\n+
373 options));
\n+
374 }
\n+
\n+
375};
\n+
\n+
376
\n+
377} // end namespace Far
\n+
378
\n+
379} // end namespace OPENSUBDIV_VERSION
\n+
380using namespace OPENSUBDIV_VERSION;
\n+
381
\n+
382} // end namespace OpenSubdiv
\n+
383
\n+
384#endif // OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n \n-\n-
A simple reference to raw topology data for use with TopologyRefinerFactory.
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the relationships between vertices, faces, etc. ie the face-vertices, vertex-faces,...
\n-
static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH const &mesh)
(Optional) Control run-time topology validation and error reporting
\n-
static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify edge or vertex sharpness or face holes
\n-
static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the number of vertices, faces, face-vertices, etc.
\n-
static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify face-varying data per face
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+\n+
static StencilTableReal< REAL > const * Create(TopologyRefiner const &refiner, Options options=Options())
Instantiates StencilTable from TopologyRefiner that have been refined uniformly or adaptively.
\n+
static StencilTableReal< REAL > const * AppendLocalPointStencilTableFaceVarying(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, int channel=0, bool factorize=true)
Utility function for stencil splicing for local point face-varying stencils.
\n+\n+\n+\n+\n+
static StencilTableReal< REAL > const * AppendLocalPointStencilTableVarying(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool factorize=true)
Utility function for stencil splicing for local point varying stencils.
\n+
static StencilTableReal< REAL > const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool factorize=true)
Utility function for stencil splicing for local point stencils.
\n+
static StencilTableReal< REAL > const * Create(int numTables, StencilTableReal< REAL > const **tables)
Instantiates StencilTable by concatenating an array of existing stencil tables.
\n+\n+\n+\n+\n+\n+\n+
static LimitStencilTableReal< REAL > const * Create(TopologyRefiner const &refiner, LocationArrayVec const &locationArrays, StencilTableReal< REAL > const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())
Instantiates LimitStencilTable from a TopologyRefiner that has been refined either uniformly or adapt...
\n+\n+
Vertex stencil class wrapping the template for compatibility.
\n+\n+
Stencil table class wrapping the template for compatibility.
\n+\n+
Limit stencil table class wrapping the template for compatibility.
\n+\n+\n+\n+\n+
unsigned int generateIntermediateLevels
vertices at all levels or highest only
\n+
unsigned int generateControlVerts
generate stencils for control-vertices
\n+\n+\n+\n+\n+\n+\n+\n+
unsigned int generate2ndDerivatives
Generate weights for 2nd derivatives.
\n+
unsigned int generate1stDerivatives
Generate weights for 1st derivatives.
\n+\n+\n+\n+\n+\n+\n+
Stencil table factory class wrapping the template for compatibility.
\n+
static StencilTable const * AppendLocalPointStencilTableVarying(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n+
static StencilTable const * Create(TopologyRefiner const &refiner, Options options=Options())
\n+
static StencilTable const * AppendLocalPointStencilTableFaceVarying(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, int channel=0, bool factorize=true)
\n+
static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n+
static StencilTable const * Create(int numTables, StencilTable const **tables)
\n+
Stencil table factory class wrapping the template for compatibility.
\n+
static LimitStencilTable const * Create(TopologyRefiner const &refiner, LocationArrayVec const &locationArrays, StencilTable const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())
\n
Stores topology data for a specified set of refinement options.
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-topologyDescriptor.h\n+stencilTableFactory.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2014 DreamWorks Animation LLC.\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,208 +23,498 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H\n-25#define OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H\n-26\n-27#include \"../version.h\"\n-28\n-29#include \"../far/topologyRefiner.h\"\n-30#include \"../far/topologyRefinerFactory.h\"\n-31#include \"../far/error.h\"\n-32\n-33#include \n-34\n-35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-36namespace OPENSUBDIV_VERSION {\n-37\n-38namespace Far {\n-39\n-_\b4_\b9struct _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n-50\n-_\b5_\b1 int _\bn_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs,\n-_\b5_\b2 _\bn_\bu_\bm_\bF_\ba_\bc_\be_\bs;\n-53\n-_\b5_\b4 int const * _\bn_\bu_\bm_\bV_\be_\br_\bt_\bs_\bP_\be_\br_\bF_\ba_\bc_\be;\n-_\b5_\b5 _\bI_\bn_\bd_\be_\bx const * _\bv_\be_\br_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bP_\be_\br_\bF_\ba_\bc_\be;\n-56\n-_\b5_\b7 int _\bn_\bu_\bm_\bC_\br_\be_\ba_\bs_\be_\bs;\n-_\b5_\b8 _\bI_\bn_\bd_\be_\bx const * _\bc_\br_\be_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\be_\bx_\bP_\ba_\bi_\br_\bs;\n-_\b5_\b9 float const * _\bc_\br_\be_\ba_\bs_\be_\bW_\be_\bi_\bg_\bh_\bt_\bs;\n+24\n+25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n+26#define OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n+27\n+28#include \"../version.h\"\n+29\n+30#include \"../far/patchTable.h\"\n+31\n+32#include \n+33\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Far {\n+38\n+39class TopologyRefiner;\n+40\n+41template class StencilReal;\n+42template class StencilTableReal;\n+43\n+44template class LimitStencilReal;\n+45template class LimitStencilTableReal;\n+46\n+47\n+50template \n+_\b5_\b1class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n+52\n+53public:\n+54\n+_\b5_\b5 enum _\bM_\bo_\bd_\be {\n+_\b5_\b6 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX=0,\n+_\b5_\b7 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG,\n+58 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+_\b5_\b9 };\n 60\n-_\b6_\b1 int _\bn_\bu_\bm_\bC_\bo_\br_\bn_\be_\br_\bs;\n-_\b6_\b2 _\bI_\bn_\bd_\be_\bx const * _\bc_\bo_\br_\bn_\be_\br_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n-_\b6_\b3 float const * _\bc_\bo_\br_\bn_\be_\br_\bW_\be_\bi_\bg_\bh_\bt_\bs;\n-64\n-_\b6_\b5 int _\bn_\bu_\bm_\bH_\bo_\bl_\be_\bs;\n-_\b6_\b6 _\bI_\bn_\bd_\be_\bx const * _\bh_\bo_\bl_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n-67\n-_\b6_\b8 bool _\bi_\bs_\bL_\be_\bf_\bt_\bH_\ba_\bn_\bd_\be_\bd;\n-69\n-70 // Face-varying data channel -- value indices correspond to vertex indices,\n-71 // i.e. one for every vertex of every face:\n-72 //\n-_\b7_\b3 struct _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl {\n-74\n-_\b7_\b5 int _\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs;\n-_\b7_\b6 _\bI_\bn_\bd_\be_\bx const * _\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n-77\n-_\b7_\b8 _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl() : _\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs(0), _\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(0) { }\n-79 };\n-80\n-_\b8_\b1 int _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n-_\b8_\b2 _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl const * _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n-83\n-_\b8_\b4 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br();\n-85};\n-86\n-87\n-88//\n-89// Forward declarations of required\n-TopologyRefinerFactory\n-90// specializations (defined internally):\n-91//\n-92// @cond EXCLUDE_DOXYGEN\n-93\n-94template <>\n-95bool\n-96_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n-97 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n-98\n-99template <>\n-100bool\n-101_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n-102 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n-103\n-104template <>\n-105bool\n-106_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs(\n-107 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n-108\n-109template <>\n-110bool\n-111_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n-112 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+_\b6_\b1 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n+62\n+_\b6_\b3 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be(_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX),\n+64 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs(false),\n+65 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs(false),\n+66 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs(true),\n+67 _\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs(true),\n+68 _\bm_\ba_\bx_\bL_\be_\bv_\be_\bl(10),\n+69 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(0) { }\n+70\n+_\b7_\b1 unsigned int _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be : 2,\n+_\b7_\b2 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs : 1,\n+_\b7_\b3 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs : 1,\n+_\b7_\b4 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs : 1,\n+_\b7_\b5 _\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs : 1,\n+_\b7_\b8 _\bm_\ba_\bx_\bL_\be_\bv_\be_\bl : 4;\n+_\b7_\b9 unsigned int _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl;\n+81 };\n+82\n+_\b9_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n+95 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner, _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n+96\n+97\n+_\b1_\b1_\b0 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n+111 int numTables, _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const ** tables);\n+112\n 113\n-114template <>\n-115void\n-116_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n-117 TopologyError errCode, char const * msg, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n-118\n-119// @endcond\n-120\n-121} // end namespace Far\n-122\n-123} // end namespace OPENSUBDIV_VERSION\n-124using namespace OPENSUBDIV_VERSION;\n-125} // end namespace OpenSubdiv\n-126\n-127#endif /* OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H */\n+_\b1_\b2_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n+129 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+130 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n+131 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n+132 bool factorize = true);\n+133\n+_\b1_\b4_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+149 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+150 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n+151 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n+152 bool factorize = true) {\n+153 return _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n+154 refiner, baseStencilTable, localPointStencilTable, factorize);\n+155 }\n+156\n+_\b1_\b7_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+175 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+176 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n+177 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n+178 int channel = 0,\n+179 bool factorize = true);\n+180\n+181private:\n+182\n+183 // Generate stencils for the coarse control-vertices (single weight = 1.0f)\n+184 static void generateControlVertStencils(\n+185 int numControlVerts,\n+186 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> & dst);\n+187\n+188 // Internal method to splice local point stencils\n+189 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * appendLocalPointStencilTable(\n+190 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+191 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * baseStencilTable,\n+192 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * localPointStencilTable,\n+193 int channel,\n+194 bool factorize);\n+195};\n+196\n+208template \n+_\b2_\b0_\b9class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n+210\n+211public:\n+212\n+_\b2_\b1_\b3 enum _\bM_\bo_\bd_\be {\n+_\b2_\b1_\b4 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX=0,\n+_\b2_\b1_\b5 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG,\n+216 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+_\b2_\b1_\b7 };\n+218\n+_\b2_\b1_\b9 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n+220\n+_\b2_\b2_\b1 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be(_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX),\n+222 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs(true),\n+223 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs(false),\n+224 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(0) { }\n+225\n+_\b2_\b2_\b6 unsigned int _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be : 2,\n+_\b2_\b2_\b7 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs : 1,\n+_\b2_\b2_\b8 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs : 1;\n+_\b2_\b2_\b9 unsigned int _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl;\n+230 };\n+231\n+_\b2_\b3_\b3 struct _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by {\n+234\n+_\b2_\b3_\b5 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by() : _\bp_\bt_\be_\bx_\bI_\bd_\bx(-1), _\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs(0), _\bs(0), _\bt(0) { }\n+236\n+_\b2_\b3_\b7 int _\bp_\bt_\be_\bx_\bI_\bd_\bx,\n+_\b2_\b3_\b8 _\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs;\n+239\n+_\b2_\b4_\b0 REAL const * _\bs,\n+_\b2_\b4_\b1 * _\bt;\n+242 };\n+243\n+_\b2_\b4_\b4 typedef std::vector _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc;\n+245\n+_\b2_\b6_\b9 static _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n+270 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n+271 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc const & locationArrays,\n+272 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * cvStencils = 0,\n+273 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const * patchTable = 0,\n+274 _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n+275\n+276};\n+277\n+278\n+279//\n+280// Public wrapper classes for the templates\n+281//\n+282class _\bS_\bt_\be_\bn_\bc_\bi_\bl;\n+283class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be;\n+284\n+_\b2_\b8_\b7class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n+288private:\n+289 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n+290 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n+291\n+292public:\n+_\b2_\b9_\b3 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n+294 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner, Options options = Options()) {\n+295\n+296 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+297 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(refiner, options));\n+298 }\n+299\n+_\b3_\b0_\b0 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n+301 int numTables, _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const ** tables) {\n+302\n+303 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+304 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(numTables,\n+305 reinterpret_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const **>(tables)));\n+306 }\n+307\n+_\b3_\b0_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n+309 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+310 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n+311 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n+312 bool factorize = true) {\n+313\n+314 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+315 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(refiner,\n+316 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n+317 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n+318 factorize));\n+319 }\n+320\n+_\b3_\b2_\b1 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+322 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+323 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n+324 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n+325 bool factorize = true) {\n+326\n+327 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+328 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(refiner,\n+329 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n+330 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n+331 factorize));\n+332 }\n+333\n+_\b3_\b3_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+335 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+336 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n+337 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n+338 int channel = 0,\n+339 bool factorize = true) {\n+340\n+341 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+342 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(refiner,\n+343 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n+344 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n+345 channel, factorize));\n+346 }\n+347};\n+348\n+349class LimitStencil;\n+350class LimitStencilTable;\n+351\n+_\b3_\b5_\b4class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n+{\n+355private:\n+356 typedef _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n+357 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n+358\n+359public:\n+_\b3_\b6_\b0 static _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n+361 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n+362 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc const & locationArrays,\n+363 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * cvStencils = 0,\n+364 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const * patchTable = 0,\n+365 Options options = Options()) {\n+366\n+367 return static_cast<_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+368 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(\n+369 refiner,\n+370 locationArrays,\n+371 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(cvStencils),\n+372 patchTable,\n+373 options));\n+374 }\n+375};\n+376\n+377} // end namespace Far\n+378\n+379} // end namespace OPENSUBDIV_VERSION\n+380using namespace OPENSUBDIV_VERSION;\n+381\n+382} // end namespace OpenSubdiv\n+383\n+384#endif // OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-Vtr::Index Index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-A simple reference to raw topology data for use with TopologyRefinerFactory.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-FVarChannel const * fvarChannels\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int numVertices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Index const * cornerVertexIndices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bv_\be_\br_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bP_\be_\br_\bF_\ba_\bc_\be\n-Index const * vertIndicesPerFace\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\be_\bx_\bP_\ba_\bi_\br_\bs\n-Index const * creaseVertexIndexPairs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bh_\bo_\bl_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Index const * holeIndices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bF_\ba_\bc_\be_\bs\n-int numFaces\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bC_\bo_\br_\bn_\be_\br_\bs\n-int numCorners\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-float const * cornerWeights\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bL_\be_\bf_\bt_\bH_\ba_\bn_\bd_\be_\bd\n-bool isLeftHanded\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bV_\be_\br_\bt_\bs_\bP_\be_\br_\bF_\ba_\bc_\be\n-int const * numVertsPerFace\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-TopologyDescriptor()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bs_\be_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-float const * creaseWeights\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bC_\br_\be_\ba_\bs_\be_\bs\n-int numCreases\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bH_\bo_\bl_\be_\bs\n-int numHoles\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int numFVarChannels\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:\n-_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n-FVarChannel()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:\n-_\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Index const * valueIndices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:_\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs\n-int numValues\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const\n-&mesh)\n-Specify the relationships between vertices, faces, etc. ie the face-vertices,\n-vertex-faces,...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH\n-const &mesh)\n-(Optional) Control run-time topology validation and error reporting\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b0_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs\n-static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)\n-(Optional) Specify edge or vertex sharpness or face holes\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b9_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const\n-&mesh)\n-Specify the number of vertices, faces, face-vertices, etc.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const\n-&mesh)\n-(Optional) Specify face-varying data per face\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+Container for arrays of parametric patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n+A specialized factory for StencilTable.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static StencilTableReal< REAL > const * Create(TopologyRefiner const &refiner,\n+Options options=Options())\n+Instantiates StencilTable from TopologyRefiner that have been refined uniformly\n+or adaptively.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static StencilTableReal< REAL > const * AppendLocalPointStencilTableFaceVarying\n+(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n+*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, int\n+channel=0, bool factorize=true)\n+Utility function for stencil splicing for local point face-varying stencils.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bM_\bo_\bd_\be\n+Mode\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+@ INTERPOLATE_FACE_VARYING\n+face-varying primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+@ INTERPOLATE_VARYING\n+varying primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX\n+@ INTERPOLATE_VERTEX\n+vertex primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static StencilTableReal< REAL > const * AppendLocalPointStencilTableVarying\n+(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n+*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool\n+factorize=true)\n+Utility function for stencil splicing for local point varying stencils.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+static StencilTableReal< REAL > const * AppendLocalPointStencilTable\n+(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n+*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool\n+factorize=true)\n+Utility function for stencil splicing for local point stencils.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static StencilTableReal< REAL > const * Create(int numTables, StencilTableReal<\n+REAL > const **tables)\n+Instantiates StencilTable by concatenating an array of existing stencil tables.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n+A specialized factory for LimitStencilTable.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bM_\bo_\bd_\be\n+Mode\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+@ INTERPOLATE_FACE_VARYING\n+face-varying primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+@ INTERPOLATE_VARYING\n+varying primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX\n+@ INTERPOLATE_VERTEX\n+vertex primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc\n+std::vector< LocationArray > LocationArrayVec\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static LimitStencilTableReal< REAL > const * Create(TopologyRefiner const\n+&refiner, LocationArrayVec const &locationArrays, StencilTableReal< REAL >\n+const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())\n+Instantiates LimitStencilTable from a TopologyRefiner that has been refined\n+either uniformly or adapt...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n+Vertex stencil descriptor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+Vertex stencil class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n+Table of subdivision stencils.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n+Table of limit subdivision stencils.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b0_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Limit stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs\n+unsigned int factorizeIntermediateLevels\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bm_\ba_\bx_\bL_\be_\bv_\be_\bl\n+unsigned int maxLevel\n+generate stencils up to 'maxLevel'\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs\n+unsigned int generateIntermediateLevels\n+vertices at all levels or highest only\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs\n+unsigned int generateControlVerts\n+generate stencils for control-vertices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs\n+unsigned int generateOffsets\n+populate optional \"_offsets\" field\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+unsigned int fvarChannel\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be\n+unsigned int interpolationMode\n+interpolation mode\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+unsigned int fvarChannel\n+face-varying channel to use\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be\n+unsigned int interpolationMode\n+interpolation mode\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs\n+unsigned int generate2ndDerivatives\n+Generate weights for 2nd derivatives.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs\n+unsigned int generate1stDerivatives\n+Generate weights for 1st derivatives.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n+Descriptor for limit surface locations.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bt\n+REAL const * t\n+array of v coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bs\n+REAL const * s\n+array of u coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n+LocationArray()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs\n+int numLocations\n+number of (u,v) coordinates in the array\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bp_\bt_\be_\bx_\bI_\bd_\bx\n+int ptexIdx\n+ptex face index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Stencil table factory class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static StencilTable const * AppendLocalPointStencilTableVarying(TopologyRefiner\n+const &refiner, StencilTable const *baseStencilTable, StencilTable const\n+*localPointStencilTable, bool factorize=true)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static StencilTable const * Create(TopologyRefiner const &refiner, Options\n+options=Options())\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static StencilTable const * AppendLocalPointStencilTableFaceVarying\n+(TopologyRefiner const &refiner, StencilTable const *baseStencilTable,\n+StencilTable const *localPointStencilTable, int channel=0, bool factorize=true)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const\n+&refiner, StencilTable const *baseStencilTable, StencilTable const\n+*localPointStencilTable, bool factorize=true)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b0_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static StencilTable const * Create(int numTables, StencilTable const **tables)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Stencil table factory class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static LimitStencilTable const * Create(TopologyRefiner const &refiner,\n+LocationArrayVec const &locationArrays, StencilTable const *cvStencils=0,\n+PatchTable const *patchTable=0, Options options=Options())\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b6_\b0\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00719_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00719_source.html", "unified_diff": "@@ -902,16 +902,16 @@\n \n \n \n \n \n \n \n-\n-\n+\n+\n \n \n \n
StencilReal(int *size, Index *indices, REAL *weights)
Constructor.
\n
void Next()
Advance to the next stencil in the table.
\n
StencilReal(StencilReal const &other)
Copy constructor.
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00725.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00725.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/primvarRefiner.h File Reference\n+OpenSubdiv: opensubdiv/far/patchTableFactory.h File Reference\n \n \n \n \n \n \n \n@@ -90,43 +90,33 @@\n \n \n \n
\n \n-
primvarRefiner.h File Reference
\n+
patchTableFactory.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../sdc/types.h"
\n-#include "../sdc/options.h"
\n-#include "../sdc/bilinearScheme.h"
\n-#include "../sdc/catmarkScheme.h"
\n-#include "../sdc/loopScheme.h"
\n-#include "../vtr/level.h"
\n-#include "../vtr/fvarLevel.h"
\n-#include "../vtr/refinement.h"
\n-#include "../vtr/fvarRefinement.h"
\n-#include "../vtr/stackBuffer.h"
\n-#include "../vtr/componentInterfaces.h"
\n-#include "../far/types.h"
\n-#include "../far/error.h"
\n-#include "../far/topologyLevel.h"
\n #include "../far/topologyRefiner.h"
\n-#include <cassert>
\n+#include "../far/patchTable.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n+\n+\n+\n+\n+\n \n

\n Classes

class  PrimvarRefinerReal< REAL >
 Applies refinement operations to generic primvar data. More...
class  PatchTableFactory
 Factory for constructing a PatchTable from a TopologyRefiner. More...
 
class  PrimvarRefiner
struct  PatchTableFactory::Options
 Public options for the PatchTable factory. More...
 
struct  PatchTableFactory::PatchFaceTag
 Obsolete internal struct not intended for public use – due to be deprecated. More...
 
\n \n \n \n \n@@ -135,13 +125,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,41 +1,32 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-primvarRefiner.h File Reference\n+patchTableFactory.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bb_\bi_\bl_\bi_\bn_\be_\ba_\br_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bl_\bo_\bo_\bp_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bl_\be_\bv_\be_\bl_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bs_\bt_\ba_\bc_\bk_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bc_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\"\n #include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 Applies refinement operations to generic primvar data. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+\u00a0 Factory for constructing a _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be from a _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n+struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+\u00a0 Public options for the _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be factory. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg\n+\u00a0 Obsolete internal struct not intended for public use \u2013 due to be\n+ deprecated. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00725.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00725.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,5 @@\n var a00725 = [\n- [\"PrimvarRefinerReal< REAL >\", \"a01021.html\", \"a01021\"],\n- [\"PrimvarRefiner\", \"a01029.html\", \"a01029\"]\n+ [\"PatchTableFactory\", \"a01009.html\", \"a01009\"],\n+ [\"Options\", \"a01013.html\", \"a01013\"],\n+ [\"PatchFaceTag\", \"a01017.html\", \"a01017\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00725_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00725_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/primvarRefiner.h Source File\n+OpenSubdiv: opensubdiv/far/patchTableFactory.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
primvarRefiner.h
\n+
patchTableFactory.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 DreamWorks Animation LLC.
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,1233 +118,250 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_FAR_PRIMVAR_REFINER_H
\n-
25#define OPENSUBDIV3_FAR_PRIMVAR_REFINER_H
\n-
26
\n-
27#include "../version.h"
\n-
28
\n-
29#include "../sdc/types.h"
\n-
30#include "../sdc/options.h"
\n-
31#include "../sdc/bilinearScheme.h"
\n-
32#include "../sdc/catmarkScheme.h"
\n-
33#include "../sdc/loopScheme.h"
\n-
34#include "../vtr/level.h"
\n-
35#include "../vtr/fvarLevel.h"
\n-
36#include "../vtr/refinement.h"
\n-
37#include "../vtr/fvarRefinement.h"
\n-
38#include "../vtr/stackBuffer.h"
\n-
39#include "../vtr/componentInterfaces.h"
\n-
40#include "../far/types.h"
\n-
41#include "../far/error.h"
\n-
42#include "../far/topologyLevel.h"
\n-
43#include "../far/topologyRefiner.h"
\n-
44
\n-
45#include <cassert>
\n+
24
\n+
25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H
\n+
26#define OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H
\n+
27
\n+
28#include "../version.h"
\n+
29
\n+
30#include "../far/topologyRefiner.h"
\n+
31#include "../far/patchTable.h"
\n+
32
\n+
33namespace OpenSubdiv {
\n+
34namespace OPENSUBDIV_VERSION {
\n+
35
\n+
36namespace Far {
\n+
37
\n+
\n+\n+
41public:
\n+
42
\n+
\n+
45 struct Options {
\n
46
\n-
47namespace OpenSubdiv {
\n-
48namespace OPENSUBDIV_VERSION {
\n-
49
\n-
50namespace Far {
\n-
51
\n-
55template <typename REAL>
\n-
\n-\n-
57
\n-
58public:
\n-
59 PrimvarRefinerReal(TopologyRefiner const & refiner) : _refiner(refiner) { }
\n-\n-
61
\n-
62 TopologyRefiner const & GetTopologyRefiner() const { return _refiner; }
\n-
63
\n-
65
\n-
100
\n-
\n-
113 template <class T, class U> void Interpolate(int level, T const & src, U & dst) const;
\n+\n+
62
\n+
\n+
63 Options(unsigned int maxIsolation=10) :
\n+
64 generateAllLevels(false),
\n+\n+\n+
67 triangulateQuads(false),
\n+\n+
69 useInfSharpPatch(false),
\n+
70 maxIsolationLevel(maxIsolation & 0xf),
\n+\n+\n+\n+\n+
75 generateFVarTables(false),
\n+\n+\n+\n+\n+\n+\n+
82 { }
\n+
\n+
83
\n+\n+
86
\n+
88 void SetEndCapType(EndCapType e) { endCapType = e & 0x7; }
\n+
89
\n+
91 void SetMaxIsolationLevel(unsigned int level) { maxIsolationLevel = level & 0xf; }
\n+
92
\n+
94 template <typename REAL> void SetPatchPrecision();
\n+
95
\n+
97 template <typename REAL> void SetFVarPatchPrecision();
\n+
98
\n+
\n+\n+\n+
102
\n+
103 adaptiveOptions.useInfSharpPatch = useInfSharpPatch;
\n+\n+
105 adaptiveOptions.considerFVarChannels = generateFVarTables &&
\n+\n+
107 return adaptiveOptions;
\n+
108 }
\n+
\n+
109
\n+
110 unsigned int generateAllLevels : 1,
\n+\n+\n+\n
114
\n-
\n-
130 template <class T, class U> void InterpolateVarying(int level, T const & src, U & dst) const;
\n-
131
\n-
\n-
148 template <class T, class U> void InterpolateFaceUniform(int level, T const & src, U & dst) const;
\n-
149
\n-
\n-
161 template <class T, class U> void InterpolateFaceVarying(int level, T const & src, U & dst, int channel = 0) const;
\n-
162
\n-
163
\n-
\n-
175 template <class T, class U> void Limit(T const & src, U & dstPos) const;
\n-
176
\n-
177 template <class T, class U, class U1, class U2>
\n-
\n-
178 void Limit(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const;
\n-
179
\n-
\n-
180 template <class T, class U> void LimitFaceVarying(T const & src, U & dst, int channel = 0) const;
\n-
181
\n-
183
\n-
184private:
\n-
185 typedef REAL Weight;
\n-
186
\n-
187 // Non-copyable:
\n-
188 PrimvarRefinerReal(PrimvarRefinerReal const & src) : _refiner(src._refiner) { }
\n-
189 PrimvarRefinerReal & operator=(PrimvarRefinerReal const &) { return *this; }
\n-
190
\n-
191 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromFaces(int, T const &, U &) const;
\n-
192 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromEdges(int, T const &, U &) const;
\n-
193 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromVerts(int, T const &, U &) const;
\n-
194
\n-
195 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromFaces(int, T const &, U &, int) const;
\n-
196 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromEdges(int, T const &, U &, int) const;
\n-
197 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromVerts(int, T const &, U &, int) const;
\n-
198
\n-
199 template <Sdc::SchemeType SCHEME, class T, class U, class U1, class U2>
\n-
200 void limit(T const & src, U & pos, U1 * tan1, U2 * tan2) const;
\n-
201
\n-
202 template <Sdc::SchemeType SCHEME, class T, class U>
\n-
203 void limitFVar(T const & src, U & dst, int channel) const;
\n-
204
\n-
205private:
\n-
206 TopologyRefiner const & _refiner;
\n-
207
\n-
208private:
\n-
209 //
\n-
210 // Local class to fulfill interface for <typename MASK> in the Scheme mask queries:
\n-
211 //
\n-
212 class Mask {
\n-
213 public:
\n-
214 typedef REAL Weight; // Also part of the expected interface
\n-
215
\n-
216 public:
\n-
217 Mask(Weight* v, Weight* e, Weight* f) :
\n-
218 _vertWeights(v), _edgeWeights(e), _faceWeights(f),
\n-
219 _vertCount(0), _edgeCount(0), _faceCount(0),
\n-
220 _faceWeightsForFaceCenters(false)
\n-
221 { }
\n-
222
\n-
223 ~Mask() { }
\n-
224
\n-
225 public: // Generic interface expected of <typename MASK>:
\n-
226 int GetNumVertexWeights() const { return _vertCount; }
\n-
227 int GetNumEdgeWeights() const { return _edgeCount; }
\n-
228 int GetNumFaceWeights() const { return _faceCount; }
\n-
229
\n-
230 void SetNumVertexWeights(int count) { _vertCount = count; }
\n-
231 void SetNumEdgeWeights( int count) { _edgeCount = count; }
\n-
232 void SetNumFaceWeights( int count) { _faceCount = count; }
\n+\n+\n+\n+
118
\n+
119 // end-capping
\n+\n+\n+
123
\n+
124 // varying
\n+\n+\n+
127
\n+
128 // face-varying
\n+\n+
130
\n+
131 // precision
\n+\n+\n+
134
\n+
135 // legacy behaviors (default to true)
\n+\n+\n+
138
\n+\n+
140 int const * fvarChannelIndices;
\n+
141 };
\n+
\n+
142
\n+
175 static PatchTable * Create(TopologyRefiner const & refiner,
\n+
176 Options options = Options(),
\n+
177 ConstIndexArray selectedFaces = ConstIndexArray());
\n+
178
\n+
179public:
\n+
180 // PatchFaceTag
\n+
181 //
\n+
182 // This simple struct was previously used within the factory to take inventory of
\n+
183 // various kinds of patches to fully allocate buffers prior to populating them. It
\n+
184 // was not intended to be exposed as part of the public interface.
\n+
185 //
\n+
186 // It is no longer used internally and is being kept here to respect preservation
\n+
187 // of the public interface, but it will be deprecated at the earliest opportunity.
\n+
188 //
\n+
191 //
\n+
\n+\n+
193 public:
\n+
194 unsigned int _hasPatch : 1;
\n+
195 unsigned int _isRegular : 1;
\n+
196 unsigned int _transitionMask : 4;
\n+
197 unsigned int _boundaryMask : 4;
\n+
198 unsigned int _boundaryIndex : 2;
\n+
199 unsigned int _boundaryCount : 3;
\n+
200 unsigned int _hasBoundaryEdge : 3;
\n+
201 unsigned int _isSingleCrease : 1;
\n+
202
\n+
203 void clear();
\n+
204 void assignBoundaryPropertiesFromEdgeMask(int boundaryEdgeMask);
\n+
205 void assignBoundaryPropertiesFromVertexMask(int boundaryVertexMask);
\n+
206 void assignTransitionPropertiesFromEdgeMask(int boundaryVertexMask);
\n+
207 };
\n+
\n+
208 typedef std::vector<PatchFaceTag> PatchTagVector;
\n+
209};
\n+
\n+
210
\n+
211
\n+
\n+
212template <> inline void PatchTableFactory::Options::SetPatchPrecision<float>() {
\n+
213 patchPrecisionDouble = false;
\n+
214}
\n+
\n+
\n+
215template <> inline void PatchTableFactory::Options::SetFVarPatchPrecision<float>() {
\n+
216 fvarPatchPrecisionDouble = false;
\n+
217}
\n+
\n+
218
\n+
219template <> inline void PatchTableFactory::Options::SetPatchPrecision<double>() {
\n+
220 patchPrecisionDouble = true;
\n+
221}
\n+
222template <> inline void PatchTableFactory::Options::SetFVarPatchPrecision<double>() {
\n+
223 fvarPatchPrecisionDouble = true;
\n+
224}
\n+
225
\n+
226
\n+
227} // end namespace Far
\n+
228
\n+
229} // end namespace OPENSUBDIV_VERSION
\n+
230using namespace OPENSUBDIV_VERSION;
\n+
231
\n+
232} // end namespace OpenSubdiv
\n
233
\n-
234 Weight const& VertexWeight(int index) const { return _vertWeights[index]; }
\n-
235 Weight const& EdgeWeight( int index) const { return _edgeWeights[index]; }
\n-
236 Weight const& FaceWeight( int index) const { return _faceWeights[index]; }
\n-
237
\n-
238 Weight& VertexWeight(int index) { return _vertWeights[index]; }
\n-
239 Weight& EdgeWeight( int index) { return _edgeWeights[index]; }
\n-
240 Weight& FaceWeight( int index) { return _faceWeights[index]; }
\n-
241
\n-
242 bool AreFaceWeightsForFaceCenters() const { return _faceWeightsForFaceCenters; }
\n-
243 void SetFaceWeightsForFaceCenters(bool on) { _faceWeightsForFaceCenters = on; }
\n-
244
\n-
245 private:
\n-
246 Weight* _vertWeights;
\n-
247 Weight* _edgeWeights;
\n-
248 Weight* _faceWeights;
\n-
249
\n-
250 int _vertCount;
\n-
251 int _edgeCount;
\n-
252 int _faceCount;
\n-
253
\n-
254 bool _faceWeightsForFaceCenters;
\n-
255 };
\n-
256};
\n-
257
\n-
258
\n-
259//
\n-
260// Public entry points to the methods. Queries of the scheme type and its
\n-
261// use as a template parameter in subsequent implementation will be factored
\n-
262// out of a later release:
\n-
263//
\n-
264template <typename REAL>
\n-
265template <class T, class U>
\n-
266inline void
\n-
\n-
267PrimvarRefinerReal<REAL>::Interpolate(int level, T const & src, U & dst) const {
\n-
268
\n-
269 assert(level>0 && level<=(int)_refiner._refinements.size());
\n-
270
\n-
271 switch (_refiner._subdivType) {
\n-\n-
273 interpFromFaces<Sdc::SCHEME_CATMARK>(level, src, dst);
\n-
274 interpFromEdges<Sdc::SCHEME_CATMARK>(level, src, dst);
\n-
275 interpFromVerts<Sdc::SCHEME_CATMARK>(level, src, dst);
\n-
276 break;
\n-
277 case Sdc::SCHEME_LOOP:
\n-
278 interpFromFaces<Sdc::SCHEME_LOOP>(level, src, dst);
\n-
279 interpFromEdges<Sdc::SCHEME_LOOP>(level, src, dst);
\n-
280 interpFromVerts<Sdc::SCHEME_LOOP>(level, src, dst);
\n-
281 break;
\n-\n-
283 interpFromFaces<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n-
284 interpFromEdges<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n-
285 interpFromVerts<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n-
286 break;
\n-
287 }
\n-
288}
\n-
\n-
289
\n-
290template <typename REAL>
\n-
291template <class T, class U>
\n-
292inline void
\n-
\n-
293PrimvarRefinerReal<REAL>::InterpolateFaceVarying(int level, T const & src, U & dst, int channel) const {
\n-
294
\n-
295 assert(level>0 && level<=(int)_refiner._refinements.size());
\n-
296
\n-
297 switch (_refiner._subdivType) {
\n-\n-
299 interpFVarFromFaces<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n-
300 interpFVarFromEdges<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n-
301 interpFVarFromVerts<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n-
302 break;
\n-
303 case Sdc::SCHEME_LOOP:
\n-
304 interpFVarFromFaces<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n-
305 interpFVarFromEdges<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n-
306 interpFVarFromVerts<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n-
307 break;
\n-\n-
309 interpFVarFromFaces<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n-
310 interpFVarFromEdges<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n-
311 interpFVarFromVerts<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n-
312 break;
\n-
313 }
\n-
314}
\n-
\n-
315
\n-
316template <typename REAL>
\n-
317template <class T, class U>
\n-
318inline void
\n-
\n-
319PrimvarRefinerReal<REAL>::Limit(T const & src, U & dst) const {
\n-
320
\n-
321 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n-\n-
323 "Failure in PrimvarRefiner::Limit() -- "
\n-
324 "last level of refinement does not include full topology.");
\n-
325 return;
\n-
326 }
\n-
327
\n-
328 switch (_refiner._subdivType) {
\n-\n-
330 limit<Sdc::SCHEME_CATMARK>(src, dst, (U*)0, (U*)0);
\n-
331 break;
\n-
332 case Sdc::SCHEME_LOOP:
\n-
333 limit<Sdc::SCHEME_LOOP>(src, dst, (U*)0, (U*)0);
\n-
334 break;
\n-\n-
336 limit<Sdc::SCHEME_BILINEAR>(src, dst, (U*)0, (U*)0);
\n-
337 break;
\n-
338 }
\n-
339}
\n-
\n-
340
\n-
341template <typename REAL>
\n-
342template <class T, class U, class U1, class U2>
\n-
343inline void
\n-
\n-
344PrimvarRefinerReal<REAL>::Limit(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const {
\n-
345
\n-
346 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n-\n-
348 "Failure in PrimvarRefiner::Limit() -- "
\n-
349 "last level of refinement does not include full topology.");
\n-
350 return;
\n-
351 }
\n-
352
\n-
353 switch (_refiner._subdivType) {
\n-\n-
355 limit<Sdc::SCHEME_CATMARK>(src, dstPos, &dstTan1, &dstTan2);
\n-
356 break;
\n-
357 case Sdc::SCHEME_LOOP:
\n-
358 limit<Sdc::SCHEME_LOOP>(src, dstPos, &dstTan1, &dstTan2);
\n-
359 break;
\n-\n-
361 limit<Sdc::SCHEME_BILINEAR>(src, dstPos, &dstTan1, &dstTan2);
\n-
362 break;
\n-
363 }
\n-
364}
\n-
\n-
365
\n-
366template <typename REAL>
\n-
367template <class T, class U>
\n-
368inline void
\n-
\n-
369PrimvarRefinerReal<REAL>::LimitFaceVarying(T const & src, U & dst, int channel) const {
\n-
370
\n-
371 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n-\n-
373 "Failure in PrimvarRefiner::LimitFaceVarying() -- "
\n-
374 "last level of refinement does not include full topology.");
\n-
375 return;
\n-
376 }
\n-
377
\n-
378 switch (_refiner._subdivType) {
\n-\n-
380 limitFVar<Sdc::SCHEME_CATMARK>(src, dst, channel);
\n-
381 break;
\n-
382 case Sdc::SCHEME_LOOP:
\n-
383 limitFVar<Sdc::SCHEME_LOOP>(src, dst, channel);
\n-
384 break;
\n-\n-
386 limitFVar<Sdc::SCHEME_BILINEAR>(src, dst, channel);
\n-
387 break;
\n-
388 }
\n-
389}
\n-
\n-
\n-
390
\n-
391template <typename REAL>
\n-
392template <class T, class U>
\n-
393inline void
\n-
\n-
394PrimvarRefinerReal<REAL>::InterpolateFaceUniform(int level, T const & src, U & dst) const {
\n-
395
\n-
396 assert(level>0 && level<=(int)_refiner._refinements.size());
\n-
397
\n-
398 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
399 Vtr::internal::Level const & child = refinement.child();
\n-
400
\n-
401 for (int cFace = 0; cFace < child.getNumFaces(); ++cFace) {
\n-
402
\n-
403 Vtr::Index pFace = refinement.getChildFaceParentFace(cFace);
\n-
404
\n-
405 dst[cFace] = src[pFace];
\n-
406 }
\n-
407}
\n-
\n-
408
\n-
409template <typename REAL>
\n-
410template <class T, class U>
\n-
411inline void
\n-
\n-
412PrimvarRefinerReal<REAL>::InterpolateVarying(int level, T const & src, U & dst) const {
\n-
413
\n-
414 assert(level>0 && level<=(int)_refiner._refinements.size());
\n-
415
\n-
416 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
417 Vtr::internal::Level const & parent = refinement.parent();
\n-
418
\n-
419 //
\n-
420 // Group values to interpolate based on origin -- note that there may
\n-
421 // be none originating from faces:
\n-
422 //
\n-
423 if (refinement.getNumChildVerticesFromFaces() > 0) {
\n-
424
\n-
425 for (int face = 0; face < parent.getNumFaces(); ++face) {
\n-
426
\n-
427 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n-
428 if (Vtr::IndexIsValid(cVert)) {
\n-
429
\n-
430 // Apply the weights to the parent face's vertices:
\n-
431 ConstIndexArray fVerts = parent.getFaceVertices(face);
\n-
432
\n-
433 Weight fVaryingWeight = 1.0f / (Weight) fVerts.size();
\n-
434
\n-
435 dst[cVert].Clear();
\n-
436 for (int i = 0; i < fVerts.size(); ++i) {
\n-
437 dst[cVert].AddWithWeight(src[fVerts[i]], fVaryingWeight);
\n-
438 }
\n-
439 }
\n-
440 }
\n-
441 }
\n-
442 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {
\n-
443
\n-
444 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n-
445 if (Vtr::IndexIsValid(cVert)) {
\n-
446
\n-
447 // Apply the weights to the parent edges's vertices
\n-
448 ConstIndexArray eVerts = parent.getEdgeVertices(edge);
\n-
449
\n-
450 dst[cVert].Clear();
\n-
451 dst[cVert].AddWithWeight(src[eVerts[0]], 0.5f);
\n-
452 dst[cVert].AddWithWeight(src[eVerts[1]], 0.5f);
\n-
453 }
\n-
454 }
\n-
455 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {
\n-
456
\n-
457 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n-
458 if (Vtr::IndexIsValid(cVert)) {
\n-
459
\n-
460 // Essentially copy the parent vertex:
\n-
461 dst[cVert].Clear();
\n-
462 dst[cVert].AddWithWeight(src[vert], 1.0f);
\n-
463 }
\n-
464 }
\n-
465}
\n-
\n-
466
\n-
467
\n-
468//
\n-
469// Internal implementation methods -- grouping vertices to be interpolated
\n-
470// based on the type of parent component from which they originated:
\n-
471//
\n-
472template <typename REAL>
\n-
473template <Sdc::SchemeType SCHEME, class T, class U>
\n-
474inline void
\n-
475PrimvarRefinerReal<REAL>::interpFromFaces(int level, T const & src, U & dst) const {
\n-
476
\n-
477 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
478 Vtr::internal::Level const & parent = refinement.parent();
\n-
479
\n-
480 if (refinement.getNumChildVerticesFromFaces() == 0) return;
\n-
481
\n-
482 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
483
\n-
484 Vtr::internal::StackBuffer<Weight,16> fVertWeights(parent.getMaxValence());
\n-
485
\n-
486 for (int face = 0; face < parent.getNumFaces(); ++face) {
\n-
487
\n-
488 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n-
489 if (!Vtr::IndexIsValid(cVert))
\n-
490 continue;
\n-
491
\n-
492 // Declare and compute mask weights for this vertex relative to its parent face:
\n-
493 ConstIndexArray fVerts = parent.getFaceVertices(face);
\n-
494
\n-
495 Mask fMask(fVertWeights, 0, 0);
\n-
496 Vtr::internal::FaceInterface fHood(fVerts.size());
\n-
497
\n-
498 scheme.ComputeFaceVertexMask(fHood, fMask);
\n-
499
\n-
500 // Apply the weights to the parent face's vertices:
\n-
501 dst[cVert].Clear();
\n-
502
\n-
503 for (int i = 0; i < fVerts.size(); ++i) {
\n-
504
\n-
505 dst[cVert].AddWithWeight(src[fVerts[i]], fVertWeights[i]);
\n-
506 }
\n-
507 }
\n-
508}
\n-
509
\n-
510template <typename REAL>
\n-
511template <Sdc::SchemeType SCHEME, class T, class U>
\n-
512inline void
\n-
513PrimvarRefinerReal<REAL>::interpFromEdges(int level, T const & src, U & dst) const {
\n-
514
\n-
515 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
516 Vtr::internal::Level const & parent = refinement.parent();
\n-
517 Vtr::internal::Level const & child = refinement.child();
\n-
518
\n-
519 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
520
\n-
521 Vtr::internal::EdgeInterface eHood(parent);
\n-
522
\n-
523 Weight eVertWeights[2];
\n-
524 Vtr::internal::StackBuffer<Weight,8> eFaceWeights(parent.getMaxEdgeFaces());
\n-
525
\n-
526 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {
\n-
527
\n-
528 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n-
529 if (!Vtr::IndexIsValid(cVert))
\n-
530 continue;
\n-
531
\n-
532 // Declare and compute mask weights for this vertex relative to its parent edge:
\n-
533 ConstIndexArray eVerts = parent.getEdgeVertices(edge),
\n-
534 eFaces = parent.getEdgeFaces(edge);
\n-
535
\n-
536 Mask eMask(eVertWeights, 0, eFaceWeights);
\n-
537
\n-
538 eHood.SetIndex(edge);
\n-
539
\n-
540 Sdc::Crease::Rule pRule = (parent.getEdgeSharpness(edge) > 0.0f) ? Sdc::Crease::RULE_CREASE : Sdc::Crease::RULE_SMOOTH;
\n-
541 Sdc::Crease::Rule cRule = child.getVertexRule(cVert);
\n-
542
\n-
543 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);
\n-
544
\n-
545 // Apply the weights to the parent edges's vertices and (if applicable) to
\n-
546 // the child vertices of its incident faces:
\n-
547 dst[cVert].Clear();
\n-
548 dst[cVert].AddWithWeight(src[eVerts[0]], eVertWeights[0]);
\n-
549 dst[cVert].AddWithWeight(src[eVerts[1]], eVertWeights[1]);
\n-
550
\n-
551 if (eMask.GetNumFaceWeights() > 0) {
\n-
552
\n-
553 for (int i = 0; i < eFaces.size(); ++i) {
\n-
554
\n-
555 if (eMask.AreFaceWeightsForFaceCenters()) {
\n-
556 assert(refinement.getNumChildVerticesFromFaces() > 0);
\n-
557 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);
\n-
558
\n-
559 assert(Vtr::IndexIsValid(cVertOfFace));
\n-
560 dst[cVert].AddWithWeight(dst[cVertOfFace], eFaceWeights[i]);
\n-
561 } else {
\n-
562 Vtr::Index pFace = eFaces[i];
\n-
563 ConstIndexArray pFaceEdges = parent.getFaceEdges(pFace),
\n-
564 pFaceVerts = parent.getFaceVertices(pFace);
\n-
565
\n-
566 int eInFace = 0;
\n-
567 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;
\n-
568
\n-
569 int vInFace = eInFace + 2;
\n-
570 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts.size();
\n-
571
\n-
572 Vtr::Index pVertNext = pFaceVerts[vInFace];
\n-
573 dst[cVert].AddWithWeight(src[pVertNext], eFaceWeights[i]);
\n-
574 }
\n-
575 }
\n-
576 }
\n-
577 }
\n-
578}
\n-
579
\n-
580template <typename REAL>
\n-
581template <Sdc::SchemeType SCHEME, class T, class U>
\n-
582inline void
\n-
583PrimvarRefinerReal<REAL>::interpFromVerts(int level, T const & src, U & dst) const {
\n-
584
\n-
585 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
586 Vtr::internal::Level const & parent = refinement.parent();
\n-
587 Vtr::internal::Level const & child = refinement.child();
\n-
588
\n-
589 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
590
\n-
591 Vtr::internal::VertexInterface vHood(parent, child);
\n-
592
\n-
593 Vtr::internal::StackBuffer<Weight,32> weightBuffer(2*parent.getMaxValence());
\n-
594
\n-
595 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {
\n-
596
\n-
597 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n-
598 if (!Vtr::IndexIsValid(cVert))
\n-
599 continue;
\n-
600
\n-
601 // Declare and compute mask weights for this vertex relative to its parent edge:
\n-
602 ConstIndexArray vEdges = parent.getVertexEdges(vert),
\n-
603 vFaces = parent.getVertexFaces(vert);
\n-
604
\n-
605 Weight vVertWeight,
\n-
606 * vEdgeWeights = weightBuffer,
\n-
607 * vFaceWeights = vEdgeWeights + vEdges.size();
\n-
608
\n-
609 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);
\n-
610
\n-
611 vHood.SetIndex(vert, cVert);
\n-
612
\n-
613 Sdc::Crease::Rule pRule = parent.getVertexRule(vert);
\n-
614 Sdc::Crease::Rule cRule = child.getVertexRule(cVert);
\n-
615
\n-
616 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);
\n-
617
\n-
618 // Apply the weights to the parent vertex, the vertices opposite its incident
\n-
619 // edges, and the child vertices of its incident faces:
\n-
620 //
\n-
621 // In order to improve numerical precision, it's better to apply smaller weights
\n-
622 // first, so begin with the face-weights followed by the edge-weights and the
\n-
623 // vertex weight last.
\n-
624 dst[cVert].Clear();
\n-
625
\n-
626 if (vMask.GetNumFaceWeights() > 0) {
\n-
627 assert(vMask.AreFaceWeightsForFaceCenters());
\n-
628
\n-
629 for (int i = 0; i < vFaces.size(); ++i) {
\n-
630
\n-
631 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);
\n-
632 assert(Vtr::IndexIsValid(cVertOfFace));
\n-
633 dst[cVert].AddWithWeight(dst[cVertOfFace], vFaceWeights[i]);
\n-
634 }
\n-
635 }
\n-
636 if (vMask.GetNumEdgeWeights() > 0) {
\n-
637
\n-
638 for (int i = 0; i < vEdges.size(); ++i) {
\n-
639
\n-
640 ConstIndexArray eVerts = parent.getEdgeVertices(vEdges[i]);
\n-
641 Vtr::Index pVertOppositeEdge = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];
\n-
642
\n-
643 dst[cVert].AddWithWeight(src[pVertOppositeEdge], vEdgeWeights[i]);
\n-
644 }
\n-
645 }
\n-
646 dst[cVert].AddWithWeight(src[vert], vVertWeight);
\n-
647 }
\n-
648}
\n-
649
\n-
650
\n-
651//
\n-
652// Internal face-varying implementation details:
\n-
653//
\n-
654template <typename REAL>
\n-
655template <Sdc::SchemeType SCHEME, class T, class U>
\n-
656inline void
\n-
657PrimvarRefinerReal<REAL>::interpFVarFromFaces(int level, T const & src, U & dst, int channel) const {
\n-
658
\n-
659 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
660
\n-
661 if (refinement.getNumChildVerticesFromFaces() == 0) return;
\n-
662
\n-
663 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
664
\n-
665 Vtr::internal::Level const & parentLevel = refinement.parent();
\n-
666 Vtr::internal::Level const & childLevel = refinement.child();
\n-
667
\n-
668 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n-
669 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n-
670
\n-
671 Vtr::internal::StackBuffer<Weight,16> fValueWeights(parentLevel.getMaxValence());
\n-
672
\n-
673 for (int face = 0; face < parentLevel.getNumFaces(); ++face) {
\n-
674
\n-
675 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n-
676 if (!Vtr::IndexIsValid(cVert))
\n-
677 continue;
\n-
678
\n-
679 Vtr::Index cVertValue = childFVar.getVertexValueOffset(cVert);
\n-
680
\n-
681 // The only difference for face-varying here is that we get the values associated
\n-
682 // with each face-vertex directly from the FVarLevel, rather than using the parent
\n-
683 // face-vertices directly. If any face-vertex has any sibling values, then we may
\n-
684 // get the wrong one using the face-vertex index directly.
\n-
685
\n-
686 // Declare and compute mask weights for this vertex relative to its parent face:
\n-
687 ConstIndexArray fValues = parentFVar.getFaceValues(face);
\n-
688
\n-
689 Mask fMask(fValueWeights, 0, 0);
\n-
690 Vtr::internal::FaceInterface fHood(fValues.size());
\n-
691
\n-
692 scheme.ComputeFaceVertexMask(fHood, fMask);
\n-
693
\n-
694 // Apply the weights to the parent face's vertices:
\n-
695 dst[cVertValue].Clear();
\n-
696
\n-
697 for (int i = 0; i < fValues.size(); ++i) {
\n-
698 dst[cVertValue].AddWithWeight(src[fValues[i]], fValueWeights[i]);
\n-
699 }
\n-
700 }
\n-
701}
\n-
702
\n-
703template <typename REAL>
\n-
704template <Sdc::SchemeType SCHEME, class T, class U>
\n-
705inline void
\n-
706PrimvarRefinerReal<REAL>::interpFVarFromEdges(int level, T const & src, U & dst, int channel) const {
\n-
707
\n-
708 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
709
\n-
710 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
711
\n-
712 Vtr::internal::Level const & parentLevel = refinement.parent();
\n-
713 Vtr::internal::Level const & childLevel = refinement.child();
\n-
714
\n-
715 Vtr::internal::FVarRefinement const & refineFVar = refinement.getFVarRefinement(channel);
\n-
716 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n-
717 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n-
718
\n-
719 //
\n-
720 // Allocate and initialize (if linearly interpolated) interpolation weights for
\n-
721 // the edge mask:
\n-
722 //
\n-
723 Weight eVertWeights[2];
\n-
724 Vtr::internal::StackBuffer<Weight,8> eFaceWeights(parentLevel.getMaxEdgeFaces());
\n-
725
\n-
726 Mask eMask(eVertWeights, 0, eFaceWeights);
\n-
727
\n-
728 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == Sdc::SCHEME_BILINEAR);
\n-
729 if (isLinearFVar) {
\n-
730 eMask.SetNumVertexWeights(2);
\n-
731 eMask.SetNumEdgeWeights(0);
\n-
732 eMask.SetNumFaceWeights(0);
\n-
733
\n-
734 eVertWeights[0] = 0.5f;
\n-
735 eVertWeights[1] = 0.5f;
\n-
736 }
\n-
737
\n-
738 Vtr::internal::EdgeInterface eHood(parentLevel);
\n-
739
\n-
740 for (int edge = 0; edge < parentLevel.getNumEdges(); ++edge) {
\n-
741
\n-
742 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n-
743 if (!Vtr::IndexIsValid(cVert))
\n-
744 continue;
\n-
745
\n-
746 ConstIndexArray cVertValues = childFVar.getVertexValues(cVert);
\n-
747
\n-
748 bool fvarEdgeVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues[0]);
\n-
749 if (fvarEdgeVertMatchesVertex) {
\n-
750 //
\n-
751 // If smoothly interpolated, compute new weights for the edge mask:
\n-
752 //
\n-
753 if (!isLinearFVar) {
\n-
754 eHood.SetIndex(edge);
\n-
755
\n-
756 Sdc::Crease::Rule pRule = (parentLevel.getEdgeSharpness(edge) > 0.0f)
\n-
757 ? Sdc::Crease::RULE_CREASE : Sdc::Crease::RULE_SMOOTH;
\n-
758 Sdc::Crease::Rule cRule = childLevel.getVertexRule(cVert);
\n-
759
\n-
760 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);
\n-
761 }
\n-
762
\n-
763 // Apply the weights to the parent edge's vertices and (if applicable) to
\n-
764 // the child vertices of its incident faces:
\n-
765 //
\n-
766 // Even though the face-varying topology matches the vertex topology, we need
\n-
767 // to be careful here when getting values corresponding to the two end-vertices.
\n-
768 // While the edge may be continuous, the vertices at their ends may have
\n-
769 // discontinuities elsewhere in their neighborhood (i.e. on the "other side"
\n-
770 // of the end-vertex) and so have sibling values associated with them. In most
\n-
771 // cases the topology for an end-vertex will match and we can use it directly,
\n-
772 // but we must still check and retrieve as needed.
\n-
773 //
\n-
774 // Indices for values corresponding to face-vertices are guaranteed to match,
\n-
775 // so we can use the child-vertex indices directly.
\n-
776 //
\n-
777 // And by "directly", we always use getVertexValue(vertexIndex) to reference
\n-
778 // values in the "src" to account for the possible indirection that may exist at
\n-
779 // level 0 -- where there may be fewer values than vertices and an additional
\n-
780 // indirection is necessary. We can use a vertex index directly for "dst" when
\n-
781 // it matches.
\n-
782 //
\n-
783 Vtr::Index eVertValues[2];
\n-
784
\n-
785 parentFVar.getEdgeFaceValues(edge, 0, eVertValues);
\n-
786
\n-
787 Index cVertValue = cVertValues[0];
\n-
788
\n-
789 dst[cVertValue].Clear();
\n-
790 dst[cVertValue].AddWithWeight(src[eVertValues[0]], eVertWeights[0]);
\n-
791 dst[cVertValue].AddWithWeight(src[eVertValues[1]], eVertWeights[1]);
\n-
792
\n-
793 if (eMask.GetNumFaceWeights() > 0) {
\n-
794
\n-
795 ConstIndexArray eFaces = parentLevel.getEdgeFaces(edge);
\n-
796
\n-
797 for (int i = 0; i < eFaces.size(); ++i) {
\n-
798 if (eMask.AreFaceWeightsForFaceCenters()) {
\n-
799
\n-
800 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);
\n-
801 assert(Vtr::IndexIsValid(cVertOfFace));
\n-
802
\n-
803 Vtr::Index cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);
\n-
804 dst[cVertValue].AddWithWeight(dst[cValueOfFace], eFaceWeights[i]);
\n-
805 } else {
\n-
806 Vtr::Index pFace = eFaces[i];
\n-
807 ConstIndexArray pFaceEdges = parentLevel.getFaceEdges(pFace),
\n-
808 pFaceVerts = parentLevel.getFaceVertices(pFace);
\n-
809
\n-
810 int eInFace = 0;
\n-
811 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;
\n-
812
\n-
813 // Edge "i" spans vertices [i,i+1] so we want i+2...
\n-
814 int vInFace = eInFace + 2;
\n-
815 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts.size();
\n-
816
\n-
817 Vtr::Index pValueNext = parentFVar.getFaceValues(pFace)[vInFace];
\n-
818 dst[cVertValue].AddWithWeight(src[pValueNext], eFaceWeights[i]);
\n-
819 }
\n-
820 }
\n-
821 }
\n-
822 } else {
\n-
823 //
\n-
824 // Mismatched edge-verts should just be linearly interpolated between the pairs of
\n-
825 // values for each sibling of the child edge-vertex -- the question is: which face
\n-
826 // holds that pair of values for a given sibling?
\n-
827 //
\n-
828 // In the manifold case, the sibling and edge-face indices will correspond. We
\n-
829 // will eventually need to update this to account for > 3 incident faces.
\n-
830 //
\n-
831 for (int i = 0; i < cVertValues.size(); ++i) {
\n-
832 Vtr::Index eVertValues[2];
\n-
833 int eFaceIndex = refineFVar.getChildValueParentSource(cVert, i);
\n-
834 assert(eFaceIndex == i);
\n-
835
\n-
836 parentFVar.getEdgeFaceValues(edge, eFaceIndex, eVertValues);
\n-
837
\n-
838 Index cVertValue = cVertValues[i];
\n-
839
\n-
840 dst[cVertValue].Clear();
\n-
841 dst[cVertValue].AddWithWeight(src[eVertValues[0]], 0.5);
\n-
842 dst[cVertValue].AddWithWeight(src[eVertValues[1]], 0.5);
\n-
843 }
\n-
844 }
\n-
845 }
\n-
846}
\n-
847
\n-
848template <typename REAL>
\n-
849template <Sdc::SchemeType SCHEME, class T, class U>
\n-
850inline void
\n-
851PrimvarRefinerReal<REAL>::interpFVarFromVerts(int level, T const & src, U & dst, int channel) const {
\n-
852
\n-
853 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
854
\n-
855 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
856
\n-
857 Vtr::internal::Level const & parentLevel = refinement.parent();
\n-
858 Vtr::internal::Level const & childLevel = refinement.child();
\n-
859
\n-
860 Vtr::internal::FVarRefinement const & refineFVar = refinement.getFVarRefinement(channel);
\n-
861 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n-
862 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n-
863
\n-
864 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == Sdc::SCHEME_BILINEAR);
\n-
865
\n-
866 Vtr::internal::StackBuffer<Weight,32> weightBuffer(2*parentLevel.getMaxValence());
\n-
867
\n-
868 Vtr::internal::StackBuffer<Vtr::Index,16> vEdgeValues(parentLevel.getMaxValence());
\n-
869
\n-
870 Vtr::internal::VertexInterface vHood(parentLevel, childLevel);
\n-
871
\n-
872 for (int vert = 0; vert < parentLevel.getNumVertices(); ++vert) {
\n-
873
\n-
874 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n-
875 if (!Vtr::IndexIsValid(cVert))
\n-
876 continue;
\n-
877
\n-
878 ConstIndexArray pVertValues = parentFVar.getVertexValues(vert),
\n-
879 cVertValues = childFVar.getVertexValues(cVert);
\n-
880
\n-
881 bool fvarVertVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues[0]);
\n-
882 if (isLinearFVar && fvarVertVertMatchesVertex) {
\n-
883 dst[cVertValues[0]].Clear();
\n-
884 dst[cVertValues[0]].AddWithWeight(src[pVertValues[0]], 1.0f);
\n-
885 continue;
\n-
886 }
\n-
887
\n-
888 if (fvarVertVertMatchesVertex) {
\n-
889 //
\n-
890 // Declare and compute mask weights for this vertex relative to its parent edge:
\n-
891 //
\n-
892 // (We really need to encapsulate this somewhere else for use here and in the
\n-
893 // general case)
\n-
894 //
\n-
895 ConstIndexArray vEdges = parentLevel.getVertexEdges(vert);
\n-
896
\n-
897 Weight vVertWeight;
\n-
898 Weight * vEdgeWeights = weightBuffer;
\n-
899 Weight * vFaceWeights = vEdgeWeights + vEdges.size();
\n-
900
\n-
901 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);
\n-
902
\n-
903 vHood.SetIndex(vert, cVert);
\n-
904
\n-
905 Sdc::Crease::Rule pRule = parentLevel.getVertexRule(vert);
\n-
906 Sdc::Crease::Rule cRule = childLevel.getVertexRule(cVert);
\n-
907
\n-
908 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);
\n-
909
\n-
910 // Apply the weights to the parent vertex, the vertices opposite its incident
\n-
911 // edges, and the child vertices of its incident faces:
\n-
912 //
\n-
913 // Even though the face-varying topology matches the vertex topology, we need
\n-
914 // to be careful here when getting values corresponding to vertices at the
\n-
915 // ends of edges. While the edge may be continuous, the end vertex may have
\n-
916 // discontinuities elsewhere in their neighborhood (i.e. on the "other side"
\n-
917 // of the end-vertex) and so have sibling values associated with them. In most
\n-
918 // cases the topology for an end-vertex will match and we can use it directly,
\n-
919 // but we must still check and retrieve as needed.
\n-
920 //
\n-
921 // Indices for values corresponding to face-vertices are guaranteed to match,
\n-
922 // so we can use the child-vertex indices directly.
\n-
923 //
\n-
924 // And by "directly", we always use getVertexValue(vertexIndex) to reference
\n-
925 // values in the "src" to account for the possible indirection that may exist at
\n-
926 // level 0 -- where there may be fewer values than vertices and an additional
\n-
927 // indirection is necessary. We can use a vertex index directly for "dst" when
\n-
928 // it matches.
\n-
929 //
\n-
930 // As with applying the mask to vertex data, in order to improve numerical
\n-
931 // precision, it's better to apply smaller weights first, so begin with the
\n-
932 // face-weights followed by the edge-weights and the vertex weight last.
\n-
933 //
\n-
934 Vtr::Index pVertValue = pVertValues[0];
\n-
935 Vtr::Index cVertValue = cVertValues[0];
\n-
936
\n-
937 dst[cVertValue].Clear();
\n-
938 if (vMask.GetNumFaceWeights() > 0) {
\n-
939 assert(vMask.AreFaceWeightsForFaceCenters());
\n-
940
\n-
941 ConstIndexArray vFaces = parentLevel.getVertexFaces(vert);
\n-
942
\n-
943 for (int i = 0; i < vFaces.size(); ++i) {
\n-
944
\n-
945 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);
\n-
946 assert(Vtr::IndexIsValid(cVertOfFace));
\n-
947
\n-
948 Vtr::Index cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);
\n-
949 dst[cVertValue].AddWithWeight(dst[cValueOfFace], vFaceWeights[i]);
\n-
950 }
\n-
951 }
\n-
952 if (vMask.GetNumEdgeWeights() > 0) {
\n-
953
\n-
954 parentFVar.getVertexEdgeValues(vert, vEdgeValues);
\n-
955
\n-
956 for (int i = 0; i < vEdges.size(); ++i) {
\n-
957 dst[cVertValue].AddWithWeight(src[vEdgeValues[i]], vEdgeWeights[i]);
\n-
958 }
\n-
959 }
\n-
960 dst[cVertValue].AddWithWeight(src[pVertValue], vVertWeight);
\n-
961 } else {
\n-
962 //
\n-
963 // Each FVar value associated with a vertex will be either a corner or a crease,
\n-
964 // or potentially in transition from corner to crease:
\n-
965 // - if the CHILD is a corner, there can be no transition so we have a corner
\n-
966 // - otherwise if the PARENT is a crease, both will be creases (no transition)
\n-
967 // - otherwise the parent must be a corner and the child a crease (transition)
\n-
968 //
\n-
969 Vtr::internal::FVarLevel::ConstValueTagArray pValueTags = parentFVar.getVertexValueTags(vert);
\n-
970 Vtr::internal::FVarLevel::ConstValueTagArray cValueTags = childFVar.getVertexValueTags(cVert);
\n-
971
\n-
972 for (int cSiblingIndex = 0; cSiblingIndex < cVertValues.size(); ++cSiblingIndex) {
\n-
973 int pSiblingIndex = refineFVar.getChildValueParentSource(cVert, cSiblingIndex);
\n-
974 assert(pSiblingIndex == cSiblingIndex);
\n-
975
\n-
976 typedef Vtr::internal::FVarLevel::Sibling SiblingIntType;
\n-
977
\n-
978 SiblingIntType cSibling = (SiblingIntType) cSiblingIndex;
\n-
979 SiblingIntType pSibling = (SiblingIntType) pSiblingIndex;
\n-
980
\n-
981 Vtr::Index pVertValue = pVertValues[pSibling];
\n-
982 Vtr::Index cVertValue = cVertValues[cSibling];
\n-
983
\n-
984 dst[cVertValue].Clear();
\n-
985 if (isLinearFVar || cValueTags[cSibling].isCorner()) {
\n-
986 dst[cVertValue].AddWithWeight(src[pVertValue], 1.0f);
\n-
987 } else {
\n-
988 //
\n-
989 // We have either a crease or a transition from corner to crease -- in
\n-
990 // either case, we need the end values for the full/fractional crease:
\n-
991 //
\n-
992 Index pEndValues[2];
\n-
993 parentFVar.getVertexCreaseEndValues(vert, pSibling, pEndValues);
\n-
994
\n-
995 Weight vWeight = 0.75f;
\n-
996 Weight eWeight = 0.125f;
\n-
997
\n-
998 //
\n-
999 // If semi-sharp we need to apply fractional weighting -- if made sharp because
\n-
1000 // of the other sibling (dependent-sharp) use the fractional weight from that
\n-
1001 // other sibling (should only occur when there are 2):
\n-
1002 //
\n-
1003 if (pValueTags[pSibling].isSemiSharp()) {
\n-
1004 Weight wCorner = pValueTags[pSibling].isDepSharp()
\n-
1005 ? refineFVar.getFractionalWeight(vert, !pSibling, cVert, !cSibling)
\n-
1006 : refineFVar.getFractionalWeight(vert, pSibling, cVert, cSibling);
\n-
1007 Weight wCrease = 1.0f - wCorner;
\n-
1008
\n-
1009 vWeight = wCrease * 0.75f + wCorner;
\n-
1010 eWeight = wCrease * 0.125f;
\n-
1011 }
\n-
1012 dst[cVertValue].AddWithWeight(src[pEndValues[0]], eWeight);
\n-
1013 dst[cVertValue].AddWithWeight(src[pEndValues[1]], eWeight);
\n-
1014 dst[cVertValue].AddWithWeight(src[pVertValue], vWeight);
\n-
1015 }
\n-
1016 }
\n-
1017 }
\n-
1018 }
\n-
1019}
\n-
1020
\n-
1021template <typename REAL>
\n-
1022template <Sdc::SchemeType SCHEME, class T, class U, class U1, class U2>
\n-
1023inline void
\n-
1024PrimvarRefinerReal<REAL>::limit(T const & src, U & dstPos, U1 * dstTan1Ptr, U2 * dstTan2Ptr) const {
\n-
1025
\n-
1026 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
1027
\n-
1028 Vtr::internal::Level const & level = _refiner.getLevel(_refiner.GetMaxLevel());
\n-
1029
\n-
1030 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();
\n-
1031 bool hasTangents = (dstTan1Ptr && dstTan2Ptr);
\n-
1032 int numMasks = 1 + (hasTangents ? 2 : 0);
\n-
1033
\n-
1034 Vtr::internal::StackBuffer<Index,33> indexBuffer(maxWeightsPerMask);
\n-
1035 Vtr::internal::StackBuffer<Weight,99> weightBuffer(numMasks * maxWeightsPerMask);
\n-
1036
\n-
1037 Weight * vPosWeights = weightBuffer,
\n-
1038 * ePosWeights = vPosWeights + 1,
\n-
1039 * fPosWeights = ePosWeights + level.getMaxValence();
\n-
1040 Weight * vTan1Weights = vPosWeights + maxWeightsPerMask,
\n-
1041 * eTan1Weights = ePosWeights + maxWeightsPerMask,
\n-
1042 * fTan1Weights = fPosWeights + maxWeightsPerMask;
\n-
1043 Weight * vTan2Weights = vTan1Weights + maxWeightsPerMask,
\n-
1044 * eTan2Weights = eTan1Weights + maxWeightsPerMask,
\n-
1045 * fTan2Weights = fTan1Weights + maxWeightsPerMask;
\n-
1046
\n-
1047 Mask posMask( vPosWeights, ePosWeights, fPosWeights);
\n-
1048 Mask tan1Mask(vTan1Weights, eTan1Weights, fTan1Weights);
\n-
1049 Mask tan2Mask(vTan2Weights, eTan2Weights, fTan2Weights);
\n-
1050
\n-
1051 // This is a bit obscure -- assigning both parent and child as last level -- but
\n-
1052 // this mask type was intended for another purpose. Consider one for the limit:
\n-
1053 Vtr::internal::VertexInterface vHood(level, level);
\n-
1054
\n-
1055 for (int vert = 0; vert < level.getNumVertices(); ++vert) {
\n-
1056 ConstIndexArray vEdges = level.getVertexEdges(vert);
\n-
1057
\n-
1058 // Incomplete vertices (present in sparse refinement) do not have their full
\n-
1059 // topological neighborhood to determine a proper limit -- just leave the
\n-
1060 // vertex at the refined location and continue to the next:
\n-
1061 if (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0)) {
\n-
1062 dstPos[vert].Clear();
\n-
1063 dstPos[vert].AddWithWeight(src[vert], 1.0);
\n-
1064 if (hasTangents) {
\n-
1065 (*dstTan1Ptr)[vert].Clear();
\n-
1066 (*dstTan2Ptr)[vert].Clear();
\n-
1067 }
\n-
1068 continue;
\n-
1069 }
\n-
1070
\n-
1071 //
\n-
1072 // Limit masks require the subdivision Rule for the vertex in order to deal
\n-
1073 // with infinitely sharp features correctly -- including boundaries and corners.
\n-
1074 // The vertex neighborhood is minimally defined with vertex and edge counts.
\n-
1075 //
\n-
1076 Sdc::Crease::Rule vRule = level.getVertexRule(vert);
\n-
1077
\n-
1078 // This is a bit obscure -- child vertex index will be ignored here
\n-
1079 vHood.SetIndex(vert, vert);
\n-
1080
\n-
1081 if (hasTangents) {
\n-
1082 scheme.ComputeVertexLimitMask(vHood, posMask, tan1Mask, tan2Mask, vRule);
\n-
1083 } else {
\n-
1084 scheme.ComputeVertexLimitMask(vHood, posMask, vRule);
\n-
1085 }
\n-
1086
\n-
1087 //
\n-
1088 // Gather the neighboring vertices of this vertex -- the vertices opposite its
\n-
1089 // incident edges, and the opposite vertices of its incident faces:
\n-
1090 //
\n-
1091 Index * eIndices = indexBuffer;
\n-
1092 Index * fIndices = indexBuffer + vEdges.size();
\n-
1093
\n-
1094 for (int i = 0; i < vEdges.size(); ++i) {
\n-
1095 ConstIndexArray eVerts = level.getEdgeVertices(vEdges[i]);
\n-
1096
\n-
1097 eIndices[i] = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];
\n-
1098 }
\n-
1099 if (posMask.GetNumFaceWeights() || (hasTangents && tan1Mask.GetNumFaceWeights())) {
\n-
1100 ConstIndexArray vFaces = level.getVertexFaces(vert);
\n-
1101 ConstLocalIndexArray vInFace = level.getVertexFaceLocalIndices(vert);
\n-
1102
\n-
1103 for (int i = 0; i < vFaces.size(); ++i) {
\n-
1104 ConstIndexArray fVerts = level.getFaceVertices(vFaces[i]);
\n-
1105
\n-
1106 LocalIndex vOppInFace = (vInFace[i] + 2);
\n-
1107 if (vOppInFace >= fVerts.size()) vOppInFace -= (LocalIndex)fVerts.size();
\n-
1108
\n-
1109 fIndices[i] = level.getFaceVertices(vFaces[i])[vOppInFace];
\n-
1110 }
\n-
1111 }
\n-
1112
\n-
1113 //
\n-
1114 // Combine the weights and indices for position and tangents. As with applying
\n-
1115 // refinement masks to vertex data, in order to improve numerical precision, it's
\n-
1116 // better to apply smaller weights first, so begin with the face-weights followed
\n-
1117 // by the edge-weights and the vertex weight last.
\n-
1118 //
\n-
1119 dstPos[vert].Clear();
\n-
1120 for (int i = 0; i < posMask.GetNumFaceWeights(); ++i) {
\n-
1121 dstPos[vert].AddWithWeight(src[fIndices[i]], fPosWeights[i]);
\n-
1122 }
\n-
1123 for (int i = 0; i < posMask.GetNumEdgeWeights(); ++i) {
\n-
1124 dstPos[vert].AddWithWeight(src[eIndices[i]], ePosWeights[i]);
\n-
1125 }
\n-
1126 dstPos[vert].AddWithWeight(src[vert], vPosWeights[0]);
\n-
1127
\n-
1128 //
\n-
1129 // Apply the tangent masks -- both will have the same number of weights and
\n-
1130 // indices (one tangent may be "padded" to accommodate the other), but these
\n-
1131 // may differ from those of the position:
\n-
1132 //
\n-
1133 if (hasTangents) {
\n-
1134 assert(tan1Mask.GetNumFaceWeights() == tan2Mask.GetNumFaceWeights());
\n-
1135 assert(tan1Mask.GetNumEdgeWeights() == tan2Mask.GetNumEdgeWeights());
\n-
1136
\n-
1137 U1 & dstTan1 = *dstTan1Ptr;
\n-
1138 U2 & dstTan2 = *dstTan2Ptr;
\n-
1139
\n-
1140 dstTan1[vert].Clear();
\n-
1141 dstTan2[vert].Clear();
\n-
1142 for (int i = 0; i < tan1Mask.GetNumFaceWeights(); ++i) {
\n-
1143 dstTan1[vert].AddWithWeight(src[fIndices[i]], fTan1Weights[i]);
\n-
1144 dstTan2[vert].AddWithWeight(src[fIndices[i]], fTan2Weights[i]);
\n-
1145 }
\n-
1146 for (int i = 0; i < tan1Mask.GetNumEdgeWeights(); ++i) {
\n-
1147 dstTan1[vert].AddWithWeight(src[eIndices[i]], eTan1Weights[i]);
\n-
1148 dstTan2[vert].AddWithWeight(src[eIndices[i]], eTan2Weights[i]);
\n-
1149 }
\n-
1150 dstTan1[vert].AddWithWeight(src[vert], vTan1Weights[0]);
\n-
1151 dstTan2[vert].AddWithWeight(src[vert], vTan2Weights[0]);
\n-
1152 }
\n-
1153 }
\n-
1154}
\n-
1155
\n-
1156template <typename REAL>
\n-
1157template <Sdc::SchemeType SCHEME, class T, class U>
\n-
1158inline void
\n-
1159PrimvarRefinerReal<REAL>::limitFVar(T const & src, U & dst, int channel) const {
\n-
1160
\n-
1161 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
1162
\n-
1163 Vtr::internal::Level const & level = _refiner.getLevel(_refiner.GetMaxLevel());
\n-
1164 Vtr::internal::FVarLevel const & fvarChannel = level.getFVarLevel(channel);
\n-
1165
\n-
1166 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();
\n-
1167
\n-
1168 Vtr::internal::StackBuffer<Weight,33> weightBuffer(maxWeightsPerMask);
\n-
1169 Vtr::internal::StackBuffer<Index,16> vEdgeBuffer(level.getMaxValence());
\n-
1170
\n-
1171 // This is a bit obscure -- assign both parent and child as last level
\n-
1172 Vtr::internal::VertexInterface vHood(level, level);
\n-
1173
\n-
1174 for (int vert = 0; vert < level.getNumVertices(); ++vert) {
\n-
1175
\n-
1176 ConstIndexArray vEdges = level.getVertexEdges(vert);
\n-
1177 ConstIndexArray vValues = fvarChannel.getVertexValues(vert);
\n-
1178
\n-
1179 // Incomplete vertices (present in sparse refinement) do not have their full
\n-
1180 // topological neighborhood to determine a proper limit -- just leave the
\n-
1181 // values (perhaps more than one per vertex) at the refined location.
\n-
1182 //
\n-
1183 // The same can be done if the face-varying channel is purely linear.
\n-
1184 //
\n-
1185 bool isIncomplete = (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0));
\n-
1186 if (isIncomplete || fvarChannel.isLinear()) {
\n-
1187 for (int i = 0; i < vValues.size(); ++i) {
\n-
1188 Vtr::Index vValue = vValues[i];
\n-
1189
\n-
1190 dst[vValue].Clear();
\n-
1191 dst[vValue].AddWithWeight(src[vValue], 1.0f);
\n-
1192 }
\n-
1193 continue;
\n-
1194 }
\n-
1195
\n-
1196 bool fvarVertMatchesVertex = fvarChannel.valueTopologyMatches(vValues[0]);
\n-
1197 if (fvarVertMatchesVertex) {
\n-
1198
\n-
1199 // Assign the mask weights to the common buffer and compute the mask:
\n-
1200 //
\n-
1201 Weight * vWeights = weightBuffer,
\n-
1202 * eWeights = vWeights + 1,
\n-
1203 * fWeights = eWeights + vEdges.size();
\n-
1204
\n-
1205 Mask vMask(vWeights, eWeights, fWeights);
\n-
1206
\n-
1207 vHood.SetIndex(vert, vert);
\n-
1208
\n-
1209 scheme.ComputeVertexLimitMask(vHood, vMask, level.getVertexRule(vert));
\n-
1210
\n-
1211 //
\n-
1212 // Apply mask to corresponding FVar values for neighboring vertices:
\n-
1213 //
\n-
1214 Vtr::Index vValue = vValues[0];
\n-
1215
\n-
1216 dst[vValue].Clear();
\n-
1217 if (vMask.GetNumFaceWeights() > 0) {
\n-
1218 assert(!vMask.AreFaceWeightsForFaceCenters());
\n-
1219
\n-
1220 ConstIndexArray vFaces = level.getVertexFaces(vert);
\n-
1221 ConstLocalIndexArray vInFace = level.getVertexFaceLocalIndices(vert);
\n-
1222
\n-
1223 for (int i = 0; i < vFaces.size(); ++i) {
\n-
1224 ConstIndexArray faceValues = fvarChannel.getFaceValues(vFaces[i]);
\n-
1225 LocalIndex vOppInFace = vInFace[i] + 2;
\n-
1226 if (vOppInFace >= faceValues.size()) vOppInFace -= faceValues.size();
\n-
1227
\n-
1228 Index vValueOppositeFace = faceValues[vOppInFace];
\n-
1229
\n-
1230 dst[vValue].AddWithWeight(src[vValueOppositeFace], fWeights[i]);
\n-
1231 }
\n-
1232 }
\n-
1233 if (vMask.GetNumEdgeWeights() > 0) {
\n-
1234 Index * vEdgeValues = vEdgeBuffer;
\n-
1235 fvarChannel.getVertexEdgeValues(vert, vEdgeValues);
\n-
1236
\n-
1237 for (int i = 0; i < vEdges.size(); ++i) {
\n-
1238 dst[vValue].AddWithWeight(src[vEdgeValues[i]], eWeights[i]);
\n-
1239 }
\n-
1240 }
\n-
1241 dst[vValue].AddWithWeight(src[vValue], vWeights[0]);
\n-
1242 } else {
\n-
1243 //
\n-
1244 // Sibling FVar values associated with a vertex will be either a corner or a crease:
\n-
1245 //
\n-
1246 for (int i = 0; i < vValues.size(); ++i) {
\n-
1247 Vtr::Index vValue = vValues[i];
\n-
1248
\n-
1249 dst[vValue].Clear();
\n-
1250 if (fvarChannel.getValueTag(vValue).isCorner()) {
\n-
1251 dst[vValue].AddWithWeight(src[vValue], 1.0f);
\n-
1252 } else {
\n-
1253 Index vEndValues[2];
\n-
1254 fvarChannel.getVertexCreaseEndValues(vert, i, vEndValues);
\n-
1255
\n-
1256 dst[vValue].AddWithWeight(src[vEndValues[0]], 1.0f/6.0f);
\n-
1257 dst[vValue].AddWithWeight(src[vEndValues[1]], 1.0f/6.0f);
\n-
1258 dst[vValue].AddWithWeight(src[vValue], 2.0f/3.0f);
\n-
1259 }
\n-
1260 }
\n-
1261 }
\n-
1262 }
\n-
1263}
\n-
1264
\n-
\n-
1265class PrimvarRefiner : public PrimvarRefinerReal<float> {
\n-
1266public:
\n-
\n-\n-
1268 : PrimvarRefinerReal<float>(refiner) { }
\n-
\n-
1269};
\n-
\n-
1270
\n-
1271} // end namespace Far
\n-
1272
\n-
1273} // end namespace OPENSUBDIV_VERSION
\n-
1274using namespace OPENSUBDIV_VERSION;
\n-
1275} // end namespace OpenSubdiv
\n-
1276
\n-
1277#endif /* OPENSUBDIV3_FAR_PRIMVAR_REFINER_H */
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
234
\n+
235#endif /* OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H */
\n \n-\n-
void Error(ErrorType err, const char *format,...)
Sends an OSD error with a message (internal use only)
\n
Vtr::ConstIndexArray ConstIndexArray
Definition types.h:47
\n-
Vtr::ConstLocalIndexArray ConstLocalIndexArray
Definition types.h:48
\n-
@ FAR_RUNTIME_ERROR
Issue a generic runtime error, but continue execution.
Definition error.h:40
\n-\n-\n-
bool IndexIsValid(Index index)
Definition types.h:58
\n-\n-\n-\n-
Applies refinement operations to generic primvar data.
\n-
void Limit(T const &src, U &dstPos) const
Apply limit weights to a primvar buffer.
\n-\n-
void Limit(T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const
\n-
void InterpolateFaceUniform(int level, T const &src, U &dst) const
Refine uniform (per-face) primvar data between levels.
\n-\n-
void InterpolateVarying(int level, T const &src, U &dst) const
Apply only varying interpolation weights to a primvar buffer for a single level of refinement.
\n-
void Interpolate(int level, T const &src, U &dst) const
Apply vertex interpolation weights to a primvar buffer for a single level of refinement.
\n-
void InterpolateFaceVarying(int level, T const &src, U &dst, int channel=0) const
Apply face-varying interpolation weights to a primvar buffer associated with a particular face-varyin...
\n-\n-
void LimitFaceVarying(T const &src, U &dst, int channel=0) const
\n-\n-\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
Factory for constructing a PatchTable from a TopologyRefiner.
\n+\n+
static PatchTable * Create(TopologyRefiner const &refiner, Options options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())
Instantiates a PatchTable from a client-provided TopologyRefiner.
\n+\n+
unsigned int generateVaryingTables
Generate varying patch tables.
\n+
unsigned int generateLegacySharpCornerPatches
Generate sharp regular patches at smooth corners (legacy)
\n+\n+
TopologyRefiner::AdaptiveOptions GetRefineAdaptiveOptions() const
Determine adaptive refinement options to match assigned patch options.
\n+
unsigned int maxIsolationLevel
Cap adaptive feature isolation to the given level (max. 10)
\n+\n+
unsigned int generateFVarLegacyLinearPatches
Generate all linear face-varying patches (legacy)
\n+
void SetPatchPrecision()
Set precision of vertex patches.
\n+
unsigned int fvarPatchPrecisionDouble
Generate double-precision stencils for face-varying patches.
\n+
void SetMaxIsolationLevel(unsigned int level)
Set maximum isolation level.
\n+\n+
int const * fvarChannelIndices
List containing the indices of the channels selected for the factory.
\n+\n+\n+\n+
unsigned int generateVaryingLocalPoints
Generate local points with varying patches.
\n+
unsigned int includeFVarBaseLevelIndices
Include base level in face-varying patch point indices (Uniform mode only)
\n+
unsigned int generateAllLevels
Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)
\n+
unsigned int patchPrecisionDouble
Generate double-precision stencils for vertex patches.
\n+
unsigned int generateFVarTables
Generate face-varying patch tables.
\n+
unsigned int includeBaseLevelIndices
Include base level in patch point indices (Uniform mode only)
\n+
void SetFVarPatchPrecision()
Set precision of face-varying patches.
\n+
int numFVarChannels
Number of channel indices and interpolation modes passed.
\n+
unsigned int triangulateQuads
Triangulate 'QUADS' primitives (Uniform mode only)
\n+
EndCapType
Choice for approximating irregular patches (end-caps)
\n+
@ ENDCAP_LEGACY_GREGORY
legacy option for 2.x style Gregory patches (Catmark only)
\n+
@ ENDCAP_GREGORY_BASIS
use Gregory patches (highest quality, recommended default)
\n+\n+
@ ENDCAP_BILINEAR_BASIS
use linear patches (simple quads or tris)
\n+
@ ENDCAP_BSPLINE_BASIS
use BSpline-like patches (same patch type as regular)
\n+\n+
Obsolete internal struct not intended for public use \u2013 due to be deprecated.
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
Stores topology data for a specified set of refinement options.
\n-\n-\n-
Scheme is a class template which provides all implementation for the subdivision schemes supported by...
Definition scheme.h:66
\n+\n+\n+\n+\n \n-\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "encoding", "source2": "encoding", "unified_diff": "@@ -1 +1 @@\n-us-ascii\n+utf-8\n"}, {"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-primvarRefiner.h\n+patchTableFactory.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 DreamWorks Animation LLC.\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,1388 +23,410 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_FAR_PRIMVAR_REFINER_H\n-25#define OPENSUBDIV3_FAR_PRIMVAR_REFINER_H\n-26\n-27#include \"../version.h\"\n-28\n-29#include \"../sdc/types.h\"\n-30#include \"../sdc/options.h\"\n-31#include \"../sdc/bilinearScheme.h\"\n-32#include \"../sdc/catmarkScheme.h\"\n-33#include \"../sdc/loopScheme.h\"\n-34#include \"../vtr/level.h\"\n-35#include \"../vtr/fvarLevel.h\"\n-36#include \"../vtr/refinement.h\"\n-37#include \"../vtr/fvarRefinement.h\"\n-38#include \"../vtr/stackBuffer.h\"\n-39#include \"../vtr/componentInterfaces.h\"\n-40#include \"../far/types.h\"\n-41#include \"../far/error.h\"\n-42#include \"../far/topologyLevel.h\"\n-43#include \"../far/topologyRefiner.h\"\n-44\n-45#include \n+24\n+25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H\n+26#define OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H\n+27\n+28#include \"../version.h\"\n+29\n+30#include \"../far/topologyRefiner.h\"\n+31#include \"../far/patchTable.h\"\n+32\n+33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+34namespace OPENSUBDIV_VERSION {\n+35\n+36namespace Far {\n+37\n+_\b4_\b0class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n+41public:\n+42\n+_\b4_\b5 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n 46\n-47namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-48namespace OPENSUBDIV_VERSION {\n-49\n-50namespace Far {\n-51\n-55template \n-_\b5_\b6class _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl {\n-57\n-58public:\n-_\b5_\b9 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner) : _refiner(refiner) { }\n-_\b6_\b0 _\b~_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl() { }\n-61\n-_\b6_\b2 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & _\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br() const { return _refiner; }\n-63\n-65\n-100\n-_\b1_\b1_\b3 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(int level, T const & src, U &\n-dst) const;\n+_\b5_\b5 enum _\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be {\n+_\b5_\b6 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bN_\bO_\bN_\bE = 0,\n+_\b5_\b7 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b__\bB_\bA_\bS_\bI_\bS,\n+_\b5_\b8 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bS_\bP_\bL_\bI_\bN_\bE_\b__\bB_\bA_\bS_\bI_\bS,\n+_\b5_\b9 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS,\n+60 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bL_\bE_\bG_\bA_\bC_\bY_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY\n+_\b6_\b1 };\n+62\n+_\b6_\b3 _\bO_\bp_\bt_\bi_\bo_\bn_\bs(unsigned int maxIsolation=10) :\n+64 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs(false),\n+65 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(true),\n+66 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(false),\n+67 _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs(false),\n+68 _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh(false),\n+69 _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh(false),\n+70 _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(maxIsolation & 0xf),\n+71 _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be(_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS),\n+72 _\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs(true),\n+73 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs(true),\n+74 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs(true),\n+75 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs(false),\n+76 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be(false),\n+77 _\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be(false),\n+78 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs(true),\n+79 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs(true),\n+80 _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs(-1),\n+81 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(0)\n+82 { }\n+83\n+_\b8_\b5 _\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be _\bG_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be() const { return (_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be)_\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be; }\n+86\n+_\b8_\b8 void _\bS_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be(_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be e) { _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be = e & 0x7; }\n+89\n+_\b9_\b1 void _\bS_\be_\bt_\bM_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(unsigned int level) { _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl = level &\n+0xf; }\n+92\n+_\b9_\b4 template void _\bS_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn();\n+95\n+_\b9_\b7 template void _\bS_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn();\n+98\n+_\b1_\b0_\b0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bG_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs() const {\n+101 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs adaptiveOptions(_\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl);\n+102\n+103 adaptiveOptions._\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh = _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh;\n+104 adaptiveOptions._\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh = _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh;\n+105 adaptiveOptions._\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs = _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs &&\n+106 !_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs;\n+107 return adaptiveOptions;\n+108 }\n+109\n+_\b1_\b1_\b0 unsigned int _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs : 1,\n+_\b1_\b1_\b1 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs : 1,\n+_\b1_\b1_\b2 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs : 1,\n+_\b1_\b1_\b3 _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs : 1,\n 114\n-_\b1_\b3_\b0 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const &\n-src, U & dst) const;\n-131\n-_\b1_\b4_\b8 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm(int level, T const\n-& src, U & dst) const;\n-149\n-_\b1_\b6_\b1 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const\n-& src, U & dst, int channel = 0) const;\n-162\n-163\n-_\b1_\b7_\b5 template void _\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos) const;\n-176\n-177 template \n-_\b1_\b7_\b8 void _\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const;\n-179\n-_\b1_\b8_\b0 template void _\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const & src, U & dst,\n-int channel = 0) const;\n-181\n-183\n-184private:\n-185 typedef REAL Weight;\n-186\n-187 // Non-copyable:\n-188 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl const & src) : _refiner(src._refiner)\n-{ }\n-189 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl & operator=(_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl const &) { return *this;\n-}\n-190\n-191 template void interpFromFaces\n-(int, T const &, U &) const;\n-192 template void interpFromEdges\n-(int, T const &, U &) const;\n-193 template void interpFromVerts\n-(int, T const &, U &) const;\n-194\n-195 template void\n-interpFVarFromFaces(int, T const &, U &, int) const;\n-196 template void\n-interpFVarFromEdges(int, T const &, U &, int) const;\n-197 template void\n-interpFVarFromVerts(int, T const &, U &, int) const;\n-198\n-199 template \n-200 void limit(T const & src, U & pos, U1 * tan1, U2 * tan2) const;\n-201\n-202 template \n-203 void limitFVar(T const & src, U & dst, int channel) const;\n-204\n-205private:\n-206 TopologyRefiner const & _refiner;\n-207\n-208private:\n-209 //\n-210 // Local class to fulfill interface for in the Scheme mask\n-queries:\n-211 //\n-212 class Mask {\n-213 public:\n-214 typedef REAL Weight; // Also part of the expected interface\n-215\n-216 public:\n-217 Mask(Weight* v, Weight* e, Weight* f) :\n-218 _vertWeights(v), _edgeWeights(e), _faceWeights(f),\n-219 _vertCount(0), _edgeCount(0), _faceCount(0),\n-220 _faceWeightsForFaceCenters(false)\n-221 { }\n-222\n-223 ~Mask() { }\n-224\n-225 public: // Generic interface expected of :\n-226 int GetNumVertexWeights() const { return _vertCount; }\n-227 int GetNumEdgeWeights() const { return _edgeCount; }\n-228 int GetNumFaceWeights() const { return _faceCount; }\n-229\n-230 void SetNumVertexWeights(int count) { _vertCount = count; }\n-231 void SetNumEdgeWeights( int count) { _edgeCount = count; }\n-232 void SetNumFaceWeights( int count) { _faceCount = count; }\n+_\b1_\b1_\b5 _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh : 1,\n+_\b1_\b1_\b6 _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh : 1,\n+_\b1_\b1_\b7 _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl : 4,\n+118\n+119 // end-capping\n+_\b1_\b2_\b0 _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be : 3,\n+_\b1_\b2_\b1 _\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs : 1,\n+123\n+124 // varying\n+_\b1_\b2_\b5 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs : 1,\n+_\b1_\b2_\b6 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs : 1,\n+127\n+128 // face-varying\n+_\b1_\b2_\b9 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs : 1,\n+130\n+131 // precision\n+_\b1_\b3_\b2 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be : 1,\n+_\b1_\b3_\b3 _\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be : 1,\n+134\n+135 // legacy behaviors (default to true)\n+_\b1_\b3_\b6 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs : 1,\n+_\b1_\b3_\b7 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs : 1;\n+138\n+_\b1_\b3_\b9 int _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n+_\b1_\b4_\b0 int const * _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n+141 };\n+142\n+_\b1_\b7_\b5 static _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be * _\bC_\br_\be_\ba_\bt_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n+176 _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs(),\n+177 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by selectedFaces = _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by());\n+178\n+179public:\n+180 // PatchFaceTag\n+181 //\n+182 // This simple struct was previously used within the factory to take\n+inventory of\n+183 // various kinds of patches to fully allocate buffers prior to populating\n+them. It\n+184 // was not intended to be exposed as part of the public interface.\n+185 //\n+186 // It is no longer used internally and is being kept here to respect\n+preservation\n+187 // of the public interface, but it will be deprecated at the earliest\n+opportunity.\n+188 //\n+191 //\n+_\b1_\b9_\b2 struct _\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg {\n+193 public:\n+_\b1_\b9_\b4 unsigned int _\b__\bh_\ba_\bs_\bP_\ba_\bt_\bc_\bh : 1;\n+_\b1_\b9_\b5 unsigned int _\b__\bi_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br : 1;\n+_\b1_\b9_\b6 unsigned int _\b__\bt_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bM_\ba_\bs_\bk : 4;\n+_\b1_\b9_\b7 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bM_\ba_\bs_\bk : 4;\n+_\b1_\b9_\b8 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bd_\be_\bx : 2;\n+_\b1_\b9_\b9 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bu_\bn_\bt : 3;\n+_\b2_\b0_\b0 unsigned int _\b__\bh_\ba_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be : 3;\n+_\b2_\b0_\b1 unsigned int _\b__\bi_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be : 1;\n+202\n+_\b2_\b0_\b3 void _\bc_\bl_\be_\ba_\br();\n+_\b2_\b0_\b4 void _\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk(int boundaryEdgeMask);\n+_\b2_\b0_\b5 void _\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk(int boundaryVertexMask);\n+_\b2_\b0_\b6 void _\ba_\bs_\bs_\bi_\bg_\bn_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk(int boundaryVertexMask);\n+207 };\n+_\b2_\b0_\b8 typedef std::vector _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bg_\bV_\be_\bc_\bt_\bo_\br;\n+209};\n+210\n+211\n+_\b2_\b1_\b2template <> inline void PatchTableFactory::Options::SetPatchPrecision\n+() {\n+213 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be = false;\n+214}\n+_\b2_\b1_\b5template <> inline void PatchTableFactory::Options::\n+SetFVarPatchPrecision() {\n+216 fvarPatchPrecisionDouble = false;\n+217}\n+218\n+219template <> inline void PatchTableFactory::Options::\n+SetPatchPrecision() {\n+220 patchPrecisionDouble = true;\n+221}\n+222template <> inline void PatchTableFactory::Options::\n+SetFVarPatchPrecision() {\n+223 fvarPatchPrecisionDouble = true;\n+224}\n+225\n+226\n+227} // end namespace Far\n+228\n+229} // end namespace OPENSUBDIV_VERSION\n+230using namespace OPENSUBDIV_VERSION;\n+231\n+232} // end namespace OpenSubdiv\n 233\n-234 Weight const& VertexWeight(int index) const { return _vertWeights[index]; }\n-235 Weight const& EdgeWeight( int index) const { return _edgeWeights[index]; }\n-236 Weight const& FaceWeight( int index) const { return _faceWeights[index]; }\n-237\n-238 Weight& VertexWeight(int index) { return _vertWeights[index]; }\n-239 Weight& EdgeWeight( int index) { return _edgeWeights[index]; }\n-240 Weight& FaceWeight( int index) { return _faceWeights[index]; }\n-241\n-242 bool AreFaceWeightsForFaceCenters() const { return\n-_faceWeightsForFaceCenters; }\n-243 void SetFaceWeightsForFaceCenters(bool on) { _faceWeightsForFaceCenters =\n-on; }\n-244\n-245 private:\n-246 Weight* _vertWeights;\n-247 Weight* _edgeWeights;\n-248 Weight* _faceWeights;\n-249\n-250 int _vertCount;\n-251 int _edgeCount;\n-252 int _faceCount;\n-253\n-254 bool _faceWeightsForFaceCenters;\n-255 };\n-256};\n-257\n-258\n-259//\n-260// Public entry points to the methods. Queries of the scheme type and its\n-261// use as a template parameter in subsequent implementation will be factored\n-262// out of a later release:\n-263//\n-264template \n-265template \n-266inline void\n-_\b2_\b6_\b7_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(int level, T const & src, U & dst)\n-const {\n-268\n-269 assert(level>0 && level<=(int)_refiner._refinements.size());\n-270\n-271 switch (_refiner._subdivType) {\n-272 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-273 interpFromFaces(level, src, dst);\n-274 interpFromEdges(level, src, dst);\n-275 interpFromVerts(level, src, dst);\n-276 break;\n-277 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-278 interpFromFaces(level, src, dst);\n-279 interpFromEdges(level, src, dst);\n-280 interpFromVerts(level, src, dst);\n-281 break;\n-282 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-283 interpFromFaces(level, src, dst);\n-284 interpFromEdges(level, src, dst);\n-285 interpFromVerts(level, src, dst);\n-286 break;\n-287 }\n-288}\n-289\n-290template \n-291template \n-292inline void\n-_\b2_\b9_\b3_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const & src, U\n-& dst, int channel) const {\n-294\n-295 assert(level>0 && level<=(int)_refiner._refinements.size());\n-296\n-297 switch (_refiner._subdivType) {\n-298 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-299 interpFVarFromFaces(level, src, dst, channel);\n-300 interpFVarFromEdges(level, src, dst, channel);\n-301 interpFVarFromVerts(level, src, dst, channel);\n-302 break;\n-303 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-304 interpFVarFromFaces(level, src, dst, channel);\n-305 interpFVarFromEdges(level, src, dst, channel);\n-306 interpFVarFromVerts(level, src, dst, channel);\n-307 break;\n-308 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-309 interpFVarFromFaces(level, src, dst, channel);\n-310 interpFVarFromEdges(level, src, dst, channel);\n-311 interpFVarFromVerts(level, src, dst, channel);\n-312 break;\n-313 }\n-314}\n-315\n-316template \n-317template \n-318inline void\n-_\b3_\b1_\b9_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt(T const & src, U & dst) const {\n-320\n-321 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n-0) {\n-322 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n-323 \"Failure in PrimvarRefiner::Limit() -- \"\n-324 \"last level of refinement does not include full topology.\");\n-325 return;\n-326 }\n-327\n-328 switch (_refiner._subdivType) {\n-329 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-330 limit(src, dst, (U*)0, (U*)0);\n-331 break;\n-332 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-333 limit(src, dst, (U*)0, (U*)0);\n-334 break;\n-335 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-336 limit(src, dst, (U*)0, (U*)0);\n-337 break;\n-338 }\n-339}\n-340\n-341template \n-342template \n-343inline void\n-_\b3_\b4_\b4_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos, U1 & dstTan1, U2\n-& dstTan2) const {\n-345\n-346 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n-0) {\n-347 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n-348 \"Failure in PrimvarRefiner::Limit() -- \"\n-349 \"last level of refinement does not include full topology.\");\n-350 return;\n-351 }\n-352\n-353 switch (_refiner._subdivType) {\n-354 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-355 limit(src, dstPos, &dstTan1, &dstTan2);\n-356 break;\n-357 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-358 limit(src, dstPos, &dstTan1, &dstTan2);\n-359 break;\n-360 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-361 limit(src, dstPos, &dstTan1, &dstTan2);\n-362 break;\n-363 }\n-364}\n-365\n-366template \n-367template \n-368inline void\n-_\b3_\b6_\b9_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const & src, U & dst, int\n-channel) const {\n-370\n-371 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n-0) {\n-372 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n-373 \"Failure in PrimvarRefiner::LimitFaceVarying() -- \"\n-374 \"last level of refinement does not include full topology.\");\n-375 return;\n-376 }\n-377\n-378 switch (_refiner._subdivType) {\n-379 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-380 limitFVar(src, dst, channel);\n-381 break;\n-382 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-383 limitFVar(src, dst, channel);\n-384 break;\n-385 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-386 limitFVar(src, dst, channel);\n-387 break;\n-388 }\n-389}\n-390\n-391template \n-392template \n-393inline void\n-_\b3_\b9_\b4_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm(int level, T const & src, U\n-& dst) const {\n-395\n-396 assert(level>0 && level<=(int)_refiner._refinements.size());\n-397\n-398 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-399 Vtr::internal::Level const & child = refinement.child();\n-400\n-401 for (int cFace = 0; cFace < child.getNumFaces(); ++cFace) {\n-402\n-403 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = refinement.getChildFaceParentFace(cFace);\n-404\n-405 dst[cFace] = src[pFace];\n-406 }\n-407}\n-408\n-409template \n-410template \n-411inline void\n-_\b4_\b1_\b2_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const & src, U &\n-dst) const {\n-413\n-414 assert(level>0 && level<=(int)_refiner._refinements.size());\n-415\n-416 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-417 Vtr::internal::Level const & parent = refinement.parent();\n-418\n-419 //\n-420 // Group values to interpolate based on origin -- note that there may\n-421 // be none originating from faces:\n-422 //\n-423 if (refinement.getNumChildVerticesFromFaces() > 0) {\n-424\n-425 for (int face = 0; face < parent.getNumFaces(); ++face) {\n-426\n-427 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n-428 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n-429\n-430 // Apply the weights to the parent face's vertices:\n-431 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = parent.getFaceVertices(face);\n-432\n-433 Weight fVaryingWeight = 1.0f / (Weight) fVerts._\bs_\bi_\bz_\be();\n-434\n-435 dst[cVert].Clear();\n-436 for (int i = 0; i < fVerts._\bs_\bi_\bz_\be(); ++i) {\n-437 dst[cVert].AddWithWeight(src[fVerts[i]], fVaryingWeight);\n-438 }\n-439 }\n-440 }\n-441 }\n-442 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {\n-443\n-444 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n-445 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n-446\n-447 // Apply the weights to the parent edges's vertices\n-448 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(edge);\n-449\n-450 dst[cVert].Clear();\n-451 dst[cVert].AddWithWeight(src[eVerts[0]], 0.5f);\n-452 dst[cVert].AddWithWeight(src[eVerts[1]], 0.5f);\n-453 }\n-454 }\n-455 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {\n-456\n-457 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n-458 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n-459\n-460 // Essentially copy the parent vertex:\n-461 dst[cVert].Clear();\n-462 dst[cVert].AddWithWeight(src[vert], 1.0f);\n-463 }\n-464 }\n-465}\n-466\n-467\n-468//\n-469// Internal implementation methods -- grouping vertices to be interpolated\n-470// based on the type of parent component from which they originated:\n-471//\n-472template \n-473template \n-474inline void\n-475_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bi_\bn_\bt_\be_\br_\bp_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs(int level, T const & src, U & dst)\n-const {\n-476\n-477 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-478 Vtr::internal::Level const & parent = refinement.parent();\n-479\n-480 if (refinement.getNumChildVerticesFromFaces() == 0) return;\n-481\n-482 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b> scheme(_refiner._subdivOptions);\n-483\n-484 Vtr::internal::StackBuffer fVertWeights(parent.getMaxValence());\n-485\n-486 for (int face = 0; face < parent.getNumFaces(); ++face) {\n-487\n-488 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n-489 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-490 continue;\n-491\n-492 // Declare and compute mask weights for this vertex relative to its parent\n-face:\n-493 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = parent.getFaceVertices(face);\n-494\n-495 Mask fMask(fVertWeights, 0, 0);\n-496 Vtr::internal::FaceInterface fHood(fVerts._\bs_\bi_\bz_\be());\n-497\n-498 scheme.ComputeFaceVertexMask(fHood, fMask);\n-499\n-500 // Apply the weights to the parent face's vertices:\n-501 dst[cVert].Clear();\n-502\n-503 for (int i = 0; i < fVerts._\bs_\bi_\bz_\be(); ++i) {\n-504\n-505 dst[cVert].AddWithWeight(src[fVerts[i]], fVertWeights[i]);\n-506 }\n-507 }\n-508}\n-509\n-510template \n-511template \n-512inline void\n-513PrimvarRefinerReal::interpFromEdges(int level, T const & src, U & dst)\n-const {\n-514\n-515 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-516 Vtr::internal::Level const & parent = refinement.parent();\n-517 Vtr::internal::Level const & child = refinement.child();\n-518\n-519 Sdc::Scheme scheme(_refiner._subdivOptions);\n-520\n-521 Vtr::internal::EdgeInterface eHood(parent);\n-522\n-523 Weight eVertWeights[2];\n-524 Vtr::internal::StackBuffer eFaceWeights(parent.getMaxEdgeFaces\n-());\n-525\n-526 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {\n-527\n-528 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n-529 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-530 continue;\n-531\n-532 // Declare and compute mask weights for this vertex relative to its parent\n-edge:\n-533 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(edge),\n-534 eFaces = parent.getEdgeFaces(edge);\n-535\n-536 Mask eMask(eVertWeights, 0, eFaceWeights);\n-537\n-538 eHood.SetIndex(edge);\n-539\n-540 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = (parent.getEdgeSharpness(edge) > 0.0f) ? _\bS_\bd_\bc_\b:_\b:\n-_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE : Sdc::Crease::RULE_SMOOTH;\n-541 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = child.getVertexRule(cVert);\n-542\n-543 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);\n-544\n-545 // Apply the weights to the parent edges's vertices and (if applicable) to\n-546 // the child vertices of its incident faces:\n-547 dst[cVert].Clear();\n-548 dst[cVert].AddWithWeight(src[eVerts[0]], eVertWeights[0]);\n-549 dst[cVert].AddWithWeight(src[eVerts[1]], eVertWeights[1]);\n-550\n-551 if (eMask.GetNumFaceWeights() > 0) {\n-552\n-553 for (int i = 0; i < eFaces.size(); ++i) {\n-554\n-555 if (eMask.AreFaceWeightsForFaceCenters()) {\n-556 assert(refinement.getNumChildVerticesFromFaces() > 0);\n-557 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);\n-558\n-559 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n-560 dst[cVert].AddWithWeight(dst[cVertOfFace], eFaceWeights[i]);\n-561 } else {\n-562 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = eFaces[i];\n-563 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pFaceEdges = parent.getFaceEdges(pFace),\n-564 pFaceVerts = parent.getFaceVertices(pFace);\n-565\n-566 int eInFace = 0;\n-567 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;\n-568\n-569 int vInFace = eInFace + 2;\n-570 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts._\bs_\bi_\bz_\be();\n-571\n-572 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertNext = pFaceVerts[vInFace];\n-573 dst[cVert].AddWithWeight(src[pVertNext], eFaceWeights[i]);\n-574 }\n-575 }\n-576 }\n-577 }\n-578}\n-579\n-580template \n-581template \n-582inline void\n-583PrimvarRefinerReal::interpFromVerts(int level, T const & src, U & dst)\n-const {\n-584\n-585 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-586 Vtr::internal::Level const & parent = refinement.parent();\n-587 Vtr::internal::Level const & child = refinement.child();\n-588\n-589 Sdc::Scheme scheme(_refiner._subdivOptions);\n-590\n-591 Vtr::internal::VertexInterface vHood(parent, child);\n-592\n-593 Vtr::internal::StackBuffer weightBuffer(2*parent.getMaxValence\n-());\n-594\n-595 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {\n-596\n-597 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n-598 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-599 continue;\n-600\n-601 // Declare and compute mask weights for this vertex relative to its parent\n-edge:\n-602 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = parent.getVertexEdges(vert),\n-603 vFaces = parent.getVertexFaces(vert);\n-604\n-605 Weight vVertWeight,\n-606 * vEdgeWeights = weightBuffer,\n-607 * vFaceWeights = vEdgeWeights + vEdges._\bs_\bi_\bz_\be();\n-608\n-609 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);\n-610\n-611 vHood.SetIndex(vert, cVert);\n-612\n-613 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = parent.getVertexRule(vert);\n-614 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = child.getVertexRule(cVert);\n-615\n-616 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);\n-617\n-618 // Apply the weights to the parent vertex, the vertices opposite its\n-incident\n-619 // edges, and the child vertices of its incident faces:\n-620 //\n-621 // In order to improve numerical precision, it's better to apply smaller\n-weights\n-622 // first, so begin with the face-weights followed by the edge-weights and\n-the\n-623 // vertex weight last.\n-624 dst[cVert].Clear();\n-625\n-626 if (vMask.GetNumFaceWeights() > 0) {\n-627 assert(vMask.AreFaceWeightsForFaceCenters());\n-628\n-629 for (int i = 0; i < vFaces.size(); ++i) {\n-630\n-631 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);\n-632 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n-633 dst[cVert].AddWithWeight(dst[cVertOfFace], vFaceWeights[i]);\n-634 }\n-635 }\n-636 if (vMask.GetNumEdgeWeights() > 0) {\n-637\n-638 for (int i = 0; i < vEdges.size(); ++i) {\n-639\n-640 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(vEdges[i]);\n-641 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertOppositeEdge = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];\n-642\n-643 dst[cVert].AddWithWeight(src[pVertOppositeEdge], vEdgeWeights[i]);\n-644 }\n-645 }\n-646 dst[cVert].AddWithWeight(src[vert], vVertWeight);\n-647 }\n-648}\n-649\n-650\n-651//\n-652// Internal face-varying implementation details:\n-653//\n-654template \n-655template \n-656inline void\n-657PrimvarRefinerReal::interpFVarFromFaces(int level, T const & src, U &\n-dst, int channel) const {\n-658\n-659 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-660\n-661 if (refinement.getNumChildVerticesFromFaces() == 0) return;\n-662\n-663 Sdc::Scheme scheme(_refiner._subdivOptions);\n-664\n-665 Vtr::internal::Level const & parentLevel = refinement.parent();\n-666 Vtr::internal::Level const & childLevel = refinement.child();\n-667\n-668 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n-(channel);\n-669 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n-(channel);\n-670\n-671 Vtr::internal::StackBuffer fValueWeights\n-(parentLevel.getMaxValence());\n-672\n-673 for (int face = 0; face < parentLevel.getNumFaces(); ++face) {\n-674\n-675 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n-676 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-677 continue;\n-678\n-679 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = childFVar.getVertexValueOffset(cVert);\n-680\n-681 // The only difference for face-varying here is that we get the values\n-associated\n-682 // with each face-vertex directly from the FVarLevel, rather than using the\n-parent\n-683 // face-vertices directly. If any face-vertex has any sibling values, then\n-we may\n-684 // get the wrong one using the face-vertex index directly.\n-685\n-686 // Declare and compute mask weights for this vertex relative to its parent\n-face:\n-687 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fValues = parentFVar.getFaceValues(face);\n-688\n-689 Mask fMask(fValueWeights, 0, 0);\n-690 Vtr::internal::FaceInterface fHood(fValues.size());\n-691\n-692 scheme.ComputeFaceVertexMask(fHood, fMask);\n-693\n-694 // Apply the weights to the parent face's vertices:\n-695 dst[cVertValue].Clear();\n-696\n-697 for (int i = 0; i < fValues.size(); ++i) {\n-698 dst[cVertValue].AddWithWeight(src[fValues[i]], fValueWeights[i]);\n-699 }\n-700 }\n-701}\n-702\n-703template \n-704template \n-705inline void\n-706PrimvarRefinerReal::interpFVarFromEdges(int level, T const & src, U &\n-dst, int channel) const {\n-707\n-708 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-709\n-710 Sdc::Scheme scheme(_refiner._subdivOptions);\n-711\n-712 Vtr::internal::Level const & parentLevel = refinement.parent();\n-713 Vtr::internal::Level const & childLevel = refinement.child();\n-714\n-715 Vtr::internal::FVarRefinement const & refineFVar =\n-refinement.getFVarRefinement(channel);\n-716 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n-(channel);\n-717 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n-(channel);\n-718\n-719 //\n-720 // Allocate and initialize (if linearly interpolated) interpolation weights\n-for\n-721 // the edge mask:\n-722 //\n-723 Weight eVertWeights[2];\n-724 Vtr::internal::StackBuffer eFaceWeights\n-(parentLevel.getMaxEdgeFaces());\n-725\n-726 Mask eMask(eVertWeights, 0, eFaceWeights);\n-727\n-728 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == _\bS_\bd_\bc_\b:_\b:\n-_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR);\n-729 if (isLinearFVar) {\n-730 eMask.SetNumVertexWeights(2);\n-731 eMask.SetNumEdgeWeights(0);\n-732 eMask.SetNumFaceWeights(0);\n-733\n-734 eVertWeights[0] = 0.5f;\n-735 eVertWeights[1] = 0.5f;\n-736 }\n-737\n-738 Vtr::internal::EdgeInterface eHood(parentLevel);\n-739\n-740 for (int edge = 0; edge < parentLevel.getNumEdges(); ++edge) {\n-741\n-742 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n-743 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-744 continue;\n-745\n-746 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by cVertValues = childFVar.getVertexValues(cVert);\n-747\n-748 bool fvarEdgeVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues\n-[0]);\n-749 if (fvarEdgeVertMatchesVertex) {\n-750 //\n-751 // If smoothly interpolated, compute new weights for the edge mask:\n-752 //\n-753 if (!isLinearFVar) {\n-754 eHood.SetIndex(edge);\n-755\n-756 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = (parentLevel.getEdgeSharpness(edge) > 0.0f)\n-757 ? _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE : Sdc::Crease::RULE_SMOOTH;\n-758 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = childLevel.getVertexRule(cVert);\n-759\n-760 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);\n-761 }\n-762\n-763 // Apply the weights to the parent edge's vertices and (if applicable) to\n-764 // the child vertices of its incident faces:\n-765 //\n-766 // Even though the face-varying topology matches the vertex topology, we\n-need\n-767 // to be careful here when getting values corresponding to the two end-\n-vertices.\n-768 // While the edge may be continuous, the vertices at their ends may have\n-769 // discontinuities elsewhere in their neighborhood (i.e. on the \"other\n-side\"\n-770 // of the end-vertex) and so have sibling values associated with them. In\n-most\n-771 // cases the topology for an end-vertex will match and we can use it\n-directly,\n-772 // but we must still check and retrieve as needed.\n-773 //\n-774 // Indices for values corresponding to face-vertices are guaranteed to\n-match,\n-775 // so we can use the child-vertex indices directly.\n-776 //\n-777 // And by \"directly\", we always use getVertexValue(vertexIndex) to\n-reference\n-778 // values in the \"src\" to account for the possible indirection that may\n-exist at\n-779 // level 0 -- where there may be fewer values than vertices and an\n-additional\n-780 // indirection is necessary. We can use a vertex index directly for \"dst\"\n-when\n-781 // it matches.\n-782 //\n-783 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx eVertValues[2];\n-784\n-785 parentFVar.getEdgeFaceValues(edge, 0, eVertValues);\n-786\n-787 _\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[0];\n-788\n-789 dst[cVertValue].Clear();\n-790 dst[cVertValue].AddWithWeight(src[eVertValues[0]], eVertWeights[0]);\n-791 dst[cVertValue].AddWithWeight(src[eVertValues[1]], eVertWeights[1]);\n-792\n-793 if (eMask.GetNumFaceWeights() > 0) {\n-794\n-795 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eFaces = parentLevel.getEdgeFaces(edge);\n-796\n-797 for (int i = 0; i < eFaces.size(); ++i) {\n-798 if (eMask.AreFaceWeightsForFaceCenters()) {\n-799\n-800 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);\n-801 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n-802\n-803 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);\n-804 dst[cVertValue].AddWithWeight(dst[cValueOfFace], eFaceWeights[i]);\n-805 } else {\n-806 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = eFaces[i];\n-807 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pFaceEdges = parentLevel.getFaceEdges(pFace),\n-808 pFaceVerts = parentLevel.getFaceVertices(pFace);\n-809\n-810 int eInFace = 0;\n-811 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;\n-812\n-813 // Edge \"i\" spans vertices [i,i+1] so we want i+2...\n-814 int vInFace = eInFace + 2;\n-815 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts._\bs_\bi_\bz_\be();\n-816\n-817 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pValueNext = parentFVar.getFaceValues(pFace)[vInFace];\n-818 dst[cVertValue].AddWithWeight(src[pValueNext], eFaceWeights[i]);\n-819 }\n-820 }\n-821 }\n-822 } else {\n-823 //\n-824 // Mismatched edge-verts should just be linearly interpolated between the\n-pairs of\n-825 // values for each sibling of the child edge-vertex -- the question is:\n-which face\n-826 // holds that pair of values for a given sibling?\n-827 //\n-828 // In the manifold case, the sibling and edge-face indices will correspond.\n-We\n-829 // will eventually need to update this to account for > 3 incident faces.\n-830 //\n-831 for (int i = 0; i < cVertValues.size(); ++i) {\n-832 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx eVertValues[2];\n-833 int eFaceIndex = refineFVar.getChildValueParentSource(cVert, i);\n-834 assert(eFaceIndex == i);\n-835\n-836 parentFVar.getEdgeFaceValues(edge, eFaceIndex, eVertValues);\n-837\n-838 _\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[i];\n-839\n-840 dst[cVertValue].Clear();\n-841 dst[cVertValue].AddWithWeight(src[eVertValues[0]], 0.5);\n-842 dst[cVertValue].AddWithWeight(src[eVertValues[1]], 0.5);\n-843 }\n-844 }\n-845 }\n-846}\n-847\n-848template \n-849template \n-850inline void\n-851PrimvarRefinerReal::interpFVarFromVerts(int level, T const & src, U &\n-dst, int channel) const {\n-852\n-853 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-854\n-855 Sdc::Scheme scheme(_refiner._subdivOptions);\n-856\n-857 Vtr::internal::Level const & parentLevel = refinement.parent();\n-858 Vtr::internal::Level const & childLevel = refinement.child();\n-859\n-860 Vtr::internal::FVarRefinement const & refineFVar =\n-refinement.getFVarRefinement(channel);\n-861 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n-(channel);\n-862 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n-(channel);\n-863\n-864 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == _\bS_\bd_\bc_\b:_\b:\n-_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR);\n-865\n-866 Vtr::internal::StackBuffer weightBuffer\n-(2*parentLevel.getMaxValence());\n-867\n-868 Vtr::internal::StackBuffer vEdgeValues\n-(parentLevel.getMaxValence());\n-869\n-870 Vtr::internal::VertexInterface vHood(parentLevel, childLevel);\n-871\n-872 for (int vert = 0; vert < parentLevel.getNumVertices(); ++vert) {\n-873\n-874 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n-875 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-876 continue;\n-877\n-878 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pVertValues = parentFVar.getVertexValues(vert),\n-879 cVertValues = childFVar.getVertexValues(cVert);\n-880\n-881 bool fvarVertVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues\n-[0]);\n-882 if (isLinearFVar && fvarVertVertMatchesVertex) {\n-883 dst[cVertValues[0]].Clear();\n-884 dst[cVertValues[0]].AddWithWeight(src[pVertValues[0]], 1.0f);\n-885 continue;\n-886 }\n-887\n-888 if (fvarVertVertMatchesVertex) {\n-889 //\n-890 // Declare and compute mask weights for this vertex relative to its parent\n-edge:\n-891 //\n-892 // (We really need to encapsulate this somewhere else for use here and in\n-the\n-893 // general case)\n-894 //\n-895 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = parentLevel.getVertexEdges(vert);\n-896\n-897 Weight vVertWeight;\n-898 Weight * vEdgeWeights = weightBuffer;\n-899 Weight * vFaceWeights = vEdgeWeights + vEdges._\bs_\bi_\bz_\be();\n-900\n-901 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);\n-902\n-903 vHood.SetIndex(vert, cVert);\n-904\n-905 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = parentLevel.getVertexRule(vert);\n-906 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = childLevel.getVertexRule(cVert);\n-907\n-908 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);\n-909\n-910 // Apply the weights to the parent vertex, the vertices opposite its\n-incident\n-911 // edges, and the child vertices of its incident faces:\n-912 //\n-913 // Even though the face-varying topology matches the vertex topology, we\n-need\n-914 // to be careful here when getting values corresponding to vertices at the\n-915 // ends of edges. While the edge may be continuous, the end vertex may have\n-916 // discontinuities elsewhere in their neighborhood (i.e. on the \"other\n-side\"\n-917 // of the end-vertex) and so have sibling values associated with them. In\n-most\n-918 // cases the topology for an end-vertex will match and we can use it\n-directly,\n-919 // but we must still check and retrieve as needed.\n-920 //\n-921 // Indices for values corresponding to face-vertices are guaranteed to\n-match,\n-922 // so we can use the child-vertex indices directly.\n-923 //\n-924 // And by \"directly\", we always use getVertexValue(vertexIndex) to\n-reference\n-925 // values in the \"src\" to account for the possible indirection that may\n-exist at\n-926 // level 0 -- where there may be fewer values than vertices and an\n-additional\n-927 // indirection is necessary. We can use a vertex index directly for \"dst\"\n-when\n-928 // it matches.\n-929 //\n-930 // As with applying the mask to vertex data, in order to improve numerical\n-931 // precision, it's better to apply smaller weights first, so begin with the\n-932 // face-weights followed by the edge-weights and the vertex weight last.\n-933 //\n-934 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertValue = pVertValues[0];\n-935 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[0];\n-936\n-937 dst[cVertValue].Clear();\n-938 if (vMask.GetNumFaceWeights() > 0) {\n-939 assert(vMask.AreFaceWeightsForFaceCenters());\n-940\n-941 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = parentLevel.getVertexFaces(vert);\n-942\n-943 for (int i = 0; i < vFaces.size(); ++i) {\n-944\n-945 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);\n-946 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n-947\n-948 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);\n-949 dst[cVertValue].AddWithWeight(dst[cValueOfFace], vFaceWeights[i]);\n-950 }\n-951 }\n-952 if (vMask.GetNumEdgeWeights() > 0) {\n-953\n-954 parentFVar.getVertexEdgeValues(vert, vEdgeValues);\n-955\n-956 for (int i = 0; i < vEdges.size(); ++i) {\n-957 dst[cVertValue].AddWithWeight(src[vEdgeValues[i]], vEdgeWeights[i]);\n-958 }\n-959 }\n-960 dst[cVertValue].AddWithWeight(src[pVertValue], vVertWeight);\n-961 } else {\n-962 //\n-963 // Each FVar value associated with a vertex will be either a corner or a\n-crease,\n-964 // or potentially in transition from corner to crease:\n-965 // - if the CHILD is a corner, there can be no transition so we have a\n-corner\n-966 // - otherwise if the PARENT is a crease, both will be creases (no\n-transition)\n-967 // - otherwise the parent must be a corner and the child a crease\n-(transition)\n-968 //\n-969 Vtr::internal::FVarLevel::ConstValueTagArray pValueTags =\n-parentFVar.getVertexValueTags(vert);\n-970 Vtr::internal::FVarLevel::ConstValueTagArray cValueTags =\n-childFVar.getVertexValueTags(cVert);\n-971\n-972 for (int cSiblingIndex = 0; cSiblingIndex < cVertValues.size();\n-++cSiblingIndex) {\n-973 int pSiblingIndex = refineFVar.getChildValueParentSource(cVert,\n-cSiblingIndex);\n-974 assert(pSiblingIndex == cSiblingIndex);\n-975\n-976 typedef Vtr::internal::FVarLevel::Sibling SiblingIntType;\n-977\n-978 SiblingIntType cSibling = (SiblingIntType) cSiblingIndex;\n-979 SiblingIntType pSibling = (SiblingIntType) pSiblingIndex;\n-980\n-981 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertValue = pVertValues[pSibling];\n-982 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[cSibling];\n-983\n-984 dst[cVertValue].Clear();\n-985 if (isLinearFVar || cValueTags[cSibling].isCorner()) {\n-986 dst[cVertValue].AddWithWeight(src[pVertValue], 1.0f);\n-987 } else {\n-988 //\n-989 // We have either a crease or a transition from corner to crease -- in\n-990 // either case, we need the end values for the full/fractional crease:\n-991 //\n-992 _\bI_\bn_\bd_\be_\bx pEndValues[2];\n-993 parentFVar.getVertexCreaseEndValues(vert, pSibling, pEndValues);\n-994\n-995 Weight vWeight = 0.75f;\n-996 Weight eWeight = 0.125f;\n-997\n-998 //\n-999 // If semi-sharp we need to apply fractional weighting -- if made sharp\n-because\n-1000 // of the other sibling (dependent-sharp) use the fractional weight from\n-that\n-1001 // other sibling (should only occur when there are 2):\n-1002 //\n-1003 if (pValueTags[pSibling].isSemiSharp()) {\n-1004 Weight wCorner = pValueTags[pSibling].isDepSharp()\n-1005 ? refineFVar.getFractionalWeight(vert, !pSibling, cVert, !cSibling)\n-1006 : refineFVar.getFractionalWeight(vert, pSibling, cVert, cSibling);\n-1007 Weight wCrease = 1.0f - wCorner;\n-1008\n-1009 vWeight = wCrease * 0.75f + wCorner;\n-1010 eWeight = wCrease * 0.125f;\n-1011 }\n-1012 dst[cVertValue].AddWithWeight(src[pEndValues[0]], eWeight);\n-1013 dst[cVertValue].AddWithWeight(src[pEndValues[1]], eWeight);\n-1014 dst[cVertValue].AddWithWeight(src[pVertValue], vWeight);\n-1015 }\n-1016 }\n-1017 }\n-1018 }\n-1019}\n-1020\n-1021template \n-1022template \n-1023inline void\n-1024PrimvarRefinerReal::limit(T const & src, U & dstPos, U1 * dstTan1Ptr,\n-U2 * dstTan2Ptr) const {\n-1025\n-1026 Sdc::Scheme scheme(_refiner._subdivOptions);\n-1027\n-1028 Vtr::internal::Level const & level = _refiner.getLevel\n-(_refiner.GetMaxLevel());\n-1029\n-1030 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();\n-1031 bool hasTangents = (dstTan1Ptr && dstTan2Ptr);\n-1032 int numMasks = 1 + (hasTangents ? 2 : 0);\n-1033\n-1034 Vtr::internal::StackBuffer indexBuffer(maxWeightsPerMask);\n-1035 Vtr::internal::StackBuffer weightBuffer(numMasks *\n-maxWeightsPerMask);\n-1036\n-1037 Weight * vPosWeights = weightBuffer,\n-1038 * ePosWeights = vPosWeights + 1,\n-1039 * fPosWeights = ePosWeights + level.getMaxValence();\n-1040 Weight * vTan1Weights = vPosWeights + maxWeightsPerMask,\n-1041 * eTan1Weights = ePosWeights + maxWeightsPerMask,\n-1042 * fTan1Weights = fPosWeights + maxWeightsPerMask;\n-1043 Weight * vTan2Weights = vTan1Weights + maxWeightsPerMask,\n-1044 * eTan2Weights = eTan1Weights + maxWeightsPerMask,\n-1045 * fTan2Weights = fTan1Weights + maxWeightsPerMask;\n-1046\n-1047 Mask posMask( vPosWeights, ePosWeights, fPosWeights);\n-1048 Mask tan1Mask(vTan1Weights, eTan1Weights, fTan1Weights);\n-1049 Mask tan2Mask(vTan2Weights, eTan2Weights, fTan2Weights);\n-1050\n-1051 // This is a bit obscure -- assigning both parent and child as last level\n--- but\n-1052 // this mask type was intended for another purpose. Consider one for the\n-limit:\n-1053 Vtr::internal::VertexInterface vHood(level, level);\n-1054\n-1055 for (int vert = 0; vert < level.getNumVertices(); ++vert) {\n-1056 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = level.getVertexEdges(vert);\n-1057\n-1058 // Incomplete vertices (present in sparse refinement) do not have their\n-full\n-1059 // topological neighborhood to determine a proper limit -- just leave the\n-1060 // vertex at the refined location and continue to the next:\n-1061 if (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0)) {\n-1062 dstPos[vert].Clear();\n-1063 dstPos[vert].AddWithWeight(src[vert], 1.0);\n-1064 if (hasTangents) {\n-1065 (*dstTan1Ptr)[vert].Clear();\n-1066 (*dstTan2Ptr)[vert].Clear();\n-1067 }\n-1068 continue;\n-1069 }\n-1070\n-1071 //\n-1072 // Limit masks require the subdivision Rule for the vertex in order to\n-deal\n-1073 // with infinitely sharp features correctly -- including boundaries and\n-corners.\n-1074 // The vertex neighborhood is minimally defined with vertex and edge\n-counts.\n-1075 //\n-1076 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be vRule = level.getVertexRule(vert);\n-1077\n-1078 // This is a bit obscure -- child vertex index will be ignored here\n-1079 vHood.SetIndex(vert, vert);\n-1080\n-1081 if (hasTangents) {\n-1082 scheme.ComputeVertexLimitMask(vHood, posMask, tan1Mask, tan2Mask, vRule);\n-1083 } else {\n-1084 scheme.ComputeVertexLimitMask(vHood, posMask, vRule);\n-1085 }\n-1086\n-1087 //\n-1088 // Gather the neighboring vertices of this vertex -- the vertices opposite\n-its\n-1089 // incident edges, and the opposite vertices of its incident faces:\n-1090 //\n-1091 _\bI_\bn_\bd_\be_\bx * eIndices = indexBuffer;\n-1092 _\bI_\bn_\bd_\be_\bx * fIndices = indexBuffer + vEdges._\bs_\bi_\bz_\be();\n-1093\n-1094 for (int i = 0; i < vEdges.size(); ++i) {\n-1095 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = level.getEdgeVertices(vEdges[i]);\n-1096\n-1097 eIndices[i] = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];\n-1098 }\n-1099 if (posMask.GetNumFaceWeights() || (hasTangents &&\n-tan1Mask.GetNumFaceWeights())) {\n-1100 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = level.getVertexFaces(vert);\n-1101 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vInFace = level.getVertexFaceLocalIndices(vert);\n-1102\n-1103 for (int i = 0; i < vFaces.size(); ++i) {\n-1104 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = level.getFaceVertices(vFaces[i]);\n-1105\n-1106 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx vOppInFace = (vInFace[i] + 2);\n-1107 if (vOppInFace >= fVerts.size()) vOppInFace -= (_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx)fVerts._\bs_\bi_\bz_\be();\n-1108\n-1109 fIndices[i] = level.getFaceVertices(vFaces[i])[vOppInFace];\n-1110 }\n-1111 }\n-1112\n-1113 //\n-1114 // Combine the weights and indices for position and tangents. As with\n-applying\n-1115 // refinement masks to vertex data, in order to improve numerical\n-precision, it's\n-1116 // better to apply smaller weights first, so begin with the face-weights\n-followed\n-1117 // by the edge-weights and the vertex weight last.\n-1118 //\n-1119 dstPos[vert].Clear();\n-1120 for (int i = 0; i < posMask.GetNumFaceWeights(); ++i) {\n-1121 dstPos[vert].AddWithWeight(src[fIndices[i]], fPosWeights[i]);\n-1122 }\n-1123 for (int i = 0; i < posMask.GetNumEdgeWeights(); ++i) {\n-1124 dstPos[vert].AddWithWeight(src[eIndices[i]], ePosWeights[i]);\n-1125 }\n-1126 dstPos[vert].AddWithWeight(src[vert], vPosWeights[0]);\n-1127\n-1128 //\n-1129 // Apply the tangent masks -- both will have the same number of weights\n-and\n-1130 // indices (one tangent may be \"padded\" to accommodate the other), but\n-these\n-1131 // may differ from those of the position:\n-1132 //\n-1133 if (hasTangents) {\n-1134 assert(tan1Mask.GetNumFaceWeights() == tan2Mask.GetNumFaceWeights());\n-1135 assert(tan1Mask.GetNumEdgeWeights() == tan2Mask.GetNumEdgeWeights());\n-1136\n-1137 U1 & dstTan1 = *dstTan1Ptr;\n-1138 U2 & dstTan2 = *dstTan2Ptr;\n-1139\n-1140 dstTan1[vert].Clear();\n-1141 dstTan2[vert].Clear();\n-1142 for (int i = 0; i < tan1Mask.GetNumFaceWeights(); ++i) {\n-1143 dstTan1[vert].AddWithWeight(src[fIndices[i]], fTan1Weights[i]);\n-1144 dstTan2[vert].AddWithWeight(src[fIndices[i]], fTan2Weights[i]);\n-1145 }\n-1146 for (int i = 0; i < tan1Mask.GetNumEdgeWeights(); ++i) {\n-1147 dstTan1[vert].AddWithWeight(src[eIndices[i]], eTan1Weights[i]);\n-1148 dstTan2[vert].AddWithWeight(src[eIndices[i]], eTan2Weights[i]);\n-1149 }\n-1150 dstTan1[vert].AddWithWeight(src[vert], vTan1Weights[0]);\n-1151 dstTan2[vert].AddWithWeight(src[vert], vTan2Weights[0]);\n-1152 }\n-1153 }\n-1154}\n-1155\n-1156template \n-1157template \n-1158inline void\n-1159PrimvarRefinerReal::limitFVar(T const & src, U & dst, int channel)\n-const {\n-1160\n-1161 Sdc::Scheme scheme(_refiner._subdivOptions);\n-1162\n-1163 Vtr::internal::Level const & level = _refiner.getLevel\n-(_refiner.GetMaxLevel());\n-1164 Vtr::internal::FVarLevel const & fvarChannel = level.getFVarLevel\n-(channel);\n-1165\n-1166 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();\n-1167\n-1168 Vtr::internal::StackBuffer weightBuffer(maxWeightsPerMask);\n-1169 Vtr::internal::StackBuffer vEdgeBuffer(level.getMaxValence());\n-1170\n-1171 // This is a bit obscure -- assign both parent and child as last level\n-1172 Vtr::internal::VertexInterface vHood(level, level);\n-1173\n-1174 for (int vert = 0; vert < level.getNumVertices(); ++vert) {\n-1175\n-1176 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = level.getVertexEdges(vert);\n-1177 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vValues = fvarChannel.getVertexValues(vert);\n-1178\n-1179 // Incomplete vertices (present in sparse refinement) do not have their\n-full\n-1180 // topological neighborhood to determine a proper limit -- just leave the\n-1181 // values (perhaps more than one per vertex) at the refined location.\n-1182 //\n-1183 // The same can be done if the face-varying channel is purely linear.\n-1184 //\n-1185 bool isIncomplete = (level.getVertexTag(vert)._incomplete || (vEdges.size\n-() == 0));\n-1186 if (isIncomplete || fvarChannel.isLinear()) {\n-1187 for (int i = 0; i < vValues.size(); ++i) {\n-1188 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[i];\n-1189\n-1190 dst[vValue].Clear();\n-1191 dst[vValue].AddWithWeight(src[vValue], 1.0f);\n-1192 }\n-1193 continue;\n-1194 }\n-1195\n-1196 bool fvarVertMatchesVertex = fvarChannel.valueTopologyMatches(vValues[0]);\n-1197 if (fvarVertMatchesVertex) {\n-1198\n-1199 // Assign the mask weights to the common buffer and compute the mask:\n-1200 //\n-1201 Weight * vWeights = weightBuffer,\n-1202 * eWeights = vWeights + 1,\n-1203 * fWeights = eWeights + vEdges._\bs_\bi_\bz_\be();\n-1204\n-1205 Mask vMask(vWeights, eWeights, fWeights);\n-1206\n-1207 vHood.SetIndex(vert, vert);\n-1208\n-1209 scheme.ComputeVertexLimitMask(vHood, vMask, level.getVertexRule(vert));\n-1210\n-1211 //\n-1212 // Apply mask to corresponding FVar values for neighboring vertices:\n-1213 //\n-1214 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[0];\n-1215\n-1216 dst[vValue].Clear();\n-1217 if (vMask.GetNumFaceWeights() > 0) {\n-1218 assert(!vMask.AreFaceWeightsForFaceCenters());\n-1219\n-1220 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = level.getVertexFaces(vert);\n-1221 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vInFace = level.getVertexFaceLocalIndices(vert);\n-1222\n-1223 for (int i = 0; i < vFaces.size(); ++i) {\n-1224 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by faceValues = fvarChannel.getFaceValues(vFaces[i]);\n-1225 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx vOppInFace = vInFace[i] + 2;\n-1226 if (vOppInFace >= faceValues.size()) vOppInFace -= faceValues._\bs_\bi_\bz_\be();\n-1227\n-1228 _\bI_\bn_\bd_\be_\bx vValueOppositeFace = faceValues[vOppInFace];\n-1229\n-1230 dst[vValue].AddWithWeight(src[vValueOppositeFace], fWeights[i]);\n-1231 }\n-1232 }\n-1233 if (vMask.GetNumEdgeWeights() > 0) {\n-1234 _\bI_\bn_\bd_\be_\bx * vEdgeValues = vEdgeBuffer;\n-1235 fvarChannel.getVertexEdgeValues(vert, vEdgeValues);\n-1236\n-1237 for (int i = 0; i < vEdges.size(); ++i) {\n-1238 dst[vValue].AddWithWeight(src[vEdgeValues[i]], eWeights[i]);\n-1239 }\n-1240 }\n-1241 dst[vValue].AddWithWeight(src[vValue], vWeights[0]);\n-1242 } else {\n-1243 //\n-1244 // Sibling FVar values associated with a vertex will be either a corner or\n-a crease:\n-1245 //\n-1246 for (int i = 0; i < vValues.size(); ++i) {\n-1247 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[i];\n-1248\n-1249 dst[vValue].Clear();\n-1250 if (fvarChannel.getValueTag(vValue).isCorner()) {\n-1251 dst[vValue].AddWithWeight(src[vValue], 1.0f);\n-1252 } else {\n-1253 _\bI_\bn_\bd_\be_\bx vEndValues[2];\n-1254 fvarChannel.getVertexCreaseEndValues(vert, i, vEndValues);\n-1255\n-1256 dst[vValue].AddWithWeight(src[vEndValues[0]], 1.0f/6.0f);\n-1257 dst[vValue].AddWithWeight(src[vEndValues[1]], 1.0f/6.0f);\n-1258 dst[vValue].AddWithWeight(src[vValue], 2.0f/3.0f);\n-1259 }\n-1260 }\n-1261 }\n-1262 }\n-1263}\n-1264\n-_\b1_\b2_\b6_\b5class _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br : public _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl {\n-1266public:\n-_\b1_\b2_\b6_\b7 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner)\n-1268 : _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(refiner) { }\n-1269};\n-1270\n-1271} // end namespace Far\n-1272\n-1273} // end namespace OPENSUBDIV_VERSION\n-1274using namespace OPENSUBDIV_VERSION;\n-1275} // end namespace OpenSubdiv\n-1276\n-1277#endif /* OPENSUBDIV3_FAR_PRIMVAR_REFINER_H */\n+234\n+235#endif /* OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx\n-Vtr::LocalIndex LocalIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bE_\br_\br_\bo_\br\n-void Error(ErrorType err, const char *format,...)\n-Sends an OSD error with a message (internal use only)\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n Vtr::ConstIndexArray ConstIndexArray\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-Vtr::ConstLocalIndexArray ConstLocalIndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR\n-@ FAR_RUNTIME_ERROR\n-Issue a generic runtime error, but continue execution.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\be_\br_\br_\bo_\br_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-Vtr::Index Index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-int Index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n-bool IndexIsValid(Index index)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR\n-@ SCHEME_BILINEAR\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK\n-@ SCHEME_CATMARK\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP\n-@ SCHEME_LOOP\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n-Applies refinement operations to generic primvar data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt\n-void Limit(T const &src, U &dstPos) const\n-Apply limit weights to a primvar buffer.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b1_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n-PrimvarRefinerReal(TopologyRefiner const &refiner)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt\n-void Limit(T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm\n-void InterpolateFaceUniform(int level, T const &src, U &dst) const\n-Refine uniform (per-face) primvar data between levels.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b9_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n-TopologyRefiner const & GetTopologyRefiner() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void InterpolateVarying(int level, T const &src, U &dst) const\n-Apply only varying interpolation weights to a primvar buffer for a single level\n-of refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b4_\b1_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be\n-void Interpolate(int level, T const &src, U &dst) const\n-Apply vertex interpolation weights to a primvar buffer for a single level of\n-refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void InterpolateFaceVarying(int level, T const &src, U &dst, int channel=0)\n-const\n-Apply face-varying interpolation weights to a primvar buffer associated with a\n-particular face-varyin...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\b~_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n-~PrimvarRefinerReal()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void LimitFaceVarying(T const &src, U &dst, int channel=0) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b6_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n-PrimvarRefiner(TopologyRefiner const &refiner)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+Container for arrays of parametric patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Factory for constructing a PatchTable from a TopologyRefiner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bg_\bV_\be_\bc_\bt_\bo_\br\n+std::vector< PatchFaceTag > PatchTagVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static PatchTable * Create(TopologyRefiner const &refiner, Options\n+options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())\n+Instantiates a PatchTable from a client-provided TopologyRefiner.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Public options for the PatchTable factory.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs\n+unsigned int generateVaryingTables\n+Generate varying patch tables.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+unsigned int generateLegacySharpCornerPatches\n+Generate sharp regular patches at smooth corners (legacy)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs\n+unsigned int shareEndCapPatchPoints\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bG_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+TopologyRefiner::AdaptiveOptions GetRefineAdaptiveOptions() const\n+Determine adaptive refinement options to match assigned patch options.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n+unsigned int maxIsolationLevel\n+Cap adaptive feature isolation to the given level (max. 10)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n+EndCapType GetEndCapType() const\n+Get endcap basis type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+unsigned int generateFVarLegacyLinearPatches\n+Generate all linear face-varying patches (legacy)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bS_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn\n+void SetPatchPrecision()\n+Set precision of vertex patches.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be\n+unsigned int fvarPatchPrecisionDouble\n+Generate double-precision stencils for face-varying patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bS_\be_\bt_\bM_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n+void SetMaxIsolationLevel(unsigned int level)\n+Set maximum isolation level.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b9_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n+unsigned int endCapType\n+EndCapType.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+int const * fvarChannelIndices\n+List containing the indices of the channels selected for the factory.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh\n+unsigned int useSingleCreasePatch\n+Use single crease patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh\n+unsigned int useInfSharpPatch\n+Use infinitely-sharp patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n+void SetEndCapType(EndCapType e)\n+Set endcap basis type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs\n+unsigned int generateVaryingLocalPoints\n+Generate local points with varying patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+unsigned int includeFVarBaseLevelIndices\n+Include base level in face-varying patch point indices (Uniform mode only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs\n+unsigned int generateAllLevels\n+Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be\n+unsigned int patchPrecisionDouble\n+Generate double-precision stencils for vertex patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs\n+unsigned int generateFVarTables\n+Generate face-varying patch tables.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+unsigned int includeBaseLevelIndices\n+Include base level in patch point indices (Uniform mode only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bS_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn\n+void SetFVarPatchPrecision()\n+Set precision of face-varying patches.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+int numFVarChannels\n+Number of channel indices and interpolation modes passed.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs\n+unsigned int triangulateQuads\n+Triangulate 'QUADS' primitives (Uniform mode only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n+EndCapType\n+Choice for approximating irregular patches (end-caps)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bL_\bE_\bG_\bA_\bC_\bY_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY\n+@ ENDCAP_LEGACY_GREGORY\n+legacy option for 2.x style Gregory patches (Catmark only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS\n+@ ENDCAP_GREGORY_BASIS\n+use Gregory patches (highest quality, recommended default)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bN_\bO_\bN_\bE\n+@ ENDCAP_NONE\n+unspecified\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b__\bB_\bA_\bS_\bI_\bS\n+@ ENDCAP_BILINEAR_BASIS\n+use linear patches (simple quads or tris)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bS_\bP_\bL_\bI_\bN_\bE_\b__\bB_\bA_\bS_\bI_\bS\n+@ ENDCAP_BSPLINE_BASIS\n+use BSpline-like patches (same patch type as regular)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options(unsigned int maxIsolation=10)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg\n+Obsolete internal struct not intended for public use \u00e2\u0080\u0093 due to be deprecated.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bi_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be\n+unsigned int _isSingleCrease\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bi_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br\n+unsigned int _isRegular\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bd_\be_\bx\n+unsigned int _boundaryIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk\n+void assignBoundaryPropertiesFromVertexMask(int boundaryVertexMask)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bt_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bM_\ba_\bs_\bk\n+unsigned int _transitionMask\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bh_\ba_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be\n+unsigned int _hasBoundaryEdge\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bM_\ba_\bs_\bk\n+unsigned int _boundaryMask\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:_\b__\bh_\ba_\bs_\bP_\ba_\bt_\bc_\bh\n+unsigned int _hasPatch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk\n+void assignTransitionPropertiesFromEdgeMask(int boundaryVertexMask)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:_\bc_\bl_\be_\ba_\br\n+void clear()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk\n+void assignBoundaryPropertiesFromEdgeMask(int boundaryEdgeMask)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bu_\bn_\bt\n+unsigned int _boundaryCount\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b9\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n-Rule\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE\n-@ RULE_CREASE\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be\n-Scheme is a class template which provides all implementation for the\n-subdivision schemes supported by...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bc_\bh_\be_\bm_\be_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Adaptive refinement options.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh\n+unsigned int useSingleCreasePatch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh\n+unsigned int useInfSharpPatch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+unsigned int considerFVarChannels\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b8_\b0\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b:_\b:_\bs_\bi_\bz_\be\n-size_type size() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b7_\b2\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00728.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00728.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchTableFactory.h File Reference\n+OpenSubdiv: opensubdiv/far/primvarRefiner.h File Reference\n \n \n \n \n \n \n \n@@ -90,33 +90,43 @@\n \n \n \n
\n \n-
patchTableFactory.h File Reference
\n+
primvarRefiner.h File Reference
\n
\n
\n
#include "../version.h"
\n+#include "../sdc/types.h"
\n+#include "../sdc/options.h"
\n+#include "../sdc/bilinearScheme.h"
\n+#include "../sdc/catmarkScheme.h"
\n+#include "../sdc/loopScheme.h"
\n+#include "../vtr/level.h"
\n+#include "../vtr/fvarLevel.h"
\n+#include "../vtr/refinement.h"
\n+#include "../vtr/fvarRefinement.h"
\n+#include "../vtr/stackBuffer.h"
\n+#include "../vtr/componentInterfaces.h"
\n+#include "../far/types.h"
\n+#include "../far/error.h"
\n+#include "../far/topologyLevel.h"
\n #include "../far/topologyRefiner.h"
\n-#include "../far/patchTable.h"
\n+#include <cassert>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n+\n \n

\n Classes

class  PatchTableFactory
 Factory for constructing a PatchTable from a TopologyRefiner. More...
class  PrimvarRefinerReal< REAL >
 Applies refinement operations to generic primvar data. More...
 
struct  PatchTableFactory::Options
 Public options for the PatchTable factory. More...
 
struct  PatchTableFactory::PatchFaceTag
 Obsolete internal struct not intended for public use – due to be deprecated. More...
class  PrimvarRefiner
 
\n \n \n \n \n@@ -125,13 +135,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,32 +1,41 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-patchTableFactory.h File Reference\n+primvarRefiner.h File Reference\n #include \"../version.h\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bb_\bi_\bl_\bi_\bn_\be_\ba_\br_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bl_\bo_\bo_\bp_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bl_\be_\bv_\be_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bs_\bt_\ba_\bc_\bk_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bc_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\"\n #include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-\u00a0 Factory for constructing a _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be from a _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 Applies refinement operations to generic primvar data. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0 Public options for the _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be factory. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg\n-\u00a0 Obsolete internal struct not intended for public use \u2013 due to be\n- deprecated. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00728.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00728.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,5 +1,4 @@\n var a00728 = [\n- [\"PatchTableFactory\", \"a01009.html\", \"a01009\"],\n- [\"Options\", \"a01013.html\", \"a01013\"],\n- [\"PatchFaceTag\", \"a01017.html\", \"a01017\"]\n+ [\"PrimvarRefinerReal< REAL >\", \"a01021.html\", \"a01021\"],\n+ [\"PrimvarRefiner\", \"a01029.html\", \"a01029\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00728_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00728_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchTableFactory.h Source File\n+OpenSubdiv: opensubdiv/far/primvarRefiner.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
patchTableFactory.h
\n+
primvarRefiner.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,250 +118,1233 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24
\n-
25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H
\n-
26#define OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H
\n-
27
\n-
28#include "../version.h"
\n-
29
\n-
30#include "../far/topologyRefiner.h"
\n-
31#include "../far/patchTable.h"
\n-
32
\n-
33namespace OpenSubdiv {
\n-
34namespace OPENSUBDIV_VERSION {
\n-
35
\n-
36namespace Far {
\n-
37
\n-
\n-\n-
41public:
\n-
42
\n-
\n-
45 struct Options {
\n+
24#ifndef OPENSUBDIV3_FAR_PRIMVAR_REFINER_H
\n+
25#define OPENSUBDIV3_FAR_PRIMVAR_REFINER_H
\n+
26
\n+
27#include "../version.h"
\n+
28
\n+
29#include "../sdc/types.h"
\n+
30#include "../sdc/options.h"
\n+
31#include "../sdc/bilinearScheme.h"
\n+
32#include "../sdc/catmarkScheme.h"
\n+
33#include "../sdc/loopScheme.h"
\n+
34#include "../vtr/level.h"
\n+
35#include "../vtr/fvarLevel.h"
\n+
36#include "../vtr/refinement.h"
\n+
37#include "../vtr/fvarRefinement.h"
\n+
38#include "../vtr/stackBuffer.h"
\n+
39#include "../vtr/componentInterfaces.h"
\n+
40#include "../far/types.h"
\n+
41#include "../far/error.h"
\n+
42#include "../far/topologyLevel.h"
\n+
43#include "../far/topologyRefiner.h"
\n+
44
\n+
45#include <cassert>
\n
46
\n-\n-
62
\n-
\n-
63 Options(unsigned int maxIsolation=10) :
\n-
64 generateAllLevels(false),
\n-\n-\n-
67 triangulateQuads(false),
\n-\n-
69 useInfSharpPatch(false),
\n-
70 maxIsolationLevel(maxIsolation & 0xf),
\n-\n-\n-\n-\n-
75 generateFVarTables(false),
\n-\n-\n-\n-\n-\n-\n-
82 { }
\n-
\n-
83
\n-\n-
86
\n-
88 void SetEndCapType(EndCapType e) { endCapType = e & 0x7; }
\n-
89
\n-
91 void SetMaxIsolationLevel(unsigned int level) { maxIsolationLevel = level & 0xf; }
\n-
92
\n-
94 template <typename REAL> void SetPatchPrecision();
\n-
95
\n-
97 template <typename REAL> void SetFVarPatchPrecision();
\n-
98
\n-
\n-\n-\n-
102
\n-
103 adaptiveOptions.useInfSharpPatch = useInfSharpPatch;
\n-\n-
105 adaptiveOptions.considerFVarChannels = generateFVarTables &&
\n-\n-
107 return adaptiveOptions;
\n-
108 }
\n-
\n-
109
\n-
110 unsigned int generateAllLevels : 1,
\n-\n-\n-\n+
47namespace OpenSubdiv {
\n+
48namespace OPENSUBDIV_VERSION {
\n+
49
\n+
50namespace Far {
\n+
51
\n+
55template <typename REAL>
\n+
\n+\n+
57
\n+
58public:
\n+
59 PrimvarRefinerReal(TopologyRefiner const & refiner) : _refiner(refiner) { }
\n+\n+
61
\n+
62 TopologyRefiner const & GetTopologyRefiner() const { return _refiner; }
\n+
63
\n+
65
\n+
100
\n+
\n+
113 template <class T, class U> void Interpolate(int level, T const & src, U & dst) const;
\n
114
\n-\n-\n-\n-
118
\n-
119 // end-capping
\n-\n-\n-
123
\n-
124 // varying
\n-\n-\n-
127
\n-
128 // face-varying
\n-\n-
130
\n-
131 // precision
\n-\n-\n-
134
\n-
135 // legacy behaviors (default to true)
\n-\n-\n-
138
\n-\n-
140 int const * fvarChannelIndices;
\n-
141 };
\n-
\n-
142
\n-
175 static PatchTable * Create(TopologyRefiner const & refiner,
\n-
176 Options options = Options(),
\n-
177 ConstIndexArray selectedFaces = ConstIndexArray());
\n-
178
\n-
179public:
\n-
180 // PatchFaceTag
\n-
181 //
\n-
182 // This simple struct was previously used within the factory to take inventory of
\n-
183 // various kinds of patches to fully allocate buffers prior to populating them. It
\n-
184 // was not intended to be exposed as part of the public interface.
\n-
185 //
\n-
186 // It is no longer used internally and is being kept here to respect preservation
\n-
187 // of the public interface, but it will be deprecated at the earliest opportunity.
\n-
188 //
\n-
191 //
\n-
\n-\n-
193 public:
\n-
194 unsigned int _hasPatch : 1;
\n-
195 unsigned int _isRegular : 1;
\n-
196 unsigned int _transitionMask : 4;
\n-
197 unsigned int _boundaryMask : 4;
\n-
198 unsigned int _boundaryIndex : 2;
\n-
199 unsigned int _boundaryCount : 3;
\n-
200 unsigned int _hasBoundaryEdge : 3;
\n-
201 unsigned int _isSingleCrease : 1;
\n-
202
\n-
203 void clear();
\n-
204 void assignBoundaryPropertiesFromEdgeMask(int boundaryEdgeMask);
\n-
205 void assignBoundaryPropertiesFromVertexMask(int boundaryVertexMask);
\n-
206 void assignTransitionPropertiesFromEdgeMask(int boundaryVertexMask);
\n-
207 };
\n-
\n-
208 typedef std::vector<PatchFaceTag> PatchTagVector;
\n-
209};
\n-
\n-
210
\n-
211
\n-
\n-
212template <> inline void PatchTableFactory::Options::SetPatchPrecision<float>() {
\n-
213 patchPrecisionDouble = false;
\n-
214}
\n-
\n-
\n-
215template <> inline void PatchTableFactory::Options::SetFVarPatchPrecision<float>() {
\n-
216 fvarPatchPrecisionDouble = false;
\n-
217}
\n-
\n-
218
\n-
219template <> inline void PatchTableFactory::Options::SetPatchPrecision<double>() {
\n-
220 patchPrecisionDouble = true;
\n-
221}
\n-
222template <> inline void PatchTableFactory::Options::SetFVarPatchPrecision<double>() {
\n-
223 fvarPatchPrecisionDouble = true;
\n-
224}
\n-
225
\n-
226
\n-
227} // end namespace Far
\n-
228
\n-
229} // end namespace OPENSUBDIV_VERSION
\n-
230using namespace OPENSUBDIV_VERSION;
\n-
231
\n-
232} // end namespace OpenSubdiv
\n+
\n+
130 template <class T, class U> void InterpolateVarying(int level, T const & src, U & dst) const;
\n+
131
\n+
\n+
148 template <class T, class U> void InterpolateFaceUniform(int level, T const & src, U & dst) const;
\n+
149
\n+
\n+
161 template <class T, class U> void InterpolateFaceVarying(int level, T const & src, U & dst, int channel = 0) const;
\n+
162
\n+
163
\n+
\n+
175 template <class T, class U> void Limit(T const & src, U & dstPos) const;
\n+
176
\n+
177 template <class T, class U, class U1, class U2>
\n+
\n+
178 void Limit(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const;
\n+
179
\n+
\n+
180 template <class T, class U> void LimitFaceVarying(T const & src, U & dst, int channel = 0) const;
\n+
181
\n+
183
\n+
184private:
\n+
185 typedef REAL Weight;
\n+
186
\n+
187 // Non-copyable:
\n+
188 PrimvarRefinerReal(PrimvarRefinerReal const & src) : _refiner(src._refiner) { }
\n+
189 PrimvarRefinerReal & operator=(PrimvarRefinerReal const &) { return *this; }
\n+
190
\n+
191 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromFaces(int, T const &, U &) const;
\n+
192 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromEdges(int, T const &, U &) const;
\n+
193 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromVerts(int, T const &, U &) const;
\n+
194
\n+
195 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromFaces(int, T const &, U &, int) const;
\n+
196 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromEdges(int, T const &, U &, int) const;
\n+
197 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromVerts(int, T const &, U &, int) const;
\n+
198
\n+
199 template <Sdc::SchemeType SCHEME, class T, class U, class U1, class U2>
\n+
200 void limit(T const & src, U & pos, U1 * tan1, U2 * tan2) const;
\n+
201
\n+
202 template <Sdc::SchemeType SCHEME, class T, class U>
\n+
203 void limitFVar(T const & src, U & dst, int channel) const;
\n+
204
\n+
205private:
\n+
206 TopologyRefiner const & _refiner;
\n+
207
\n+
208private:
\n+
209 //
\n+
210 // Local class to fulfill interface for <typename MASK> in the Scheme mask queries:
\n+
211 //
\n+
212 class Mask {
\n+
213 public:
\n+
214 typedef REAL Weight; // Also part of the expected interface
\n+
215
\n+
216 public:
\n+
217 Mask(Weight* v, Weight* e, Weight* f) :
\n+
218 _vertWeights(v), _edgeWeights(e), _faceWeights(f),
\n+
219 _vertCount(0), _edgeCount(0), _faceCount(0),
\n+
220 _faceWeightsForFaceCenters(false)
\n+
221 { }
\n+
222
\n+
223 ~Mask() { }
\n+
224
\n+
225 public: // Generic interface expected of <typename MASK>:
\n+
226 int GetNumVertexWeights() const { return _vertCount; }
\n+
227 int GetNumEdgeWeights() const { return _edgeCount; }
\n+
228 int GetNumFaceWeights() const { return _faceCount; }
\n+
229
\n+
230 void SetNumVertexWeights(int count) { _vertCount = count; }
\n+
231 void SetNumEdgeWeights( int count) { _edgeCount = count; }
\n+
232 void SetNumFaceWeights( int count) { _faceCount = count; }
\n
233
\n-
234
\n-
235#endif /* OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H */
\n+
234 Weight const& VertexWeight(int index) const { return _vertWeights[index]; }
\n+
235 Weight const& EdgeWeight( int index) const { return _edgeWeights[index]; }
\n+
236 Weight const& FaceWeight( int index) const { return _faceWeights[index]; }
\n+
237
\n+
238 Weight& VertexWeight(int index) { return _vertWeights[index]; }
\n+
239 Weight& EdgeWeight( int index) { return _edgeWeights[index]; }
\n+
240 Weight& FaceWeight( int index) { return _faceWeights[index]; }
\n+
241
\n+
242 bool AreFaceWeightsForFaceCenters() const { return _faceWeightsForFaceCenters; }
\n+
243 void SetFaceWeightsForFaceCenters(bool on) { _faceWeightsForFaceCenters = on; }
\n+
244
\n+
245 private:
\n+
246 Weight* _vertWeights;
\n+
247 Weight* _edgeWeights;
\n+
248 Weight* _faceWeights;
\n+
249
\n+
250 int _vertCount;
\n+
251 int _edgeCount;
\n+
252 int _faceCount;
\n+
253
\n+
254 bool _faceWeightsForFaceCenters;
\n+
255 };
\n+
256};
\n+
257
\n+
258
\n+
259//
\n+
260// Public entry points to the methods. Queries of the scheme type and its
\n+
261// use as a template parameter in subsequent implementation will be factored
\n+
262// out of a later release:
\n+
263//
\n+
264template <typename REAL>
\n+
265template <class T, class U>
\n+
266inline void
\n+
\n+
267PrimvarRefinerReal<REAL>::Interpolate(int level, T const & src, U & dst) const {
\n+
268
\n+
269 assert(level>0 && level<=(int)_refiner._refinements.size());
\n+
270
\n+
271 switch (_refiner._subdivType) {
\n+\n+
273 interpFromFaces<Sdc::SCHEME_CATMARK>(level, src, dst);
\n+
274 interpFromEdges<Sdc::SCHEME_CATMARK>(level, src, dst);
\n+
275 interpFromVerts<Sdc::SCHEME_CATMARK>(level, src, dst);
\n+
276 break;
\n+
277 case Sdc::SCHEME_LOOP:
\n+
278 interpFromFaces<Sdc::SCHEME_LOOP>(level, src, dst);
\n+
279 interpFromEdges<Sdc::SCHEME_LOOP>(level, src, dst);
\n+
280 interpFromVerts<Sdc::SCHEME_LOOP>(level, src, dst);
\n+
281 break;
\n+\n+
283 interpFromFaces<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n+
284 interpFromEdges<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n+
285 interpFromVerts<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n+
286 break;
\n+
287 }
\n+
288}
\n+
\n+
289
\n+
290template <typename REAL>
\n+
291template <class T, class U>
\n+
292inline void
\n+
\n+
293PrimvarRefinerReal<REAL>::InterpolateFaceVarying(int level, T const & src, U & dst, int channel) const {
\n+
294
\n+
295 assert(level>0 && level<=(int)_refiner._refinements.size());
\n+
296
\n+
297 switch (_refiner._subdivType) {
\n+\n+
299 interpFVarFromFaces<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n+
300 interpFVarFromEdges<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n+
301 interpFVarFromVerts<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n+
302 break;
\n+
303 case Sdc::SCHEME_LOOP:
\n+
304 interpFVarFromFaces<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n+
305 interpFVarFromEdges<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n+
306 interpFVarFromVerts<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n+
307 break;
\n+\n+
309 interpFVarFromFaces<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n+
310 interpFVarFromEdges<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n+
311 interpFVarFromVerts<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n+
312 break;
\n+
313 }
\n+
314}
\n+
\n+
315
\n+
316template <typename REAL>
\n+
317template <class T, class U>
\n+
318inline void
\n+
\n+
319PrimvarRefinerReal<REAL>::Limit(T const & src, U & dst) const {
\n+
320
\n+
321 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n+\n+
323 "Failure in PrimvarRefiner::Limit() -- "
\n+
324 "last level of refinement does not include full topology.");
\n+
325 return;
\n+
326 }
\n+
327
\n+
328 switch (_refiner._subdivType) {
\n+\n+
330 limit<Sdc::SCHEME_CATMARK>(src, dst, (U*)0, (U*)0);
\n+
331 break;
\n+
332 case Sdc::SCHEME_LOOP:
\n+
333 limit<Sdc::SCHEME_LOOP>(src, dst, (U*)0, (U*)0);
\n+
334 break;
\n+\n+
336 limit<Sdc::SCHEME_BILINEAR>(src, dst, (U*)0, (U*)0);
\n+
337 break;
\n+
338 }
\n+
339}
\n+
\n+
340
\n+
341template <typename REAL>
\n+
342template <class T, class U, class U1, class U2>
\n+
343inline void
\n+
\n+
344PrimvarRefinerReal<REAL>::Limit(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const {
\n+
345
\n+
346 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n+\n+
348 "Failure in PrimvarRefiner::Limit() -- "
\n+
349 "last level of refinement does not include full topology.");
\n+
350 return;
\n+
351 }
\n+
352
\n+
353 switch (_refiner._subdivType) {
\n+\n+
355 limit<Sdc::SCHEME_CATMARK>(src, dstPos, &dstTan1, &dstTan2);
\n+
356 break;
\n+
357 case Sdc::SCHEME_LOOP:
\n+
358 limit<Sdc::SCHEME_LOOP>(src, dstPos, &dstTan1, &dstTan2);
\n+
359 break;
\n+\n+
361 limit<Sdc::SCHEME_BILINEAR>(src, dstPos, &dstTan1, &dstTan2);
\n+
362 break;
\n+
363 }
\n+
364}
\n+
\n+
365
\n+
366template <typename REAL>
\n+
367template <class T, class U>
\n+
368inline void
\n+
\n+
369PrimvarRefinerReal<REAL>::LimitFaceVarying(T const & src, U & dst, int channel) const {
\n+
370
\n+
371 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n+\n+
373 "Failure in PrimvarRefiner::LimitFaceVarying() -- "
\n+
374 "last level of refinement does not include full topology.");
\n+
375 return;
\n+
376 }
\n+
377
\n+
378 switch (_refiner._subdivType) {
\n+\n+
380 limitFVar<Sdc::SCHEME_CATMARK>(src, dst, channel);
\n+
381 break;
\n+
382 case Sdc::SCHEME_LOOP:
\n+
383 limitFVar<Sdc::SCHEME_LOOP>(src, dst, channel);
\n+
384 break;
\n+\n+
386 limitFVar<Sdc::SCHEME_BILINEAR>(src, dst, channel);
\n+
387 break;
\n+
388 }
\n+
389}
\n+
\n+
\n+
390
\n+
391template <typename REAL>
\n+
392template <class T, class U>
\n+
393inline void
\n+
\n+
394PrimvarRefinerReal<REAL>::InterpolateFaceUniform(int level, T const & src, U & dst) const {
\n+
395
\n+
396 assert(level>0 && level<=(int)_refiner._refinements.size());
\n+
397
\n+
398 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
399 Vtr::internal::Level const & child = refinement.child();
\n+
400
\n+
401 for (int cFace = 0; cFace < child.getNumFaces(); ++cFace) {
\n+
402
\n+
403 Vtr::Index pFace = refinement.getChildFaceParentFace(cFace);
\n+
404
\n+
405 dst[cFace] = src[pFace];
\n+
406 }
\n+
407}
\n+
\n+
408
\n+
409template <typename REAL>
\n+
410template <class T, class U>
\n+
411inline void
\n+
\n+
412PrimvarRefinerReal<REAL>::InterpolateVarying(int level, T const & src, U & dst) const {
\n+
413
\n+
414 assert(level>0 && level<=(int)_refiner._refinements.size());
\n+
415
\n+
416 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
417 Vtr::internal::Level const & parent = refinement.parent();
\n+
418
\n+
419 //
\n+
420 // Group values to interpolate based on origin -- note that there may
\n+
421 // be none originating from faces:
\n+
422 //
\n+
423 if (refinement.getNumChildVerticesFromFaces() > 0) {
\n+
424
\n+
425 for (int face = 0; face < parent.getNumFaces(); ++face) {
\n+
426
\n+
427 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n+
428 if (Vtr::IndexIsValid(cVert)) {
\n+
429
\n+
430 // Apply the weights to the parent face's vertices:
\n+
431 ConstIndexArray fVerts = parent.getFaceVertices(face);
\n+
432
\n+
433 Weight fVaryingWeight = 1.0f / (Weight) fVerts.size();
\n+
434
\n+
435 dst[cVert].Clear();
\n+
436 for (int i = 0; i < fVerts.size(); ++i) {
\n+
437 dst[cVert].AddWithWeight(src[fVerts[i]], fVaryingWeight);
\n+
438 }
\n+
439 }
\n+
440 }
\n+
441 }
\n+
442 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {
\n+
443
\n+
444 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n+
445 if (Vtr::IndexIsValid(cVert)) {
\n+
446
\n+
447 // Apply the weights to the parent edges's vertices
\n+
448 ConstIndexArray eVerts = parent.getEdgeVertices(edge);
\n+
449
\n+
450 dst[cVert].Clear();
\n+
451 dst[cVert].AddWithWeight(src[eVerts[0]], 0.5f);
\n+
452 dst[cVert].AddWithWeight(src[eVerts[1]], 0.5f);
\n+
453 }
\n+
454 }
\n+
455 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {
\n+
456
\n+
457 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n+
458 if (Vtr::IndexIsValid(cVert)) {
\n+
459
\n+
460 // Essentially copy the parent vertex:
\n+
461 dst[cVert].Clear();
\n+
462 dst[cVert].AddWithWeight(src[vert], 1.0f);
\n+
463 }
\n+
464 }
\n+
465}
\n+
\n+
466
\n+
467
\n+
468//
\n+
469// Internal implementation methods -- grouping vertices to be interpolated
\n+
470// based on the type of parent component from which they originated:
\n+
471//
\n+
472template <typename REAL>
\n+
473template <Sdc::SchemeType SCHEME, class T, class U>
\n+
474inline void
\n+
475PrimvarRefinerReal<REAL>::interpFromFaces(int level, T const & src, U & dst) const {
\n+
476
\n+
477 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
478 Vtr::internal::Level const & parent = refinement.parent();
\n+
479
\n+
480 if (refinement.getNumChildVerticesFromFaces() == 0) return;
\n+
481
\n+
482 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
483
\n+
484 Vtr::internal::StackBuffer<Weight,16> fVertWeights(parent.getMaxValence());
\n+
485
\n+
486 for (int face = 0; face < parent.getNumFaces(); ++face) {
\n+
487
\n+
488 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n+
489 if (!Vtr::IndexIsValid(cVert))
\n+
490 continue;
\n+
491
\n+
492 // Declare and compute mask weights for this vertex relative to its parent face:
\n+
493 ConstIndexArray fVerts = parent.getFaceVertices(face);
\n+
494
\n+
495 Mask fMask(fVertWeights, 0, 0);
\n+
496 Vtr::internal::FaceInterface fHood(fVerts.size());
\n+
497
\n+
498 scheme.ComputeFaceVertexMask(fHood, fMask);
\n+
499
\n+
500 // Apply the weights to the parent face's vertices:
\n+
501 dst[cVert].Clear();
\n+
502
\n+
503 for (int i = 0; i < fVerts.size(); ++i) {
\n+
504
\n+
505 dst[cVert].AddWithWeight(src[fVerts[i]], fVertWeights[i]);
\n+
506 }
\n+
507 }
\n+
508}
\n+
509
\n+
510template <typename REAL>
\n+
511template <Sdc::SchemeType SCHEME, class T, class U>
\n+
512inline void
\n+
513PrimvarRefinerReal<REAL>::interpFromEdges(int level, T const & src, U & dst) const {
\n+
514
\n+
515 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
516 Vtr::internal::Level const & parent = refinement.parent();
\n+
517 Vtr::internal::Level const & child = refinement.child();
\n+
518
\n+
519 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
520
\n+
521 Vtr::internal::EdgeInterface eHood(parent);
\n+
522
\n+
523 Weight eVertWeights[2];
\n+
524 Vtr::internal::StackBuffer<Weight,8> eFaceWeights(parent.getMaxEdgeFaces());
\n+
525
\n+
526 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {
\n+
527
\n+
528 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n+
529 if (!Vtr::IndexIsValid(cVert))
\n+
530 continue;
\n+
531
\n+
532 // Declare and compute mask weights for this vertex relative to its parent edge:
\n+
533 ConstIndexArray eVerts = parent.getEdgeVertices(edge),
\n+
534 eFaces = parent.getEdgeFaces(edge);
\n+
535
\n+
536 Mask eMask(eVertWeights, 0, eFaceWeights);
\n+
537
\n+
538 eHood.SetIndex(edge);
\n+
539
\n+
540 Sdc::Crease::Rule pRule = (parent.getEdgeSharpness(edge) > 0.0f) ? Sdc::Crease::RULE_CREASE : Sdc::Crease::RULE_SMOOTH;
\n+
541 Sdc::Crease::Rule cRule = child.getVertexRule(cVert);
\n+
542
\n+
543 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);
\n+
544
\n+
545 // Apply the weights to the parent edges's vertices and (if applicable) to
\n+
546 // the child vertices of its incident faces:
\n+
547 dst[cVert].Clear();
\n+
548 dst[cVert].AddWithWeight(src[eVerts[0]], eVertWeights[0]);
\n+
549 dst[cVert].AddWithWeight(src[eVerts[1]], eVertWeights[1]);
\n+
550
\n+
551 if (eMask.GetNumFaceWeights() > 0) {
\n+
552
\n+
553 for (int i = 0; i < eFaces.size(); ++i) {
\n+
554
\n+
555 if (eMask.AreFaceWeightsForFaceCenters()) {
\n+
556 assert(refinement.getNumChildVerticesFromFaces() > 0);
\n+
557 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);
\n+
558
\n+
559 assert(Vtr::IndexIsValid(cVertOfFace));
\n+
560 dst[cVert].AddWithWeight(dst[cVertOfFace], eFaceWeights[i]);
\n+
561 } else {
\n+
562 Vtr::Index pFace = eFaces[i];
\n+
563 ConstIndexArray pFaceEdges = parent.getFaceEdges(pFace),
\n+
564 pFaceVerts = parent.getFaceVertices(pFace);
\n+
565
\n+
566 int eInFace = 0;
\n+
567 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;
\n+
568
\n+
569 int vInFace = eInFace + 2;
\n+
570 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts.size();
\n+
571
\n+
572 Vtr::Index pVertNext = pFaceVerts[vInFace];
\n+
573 dst[cVert].AddWithWeight(src[pVertNext], eFaceWeights[i]);
\n+
574 }
\n+
575 }
\n+
576 }
\n+
577 }
\n+
578}
\n+
579
\n+
580template <typename REAL>
\n+
581template <Sdc::SchemeType SCHEME, class T, class U>
\n+
582inline void
\n+
583PrimvarRefinerReal<REAL>::interpFromVerts(int level, T const & src, U & dst) const {
\n+
584
\n+
585 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
586 Vtr::internal::Level const & parent = refinement.parent();
\n+
587 Vtr::internal::Level const & child = refinement.child();
\n+
588
\n+
589 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
590
\n+
591 Vtr::internal::VertexInterface vHood(parent, child);
\n+
592
\n+
593 Vtr::internal::StackBuffer<Weight,32> weightBuffer(2*parent.getMaxValence());
\n+
594
\n+
595 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {
\n+
596
\n+
597 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n+
598 if (!Vtr::IndexIsValid(cVert))
\n+
599 continue;
\n+
600
\n+
601 // Declare and compute mask weights for this vertex relative to its parent edge:
\n+
602 ConstIndexArray vEdges = parent.getVertexEdges(vert),
\n+
603 vFaces = parent.getVertexFaces(vert);
\n+
604
\n+
605 Weight vVertWeight,
\n+
606 * vEdgeWeights = weightBuffer,
\n+
607 * vFaceWeights = vEdgeWeights + vEdges.size();
\n+
608
\n+
609 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);
\n+
610
\n+
611 vHood.SetIndex(vert, cVert);
\n+
612
\n+
613 Sdc::Crease::Rule pRule = parent.getVertexRule(vert);
\n+
614 Sdc::Crease::Rule cRule = child.getVertexRule(cVert);
\n+
615
\n+
616 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);
\n+
617
\n+
618 // Apply the weights to the parent vertex, the vertices opposite its incident
\n+
619 // edges, and the child vertices of its incident faces:
\n+
620 //
\n+
621 // In order to improve numerical precision, it's better to apply smaller weights
\n+
622 // first, so begin with the face-weights followed by the edge-weights and the
\n+
623 // vertex weight last.
\n+
624 dst[cVert].Clear();
\n+
625
\n+
626 if (vMask.GetNumFaceWeights() > 0) {
\n+
627 assert(vMask.AreFaceWeightsForFaceCenters());
\n+
628
\n+
629 for (int i = 0; i < vFaces.size(); ++i) {
\n+
630
\n+
631 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);
\n+
632 assert(Vtr::IndexIsValid(cVertOfFace));
\n+
633 dst[cVert].AddWithWeight(dst[cVertOfFace], vFaceWeights[i]);
\n+
634 }
\n+
635 }
\n+
636 if (vMask.GetNumEdgeWeights() > 0) {
\n+
637
\n+
638 for (int i = 0; i < vEdges.size(); ++i) {
\n+
639
\n+
640 ConstIndexArray eVerts = parent.getEdgeVertices(vEdges[i]);
\n+
641 Vtr::Index pVertOppositeEdge = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];
\n+
642
\n+
643 dst[cVert].AddWithWeight(src[pVertOppositeEdge], vEdgeWeights[i]);
\n+
644 }
\n+
645 }
\n+
646 dst[cVert].AddWithWeight(src[vert], vVertWeight);
\n+
647 }
\n+
648}
\n+
649
\n+
650
\n+
651//
\n+
652// Internal face-varying implementation details:
\n+
653//
\n+
654template <typename REAL>
\n+
655template <Sdc::SchemeType SCHEME, class T, class U>
\n+
656inline void
\n+
657PrimvarRefinerReal<REAL>::interpFVarFromFaces(int level, T const & src, U & dst, int channel) const {
\n+
658
\n+
659 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
660
\n+
661 if (refinement.getNumChildVerticesFromFaces() == 0) return;
\n+
662
\n+
663 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
664
\n+
665 Vtr::internal::Level const & parentLevel = refinement.parent();
\n+
666 Vtr::internal::Level const & childLevel = refinement.child();
\n+
667
\n+
668 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n+
669 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n+
670
\n+
671 Vtr::internal::StackBuffer<Weight,16> fValueWeights(parentLevel.getMaxValence());
\n+
672
\n+
673 for (int face = 0; face < parentLevel.getNumFaces(); ++face) {
\n+
674
\n+
675 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n+
676 if (!Vtr::IndexIsValid(cVert))
\n+
677 continue;
\n+
678
\n+
679 Vtr::Index cVertValue = childFVar.getVertexValueOffset(cVert);
\n+
680
\n+
681 // The only difference for face-varying here is that we get the values associated
\n+
682 // with each face-vertex directly from the FVarLevel, rather than using the parent
\n+
683 // face-vertices directly. If any face-vertex has any sibling values, then we may
\n+
684 // get the wrong one using the face-vertex index directly.
\n+
685
\n+
686 // Declare and compute mask weights for this vertex relative to its parent face:
\n+
687 ConstIndexArray fValues = parentFVar.getFaceValues(face);
\n+
688
\n+
689 Mask fMask(fValueWeights, 0, 0);
\n+
690 Vtr::internal::FaceInterface fHood(fValues.size());
\n+
691
\n+
692 scheme.ComputeFaceVertexMask(fHood, fMask);
\n+
693
\n+
694 // Apply the weights to the parent face's vertices:
\n+
695 dst[cVertValue].Clear();
\n+
696
\n+
697 for (int i = 0; i < fValues.size(); ++i) {
\n+
698 dst[cVertValue].AddWithWeight(src[fValues[i]], fValueWeights[i]);
\n+
699 }
\n+
700 }
\n+
701}
\n+
702
\n+
703template <typename REAL>
\n+
704template <Sdc::SchemeType SCHEME, class T, class U>
\n+
705inline void
\n+
706PrimvarRefinerReal<REAL>::interpFVarFromEdges(int level, T const & src, U & dst, int channel) const {
\n+
707
\n+
708 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
709
\n+
710 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
711
\n+
712 Vtr::internal::Level const & parentLevel = refinement.parent();
\n+
713 Vtr::internal::Level const & childLevel = refinement.child();
\n+
714
\n+
715 Vtr::internal::FVarRefinement const & refineFVar = refinement.getFVarRefinement(channel);
\n+
716 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n+
717 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n+
718
\n+
719 //
\n+
720 // Allocate and initialize (if linearly interpolated) interpolation weights for
\n+
721 // the edge mask:
\n+
722 //
\n+
723 Weight eVertWeights[2];
\n+
724 Vtr::internal::StackBuffer<Weight,8> eFaceWeights(parentLevel.getMaxEdgeFaces());
\n+
725
\n+
726 Mask eMask(eVertWeights, 0, eFaceWeights);
\n+
727
\n+
728 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == Sdc::SCHEME_BILINEAR);
\n+
729 if (isLinearFVar) {
\n+
730 eMask.SetNumVertexWeights(2);
\n+
731 eMask.SetNumEdgeWeights(0);
\n+
732 eMask.SetNumFaceWeights(0);
\n+
733
\n+
734 eVertWeights[0] = 0.5f;
\n+
735 eVertWeights[1] = 0.5f;
\n+
736 }
\n+
737
\n+
738 Vtr::internal::EdgeInterface eHood(parentLevel);
\n+
739
\n+
740 for (int edge = 0; edge < parentLevel.getNumEdges(); ++edge) {
\n+
741
\n+
742 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n+
743 if (!Vtr::IndexIsValid(cVert))
\n+
744 continue;
\n+
745
\n+
746 ConstIndexArray cVertValues = childFVar.getVertexValues(cVert);
\n+
747
\n+
748 bool fvarEdgeVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues[0]);
\n+
749 if (fvarEdgeVertMatchesVertex) {
\n+
750 //
\n+
751 // If smoothly interpolated, compute new weights for the edge mask:
\n+
752 //
\n+
753 if (!isLinearFVar) {
\n+
754 eHood.SetIndex(edge);
\n+
755
\n+
756 Sdc::Crease::Rule pRule = (parentLevel.getEdgeSharpness(edge) > 0.0f)
\n+
757 ? Sdc::Crease::RULE_CREASE : Sdc::Crease::RULE_SMOOTH;
\n+
758 Sdc::Crease::Rule cRule = childLevel.getVertexRule(cVert);
\n+
759
\n+
760 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);
\n+
761 }
\n+
762
\n+
763 // Apply the weights to the parent edge's vertices and (if applicable) to
\n+
764 // the child vertices of its incident faces:
\n+
765 //
\n+
766 // Even though the face-varying topology matches the vertex topology, we need
\n+
767 // to be careful here when getting values corresponding to the two end-vertices.
\n+
768 // While the edge may be continuous, the vertices at their ends may have
\n+
769 // discontinuities elsewhere in their neighborhood (i.e. on the "other side"
\n+
770 // of the end-vertex) and so have sibling values associated with them. In most
\n+
771 // cases the topology for an end-vertex will match and we can use it directly,
\n+
772 // but we must still check and retrieve as needed.
\n+
773 //
\n+
774 // Indices for values corresponding to face-vertices are guaranteed to match,
\n+
775 // so we can use the child-vertex indices directly.
\n+
776 //
\n+
777 // And by "directly", we always use getVertexValue(vertexIndex) to reference
\n+
778 // values in the "src" to account for the possible indirection that may exist at
\n+
779 // level 0 -- where there may be fewer values than vertices and an additional
\n+
780 // indirection is necessary. We can use a vertex index directly for "dst" when
\n+
781 // it matches.
\n+
782 //
\n+
783 Vtr::Index eVertValues[2];
\n+
784
\n+
785 parentFVar.getEdgeFaceValues(edge, 0, eVertValues);
\n+
786
\n+
787 Index cVertValue = cVertValues[0];
\n+
788
\n+
789 dst[cVertValue].Clear();
\n+
790 dst[cVertValue].AddWithWeight(src[eVertValues[0]], eVertWeights[0]);
\n+
791 dst[cVertValue].AddWithWeight(src[eVertValues[1]], eVertWeights[1]);
\n+
792
\n+
793 if (eMask.GetNumFaceWeights() > 0) {
\n+
794
\n+
795 ConstIndexArray eFaces = parentLevel.getEdgeFaces(edge);
\n+
796
\n+
797 for (int i = 0; i < eFaces.size(); ++i) {
\n+
798 if (eMask.AreFaceWeightsForFaceCenters()) {
\n+
799
\n+
800 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);
\n+
801 assert(Vtr::IndexIsValid(cVertOfFace));
\n+
802
\n+
803 Vtr::Index cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);
\n+
804 dst[cVertValue].AddWithWeight(dst[cValueOfFace], eFaceWeights[i]);
\n+
805 } else {
\n+
806 Vtr::Index pFace = eFaces[i];
\n+
807 ConstIndexArray pFaceEdges = parentLevel.getFaceEdges(pFace),
\n+
808 pFaceVerts = parentLevel.getFaceVertices(pFace);
\n+
809
\n+
810 int eInFace = 0;
\n+
811 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;
\n+
812
\n+
813 // Edge "i" spans vertices [i,i+1] so we want i+2...
\n+
814 int vInFace = eInFace + 2;
\n+
815 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts.size();
\n+
816
\n+
817 Vtr::Index pValueNext = parentFVar.getFaceValues(pFace)[vInFace];
\n+
818 dst[cVertValue].AddWithWeight(src[pValueNext], eFaceWeights[i]);
\n+
819 }
\n+
820 }
\n+
821 }
\n+
822 } else {
\n+
823 //
\n+
824 // Mismatched edge-verts should just be linearly interpolated between the pairs of
\n+
825 // values for each sibling of the child edge-vertex -- the question is: which face
\n+
826 // holds that pair of values for a given sibling?
\n+
827 //
\n+
828 // In the manifold case, the sibling and edge-face indices will correspond. We
\n+
829 // will eventually need to update this to account for > 3 incident faces.
\n+
830 //
\n+
831 for (int i = 0; i < cVertValues.size(); ++i) {
\n+
832 Vtr::Index eVertValues[2];
\n+
833 int eFaceIndex = refineFVar.getChildValueParentSource(cVert, i);
\n+
834 assert(eFaceIndex == i);
\n+
835
\n+
836 parentFVar.getEdgeFaceValues(edge, eFaceIndex, eVertValues);
\n+
837
\n+
838 Index cVertValue = cVertValues[i];
\n+
839
\n+
840 dst[cVertValue].Clear();
\n+
841 dst[cVertValue].AddWithWeight(src[eVertValues[0]], 0.5);
\n+
842 dst[cVertValue].AddWithWeight(src[eVertValues[1]], 0.5);
\n+
843 }
\n+
844 }
\n+
845 }
\n+
846}
\n+
847
\n+
848template <typename REAL>
\n+
849template <Sdc::SchemeType SCHEME, class T, class U>
\n+
850inline void
\n+
851PrimvarRefinerReal<REAL>::interpFVarFromVerts(int level, T const & src, U & dst, int channel) const {
\n+
852
\n+
853 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
854
\n+
855 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
856
\n+
857 Vtr::internal::Level const & parentLevel = refinement.parent();
\n+
858 Vtr::internal::Level const & childLevel = refinement.child();
\n+
859
\n+
860 Vtr::internal::FVarRefinement const & refineFVar = refinement.getFVarRefinement(channel);
\n+
861 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n+
862 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n+
863
\n+
864 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == Sdc::SCHEME_BILINEAR);
\n+
865
\n+
866 Vtr::internal::StackBuffer<Weight,32> weightBuffer(2*parentLevel.getMaxValence());
\n+
867
\n+
868 Vtr::internal::StackBuffer<Vtr::Index,16> vEdgeValues(parentLevel.getMaxValence());
\n+
869
\n+
870 Vtr::internal::VertexInterface vHood(parentLevel, childLevel);
\n+
871
\n+
872 for (int vert = 0; vert < parentLevel.getNumVertices(); ++vert) {
\n+
873
\n+
874 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n+
875 if (!Vtr::IndexIsValid(cVert))
\n+
876 continue;
\n+
877
\n+
878 ConstIndexArray pVertValues = parentFVar.getVertexValues(vert),
\n+
879 cVertValues = childFVar.getVertexValues(cVert);
\n+
880
\n+
881 bool fvarVertVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues[0]);
\n+
882 if (isLinearFVar && fvarVertVertMatchesVertex) {
\n+
883 dst[cVertValues[0]].Clear();
\n+
884 dst[cVertValues[0]].AddWithWeight(src[pVertValues[0]], 1.0f);
\n+
885 continue;
\n+
886 }
\n+
887
\n+
888 if (fvarVertVertMatchesVertex) {
\n+
889 //
\n+
890 // Declare and compute mask weights for this vertex relative to its parent edge:
\n+
891 //
\n+
892 // (We really need to encapsulate this somewhere else for use here and in the
\n+
893 // general case)
\n+
894 //
\n+
895 ConstIndexArray vEdges = parentLevel.getVertexEdges(vert);
\n+
896
\n+
897 Weight vVertWeight;
\n+
898 Weight * vEdgeWeights = weightBuffer;
\n+
899 Weight * vFaceWeights = vEdgeWeights + vEdges.size();
\n+
900
\n+
901 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);
\n+
902
\n+
903 vHood.SetIndex(vert, cVert);
\n+
904
\n+
905 Sdc::Crease::Rule pRule = parentLevel.getVertexRule(vert);
\n+
906 Sdc::Crease::Rule cRule = childLevel.getVertexRule(cVert);
\n+
907
\n+
908 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);
\n+
909
\n+
910 // Apply the weights to the parent vertex, the vertices opposite its incident
\n+
911 // edges, and the child vertices of its incident faces:
\n+
912 //
\n+
913 // Even though the face-varying topology matches the vertex topology, we need
\n+
914 // to be careful here when getting values corresponding to vertices at the
\n+
915 // ends of edges. While the edge may be continuous, the end vertex may have
\n+
916 // discontinuities elsewhere in their neighborhood (i.e. on the "other side"
\n+
917 // of the end-vertex) and so have sibling values associated with them. In most
\n+
918 // cases the topology for an end-vertex will match and we can use it directly,
\n+
919 // but we must still check and retrieve as needed.
\n+
920 //
\n+
921 // Indices for values corresponding to face-vertices are guaranteed to match,
\n+
922 // so we can use the child-vertex indices directly.
\n+
923 //
\n+
924 // And by "directly", we always use getVertexValue(vertexIndex) to reference
\n+
925 // values in the "src" to account for the possible indirection that may exist at
\n+
926 // level 0 -- where there may be fewer values than vertices and an additional
\n+
927 // indirection is necessary. We can use a vertex index directly for "dst" when
\n+
928 // it matches.
\n+
929 //
\n+
930 // As with applying the mask to vertex data, in order to improve numerical
\n+
931 // precision, it's better to apply smaller weights first, so begin with the
\n+
932 // face-weights followed by the edge-weights and the vertex weight last.
\n+
933 //
\n+
934 Vtr::Index pVertValue = pVertValues[0];
\n+
935 Vtr::Index cVertValue = cVertValues[0];
\n+
936
\n+
937 dst[cVertValue].Clear();
\n+
938 if (vMask.GetNumFaceWeights() > 0) {
\n+
939 assert(vMask.AreFaceWeightsForFaceCenters());
\n+
940
\n+
941 ConstIndexArray vFaces = parentLevel.getVertexFaces(vert);
\n+
942
\n+
943 for (int i = 0; i < vFaces.size(); ++i) {
\n+
944
\n+
945 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);
\n+
946 assert(Vtr::IndexIsValid(cVertOfFace));
\n+
947
\n+
948 Vtr::Index cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);
\n+
949 dst[cVertValue].AddWithWeight(dst[cValueOfFace], vFaceWeights[i]);
\n+
950 }
\n+
951 }
\n+
952 if (vMask.GetNumEdgeWeights() > 0) {
\n+
953
\n+
954 parentFVar.getVertexEdgeValues(vert, vEdgeValues);
\n+
955
\n+
956 for (int i = 0; i < vEdges.size(); ++i) {
\n+
957 dst[cVertValue].AddWithWeight(src[vEdgeValues[i]], vEdgeWeights[i]);
\n+
958 }
\n+
959 }
\n+
960 dst[cVertValue].AddWithWeight(src[pVertValue], vVertWeight);
\n+
961 } else {
\n+
962 //
\n+
963 // Each FVar value associated with a vertex will be either a corner or a crease,
\n+
964 // or potentially in transition from corner to crease:
\n+
965 // - if the CHILD is a corner, there can be no transition so we have a corner
\n+
966 // - otherwise if the PARENT is a crease, both will be creases (no transition)
\n+
967 // - otherwise the parent must be a corner and the child a crease (transition)
\n+
968 //
\n+
969 Vtr::internal::FVarLevel::ConstValueTagArray pValueTags = parentFVar.getVertexValueTags(vert);
\n+
970 Vtr::internal::FVarLevel::ConstValueTagArray cValueTags = childFVar.getVertexValueTags(cVert);
\n+
971
\n+
972 for (int cSiblingIndex = 0; cSiblingIndex < cVertValues.size(); ++cSiblingIndex) {
\n+
973 int pSiblingIndex = refineFVar.getChildValueParentSource(cVert, cSiblingIndex);
\n+
974 assert(pSiblingIndex == cSiblingIndex);
\n+
975
\n+
976 typedef Vtr::internal::FVarLevel::Sibling SiblingIntType;
\n+
977
\n+
978 SiblingIntType cSibling = (SiblingIntType) cSiblingIndex;
\n+
979 SiblingIntType pSibling = (SiblingIntType) pSiblingIndex;
\n+
980
\n+
981 Vtr::Index pVertValue = pVertValues[pSibling];
\n+
982 Vtr::Index cVertValue = cVertValues[cSibling];
\n+
983
\n+
984 dst[cVertValue].Clear();
\n+
985 if (isLinearFVar || cValueTags[cSibling].isCorner()) {
\n+
986 dst[cVertValue].AddWithWeight(src[pVertValue], 1.0f);
\n+
987 } else {
\n+
988 //
\n+
989 // We have either a crease or a transition from corner to crease -- in
\n+
990 // either case, we need the end values for the full/fractional crease:
\n+
991 //
\n+
992 Index pEndValues[2];
\n+
993 parentFVar.getVertexCreaseEndValues(vert, pSibling, pEndValues);
\n+
994
\n+
995 Weight vWeight = 0.75f;
\n+
996 Weight eWeight = 0.125f;
\n+
997
\n+
998 //
\n+
999 // If semi-sharp we need to apply fractional weighting -- if made sharp because
\n+
1000 // of the other sibling (dependent-sharp) use the fractional weight from that
\n+
1001 // other sibling (should only occur when there are 2):
\n+
1002 //
\n+
1003 if (pValueTags[pSibling].isSemiSharp()) {
\n+
1004 Weight wCorner = pValueTags[pSibling].isDepSharp()
\n+
1005 ? refineFVar.getFractionalWeight(vert, !pSibling, cVert, !cSibling)
\n+
1006 : refineFVar.getFractionalWeight(vert, pSibling, cVert, cSibling);
\n+
1007 Weight wCrease = 1.0f - wCorner;
\n+
1008
\n+
1009 vWeight = wCrease * 0.75f + wCorner;
\n+
1010 eWeight = wCrease * 0.125f;
\n+
1011 }
\n+
1012 dst[cVertValue].AddWithWeight(src[pEndValues[0]], eWeight);
\n+
1013 dst[cVertValue].AddWithWeight(src[pEndValues[1]], eWeight);
\n+
1014 dst[cVertValue].AddWithWeight(src[pVertValue], vWeight);
\n+
1015 }
\n+
1016 }
\n+
1017 }
\n+
1018 }
\n+
1019}
\n+
1020
\n+
1021template <typename REAL>
\n+
1022template <Sdc::SchemeType SCHEME, class T, class U, class U1, class U2>
\n+
1023inline void
\n+
1024PrimvarRefinerReal<REAL>::limit(T const & src, U & dstPos, U1 * dstTan1Ptr, U2 * dstTan2Ptr) const {
\n+
1025
\n+
1026 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
1027
\n+
1028 Vtr::internal::Level const & level = _refiner.getLevel(_refiner.GetMaxLevel());
\n+
1029
\n+
1030 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();
\n+
1031 bool hasTangents = (dstTan1Ptr && dstTan2Ptr);
\n+
1032 int numMasks = 1 + (hasTangents ? 2 : 0);
\n+
1033
\n+
1034 Vtr::internal::StackBuffer<Index,33> indexBuffer(maxWeightsPerMask);
\n+
1035 Vtr::internal::StackBuffer<Weight,99> weightBuffer(numMasks * maxWeightsPerMask);
\n+
1036
\n+
1037 Weight * vPosWeights = weightBuffer,
\n+
1038 * ePosWeights = vPosWeights + 1,
\n+
1039 * fPosWeights = ePosWeights + level.getMaxValence();
\n+
1040 Weight * vTan1Weights = vPosWeights + maxWeightsPerMask,
\n+
1041 * eTan1Weights = ePosWeights + maxWeightsPerMask,
\n+
1042 * fTan1Weights = fPosWeights + maxWeightsPerMask;
\n+
1043 Weight * vTan2Weights = vTan1Weights + maxWeightsPerMask,
\n+
1044 * eTan2Weights = eTan1Weights + maxWeightsPerMask,
\n+
1045 * fTan2Weights = fTan1Weights + maxWeightsPerMask;
\n+
1046
\n+
1047 Mask posMask( vPosWeights, ePosWeights, fPosWeights);
\n+
1048 Mask tan1Mask(vTan1Weights, eTan1Weights, fTan1Weights);
\n+
1049 Mask tan2Mask(vTan2Weights, eTan2Weights, fTan2Weights);
\n+
1050
\n+
1051 // This is a bit obscure -- assigning both parent and child as last level -- but
\n+
1052 // this mask type was intended for another purpose. Consider one for the limit:
\n+
1053 Vtr::internal::VertexInterface vHood(level, level);
\n+
1054
\n+
1055 for (int vert = 0; vert < level.getNumVertices(); ++vert) {
\n+
1056 ConstIndexArray vEdges = level.getVertexEdges(vert);
\n+
1057
\n+
1058 // Incomplete vertices (present in sparse refinement) do not have their full
\n+
1059 // topological neighborhood to determine a proper limit -- just leave the
\n+
1060 // vertex at the refined location and continue to the next:
\n+
1061 if (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0)) {
\n+
1062 dstPos[vert].Clear();
\n+
1063 dstPos[vert].AddWithWeight(src[vert], 1.0);
\n+
1064 if (hasTangents) {
\n+
1065 (*dstTan1Ptr)[vert].Clear();
\n+
1066 (*dstTan2Ptr)[vert].Clear();
\n+
1067 }
\n+
1068 continue;
\n+
1069 }
\n+
1070
\n+
1071 //
\n+
1072 // Limit masks require the subdivision Rule for the vertex in order to deal
\n+
1073 // with infinitely sharp features correctly -- including boundaries and corners.
\n+
1074 // The vertex neighborhood is minimally defined with vertex and edge counts.
\n+
1075 //
\n+
1076 Sdc::Crease::Rule vRule = level.getVertexRule(vert);
\n+
1077
\n+
1078 // This is a bit obscure -- child vertex index will be ignored here
\n+
1079 vHood.SetIndex(vert, vert);
\n+
1080
\n+
1081 if (hasTangents) {
\n+
1082 scheme.ComputeVertexLimitMask(vHood, posMask, tan1Mask, tan2Mask, vRule);
\n+
1083 } else {
\n+
1084 scheme.ComputeVertexLimitMask(vHood, posMask, vRule);
\n+
1085 }
\n+
1086
\n+
1087 //
\n+
1088 // Gather the neighboring vertices of this vertex -- the vertices opposite its
\n+
1089 // incident edges, and the opposite vertices of its incident faces:
\n+
1090 //
\n+
1091 Index * eIndices = indexBuffer;
\n+
1092 Index * fIndices = indexBuffer + vEdges.size();
\n+
1093
\n+
1094 for (int i = 0; i < vEdges.size(); ++i) {
\n+
1095 ConstIndexArray eVerts = level.getEdgeVertices(vEdges[i]);
\n+
1096
\n+
1097 eIndices[i] = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];
\n+
1098 }
\n+
1099 if (posMask.GetNumFaceWeights() || (hasTangents && tan1Mask.GetNumFaceWeights())) {
\n+
1100 ConstIndexArray vFaces = level.getVertexFaces(vert);
\n+
1101 ConstLocalIndexArray vInFace = level.getVertexFaceLocalIndices(vert);
\n+
1102
\n+
1103 for (int i = 0; i < vFaces.size(); ++i) {
\n+
1104 ConstIndexArray fVerts = level.getFaceVertices(vFaces[i]);
\n+
1105
\n+
1106 LocalIndex vOppInFace = (vInFace[i] + 2);
\n+
1107 if (vOppInFace >= fVerts.size()) vOppInFace -= (LocalIndex)fVerts.size();
\n+
1108
\n+
1109 fIndices[i] = level.getFaceVertices(vFaces[i])[vOppInFace];
\n+
1110 }
\n+
1111 }
\n+
1112
\n+
1113 //
\n+
1114 // Combine the weights and indices for position and tangents. As with applying
\n+
1115 // refinement masks to vertex data, in order to improve numerical precision, it's
\n+
1116 // better to apply smaller weights first, so begin with the face-weights followed
\n+
1117 // by the edge-weights and the vertex weight last.
\n+
1118 //
\n+
1119 dstPos[vert].Clear();
\n+
1120 for (int i = 0; i < posMask.GetNumFaceWeights(); ++i) {
\n+
1121 dstPos[vert].AddWithWeight(src[fIndices[i]], fPosWeights[i]);
\n+
1122 }
\n+
1123 for (int i = 0; i < posMask.GetNumEdgeWeights(); ++i) {
\n+
1124 dstPos[vert].AddWithWeight(src[eIndices[i]], ePosWeights[i]);
\n+
1125 }
\n+
1126 dstPos[vert].AddWithWeight(src[vert], vPosWeights[0]);
\n+
1127
\n+
1128 //
\n+
1129 // Apply the tangent masks -- both will have the same number of weights and
\n+
1130 // indices (one tangent may be "padded" to accommodate the other), but these
\n+
1131 // may differ from those of the position:
\n+
1132 //
\n+
1133 if (hasTangents) {
\n+
1134 assert(tan1Mask.GetNumFaceWeights() == tan2Mask.GetNumFaceWeights());
\n+
1135 assert(tan1Mask.GetNumEdgeWeights() == tan2Mask.GetNumEdgeWeights());
\n+
1136
\n+
1137 U1 & dstTan1 = *dstTan1Ptr;
\n+
1138 U2 & dstTan2 = *dstTan2Ptr;
\n+
1139
\n+
1140 dstTan1[vert].Clear();
\n+
1141 dstTan2[vert].Clear();
\n+
1142 for (int i = 0; i < tan1Mask.GetNumFaceWeights(); ++i) {
\n+
1143 dstTan1[vert].AddWithWeight(src[fIndices[i]], fTan1Weights[i]);
\n+
1144 dstTan2[vert].AddWithWeight(src[fIndices[i]], fTan2Weights[i]);
\n+
1145 }
\n+
1146 for (int i = 0; i < tan1Mask.GetNumEdgeWeights(); ++i) {
\n+
1147 dstTan1[vert].AddWithWeight(src[eIndices[i]], eTan1Weights[i]);
\n+
1148 dstTan2[vert].AddWithWeight(src[eIndices[i]], eTan2Weights[i]);
\n+
1149 }
\n+
1150 dstTan1[vert].AddWithWeight(src[vert], vTan1Weights[0]);
\n+
1151 dstTan2[vert].AddWithWeight(src[vert], vTan2Weights[0]);
\n+
1152 }
\n+
1153 }
\n+
1154}
\n+
1155
\n+
1156template <typename REAL>
\n+
1157template <Sdc::SchemeType SCHEME, class T, class U>
\n+
1158inline void
\n+
1159PrimvarRefinerReal<REAL>::limitFVar(T const & src, U & dst, int channel) const {
\n+
1160
\n+
1161 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
1162
\n+
1163 Vtr::internal::Level const & level = _refiner.getLevel(_refiner.GetMaxLevel());
\n+
1164 Vtr::internal::FVarLevel const & fvarChannel = level.getFVarLevel(channel);
\n+
1165
\n+
1166 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();
\n+
1167
\n+
1168 Vtr::internal::StackBuffer<Weight,33> weightBuffer(maxWeightsPerMask);
\n+
1169 Vtr::internal::StackBuffer<Index,16> vEdgeBuffer(level.getMaxValence());
\n+
1170
\n+
1171 // This is a bit obscure -- assign both parent and child as last level
\n+
1172 Vtr::internal::VertexInterface vHood(level, level);
\n+
1173
\n+
1174 for (int vert = 0; vert < level.getNumVertices(); ++vert) {
\n+
1175
\n+
1176 ConstIndexArray vEdges = level.getVertexEdges(vert);
\n+
1177 ConstIndexArray vValues = fvarChannel.getVertexValues(vert);
\n+
1178
\n+
1179 // Incomplete vertices (present in sparse refinement) do not have their full
\n+
1180 // topological neighborhood to determine a proper limit -- just leave the
\n+
1181 // values (perhaps more than one per vertex) at the refined location.
\n+
1182 //
\n+
1183 // The same can be done if the face-varying channel is purely linear.
\n+
1184 //
\n+
1185 bool isIncomplete = (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0));
\n+
1186 if (isIncomplete || fvarChannel.isLinear()) {
\n+
1187 for (int i = 0; i < vValues.size(); ++i) {
\n+
1188 Vtr::Index vValue = vValues[i];
\n+
1189
\n+
1190 dst[vValue].Clear();
\n+
1191 dst[vValue].AddWithWeight(src[vValue], 1.0f);
\n+
1192 }
\n+
1193 continue;
\n+
1194 }
\n+
1195
\n+
1196 bool fvarVertMatchesVertex = fvarChannel.valueTopologyMatches(vValues[0]);
\n+
1197 if (fvarVertMatchesVertex) {
\n+
1198
\n+
1199 // Assign the mask weights to the common buffer and compute the mask:
\n+
1200 //
\n+
1201 Weight * vWeights = weightBuffer,
\n+
1202 * eWeights = vWeights + 1,
\n+
1203 * fWeights = eWeights + vEdges.size();
\n+
1204
\n+
1205 Mask vMask(vWeights, eWeights, fWeights);
\n+
1206
\n+
1207 vHood.SetIndex(vert, vert);
\n+
1208
\n+
1209 scheme.ComputeVertexLimitMask(vHood, vMask, level.getVertexRule(vert));
\n+
1210
\n+
1211 //
\n+
1212 // Apply mask to corresponding FVar values for neighboring vertices:
\n+
1213 //
\n+
1214 Vtr::Index vValue = vValues[0];
\n+
1215
\n+
1216 dst[vValue].Clear();
\n+
1217 if (vMask.GetNumFaceWeights() > 0) {
\n+
1218 assert(!vMask.AreFaceWeightsForFaceCenters());
\n+
1219
\n+
1220 ConstIndexArray vFaces = level.getVertexFaces(vert);
\n+
1221 ConstLocalIndexArray vInFace = level.getVertexFaceLocalIndices(vert);
\n+
1222
\n+
1223 for (int i = 0; i < vFaces.size(); ++i) {
\n+
1224 ConstIndexArray faceValues = fvarChannel.getFaceValues(vFaces[i]);
\n+
1225 LocalIndex vOppInFace = vInFace[i] + 2;
\n+
1226 if (vOppInFace >= faceValues.size()) vOppInFace -= faceValues.size();
\n+
1227
\n+
1228 Index vValueOppositeFace = faceValues[vOppInFace];
\n+
1229
\n+
1230 dst[vValue].AddWithWeight(src[vValueOppositeFace], fWeights[i]);
\n+
1231 }
\n+
1232 }
\n+
1233 if (vMask.GetNumEdgeWeights() > 0) {
\n+
1234 Index * vEdgeValues = vEdgeBuffer;
\n+
1235 fvarChannel.getVertexEdgeValues(vert, vEdgeValues);
\n+
1236
\n+
1237 for (int i = 0; i < vEdges.size(); ++i) {
\n+
1238 dst[vValue].AddWithWeight(src[vEdgeValues[i]], eWeights[i]);
\n+
1239 }
\n+
1240 }
\n+
1241 dst[vValue].AddWithWeight(src[vValue], vWeights[0]);
\n+
1242 } else {
\n+
1243 //
\n+
1244 // Sibling FVar values associated with a vertex will be either a corner or a crease:
\n+
1245 //
\n+
1246 for (int i = 0; i < vValues.size(); ++i) {
\n+
1247 Vtr::Index vValue = vValues[i];
\n+
1248
\n+
1249 dst[vValue].Clear();
\n+
1250 if (fvarChannel.getValueTag(vValue).isCorner()) {
\n+
1251 dst[vValue].AddWithWeight(src[vValue], 1.0f);
\n+
1252 } else {
\n+
1253 Index vEndValues[2];
\n+
1254 fvarChannel.getVertexCreaseEndValues(vert, i, vEndValues);
\n+
1255
\n+
1256 dst[vValue].AddWithWeight(src[vEndValues[0]], 1.0f/6.0f);
\n+
1257 dst[vValue].AddWithWeight(src[vEndValues[1]], 1.0f/6.0f);
\n+
1258 dst[vValue].AddWithWeight(src[vValue], 2.0f/3.0f);
\n+
1259 }
\n+
1260 }
\n+
1261 }
\n+
1262 }
\n+
1263}
\n+
1264
\n+
\n+
1265class PrimvarRefiner : public PrimvarRefinerReal<float> {
\n+
1266public:
\n+
\n+\n+
1268 : PrimvarRefinerReal<float>(refiner) { }
\n+
\n+
1269};
\n+
\n+
1270
\n+
1271} // end namespace Far
\n+
1272
\n+
1273} // end namespace OPENSUBDIV_VERSION
\n+
1274using namespace OPENSUBDIV_VERSION;
\n+
1275} // end namespace OpenSubdiv
\n+
1276
\n+
1277#endif /* OPENSUBDIV3_FAR_PRIMVAR_REFINER_H */
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n \n+\n+
void Error(ErrorType err, const char *format,...)
Sends an OSD error with a message (internal use only)
\n
Vtr::ConstIndexArray ConstIndexArray
Definition types.h:47
\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-
Factory for constructing a PatchTable from a TopologyRefiner.
\n-\n-
static PatchTable * Create(TopologyRefiner const &refiner, Options options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())
Instantiates a PatchTable from a client-provided TopologyRefiner.
\n-\n-
unsigned int generateVaryingTables
Generate varying patch tables.
\n-
unsigned int generateLegacySharpCornerPatches
Generate sharp regular patches at smooth corners (legacy)
\n-\n-
TopologyRefiner::AdaptiveOptions GetRefineAdaptiveOptions() const
Determine adaptive refinement options to match assigned patch options.
\n-
unsigned int maxIsolationLevel
Cap adaptive feature isolation to the given level (max. 10)
\n-\n-
unsigned int generateFVarLegacyLinearPatches
Generate all linear face-varying patches (legacy)
\n-
void SetPatchPrecision()
Set precision of vertex patches.
\n-
unsigned int fvarPatchPrecisionDouble
Generate double-precision stencils for face-varying patches.
\n-
void SetMaxIsolationLevel(unsigned int level)
Set maximum isolation level.
\n-\n-
int const * fvarChannelIndices
List containing the indices of the channels selected for the factory.
\n-\n-\n-\n-
unsigned int generateVaryingLocalPoints
Generate local points with varying patches.
\n-
unsigned int includeFVarBaseLevelIndices
Include base level in face-varying patch point indices (Uniform mode only)
\n-
unsigned int generateAllLevels
Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)
\n-
unsigned int patchPrecisionDouble
Generate double-precision stencils for vertex patches.
\n-
unsigned int generateFVarTables
Generate face-varying patch tables.
\n-
unsigned int includeBaseLevelIndices
Include base level in patch point indices (Uniform mode only)
\n-
void SetFVarPatchPrecision()
Set precision of face-varying patches.
\n-
int numFVarChannels
Number of channel indices and interpolation modes passed.
\n-
unsigned int triangulateQuads
Triangulate 'QUADS' primitives (Uniform mode only)
\n-
EndCapType
Choice for approximating irregular patches (end-caps)
\n-
@ ENDCAP_LEGACY_GREGORY
legacy option for 2.x style Gregory patches (Catmark only)
\n-
@ ENDCAP_GREGORY_BASIS
use Gregory patches (highest quality, recommended default)
\n-\n-
@ ENDCAP_BILINEAR_BASIS
use linear patches (simple quads or tris)
\n-
@ ENDCAP_BSPLINE_BASIS
use BSpline-like patches (same patch type as regular)
\n-\n-
Obsolete internal struct not intended for public use \u2013 due to be deprecated.
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+
Vtr::ConstLocalIndexArray ConstLocalIndexArray
Definition types.h:48
\n+
@ FAR_RUNTIME_ERROR
Issue a generic runtime error, but continue execution.
Definition error.h:40
\n+\n+\n+
bool IndexIsValid(Index index)
Definition types.h:58
\n+\n+\n+\n+
Applies refinement operations to generic primvar data.
\n+
void Limit(T const &src, U &dstPos) const
Apply limit weights to a primvar buffer.
\n+\n+
void Limit(T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const
\n+
void InterpolateFaceUniform(int level, T const &src, U &dst) const
Refine uniform (per-face) primvar data between levels.
\n+\n+
void InterpolateVarying(int level, T const &src, U &dst) const
Apply only varying interpolation weights to a primvar buffer for a single level of refinement.
\n+
void Interpolate(int level, T const &src, U &dst) const
Apply vertex interpolation weights to a primvar buffer for a single level of refinement.
\n+
void InterpolateFaceVarying(int level, T const &src, U &dst, int channel=0) const
Apply face-varying interpolation weights to a primvar buffer associated with a particular face-varyin...
\n+\n+
void LimitFaceVarying(T const &src, U &dst, int channel=0) const
\n+\n+\n
Stores topology data for a specified set of refinement options.
\n-\n-\n-\n-\n+\n+\n+
Scheme is a class template which provides all implementation for the subdivision schemes supported by...
Definition scheme.h:66
\n \n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "encoding", "source2": "encoding", "unified_diff": "@@ -1 +1 @@\n-utf-8\n+us-ascii\n"}, {"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-patchTableFactory.h\n+primvarRefiner.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,410 +23,1388 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24\n-25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H\n-26#define OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H\n-27\n-28#include \"../version.h\"\n-29\n-30#include \"../far/topologyRefiner.h\"\n-31#include \"../far/patchTable.h\"\n-32\n-33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-34namespace OPENSUBDIV_VERSION {\n-35\n-36namespace Far {\n-37\n-_\b4_\b0class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n-41public:\n-42\n-_\b4_\b5 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n+24#ifndef OPENSUBDIV3_FAR_PRIMVAR_REFINER_H\n+25#define OPENSUBDIV3_FAR_PRIMVAR_REFINER_H\n+26\n+27#include \"../version.h\"\n+28\n+29#include \"../sdc/types.h\"\n+30#include \"../sdc/options.h\"\n+31#include \"../sdc/bilinearScheme.h\"\n+32#include \"../sdc/catmarkScheme.h\"\n+33#include \"../sdc/loopScheme.h\"\n+34#include \"../vtr/level.h\"\n+35#include \"../vtr/fvarLevel.h\"\n+36#include \"../vtr/refinement.h\"\n+37#include \"../vtr/fvarRefinement.h\"\n+38#include \"../vtr/stackBuffer.h\"\n+39#include \"../vtr/componentInterfaces.h\"\n+40#include \"../far/types.h\"\n+41#include \"../far/error.h\"\n+42#include \"../far/topologyLevel.h\"\n+43#include \"../far/topologyRefiner.h\"\n+44\n+45#include \n 46\n-_\b5_\b5 enum _\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be {\n-_\b5_\b6 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bN_\bO_\bN_\bE = 0,\n-_\b5_\b7 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b__\bB_\bA_\bS_\bI_\bS,\n-_\b5_\b8 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bS_\bP_\bL_\bI_\bN_\bE_\b__\bB_\bA_\bS_\bI_\bS,\n-_\b5_\b9 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS,\n-60 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bL_\bE_\bG_\bA_\bC_\bY_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY\n-_\b6_\b1 };\n-62\n-_\b6_\b3 _\bO_\bp_\bt_\bi_\bo_\bn_\bs(unsigned int maxIsolation=10) :\n-64 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs(false),\n-65 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(true),\n-66 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(false),\n-67 _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs(false),\n-68 _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh(false),\n-69 _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh(false),\n-70 _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(maxIsolation & 0xf),\n-71 _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be(_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS),\n-72 _\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs(true),\n-73 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs(true),\n-74 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs(true),\n-75 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs(false),\n-76 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be(false),\n-77 _\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be(false),\n-78 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs(true),\n-79 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs(true),\n-80 _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs(-1),\n-81 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(0)\n-82 { }\n-83\n-_\b8_\b5 _\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be _\bG_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be() const { return (_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be)_\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be; }\n-86\n-_\b8_\b8 void _\bS_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be(_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be e) { _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be = e & 0x7; }\n-89\n-_\b9_\b1 void _\bS_\be_\bt_\bM_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(unsigned int level) { _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl = level &\n-0xf; }\n-92\n-_\b9_\b4 template void _\bS_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn();\n-95\n-_\b9_\b7 template void _\bS_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn();\n-98\n-_\b1_\b0_\b0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bG_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs() const {\n-101 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs adaptiveOptions(_\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl);\n-102\n-103 adaptiveOptions._\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh = _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh;\n-104 adaptiveOptions._\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh = _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh;\n-105 adaptiveOptions._\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs = _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs &&\n-106 !_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs;\n-107 return adaptiveOptions;\n-108 }\n-109\n-_\b1_\b1_\b0 unsigned int _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs : 1,\n-_\b1_\b1_\b1 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs : 1,\n-_\b1_\b1_\b2 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs : 1,\n-_\b1_\b1_\b3 _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs : 1,\n+47namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+48namespace OPENSUBDIV_VERSION {\n+49\n+50namespace Far {\n+51\n+55template \n+_\b5_\b6class _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl {\n+57\n+58public:\n+_\b5_\b9 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner) : _refiner(refiner) { }\n+_\b6_\b0 _\b~_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl() { }\n+61\n+_\b6_\b2 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & _\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br() const { return _refiner; }\n+63\n+65\n+100\n+_\b1_\b1_\b3 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(int level, T const & src, U &\n+dst) const;\n 114\n-_\b1_\b1_\b5 _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh : 1,\n-_\b1_\b1_\b6 _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh : 1,\n-_\b1_\b1_\b7 _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl : 4,\n-118\n-119 // end-capping\n-_\b1_\b2_\b0 _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be : 3,\n-_\b1_\b2_\b1 _\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs : 1,\n-123\n-124 // varying\n-_\b1_\b2_\b5 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs : 1,\n-_\b1_\b2_\b6 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs : 1,\n-127\n-128 // face-varying\n-_\b1_\b2_\b9 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs : 1,\n-130\n-131 // precision\n-_\b1_\b3_\b2 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be : 1,\n-_\b1_\b3_\b3 _\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be : 1,\n-134\n-135 // legacy behaviors (default to true)\n-_\b1_\b3_\b6 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs : 1,\n-_\b1_\b3_\b7 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs : 1;\n-138\n-_\b1_\b3_\b9 int _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n-_\b1_\b4_\b0 int const * _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n-141 };\n-142\n-_\b1_\b7_\b5 static _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be * _\bC_\br_\be_\ba_\bt_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n-176 _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs(),\n-177 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by selectedFaces = _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by());\n-178\n-179public:\n-180 // PatchFaceTag\n-181 //\n-182 // This simple struct was previously used within the factory to take\n-inventory of\n-183 // various kinds of patches to fully allocate buffers prior to populating\n-them. It\n-184 // was not intended to be exposed as part of the public interface.\n-185 //\n-186 // It is no longer used internally and is being kept here to respect\n-preservation\n-187 // of the public interface, but it will be deprecated at the earliest\n-opportunity.\n-188 //\n-191 //\n-_\b1_\b9_\b2 struct _\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg {\n-193 public:\n-_\b1_\b9_\b4 unsigned int _\b__\bh_\ba_\bs_\bP_\ba_\bt_\bc_\bh : 1;\n-_\b1_\b9_\b5 unsigned int _\b__\bi_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br : 1;\n-_\b1_\b9_\b6 unsigned int _\b__\bt_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bM_\ba_\bs_\bk : 4;\n-_\b1_\b9_\b7 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bM_\ba_\bs_\bk : 4;\n-_\b1_\b9_\b8 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bd_\be_\bx : 2;\n-_\b1_\b9_\b9 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bu_\bn_\bt : 3;\n-_\b2_\b0_\b0 unsigned int _\b__\bh_\ba_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be : 3;\n-_\b2_\b0_\b1 unsigned int _\b__\bi_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be : 1;\n-202\n-_\b2_\b0_\b3 void _\bc_\bl_\be_\ba_\br();\n-_\b2_\b0_\b4 void _\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk(int boundaryEdgeMask);\n-_\b2_\b0_\b5 void _\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk(int boundaryVertexMask);\n-_\b2_\b0_\b6 void _\ba_\bs_\bs_\bi_\bg_\bn_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk(int boundaryVertexMask);\n-207 };\n-_\b2_\b0_\b8 typedef std::vector _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bg_\bV_\be_\bc_\bt_\bo_\br;\n-209};\n-210\n-211\n-_\b2_\b1_\b2template <> inline void PatchTableFactory::Options::SetPatchPrecision\n-() {\n-213 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be = false;\n-214}\n-_\b2_\b1_\b5template <> inline void PatchTableFactory::Options::\n-SetFVarPatchPrecision() {\n-216 fvarPatchPrecisionDouble = false;\n-217}\n-218\n-219template <> inline void PatchTableFactory::Options::\n-SetPatchPrecision() {\n-220 patchPrecisionDouble = true;\n-221}\n-222template <> inline void PatchTableFactory::Options::\n-SetFVarPatchPrecision() {\n-223 fvarPatchPrecisionDouble = true;\n-224}\n-225\n-226\n-227} // end namespace Far\n-228\n-229} // end namespace OPENSUBDIV_VERSION\n-230using namespace OPENSUBDIV_VERSION;\n-231\n-232} // end namespace OpenSubdiv\n+_\b1_\b3_\b0 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const &\n+src, U & dst) const;\n+131\n+_\b1_\b4_\b8 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm(int level, T const\n+& src, U & dst) const;\n+149\n+_\b1_\b6_\b1 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const\n+& src, U & dst, int channel = 0) const;\n+162\n+163\n+_\b1_\b7_\b5 template void _\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos) const;\n+176\n+177 template \n+_\b1_\b7_\b8 void _\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const;\n+179\n+_\b1_\b8_\b0 template void _\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const & src, U & dst,\n+int channel = 0) const;\n+181\n+183\n+184private:\n+185 typedef REAL Weight;\n+186\n+187 // Non-copyable:\n+188 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl const & src) : _refiner(src._refiner)\n+{ }\n+189 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl & operator=(_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl const &) { return *this;\n+}\n+190\n+191 template void interpFromFaces\n+(int, T const &, U &) const;\n+192 template void interpFromEdges\n+(int, T const &, U &) const;\n+193 template void interpFromVerts\n+(int, T const &, U &) const;\n+194\n+195 template void\n+interpFVarFromFaces(int, T const &, U &, int) const;\n+196 template void\n+interpFVarFromEdges(int, T const &, U &, int) const;\n+197 template void\n+interpFVarFromVerts(int, T const &, U &, int) const;\n+198\n+199 template \n+200 void limit(T const & src, U & pos, U1 * tan1, U2 * tan2) const;\n+201\n+202 template \n+203 void limitFVar(T const & src, U & dst, int channel) const;\n+204\n+205private:\n+206 TopologyRefiner const & _refiner;\n+207\n+208private:\n+209 //\n+210 // Local class to fulfill interface for in the Scheme mask\n+queries:\n+211 //\n+212 class Mask {\n+213 public:\n+214 typedef REAL Weight; // Also part of the expected interface\n+215\n+216 public:\n+217 Mask(Weight* v, Weight* e, Weight* f) :\n+218 _vertWeights(v), _edgeWeights(e), _faceWeights(f),\n+219 _vertCount(0), _edgeCount(0), _faceCount(0),\n+220 _faceWeightsForFaceCenters(false)\n+221 { }\n+222\n+223 ~Mask() { }\n+224\n+225 public: // Generic interface expected of :\n+226 int GetNumVertexWeights() const { return _vertCount; }\n+227 int GetNumEdgeWeights() const { return _edgeCount; }\n+228 int GetNumFaceWeights() const { return _faceCount; }\n+229\n+230 void SetNumVertexWeights(int count) { _vertCount = count; }\n+231 void SetNumEdgeWeights( int count) { _edgeCount = count; }\n+232 void SetNumFaceWeights( int count) { _faceCount = count; }\n 233\n-234\n-235#endif /* OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H */\n+234 Weight const& VertexWeight(int index) const { return _vertWeights[index]; }\n+235 Weight const& EdgeWeight( int index) const { return _edgeWeights[index]; }\n+236 Weight const& FaceWeight( int index) const { return _faceWeights[index]; }\n+237\n+238 Weight& VertexWeight(int index) { return _vertWeights[index]; }\n+239 Weight& EdgeWeight( int index) { return _edgeWeights[index]; }\n+240 Weight& FaceWeight( int index) { return _faceWeights[index]; }\n+241\n+242 bool AreFaceWeightsForFaceCenters() const { return\n+_faceWeightsForFaceCenters; }\n+243 void SetFaceWeightsForFaceCenters(bool on) { _faceWeightsForFaceCenters =\n+on; }\n+244\n+245 private:\n+246 Weight* _vertWeights;\n+247 Weight* _edgeWeights;\n+248 Weight* _faceWeights;\n+249\n+250 int _vertCount;\n+251 int _edgeCount;\n+252 int _faceCount;\n+253\n+254 bool _faceWeightsForFaceCenters;\n+255 };\n+256};\n+257\n+258\n+259//\n+260// Public entry points to the methods. Queries of the scheme type and its\n+261// use as a template parameter in subsequent implementation will be factored\n+262// out of a later release:\n+263//\n+264template \n+265template \n+266inline void\n+_\b2_\b6_\b7_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(int level, T const & src, U & dst)\n+const {\n+268\n+269 assert(level>0 && level<=(int)_refiner._refinements.size());\n+270\n+271 switch (_refiner._subdivType) {\n+272 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+273 interpFromFaces(level, src, dst);\n+274 interpFromEdges(level, src, dst);\n+275 interpFromVerts(level, src, dst);\n+276 break;\n+277 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+278 interpFromFaces(level, src, dst);\n+279 interpFromEdges(level, src, dst);\n+280 interpFromVerts(level, src, dst);\n+281 break;\n+282 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+283 interpFromFaces(level, src, dst);\n+284 interpFromEdges(level, src, dst);\n+285 interpFromVerts(level, src, dst);\n+286 break;\n+287 }\n+288}\n+289\n+290template \n+291template \n+292inline void\n+_\b2_\b9_\b3_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const & src, U\n+& dst, int channel) const {\n+294\n+295 assert(level>0 && level<=(int)_refiner._refinements.size());\n+296\n+297 switch (_refiner._subdivType) {\n+298 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+299 interpFVarFromFaces(level, src, dst, channel);\n+300 interpFVarFromEdges(level, src, dst, channel);\n+301 interpFVarFromVerts(level, src, dst, channel);\n+302 break;\n+303 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+304 interpFVarFromFaces(level, src, dst, channel);\n+305 interpFVarFromEdges(level, src, dst, channel);\n+306 interpFVarFromVerts(level, src, dst, channel);\n+307 break;\n+308 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+309 interpFVarFromFaces(level, src, dst, channel);\n+310 interpFVarFromEdges(level, src, dst, channel);\n+311 interpFVarFromVerts(level, src, dst, channel);\n+312 break;\n+313 }\n+314}\n+315\n+316template \n+317template \n+318inline void\n+_\b3_\b1_\b9_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt(T const & src, U & dst) const {\n+320\n+321 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n+0) {\n+322 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n+323 \"Failure in PrimvarRefiner::Limit() -- \"\n+324 \"last level of refinement does not include full topology.\");\n+325 return;\n+326 }\n+327\n+328 switch (_refiner._subdivType) {\n+329 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+330 limit(src, dst, (U*)0, (U*)0);\n+331 break;\n+332 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+333 limit(src, dst, (U*)0, (U*)0);\n+334 break;\n+335 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+336 limit(src, dst, (U*)0, (U*)0);\n+337 break;\n+338 }\n+339}\n+340\n+341template \n+342template \n+343inline void\n+_\b3_\b4_\b4_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos, U1 & dstTan1, U2\n+& dstTan2) const {\n+345\n+346 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n+0) {\n+347 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n+348 \"Failure in PrimvarRefiner::Limit() -- \"\n+349 \"last level of refinement does not include full topology.\");\n+350 return;\n+351 }\n+352\n+353 switch (_refiner._subdivType) {\n+354 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+355 limit(src, dstPos, &dstTan1, &dstTan2);\n+356 break;\n+357 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+358 limit(src, dstPos, &dstTan1, &dstTan2);\n+359 break;\n+360 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+361 limit(src, dstPos, &dstTan1, &dstTan2);\n+362 break;\n+363 }\n+364}\n+365\n+366template \n+367template \n+368inline void\n+_\b3_\b6_\b9_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const & src, U & dst, int\n+channel) const {\n+370\n+371 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n+0) {\n+372 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n+373 \"Failure in PrimvarRefiner::LimitFaceVarying() -- \"\n+374 \"last level of refinement does not include full topology.\");\n+375 return;\n+376 }\n+377\n+378 switch (_refiner._subdivType) {\n+379 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+380 limitFVar(src, dst, channel);\n+381 break;\n+382 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+383 limitFVar(src, dst, channel);\n+384 break;\n+385 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+386 limitFVar(src, dst, channel);\n+387 break;\n+388 }\n+389}\n+390\n+391template \n+392template \n+393inline void\n+_\b3_\b9_\b4_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm(int level, T const & src, U\n+& dst) const {\n+395\n+396 assert(level>0 && level<=(int)_refiner._refinements.size());\n+397\n+398 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+399 Vtr::internal::Level const & child = refinement.child();\n+400\n+401 for (int cFace = 0; cFace < child.getNumFaces(); ++cFace) {\n+402\n+403 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = refinement.getChildFaceParentFace(cFace);\n+404\n+405 dst[cFace] = src[pFace];\n+406 }\n+407}\n+408\n+409template \n+410template \n+411inline void\n+_\b4_\b1_\b2_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const & src, U &\n+dst) const {\n+413\n+414 assert(level>0 && level<=(int)_refiner._refinements.size());\n+415\n+416 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+417 Vtr::internal::Level const & parent = refinement.parent();\n+418\n+419 //\n+420 // Group values to interpolate based on origin -- note that there may\n+421 // be none originating from faces:\n+422 //\n+423 if (refinement.getNumChildVerticesFromFaces() > 0) {\n+424\n+425 for (int face = 0; face < parent.getNumFaces(); ++face) {\n+426\n+427 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n+428 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n+429\n+430 // Apply the weights to the parent face's vertices:\n+431 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = parent.getFaceVertices(face);\n+432\n+433 Weight fVaryingWeight = 1.0f / (Weight) fVerts._\bs_\bi_\bz_\be();\n+434\n+435 dst[cVert].Clear();\n+436 for (int i = 0; i < fVerts._\bs_\bi_\bz_\be(); ++i) {\n+437 dst[cVert].AddWithWeight(src[fVerts[i]], fVaryingWeight);\n+438 }\n+439 }\n+440 }\n+441 }\n+442 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {\n+443\n+444 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n+445 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n+446\n+447 // Apply the weights to the parent edges's vertices\n+448 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(edge);\n+449\n+450 dst[cVert].Clear();\n+451 dst[cVert].AddWithWeight(src[eVerts[0]], 0.5f);\n+452 dst[cVert].AddWithWeight(src[eVerts[1]], 0.5f);\n+453 }\n+454 }\n+455 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {\n+456\n+457 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n+458 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n+459\n+460 // Essentially copy the parent vertex:\n+461 dst[cVert].Clear();\n+462 dst[cVert].AddWithWeight(src[vert], 1.0f);\n+463 }\n+464 }\n+465}\n+466\n+467\n+468//\n+469// Internal implementation methods -- grouping vertices to be interpolated\n+470// based on the type of parent component from which they originated:\n+471//\n+472template \n+473template \n+474inline void\n+475_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bi_\bn_\bt_\be_\br_\bp_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs(int level, T const & src, U & dst)\n+const {\n+476\n+477 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+478 Vtr::internal::Level const & parent = refinement.parent();\n+479\n+480 if (refinement.getNumChildVerticesFromFaces() == 0) return;\n+481\n+482 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b> scheme(_refiner._subdivOptions);\n+483\n+484 Vtr::internal::StackBuffer fVertWeights(parent.getMaxValence());\n+485\n+486 for (int face = 0; face < parent.getNumFaces(); ++face) {\n+487\n+488 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n+489 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+490 continue;\n+491\n+492 // Declare and compute mask weights for this vertex relative to its parent\n+face:\n+493 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = parent.getFaceVertices(face);\n+494\n+495 Mask fMask(fVertWeights, 0, 0);\n+496 Vtr::internal::FaceInterface fHood(fVerts._\bs_\bi_\bz_\be());\n+497\n+498 scheme.ComputeFaceVertexMask(fHood, fMask);\n+499\n+500 // Apply the weights to the parent face's vertices:\n+501 dst[cVert].Clear();\n+502\n+503 for (int i = 0; i < fVerts._\bs_\bi_\bz_\be(); ++i) {\n+504\n+505 dst[cVert].AddWithWeight(src[fVerts[i]], fVertWeights[i]);\n+506 }\n+507 }\n+508}\n+509\n+510template \n+511template \n+512inline void\n+513PrimvarRefinerReal::interpFromEdges(int level, T const & src, U & dst)\n+const {\n+514\n+515 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+516 Vtr::internal::Level const & parent = refinement.parent();\n+517 Vtr::internal::Level const & child = refinement.child();\n+518\n+519 Sdc::Scheme scheme(_refiner._subdivOptions);\n+520\n+521 Vtr::internal::EdgeInterface eHood(parent);\n+522\n+523 Weight eVertWeights[2];\n+524 Vtr::internal::StackBuffer eFaceWeights(parent.getMaxEdgeFaces\n+());\n+525\n+526 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {\n+527\n+528 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n+529 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+530 continue;\n+531\n+532 // Declare and compute mask weights for this vertex relative to its parent\n+edge:\n+533 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(edge),\n+534 eFaces = parent.getEdgeFaces(edge);\n+535\n+536 Mask eMask(eVertWeights, 0, eFaceWeights);\n+537\n+538 eHood.SetIndex(edge);\n+539\n+540 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = (parent.getEdgeSharpness(edge) > 0.0f) ? _\bS_\bd_\bc_\b:_\b:\n+_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE : Sdc::Crease::RULE_SMOOTH;\n+541 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = child.getVertexRule(cVert);\n+542\n+543 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);\n+544\n+545 // Apply the weights to the parent edges's vertices and (if applicable) to\n+546 // the child vertices of its incident faces:\n+547 dst[cVert].Clear();\n+548 dst[cVert].AddWithWeight(src[eVerts[0]], eVertWeights[0]);\n+549 dst[cVert].AddWithWeight(src[eVerts[1]], eVertWeights[1]);\n+550\n+551 if (eMask.GetNumFaceWeights() > 0) {\n+552\n+553 for (int i = 0; i < eFaces.size(); ++i) {\n+554\n+555 if (eMask.AreFaceWeightsForFaceCenters()) {\n+556 assert(refinement.getNumChildVerticesFromFaces() > 0);\n+557 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);\n+558\n+559 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n+560 dst[cVert].AddWithWeight(dst[cVertOfFace], eFaceWeights[i]);\n+561 } else {\n+562 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = eFaces[i];\n+563 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pFaceEdges = parent.getFaceEdges(pFace),\n+564 pFaceVerts = parent.getFaceVertices(pFace);\n+565\n+566 int eInFace = 0;\n+567 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;\n+568\n+569 int vInFace = eInFace + 2;\n+570 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts._\bs_\bi_\bz_\be();\n+571\n+572 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertNext = pFaceVerts[vInFace];\n+573 dst[cVert].AddWithWeight(src[pVertNext], eFaceWeights[i]);\n+574 }\n+575 }\n+576 }\n+577 }\n+578}\n+579\n+580template \n+581template \n+582inline void\n+583PrimvarRefinerReal::interpFromVerts(int level, T const & src, U & dst)\n+const {\n+584\n+585 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+586 Vtr::internal::Level const & parent = refinement.parent();\n+587 Vtr::internal::Level const & child = refinement.child();\n+588\n+589 Sdc::Scheme scheme(_refiner._subdivOptions);\n+590\n+591 Vtr::internal::VertexInterface vHood(parent, child);\n+592\n+593 Vtr::internal::StackBuffer weightBuffer(2*parent.getMaxValence\n+());\n+594\n+595 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {\n+596\n+597 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n+598 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+599 continue;\n+600\n+601 // Declare and compute mask weights for this vertex relative to its parent\n+edge:\n+602 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = parent.getVertexEdges(vert),\n+603 vFaces = parent.getVertexFaces(vert);\n+604\n+605 Weight vVertWeight,\n+606 * vEdgeWeights = weightBuffer,\n+607 * vFaceWeights = vEdgeWeights + vEdges._\bs_\bi_\bz_\be();\n+608\n+609 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);\n+610\n+611 vHood.SetIndex(vert, cVert);\n+612\n+613 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = parent.getVertexRule(vert);\n+614 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = child.getVertexRule(cVert);\n+615\n+616 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);\n+617\n+618 // Apply the weights to the parent vertex, the vertices opposite its\n+incident\n+619 // edges, and the child vertices of its incident faces:\n+620 //\n+621 // In order to improve numerical precision, it's better to apply smaller\n+weights\n+622 // first, so begin with the face-weights followed by the edge-weights and\n+the\n+623 // vertex weight last.\n+624 dst[cVert].Clear();\n+625\n+626 if (vMask.GetNumFaceWeights() > 0) {\n+627 assert(vMask.AreFaceWeightsForFaceCenters());\n+628\n+629 for (int i = 0; i < vFaces.size(); ++i) {\n+630\n+631 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);\n+632 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n+633 dst[cVert].AddWithWeight(dst[cVertOfFace], vFaceWeights[i]);\n+634 }\n+635 }\n+636 if (vMask.GetNumEdgeWeights() > 0) {\n+637\n+638 for (int i = 0; i < vEdges.size(); ++i) {\n+639\n+640 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(vEdges[i]);\n+641 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertOppositeEdge = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];\n+642\n+643 dst[cVert].AddWithWeight(src[pVertOppositeEdge], vEdgeWeights[i]);\n+644 }\n+645 }\n+646 dst[cVert].AddWithWeight(src[vert], vVertWeight);\n+647 }\n+648}\n+649\n+650\n+651//\n+652// Internal face-varying implementation details:\n+653//\n+654template \n+655template \n+656inline void\n+657PrimvarRefinerReal::interpFVarFromFaces(int level, T const & src, U &\n+dst, int channel) const {\n+658\n+659 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+660\n+661 if (refinement.getNumChildVerticesFromFaces() == 0) return;\n+662\n+663 Sdc::Scheme scheme(_refiner._subdivOptions);\n+664\n+665 Vtr::internal::Level const & parentLevel = refinement.parent();\n+666 Vtr::internal::Level const & childLevel = refinement.child();\n+667\n+668 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n+(channel);\n+669 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n+(channel);\n+670\n+671 Vtr::internal::StackBuffer fValueWeights\n+(parentLevel.getMaxValence());\n+672\n+673 for (int face = 0; face < parentLevel.getNumFaces(); ++face) {\n+674\n+675 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n+676 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+677 continue;\n+678\n+679 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = childFVar.getVertexValueOffset(cVert);\n+680\n+681 // The only difference for face-varying here is that we get the values\n+associated\n+682 // with each face-vertex directly from the FVarLevel, rather than using the\n+parent\n+683 // face-vertices directly. If any face-vertex has any sibling values, then\n+we may\n+684 // get the wrong one using the face-vertex index directly.\n+685\n+686 // Declare and compute mask weights for this vertex relative to its parent\n+face:\n+687 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fValues = parentFVar.getFaceValues(face);\n+688\n+689 Mask fMask(fValueWeights, 0, 0);\n+690 Vtr::internal::FaceInterface fHood(fValues.size());\n+691\n+692 scheme.ComputeFaceVertexMask(fHood, fMask);\n+693\n+694 // Apply the weights to the parent face's vertices:\n+695 dst[cVertValue].Clear();\n+696\n+697 for (int i = 0; i < fValues.size(); ++i) {\n+698 dst[cVertValue].AddWithWeight(src[fValues[i]], fValueWeights[i]);\n+699 }\n+700 }\n+701}\n+702\n+703template \n+704template \n+705inline void\n+706PrimvarRefinerReal::interpFVarFromEdges(int level, T const & src, U &\n+dst, int channel) const {\n+707\n+708 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+709\n+710 Sdc::Scheme scheme(_refiner._subdivOptions);\n+711\n+712 Vtr::internal::Level const & parentLevel = refinement.parent();\n+713 Vtr::internal::Level const & childLevel = refinement.child();\n+714\n+715 Vtr::internal::FVarRefinement const & refineFVar =\n+refinement.getFVarRefinement(channel);\n+716 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n+(channel);\n+717 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n+(channel);\n+718\n+719 //\n+720 // Allocate and initialize (if linearly interpolated) interpolation weights\n+for\n+721 // the edge mask:\n+722 //\n+723 Weight eVertWeights[2];\n+724 Vtr::internal::StackBuffer eFaceWeights\n+(parentLevel.getMaxEdgeFaces());\n+725\n+726 Mask eMask(eVertWeights, 0, eFaceWeights);\n+727\n+728 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == _\bS_\bd_\bc_\b:_\b:\n+_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR);\n+729 if (isLinearFVar) {\n+730 eMask.SetNumVertexWeights(2);\n+731 eMask.SetNumEdgeWeights(0);\n+732 eMask.SetNumFaceWeights(0);\n+733\n+734 eVertWeights[0] = 0.5f;\n+735 eVertWeights[1] = 0.5f;\n+736 }\n+737\n+738 Vtr::internal::EdgeInterface eHood(parentLevel);\n+739\n+740 for (int edge = 0; edge < parentLevel.getNumEdges(); ++edge) {\n+741\n+742 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n+743 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+744 continue;\n+745\n+746 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by cVertValues = childFVar.getVertexValues(cVert);\n+747\n+748 bool fvarEdgeVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues\n+[0]);\n+749 if (fvarEdgeVertMatchesVertex) {\n+750 //\n+751 // If smoothly interpolated, compute new weights for the edge mask:\n+752 //\n+753 if (!isLinearFVar) {\n+754 eHood.SetIndex(edge);\n+755\n+756 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = (parentLevel.getEdgeSharpness(edge) > 0.0f)\n+757 ? _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE : Sdc::Crease::RULE_SMOOTH;\n+758 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = childLevel.getVertexRule(cVert);\n+759\n+760 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);\n+761 }\n+762\n+763 // Apply the weights to the parent edge's vertices and (if applicable) to\n+764 // the child vertices of its incident faces:\n+765 //\n+766 // Even though the face-varying topology matches the vertex topology, we\n+need\n+767 // to be careful here when getting values corresponding to the two end-\n+vertices.\n+768 // While the edge may be continuous, the vertices at their ends may have\n+769 // discontinuities elsewhere in their neighborhood (i.e. on the \"other\n+side\"\n+770 // of the end-vertex) and so have sibling values associated with them. In\n+most\n+771 // cases the topology for an end-vertex will match and we can use it\n+directly,\n+772 // but we must still check and retrieve as needed.\n+773 //\n+774 // Indices for values corresponding to face-vertices are guaranteed to\n+match,\n+775 // so we can use the child-vertex indices directly.\n+776 //\n+777 // And by \"directly\", we always use getVertexValue(vertexIndex) to\n+reference\n+778 // values in the \"src\" to account for the possible indirection that may\n+exist at\n+779 // level 0 -- where there may be fewer values than vertices and an\n+additional\n+780 // indirection is necessary. We can use a vertex index directly for \"dst\"\n+when\n+781 // it matches.\n+782 //\n+783 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx eVertValues[2];\n+784\n+785 parentFVar.getEdgeFaceValues(edge, 0, eVertValues);\n+786\n+787 _\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[0];\n+788\n+789 dst[cVertValue].Clear();\n+790 dst[cVertValue].AddWithWeight(src[eVertValues[0]], eVertWeights[0]);\n+791 dst[cVertValue].AddWithWeight(src[eVertValues[1]], eVertWeights[1]);\n+792\n+793 if (eMask.GetNumFaceWeights() > 0) {\n+794\n+795 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eFaces = parentLevel.getEdgeFaces(edge);\n+796\n+797 for (int i = 0; i < eFaces.size(); ++i) {\n+798 if (eMask.AreFaceWeightsForFaceCenters()) {\n+799\n+800 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);\n+801 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n+802\n+803 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);\n+804 dst[cVertValue].AddWithWeight(dst[cValueOfFace], eFaceWeights[i]);\n+805 } else {\n+806 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = eFaces[i];\n+807 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pFaceEdges = parentLevel.getFaceEdges(pFace),\n+808 pFaceVerts = parentLevel.getFaceVertices(pFace);\n+809\n+810 int eInFace = 0;\n+811 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;\n+812\n+813 // Edge \"i\" spans vertices [i,i+1] so we want i+2...\n+814 int vInFace = eInFace + 2;\n+815 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts._\bs_\bi_\bz_\be();\n+816\n+817 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pValueNext = parentFVar.getFaceValues(pFace)[vInFace];\n+818 dst[cVertValue].AddWithWeight(src[pValueNext], eFaceWeights[i]);\n+819 }\n+820 }\n+821 }\n+822 } else {\n+823 //\n+824 // Mismatched edge-verts should just be linearly interpolated between the\n+pairs of\n+825 // values for each sibling of the child edge-vertex -- the question is:\n+which face\n+826 // holds that pair of values for a given sibling?\n+827 //\n+828 // In the manifold case, the sibling and edge-face indices will correspond.\n+We\n+829 // will eventually need to update this to account for > 3 incident faces.\n+830 //\n+831 for (int i = 0; i < cVertValues.size(); ++i) {\n+832 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx eVertValues[2];\n+833 int eFaceIndex = refineFVar.getChildValueParentSource(cVert, i);\n+834 assert(eFaceIndex == i);\n+835\n+836 parentFVar.getEdgeFaceValues(edge, eFaceIndex, eVertValues);\n+837\n+838 _\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[i];\n+839\n+840 dst[cVertValue].Clear();\n+841 dst[cVertValue].AddWithWeight(src[eVertValues[0]], 0.5);\n+842 dst[cVertValue].AddWithWeight(src[eVertValues[1]], 0.5);\n+843 }\n+844 }\n+845 }\n+846}\n+847\n+848template \n+849template \n+850inline void\n+851PrimvarRefinerReal::interpFVarFromVerts(int level, T const & src, U &\n+dst, int channel) const {\n+852\n+853 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+854\n+855 Sdc::Scheme scheme(_refiner._subdivOptions);\n+856\n+857 Vtr::internal::Level const & parentLevel = refinement.parent();\n+858 Vtr::internal::Level const & childLevel = refinement.child();\n+859\n+860 Vtr::internal::FVarRefinement const & refineFVar =\n+refinement.getFVarRefinement(channel);\n+861 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n+(channel);\n+862 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n+(channel);\n+863\n+864 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == _\bS_\bd_\bc_\b:_\b:\n+_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR);\n+865\n+866 Vtr::internal::StackBuffer weightBuffer\n+(2*parentLevel.getMaxValence());\n+867\n+868 Vtr::internal::StackBuffer vEdgeValues\n+(parentLevel.getMaxValence());\n+869\n+870 Vtr::internal::VertexInterface vHood(parentLevel, childLevel);\n+871\n+872 for (int vert = 0; vert < parentLevel.getNumVertices(); ++vert) {\n+873\n+874 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n+875 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+876 continue;\n+877\n+878 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pVertValues = parentFVar.getVertexValues(vert),\n+879 cVertValues = childFVar.getVertexValues(cVert);\n+880\n+881 bool fvarVertVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues\n+[0]);\n+882 if (isLinearFVar && fvarVertVertMatchesVertex) {\n+883 dst[cVertValues[0]].Clear();\n+884 dst[cVertValues[0]].AddWithWeight(src[pVertValues[0]], 1.0f);\n+885 continue;\n+886 }\n+887\n+888 if (fvarVertVertMatchesVertex) {\n+889 //\n+890 // Declare and compute mask weights for this vertex relative to its parent\n+edge:\n+891 //\n+892 // (We really need to encapsulate this somewhere else for use here and in\n+the\n+893 // general case)\n+894 //\n+895 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = parentLevel.getVertexEdges(vert);\n+896\n+897 Weight vVertWeight;\n+898 Weight * vEdgeWeights = weightBuffer;\n+899 Weight * vFaceWeights = vEdgeWeights + vEdges._\bs_\bi_\bz_\be();\n+900\n+901 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);\n+902\n+903 vHood.SetIndex(vert, cVert);\n+904\n+905 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = parentLevel.getVertexRule(vert);\n+906 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = childLevel.getVertexRule(cVert);\n+907\n+908 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);\n+909\n+910 // Apply the weights to the parent vertex, the vertices opposite its\n+incident\n+911 // edges, and the child vertices of its incident faces:\n+912 //\n+913 // Even though the face-varying topology matches the vertex topology, we\n+need\n+914 // to be careful here when getting values corresponding to vertices at the\n+915 // ends of edges. While the edge may be continuous, the end vertex may have\n+916 // discontinuities elsewhere in their neighborhood (i.e. on the \"other\n+side\"\n+917 // of the end-vertex) and so have sibling values associated with them. In\n+most\n+918 // cases the topology for an end-vertex will match and we can use it\n+directly,\n+919 // but we must still check and retrieve as needed.\n+920 //\n+921 // Indices for values corresponding to face-vertices are guaranteed to\n+match,\n+922 // so we can use the child-vertex indices directly.\n+923 //\n+924 // And by \"directly\", we always use getVertexValue(vertexIndex) to\n+reference\n+925 // values in the \"src\" to account for the possible indirection that may\n+exist at\n+926 // level 0 -- where there may be fewer values than vertices and an\n+additional\n+927 // indirection is necessary. We can use a vertex index directly for \"dst\"\n+when\n+928 // it matches.\n+929 //\n+930 // As with applying the mask to vertex data, in order to improve numerical\n+931 // precision, it's better to apply smaller weights first, so begin with the\n+932 // face-weights followed by the edge-weights and the vertex weight last.\n+933 //\n+934 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertValue = pVertValues[0];\n+935 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[0];\n+936\n+937 dst[cVertValue].Clear();\n+938 if (vMask.GetNumFaceWeights() > 0) {\n+939 assert(vMask.AreFaceWeightsForFaceCenters());\n+940\n+941 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = parentLevel.getVertexFaces(vert);\n+942\n+943 for (int i = 0; i < vFaces.size(); ++i) {\n+944\n+945 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);\n+946 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n+947\n+948 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);\n+949 dst[cVertValue].AddWithWeight(dst[cValueOfFace], vFaceWeights[i]);\n+950 }\n+951 }\n+952 if (vMask.GetNumEdgeWeights() > 0) {\n+953\n+954 parentFVar.getVertexEdgeValues(vert, vEdgeValues);\n+955\n+956 for (int i = 0; i < vEdges.size(); ++i) {\n+957 dst[cVertValue].AddWithWeight(src[vEdgeValues[i]], vEdgeWeights[i]);\n+958 }\n+959 }\n+960 dst[cVertValue].AddWithWeight(src[pVertValue], vVertWeight);\n+961 } else {\n+962 //\n+963 // Each FVar value associated with a vertex will be either a corner or a\n+crease,\n+964 // or potentially in transition from corner to crease:\n+965 // - if the CHILD is a corner, there can be no transition so we have a\n+corner\n+966 // - otherwise if the PARENT is a crease, both will be creases (no\n+transition)\n+967 // - otherwise the parent must be a corner and the child a crease\n+(transition)\n+968 //\n+969 Vtr::internal::FVarLevel::ConstValueTagArray pValueTags =\n+parentFVar.getVertexValueTags(vert);\n+970 Vtr::internal::FVarLevel::ConstValueTagArray cValueTags =\n+childFVar.getVertexValueTags(cVert);\n+971\n+972 for (int cSiblingIndex = 0; cSiblingIndex < cVertValues.size();\n+++cSiblingIndex) {\n+973 int pSiblingIndex = refineFVar.getChildValueParentSource(cVert,\n+cSiblingIndex);\n+974 assert(pSiblingIndex == cSiblingIndex);\n+975\n+976 typedef Vtr::internal::FVarLevel::Sibling SiblingIntType;\n+977\n+978 SiblingIntType cSibling = (SiblingIntType) cSiblingIndex;\n+979 SiblingIntType pSibling = (SiblingIntType) pSiblingIndex;\n+980\n+981 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertValue = pVertValues[pSibling];\n+982 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[cSibling];\n+983\n+984 dst[cVertValue].Clear();\n+985 if (isLinearFVar || cValueTags[cSibling].isCorner()) {\n+986 dst[cVertValue].AddWithWeight(src[pVertValue], 1.0f);\n+987 } else {\n+988 //\n+989 // We have either a crease or a transition from corner to crease -- in\n+990 // either case, we need the end values for the full/fractional crease:\n+991 //\n+992 _\bI_\bn_\bd_\be_\bx pEndValues[2];\n+993 parentFVar.getVertexCreaseEndValues(vert, pSibling, pEndValues);\n+994\n+995 Weight vWeight = 0.75f;\n+996 Weight eWeight = 0.125f;\n+997\n+998 //\n+999 // If semi-sharp we need to apply fractional weighting -- if made sharp\n+because\n+1000 // of the other sibling (dependent-sharp) use the fractional weight from\n+that\n+1001 // other sibling (should only occur when there are 2):\n+1002 //\n+1003 if (pValueTags[pSibling].isSemiSharp()) {\n+1004 Weight wCorner = pValueTags[pSibling].isDepSharp()\n+1005 ? refineFVar.getFractionalWeight(vert, !pSibling, cVert, !cSibling)\n+1006 : refineFVar.getFractionalWeight(vert, pSibling, cVert, cSibling);\n+1007 Weight wCrease = 1.0f - wCorner;\n+1008\n+1009 vWeight = wCrease * 0.75f + wCorner;\n+1010 eWeight = wCrease * 0.125f;\n+1011 }\n+1012 dst[cVertValue].AddWithWeight(src[pEndValues[0]], eWeight);\n+1013 dst[cVertValue].AddWithWeight(src[pEndValues[1]], eWeight);\n+1014 dst[cVertValue].AddWithWeight(src[pVertValue], vWeight);\n+1015 }\n+1016 }\n+1017 }\n+1018 }\n+1019}\n+1020\n+1021template \n+1022template \n+1023inline void\n+1024PrimvarRefinerReal::limit(T const & src, U & dstPos, U1 * dstTan1Ptr,\n+U2 * dstTan2Ptr) const {\n+1025\n+1026 Sdc::Scheme scheme(_refiner._subdivOptions);\n+1027\n+1028 Vtr::internal::Level const & level = _refiner.getLevel\n+(_refiner.GetMaxLevel());\n+1029\n+1030 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();\n+1031 bool hasTangents = (dstTan1Ptr && dstTan2Ptr);\n+1032 int numMasks = 1 + (hasTangents ? 2 : 0);\n+1033\n+1034 Vtr::internal::StackBuffer indexBuffer(maxWeightsPerMask);\n+1035 Vtr::internal::StackBuffer weightBuffer(numMasks *\n+maxWeightsPerMask);\n+1036\n+1037 Weight * vPosWeights = weightBuffer,\n+1038 * ePosWeights = vPosWeights + 1,\n+1039 * fPosWeights = ePosWeights + level.getMaxValence();\n+1040 Weight * vTan1Weights = vPosWeights + maxWeightsPerMask,\n+1041 * eTan1Weights = ePosWeights + maxWeightsPerMask,\n+1042 * fTan1Weights = fPosWeights + maxWeightsPerMask;\n+1043 Weight * vTan2Weights = vTan1Weights + maxWeightsPerMask,\n+1044 * eTan2Weights = eTan1Weights + maxWeightsPerMask,\n+1045 * fTan2Weights = fTan1Weights + maxWeightsPerMask;\n+1046\n+1047 Mask posMask( vPosWeights, ePosWeights, fPosWeights);\n+1048 Mask tan1Mask(vTan1Weights, eTan1Weights, fTan1Weights);\n+1049 Mask tan2Mask(vTan2Weights, eTan2Weights, fTan2Weights);\n+1050\n+1051 // This is a bit obscure -- assigning both parent and child as last level\n+-- but\n+1052 // this mask type was intended for another purpose. Consider one for the\n+limit:\n+1053 Vtr::internal::VertexInterface vHood(level, level);\n+1054\n+1055 for (int vert = 0; vert < level.getNumVertices(); ++vert) {\n+1056 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = level.getVertexEdges(vert);\n+1057\n+1058 // Incomplete vertices (present in sparse refinement) do not have their\n+full\n+1059 // topological neighborhood to determine a proper limit -- just leave the\n+1060 // vertex at the refined location and continue to the next:\n+1061 if (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0)) {\n+1062 dstPos[vert].Clear();\n+1063 dstPos[vert].AddWithWeight(src[vert], 1.0);\n+1064 if (hasTangents) {\n+1065 (*dstTan1Ptr)[vert].Clear();\n+1066 (*dstTan2Ptr)[vert].Clear();\n+1067 }\n+1068 continue;\n+1069 }\n+1070\n+1071 //\n+1072 // Limit masks require the subdivision Rule for the vertex in order to\n+deal\n+1073 // with infinitely sharp features correctly -- including boundaries and\n+corners.\n+1074 // The vertex neighborhood is minimally defined with vertex and edge\n+counts.\n+1075 //\n+1076 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be vRule = level.getVertexRule(vert);\n+1077\n+1078 // This is a bit obscure -- child vertex index will be ignored here\n+1079 vHood.SetIndex(vert, vert);\n+1080\n+1081 if (hasTangents) {\n+1082 scheme.ComputeVertexLimitMask(vHood, posMask, tan1Mask, tan2Mask, vRule);\n+1083 } else {\n+1084 scheme.ComputeVertexLimitMask(vHood, posMask, vRule);\n+1085 }\n+1086\n+1087 //\n+1088 // Gather the neighboring vertices of this vertex -- the vertices opposite\n+its\n+1089 // incident edges, and the opposite vertices of its incident faces:\n+1090 //\n+1091 _\bI_\bn_\bd_\be_\bx * eIndices = indexBuffer;\n+1092 _\bI_\bn_\bd_\be_\bx * fIndices = indexBuffer + vEdges._\bs_\bi_\bz_\be();\n+1093\n+1094 for (int i = 0; i < vEdges.size(); ++i) {\n+1095 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = level.getEdgeVertices(vEdges[i]);\n+1096\n+1097 eIndices[i] = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];\n+1098 }\n+1099 if (posMask.GetNumFaceWeights() || (hasTangents &&\n+tan1Mask.GetNumFaceWeights())) {\n+1100 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = level.getVertexFaces(vert);\n+1101 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vInFace = level.getVertexFaceLocalIndices(vert);\n+1102\n+1103 for (int i = 0; i < vFaces.size(); ++i) {\n+1104 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = level.getFaceVertices(vFaces[i]);\n+1105\n+1106 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx vOppInFace = (vInFace[i] + 2);\n+1107 if (vOppInFace >= fVerts.size()) vOppInFace -= (_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx)fVerts._\bs_\bi_\bz_\be();\n+1108\n+1109 fIndices[i] = level.getFaceVertices(vFaces[i])[vOppInFace];\n+1110 }\n+1111 }\n+1112\n+1113 //\n+1114 // Combine the weights and indices for position and tangents. As with\n+applying\n+1115 // refinement masks to vertex data, in order to improve numerical\n+precision, it's\n+1116 // better to apply smaller weights first, so begin with the face-weights\n+followed\n+1117 // by the edge-weights and the vertex weight last.\n+1118 //\n+1119 dstPos[vert].Clear();\n+1120 for (int i = 0; i < posMask.GetNumFaceWeights(); ++i) {\n+1121 dstPos[vert].AddWithWeight(src[fIndices[i]], fPosWeights[i]);\n+1122 }\n+1123 for (int i = 0; i < posMask.GetNumEdgeWeights(); ++i) {\n+1124 dstPos[vert].AddWithWeight(src[eIndices[i]], ePosWeights[i]);\n+1125 }\n+1126 dstPos[vert].AddWithWeight(src[vert], vPosWeights[0]);\n+1127\n+1128 //\n+1129 // Apply the tangent masks -- both will have the same number of weights\n+and\n+1130 // indices (one tangent may be \"padded\" to accommodate the other), but\n+these\n+1131 // may differ from those of the position:\n+1132 //\n+1133 if (hasTangents) {\n+1134 assert(tan1Mask.GetNumFaceWeights() == tan2Mask.GetNumFaceWeights());\n+1135 assert(tan1Mask.GetNumEdgeWeights() == tan2Mask.GetNumEdgeWeights());\n+1136\n+1137 U1 & dstTan1 = *dstTan1Ptr;\n+1138 U2 & dstTan2 = *dstTan2Ptr;\n+1139\n+1140 dstTan1[vert].Clear();\n+1141 dstTan2[vert].Clear();\n+1142 for (int i = 0; i < tan1Mask.GetNumFaceWeights(); ++i) {\n+1143 dstTan1[vert].AddWithWeight(src[fIndices[i]], fTan1Weights[i]);\n+1144 dstTan2[vert].AddWithWeight(src[fIndices[i]], fTan2Weights[i]);\n+1145 }\n+1146 for (int i = 0; i < tan1Mask.GetNumEdgeWeights(); ++i) {\n+1147 dstTan1[vert].AddWithWeight(src[eIndices[i]], eTan1Weights[i]);\n+1148 dstTan2[vert].AddWithWeight(src[eIndices[i]], eTan2Weights[i]);\n+1149 }\n+1150 dstTan1[vert].AddWithWeight(src[vert], vTan1Weights[0]);\n+1151 dstTan2[vert].AddWithWeight(src[vert], vTan2Weights[0]);\n+1152 }\n+1153 }\n+1154}\n+1155\n+1156template \n+1157template \n+1158inline void\n+1159PrimvarRefinerReal::limitFVar(T const & src, U & dst, int channel)\n+const {\n+1160\n+1161 Sdc::Scheme scheme(_refiner._subdivOptions);\n+1162\n+1163 Vtr::internal::Level const & level = _refiner.getLevel\n+(_refiner.GetMaxLevel());\n+1164 Vtr::internal::FVarLevel const & fvarChannel = level.getFVarLevel\n+(channel);\n+1165\n+1166 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();\n+1167\n+1168 Vtr::internal::StackBuffer weightBuffer(maxWeightsPerMask);\n+1169 Vtr::internal::StackBuffer vEdgeBuffer(level.getMaxValence());\n+1170\n+1171 // This is a bit obscure -- assign both parent and child as last level\n+1172 Vtr::internal::VertexInterface vHood(level, level);\n+1173\n+1174 for (int vert = 0; vert < level.getNumVertices(); ++vert) {\n+1175\n+1176 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = level.getVertexEdges(vert);\n+1177 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vValues = fvarChannel.getVertexValues(vert);\n+1178\n+1179 // Incomplete vertices (present in sparse refinement) do not have their\n+full\n+1180 // topological neighborhood to determine a proper limit -- just leave the\n+1181 // values (perhaps more than one per vertex) at the refined location.\n+1182 //\n+1183 // The same can be done if the face-varying channel is purely linear.\n+1184 //\n+1185 bool isIncomplete = (level.getVertexTag(vert)._incomplete || (vEdges.size\n+() == 0));\n+1186 if (isIncomplete || fvarChannel.isLinear()) {\n+1187 for (int i = 0; i < vValues.size(); ++i) {\n+1188 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[i];\n+1189\n+1190 dst[vValue].Clear();\n+1191 dst[vValue].AddWithWeight(src[vValue], 1.0f);\n+1192 }\n+1193 continue;\n+1194 }\n+1195\n+1196 bool fvarVertMatchesVertex = fvarChannel.valueTopologyMatches(vValues[0]);\n+1197 if (fvarVertMatchesVertex) {\n+1198\n+1199 // Assign the mask weights to the common buffer and compute the mask:\n+1200 //\n+1201 Weight * vWeights = weightBuffer,\n+1202 * eWeights = vWeights + 1,\n+1203 * fWeights = eWeights + vEdges._\bs_\bi_\bz_\be();\n+1204\n+1205 Mask vMask(vWeights, eWeights, fWeights);\n+1206\n+1207 vHood.SetIndex(vert, vert);\n+1208\n+1209 scheme.ComputeVertexLimitMask(vHood, vMask, level.getVertexRule(vert));\n+1210\n+1211 //\n+1212 // Apply mask to corresponding FVar values for neighboring vertices:\n+1213 //\n+1214 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[0];\n+1215\n+1216 dst[vValue].Clear();\n+1217 if (vMask.GetNumFaceWeights() > 0) {\n+1218 assert(!vMask.AreFaceWeightsForFaceCenters());\n+1219\n+1220 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = level.getVertexFaces(vert);\n+1221 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vInFace = level.getVertexFaceLocalIndices(vert);\n+1222\n+1223 for (int i = 0; i < vFaces.size(); ++i) {\n+1224 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by faceValues = fvarChannel.getFaceValues(vFaces[i]);\n+1225 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx vOppInFace = vInFace[i] + 2;\n+1226 if (vOppInFace >= faceValues.size()) vOppInFace -= faceValues._\bs_\bi_\bz_\be();\n+1227\n+1228 _\bI_\bn_\bd_\be_\bx vValueOppositeFace = faceValues[vOppInFace];\n+1229\n+1230 dst[vValue].AddWithWeight(src[vValueOppositeFace], fWeights[i]);\n+1231 }\n+1232 }\n+1233 if (vMask.GetNumEdgeWeights() > 0) {\n+1234 _\bI_\bn_\bd_\be_\bx * vEdgeValues = vEdgeBuffer;\n+1235 fvarChannel.getVertexEdgeValues(vert, vEdgeValues);\n+1236\n+1237 for (int i = 0; i < vEdges.size(); ++i) {\n+1238 dst[vValue].AddWithWeight(src[vEdgeValues[i]], eWeights[i]);\n+1239 }\n+1240 }\n+1241 dst[vValue].AddWithWeight(src[vValue], vWeights[0]);\n+1242 } else {\n+1243 //\n+1244 // Sibling FVar values associated with a vertex will be either a corner or\n+a crease:\n+1245 //\n+1246 for (int i = 0; i < vValues.size(); ++i) {\n+1247 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[i];\n+1248\n+1249 dst[vValue].Clear();\n+1250 if (fvarChannel.getValueTag(vValue).isCorner()) {\n+1251 dst[vValue].AddWithWeight(src[vValue], 1.0f);\n+1252 } else {\n+1253 _\bI_\bn_\bd_\be_\bx vEndValues[2];\n+1254 fvarChannel.getVertexCreaseEndValues(vert, i, vEndValues);\n+1255\n+1256 dst[vValue].AddWithWeight(src[vEndValues[0]], 1.0f/6.0f);\n+1257 dst[vValue].AddWithWeight(src[vEndValues[1]], 1.0f/6.0f);\n+1258 dst[vValue].AddWithWeight(src[vValue], 2.0f/3.0f);\n+1259 }\n+1260 }\n+1261 }\n+1262 }\n+1263}\n+1264\n+_\b1_\b2_\b6_\b5class _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br : public _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl {\n+1266public:\n+_\b1_\b2_\b6_\b7 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner)\n+1268 : _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(refiner) { }\n+1269};\n+1270\n+1271} // end namespace Far\n+1272\n+1273} // end namespace OPENSUBDIV_VERSION\n+1274using namespace OPENSUBDIV_VERSION;\n+1275} // end namespace OpenSubdiv\n+1276\n+1277#endif /* OPENSUBDIV3_FAR_PRIMVAR_REFINER_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx\n+Vtr::LocalIndex LocalIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bE_\br_\br_\bo_\br\n+void Error(ErrorType err, const char *format,...)\n+Sends an OSD error with a message (internal use only)\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n Vtr::ConstIndexArray ConstIndexArray\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-Container for arrays of parametric patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Factory for constructing a PatchTable from a TopologyRefiner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bg_\bV_\be_\bc_\bt_\bo_\br\n-std::vector< PatchFaceTag > PatchTagVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static PatchTable * Create(TopologyRefiner const &refiner, Options\n-options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())\n-Instantiates a PatchTable from a client-provided TopologyRefiner.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Public options for the PatchTable factory.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs\n-unsigned int generateVaryingTables\n-Generate varying patch tables.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-unsigned int generateLegacySharpCornerPatches\n-Generate sharp regular patches at smooth corners (legacy)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs\n-unsigned int shareEndCapPatchPoints\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bG_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-TopologyRefiner::AdaptiveOptions GetRefineAdaptiveOptions() const\n-Determine adaptive refinement options to match assigned patch options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n-unsigned int maxIsolationLevel\n-Cap adaptive feature isolation to the given level (max. 10)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n-EndCapType GetEndCapType() const\n-Get endcap basis type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-unsigned int generateFVarLegacyLinearPatches\n-Generate all linear face-varying patches (legacy)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn\n-void SetPatchPrecision()\n-Set precision of vertex patches.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be\n-unsigned int fvarPatchPrecisionDouble\n-Generate double-precision stencils for face-varying patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bM_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n-void SetMaxIsolationLevel(unsigned int level)\n-Set maximum isolation level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b9_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n-unsigned int endCapType\n-EndCapType.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-int const * fvarChannelIndices\n-List containing the indices of the channels selected for the factory.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh\n-unsigned int useSingleCreasePatch\n-Use single crease patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh\n-unsigned int useInfSharpPatch\n-Use infinitely-sharp patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n-void SetEndCapType(EndCapType e)\n-Set endcap basis type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs\n-unsigned int generateVaryingLocalPoints\n-Generate local points with varying patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-unsigned int includeFVarBaseLevelIndices\n-Include base level in face-varying patch point indices (Uniform mode only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs\n-unsigned int generateAllLevels\n-Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be\n-unsigned int patchPrecisionDouble\n-Generate double-precision stencils for vertex patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs\n-unsigned int generateFVarTables\n-Generate face-varying patch tables.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-unsigned int includeBaseLevelIndices\n-Include base level in patch point indices (Uniform mode only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn\n-void SetFVarPatchPrecision()\n-Set precision of face-varying patches.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int numFVarChannels\n-Number of channel indices and interpolation modes passed.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs\n-unsigned int triangulateQuads\n-Triangulate 'QUADS' primitives (Uniform mode only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n-EndCapType\n-Choice for approximating irregular patches (end-caps)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bL_\bE_\bG_\bA_\bC_\bY_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY\n-@ ENDCAP_LEGACY_GREGORY\n-legacy option for 2.x style Gregory patches (Catmark only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS\n-@ ENDCAP_GREGORY_BASIS\n-use Gregory patches (highest quality, recommended default)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bN_\bO_\bN_\bE\n-@ ENDCAP_NONE\n-unspecified\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b__\bB_\bA_\bS_\bI_\bS\n-@ ENDCAP_BILINEAR_BASIS\n-use linear patches (simple quads or tris)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bS_\bP_\bL_\bI_\bN_\bE_\b__\bB_\bA_\bS_\bI_\bS\n-@ ENDCAP_BSPLINE_BASIS\n-use BSpline-like patches (same patch type as regular)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Options(unsigned int maxIsolation=10)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg\n-Obsolete internal struct not intended for public use \u00e2\u0080\u0093 due to be deprecated.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bi_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be\n-unsigned int _isSingleCrease\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bi_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br\n-unsigned int _isRegular\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bd_\be_\bx\n-unsigned int _boundaryIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk\n-void assignBoundaryPropertiesFromVertexMask(int boundaryVertexMask)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bt_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bM_\ba_\bs_\bk\n-unsigned int _transitionMask\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bh_\ba_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be\n-unsigned int _hasBoundaryEdge\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bM_\ba_\bs_\bk\n-unsigned int _boundaryMask\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:_\b__\bh_\ba_\bs_\bP_\ba_\bt_\bc_\bh\n-unsigned int _hasPatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk\n-void assignTransitionPropertiesFromEdgeMask(int boundaryVertexMask)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:_\bc_\bl_\be_\ba_\br\n-void clear()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk\n-void assignBoundaryPropertiesFromEdgeMask(int boundaryEdgeMask)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bu_\bn_\bt\n-unsigned int _boundaryCount\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+Vtr::ConstLocalIndexArray ConstLocalIndexArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR\n+@ FAR_RUNTIME_ERROR\n+Issue a generic runtime error, but continue execution.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\be_\br_\br_\bo_\br_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+Vtr::Index Index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+int Index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n+bool IndexIsValid(Index index)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR\n+@ SCHEME_BILINEAR\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK\n+@ SCHEME_CATMARK\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP\n+@ SCHEME_LOOP\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n+Applies refinement operations to generic primvar data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt\n+void Limit(T const &src, U &dstPos) const\n+Apply limit weights to a primvar buffer.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b1_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n+PrimvarRefinerReal(TopologyRefiner const &refiner)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt\n+void Limit(T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm\n+void InterpolateFaceUniform(int level, T const &src, U &dst) const\n+Refine uniform (per-face) primvar data between levels.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n+TopologyRefiner const & GetTopologyRefiner() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void InterpolateVarying(int level, T const &src, U &dst) const\n+Apply only varying interpolation weights to a primvar buffer for a single level\n+of refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b4_\b1_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be\n+void Interpolate(int level, T const &src, U &dst) const\n+Apply vertex interpolation weights to a primvar buffer for a single level of\n+refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void InterpolateFaceVarying(int level, T const &src, U &dst, int channel=0)\n+const\n+Apply face-varying interpolation weights to a primvar buffer associated with a\n+particular face-varyin...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\b~_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n+~PrimvarRefinerReal()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void LimitFaceVarying(T const &src, U &dst, int channel=0) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b6_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n+PrimvarRefiner(TopologyRefiner const &refiner)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b6_\b7\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Adaptive refinement options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh\n-unsigned int useSingleCreasePatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh\n-unsigned int useInfSharpPatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-unsigned int considerFVarChannels\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n+Rule\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE\n+@ RULE_CREASE\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be\n+Scheme is a class template which provides all implementation for the\n+subdivision schemes supported by...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bc_\bh_\be_\bm_\be_\b._\bh_\b:_\b6_\b6\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b:_\b:_\bs_\bi_\bz_\be\n+size_type size() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b7_\b2\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00758.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00758.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/vtr/fvarLevel.h File Reference\n+OpenSubdiv: opensubdiv/vtr/fvarRefinement.h File Reference\n \n \n \n \n \n \n \n@@ -89,23 +89,23 @@\n \n \n \n \n
\n \n-
fvarLevel.h File Reference
\n+
fvarRefinement.h File Reference
\n
\n
\n
#include "../version.h"
\n #include "../sdc/types.h"
\n #include "../sdc/crease.h"
\n-#include "../sdc/options.h"
\n #include "../vtr/types.h"
\n-#include "../vtr/level.h"
\n+#include "../vtr/refinement.h"
\n+#include "../vtr/fvarLevel.h"
\n #include <vector>
\n #include <cassert>
\n #include <cstring>
\n
\n

Go to the source code of this file.

\n \n \n

\n@@ -118,13 +118,13 @@\n

 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,27 +1,27 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-fvarLevel.h File Reference\n+fvarRefinement.h File Reference\n #include \"../version.h\"\n #include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n #include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bc_\br_\be_\ba_\bs_\be_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n #include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bl_\be_\bv_\be_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\"\n #include \n #include \n #include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bv_\bt_\br\n- * _\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\n+ * _\bf_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00758_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00758_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/vtr/fvarLevel.h Source File\n+OpenSubdiv: opensubdiv/vtr/fvarRefinement.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
fvarLevel.h
\n+
fvarRefinement.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2014 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -118,443 +118,115 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_VTR_FVAR_LEVEL_H
\n-
25#define OPENSUBDIV3_VTR_FVAR_LEVEL_H
\n+
24#ifndef OPENSUBDIV3_VTR_FVAR_REFINEMENT_H
\n+
25#define OPENSUBDIV3_VTR_FVAR_REFINEMENT_H
\n
26
\n
27#include "../version.h"
\n
28
\n
29#include "../sdc/types.h"
\n
30#include "../sdc/crease.h"
\n-
31#include "../sdc/options.h"
\n-
32#include "../vtr/types.h"
\n-
33#include "../vtr/level.h"
\n+
31#include "../vtr/types.h"
\n+
32#include "../vtr/refinement.h"
\n+
33#include "../vtr/fvarLevel.h"
\n
34
\n
35#include <vector>
\n
36#include <cassert>
\n
37#include <cstring>
\n
38
\n
39
\n
40namespace OpenSubdiv {
\n
41namespace OPENSUBDIV_VERSION {
\n
42
\n
43namespace Vtr {
\n
44namespace internal {
\n
45
\n
46//
\n-
47// FVarLevel:
\n-
48// A "face-varying channel" includes the topology for a set of face-varying
\n-
49// data, relative to the topology of the Level with which it is associated.
\n-
50//
\n-
51// Analogous to a set of vertices and face-vertices that define the topology for
\n-
52// the geometry, a channel requires a set of "values" and "face-values". The
\n-
53// "values" are indices of entries in a set of face-varying data, just as vertices
\n-
54// are indices into a set of vertex data. The face-values identify a value for
\n-
55// each vertex of the face, and so define topology for the values that may be
\n-
56// unique to each channel.
\n-
57//
\n-
58// In addition to the value size and the vector of face-values (which matches the
\n-
59// size of the geometry's face-vertices), tags are associated with each component
\n-
60// to identify deviations of the face-varying topology from the vertex topology.
\n-
61// And since there may be a one-to-many mapping between vertices and face-varying
\n-
62// values, that mapping is also allocated.
\n-
63//
\n-
64// It turns out that the mapping used is able to completely encode the set of
\n-
65// face-values and is more amenable to refinement. Currently the face-values
\n-
66// take up almost half the memory of this representation, so if memory does
\n-
67// become a concern, we do not need to store them. The only reason we do so now
\n-
68// is that the face-value interface for specifying base topology and inspecting
\n-
69// subsequent levels is very familiar to that of face-vertices for clients. So
\n-
70// having them available for such access is convenient.
\n-
71//
\n-
72// Regarding scope and access...
\n-
73// Unclear at this early state, but leaning towards nesting this class within
\n-
74// Level, given the intimate dependency between the two.
\n-
75// Everything is being declared public for now to facilitate access until it's
\n-
76// clearer how this functionality will be provided.
\n-
77//
\n-
78class FVarLevel {
\n-
79public:
\n-
80 //
\n-
81 // Component tags -- trying to minimize the types needed here:
\n-
82 //
\n-
83 // Tag per Edge:
\n-
84 // - facilitates topological analysis around each vertex
\n-
85 // - required during refinement to spawn one or more edge-values
\n-
86 //
\n-
87 struct ETag {
\n-
88 ETag() { }
\n-
89
\n-
90 void clear() { std::memset(this, 0, sizeof(ETag)); }
\n-
91
\n-
92 typedef unsigned char ETagSize;
\n-
93
\n-
94 ETagSize _mismatch : 1; // local FVar topology does not match
\n-
95 ETagSize _disctsV0 : 1; // discontinuous at vertex 0
\n-
96 ETagSize _disctsV1 : 1; // discontinuous at vertex 1
\n-
97 ETagSize _linear : 1; // linear boundary constraints
\n+
47// FVarRefinement:
\n+
48// A face-varying refinement contains data to support the refinement of a
\n+
49// particular face-varying "channel". Just as Refinement maintains a mapping
\n+
50// between the components of a parent Level and its child, the face-varying
\n+
51// analog maintains a mapping between the face-varying values of a parent
\n+
52// FVarLevel and its child.
\n+
53//
\n+
54// It turns out there is little data necessary here, so the class consists
\n+
55// mainly of methods that populate the child FVarLevel. The mapping data in
\n+
56// the refinement between Levels serves most purposes and all that is required
\n+
57// in addition is a mapping from values in the child FVarLevel to the parent.
\n+
58//
\n+
59class FVarRefinement {
\n+
60public:
\n+
61 FVarRefinement(Refinement const& refinement, FVarLevel& parent, FVarLevel& child);
\n+
62 ~FVarRefinement();
\n+
63
\n+
64 int getChildValueParentSource(Index vIndex, int sibling) const {
\n+
65 return _childValueParentSource[_childFVar.getVertexValueOffset(vIndex, (LocalIndex)sibling)];
\n+
66 }
\n+
67
\n+
68 float getFractionalWeight(Index pVert, LocalIndex pSibling,
\n+
69 Index cVert, LocalIndex cSibling) const;
\n+
70
\n+
71
\n+
72 // Modifiers supporting application of the refinement:
\n+
73 void applyRefinement();
\n+
74
\n+
75 void estimateAndAllocateChildValues();
\n+
76 void populateChildValues();
\n+
77 void populateChildValuesFromFaceVertices();
\n+
78 void populateChildValuesFromEdgeVertices();
\n+
79 int populateChildValuesForEdgeVertex(Index cVert, Index pEdge);
\n+
80 void populateChildValuesFromVertexVertices();
\n+
81 int populateChildValuesForVertexVertex(Index cVert, Index pVert);
\n+
82 void trimAndFinalizeChildValues();
\n+
83
\n+
84 void propagateEdgeTags();
\n+
85 void propagateValueTags();
\n+
86 void propagateValueCreases();
\n+
87 void reclassifySemisharpValues();
\n+
88
\n+
89private:
\n+
90 //
\n+
91 // Identify the Refinement, its Levels and assigned FVarLevels for more
\n+
92 // immediate access -- child FVarLevel is non-const as it is to be assigned:
\n+
93 //
\n+
94 Refinement const & _refinement;
\n+
95
\n+
96 Level const & _parentLevel;
\n+
97 FVarLevel const & _parentFVar;
\n
98
\n-
99 Level::ETag combineWithLevelETag(Level::ETag) const;
\n-
100 };
\n+
99 Level const & _childLevel;
\n+
100 FVarLevel & _childFVar;
\n
101
\n-
102 //
\n-
103 // Tag per Value:
\n-
104 // - informs both refinement and interpolation
\n-
105 // - every value spawns a child value in refinement
\n-
106 // - includes a subset of Level::VTag to be later combined with a VTag
\n-
107 //
\n-
108 struct ValueTag {
\n-
109 ValueTag() { }
\n-
110
\n-
111 void clear() { std::memset(this, 0, sizeof(ValueTag)); }
\n+
102 // When refinement is sparse, we need a mapping between siblings of a vertex
\n+
103 // value in the parent and child -- and for some child values, there will not
\n+
104 // be a parent value, in which case the source of the parent component will
\n+
105 // be stored. So we refer to the parent "source" rather than "sibling":
\n+
106 //
\n+
107 std::vector<LocalIndex> _childValueParentSource;
\n+
108};
\n+
109
\n+
110} // end namespace internal
\n+
111} // end namespace Vtr
\n
112
\n-
113 bool isMismatch() const { return _mismatch; }
\n-
114 bool isCrease() const { return _crease; }
\n-
115 bool isCorner() const { return !_crease; }
\n-
116 bool isSemiSharp() const { return _semiSharp; }
\n-
117 bool isInfSharp() const { return !_semiSharp && !_crease; }
\n-
118 bool isDepSharp() const { return _depSharp; }
\n-
119 bool hasCreaseEnds() const { return _crease || _semiSharp; }
\n-
120
\n-
121 bool hasInfSharpEdges() const { return _infSharpEdges; }
\n-
122 bool hasInfIrregularity() const { return _infIrregular; }
\n-
123
\n-
124 typedef unsigned char ValueTagSize;
\n-
125
\n-
126 // If there is no mismatch, no other members should be inspected
\n-
127 ValueTagSize _mismatch : 1; // local FVar topology does not match
\n-
128 ValueTagSize _xordinary : 1; // local FVar topology is extra-ordinary
\n-
129 ValueTagSize _nonManifold : 1; // local FVar topology is non-manifold
\n-
130 ValueTagSize _crease : 1; // value is a crease, otherwise a corner
\n-
131 ValueTagSize _semiSharp : 1; // value is a corner decaying to crease
\n-
132 ValueTagSize _depSharp : 1; // value is a corner by dependency on another
\n-
133
\n-
134 ValueTagSize _infSharpEdges : 1; // value is a corner by inf-sharp features
\n-
135 ValueTagSize _infIrregular : 1; // value span includes inf-sharp irregularity
\n-
136
\n-
137 Level::VTag combineWithLevelVTag(Level::VTag) const;
\n-
138
\n-
139 // Alternate constructor and accessor for dealing with integer bits directly:
\n-
140 explicit ValueTag(ValueTagSize bits) {
\n-
141 std::memcpy(this, &bits, sizeof(bits));
\n-
142 }
\n-
143 ValueTagSize getBits() const {
\n-
144 ValueTagSize bits;
\n-
145 std::memcpy(&bits, this, sizeof(bits));
\n-
146 return bits;
\n-
147 }
\n-
148 };
\n-
149
\n-
150 typedef Vtr::ConstArray<ValueTag> ConstValueTagArray;
\n-
151 typedef Vtr::Array<ValueTag> ValueTagArray;
\n-
152
\n-
153 //
\n-
154 // Simple struct containing the "end faces" of a crease, i.e. the faces which
\n-
155 // contain the FVar values to be used when interpolating the crease. (Prefer
\n-
156 // the struct over std::pair for its member names)
\n-
157 //
\n-
158 struct CreaseEndPair {
\n-
159 LocalIndex _startFace;
\n-
160 LocalIndex _endFace;
\n-
161 };
\n-
162
\n-
163 typedef Vtr::ConstArray<CreaseEndPair> ConstCreaseEndPairArray;
\n-
164 typedef Vtr::Array<CreaseEndPair> CreaseEndPairArray;
\n-
165
\n-
166 typedef LocalIndex Sibling;
\n-
167
\n-
168 typedef ConstLocalIndexArray ConstSiblingArray;
\n-
169 typedef LocalIndexArray SiblingArray;
\n-
170
\n-
171public:
\n-
172 FVarLevel(Level const& level);
\n-
173 ~FVarLevel();
\n-
174
\n-
175 // Queries for the entire channel:
\n-
176 Level const& getLevel() const { return _level; }
\n-
177
\n-
178 int getNumValues() const { return _valueCount; }
\n-
179 int getNumFaceValuesTotal() const { return (int) _faceVertValues.size(); }
\n-
180
\n-
181 bool isLinear() const { return _isLinear; }
\n-
182 bool hasLinearBoundaries() const { return _hasLinearBoundaries; }
\n-
183 bool hasSmoothBoundaries() const { return ! _hasLinearBoundaries; }
\n-
184 bool hasCreaseEnds() const { return hasSmoothBoundaries(); }
\n-
185
\n-
186 Sdc::Options getOptions() const { return _options; }
\n-
187
\n-
188 // Queries per face:
\n-
189 ConstIndexArray getFaceValues(Index fIndex) const;
\n-
190 IndexArray getFaceValues(Index fIndex);
\n-
191
\n-
192 // Queries per edge:
\n-
193 ETag getEdgeTag(Index eIndex) const { return _edgeTags[eIndex]; }
\n-
194 bool edgeTopologyMatches(Index eIndex) const { return !getEdgeTag(eIndex)._mismatch; }
\n-
195
\n-
196 // Queries per vertex (and its potential sibling values):
\n-
197 int getNumVertexValues(Index v) const { return _vertSiblingCounts[v]; }
\n-
198 Index getVertexValueOffset(Index v, Sibling i = 0) const { return _vertSiblingOffsets[v] + i; }
\n-
199
\n-
200 Index getVertexValue(Index v, Sibling i = 0) const { return _vertValueIndices[getVertexValueOffset(v,i)]; }
\n-
201
\n-
202 Index findVertexValueIndex(Index vertexIndex, Index valueIndex) const;
\n-
203
\n-
204 // Methods to access/modify array properties per vertex:
\n-
205 ConstIndexArray getVertexValues(Index vIndex) const;
\n-
206 IndexArray getVertexValues(Index vIndex);
\n-
207
\n-
208 ConstValueTagArray getVertexValueTags(Index vIndex) const;
\n-
209 ValueTagArray getVertexValueTags(Index vIndex);
\n-
210
\n-
211 ConstCreaseEndPairArray getVertexValueCreaseEnds(Index vIndex) const;
\n-
212 CreaseEndPairArray getVertexValueCreaseEnds(Index vIndex);
\n-
213
\n-
214 ConstSiblingArray getVertexFaceSiblings(Index vIndex) const;
\n-
215 SiblingArray getVertexFaceSiblings(Index vIndex);
\n-
216
\n-
217 // Queries per value:
\n-
218 ValueTag getValueTag(Index valueIndex) const { return _vertValueTags[valueIndex]; }
\n-
219 bool valueTopologyMatches(Index valueIndex) const { return !getValueTag(valueIndex)._mismatch; }
\n-
220
\n-
221 CreaseEndPair getValueCreaseEndPair(Index valueIndex) const { return _vertValueCreaseEnds[valueIndex]; }
\n-
222
\n-
223 // Tag queries related to faces (use Level methods for those returning Level::VTag/ETag)
\n-
224 void getFaceValueTags(Index faceIndex, ValueTag valueTags[]) const;
\n-
225
\n-
226 ValueTag getFaceCompositeValueTag(Index faceIndex) const;
\n-
227
\n-
228 // Higher-level topological queries, i.e. values in a neighborhood:
\n-
229 void getEdgeFaceValues(Index eIndex, int fIncToEdge, Index valuesPerVert[2]) const;
\n-
230 void getVertexEdgeValues(Index vIndex, Index valuesPerEdge[]) const;
\n-
231 void getVertexCreaseEndValues(Index vIndex, Sibling sibling, Index endValues[2]) const;
\n-
232
\n-
233 // Initialization and allocation helpers:
\n-
234 void setOptions(Sdc::Options const& options);
\n-
235 void resizeVertexValues(int numVertexValues);
\n-
236 void resizeValues(int numValues);
\n-
237 void resizeComponents();
\n-
238
\n-
239 // Topological analysis methods -- tagging and face-value population:
\n-
240 void completeTopologyFromFaceValues(int regBoundaryValence);
\n-
241 void initializeFaceValuesFromFaceVertices();
\n-
242 void initializeFaceValuesFromVertexFaceSiblings();
\n-
243
\n-
244 struct ValueSpan;
\n-
245 void gatherValueSpans(Index vIndex, ValueSpan * vValueSpans) const;
\n-
246
\n-
247 // Debugging methods:
\n-
248 bool validate() const;
\n-
249 void print() const;
\n-
250 void buildFaceVertexSiblingsFromVertexFaceSiblings(std::vector<Sibling>& fvSiblings) const;
\n-
251
\n-
252private:
\n-
253 // Just as Refinements build Levels, FVarRefinements build FVarLevels...
\n-
254 friend class FVarRefinement;
\n-
255
\n-
256 Level const & _level;
\n-
257
\n-
258 // Linear interpolation options vary between channels:
\n-
259 Sdc::Options _options;
\n-
260
\n-
261 bool _isLinear;
\n-
262 bool _hasLinearBoundaries;
\n-
263 bool _hasDependentSharpness;
\n-
264 int _valueCount;
\n-
265
\n-
266 //
\n-
267 // Vectors recording face-varying topology including tags that help propagate
\n-
268 // data through the refinement hierarchy. Vectors are not sparse but most use
\n-
269 // 8-bit values relative to the local topology.
\n-
270 //
\n-
271 // The vector of face-values is actually redundant here, but is constructed as
\n-
272 // it is most convenient for clients. It represents almost half the memory of
\n-
273 // the topology (4 32-bit integers per face) and not surprisingly, populating
\n-
274 // it takes a considerable amount of the refinement time (1/3). We can reduce
\n-
275 // both if we are willing to compute these on demand for clients.
\n-
276 //
\n-
277 // Per-face (matches face-verts of corresponding level):
\n-
278 std::vector<Index> _faceVertValues;
\n-
279
\n-
280 // Per-edge:
\n-
281 std::vector<ETag> _edgeTags;
\n-
282
\n-
283 // Per-vertex:
\n-
284 std::vector<Sibling> _vertSiblingCounts;
\n-
285 std::vector<int> _vertSiblingOffsets;
\n-
286 std::vector<Sibling> _vertFaceSiblings;
\n-
287
\n-
288 // Per-value:
\n-
289 std::vector<Index> _vertValueIndices;
\n-
290 std::vector<ValueTag> _vertValueTags;
\n-
291 std::vector<CreaseEndPair> _vertValueCreaseEnds;
\n-
292};
\n-
293
\n-
294//
\n-
295// Access/modify the values associated with each face:
\n-
296//
\n-
297inline ConstIndexArray
\n-
298FVarLevel::getFaceValues(Index fIndex) const {
\n-
299
\n-
300 int vCount = _level.getNumFaceVertices(fIndex);
\n-
301 int vOffset = _level.getOffsetOfFaceVertices(fIndex);
\n-
302 return ConstIndexArray(&_faceVertValues[vOffset], vCount);
\n-
303}
\n-
304inline IndexArray
\n-
305FVarLevel::getFaceValues(Index fIndex) {
\n-
306
\n-
307 int vCount = _level.getNumFaceVertices(fIndex);
\n-
308 int vOffset = _level.getOffsetOfFaceVertices(fIndex);
\n-
309 return IndexArray(&_faceVertValues[vOffset], vCount);
\n-
310}
\n-
311
\n-
312inline FVarLevel::ConstSiblingArray
\n-
313FVarLevel::getVertexFaceSiblings(Index vIndex) const {
\n-
314
\n-
315 int vCount = _level.getNumVertexFaces(vIndex);
\n-
316 int vOffset = _level.getOffsetOfVertexFaces(vIndex);
\n-
317 return ConstSiblingArray(&_vertFaceSiblings[vOffset], vCount);
\n-
318}
\n-
319inline FVarLevel::SiblingArray
\n-
320FVarLevel::getVertexFaceSiblings(Index vIndex) {
\n-
321
\n-
322 int vCount = _level.getNumVertexFaces(vIndex);
\n-
323 int vOffset = _level.getOffsetOfVertexFaces(vIndex);
\n-
324 return SiblingArray(&_vertFaceSiblings[vOffset], vCount);
\n-
325}
\n-
326
\n-
327inline ConstIndexArray
\n-
328FVarLevel::getVertexValues(Index vIndex) const
\n-
329{
\n-
330 int vCount = getNumVertexValues(vIndex);
\n-
331 int vOffset = getVertexValueOffset(vIndex);
\n-
332 return ConstIndexArray(&_vertValueIndices[vOffset], vCount);
\n-
333}
\n-
334inline IndexArray
\n-
335FVarLevel::getVertexValues(Index vIndex)
\n-
336{
\n-
337 int vCount = getNumVertexValues(vIndex);
\n-
338 int vOffset = getVertexValueOffset(vIndex);
\n-
339 return IndexArray(&_vertValueIndices[vOffset], vCount);
\n-
340}
\n-
341
\n-
342inline FVarLevel::ConstValueTagArray
\n-
343FVarLevel::getVertexValueTags(Index vIndex) const
\n-
344{
\n-
345 int vCount = getNumVertexValues(vIndex);
\n-
346 int vOffset = getVertexValueOffset(vIndex);
\n-
347 return ConstValueTagArray(&_vertValueTags[vOffset], vCount);
\n-
348}
\n-
349inline FVarLevel::ValueTagArray
\n-
350FVarLevel::getVertexValueTags(Index vIndex)
\n-
351{
\n-
352 int vCount = getNumVertexValues(vIndex);
\n-
353 int vOffset = getVertexValueOffset(vIndex);
\n-
354 return ValueTagArray(&_vertValueTags[vOffset], vCount);
\n-
355}
\n-
356
\n-
357inline FVarLevel::ConstCreaseEndPairArray
\n-
358FVarLevel::getVertexValueCreaseEnds(Index vIndex) const
\n-
359{
\n-
360 int vCount = getNumVertexValues(vIndex);
\n-
361 int vOffset = getVertexValueOffset(vIndex);
\n-
362 return ConstCreaseEndPairArray(&_vertValueCreaseEnds[vOffset], vCount);
\n-
363}
\n-
364inline FVarLevel::CreaseEndPairArray
\n-
365FVarLevel::getVertexValueCreaseEnds(Index vIndex)
\n-
366{
\n-
367 int vCount = getNumVertexValues(vIndex);
\n-
368 int vOffset = getVertexValueOffset(vIndex);
\n-
369 return CreaseEndPairArray(&_vertValueCreaseEnds[vOffset], vCount);
\n-
370}
\n-
371
\n-
372inline Index
\n-
373FVarLevel::findVertexValueIndex(Index vertexIndex, Index valueIndex) const {
\n-
374
\n-
375 if (_level.getDepth() > 0) return valueIndex;
\n-
376
\n-
377 Index vvIndex = getVertexValueOffset(vertexIndex);
\n-
378 while (_vertValueIndices[vvIndex] != valueIndex) {
\n-
379 ++ vvIndex;
\n-
380 }
\n-
381 return vvIndex;
\n-
382}
\n-
383
\n-
384//
\n-
385// Methods related to tagging:
\n-
386//
\n-
387inline Level::ETag
\n-
388FVarLevel::ETag::combineWithLevelETag(Level::ETag levelTag) const
\n-
389{
\n-
390 if (this->_mismatch) {
\n-
391 levelTag._boundary = true;
\n-
392 levelTag._infSharp = true;
\n-
393 }
\n-
394 return levelTag;
\n-
395}
\n-
396inline Level::VTag
\n-
397FVarLevel::ValueTag::combineWithLevelVTag(Level::VTag levelTag) const
\n-
398{
\n-
399 if (this->_mismatch) {
\n-
400 //
\n-
401 // Semi-sharp FVar values are always tagged and treated as corners
\n-
402 // (at least three sharp edges (two boundary edges and one interior
\n-
403 // semi-sharp) and/or vertex is semi-sharp) until the sharpness has
\n-
404 // decayed, but they ultimately lie on the inf-sharp crease of the
\n-
405 // FVar boundary. Consider this when tagging inf-sharp features.
\n-
406 //
\n-
407 if (this->isCorner()) {
\n-
408 levelTag._rule = (Level::VTag::VTagSize) Sdc::Crease::RULE_CORNER;
\n-
409 } else {
\n-
410 levelTag._rule = (Level::VTag::VTagSize) Sdc::Crease::RULE_CREASE;
\n-
411 }
\n-
412 if (this->isCrease() || this->isSemiSharp()) {
\n-
413 levelTag._infSharp = false;
\n-
414 levelTag._infSharpCrease = true;
\n-
415 levelTag._corner = false;
\n-
416 } else {
\n-
417 levelTag._infSharp = true;
\n-
418 levelTag._infSharpCrease = false;
\n-
419 levelTag._corner = !this->_infIrregular && !this->_infSharpEdges;
\n-
420 }
\n-
421 levelTag._infSharpEdges = true;
\n-
422 levelTag._infIrregular = this->_infIrregular;
\n-
423
\n-
424 levelTag._boundary = true;
\n-
425 levelTag._xordinary = this->_xordinary;
\n-
426
\n-
427 levelTag._nonManifold |= this->_nonManifold;
\n-
428 }
\n-
429 return levelTag;
\n-
430}
\n-
431
\n-
432} // end namespace internal
\n-
433} // end namespace Vtr
\n-
434
\n-
435} // end namespace OPENSUBDIV_VERSION
\n-
436using namespace OPENSUBDIV_VERSION;
\n-
437} // end namespace OpenSubdiv
\n-
438
\n-
439#endif /* OPENSUBDIV3_VTR_FVAR_LEVEL_H */
\n+
113} // end namespace OPENSUBDIV_VERSION
\n+
114using namespace OPENSUBDIV_VERSION;
\n+
115} // end namespace OpenSubdiv
\n+
116
\n+
117#endif /* OPENSUBDIV3_VTR_FVAR_REFINEMENT_H */
\n \n-
ConstArray< LocalIndex > ConstLocalIndexArray
Definition types.h:83
\n-
Array< LocalIndex > LocalIndexArray
Definition types.h:82
\n \n-
ConstArray< Index > ConstIndexArray
Definition types.h:80
\n \n-\n-\n-\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-fvarLevel.h\n+fvarRefinement.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2014 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -23,484 +23,118 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_VTR_FVAR_LEVEL_H\n-25#define OPENSUBDIV3_VTR_FVAR_LEVEL_H\n+24#ifndef OPENSUBDIV3_VTR_FVAR_REFINEMENT_H\n+25#define OPENSUBDIV3_VTR_FVAR_REFINEMENT_H\n 26\n 27#include \"../version.h\"\n 28\n 29#include \"../sdc/types.h\"\n 30#include \"../sdc/crease.h\"\n-31#include \"../sdc/options.h\"\n-32#include \"../vtr/types.h\"\n-33#include \"../vtr/level.h\"\n+31#include \"../vtr/types.h\"\n+32#include \"../vtr/refinement.h\"\n+33#include \"../vtr/fvarLevel.h\"\n 34\n 35#include \n 36#include \n 37#include \n 38\n 39\n 40namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n 41namespace OPENSUBDIV_VERSION {\n 42\n 43namespace Vtr {\n 44namespace internal {\n 45\n 46//\n-47// FVarLevel:\n-48// A \"face-varying channel\" includes the topology for a set of face-varying\n-49// data, relative to the topology of the Level with which it is associated.\n-50//\n-51// Analogous to a set of vertices and face-vertices that define the topology\n-for\n-52// the geometry, a channel requires a set of \"values\" and \"face-values\". The\n-53// \"values\" are indices of entries in a set of face-varying data, just as\n-vertices\n-54// are indices into a set of vertex data. The face-values identify a value\n-for\n-55// each vertex of the face, and so define topology for the values that may be\n-56// unique to each channel.\n-57//\n-58// In addition to the value size and the vector of face-values (which matches\n-the\n-59// size of the geometry's face-vertices), tags are associated with each\n-component\n-60// to identify deviations of the face-varying topology from the vertex\n-topology.\n-61// And since there may be a one-to-many mapping between vertices and face-\n-varying\n-62// values, that mapping is also allocated.\n-63//\n-64// It turns out that the mapping used is able to completely encode the set of\n-65// face-values and is more amenable to refinement. Currently the face-values\n-66// take up almost half the memory of this representation, so if memory does\n-67// become a concern, we do not need to store them. The only reason we do so\n-now\n-68// is that the face-value interface for specifying base topology and\n-inspecting\n-69// subsequent levels is very familiar to that of face-vertices for clients.\n-So\n-70// having them available for such access is convenient.\n-71//\n-72// Regarding scope and access...\n-73// Unclear at this early state, but leaning towards nesting this class within\n-74// Level, given the intimate dependency between the two.\n-75// Everything is being declared public for now to facilitate access until\n-it's\n-76// clearer how this functionality will be provided.\n-77//\n-78class FVarLevel {\n-79public:\n-80 //\n-81 // Component tags -- trying to minimize the types needed here:\n-82 //\n-83 // Tag per Edge:\n-84 // - facilitates topological analysis around each vertex\n-85 // - required during refinement to spawn one or more edge-values\n-86 //\n-87 struct ETag {\n-88 ETag() { }\n-89\n-90 void clear() { std::memset(this, 0, sizeof(ETag)); }\n-91\n-92 typedef unsigned char ETagSize;\n-93\n-94 ETagSize _mismatch : 1; // local FVar topology does not match\n-95 ETagSize _disctsV0 : 1; // discontinuous at vertex 0\n-96 ETagSize _disctsV1 : 1; // discontinuous at vertex 1\n-97 ETagSize _linear : 1; // linear boundary constraints\n+47// FVarRefinement:\n+48// A face-varying refinement contains data to support the refinement of a\n+49// particular face-varying \"channel\". Just as Refinement maintains a mapping\n+50// between the components of a parent Level and its child, the face-varying\n+51// analog maintains a mapping between the face-varying values of a parent\n+52// FVarLevel and its child.\n+53//\n+54// It turns out there is little data necessary here, so the class consists\n+55// mainly of methods that populate the child FVarLevel. The mapping data in\n+56// the refinement between Levels serves most purposes and all that is\n+required\n+57// in addition is a mapping from values in the child FVarLevel to the parent.\n+58//\n+59class FVarRefinement {\n+60public:\n+61 FVarRefinement(Refinement const& refinement, FVarLevel& parent, FVarLevel&\n+child);\n+62 ~FVarRefinement();\n+63\n+64 int getChildValueParentSource(_\bI_\bn_\bd_\be_\bx vIndex, int sibling) const {\n+65 return _childValueParentSource[_childFVar.getVertexValueOffset(vIndex,\n+(_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx)sibling)];\n+66 }\n+67\n+68 float getFractionalWeight(_\bI_\bn_\bd_\be_\bx pVert, _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx pSibling,\n+69 _\bI_\bn_\bd_\be_\bx cVert, _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx cSibling) const;\n+70\n+71\n+72 // Modifiers supporting application of the refinement:\n+73 void applyRefinement();\n+74\n+75 void estimateAndAllocateChildValues();\n+76 void populateChildValues();\n+77 void populateChildValuesFromFaceVertices();\n+78 void populateChildValuesFromEdgeVertices();\n+79 int populateChildValuesForEdgeVertex(_\bI_\bn_\bd_\be_\bx cVert, _\bI_\bn_\bd_\be_\bx pEdge);\n+80 void populateChildValuesFromVertexVertices();\n+81 int populateChildValuesForVertexVertex(_\bI_\bn_\bd_\be_\bx cVert, _\bI_\bn_\bd_\be_\bx pVert);\n+82 void trimAndFinalizeChildValues();\n+83\n+84 void propagateEdgeTags();\n+85 void propagateValueTags();\n+86 void propagateValueCreases();\n+87 void reclassifySemisharpValues();\n+88\n+89private:\n+90 //\n+91 // Identify the Refinement, its Levels and assigned FVarLevels for more\n+92 // immediate access -- child FVarLevel is non-const as it is to be assigned:\n+93 //\n+94 Refinement const & _refinement;\n+95\n+96 Level const & _parentLevel;\n+97 FVarLevel const & _parentFVar;\n 98\n-99 Level::ETag combineWithLevelETag(Level::ETag) const;\n-100 };\n+99 Level const & _childLevel;\n+100 FVarLevel & _childFVar;\n 101\n-102 //\n-103 // Tag per Value:\n-104 // - informs both refinement and interpolation\n-105 // - every value spawns a child value in refinement\n-106 // - includes a subset of Level::VTag to be later combined with a VTag\n-107 //\n-108 struct ValueTag {\n-109 ValueTag() { }\n-110\n-111 void clear() { std::memset(this, 0, sizeof(ValueTag)); }\n+102 // When refinement is sparse, we need a mapping between siblings of a\n+vertex\n+103 // value in the parent and child -- and for some child values, there will\n+not\n+104 // be a parent value, in which case the source of the parent component will\n+105 // be stored. So we refer to the parent \"source\" rather than \"sibling\":\n+106 //\n+107 std::vector _childValueParentSource;\n+108};\n+109\n+110} // end namespace internal\n+111} // end namespace Vtr\n 112\n-113 bool isMismatch() const { return _mismatch; }\n-114 bool isCrease() const { return _crease; }\n-115 bool isCorner() const { return !_crease; }\n-116 bool isSemiSharp() const { return _semiSharp; }\n-117 bool isInfSharp() const { return !_semiSharp && !_crease; }\n-118 bool isDepSharp() const { return _depSharp; }\n-119 bool hasCreaseEnds() const { return _crease || _semiSharp; }\n-120\n-121 bool hasInfSharpEdges() const { return _infSharpEdges; }\n-122 bool hasInfIrregularity() const { return _infIrregular; }\n-123\n-124 typedef unsigned char ValueTagSize;\n-125\n-126 // If there is no mismatch, no other members should be inspected\n-127 ValueTagSize _mismatch : 1; // local FVar topology does not match\n-128 ValueTagSize _xordinary : 1; // local FVar topology is extra-ordinary\n-129 ValueTagSize _nonManifold : 1; // local FVar topology is non-manifold\n-130 ValueTagSize _crease : 1; // value is a crease, otherwise a corner\n-131 ValueTagSize _semiSharp : 1; // value is a corner decaying to crease\n-132 ValueTagSize _depSharp : 1; // value is a corner by dependency on another\n-133\n-134 ValueTagSize _infSharpEdges : 1; // value is a corner by inf-sharp features\n-135 ValueTagSize _infIrregular : 1; // value span includes inf-sharp\n-irregularity\n-136\n-137 Level::VTag combineWithLevelVTag(Level::VTag) const;\n-138\n-139 // Alternate constructor and accessor for dealing with integer bits\n-directly:\n-140 explicit ValueTag(ValueTagSize bits) {\n-141 std::memcpy(this, &bits, sizeof(bits));\n-142 }\n-143 ValueTagSize getBits() const {\n-144 ValueTagSize bits;\n-145 std::memcpy(&bits, this, sizeof(bits));\n-146 return bits;\n-147 }\n-148 };\n-149\n-150 typedef Vtr::ConstArray ConstValueTagArray;\n-151 typedef Vtr::Array ValueTagArray;\n-152\n-153 //\n-154 // Simple struct containing the \"end faces\" of a crease, i.e. the faces\n-which\n-155 // contain the FVar values to be used when interpolating the crease.\n-(Prefer\n-156 // the struct over std::pair for its member names)\n-157 //\n-158 struct CreaseEndPair {\n-159 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx _startFace;\n-160 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx _endFace;\n-161 };\n-162\n-163 typedef Vtr::ConstArray ConstCreaseEndPairArray;\n-164 typedef Vtr::Array CreaseEndPairArray;\n-165\n-166 typedef _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx Sibling;\n-167\n-168 typedef _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by ConstSiblingArray;\n-169 typedef _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by SiblingArray;\n-170\n-171public:\n-172 FVarLevel(Level const& level);\n-173 ~FVarLevel();\n-174\n-175 // Queries for the entire channel:\n-176 Level const& getLevel() const { return _level; }\n-177\n-178 int getNumValues() const { return _valueCount; }\n-179 int getNumFaceValuesTotal() const { return (int) _faceVertValues.size(); }\n-180\n-181 bool isLinear() const { return _isLinear; }\n-182 bool hasLinearBoundaries() const { return _hasLinearBoundaries; }\n-183 bool hasSmoothBoundaries() const { return ! _hasLinearBoundaries; }\n-184 bool hasCreaseEnds() const { return hasSmoothBoundaries(); }\n-185\n-186 Sdc::Options getOptions() const { return _options; }\n-187\n-188 // Queries per face:\n-189 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getFaceValues(_\bI_\bn_\bd_\be_\bx fIndex) const;\n-190 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getFaceValues(_\bI_\bn_\bd_\be_\bx fIndex);\n-191\n-192 // Queries per edge:\n-193 ETag getEdgeTag(_\bI_\bn_\bd_\be_\bx eIndex) const { return _edgeTags[eIndex]; }\n-194 bool edgeTopologyMatches(_\bI_\bn_\bd_\be_\bx eIndex) const { return !getEdgeTag\n-(eIndex)._mismatch; }\n-195\n-196 // Queries per vertex (and its potential sibling values):\n-197 int getNumVertexValues(_\bI_\bn_\bd_\be_\bx v) const { return _vertSiblingCounts[v]; }\n-198 _\bI_\bn_\bd_\be_\bx getVertexValueOffset(_\bI_\bn_\bd_\be_\bx v, Sibling i = 0) const { return\n-_vertSiblingOffsets[v] + i; }\n-199\n-200 _\bI_\bn_\bd_\be_\bx getVertexValue(_\bI_\bn_\bd_\be_\bx v, Sibling i = 0) const { return\n-_vertValueIndices[getVertexValueOffset(v,i)]; }\n-201\n-202 _\bI_\bn_\bd_\be_\bx findVertexValueIndex(_\bI_\bn_\bd_\be_\bx vertexIndex, _\bI_\bn_\bd_\be_\bx valueIndex) const;\n-203\n-204 // Methods to access/modify array properties per vertex:\n-205 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getVertexValues(_\bI_\bn_\bd_\be_\bx vIndex) const;\n-206 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getVertexValues(_\bI_\bn_\bd_\be_\bx vIndex);\n-207\n-208 ConstValueTagArray getVertexValueTags(_\bI_\bn_\bd_\be_\bx vIndex) const;\n-209 ValueTagArray getVertexValueTags(_\bI_\bn_\bd_\be_\bx vIndex);\n-210\n-211 ConstCreaseEndPairArray getVertexValueCreaseEnds(_\bI_\bn_\bd_\be_\bx vIndex) const;\n-212 CreaseEndPairArray getVertexValueCreaseEnds(_\bI_\bn_\bd_\be_\bx vIndex);\n-213\n-214 ConstSiblingArray getVertexFaceSiblings(_\bI_\bn_\bd_\be_\bx vIndex) const;\n-215 SiblingArray getVertexFaceSiblings(_\bI_\bn_\bd_\be_\bx vIndex);\n-216\n-217 // Queries per value:\n-218 ValueTag getValueTag(_\bI_\bn_\bd_\be_\bx valueIndex) const { return _vertValueTags\n-[valueIndex]; }\n-219 bool valueTopologyMatches(_\bI_\bn_\bd_\be_\bx valueIndex) const { return !getValueTag\n-(valueIndex)._mismatch; }\n-220\n-221 CreaseEndPair getValueCreaseEndPair(_\bI_\bn_\bd_\be_\bx valueIndex) const { return\n-_vertValueCreaseEnds[valueIndex]; }\n-222\n-223 // Tag queries related to faces (use Level methods for those returning\n-Level::VTag/ETag)\n-224 void getFaceValueTags(_\bI_\bn_\bd_\be_\bx faceIndex, ValueTag valueTags[]) const;\n-225\n-226 ValueTag getFaceCompositeValueTag(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n-227\n-228 // Higher-level topological queries, i.e. values in a neighborhood:\n-229 void getEdgeFaceValues(_\bI_\bn_\bd_\be_\bx eIndex, int fIncToEdge, _\bI_\bn_\bd_\be_\bx valuesPerVert\n-[2]) const;\n-230 void getVertexEdgeValues(_\bI_\bn_\bd_\be_\bx vIndex, _\bI_\bn_\bd_\be_\bx valuesPerEdge[]) const;\n-231 void getVertexCreaseEndValues(_\bI_\bn_\bd_\be_\bx vIndex, Sibling sibling, _\bI_\bn_\bd_\be_\bx\n-endValues[2]) const;\n-232\n-233 // Initialization and allocation helpers:\n-234 void setOptions(Sdc::Options const& options);\n-235 void resizeVertexValues(int numVertexValues);\n-236 void resizeValues(int numValues);\n-237 void resizeComponents();\n-238\n-239 // Topological analysis methods -- tagging and face-value population:\n-240 void completeTopologyFromFaceValues(int regBoundaryValence);\n-241 void initializeFaceValuesFromFaceVertices();\n-242 void initializeFaceValuesFromVertexFaceSiblings();\n-243\n-244 struct ValueSpan;\n-245 void gatherValueSpans(_\bI_\bn_\bd_\be_\bx vIndex, ValueSpan * vValueSpans) const;\n-246\n-247 // Debugging methods:\n-248 bool validate() const;\n-249 void print() const;\n-250 void buildFaceVertexSiblingsFromVertexFaceSiblings(std::vector&\n-fvSiblings) const;\n-251\n-252private:\n-253 // Just as Refinements build Levels, FVarRefinements build FVarLevels...\n-254 friend class FVarRefinement;\n-255\n-256 Level const & _level;\n-257\n-258 // Linear interpolation options vary between channels:\n-259 Sdc::Options _options;\n-260\n-261 bool _isLinear;\n-262 bool _hasLinearBoundaries;\n-263 bool _hasDependentSharpness;\n-264 int _valueCount;\n-265\n-266 //\n-267 // Vectors recording face-varying topology including tags that help\n-propagate\n-268 // data through the refinement hierarchy. Vectors are not sparse but most\n-use\n-269 // 8-bit values relative to the local topology.\n-270 //\n-271 // The vector of face-values is actually redundant here, but is constructed\n-as\n-272 // it is most convenient for clients. It represents almost half the memory\n-of\n-273 // the topology (4 32-bit integers per face) and not surprisingly,\n-populating\n-274 // it takes a considerable amount of the refinement time (1/3). We can\n-reduce\n-275 // both if we are willing to compute these on demand for clients.\n-276 //\n-277 // Per-face (matches face-verts of corresponding level):\n-278 std::vector _faceVertValues;\n-279\n-280 // Per-edge:\n-281 std::vector _edgeTags;\n-282\n-283 // Per-vertex:\n-284 std::vector _vertSiblingCounts;\n-285 std::vector _vertSiblingOffsets;\n-286 std::vector _vertFaceSiblings;\n-287\n-288 // Per-value:\n-289 std::vector _vertValueIndices;\n-290 std::vector _vertValueTags;\n-291 std::vector _vertValueCreaseEnds;\n-292};\n-293\n-294//\n-295// Access/modify the values associated with each face:\n-296//\n-297inline _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-298FVarLevel::getFaceValues(_\bI_\bn_\bd_\be_\bx fIndex) const {\n-299\n-300 int vCount = _level.getNumFaceVertices(fIndex);\n-301 int vOffset = _level.getOffsetOfFaceVertices(fIndex);\n-302 return _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by(&_faceVertValues[vOffset], vCount);\n-303}\n-304inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-305FVarLevel::getFaceValues(_\bI_\bn_\bd_\be_\bx fIndex) {\n-306\n-307 int vCount = _level.getNumFaceVertices(fIndex);\n-308 int vOffset = _level.getOffsetOfFaceVertices(fIndex);\n-309 return _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by(&_faceVertValues[vOffset], vCount);\n-310}\n-311\n-312inline FVarLevel::ConstSiblingArray\n-313FVarLevel::getVertexFaceSiblings(_\bI_\bn_\bd_\be_\bx vIndex) const {\n-314\n-315 int vCount = _level.getNumVertexFaces(vIndex);\n-316 int vOffset = _level.getOffsetOfVertexFaces(vIndex);\n-317 return ConstSiblingArray(&_vertFaceSiblings[vOffset], vCount);\n-318}\n-319inline FVarLevel::SiblingArray\n-320FVarLevel::getVertexFaceSiblings(_\bI_\bn_\bd_\be_\bx vIndex) {\n-321\n-322 int vCount = _level.getNumVertexFaces(vIndex);\n-323 int vOffset = _level.getOffsetOfVertexFaces(vIndex);\n-324 return SiblingArray(&_vertFaceSiblings[vOffset], vCount);\n-325}\n-326\n-327inline _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-328FVarLevel::getVertexValues(_\bI_\bn_\bd_\be_\bx vIndex) const\n-329{\n-330 int vCount = getNumVertexValues(vIndex);\n-331 int vOffset = getVertexValueOffset(vIndex);\n-332 return _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by(&_vertValueIndices[vOffset], vCount);\n-333}\n-334inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-335FVarLevel::getVertexValues(_\bI_\bn_\bd_\be_\bx vIndex)\n-336{\n-337 int vCount = getNumVertexValues(vIndex);\n-338 int vOffset = getVertexValueOffset(vIndex);\n-339 return _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by(&_vertValueIndices[vOffset], vCount);\n-340}\n-341\n-342inline FVarLevel::ConstValueTagArray\n-343FVarLevel::getVertexValueTags(_\bI_\bn_\bd_\be_\bx vIndex) const\n-344{\n-345 int vCount = getNumVertexValues(vIndex);\n-346 int vOffset = getVertexValueOffset(vIndex);\n-347 return ConstValueTagArray(&_vertValueTags[vOffset], vCount);\n-348}\n-349inline FVarLevel::ValueTagArray\n-350FVarLevel::getVertexValueTags(_\bI_\bn_\bd_\be_\bx vIndex)\n-351{\n-352 int vCount = getNumVertexValues(vIndex);\n-353 int vOffset = getVertexValueOffset(vIndex);\n-354 return ValueTagArray(&_vertValueTags[vOffset], vCount);\n-355}\n-356\n-357inline FVarLevel::ConstCreaseEndPairArray\n-358FVarLevel::getVertexValueCreaseEnds(_\bI_\bn_\bd_\be_\bx vIndex) const\n-359{\n-360 int vCount = getNumVertexValues(vIndex);\n-361 int vOffset = getVertexValueOffset(vIndex);\n-362 return ConstCreaseEndPairArray(&_vertValueCreaseEnds[vOffset], vCount);\n-363}\n-364inline FVarLevel::CreaseEndPairArray\n-365FVarLevel::getVertexValueCreaseEnds(_\bI_\bn_\bd_\be_\bx vIndex)\n-366{\n-367 int vCount = getNumVertexValues(vIndex);\n-368 int vOffset = getVertexValueOffset(vIndex);\n-369 return CreaseEndPairArray(&_vertValueCreaseEnds[vOffset], vCount);\n-370}\n-371\n-372inline _\bI_\bn_\bd_\be_\bx\n-373FVarLevel::findVertexValueIndex(_\bI_\bn_\bd_\be_\bx vertexIndex, _\bI_\bn_\bd_\be_\bx valueIndex) const {\n-374\n-375 if (_level.getDepth() > 0) return valueIndex;\n-376\n-377 _\bI_\bn_\bd_\be_\bx vvIndex = getVertexValueOffset(vertexIndex);\n-378 while (_vertValueIndices[vvIndex] != valueIndex) {\n-379 ++ vvIndex;\n-380 }\n-381 return vvIndex;\n-382}\n-383\n-384//\n-385// Methods related to tagging:\n-386//\n-387inline Level::ETag\n-388FVarLevel::ETag::combineWithLevelETag(Level::ETag levelTag) const\n-389{\n-390 if (this->_mismatch) {\n-391 levelTag._boundary = true;\n-392 levelTag._infSharp = true;\n-393 }\n-394 return levelTag;\n-395}\n-396inline Level::VTag\n-397FVarLevel::ValueTag::combineWithLevelVTag(Level::VTag levelTag) const\n-398{\n-399 if (this->_mismatch) {\n-400 //\n-401 // Semi-sharp FVar values are always tagged and treated as corners\n-402 // (at least three sharp edges (two boundary edges and one interior\n-403 // semi-sharp) and/or vertex is semi-sharp) until the sharpness has\n-404 // decayed, but they ultimately lie on the inf-sharp crease of the\n-405 // FVar boundary. Consider this when tagging inf-sharp features.\n-406 //\n-407 if (this->isCorner()) {\n-408 levelTag._rule = (Level::VTag::VTagSize) _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bO_\bR_\bN_\bE_\bR;\n-409 } else {\n-410 levelTag._rule = (Level::VTag::VTagSize) _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE;\n-411 }\n-412 if (this->isCrease() || this->isSemiSharp()) {\n-413 levelTag._infSharp = false;\n-414 levelTag._infSharpCrease = true;\n-415 levelTag._corner = false;\n-416 } else {\n-417 levelTag._infSharp = true;\n-418 levelTag._infSharpCrease = false;\n-419 levelTag._corner = !this->_infIrregular && !this->_infSharpEdges;\n-420 }\n-421 levelTag._infSharpEdges = true;\n-422 levelTag._infIrregular = this->_infIrregular;\n-423\n-424 levelTag._boundary = true;\n-425 levelTag._xordinary = this->_xordinary;\n-426\n-427 levelTag._nonManifold |= this->_nonManifold;\n-428 }\n-429 return levelTag;\n-430}\n-431\n-432} // end namespace internal\n-433} // end namespace Vtr\n-434\n-435} // end namespace OPENSUBDIV_VERSION\n-436using namespace OPENSUBDIV_VERSION;\n-437} // end namespace OpenSubdiv\n-438\n-439#endif /* OPENSUBDIV3_VTR_FVAR_LEVEL_H */\n+113} // end namespace OPENSUBDIV_VERSION\n+114using namespace OPENSUBDIV_VERSION;\n+115} // end namespace OpenSubdiv\n+116\n+117#endif /* OPENSUBDIV3_VTR_FVAR_REFINEMENT_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-ConstArray< LocalIndex > ConstLocalIndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-Array< LocalIndex > LocalIndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b8_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n int Index\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-ConstArray< Index > ConstIndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b8_\b0\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx\n unsigned short LocalIndex\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-Array< Index > IndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bO_\bR_\bN_\bE_\bR\n-@ RULE_CORNER\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE\n-@ RULE_CREASE\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b6\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bv_\bt_\br\n- * _\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\n+ * _\bf_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00761.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00761.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/vtr/fvarRefinement.h File Reference\n+OpenSubdiv: opensubdiv/vtr/fvarLevel.h File Reference\n \n \n \n \n \n \n \n@@ -89,23 +89,23 @@\n \n \n \n \n
\n \n-
fvarRefinement.h File Reference
\n+
fvarLevel.h File Reference
\n
\n
\n
#include "../version.h"
\n #include "../sdc/types.h"
\n #include "../sdc/crease.h"
\n+#include "../sdc/options.h"
\n #include "../vtr/types.h"
\n-#include "../vtr/refinement.h"
\n-#include "../vtr/fvarLevel.h"
\n+#include "../vtr/level.h"
\n #include <vector>
\n #include <cassert>
\n #include <cstring>
\n
\n

Go to the source code of this file.

\n \n \n

\n@@ -118,13 +118,13 @@\n

 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,27 +1,27 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-fvarRefinement.h File Reference\n+fvarLevel.h File Reference\n #include \"../version.h\"\n #include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n #include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bc_\br_\be_\ba_\bs_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n #include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bl_\be_\bv_\be_\bl_\b._\bh\"\n #include \n #include \n #include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bv_\bt_\br\n- * _\bf_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\n+ * _\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00761_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00761_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/vtr/fvarRefinement.h Source File\n+OpenSubdiv: opensubdiv/vtr/fvarLevel.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
fvarRefinement.h
\n+
fvarLevel.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2014 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -118,115 +118,443 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_VTR_FVAR_REFINEMENT_H
\n-
25#define OPENSUBDIV3_VTR_FVAR_REFINEMENT_H
\n+
24#ifndef OPENSUBDIV3_VTR_FVAR_LEVEL_H
\n+
25#define OPENSUBDIV3_VTR_FVAR_LEVEL_H
\n
26
\n
27#include "../version.h"
\n
28
\n
29#include "../sdc/types.h"
\n
30#include "../sdc/crease.h"
\n-
31#include "../vtr/types.h"
\n-
32#include "../vtr/refinement.h"
\n-
33#include "../vtr/fvarLevel.h"
\n+
31#include "../sdc/options.h"
\n+
32#include "../vtr/types.h"
\n+
33#include "../vtr/level.h"
\n
34
\n
35#include <vector>
\n
36#include <cassert>
\n
37#include <cstring>
\n
38
\n
39
\n
40namespace OpenSubdiv {
\n
41namespace OPENSUBDIV_VERSION {
\n
42
\n
43namespace Vtr {
\n
44namespace internal {
\n
45
\n
46//
\n-
47// FVarRefinement:
\n-
48// A face-varying refinement contains data to support the refinement of a
\n-
49// particular face-varying "channel". Just as Refinement maintains a mapping
\n-
50// between the components of a parent Level and its child, the face-varying
\n-
51// analog maintains a mapping between the face-varying values of a parent
\n-
52// FVarLevel and its child.
\n-
53//
\n-
54// It turns out there is little data necessary here, so the class consists
\n-
55// mainly of methods that populate the child FVarLevel. The mapping data in
\n-
56// the refinement between Levels serves most purposes and all that is required
\n-
57// in addition is a mapping from values in the child FVarLevel to the parent.
\n-
58//
\n-
59class FVarRefinement {
\n-
60public:
\n-
61 FVarRefinement(Refinement const& refinement, FVarLevel& parent, FVarLevel& child);
\n-
62 ~FVarRefinement();
\n-
63
\n-
64 int getChildValueParentSource(Index vIndex, int sibling) const {
\n-
65 return _childValueParentSource[_childFVar.getVertexValueOffset(vIndex, (LocalIndex)sibling)];
\n-
66 }
\n-
67
\n-
68 float getFractionalWeight(Index pVert, LocalIndex pSibling,
\n-
69 Index cVert, LocalIndex cSibling) const;
\n-
70
\n-
71
\n-
72 // Modifiers supporting application of the refinement:
\n-
73 void applyRefinement();
\n-
74
\n-
75 void estimateAndAllocateChildValues();
\n-
76 void populateChildValues();
\n-
77 void populateChildValuesFromFaceVertices();
\n-
78 void populateChildValuesFromEdgeVertices();
\n-
79 int populateChildValuesForEdgeVertex(Index cVert, Index pEdge);
\n-
80 void populateChildValuesFromVertexVertices();
\n-
81 int populateChildValuesForVertexVertex(Index cVert, Index pVert);
\n-
82 void trimAndFinalizeChildValues();
\n-
83
\n-
84 void propagateEdgeTags();
\n-
85 void propagateValueTags();
\n-
86 void propagateValueCreases();
\n-
87 void reclassifySemisharpValues();
\n-
88
\n-
89private:
\n-
90 //
\n-
91 // Identify the Refinement, its Levels and assigned FVarLevels for more
\n-
92 // immediate access -- child FVarLevel is non-const as it is to be assigned:
\n-
93 //
\n-
94 Refinement const & _refinement;
\n-
95
\n-
96 Level const & _parentLevel;
\n-
97 FVarLevel const & _parentFVar;
\n+
47// FVarLevel:
\n+
48// A "face-varying channel" includes the topology for a set of face-varying
\n+
49// data, relative to the topology of the Level with which it is associated.
\n+
50//
\n+
51// Analogous to a set of vertices and face-vertices that define the topology for
\n+
52// the geometry, a channel requires a set of "values" and "face-values". The
\n+
53// "values" are indices of entries in a set of face-varying data, just as vertices
\n+
54// are indices into a set of vertex data. The face-values identify a value for
\n+
55// each vertex of the face, and so define topology for the values that may be
\n+
56// unique to each channel.
\n+
57//
\n+
58// In addition to the value size and the vector of face-values (which matches the
\n+
59// size of the geometry's face-vertices), tags are associated with each component
\n+
60// to identify deviations of the face-varying topology from the vertex topology.
\n+
61// And since there may be a one-to-many mapping between vertices and face-varying
\n+
62// values, that mapping is also allocated.
\n+
63//
\n+
64// It turns out that the mapping used is able to completely encode the set of
\n+
65// face-values and is more amenable to refinement. Currently the face-values
\n+
66// take up almost half the memory of this representation, so if memory does
\n+
67// become a concern, we do not need to store them. The only reason we do so now
\n+
68// is that the face-value interface for specifying base topology and inspecting
\n+
69// subsequent levels is very familiar to that of face-vertices for clients. So
\n+
70// having them available for such access is convenient.
\n+
71//
\n+
72// Regarding scope and access...
\n+
73// Unclear at this early state, but leaning towards nesting this class within
\n+
74// Level, given the intimate dependency between the two.
\n+
75// Everything is being declared public for now to facilitate access until it's
\n+
76// clearer how this functionality will be provided.
\n+
77//
\n+
78class FVarLevel {
\n+
79public:
\n+
80 //
\n+
81 // Component tags -- trying to minimize the types needed here:
\n+
82 //
\n+
83 // Tag per Edge:
\n+
84 // - facilitates topological analysis around each vertex
\n+
85 // - required during refinement to spawn one or more edge-values
\n+
86 //
\n+
87 struct ETag {
\n+
88 ETag() { }
\n+
89
\n+
90 void clear() { std::memset(this, 0, sizeof(ETag)); }
\n+
91
\n+
92 typedef unsigned char ETagSize;
\n+
93
\n+
94 ETagSize _mismatch : 1; // local FVar topology does not match
\n+
95 ETagSize _disctsV0 : 1; // discontinuous at vertex 0
\n+
96 ETagSize _disctsV1 : 1; // discontinuous at vertex 1
\n+
97 ETagSize _linear : 1; // linear boundary constraints
\n
98
\n-
99 Level const & _childLevel;
\n-
100 FVarLevel & _childFVar;
\n+
99 Level::ETag combineWithLevelETag(Level::ETag) const;
\n+
100 };
\n
101
\n-
102 // When refinement is sparse, we need a mapping between siblings of a vertex
\n-
103 // value in the parent and child -- and for some child values, there will not
\n-
104 // be a parent value, in which case the source of the parent component will
\n-
105 // be stored. So we refer to the parent "source" rather than "sibling":
\n-
106 //
\n-
107 std::vector<LocalIndex> _childValueParentSource;
\n-
108};
\n-
109
\n-
110} // end namespace internal
\n-
111} // end namespace Vtr
\n+
102 //
\n+
103 // Tag per Value:
\n+
104 // - informs both refinement and interpolation
\n+
105 // - every value spawns a child value in refinement
\n+
106 // - includes a subset of Level::VTag to be later combined with a VTag
\n+
107 //
\n+
108 struct ValueTag {
\n+
109 ValueTag() { }
\n+
110
\n+
111 void clear() { std::memset(this, 0, sizeof(ValueTag)); }
\n
112
\n-
113} // end namespace OPENSUBDIV_VERSION
\n-
114using namespace OPENSUBDIV_VERSION;
\n-
115} // end namespace OpenSubdiv
\n-
116
\n-
117#endif /* OPENSUBDIV3_VTR_FVAR_REFINEMENT_H */
\n+
113 bool isMismatch() const { return _mismatch; }
\n+
114 bool isCrease() const { return _crease; }
\n+
115 bool isCorner() const { return !_crease; }
\n+
116 bool isSemiSharp() const { return _semiSharp; }
\n+
117 bool isInfSharp() const { return !_semiSharp && !_crease; }
\n+
118 bool isDepSharp() const { return _depSharp; }
\n+
119 bool hasCreaseEnds() const { return _crease || _semiSharp; }
\n+
120
\n+
121 bool hasInfSharpEdges() const { return _infSharpEdges; }
\n+
122 bool hasInfIrregularity() const { return _infIrregular; }
\n+
123
\n+
124 typedef unsigned char ValueTagSize;
\n+
125
\n+
126 // If there is no mismatch, no other members should be inspected
\n+
127 ValueTagSize _mismatch : 1; // local FVar topology does not match
\n+
128 ValueTagSize _xordinary : 1; // local FVar topology is extra-ordinary
\n+
129 ValueTagSize _nonManifold : 1; // local FVar topology is non-manifold
\n+
130 ValueTagSize _crease : 1; // value is a crease, otherwise a corner
\n+
131 ValueTagSize _semiSharp : 1; // value is a corner decaying to crease
\n+
132 ValueTagSize _depSharp : 1; // value is a corner by dependency on another
\n+
133
\n+
134 ValueTagSize _infSharpEdges : 1; // value is a corner by inf-sharp features
\n+
135 ValueTagSize _infIrregular : 1; // value span includes inf-sharp irregularity
\n+
136
\n+
137 Level::VTag combineWithLevelVTag(Level::VTag) const;
\n+
138
\n+
139 // Alternate constructor and accessor for dealing with integer bits directly:
\n+
140 explicit ValueTag(ValueTagSize bits) {
\n+
141 std::memcpy(this, &bits, sizeof(bits));
\n+
142 }
\n+
143 ValueTagSize getBits() const {
\n+
144 ValueTagSize bits;
\n+
145 std::memcpy(&bits, this, sizeof(bits));
\n+
146 return bits;
\n+
147 }
\n+
148 };
\n+
149
\n+
150 typedef Vtr::ConstArray<ValueTag> ConstValueTagArray;
\n+
151 typedef Vtr::Array<ValueTag> ValueTagArray;
\n+
152
\n+
153 //
\n+
154 // Simple struct containing the "end faces" of a crease, i.e. the faces which
\n+
155 // contain the FVar values to be used when interpolating the crease. (Prefer
\n+
156 // the struct over std::pair for its member names)
\n+
157 //
\n+
158 struct CreaseEndPair {
\n+
159 LocalIndex _startFace;
\n+
160 LocalIndex _endFace;
\n+
161 };
\n+
162
\n+
163 typedef Vtr::ConstArray<CreaseEndPair> ConstCreaseEndPairArray;
\n+
164 typedef Vtr::Array<CreaseEndPair> CreaseEndPairArray;
\n+
165
\n+
166 typedef LocalIndex Sibling;
\n+
167
\n+
168 typedef ConstLocalIndexArray ConstSiblingArray;
\n+
169 typedef LocalIndexArray SiblingArray;
\n+
170
\n+
171public:
\n+
172 FVarLevel(Level const& level);
\n+
173 ~FVarLevel();
\n+
174
\n+
175 // Queries for the entire channel:
\n+
176 Level const& getLevel() const { return _level; }
\n+
177
\n+
178 int getNumValues() const { return _valueCount; }
\n+
179 int getNumFaceValuesTotal() const { return (int) _faceVertValues.size(); }
\n+
180
\n+
181 bool isLinear() const { return _isLinear; }
\n+
182 bool hasLinearBoundaries() const { return _hasLinearBoundaries; }
\n+
183 bool hasSmoothBoundaries() const { return ! _hasLinearBoundaries; }
\n+
184 bool hasCreaseEnds() const { return hasSmoothBoundaries(); }
\n+
185
\n+
186 Sdc::Options getOptions() const { return _options; }
\n+
187
\n+
188 // Queries per face:
\n+
189 ConstIndexArray getFaceValues(Index fIndex) const;
\n+
190 IndexArray getFaceValues(Index fIndex);
\n+
191
\n+
192 // Queries per edge:
\n+
193 ETag getEdgeTag(Index eIndex) const { return _edgeTags[eIndex]; }
\n+
194 bool edgeTopologyMatches(Index eIndex) const { return !getEdgeTag(eIndex)._mismatch; }
\n+
195
\n+
196 // Queries per vertex (and its potential sibling values):
\n+
197 int getNumVertexValues(Index v) const { return _vertSiblingCounts[v]; }
\n+
198 Index getVertexValueOffset(Index v, Sibling i = 0) const { return _vertSiblingOffsets[v] + i; }
\n+
199
\n+
200 Index getVertexValue(Index v, Sibling i = 0) const { return _vertValueIndices[getVertexValueOffset(v,i)]; }
\n+
201
\n+
202 Index findVertexValueIndex(Index vertexIndex, Index valueIndex) const;
\n+
203
\n+
204 // Methods to access/modify array properties per vertex:
\n+
205 ConstIndexArray getVertexValues(Index vIndex) const;
\n+
206 IndexArray getVertexValues(Index vIndex);
\n+
207
\n+
208 ConstValueTagArray getVertexValueTags(Index vIndex) const;
\n+
209 ValueTagArray getVertexValueTags(Index vIndex);
\n+
210
\n+
211 ConstCreaseEndPairArray getVertexValueCreaseEnds(Index vIndex) const;
\n+
212 CreaseEndPairArray getVertexValueCreaseEnds(Index vIndex);
\n+
213
\n+
214 ConstSiblingArray getVertexFaceSiblings(Index vIndex) const;
\n+
215 SiblingArray getVertexFaceSiblings(Index vIndex);
\n+
216
\n+
217 // Queries per value:
\n+
218 ValueTag getValueTag(Index valueIndex) const { return _vertValueTags[valueIndex]; }
\n+
219 bool valueTopologyMatches(Index valueIndex) const { return !getValueTag(valueIndex)._mismatch; }
\n+
220
\n+
221 CreaseEndPair getValueCreaseEndPair(Index valueIndex) const { return _vertValueCreaseEnds[valueIndex]; }
\n+
222
\n+
223 // Tag queries related to faces (use Level methods for those returning Level::VTag/ETag)
\n+
224 void getFaceValueTags(Index faceIndex, ValueTag valueTags[]) const;
\n+
225
\n+
226 ValueTag getFaceCompositeValueTag(Index faceIndex) const;
\n+
227
\n+
228 // Higher-level topological queries, i.e. values in a neighborhood:
\n+
229 void getEdgeFaceValues(Index eIndex, int fIncToEdge, Index valuesPerVert[2]) const;
\n+
230 void getVertexEdgeValues(Index vIndex, Index valuesPerEdge[]) const;
\n+
231 void getVertexCreaseEndValues(Index vIndex, Sibling sibling, Index endValues[2]) const;
\n+
232
\n+
233 // Initialization and allocation helpers:
\n+
234 void setOptions(Sdc::Options const& options);
\n+
235 void resizeVertexValues(int numVertexValues);
\n+
236 void resizeValues(int numValues);
\n+
237 void resizeComponents();
\n+
238
\n+
239 // Topological analysis methods -- tagging and face-value population:
\n+
240 void completeTopologyFromFaceValues(int regBoundaryValence);
\n+
241 void initializeFaceValuesFromFaceVertices();
\n+
242 void initializeFaceValuesFromVertexFaceSiblings();
\n+
243
\n+
244 struct ValueSpan;
\n+
245 void gatherValueSpans(Index vIndex, ValueSpan * vValueSpans) const;
\n+
246
\n+
247 // Debugging methods:
\n+
248 bool validate() const;
\n+
249 void print() const;
\n+
250 void buildFaceVertexSiblingsFromVertexFaceSiblings(std::vector<Sibling>& fvSiblings) const;
\n+
251
\n+
252private:
\n+
253 // Just as Refinements build Levels, FVarRefinements build FVarLevels...
\n+
254 friend class FVarRefinement;
\n+
255
\n+
256 Level const & _level;
\n+
257
\n+
258 // Linear interpolation options vary between channels:
\n+
259 Sdc::Options _options;
\n+
260
\n+
261 bool _isLinear;
\n+
262 bool _hasLinearBoundaries;
\n+
263 bool _hasDependentSharpness;
\n+
264 int _valueCount;
\n+
265
\n+
266 //
\n+
267 // Vectors recording face-varying topology including tags that help propagate
\n+
268 // data through the refinement hierarchy. Vectors are not sparse but most use
\n+
269 // 8-bit values relative to the local topology.
\n+
270 //
\n+
271 // The vector of face-values is actually redundant here, but is constructed as
\n+
272 // it is most convenient for clients. It represents almost half the memory of
\n+
273 // the topology (4 32-bit integers per face) and not surprisingly, populating
\n+
274 // it takes a considerable amount of the refinement time (1/3). We can reduce
\n+
275 // both if we are willing to compute these on demand for clients.
\n+
276 //
\n+
277 // Per-face (matches face-verts of corresponding level):
\n+
278 std::vector<Index> _faceVertValues;
\n+
279
\n+
280 // Per-edge:
\n+
281 std::vector<ETag> _edgeTags;
\n+
282
\n+
283 // Per-vertex:
\n+
284 std::vector<Sibling> _vertSiblingCounts;
\n+
285 std::vector<int> _vertSiblingOffsets;
\n+
286 std::vector<Sibling> _vertFaceSiblings;
\n+
287
\n+
288 // Per-value:
\n+
289 std::vector<Index> _vertValueIndices;
\n+
290 std::vector<ValueTag> _vertValueTags;
\n+
291 std::vector<CreaseEndPair> _vertValueCreaseEnds;
\n+
292};
\n+
293
\n+
294//
\n+
295// Access/modify the values associated with each face:
\n+
296//
\n+
297inline ConstIndexArray
\n+
298FVarLevel::getFaceValues(Index fIndex) const {
\n+
299
\n+
300 int vCount = _level.getNumFaceVertices(fIndex);
\n+
301 int vOffset = _level.getOffsetOfFaceVertices(fIndex);
\n+
302 return ConstIndexArray(&_faceVertValues[vOffset], vCount);
\n+
303}
\n+
304inline IndexArray
\n+
305FVarLevel::getFaceValues(Index fIndex) {
\n+
306
\n+
307 int vCount = _level.getNumFaceVertices(fIndex);
\n+
308 int vOffset = _level.getOffsetOfFaceVertices(fIndex);
\n+
309 return IndexArray(&_faceVertValues[vOffset], vCount);
\n+
310}
\n+
311
\n+
312inline FVarLevel::ConstSiblingArray
\n+
313FVarLevel::getVertexFaceSiblings(Index vIndex) const {
\n+
314
\n+
315 int vCount = _level.getNumVertexFaces(vIndex);
\n+
316 int vOffset = _level.getOffsetOfVertexFaces(vIndex);
\n+
317 return ConstSiblingArray(&_vertFaceSiblings[vOffset], vCount);
\n+
318}
\n+
319inline FVarLevel::SiblingArray
\n+
320FVarLevel::getVertexFaceSiblings(Index vIndex) {
\n+
321
\n+
322 int vCount = _level.getNumVertexFaces(vIndex);
\n+
323 int vOffset = _level.getOffsetOfVertexFaces(vIndex);
\n+
324 return SiblingArray(&_vertFaceSiblings[vOffset], vCount);
\n+
325}
\n+
326
\n+
327inline ConstIndexArray
\n+
328FVarLevel::getVertexValues(Index vIndex) const
\n+
329{
\n+
330 int vCount = getNumVertexValues(vIndex);
\n+
331 int vOffset = getVertexValueOffset(vIndex);
\n+
332 return ConstIndexArray(&_vertValueIndices[vOffset], vCount);
\n+
333}
\n+
334inline IndexArray
\n+
335FVarLevel::getVertexValues(Index vIndex)
\n+
336{
\n+
337 int vCount = getNumVertexValues(vIndex);
\n+
338 int vOffset = getVertexValueOffset(vIndex);
\n+
339 return IndexArray(&_vertValueIndices[vOffset], vCount);
\n+
340}
\n+
341
\n+
342inline FVarLevel::ConstValueTagArray
\n+
343FVarLevel::getVertexValueTags(Index vIndex) const
\n+
344{
\n+
345 int vCount = getNumVertexValues(vIndex);
\n+
346 int vOffset = getVertexValueOffset(vIndex);
\n+
347 return ConstValueTagArray(&_vertValueTags[vOffset], vCount);
\n+
348}
\n+
349inline FVarLevel::ValueTagArray
\n+
350FVarLevel::getVertexValueTags(Index vIndex)
\n+
351{
\n+
352 int vCount = getNumVertexValues(vIndex);
\n+
353 int vOffset = getVertexValueOffset(vIndex);
\n+
354 return ValueTagArray(&_vertValueTags[vOffset], vCount);
\n+
355}
\n+
356
\n+
357inline FVarLevel::ConstCreaseEndPairArray
\n+
358FVarLevel::getVertexValueCreaseEnds(Index vIndex) const
\n+
359{
\n+
360 int vCount = getNumVertexValues(vIndex);
\n+
361 int vOffset = getVertexValueOffset(vIndex);
\n+
362 return ConstCreaseEndPairArray(&_vertValueCreaseEnds[vOffset], vCount);
\n+
363}
\n+
364inline FVarLevel::CreaseEndPairArray
\n+
365FVarLevel::getVertexValueCreaseEnds(Index vIndex)
\n+
366{
\n+
367 int vCount = getNumVertexValues(vIndex);
\n+
368 int vOffset = getVertexValueOffset(vIndex);
\n+
369 return CreaseEndPairArray(&_vertValueCreaseEnds[vOffset], vCount);
\n+
370}
\n+
371
\n+
372inline Index
\n+
373FVarLevel::findVertexValueIndex(Index vertexIndex, Index valueIndex) const {
\n+
374
\n+
375 if (_level.getDepth() > 0) return valueIndex;
\n+
376
\n+
377 Index vvIndex = getVertexValueOffset(vertexIndex);
\n+
378 while (_vertValueIndices[vvIndex] != valueIndex) {
\n+
379 ++ vvIndex;
\n+
380 }
\n+
381 return vvIndex;
\n+
382}
\n+
383
\n+
384//
\n+
385// Methods related to tagging:
\n+
386//
\n+
387inline Level::ETag
\n+
388FVarLevel::ETag::combineWithLevelETag(Level::ETag levelTag) const
\n+
389{
\n+
390 if (this->_mismatch) {
\n+
391 levelTag._boundary = true;
\n+
392 levelTag._infSharp = true;
\n+
393 }
\n+
394 return levelTag;
\n+
395}
\n+
396inline Level::VTag
\n+
397FVarLevel::ValueTag::combineWithLevelVTag(Level::VTag levelTag) const
\n+
398{
\n+
399 if (this->_mismatch) {
\n+
400 //
\n+
401 // Semi-sharp FVar values are always tagged and treated as corners
\n+
402 // (at least three sharp edges (two boundary edges and one interior
\n+
403 // semi-sharp) and/or vertex is semi-sharp) until the sharpness has
\n+
404 // decayed, but they ultimately lie on the inf-sharp crease of the
\n+
405 // FVar boundary. Consider this when tagging inf-sharp features.
\n+
406 //
\n+
407 if (this->isCorner()) {
\n+
408 levelTag._rule = (Level::VTag::VTagSize) Sdc::Crease::RULE_CORNER;
\n+
409 } else {
\n+
410 levelTag._rule = (Level::VTag::VTagSize) Sdc::Crease::RULE_CREASE;
\n+
411 }
\n+
412 if (this->isCrease() || this->isSemiSharp()) {
\n+
413 levelTag._infSharp = false;
\n+
414 levelTag._infSharpCrease = true;
\n+
415 levelTag._corner = false;
\n+
416 } else {
\n+
417 levelTag._infSharp = true;
\n+
418 levelTag._infSharpCrease = false;
\n+
419 levelTag._corner = !this->_infIrregular && !this->_infSharpEdges;
\n+
420 }
\n+
421 levelTag._infSharpEdges = true;
\n+
422 levelTag._infIrregular = this->_infIrregular;
\n+
423
\n+
424 levelTag._boundary = true;
\n+
425 levelTag._xordinary = this->_xordinary;
\n+
426
\n+
427 levelTag._nonManifold |= this->_nonManifold;
\n+
428 }
\n+
429 return levelTag;
\n+
430}
\n+
431
\n+
432} // end namespace internal
\n+
433} // end namespace Vtr
\n+
434
\n+
435} // end namespace OPENSUBDIV_VERSION
\n+
436using namespace OPENSUBDIV_VERSION;
\n+
437} // end namespace OpenSubdiv
\n+
438
\n+
439#endif /* OPENSUBDIV3_VTR_FVAR_LEVEL_H */
\n \n+
ConstArray< LocalIndex > ConstLocalIndexArray
Definition types.h:83
\n+
Array< LocalIndex > LocalIndexArray
Definition types.h:82
\n \n+
ConstArray< Index > ConstIndexArray
Definition types.h:80
\n \n+\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-fvarRefinement.h\n+fvarLevel.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2014 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -23,118 +23,484 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_VTR_FVAR_REFINEMENT_H\n-25#define OPENSUBDIV3_VTR_FVAR_REFINEMENT_H\n+24#ifndef OPENSUBDIV3_VTR_FVAR_LEVEL_H\n+25#define OPENSUBDIV3_VTR_FVAR_LEVEL_H\n 26\n 27#include \"../version.h\"\n 28\n 29#include \"../sdc/types.h\"\n 30#include \"../sdc/crease.h\"\n-31#include \"../vtr/types.h\"\n-32#include \"../vtr/refinement.h\"\n-33#include \"../vtr/fvarLevel.h\"\n+31#include \"../sdc/options.h\"\n+32#include \"../vtr/types.h\"\n+33#include \"../vtr/level.h\"\n 34\n 35#include \n 36#include \n 37#include \n 38\n 39\n 40namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n 41namespace OPENSUBDIV_VERSION {\n 42\n 43namespace Vtr {\n 44namespace internal {\n 45\n 46//\n-47// FVarRefinement:\n-48// A face-varying refinement contains data to support the refinement of a\n-49// particular face-varying \"channel\". Just as Refinement maintains a mapping\n-50// between the components of a parent Level and its child, the face-varying\n-51// analog maintains a mapping between the face-varying values of a parent\n-52// FVarLevel and its child.\n-53//\n-54// It turns out there is little data necessary here, so the class consists\n-55// mainly of methods that populate the child FVarLevel. The mapping data in\n-56// the refinement between Levels serves most purposes and all that is\n-required\n-57// in addition is a mapping from values in the child FVarLevel to the parent.\n-58//\n-59class FVarRefinement {\n-60public:\n-61 FVarRefinement(Refinement const& refinement, FVarLevel& parent, FVarLevel&\n-child);\n-62 ~FVarRefinement();\n-63\n-64 int getChildValueParentSource(_\bI_\bn_\bd_\be_\bx vIndex, int sibling) const {\n-65 return _childValueParentSource[_childFVar.getVertexValueOffset(vIndex,\n-(_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx)sibling)];\n-66 }\n-67\n-68 float getFractionalWeight(_\bI_\bn_\bd_\be_\bx pVert, _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx pSibling,\n-69 _\bI_\bn_\bd_\be_\bx cVert, _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx cSibling) const;\n-70\n-71\n-72 // Modifiers supporting application of the refinement:\n-73 void applyRefinement();\n-74\n-75 void estimateAndAllocateChildValues();\n-76 void populateChildValues();\n-77 void populateChildValuesFromFaceVertices();\n-78 void populateChildValuesFromEdgeVertices();\n-79 int populateChildValuesForEdgeVertex(_\bI_\bn_\bd_\be_\bx cVert, _\bI_\bn_\bd_\be_\bx pEdge);\n-80 void populateChildValuesFromVertexVertices();\n-81 int populateChildValuesForVertexVertex(_\bI_\bn_\bd_\be_\bx cVert, _\bI_\bn_\bd_\be_\bx pVert);\n-82 void trimAndFinalizeChildValues();\n-83\n-84 void propagateEdgeTags();\n-85 void propagateValueTags();\n-86 void propagateValueCreases();\n-87 void reclassifySemisharpValues();\n-88\n-89private:\n-90 //\n-91 // Identify the Refinement, its Levels and assigned FVarLevels for more\n-92 // immediate access -- child FVarLevel is non-const as it is to be assigned:\n-93 //\n-94 Refinement const & _refinement;\n-95\n-96 Level const & _parentLevel;\n-97 FVarLevel const & _parentFVar;\n+47// FVarLevel:\n+48// A \"face-varying channel\" includes the topology for a set of face-varying\n+49// data, relative to the topology of the Level with which it is associated.\n+50//\n+51// Analogous to a set of vertices and face-vertices that define the topology\n+for\n+52// the geometry, a channel requires a set of \"values\" and \"face-values\". The\n+53// \"values\" are indices of entries in a set of face-varying data, just as\n+vertices\n+54// are indices into a set of vertex data. The face-values identify a value\n+for\n+55// each vertex of the face, and so define topology for the values that may be\n+56// unique to each channel.\n+57//\n+58// In addition to the value size and the vector of face-values (which matches\n+the\n+59// size of the geometry's face-vertices), tags are associated with each\n+component\n+60// to identify deviations of the face-varying topology from the vertex\n+topology.\n+61// And since there may be a one-to-many mapping between vertices and face-\n+varying\n+62// values, that mapping is also allocated.\n+63//\n+64// It turns out that the mapping used is able to completely encode the set of\n+65// face-values and is more amenable to refinement. Currently the face-values\n+66// take up almost half the memory of this representation, so if memory does\n+67// become a concern, we do not need to store them. The only reason we do so\n+now\n+68// is that the face-value interface for specifying base topology and\n+inspecting\n+69// subsequent levels is very familiar to that of face-vertices for clients.\n+So\n+70// having them available for such access is convenient.\n+71//\n+72// Regarding scope and access...\n+73// Unclear at this early state, but leaning towards nesting this class within\n+74// Level, given the intimate dependency between the two.\n+75// Everything is being declared public for now to facilitate access until\n+it's\n+76// clearer how this functionality will be provided.\n+77//\n+78class FVarLevel {\n+79public:\n+80 //\n+81 // Component tags -- trying to minimize the types needed here:\n+82 //\n+83 // Tag per Edge:\n+84 // - facilitates topological analysis around each vertex\n+85 // - required during refinement to spawn one or more edge-values\n+86 //\n+87 struct ETag {\n+88 ETag() { }\n+89\n+90 void clear() { std::memset(this, 0, sizeof(ETag)); }\n+91\n+92 typedef unsigned char ETagSize;\n+93\n+94 ETagSize _mismatch : 1; // local FVar topology does not match\n+95 ETagSize _disctsV0 : 1; // discontinuous at vertex 0\n+96 ETagSize _disctsV1 : 1; // discontinuous at vertex 1\n+97 ETagSize _linear : 1; // linear boundary constraints\n 98\n-99 Level const & _childLevel;\n-100 FVarLevel & _childFVar;\n+99 Level::ETag combineWithLevelETag(Level::ETag) const;\n+100 };\n 101\n-102 // When refinement is sparse, we need a mapping between siblings of a\n-vertex\n-103 // value in the parent and child -- and for some child values, there will\n-not\n-104 // be a parent value, in which case the source of the parent component will\n-105 // be stored. So we refer to the parent \"source\" rather than \"sibling\":\n-106 //\n-107 std::vector _childValueParentSource;\n-108};\n-109\n-110} // end namespace internal\n-111} // end namespace Vtr\n+102 //\n+103 // Tag per Value:\n+104 // - informs both refinement and interpolation\n+105 // - every value spawns a child value in refinement\n+106 // - includes a subset of Level::VTag to be later combined with a VTag\n+107 //\n+108 struct ValueTag {\n+109 ValueTag() { }\n+110\n+111 void clear() { std::memset(this, 0, sizeof(ValueTag)); }\n 112\n-113} // end namespace OPENSUBDIV_VERSION\n-114using namespace OPENSUBDIV_VERSION;\n-115} // end namespace OpenSubdiv\n-116\n-117#endif /* OPENSUBDIV3_VTR_FVAR_REFINEMENT_H */\n+113 bool isMismatch() const { return _mismatch; }\n+114 bool isCrease() const { return _crease; }\n+115 bool isCorner() const { return !_crease; }\n+116 bool isSemiSharp() const { return _semiSharp; }\n+117 bool isInfSharp() const { return !_semiSharp && !_crease; }\n+118 bool isDepSharp() const { return _depSharp; }\n+119 bool hasCreaseEnds() const { return _crease || _semiSharp; }\n+120\n+121 bool hasInfSharpEdges() const { return _infSharpEdges; }\n+122 bool hasInfIrregularity() const { return _infIrregular; }\n+123\n+124 typedef unsigned char ValueTagSize;\n+125\n+126 // If there is no mismatch, no other members should be inspected\n+127 ValueTagSize _mismatch : 1; // local FVar topology does not match\n+128 ValueTagSize _xordinary : 1; // local FVar topology is extra-ordinary\n+129 ValueTagSize _nonManifold : 1; // local FVar topology is non-manifold\n+130 ValueTagSize _crease : 1; // value is a crease, otherwise a corner\n+131 ValueTagSize _semiSharp : 1; // value is a corner decaying to crease\n+132 ValueTagSize _depSharp : 1; // value is a corner by dependency on another\n+133\n+134 ValueTagSize _infSharpEdges : 1; // value is a corner by inf-sharp features\n+135 ValueTagSize _infIrregular : 1; // value span includes inf-sharp\n+irregularity\n+136\n+137 Level::VTag combineWithLevelVTag(Level::VTag) const;\n+138\n+139 // Alternate constructor and accessor for dealing with integer bits\n+directly:\n+140 explicit ValueTag(ValueTagSize bits) {\n+141 std::memcpy(this, &bits, sizeof(bits));\n+142 }\n+143 ValueTagSize getBits() const {\n+144 ValueTagSize bits;\n+145 std::memcpy(&bits, this, sizeof(bits));\n+146 return bits;\n+147 }\n+148 };\n+149\n+150 typedef Vtr::ConstArray ConstValueTagArray;\n+151 typedef Vtr::Array ValueTagArray;\n+152\n+153 //\n+154 // Simple struct containing the \"end faces\" of a crease, i.e. the faces\n+which\n+155 // contain the FVar values to be used when interpolating the crease.\n+(Prefer\n+156 // the struct over std::pair for its member names)\n+157 //\n+158 struct CreaseEndPair {\n+159 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx _startFace;\n+160 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx _endFace;\n+161 };\n+162\n+163 typedef Vtr::ConstArray ConstCreaseEndPairArray;\n+164 typedef Vtr::Array CreaseEndPairArray;\n+165\n+166 typedef _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx Sibling;\n+167\n+168 typedef _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by ConstSiblingArray;\n+169 typedef _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by SiblingArray;\n+170\n+171public:\n+172 FVarLevel(Level const& level);\n+173 ~FVarLevel();\n+174\n+175 // Queries for the entire channel:\n+176 Level const& getLevel() const { return _level; }\n+177\n+178 int getNumValues() const { return _valueCount; }\n+179 int getNumFaceValuesTotal() const { return (int) _faceVertValues.size(); }\n+180\n+181 bool isLinear() const { return _isLinear; }\n+182 bool hasLinearBoundaries() const { return _hasLinearBoundaries; }\n+183 bool hasSmoothBoundaries() const { return ! _hasLinearBoundaries; }\n+184 bool hasCreaseEnds() const { return hasSmoothBoundaries(); }\n+185\n+186 Sdc::Options getOptions() const { return _options; }\n+187\n+188 // Queries per face:\n+189 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getFaceValues(_\bI_\bn_\bd_\be_\bx fIndex) const;\n+190 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getFaceValues(_\bI_\bn_\bd_\be_\bx fIndex);\n+191\n+192 // Queries per edge:\n+193 ETag getEdgeTag(_\bI_\bn_\bd_\be_\bx eIndex) const { return _edgeTags[eIndex]; }\n+194 bool edgeTopologyMatches(_\bI_\bn_\bd_\be_\bx eIndex) const { return !getEdgeTag\n+(eIndex)._mismatch; }\n+195\n+196 // Queries per vertex (and its potential sibling values):\n+197 int getNumVertexValues(_\bI_\bn_\bd_\be_\bx v) const { return _vertSiblingCounts[v]; }\n+198 _\bI_\bn_\bd_\be_\bx getVertexValueOffset(_\bI_\bn_\bd_\be_\bx v, Sibling i = 0) const { return\n+_vertSiblingOffsets[v] + i; }\n+199\n+200 _\bI_\bn_\bd_\be_\bx getVertexValue(_\bI_\bn_\bd_\be_\bx v, Sibling i = 0) const { return\n+_vertValueIndices[getVertexValueOffset(v,i)]; }\n+201\n+202 _\bI_\bn_\bd_\be_\bx findVertexValueIndex(_\bI_\bn_\bd_\be_\bx vertexIndex, _\bI_\bn_\bd_\be_\bx valueIndex) const;\n+203\n+204 // Methods to access/modify array properties per vertex:\n+205 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getVertexValues(_\bI_\bn_\bd_\be_\bx vIndex) const;\n+206 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getVertexValues(_\bI_\bn_\bd_\be_\bx vIndex);\n+207\n+208 ConstValueTagArray getVertexValueTags(_\bI_\bn_\bd_\be_\bx vIndex) const;\n+209 ValueTagArray getVertexValueTags(_\bI_\bn_\bd_\be_\bx vIndex);\n+210\n+211 ConstCreaseEndPairArray getVertexValueCreaseEnds(_\bI_\bn_\bd_\be_\bx vIndex) const;\n+212 CreaseEndPairArray getVertexValueCreaseEnds(_\bI_\bn_\bd_\be_\bx vIndex);\n+213\n+214 ConstSiblingArray getVertexFaceSiblings(_\bI_\bn_\bd_\be_\bx vIndex) const;\n+215 SiblingArray getVertexFaceSiblings(_\bI_\bn_\bd_\be_\bx vIndex);\n+216\n+217 // Queries per value:\n+218 ValueTag getValueTag(_\bI_\bn_\bd_\be_\bx valueIndex) const { return _vertValueTags\n+[valueIndex]; }\n+219 bool valueTopologyMatches(_\bI_\bn_\bd_\be_\bx valueIndex) const { return !getValueTag\n+(valueIndex)._mismatch; }\n+220\n+221 CreaseEndPair getValueCreaseEndPair(_\bI_\bn_\bd_\be_\bx valueIndex) const { return\n+_vertValueCreaseEnds[valueIndex]; }\n+222\n+223 // Tag queries related to faces (use Level methods for those returning\n+Level::VTag/ETag)\n+224 void getFaceValueTags(_\bI_\bn_\bd_\be_\bx faceIndex, ValueTag valueTags[]) const;\n+225\n+226 ValueTag getFaceCompositeValueTag(_\bI_\bn_\bd_\be_\bx faceIndex) const;\n+227\n+228 // Higher-level topological queries, i.e. values in a neighborhood:\n+229 void getEdgeFaceValues(_\bI_\bn_\bd_\be_\bx eIndex, int fIncToEdge, _\bI_\bn_\bd_\be_\bx valuesPerVert\n+[2]) const;\n+230 void getVertexEdgeValues(_\bI_\bn_\bd_\be_\bx vIndex, _\bI_\bn_\bd_\be_\bx valuesPerEdge[]) const;\n+231 void getVertexCreaseEndValues(_\bI_\bn_\bd_\be_\bx vIndex, Sibling sibling, _\bI_\bn_\bd_\be_\bx\n+endValues[2]) const;\n+232\n+233 // Initialization and allocation helpers:\n+234 void setOptions(Sdc::Options const& options);\n+235 void resizeVertexValues(int numVertexValues);\n+236 void resizeValues(int numValues);\n+237 void resizeComponents();\n+238\n+239 // Topological analysis methods -- tagging and face-value population:\n+240 void completeTopologyFromFaceValues(int regBoundaryValence);\n+241 void initializeFaceValuesFromFaceVertices();\n+242 void initializeFaceValuesFromVertexFaceSiblings();\n+243\n+244 struct ValueSpan;\n+245 void gatherValueSpans(_\bI_\bn_\bd_\be_\bx vIndex, ValueSpan * vValueSpans) const;\n+246\n+247 // Debugging methods:\n+248 bool validate() const;\n+249 void print() const;\n+250 void buildFaceVertexSiblingsFromVertexFaceSiblings(std::vector&\n+fvSiblings) const;\n+251\n+252private:\n+253 // Just as Refinements build Levels, FVarRefinements build FVarLevels...\n+254 friend class FVarRefinement;\n+255\n+256 Level const & _level;\n+257\n+258 // Linear interpolation options vary between channels:\n+259 Sdc::Options _options;\n+260\n+261 bool _isLinear;\n+262 bool _hasLinearBoundaries;\n+263 bool _hasDependentSharpness;\n+264 int _valueCount;\n+265\n+266 //\n+267 // Vectors recording face-varying topology including tags that help\n+propagate\n+268 // data through the refinement hierarchy. Vectors are not sparse but most\n+use\n+269 // 8-bit values relative to the local topology.\n+270 //\n+271 // The vector of face-values is actually redundant here, but is constructed\n+as\n+272 // it is most convenient for clients. It represents almost half the memory\n+of\n+273 // the topology (4 32-bit integers per face) and not surprisingly,\n+populating\n+274 // it takes a considerable amount of the refinement time (1/3). We can\n+reduce\n+275 // both if we are willing to compute these on demand for clients.\n+276 //\n+277 // Per-face (matches face-verts of corresponding level):\n+278 std::vector _faceVertValues;\n+279\n+280 // Per-edge:\n+281 std::vector _edgeTags;\n+282\n+283 // Per-vertex:\n+284 std::vector _vertSiblingCounts;\n+285 std::vector _vertSiblingOffsets;\n+286 std::vector _vertFaceSiblings;\n+287\n+288 // Per-value:\n+289 std::vector _vertValueIndices;\n+290 std::vector _vertValueTags;\n+291 std::vector _vertValueCreaseEnds;\n+292};\n+293\n+294//\n+295// Access/modify the values associated with each face:\n+296//\n+297inline _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+298FVarLevel::getFaceValues(_\bI_\bn_\bd_\be_\bx fIndex) const {\n+299\n+300 int vCount = _level.getNumFaceVertices(fIndex);\n+301 int vOffset = _level.getOffsetOfFaceVertices(fIndex);\n+302 return _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by(&_faceVertValues[vOffset], vCount);\n+303}\n+304inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+305FVarLevel::getFaceValues(_\bI_\bn_\bd_\be_\bx fIndex) {\n+306\n+307 int vCount = _level.getNumFaceVertices(fIndex);\n+308 int vOffset = _level.getOffsetOfFaceVertices(fIndex);\n+309 return _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by(&_faceVertValues[vOffset], vCount);\n+310}\n+311\n+312inline FVarLevel::ConstSiblingArray\n+313FVarLevel::getVertexFaceSiblings(_\bI_\bn_\bd_\be_\bx vIndex) const {\n+314\n+315 int vCount = _level.getNumVertexFaces(vIndex);\n+316 int vOffset = _level.getOffsetOfVertexFaces(vIndex);\n+317 return ConstSiblingArray(&_vertFaceSiblings[vOffset], vCount);\n+318}\n+319inline FVarLevel::SiblingArray\n+320FVarLevel::getVertexFaceSiblings(_\bI_\bn_\bd_\be_\bx vIndex) {\n+321\n+322 int vCount = _level.getNumVertexFaces(vIndex);\n+323 int vOffset = _level.getOffsetOfVertexFaces(vIndex);\n+324 return SiblingArray(&_vertFaceSiblings[vOffset], vCount);\n+325}\n+326\n+327inline _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+328FVarLevel::getVertexValues(_\bI_\bn_\bd_\be_\bx vIndex) const\n+329{\n+330 int vCount = getNumVertexValues(vIndex);\n+331 int vOffset = getVertexValueOffset(vIndex);\n+332 return _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by(&_vertValueIndices[vOffset], vCount);\n+333}\n+334inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+335FVarLevel::getVertexValues(_\bI_\bn_\bd_\be_\bx vIndex)\n+336{\n+337 int vCount = getNumVertexValues(vIndex);\n+338 int vOffset = getVertexValueOffset(vIndex);\n+339 return _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by(&_vertValueIndices[vOffset], vCount);\n+340}\n+341\n+342inline FVarLevel::ConstValueTagArray\n+343FVarLevel::getVertexValueTags(_\bI_\bn_\bd_\be_\bx vIndex) const\n+344{\n+345 int vCount = getNumVertexValues(vIndex);\n+346 int vOffset = getVertexValueOffset(vIndex);\n+347 return ConstValueTagArray(&_vertValueTags[vOffset], vCount);\n+348}\n+349inline FVarLevel::ValueTagArray\n+350FVarLevel::getVertexValueTags(_\bI_\bn_\bd_\be_\bx vIndex)\n+351{\n+352 int vCount = getNumVertexValues(vIndex);\n+353 int vOffset = getVertexValueOffset(vIndex);\n+354 return ValueTagArray(&_vertValueTags[vOffset], vCount);\n+355}\n+356\n+357inline FVarLevel::ConstCreaseEndPairArray\n+358FVarLevel::getVertexValueCreaseEnds(_\bI_\bn_\bd_\be_\bx vIndex) const\n+359{\n+360 int vCount = getNumVertexValues(vIndex);\n+361 int vOffset = getVertexValueOffset(vIndex);\n+362 return ConstCreaseEndPairArray(&_vertValueCreaseEnds[vOffset], vCount);\n+363}\n+364inline FVarLevel::CreaseEndPairArray\n+365FVarLevel::getVertexValueCreaseEnds(_\bI_\bn_\bd_\be_\bx vIndex)\n+366{\n+367 int vCount = getNumVertexValues(vIndex);\n+368 int vOffset = getVertexValueOffset(vIndex);\n+369 return CreaseEndPairArray(&_vertValueCreaseEnds[vOffset], vCount);\n+370}\n+371\n+372inline _\bI_\bn_\bd_\be_\bx\n+373FVarLevel::findVertexValueIndex(_\bI_\bn_\bd_\be_\bx vertexIndex, _\bI_\bn_\bd_\be_\bx valueIndex) const {\n+374\n+375 if (_level.getDepth() > 0) return valueIndex;\n+376\n+377 _\bI_\bn_\bd_\be_\bx vvIndex = getVertexValueOffset(vertexIndex);\n+378 while (_vertValueIndices[vvIndex] != valueIndex) {\n+379 ++ vvIndex;\n+380 }\n+381 return vvIndex;\n+382}\n+383\n+384//\n+385// Methods related to tagging:\n+386//\n+387inline Level::ETag\n+388FVarLevel::ETag::combineWithLevelETag(Level::ETag levelTag) const\n+389{\n+390 if (this->_mismatch) {\n+391 levelTag._boundary = true;\n+392 levelTag._infSharp = true;\n+393 }\n+394 return levelTag;\n+395}\n+396inline Level::VTag\n+397FVarLevel::ValueTag::combineWithLevelVTag(Level::VTag levelTag) const\n+398{\n+399 if (this->_mismatch) {\n+400 //\n+401 // Semi-sharp FVar values are always tagged and treated as corners\n+402 // (at least three sharp edges (two boundary edges and one interior\n+403 // semi-sharp) and/or vertex is semi-sharp) until the sharpness has\n+404 // decayed, but they ultimately lie on the inf-sharp crease of the\n+405 // FVar boundary. Consider this when tagging inf-sharp features.\n+406 //\n+407 if (this->isCorner()) {\n+408 levelTag._rule = (Level::VTag::VTagSize) _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bO_\bR_\bN_\bE_\bR;\n+409 } else {\n+410 levelTag._rule = (Level::VTag::VTagSize) _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE;\n+411 }\n+412 if (this->isCrease() || this->isSemiSharp()) {\n+413 levelTag._infSharp = false;\n+414 levelTag._infSharpCrease = true;\n+415 levelTag._corner = false;\n+416 } else {\n+417 levelTag._infSharp = true;\n+418 levelTag._infSharpCrease = false;\n+419 levelTag._corner = !this->_infIrregular && !this->_infSharpEdges;\n+420 }\n+421 levelTag._infSharpEdges = true;\n+422 levelTag._infIrregular = this->_infIrregular;\n+423\n+424 levelTag._boundary = true;\n+425 levelTag._xordinary = this->_xordinary;\n+426\n+427 levelTag._nonManifold |= this->_nonManifold;\n+428 }\n+429 return levelTag;\n+430}\n+431\n+432} // end namespace internal\n+433} // end namespace Vtr\n+434\n+435} // end namespace OPENSUBDIV_VERSION\n+436using namespace OPENSUBDIV_VERSION;\n+437} // end namespace OpenSubdiv\n+438\n+439#endif /* OPENSUBDIV3_VTR_FVAR_LEVEL_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+ConstArray< LocalIndex > ConstLocalIndexArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+Array< LocalIndex > LocalIndexArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b8_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n int Index\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+ConstArray< Index > ConstIndexArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b8_\b0\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx\n unsigned short LocalIndex\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+Array< Index > IndexArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bO_\bR_\bN_\bE_\bR\n+@ RULE_CORNER\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE\n+@ RULE_CREASE\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b6\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bv_\bt_\br\n- * _\bf_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\n+ * _\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00782.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00782.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/sdc/catmarkScheme.h File Reference\n+OpenSubdiv: opensubdiv/sdc/bilinearScheme.h File Reference\n \n \n \n \n \n \n \n@@ -89,21 +89,19 @@\n \n \n \n \n
\n \n-
catmarkScheme.h File Reference
\n+
bilinearScheme.h File Reference
\n
\n
\n
#include "../version.h"
\n #include "../sdc/scheme.h"
\n-#include <cassert>
\n-#include <cmath>
\n
\n

Go to the source code of this file.

\n \n \n \n \n@@ -113,13 +111,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,22 +1,20 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-catmarkScheme.h File Reference\n+bilinearScheme.h File Reference\n #include \"../version.h\"\n #include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bs_\bc_\bh_\be_\bm_\be_\b._\bh\"\n-#include \n-#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bs_\bd_\bc\n- * _\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n+ * _\bb_\bi_\bl_\bi_\bn_\be_\ba_\br_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00782_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00782_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/sdc/catmarkScheme.h Source File\n+OpenSubdiv: opensubdiv/sdc/bilinearScheme.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
catmarkScheme.h
\n+
bilinearScheme.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2014 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -118,566 +118,193 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_SDC_CATMARK_SCHEME_H
\n-
25#define OPENSUBDIV3_SDC_CATMARK_SCHEME_H
\n+
24#ifndef OPENSUBDIV3_SDC_BILINEAR_SCHEME_H
\n+
25#define OPENSUBDIV3_SDC_BILINEAR_SCHEME_H
\n
26
\n
27#include "../version.h"
\n
28
\n
29#include "../sdc/scheme.h"
\n
30
\n-
31#include <cassert>
\n-
32#include <cmath>
\n+
31namespace OpenSubdiv {
\n+
32namespace OPENSUBDIV_VERSION {
\n
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Sdc {
\n-
38
\n-
39//
\n-
40// Specializations for Scheme<SCHEME_CATMARK>:
\n-
41//
\n-
42
\n-
43//
\n-
44// Catmark traits:
\n-
45//
\n+
\n+
34namespace Sdc {
\n+
35
\n+
36//
\n+
37// Specializations for Scheme<SCHEME_BILINEAR>:
\n+
38//
\n+
39
\n+
40//
\n+
41// Bilinear traits:
\n+
42//
\n+
43template <>
\n+\n+
45
\n
46template <>
\n-\n+\n
48
\n
49template <>
\n-\n+\n
51
\n
52template <>
\n-\n+\n
54
\n-
55template <>
\n-\n-
57
\n-
58
\n-
59//
\n-
60// Masks for edge-vertices: the hard Crease mask does not need to be specialized
\n-
61// (simply the midpoint), so all that is left is the Smooth case:
\n-
62//
\n-
63// The Smooth mask is complicated by the need to support the "triangle subdivision"
\n-
64// option, which applies different weighting in the presence of triangles. It is
\n-
65// up for debate as to whether this is useful or not -- we may be able to deprecate
\n-
66// this option.
\n-
67//
\n+
55
\n+
56//
\n+
57// Refinement masks:
\n+
58//
\n+
59template <>
\n+
60template <typename EDGE, typename MASK>
\n+
61void
\n+
\n+\n+\n+
64 // This should be inline, otherwise trivially replicate it:
\n+
65 assignCreaseMaskForEdge(edge, mask);
\n+
66}
\n+
\n+
67
\n
68template <>
\n-
69template <typename EDGE, typename MASK>
\n-
70inline void
\n+
69template <typename VERTEX, typename MASK>
\n+
70void
\n
\n-
71Scheme<SCHEME_CATMARK>::assignSmoothMaskForEdge(EDGE const& edge, MASK& mask) const {
\n-
72
\n-
73 typedef typename MASK::Weight Weight;
\n-
74
\n-
75 int faceCount = edge.GetNumFaces();
\n+
71Scheme<SCHEME_BILINEAR>::ComputeVertexVertexMask(VERTEX const& vertex, MASK& mask,
\n+\n+
73 // This should be inline, otherwise trivially replicate it:
\n+
74 assignCornerMaskForVertex(vertex, mask);
\n+
75}
\n+
\n
76
\n-
77 mask.SetNumVertexWeights(2);
\n-
78 mask.SetNumEdgeWeights(0);
\n-
79 mask.SetNumFaceWeights(faceCount);
\n-
80 mask.SetFaceWeightsForFaceCenters(true);
\n-
81
\n-
82 //
\n-
83 // Determine if we need to inspect incident faces and apply alternate weighting for
\n-
84 // triangles -- and if so, determine which of the two are triangles.
\n-
85 //
\n-
86 bool face0IsTri = false;
\n-
87 bool face1IsTri = false;
\n-
88 bool useTriangleOption = (_options.GetTriangleSubdivision() == Options::TRI_SUB_SMOOTH);
\n-
89 if (useTriangleOption) {
\n-
90 if (faceCount == 2) {
\n-
91 //
\n-
92 // Ideally we want to avoid this inspection when we have already subdivided at
\n-
93 // least once -- need something in the Edge interface to help avoid this, e.g.
\n-
94 // an IsRegular() query, the subdivision level...
\n-
95 //
\n-
96 int vertsPerFace[2];
\n-
97 edge.GetNumVerticesPerFace(vertsPerFace);
\n-
98
\n-
99 face0IsTri = (vertsPerFace[0] == 3);
\n-
100 face1IsTri = (vertsPerFace[1] == 3);
\n-
101 useTriangleOption = face0IsTri || face1IsTri;
\n-
102 } else {
\n-
103 useTriangleOption = false;
\n-
104 }
\n-
105 }
\n-
106
\n-
107 if (! useTriangleOption) {
\n-
108 mask.VertexWeight(0) = 0.25f;
\n-
109 mask.VertexWeight(1) = 0.25f;
\n+
77
\n+
78//
\n+
79// Limit masks for position -- the limit position of all vertices is the refined vertex.
\n+
80//
\n+
81template <>
\n+
82template <typename VERTEX, typename MASK>
\n+
83inline void
\n+
\n+
84Scheme<SCHEME_BILINEAR>::assignCornerLimitMask(VERTEX const& /* vertex */, MASK& posMask) const {
\n+
85
\n+
86 posMask.SetNumVertexWeights(1);
\n+
87 posMask.SetNumEdgeWeights(0);
\n+
88 posMask.SetNumFaceWeights(0);
\n+
89 posMask.SetFaceWeightsForFaceCenters(false);
\n+
90
\n+
91 posMask.VertexWeight(0) = 1.0f;
\n+
92}
\n+
\n+
93
\n+
94template <>
\n+
95template <typename VERTEX, typename MASK>
\n+
96inline void
\n+
\n+
97Scheme<SCHEME_BILINEAR>::assignCreaseLimitMask(VERTEX const& vertex, MASK& posMask,
\n+
98 int const /* creaseEnds */[2]) const {
\n+
99
\n+
100 assignCornerLimitMask(vertex, posMask);
\n+
101}
\n+
\n+
102
\n+
103template <>
\n+
104template <typename VERTEX, typename MASK>
\n+
105inline void
\n+
\n+
106Scheme<SCHEME_BILINEAR>::assignSmoothLimitMask(VERTEX const& vertex, MASK& posMask) const {
\n+
107
\n+
108 assignCornerLimitMask(vertex, posMask);
\n+
109}
\n+
\n
110
\n-
111 if (faceCount == 2) {
\n-
112 mask.FaceWeight(0) = 0.25f;
\n-
113 mask.FaceWeight(1) = 0.25f;
\n-
114 } else {
\n-
115 Weight fWeight = 0.5f / (Weight)faceCount;
\n-
116 for (int i = 0; i < faceCount; ++i) {
\n-
117 mask.FaceWeight(i) = fWeight;
\n-
118 }
\n-
119 }
\n-
120 } else {
\n-
121 //
\n-
122 // This mimics the implementation in Hbr in terms of order of operations.
\n-
123 //
\n-
124 const Weight CATMARK_SMOOTH_TRI_EDGE_WEIGHT = (Weight) 0.470;
\n+
111//
\n+
112// Limit masks for tangents -- these are ambiguous around all vertices. Provide
\n+
113// the tangents based on the incident edges of the first face.
\n+
114//
\n+
115template <>
\n+
116template <typename VERTEX, typename MASK>
\n+
117inline void
\n+
\n+\n+
119 MASK& tan1Mask, MASK& tan2Mask) const {
\n+
120
\n+
121 tan1Mask.SetNumVertexWeights(1);
\n+
122 tan1Mask.SetNumEdgeWeights(2);
\n+
123 tan1Mask.SetNumFaceWeights(0);
\n+
124 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n
125
\n-
126 Weight f0Weight = face0IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;
\n-
127 Weight f1Weight = face1IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;
\n-
128
\n-
129 Weight fWeight = 0.5f * (f0Weight + f1Weight);
\n-
130 Weight vWeight = 0.5f * (1.0f - 2.0f * fWeight);
\n-
131
\n-
132 mask.VertexWeight(0) = vWeight;
\n-
133 mask.VertexWeight(1) = vWeight;
\n+
126 tan2Mask.SetNumVertexWeights(1);
\n+
127 tan2Mask.SetNumEdgeWeights(2);
\n+
128 tan2Mask.SetNumFaceWeights(0);
\n+
129 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n+
130
\n+
131 tan1Mask.VertexWeight(0) = -1.0f;
\n+
132 tan1Mask.EdgeWeight(0) = 1.0f;
\n+
133 tan1Mask.EdgeWeight(1) = 0.0f;
\n
134
\n-
135 mask.FaceWeight(0) = fWeight;
\n-
136 mask.FaceWeight(1) = fWeight;
\n-
137 }
\n+
135 tan2Mask.VertexWeight(0) = -1.0f;
\n+
136 tan2Mask.EdgeWeight(0) = 0.0f;
\n+
137 tan2Mask.EdgeWeight(1) = 1.0f;
\n
138}
\n
\n
139
\n-
140
\n-
141//
\n-
142// Masks for vertex-vertices: the hard Corner mask does not need to be specialized
\n-
143// (simply the vertex itself), leaving the Crease and Smooth cases (Dart is smooth):
\n-
144//
\n-
145template <>
\n-
146template <typename VERTEX, typename MASK>
\n-
147inline void
\n-
\n-\n-
149 int const creaseEnds[2]) const {
\n-
150 typedef typename MASK::Weight Weight;
\n-
151
\n-
152 int valence = vertex.GetNumEdges();
\n-
153
\n-
154 mask.SetNumVertexWeights(1);
\n-
155 mask.SetNumEdgeWeights(valence);
\n-
156 mask.SetNumFaceWeights(0);
\n-
157 mask.SetFaceWeightsForFaceCenters(false);
\n-
158
\n-
159 Weight vWeight = 0.75f;
\n-
160 Weight eWeight = 0.125f;
\n-
161
\n-
162 mask.VertexWeight(0) = vWeight;
\n-
163 for (int i = 0; i < valence; ++i) {
\n-
164 mask.EdgeWeight(i) = 0.0f;
\n-
165 }
\n-
166 mask.EdgeWeight(creaseEnds[0]) = eWeight;
\n-
167 mask.EdgeWeight(creaseEnds[1]) = eWeight;
\n-
168}
\n-
\n-
169
\n-
170template <>
\n-
171template <typename VERTEX, typename MASK>
\n-
172inline void
\n-
\n-
173Scheme<SCHEME_CATMARK>::assignSmoothMaskForVertex(VERTEX const& vertex, MASK& mask) const {
\n-
174
\n-
175 typedef typename MASK::Weight Weight;
\n-
176
\n-
177 //
\n-
178 // A Smooth vertex must be manifold and interior -- manifold boundary vertices will be
\n-
179 // Creases and non-manifold vertices of any kind will be Corners or Creases. If smooth
\n-
180 // rules for non-manifold vertices are ever defined, this will need adjusting:
\n-
181 //
\n-
182 assert(vertex.GetNumFaces() == vertex.GetNumEdges());
\n-
183
\n-
184 int valence = vertex.GetNumFaces();
\n-
185
\n-
186 mask.SetNumVertexWeights(1);
\n-
187 mask.SetNumEdgeWeights(valence);
\n-
188 mask.SetNumFaceWeights(valence);
\n-
189 mask.SetFaceWeightsForFaceCenters(true);
\n-
190
\n-
191 Weight vWeight = (Weight)(valence - 2) / (Weight)valence;
\n-
192 Weight fWeight = 1.0f / (Weight)(valence * valence);
\n-
193 Weight eWeight = fWeight;
\n-
194
\n-
195 mask.VertexWeight(0) = vWeight;
\n-
196 for (int i = 0; i < valence; ++i) {
\n-
197 mask.EdgeWeight(i) = eWeight;
\n-
198 mask.FaceWeight(i) = fWeight;
\n-
199 }
\n-
200}
\n-
\n-
201
\n-
202//
\n-
203// Limit masks for position:
\n-
204//
\n-
205template <>
\n-
206template <typename VERTEX, typename MASK>
\n-
207inline void
\n-
\n-
208Scheme<SCHEME_CATMARK>::assignCornerLimitMask(VERTEX const& /* vertex */, MASK& posMask) const {
\n-
209
\n-
210 posMask.SetNumVertexWeights(1);
\n-
211 posMask.SetNumEdgeWeights(0);
\n-
212 posMask.SetNumFaceWeights(0);
\n-
213 posMask.SetFaceWeightsForFaceCenters(false);
\n-
214
\n-
215 posMask.VertexWeight(0) = 1.0f;
\n-
216}
\n-
\n-
217
\n-
218template <>
\n-
219template <typename VERTEX, typename MASK>
\n-
220inline void
\n-
\n-
221Scheme<SCHEME_CATMARK>::assignCreaseLimitMask(VERTEX const& vertex, MASK& posMask,
\n-
222 int const creaseEnds[2]) const {
\n-
223
\n-
224 typedef typename MASK::Weight Weight;
\n-
225
\n-
226 int valence = vertex.GetNumEdges();
\n-
227
\n-
228 posMask.SetNumVertexWeights(1);
\n-
229 posMask.SetNumEdgeWeights(valence);
\n-
230 posMask.SetNumFaceWeights(0);
\n-
231 posMask.SetFaceWeightsForFaceCenters(false);
\n-
232
\n-
233 Weight vWeight = (Weight)(2.0 / 3.0);
\n-
234 Weight eWeight = (Weight)(1.0 / 6.0);
\n-
235
\n-
236 posMask.VertexWeight(0) = vWeight;
\n-
237 for (int i = 0; i < valence; ++i) {
\n-
238 posMask.EdgeWeight(i) = 0.0f;
\n-
239 }
\n-
240 posMask.EdgeWeight(creaseEnds[0]) = eWeight;
\n-
241 posMask.EdgeWeight(creaseEnds[1]) = eWeight;
\n-
242}
\n-
\n-
243
\n-
244template <>
\n-
245template <typename VERTEX, typename MASK>
\n-
246inline void
\n-
\n-
247Scheme<SCHEME_CATMARK>::assignSmoothLimitMask(VERTEX const& vertex, MASK& posMask) const {
\n-
248
\n-
249 typedef typename MASK::Weight Weight;
\n-
250
\n-
251 int valence = vertex.GetNumFaces();
\n-
252 if (valence == 2) {
\n-
253 assignCornerLimitMask(vertex, posMask);
\n-
254 return;
\n-
255 }
\n-
256
\n-
257 posMask.SetNumVertexWeights(1);
\n-
258 posMask.SetNumEdgeWeights(valence);
\n-
259 posMask.SetNumFaceWeights(valence);
\n-
260 posMask.SetFaceWeightsForFaceCenters(false);
\n-
261
\n-
262 // Specialize for the regular case:
\n-
263 if (valence == 4) {
\n-
264 Weight fWeight = (Weight)(1.0 / 36.0);
\n-
265 Weight eWeight = (Weight)(1.0 / 9.0);
\n-
266 Weight vWeight = (Weight)(4.0 / 9.0);
\n-
267
\n-
268 posMask.VertexWeight(0) = vWeight;
\n-
269
\n-
270 posMask.EdgeWeight(0) = eWeight;
\n-
271 posMask.EdgeWeight(1) = eWeight;
\n-
272 posMask.EdgeWeight(2) = eWeight;
\n-
273 posMask.EdgeWeight(3) = eWeight;
\n-
274
\n-
275 posMask.FaceWeight(0) = fWeight;
\n-
276 posMask.FaceWeight(1) = fWeight;
\n-
277 posMask.FaceWeight(2) = fWeight;
\n-
278 posMask.FaceWeight(3) = fWeight;
\n-
279 } else {
\n-
280 Weight Valence = (Weight) valence;
\n-
281
\n-
282 Weight fWeight = 1.0f / (Valence * (Valence + 5.0f));
\n-
283 Weight eWeight = 4.0f * fWeight;
\n-
284 Weight vWeight = 1.0f - Valence * (eWeight + fWeight);
\n-
285
\n-
286 posMask.VertexWeight(0) = vWeight;
\n-
287 for (int i = 0; i < valence; ++i) {
\n-
288 posMask.EdgeWeight(i) = eWeight;
\n-
289 posMask.FaceWeight(i) = fWeight;
\n-
290 }
\n-
291 }
\n-
292}
\n-
\n-
293
\n-
294//
\n-
295// Limit masks for tangents -- these are stubs for now, or have a temporary
\n-
296// implementation
\n-
297//
\n-
298template <>
\n-
299template <typename VERTEX, typename MASK>
\n-
300inline void
\n-
\n-\n-
302 MASK& tan1Mask, MASK& tan2Mask) const {
\n-
303
\n-
304 int valence = vertex.GetNumEdges();
\n-
305
\n-
306 tan1Mask.SetNumVertexWeights(1);
\n-
307 tan1Mask.SetNumEdgeWeights(valence);
\n-
308 tan1Mask.SetNumFaceWeights(0);
\n-
309 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n-
310
\n-
311 tan2Mask.SetNumVertexWeights(1);
\n-
312 tan2Mask.SetNumEdgeWeights(valence);
\n-
313 tan2Mask.SetNumFaceWeights(0);
\n-
314 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n-
315
\n-
316 // Should be at least 2 edges -- be sure to clear weights for any more:
\n-
317 tan1Mask.VertexWeight(0) = -1.0f;
\n-
318 tan1Mask.EdgeWeight(0) = 1.0f;
\n-
319 tan1Mask.EdgeWeight(1) = 0.0f;
\n-
320
\n-
321 tan2Mask.VertexWeight(0) = -1.0f;
\n-
322 tan2Mask.EdgeWeight(0) = 0.0f;
\n-
323 tan2Mask.EdgeWeight(1) = 1.0f;
\n-
324
\n-
325 for (int i = 2; i < valence; ++i) {
\n-
326 tan1Mask.EdgeWeight(i) = 0.0f;
\n-
327 tan2Mask.EdgeWeight(i) = 0.0f;
\n-
328 }
\n-
329}
\n-
\n-
330
\n-
331template <>
\n-
332template <typename VERTEX, typename MASK>
\n-
333inline void
\n-
\n-\n-
335 MASK& tan1Mask, MASK& tan2Mask, int const creaseEnds[2]) const {
\n-
336
\n-
337 typedef typename MASK::Weight Weight;
\n-
338
\n-
339 //
\n-
340 // First, the tangent along the crease:
\n-
341 // The first crease edge is considered the "leading" edge of the span
\n-
342 // of surface for which we are evaluating tangents and the second edge the
\n-
343 // "trailing edge". By convention, the tangent along the crease is oriented
\n-
344 // in the direction of the leading edge.
\n-
345 //
\n-
346 int numEdges = vertex.GetNumEdges();
\n-
347 int numFaces = vertex.GetNumFaces();
\n-
348
\n-
349 tan1Mask.SetNumVertexWeights(1);
\n-
350 tan1Mask.SetNumEdgeWeights(numEdges);
\n-
351 tan1Mask.SetNumFaceWeights(numFaces);
\n-
352 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n-
353
\n-
354 tan1Mask.VertexWeight(0) = 0.0f;
\n-
355 for (int i = 0; i < numEdges; ++i) {
\n-
356 tan1Mask.EdgeWeight(i) = 0.0f;
\n-
357 }
\n-
358 for (int i = 0; i < numFaces; ++i) {
\n-
359 tan1Mask.FaceWeight(i) = 0.0f;
\n-
360 }
\n-
361
\n-
362 tan1Mask.EdgeWeight(creaseEnds[0]) = 0.5f;
\n-
363 tan1Mask.EdgeWeight(creaseEnds[1]) = -0.5f;
\n-
364
\n-
365 //
\n-
366 // Second, the tangent across the interior faces:
\n-
367 // Note this is ambiguous for an interior vertex. We currently return
\n-
368 // the tangent for the surface in the counter-clockwise span between the
\n-
369 // leading and trailing edges that form the crease. Given the expected
\n-
370 // computation of a surface normal as Tan1 X Tan2, this tangent should be
\n-
371 // oriented "inward" from the crease/boundary -- across the surface rather
\n-
372 // than outward and away from it.
\n-
373 //
\n-
374 tan2Mask.SetNumVertexWeights(1);
\n-
375 tan2Mask.SetNumEdgeWeights(numEdges);
\n-
376 tan2Mask.SetNumFaceWeights(numFaces);
\n-
377 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n-
378
\n-
379 // Prepend weights of 0 preceding the crease:
\n-
380 for (int i = 0; i < creaseEnds[0]; ++i) {
\n-
381 tan2Mask.EdgeWeight(i) = 0.0f;
\n-
382 tan2Mask.FaceWeight(i) = 0.0f;
\n-
383 }
\n-
384
\n-
385 // Assign weights to crease edge and interior points:
\n-
386 int interiorEdgeCount = creaseEnds[1] - creaseEnds[0] - 1;
\n-
387 if (interiorEdgeCount == 1) {
\n-
388 // The regular case -- uniform B-spline cross-tangent:
\n-
389
\n-
390 tan2Mask.VertexWeight(0) = (Weight)(-4.0 / 6.0);
\n-
391
\n-
392 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight)(-1.0 / 6.0);
\n-
393 tan2Mask.EdgeWeight(creaseEnds[0] + 1) = (Weight)( 4.0 / 6.0);
\n-
394 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight)(-1.0 / 6.0);
\n-
395
\n-
396 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight)(1.0 / 6.0);
\n-
397 tan2Mask.FaceWeight(creaseEnds[0] + 1) = (Weight)(1.0 / 6.0);
\n-
398 } else if (interiorEdgeCount > 1) {
\n-
399 // The irregular case -- formulae from Biermann et al:
\n-
400
\n-
401 double k = (double) (interiorEdgeCount + 1);
\n-
402 double theta = M_PI / k;
\n-
403
\n-
404 double cosTheta = std::cos(theta);
\n-
405 double sinTheta = std::sin(theta);
\n-
406
\n-
407 // Loop/Schaefer use a different divisor here (3*k + cos(theta)):
\n-
408 double commonDenom = 1.0f / (k * (3.0f + cosTheta));
\n-
409 double R = (cosTheta + 1.0f) / sinTheta;
\n-
410
\n-
411 double vertexWeight = 4.0f * R * (cosTheta - 1.0f);
\n-
412 double creaseWeight = -R * (1.0f + 2.0f * cosTheta);
\n-
413
\n-
414 tan2Mask.VertexWeight(0) = (Weight) (vertexWeight * commonDenom);
\n-
415
\n-
416 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight) (creaseWeight * commonDenom);
\n-
417 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight) (creaseWeight * commonDenom);
\n-
418
\n-
419 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight) (sinTheta * commonDenom);
\n-
420
\n-
421 double sinThetaI = 0.0f;
\n-
422 double sinThetaIplus1 = sinTheta;
\n-
423 for (int i = 1; i < k; ++i) {
\n-
424 sinThetaI = sinThetaIplus1;
\n-
425 sinThetaIplus1 = std::sin((i+1)*theta);
\n-
426
\n-
427 tan2Mask.EdgeWeight(creaseEnds[0] + i) = (Weight) ((4.0f * sinThetaI) * commonDenom);
\n-
428 tan2Mask.FaceWeight(creaseEnds[0] + i) = (Weight) ((sinThetaI + sinThetaIplus1) * commonDenom);
\n-
429 }
\n-
430 } else {
\n-
431 // Special case for a single face -- simple average of boundary edges:
\n-
432
\n-
433 tan2Mask.VertexWeight(0) = -6.0f;
\n-
434
\n-
435 tan2Mask.EdgeWeight(creaseEnds[0]) = 3.0f;
\n-
436 tan2Mask.EdgeWeight(creaseEnds[1]) = 3.0f;
\n-
437
\n-
438 tan2Mask.FaceWeight(creaseEnds[0]) = 0.0f;
\n-
439 }
\n-
440
\n-
441 // Append weights of 0 following the crease:
\n-
442 for (int i = creaseEnds[1]; i < numFaces; ++i) {
\n-
443 tan2Mask.FaceWeight(i) = 0.0f;
\n-
444 }
\n-
445 for (int i = creaseEnds[1] + 1; i < numEdges; ++i) {
\n-
446 tan2Mask.EdgeWeight(i) = 0.0f;
\n-
447 }
\n-
448}
\n-
\n-
449
\n-
450template <>
\n-
451template <typename VERTEX, typename MASK>
\n-
452inline void
\n-
\n-\n-
454 MASK& tan1Mask, MASK& tan2Mask) const {
\n-
455
\n-
456 typedef typename MASK::Weight Weight;
\n-
457
\n-
458 int valence = vertex.GetNumFaces();
\n-
459 if (valence == 2) {
\n-
460 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);
\n-
461 return;
\n-
462 }
\n-
463
\n-
464 // Compute tan1 initially -- tan2 is simply a rotation:
\n-
465 tan1Mask.SetNumVertexWeights(1);
\n-
466 tan1Mask.SetNumEdgeWeights(valence);
\n-
467 tan1Mask.SetNumFaceWeights(valence);
\n-
468 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n-
469
\n-
470 tan1Mask.VertexWeight(0) = 0.0f;
\n-
471
\n-
472 if (valence == 4) {
\n-
473 tan1Mask.EdgeWeight(0) = 4.0f;
\n-
474 tan1Mask.EdgeWeight(1) = 0.0f;
\n-
475 tan1Mask.EdgeWeight(2) = -4.0f;
\n-
476 tan1Mask.EdgeWeight(3) = 0.0f;
\n-
477
\n-
478 tan1Mask.FaceWeight(0) = 1.0f;
\n-
479 tan1Mask.FaceWeight(1) = -1.0f;
\n-
480 tan1Mask.FaceWeight(2) = -1.0f;
\n-
481 tan1Mask.FaceWeight(3) = 1.0f;
\n-
482 } else {
\n-
483 double theta = 2.0f * M_PI / (double)valence;
\n-
484
\n-
485 double cosTheta = std::cos(theta);
\n-
486 double cosHalfTheta = std::cos(theta * 0.5f);
\n-
487
\n-
488 double lambda = (5.0 / 16.0) + (1.0 / 16.0) *
\n-
489 (cosTheta + cosHalfTheta * std::sqrt(2.0f * (9.0f + cosTheta)));
\n-
490
\n-
491 double edgeWeightScale = 4.0f;
\n-
492 double faceWeightScale = 1.0f / (4.0f * lambda - 1.0f);
\n-
493
\n-
494 for (int i = 0; i < valence; ++i) {
\n-
495 double cosThetaI = std::cos( i * theta);
\n-
496 double cosThetaIplus1 = std::cos((i+1)* theta);
\n-
497
\n-
498 tan1Mask.EdgeWeight(i) = (Weight) (edgeWeightScale * cosThetaI);
\n-
499 tan1Mask.FaceWeight(i) = (Weight) (faceWeightScale * (cosThetaI + cosThetaIplus1));
\n-
500 }
\n-
501 }
\n-
502
\n-
503 // Now rotate/copy tan1 weights to tan2:
\n-
504 tan2Mask.SetNumVertexWeights(1);
\n-
505 tan2Mask.SetNumEdgeWeights(valence);
\n-
506 tan2Mask.SetNumFaceWeights(valence);
\n-
507 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n-
508
\n-
509 tan2Mask.VertexWeight(0) = 0.0f;
\n-
510 if (valence == 4) {
\n-
511 tan2Mask.EdgeWeight(0) = 0.0f;
\n-
512 tan2Mask.EdgeWeight(1) = 4.0f;
\n-
513 tan2Mask.EdgeWeight(2) = 0.0f;
\n-
514 tan2Mask.EdgeWeight(3) = -4.0f;
\n-
515
\n-
516 tan2Mask.FaceWeight(0) = 1.0f;
\n-
517 tan2Mask.FaceWeight(1) = 1.0f;
\n-
518 tan2Mask.FaceWeight(2) = -1.0f;
\n-
519 tan2Mask.FaceWeight(3) = -1.0f;
\n-
520 } else {
\n-
521 tan2Mask.EdgeWeight(0) = tan1Mask.EdgeWeight(valence-1);
\n-
522 tan2Mask.FaceWeight(0) = tan1Mask.FaceWeight(valence-1);
\n-
523 for (int i = 1; i < valence; ++i) {
\n-
524 tan2Mask.EdgeWeight(i) = tan1Mask.EdgeWeight(i-1);
\n-
525 tan2Mask.FaceWeight(i) = tan1Mask.FaceWeight(i-1);
\n-
526 }
\n-
527 }
\n-
528}
\n-
\n-
529
\n-
530} // end namespace sdc
\n-
531
\n-
532} // end namespace OPENSUBDIV_VERSION
\n-
533using namespace OPENSUBDIV_VERSION;
\n-
534} // end namespace OpenSubdiv
\n-
535
\n-
536#endif /* OPENSUBDIV3_SDC_CATMARK_SCHEME_H */
\n+
140template <>
\n+
141template <typename VERTEX, typename MASK>
\n+
142inline void
\n+
\n+\n+
144 MASK& tan1Mask, MASK& tan2Mask, int const /* creaseEnds */[2]) const {
\n+
145
\n+
146 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);
\n+
147}
\n+
\n+
148
\n+
149template <>
\n+
150template <typename VERTEX, typename MASK>
\n+
151inline void
\n+
\n+\n+
153 MASK& tan1Mask, MASK& tan2Mask) const {
\n+
154
\n+
155 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);
\n+
156}
\n+
\n+
157
\n+
158} // end namespace sdc
\n+
\n+
159
\n+
160} // end namespace OPENSUBDIV_VERSION
\n+
161using namespace OPENSUBDIV_VERSION;
\n+
162} // end namespace OpenSubdiv
\n+
163
\n+
164#endif /* OPENSUBDIV3_SDC_BILINEAR_SCHEME_H */
\n \n
Split
Enumerated type for all face splitting schemes.
Definition types.h:47
\n
@ SPLIT_TO_QUADS
Used by Catmark and Bilinear.
Definition types.h:48
\n-
@ TRI_SUB_SMOOTH
"smooth triangle" weights (Catmark scheme only)
Definition options.h:74
\n-
void assignSmoothMaskForEdge(EDGE const &edge, MASK &mask) const
\n+\n \n-
void assignCreaseMaskForVertex(VERTEX const &edge, MASK &mask, int const creaseEnds[2]) const
\n+
void ComputeVertexVertexMask(VERTEX const &vertexNeighborhood, MASK &vertexVertexMask, Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule childRule=Crease::RULE_UNKNOWN) const
Vertex-vertex masks If known, a single Rule or pair of Rules can be specified (indicating a crease tr...
Definition scheme.h:512
\n
void assignCreaseLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2, int const creaseEnds[2]) const
\n \n+
void ComputeEdgeVertexMask(EDGE const &edgeNeighborhood, MASK &edgeVertexMask, Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule childRule=Crease::RULE_UNKNOWN) const
Edge-vertex masks If known, the Rule for the edge and/or the derived vertex can be specified to accel...
Definition scheme.h:392
\n
void assignSmoothLimitMask(VERTEX const &vertex, MASK &pos) const
\n \n
void assignCreaseLimitMask(VERTEX const &vertex, MASK &pos, int const creaseEnds[2]) const
\n-
void assignSmoothMaskForVertex(VERTEX const &edge, MASK &mask) const
\n \n
void assignSmoothLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2) const
\n
void assignCornerLimitMask(VERTEX const &vertex, MASK &pos) const
\n
void assignCornerLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2) const
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-catmarkScheme.h\n+bilinearScheme.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2014 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -23,592 +23,211 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_SDC_CATMARK_SCHEME_H\n-25#define OPENSUBDIV3_SDC_CATMARK_SCHEME_H\n+24#ifndef OPENSUBDIV3_SDC_BILINEAR_SCHEME_H\n+25#define OPENSUBDIV3_SDC_BILINEAR_SCHEME_H\n 26\n 27#include \"../version.h\"\n 28\n 29#include \"../sdc/scheme.h\"\n 30\n-31#include \n-32#include \n+31namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+32namespace OPENSUBDIV_VERSION {\n 33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Sdc {\n-38\n-39//\n-40// Specializations for Scheme:\n-41//\n-42\n-43//\n-44// Catmark traits:\n-45//\n-46template <>\n-_\b4_\b7inline _\bS_\bp_\bl_\bi_\bt _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be() { return\n+_\b3_\b4namespace Sdc {\n+35\n+36//\n+37// Specializations for Scheme:\n+38//\n+39\n+40//\n+41// Bilinear traits:\n+42//\n+43template <>\n+_\b4_\b4inline _\bS_\bp_\bl_\bi_\bt _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be() { return\n _\bS_\bP_\bL_\bI_\bT_\b__\bT_\bO_\b__\bQ_\bU_\bA_\bD_\bS; }\n+45\n+46template <>\n+_\b4_\b7inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() { return 4; }\n 48\n 49template <>\n-_\b5_\b0inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() { return 4; }\n+_\b5_\b0inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be() { return 4; }\n 51\n 52template <>\n-_\b5_\b3inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be() { return 4; }\n+_\b5_\b3inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be() { return 0; }\n 54\n-55template <>\n-_\b5_\b6inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be() { return 1; }\n-57\n-58\n-59//\n-60// Masks for edge-vertices: the hard Crease mask does not need to be\n-specialized\n-61// (simply the midpoint), so all that is left is the Smooth case:\n-62//\n-63// The Smooth mask is complicated by the need to support the \"triangle\n-subdivision\"\n-64// option, which applies different weighting in the presence of triangles. It\n-is\n-65// up for debate as to whether this is useful or not -- we may be able to\n-deprecate\n-66// this option.\n-67//\n+55\n+56//\n+57// Refinement masks:\n+58//\n+59template <>\n+60template \n+61void\n+_\b6_\b2_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk(EDGE const& edge, MASK& mask,\n+63 _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be, _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be) const {\n+64 // This should be inline, otherwise trivially replicate it:\n+65 assignCreaseMaskForEdge(edge, mask);\n+66}\n+67\n 68template <>\n-69template \n-70inline void\n-_\b7_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bE_\bd_\bg_\be(EDGE const& edge, MASK& mask)\n-const {\n-72\n-73 typedef typename MASK::Weight Weight;\n-74\n-75 int faceCount = edge.GetNumFaces();\n+69template \n+70void\n+_\b7_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n+mask,\n+72 _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be, _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be) const {\n+73 // This should be inline, otherwise trivially replicate it:\n+74 assignCornerMaskForVertex(vertex, mask);\n+75}\n 76\n-77 mask.SetNumVertexWeights(2);\n-78 mask.SetNumEdgeWeights(0);\n-79 mask.SetNumFaceWeights(faceCount);\n-80 mask.SetFaceWeightsForFaceCenters(true);\n-81\n-82 //\n-83 // Determine if we need to inspect incident faces and apply alternate\n-weighting for\n-84 // triangles -- and if so, determine which of the two are triangles.\n-85 //\n-86 bool face0IsTri = false;\n-87 bool face1IsTri = false;\n-88 bool useTriangleOption = (_options.GetTriangleSubdivision() == _\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bT_\bR_\bI_\b__\bS_\bU_\bB_\b__\bS_\bM_\bO_\bO_\bT_\bH);\n-89 if (useTriangleOption) {\n-90 if (faceCount == 2) {\n-91 //\n-92 // Ideally we want to avoid this inspection when we have already subdivided\n-at\n-93 // least once -- need something in the Edge interface to help avoid this,\n-e.g.\n-94 // an IsRegular() query, the subdivision level...\n-95 //\n-96 int vertsPerFace[2];\n-97 edge.GetNumVerticesPerFace(vertsPerFace);\n-98\n-99 face0IsTri = (vertsPerFace[0] == 3);\n-100 face1IsTri = (vertsPerFace[1] == 3);\n-101 useTriangleOption = face0IsTri || face1IsTri;\n-102 } else {\n-103 useTriangleOption = false;\n-104 }\n-105 }\n-106\n-107 if (! useTriangleOption) {\n-108 mask.VertexWeight(0) = 0.25f;\n-109 mask.VertexWeight(1) = 0.25f;\n+77\n+78//\n+79// Limit masks for position -- the limit position of all vertices is the\n+refined vertex.\n+80//\n+81template <>\n+82template \n+83inline void\n+_\b8_\b4_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& /* vertex */,\n+MASK& posMask) const {\n+85\n+86 posMask.SetNumVertexWeights(1);\n+87 posMask.SetNumEdgeWeights(0);\n+88 posMask.SetNumFaceWeights(0);\n+89 posMask.SetFaceWeightsForFaceCenters(false);\n+90\n+91 posMask.VertexWeight(0) = 1.0f;\n+92}\n+93\n+94template <>\n+95template \n+96inline void\n+_\b9_\b7_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n+posMask,\n+98 int const /* creaseEnds */[2]) const {\n+99\n+100 assignCornerLimitMask(vertex, posMask);\n+101}\n+102\n+103template <>\n+104template \n+105inline void\n+_\b1_\b0_\b6_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n+posMask) const {\n+107\n+108 assignCornerLimitMask(vertex, posMask);\n+109}\n 110\n-111 if (faceCount == 2) {\n-112 mask.FaceWeight(0) = 0.25f;\n-113 mask.FaceWeight(1) = 0.25f;\n-114 } else {\n-115 Weight fWeight = 0.5f / (Weight)faceCount;\n-116 for (int i = 0; i < faceCount; ++i) {\n-117 mask.FaceWeight(i) = fWeight;\n-118 }\n-119 }\n-120 } else {\n-121 //\n-122 // This mimics the implementation in Hbr in terms of order of operations.\n-123 //\n-124 const Weight CATMARK_SMOOTH_TRI_EDGE_WEIGHT = (Weight) 0.470;\n+111//\n+112// Limit masks for tangents -- these are ambiguous around all vertices.\n+Provide\n+113// the tangents based on the incident edges of the first face.\n+114//\n+115template <>\n+116template \n+117inline void\n+_\b1_\b1_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& /\n+* vertex */,\n+119 MASK& tan1Mask, MASK& tan2Mask) const {\n+120\n+121 tan1Mask.SetNumVertexWeights(1);\n+122 tan1Mask.SetNumEdgeWeights(2);\n+123 tan1Mask.SetNumFaceWeights(0);\n+124 tan1Mask.SetFaceWeightsForFaceCenters(false);\n 125\n-126 Weight f0Weight = face0IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;\n-127 Weight f1Weight = face1IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;\n-128\n-129 Weight fWeight = 0.5f * (f0Weight + f1Weight);\n-130 Weight vWeight = 0.5f * (1.0f - 2.0f * fWeight);\n-131\n-132 mask.VertexWeight(0) = vWeight;\n-133 mask.VertexWeight(1) = vWeight;\n+126 tan2Mask.SetNumVertexWeights(1);\n+127 tan2Mask.SetNumEdgeWeights(2);\n+128 tan2Mask.SetNumFaceWeights(0);\n+129 tan2Mask.SetFaceWeightsForFaceCenters(false);\n+130\n+131 tan1Mask.VertexWeight(0) = -1.0f;\n+132 tan1Mask.EdgeWeight(0) = 1.0f;\n+133 tan1Mask.EdgeWeight(1) = 0.0f;\n 134\n-135 mask.FaceWeight(0) = fWeight;\n-136 mask.FaceWeight(1) = fWeight;\n-137 }\n+135 tan2Mask.VertexWeight(0) = -1.0f;\n+136 tan2Mask.EdgeWeight(0) = 0.0f;\n+137 tan2Mask.EdgeWeight(1) = 1.0f;\n 138}\n 139\n-140\n-141//\n-142// Masks for vertex-vertices: the hard Corner mask does not need to be\n-specialized\n-143// (simply the vertex itself), leaving the Crease and Smooth cases (Dart is\n-smooth):\n-144//\n-145template <>\n-146template \n-147inline void\n-_\b1_\b4_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx(VERTEX const& vertex,\n-MASK& mask,\n-149 int const creaseEnds[2]) const {\n-150 typedef typename MASK::Weight Weight;\n-151\n-152 int valence = vertex.GetNumEdges();\n-153\n-154 mask.SetNumVertexWeights(1);\n-155 mask.SetNumEdgeWeights(valence);\n-156 mask.SetNumFaceWeights(0);\n-157 mask.SetFaceWeightsForFaceCenters(false);\n-158\n-159 Weight vWeight = 0.75f;\n-160 Weight eWeight = 0.125f;\n-161\n-162 mask.VertexWeight(0) = vWeight;\n-163 for (int i = 0; i < valence; ++i) {\n-164 mask.EdgeWeight(i) = 0.0f;\n-165 }\n-166 mask.EdgeWeight(creaseEnds[0]) = eWeight;\n-167 mask.EdgeWeight(creaseEnds[1]) = eWeight;\n-168}\n-169\n-170template <>\n-171template \n-172inline void\n-_\b1_\b7_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx(VERTEX const& vertex,\n-MASK& mask) const {\n-174\n-175 typedef typename MASK::Weight Weight;\n-176\n-177 //\n-178 // A Smooth vertex must be manifold and interior -- manifold boundary\n-vertices will be\n-179 // Creases and non-manifold vertices of any kind will be Corners or\n-Creases. If smooth\n-180 // rules for non-manifold vertices are ever defined, this will need\n-adjusting:\n-181 //\n-182 assert(vertex.GetNumFaces() == vertex.GetNumEdges());\n-183\n-184 int valence = vertex.GetNumFaces();\n-185\n-186 mask.SetNumVertexWeights(1);\n-187 mask.SetNumEdgeWeights(valence);\n-188 mask.SetNumFaceWeights(valence);\n-189 mask.SetFaceWeightsForFaceCenters(true);\n-190\n-191 Weight vWeight = (Weight)(valence - 2) / (Weight)valence;\n-192 Weight fWeight = 1.0f / (Weight)(valence * valence);\n-193 Weight eWeight = fWeight;\n-194\n-195 mask.VertexWeight(0) = vWeight;\n-196 for (int i = 0; i < valence; ++i) {\n-197 mask.EdgeWeight(i) = eWeight;\n-198 mask.FaceWeight(i) = fWeight;\n-199 }\n-200}\n-201\n-202//\n-203// Limit masks for position:\n-204//\n-205template <>\n-206template \n-207inline void\n-_\b2_\b0_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& /* vertex */,\n-MASK& posMask) const {\n-209\n-210 posMask.SetNumVertexWeights(1);\n-211 posMask.SetNumEdgeWeights(0);\n-212 posMask.SetNumFaceWeights(0);\n-213 posMask.SetFaceWeightsForFaceCenters(false);\n-214\n-215 posMask.VertexWeight(0) = 1.0f;\n-216}\n-217\n-218template <>\n-219template \n-220inline void\n-_\b2_\b2_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n-posMask,\n-222 int const creaseEnds[2]) const {\n-223\n-224 typedef typename MASK::Weight Weight;\n-225\n-226 int valence = vertex.GetNumEdges();\n-227\n-228 posMask.SetNumVertexWeights(1);\n-229 posMask.SetNumEdgeWeights(valence);\n-230 posMask.SetNumFaceWeights(0);\n-231 posMask.SetFaceWeightsForFaceCenters(false);\n-232\n-233 Weight vWeight = (Weight)(2.0 / 3.0);\n-234 Weight eWeight = (Weight)(1.0 / 6.0);\n-235\n-236 posMask.VertexWeight(0) = vWeight;\n-237 for (int i = 0; i < valence; ++i) {\n-238 posMask.EdgeWeight(i) = 0.0f;\n-239 }\n-240 posMask.EdgeWeight(creaseEnds[0]) = eWeight;\n-241 posMask.EdgeWeight(creaseEnds[1]) = eWeight;\n-242}\n-243\n-244template <>\n-245template \n-246inline void\n-_\b2_\b4_\b7_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n-posMask) const {\n-248\n-249 typedef typename MASK::Weight Weight;\n-250\n-251 int valence = vertex.GetNumFaces();\n-252 if (valence == 2) {\n-253 assignCornerLimitMask(vertex, posMask);\n-254 return;\n-255 }\n-256\n-257 posMask.SetNumVertexWeights(1);\n-258 posMask.SetNumEdgeWeights(valence);\n-259 posMask.SetNumFaceWeights(valence);\n-260 posMask.SetFaceWeightsForFaceCenters(false);\n-261\n-262 // Specialize for the regular case:\n-263 if (valence == 4) {\n-264 Weight fWeight = (Weight)(1.0 / 36.0);\n-265 Weight eWeight = (Weight)(1.0 / 9.0);\n-266 Weight vWeight = (Weight)(4.0 / 9.0);\n-267\n-268 posMask.VertexWeight(0) = vWeight;\n-269\n-270 posMask.EdgeWeight(0) = eWeight;\n-271 posMask.EdgeWeight(1) = eWeight;\n-272 posMask.EdgeWeight(2) = eWeight;\n-273 posMask.EdgeWeight(3) = eWeight;\n-274\n-275 posMask.FaceWeight(0) = fWeight;\n-276 posMask.FaceWeight(1) = fWeight;\n-277 posMask.FaceWeight(2) = fWeight;\n-278 posMask.FaceWeight(3) = fWeight;\n-279 } else {\n-280 Weight Valence = (Weight) valence;\n-281\n-282 Weight fWeight = 1.0f / (Valence * (Valence + 5.0f));\n-283 Weight eWeight = 4.0f * fWeight;\n-284 Weight vWeight = 1.0f - Valence * (eWeight + fWeight);\n-285\n-286 posMask.VertexWeight(0) = vWeight;\n-287 for (int i = 0; i < valence; ++i) {\n-288 posMask.EdgeWeight(i) = eWeight;\n-289 posMask.FaceWeight(i) = fWeight;\n-290 }\n-291 }\n-292}\n-293\n-294//\n-295// Limit masks for tangents -- these are stubs for now, or have a temporary\n-296// implementation\n-297//\n-298template <>\n-299template \n-300inline void\n-_\b3_\b0_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n-302 MASK& tan1Mask, MASK& tan2Mask) const {\n-303\n-304 int valence = vertex.GetNumEdges();\n-305\n-306 tan1Mask.SetNumVertexWeights(1);\n-307 tan1Mask.SetNumEdgeWeights(valence);\n-308 tan1Mask.SetNumFaceWeights(0);\n-309 tan1Mask.SetFaceWeightsForFaceCenters(false);\n-310\n-311 tan2Mask.SetNumVertexWeights(1);\n-312 tan2Mask.SetNumEdgeWeights(valence);\n-313 tan2Mask.SetNumFaceWeights(0);\n-314 tan2Mask.SetFaceWeightsForFaceCenters(false);\n-315\n-316 // Should be at least 2 edges -- be sure to clear weights for any more:\n-317 tan1Mask.VertexWeight(0) = -1.0f;\n-318 tan1Mask.EdgeWeight(0) = 1.0f;\n-319 tan1Mask.EdgeWeight(1) = 0.0f;\n-320\n-321 tan2Mask.VertexWeight(0) = -1.0f;\n-322 tan2Mask.EdgeWeight(0) = 0.0f;\n-323 tan2Mask.EdgeWeight(1) = 1.0f;\n-324\n-325 for (int i = 2; i < valence; ++i) {\n-326 tan1Mask.EdgeWeight(i) = 0.0f;\n-327 tan2Mask.EdgeWeight(i) = 0.0f;\n-328 }\n-329}\n-330\n-331template <>\n-332template \n-333inline void\n-_\b3_\b3_\b4_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n-335 MASK& tan1Mask, MASK& tan2Mask, int const creaseEnds[2]) const {\n-336\n-337 typedef typename MASK::Weight Weight;\n-338\n-339 //\n-340 // First, the tangent along the crease:\n-341 // The first crease edge is considered the \"leading\" edge of the span\n-342 // of surface for which we are evaluating tangents and the second edge the\n-343 // \"trailing edge\". By convention, the tangent along the crease is oriented\n-344 // in the direction of the leading edge.\n-345 //\n-346 int numEdges = vertex.GetNumEdges();\n-347 int numFaces = vertex.GetNumFaces();\n-348\n-349 tan1Mask.SetNumVertexWeights(1);\n-350 tan1Mask.SetNumEdgeWeights(numEdges);\n-351 tan1Mask.SetNumFaceWeights(numFaces);\n-352 tan1Mask.SetFaceWeightsForFaceCenters(false);\n-353\n-354 tan1Mask.VertexWeight(0) = 0.0f;\n-355 for (int i = 0; i < numEdges; ++i) {\n-356 tan1Mask.EdgeWeight(i) = 0.0f;\n-357 }\n-358 for (int i = 0; i < numFaces; ++i) {\n-359 tan1Mask.FaceWeight(i) = 0.0f;\n-360 }\n-361\n-362 tan1Mask.EdgeWeight(creaseEnds[0]) = 0.5f;\n-363 tan1Mask.EdgeWeight(creaseEnds[1]) = -0.5f;\n-364\n-365 //\n-366 // Second, the tangent across the interior faces:\n-367 // Note this is ambiguous for an interior vertex. We currently return\n-368 // the tangent for the surface in the counter-clockwise span between the\n-369 // leading and trailing edges that form the crease. Given the expected\n-370 // computation of a surface normal as Tan1 X Tan2, this tangent should be\n-371 // oriented \"inward\" from the crease/boundary -- across the surface rather\n-372 // than outward and away from it.\n-373 //\n-374 tan2Mask.SetNumVertexWeights(1);\n-375 tan2Mask.SetNumEdgeWeights(numEdges);\n-376 tan2Mask.SetNumFaceWeights(numFaces);\n-377 tan2Mask.SetFaceWeightsForFaceCenters(false);\n-378\n-379 // Prepend weights of 0 preceding the crease:\n-380 for (int i = 0; i < creaseEnds[0]; ++i) {\n-381 tan2Mask.EdgeWeight(i) = 0.0f;\n-382 tan2Mask.FaceWeight(i) = 0.0f;\n-383 }\n-384\n-385 // Assign weights to crease edge and interior points:\n-386 int interiorEdgeCount = creaseEnds[1] - creaseEnds[0] - 1;\n-387 if (interiorEdgeCount == 1) {\n-388 // The regular case -- uniform B-spline cross-tangent:\n-389\n-390 tan2Mask.VertexWeight(0) = (Weight)(-4.0 / 6.0);\n-391\n-392 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight)(-1.0 / 6.0);\n-393 tan2Mask.EdgeWeight(creaseEnds[0] + 1) = (Weight)( 4.0 / 6.0);\n-394 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight)(-1.0 / 6.0);\n-395\n-396 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight)(1.0 / 6.0);\n-397 tan2Mask.FaceWeight(creaseEnds[0] + 1) = (Weight)(1.0 / 6.0);\n-398 } else if (interiorEdgeCount > 1) {\n-399 // The irregular case -- formulae from Biermann et al:\n-400\n-401 double k = (double) (interiorEdgeCount + 1);\n-402 double theta = M_PI / k;\n-403\n-404 double cosTheta = std::cos(theta);\n-405 double sinTheta = std::sin(theta);\n-406\n-407 // Loop/Schaefer use a different divisor here (3*k + cos(theta)):\n-408 double commonDenom = 1.0f / (k * (3.0f + cosTheta));\n-409 double R = (cosTheta + 1.0f) / sinTheta;\n-410\n-411 double vertexWeight = 4.0f * R * (cosTheta - 1.0f);\n-412 double creaseWeight = -R * (1.0f + 2.0f * cosTheta);\n-413\n-414 tan2Mask.VertexWeight(0) = (Weight) (vertexWeight * commonDenom);\n-415\n-416 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight) (creaseWeight * commonDenom);\n-417 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight) (creaseWeight * commonDenom);\n-418\n-419 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight) (sinTheta * commonDenom);\n-420\n-421 double sinThetaI = 0.0f;\n-422 double sinThetaIplus1 = sinTheta;\n-423 for (int i = 1; i < k; ++i) {\n-424 sinThetaI = sinThetaIplus1;\n-425 sinThetaIplus1 = std::sin((i+1)*theta);\n-426\n-427 tan2Mask.EdgeWeight(creaseEnds[0] + i) = (Weight) ((4.0f * sinThetaI) *\n-commonDenom);\n-428 tan2Mask.FaceWeight(creaseEnds[0] + i) = (Weight) ((sinThetaI +\n-sinThetaIplus1) * commonDenom);\n-429 }\n-430 } else {\n-431 // Special case for a single face -- simple average of boundary edges:\n-432\n-433 tan2Mask.VertexWeight(0) = -6.0f;\n-434\n-435 tan2Mask.EdgeWeight(creaseEnds[0]) = 3.0f;\n-436 tan2Mask.EdgeWeight(creaseEnds[1]) = 3.0f;\n-437\n-438 tan2Mask.FaceWeight(creaseEnds[0]) = 0.0f;\n-439 }\n-440\n-441 // Append weights of 0 following the crease:\n-442 for (int i = creaseEnds[1]; i < numFaces; ++i) {\n-443 tan2Mask.FaceWeight(i) = 0.0f;\n-444 }\n-445 for (int i = creaseEnds[1] + 1; i < numEdges; ++i) {\n-446 tan2Mask.EdgeWeight(i) = 0.0f;\n-447 }\n-448}\n-449\n-450template <>\n-451template \n-452inline void\n-_\b4_\b5_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n-454 MASK& tan1Mask, MASK& tan2Mask) const {\n-455\n-456 typedef typename MASK::Weight Weight;\n-457\n-458 int valence = vertex.GetNumFaces();\n-459 if (valence == 2) {\n-460 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);\n-461 return;\n-462 }\n-463\n-464 // Compute tan1 initially -- tan2 is simply a rotation:\n-465 tan1Mask.SetNumVertexWeights(1);\n-466 tan1Mask.SetNumEdgeWeights(valence);\n-467 tan1Mask.SetNumFaceWeights(valence);\n-468 tan1Mask.SetFaceWeightsForFaceCenters(false);\n-469\n-470 tan1Mask.VertexWeight(0) = 0.0f;\n-471\n-472 if (valence == 4) {\n-473 tan1Mask.EdgeWeight(0) = 4.0f;\n-474 tan1Mask.EdgeWeight(1) = 0.0f;\n-475 tan1Mask.EdgeWeight(2) = -4.0f;\n-476 tan1Mask.EdgeWeight(3) = 0.0f;\n-477\n-478 tan1Mask.FaceWeight(0) = 1.0f;\n-479 tan1Mask.FaceWeight(1) = -1.0f;\n-480 tan1Mask.FaceWeight(2) = -1.0f;\n-481 tan1Mask.FaceWeight(3) = 1.0f;\n-482 } else {\n-483 double theta = 2.0f * M_PI / (double)valence;\n-484\n-485 double cosTheta = std::cos(theta);\n-486 double cosHalfTheta = std::cos(theta * 0.5f);\n-487\n-488 double lambda = (5.0 / 16.0) + (1.0 / 16.0) *\n-489 (cosTheta + cosHalfTheta * std::sqrt(2.0f * (9.0f + cosTheta)));\n-490\n-491 double edgeWeightScale = 4.0f;\n-492 double faceWeightScale = 1.0f / (4.0f * lambda - 1.0f);\n-493\n-494 for (int i = 0; i < valence; ++i) {\n-495 double cosThetaI = std::cos( i * theta);\n-496 double cosThetaIplus1 = std::cos((i+1)* theta);\n-497\n-498 tan1Mask.EdgeWeight(i) = (Weight) (edgeWeightScale * cosThetaI);\n-499 tan1Mask.FaceWeight(i) = (Weight) (faceWeightScale * (cosThetaI +\n-cosThetaIplus1));\n-500 }\n-501 }\n-502\n-503 // Now rotate/copy tan1 weights to tan2:\n-504 tan2Mask.SetNumVertexWeights(1);\n-505 tan2Mask.SetNumEdgeWeights(valence);\n-506 tan2Mask.SetNumFaceWeights(valence);\n-507 tan2Mask.SetFaceWeightsForFaceCenters(false);\n-508\n-509 tan2Mask.VertexWeight(0) = 0.0f;\n-510 if (valence == 4) {\n-511 tan2Mask.EdgeWeight(0) = 0.0f;\n-512 tan2Mask.EdgeWeight(1) = 4.0f;\n-513 tan2Mask.EdgeWeight(2) = 0.0f;\n-514 tan2Mask.EdgeWeight(3) = -4.0f;\n-515\n-516 tan2Mask.FaceWeight(0) = 1.0f;\n-517 tan2Mask.FaceWeight(1) = 1.0f;\n-518 tan2Mask.FaceWeight(2) = -1.0f;\n-519 tan2Mask.FaceWeight(3) = -1.0f;\n-520 } else {\n-521 tan2Mask.EdgeWeight(0) = tan1Mask.EdgeWeight(valence-1);\n-522 tan2Mask.FaceWeight(0) = tan1Mask.FaceWeight(valence-1);\n-523 for (int i = 1; i < valence; ++i) {\n-524 tan2Mask.EdgeWeight(i) = tan1Mask.EdgeWeight(i-1);\n-525 tan2Mask.FaceWeight(i) = tan1Mask.FaceWeight(i-1);\n-526 }\n-527 }\n-528}\n-529\n-530} // end namespace sdc\n-531\n-532} // end namespace OPENSUBDIV_VERSION\n-533using namespace OPENSUBDIV_VERSION;\n-534} // end namespace OpenSubdiv\n-535\n-536#endif /* OPENSUBDIV3_SDC_CATMARK_SCHEME_H */\n+140template <>\n+141template \n+142inline void\n+_\b1_\b4_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n+144 MASK& tan1Mask, MASK& tan2Mask, int const /* creaseEnds */[2]) const {\n+145\n+146 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);\n+147}\n+148\n+149template <>\n+150template \n+151inline void\n+_\b1_\b5_\b2_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n+153 MASK& tan1Mask, MASK& tan2Mask) const {\n+154\n+155 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);\n+156}\n+157\n+158} // end namespace sdc\n+159\n+160} // end namespace OPENSUBDIV_VERSION\n+161using namespace OPENSUBDIV_VERSION;\n+162} // end namespace OpenSubdiv\n+163\n+164#endif /* OPENSUBDIV3_SDC_BILINEAR_SCHEME_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bp_\bl_\bi_\bt\n Split\n Enumerated type for all face splitting schemes.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bP_\bL_\bI_\bT_\b__\bT_\bO_\b__\bQ_\bU_\bA_\bD_\bS\n @ SPLIT_TO_QUADS\n Used by Catmark and Bilinear.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bT_\bR_\bI_\b__\bS_\bU_\bB_\b__\bS_\bM_\bO_\bO_\bT_\bH\n-@ TRI_SUB_SMOOTH\n-\"smooth triangle\" weights (Catmark scheme only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bE_\bd_\bg_\be\n-void assignSmoothMaskForEdge(EDGE const &edge, MASK &mask) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n+Rule\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be\n static Split GetTopologicalSplitType()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx\n-void assignCreaseMaskForVertex(VERTEX const &edge, MASK &mask, int const\n-creaseEnds[2]) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk\n+void ComputeVertexVertexMask(VERTEX const &vertexNeighborhood, MASK\n+&vertexVertexMask, Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule\n+childRule=Crease::RULE_UNKNOWN) const\n+Vertex-vertex masks If known, a single Rule or pair of Rules can be specified\n+(indicating a crease tr...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bc_\bh_\be_\bm_\be_\b._\bh_\b:_\b5_\b1_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n void assignCreaseLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n &tan2, int const creaseEnds[2]) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n static int GetRegularFaceSize()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk\n+void ComputeEdgeVertexMask(EDGE const &edgeNeighborhood, MASK &edgeVertexMask,\n+Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule childRule=Crease::\n+RULE_UNKNOWN) const\n+Edge-vertex masks If known, the Rule for the edge and/or the derived vertex can\n+be specified to accel...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bc_\bh_\be_\bm_\be_\b._\bh_\b:_\b3_\b9_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n void assignSmoothLimitMask(VERTEX const &vertex, MASK &pos) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be\n static int GetLocalNeighborhoodSize()\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n void assignCreaseLimitMask(VERTEX const &vertex, MASK &pos, int const\n creaseEnds[2]) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx\n-void assignSmoothMaskForVertex(VERTEX const &edge, MASK &mask) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be\n static int GetRegularVertexValence()\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n void assignSmoothLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n &tan2) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n void assignCornerLimitMask(VERTEX const &vertex, MASK &pos) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n void assignCornerLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n &tan2) const\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bs_\bd_\bc\n- * _\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n+ * _\bb_\bi_\bl_\bi_\bn_\be_\ba_\br_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00785.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00785.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/sdc/bilinearScheme.h File Reference\n+OpenSubdiv: opensubdiv/sdc/catmarkScheme.h File Reference\n \n \n \n \n \n \n \n@@ -89,19 +89,21 @@\n \n \n \n \n
\n \n-
bilinearScheme.h File Reference
\n+
catmarkScheme.h File Reference
\n
\n
\n
#include "../version.h"
\n #include "../sdc/scheme.h"
\n+#include <cassert>
\n+#include <cmath>
\n
\n

Go to the source code of this file.

\n \n \n \n \n@@ -111,13 +113,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,20 +1,22 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-bilinearScheme.h File Reference\n+catmarkScheme.h File Reference\n #include \"../version.h\"\n #include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bs_\bc_\bh_\be_\bm_\be_\b._\bh\"\n+#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bs_\bd_\bc\n- * _\bb_\bi_\bl_\bi_\bn_\be_\ba_\br_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n+ * _\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00785_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00785_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/sdc/bilinearScheme.h Source File\n+OpenSubdiv: opensubdiv/sdc/catmarkScheme.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
bilinearScheme.h
\n+
catmarkScheme.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2014 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -118,193 +118,566 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_SDC_BILINEAR_SCHEME_H
\n-
25#define OPENSUBDIV3_SDC_BILINEAR_SCHEME_H
\n+
24#ifndef OPENSUBDIV3_SDC_CATMARK_SCHEME_H
\n+
25#define OPENSUBDIV3_SDC_CATMARK_SCHEME_H
\n
26
\n
27#include "../version.h"
\n
28
\n
29#include "../sdc/scheme.h"
\n
30
\n-
31namespace OpenSubdiv {
\n-
32namespace OPENSUBDIV_VERSION {
\n+
31#include <cassert>
\n+
32#include <cmath>
\n
33
\n-
\n-
34namespace Sdc {
\n-
35
\n-
36//
\n-
37// Specializations for Scheme<SCHEME_BILINEAR>:
\n-
38//
\n-
39
\n-
40//
\n-
41// Bilinear traits:
\n-
42//
\n-
43template <>
\n-\n-
45
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Sdc {
\n+
38
\n+
39//
\n+
40// Specializations for Scheme<SCHEME_CATMARK>:
\n+
41//
\n+
42
\n+
43//
\n+
44// Catmark traits:
\n+
45//
\n
46template <>
\n-\n+\n
48
\n
49template <>
\n-\n+\n
51
\n
52template <>
\n-\n+\n
54
\n-
55
\n-
56//
\n-
57// Refinement masks:
\n-
58//
\n-
59template <>
\n-
60template <typename EDGE, typename MASK>
\n-
61void
\n-
\n-\n-\n-
64 // This should be inline, otherwise trivially replicate it:
\n-
65 assignCreaseMaskForEdge(edge, mask);
\n-
66}
\n-
\n-
67
\n+
55template <>
\n+\n+
57
\n+
58
\n+
59//
\n+
60// Masks for edge-vertices: the hard Crease mask does not need to be specialized
\n+
61// (simply the midpoint), so all that is left is the Smooth case:
\n+
62//
\n+
63// The Smooth mask is complicated by the need to support the "triangle subdivision"
\n+
64// option, which applies different weighting in the presence of triangles. It is
\n+
65// up for debate as to whether this is useful or not -- we may be able to deprecate
\n+
66// this option.
\n+
67//
\n
68template <>
\n-
69template <typename VERTEX, typename MASK>
\n-
70void
\n+
69template <typename EDGE, typename MASK>
\n+
70inline void
\n
\n-
71Scheme<SCHEME_BILINEAR>::ComputeVertexVertexMask(VERTEX const& vertex, MASK& mask,
\n-\n-
73 // This should be inline, otherwise trivially replicate it:
\n-
74 assignCornerMaskForVertex(vertex, mask);
\n-
75}
\n-
\n+
71Scheme<SCHEME_CATMARK>::assignSmoothMaskForEdge(EDGE const& edge, MASK& mask) const {
\n+
72
\n+
73 typedef typename MASK::Weight Weight;
\n+
74
\n+
75 int faceCount = edge.GetNumFaces();
\n
76
\n-
77
\n-
78//
\n-
79// Limit masks for position -- the limit position of all vertices is the refined vertex.
\n-
80//
\n-
81template <>
\n-
82template <typename VERTEX, typename MASK>
\n-
83inline void
\n-
\n-
84Scheme<SCHEME_BILINEAR>::assignCornerLimitMask(VERTEX const& /* vertex */, MASK& posMask) const {
\n-
85
\n-
86 posMask.SetNumVertexWeights(1);
\n-
87 posMask.SetNumEdgeWeights(0);
\n-
88 posMask.SetNumFaceWeights(0);
\n-
89 posMask.SetFaceWeightsForFaceCenters(false);
\n-
90
\n-
91 posMask.VertexWeight(0) = 1.0f;
\n-
92}
\n-
\n-
93
\n-
94template <>
\n-
95template <typename VERTEX, typename MASK>
\n-
96inline void
\n-
\n-
97Scheme<SCHEME_BILINEAR>::assignCreaseLimitMask(VERTEX const& vertex, MASK& posMask,
\n-
98 int const /* creaseEnds */[2]) const {
\n-
99
\n-
100 assignCornerLimitMask(vertex, posMask);
\n-
101}
\n-
\n-
102
\n-
103template <>
\n-
104template <typename VERTEX, typename MASK>
\n-
105inline void
\n-
\n-
106Scheme<SCHEME_BILINEAR>::assignSmoothLimitMask(VERTEX const& vertex, MASK& posMask) const {
\n-
107
\n-
108 assignCornerLimitMask(vertex, posMask);
\n-
109}
\n-
\n+
77 mask.SetNumVertexWeights(2);
\n+
78 mask.SetNumEdgeWeights(0);
\n+
79 mask.SetNumFaceWeights(faceCount);
\n+
80 mask.SetFaceWeightsForFaceCenters(true);
\n+
81
\n+
82 //
\n+
83 // Determine if we need to inspect incident faces and apply alternate weighting for
\n+
84 // triangles -- and if so, determine which of the two are triangles.
\n+
85 //
\n+
86 bool face0IsTri = false;
\n+
87 bool face1IsTri = false;
\n+
88 bool useTriangleOption = (_options.GetTriangleSubdivision() == Options::TRI_SUB_SMOOTH);
\n+
89 if (useTriangleOption) {
\n+
90 if (faceCount == 2) {
\n+
91 //
\n+
92 // Ideally we want to avoid this inspection when we have already subdivided at
\n+
93 // least once -- need something in the Edge interface to help avoid this, e.g.
\n+
94 // an IsRegular() query, the subdivision level...
\n+
95 //
\n+
96 int vertsPerFace[2];
\n+
97 edge.GetNumVerticesPerFace(vertsPerFace);
\n+
98
\n+
99 face0IsTri = (vertsPerFace[0] == 3);
\n+
100 face1IsTri = (vertsPerFace[1] == 3);
\n+
101 useTriangleOption = face0IsTri || face1IsTri;
\n+
102 } else {
\n+
103 useTriangleOption = false;
\n+
104 }
\n+
105 }
\n+
106
\n+
107 if (! useTriangleOption) {
\n+
108 mask.VertexWeight(0) = 0.25f;
\n+
109 mask.VertexWeight(1) = 0.25f;
\n
110
\n-
111//
\n-
112// Limit masks for tangents -- these are ambiguous around all vertices. Provide
\n-
113// the tangents based on the incident edges of the first face.
\n-
114//
\n-
115template <>
\n-
116template <typename VERTEX, typename MASK>
\n-
117inline void
\n-
\n-\n-
119 MASK& tan1Mask, MASK& tan2Mask) const {
\n-
120
\n-
121 tan1Mask.SetNumVertexWeights(1);
\n-
122 tan1Mask.SetNumEdgeWeights(2);
\n-
123 tan1Mask.SetNumFaceWeights(0);
\n-
124 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n+
111 if (faceCount == 2) {
\n+
112 mask.FaceWeight(0) = 0.25f;
\n+
113 mask.FaceWeight(1) = 0.25f;
\n+
114 } else {
\n+
115 Weight fWeight = 0.5f / (Weight)faceCount;
\n+
116 for (int i = 0; i < faceCount; ++i) {
\n+
117 mask.FaceWeight(i) = fWeight;
\n+
118 }
\n+
119 }
\n+
120 } else {
\n+
121 //
\n+
122 // This mimics the implementation in Hbr in terms of order of operations.
\n+
123 //
\n+
124 const Weight CATMARK_SMOOTH_TRI_EDGE_WEIGHT = (Weight) 0.470;
\n
125
\n-
126 tan2Mask.SetNumVertexWeights(1);
\n-
127 tan2Mask.SetNumEdgeWeights(2);
\n-
128 tan2Mask.SetNumFaceWeights(0);
\n-
129 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n-
130
\n-
131 tan1Mask.VertexWeight(0) = -1.0f;
\n-
132 tan1Mask.EdgeWeight(0) = 1.0f;
\n-
133 tan1Mask.EdgeWeight(1) = 0.0f;
\n+
126 Weight f0Weight = face0IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;
\n+
127 Weight f1Weight = face1IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;
\n+
128
\n+
129 Weight fWeight = 0.5f * (f0Weight + f1Weight);
\n+
130 Weight vWeight = 0.5f * (1.0f - 2.0f * fWeight);
\n+
131
\n+
132 mask.VertexWeight(0) = vWeight;
\n+
133 mask.VertexWeight(1) = vWeight;
\n
134
\n-
135 tan2Mask.VertexWeight(0) = -1.0f;
\n-
136 tan2Mask.EdgeWeight(0) = 0.0f;
\n-
137 tan2Mask.EdgeWeight(1) = 1.0f;
\n+
135 mask.FaceWeight(0) = fWeight;
\n+
136 mask.FaceWeight(1) = fWeight;
\n+
137 }
\n
138}
\n
\n
139
\n-
140template <>
\n-
141template <typename VERTEX, typename MASK>
\n-
142inline void
\n-
\n-\n-
144 MASK& tan1Mask, MASK& tan2Mask, int const /* creaseEnds */[2]) const {
\n-
145
\n-
146 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);
\n-
147}
\n-
\n-
148
\n-
149template <>
\n-
150template <typename VERTEX, typename MASK>
\n-
151inline void
\n-
\n-\n-
153 MASK& tan1Mask, MASK& tan2Mask) const {
\n-
154
\n-
155 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);
\n-
156}
\n-
\n-
157
\n-
158} // end namespace sdc
\n-
\n-
159
\n-
160} // end namespace OPENSUBDIV_VERSION
\n-
161using namespace OPENSUBDIV_VERSION;
\n-
162} // end namespace OpenSubdiv
\n-
163
\n-
164#endif /* OPENSUBDIV3_SDC_BILINEAR_SCHEME_H */
\n+
140
\n+
141//
\n+
142// Masks for vertex-vertices: the hard Corner mask does not need to be specialized
\n+
143// (simply the vertex itself), leaving the Crease and Smooth cases (Dart is smooth):
\n+
144//
\n+
145template <>
\n+
146template <typename VERTEX, typename MASK>
\n+
147inline void
\n+
\n+\n+
149 int const creaseEnds[2]) const {
\n+
150 typedef typename MASK::Weight Weight;
\n+
151
\n+
152 int valence = vertex.GetNumEdges();
\n+
153
\n+
154 mask.SetNumVertexWeights(1);
\n+
155 mask.SetNumEdgeWeights(valence);
\n+
156 mask.SetNumFaceWeights(0);
\n+
157 mask.SetFaceWeightsForFaceCenters(false);
\n+
158
\n+
159 Weight vWeight = 0.75f;
\n+
160 Weight eWeight = 0.125f;
\n+
161
\n+
162 mask.VertexWeight(0) = vWeight;
\n+
163 for (int i = 0; i < valence; ++i) {
\n+
164 mask.EdgeWeight(i) = 0.0f;
\n+
165 }
\n+
166 mask.EdgeWeight(creaseEnds[0]) = eWeight;
\n+
167 mask.EdgeWeight(creaseEnds[1]) = eWeight;
\n+
168}
\n+
\n+
169
\n+
170template <>
\n+
171template <typename VERTEX, typename MASK>
\n+
172inline void
\n+
\n+
173Scheme<SCHEME_CATMARK>::assignSmoothMaskForVertex(VERTEX const& vertex, MASK& mask) const {
\n+
174
\n+
175 typedef typename MASK::Weight Weight;
\n+
176
\n+
177 //
\n+
178 // A Smooth vertex must be manifold and interior -- manifold boundary vertices will be
\n+
179 // Creases and non-manifold vertices of any kind will be Corners or Creases. If smooth
\n+
180 // rules for non-manifold vertices are ever defined, this will need adjusting:
\n+
181 //
\n+
182 assert(vertex.GetNumFaces() == vertex.GetNumEdges());
\n+
183
\n+
184 int valence = vertex.GetNumFaces();
\n+
185
\n+
186 mask.SetNumVertexWeights(1);
\n+
187 mask.SetNumEdgeWeights(valence);
\n+
188 mask.SetNumFaceWeights(valence);
\n+
189 mask.SetFaceWeightsForFaceCenters(true);
\n+
190
\n+
191 Weight vWeight = (Weight)(valence - 2) / (Weight)valence;
\n+
192 Weight fWeight = 1.0f / (Weight)(valence * valence);
\n+
193 Weight eWeight = fWeight;
\n+
194
\n+
195 mask.VertexWeight(0) = vWeight;
\n+
196 for (int i = 0; i < valence; ++i) {
\n+
197 mask.EdgeWeight(i) = eWeight;
\n+
198 mask.FaceWeight(i) = fWeight;
\n+
199 }
\n+
200}
\n+
\n+
201
\n+
202//
\n+
203// Limit masks for position:
\n+
204//
\n+
205template <>
\n+
206template <typename VERTEX, typename MASK>
\n+
207inline void
\n+
\n+
208Scheme<SCHEME_CATMARK>::assignCornerLimitMask(VERTEX const& /* vertex */, MASK& posMask) const {
\n+
209
\n+
210 posMask.SetNumVertexWeights(1);
\n+
211 posMask.SetNumEdgeWeights(0);
\n+
212 posMask.SetNumFaceWeights(0);
\n+
213 posMask.SetFaceWeightsForFaceCenters(false);
\n+
214
\n+
215 posMask.VertexWeight(0) = 1.0f;
\n+
216}
\n+
\n+
217
\n+
218template <>
\n+
219template <typename VERTEX, typename MASK>
\n+
220inline void
\n+
\n+
221Scheme<SCHEME_CATMARK>::assignCreaseLimitMask(VERTEX const& vertex, MASK& posMask,
\n+
222 int const creaseEnds[2]) const {
\n+
223
\n+
224 typedef typename MASK::Weight Weight;
\n+
225
\n+
226 int valence = vertex.GetNumEdges();
\n+
227
\n+
228 posMask.SetNumVertexWeights(1);
\n+
229 posMask.SetNumEdgeWeights(valence);
\n+
230 posMask.SetNumFaceWeights(0);
\n+
231 posMask.SetFaceWeightsForFaceCenters(false);
\n+
232
\n+
233 Weight vWeight = (Weight)(2.0 / 3.0);
\n+
234 Weight eWeight = (Weight)(1.0 / 6.0);
\n+
235
\n+
236 posMask.VertexWeight(0) = vWeight;
\n+
237 for (int i = 0; i < valence; ++i) {
\n+
238 posMask.EdgeWeight(i) = 0.0f;
\n+
239 }
\n+
240 posMask.EdgeWeight(creaseEnds[0]) = eWeight;
\n+
241 posMask.EdgeWeight(creaseEnds[1]) = eWeight;
\n+
242}
\n+
\n+
243
\n+
244template <>
\n+
245template <typename VERTEX, typename MASK>
\n+
246inline void
\n+
\n+
247Scheme<SCHEME_CATMARK>::assignSmoothLimitMask(VERTEX const& vertex, MASK& posMask) const {
\n+
248
\n+
249 typedef typename MASK::Weight Weight;
\n+
250
\n+
251 int valence = vertex.GetNumFaces();
\n+
252 if (valence == 2) {
\n+
253 assignCornerLimitMask(vertex, posMask);
\n+
254 return;
\n+
255 }
\n+
256
\n+
257 posMask.SetNumVertexWeights(1);
\n+
258 posMask.SetNumEdgeWeights(valence);
\n+
259 posMask.SetNumFaceWeights(valence);
\n+
260 posMask.SetFaceWeightsForFaceCenters(false);
\n+
261
\n+
262 // Specialize for the regular case:
\n+
263 if (valence == 4) {
\n+
264 Weight fWeight = (Weight)(1.0 / 36.0);
\n+
265 Weight eWeight = (Weight)(1.0 / 9.0);
\n+
266 Weight vWeight = (Weight)(4.0 / 9.0);
\n+
267
\n+
268 posMask.VertexWeight(0) = vWeight;
\n+
269
\n+
270 posMask.EdgeWeight(0) = eWeight;
\n+
271 posMask.EdgeWeight(1) = eWeight;
\n+
272 posMask.EdgeWeight(2) = eWeight;
\n+
273 posMask.EdgeWeight(3) = eWeight;
\n+
274
\n+
275 posMask.FaceWeight(0) = fWeight;
\n+
276 posMask.FaceWeight(1) = fWeight;
\n+
277 posMask.FaceWeight(2) = fWeight;
\n+
278 posMask.FaceWeight(3) = fWeight;
\n+
279 } else {
\n+
280 Weight Valence = (Weight) valence;
\n+
281
\n+
282 Weight fWeight = 1.0f / (Valence * (Valence + 5.0f));
\n+
283 Weight eWeight = 4.0f * fWeight;
\n+
284 Weight vWeight = 1.0f - Valence * (eWeight + fWeight);
\n+
285
\n+
286 posMask.VertexWeight(0) = vWeight;
\n+
287 for (int i = 0; i < valence; ++i) {
\n+
288 posMask.EdgeWeight(i) = eWeight;
\n+
289 posMask.FaceWeight(i) = fWeight;
\n+
290 }
\n+
291 }
\n+
292}
\n+
\n+
293
\n+
294//
\n+
295// Limit masks for tangents -- these are stubs for now, or have a temporary
\n+
296// implementation
\n+
297//
\n+
298template <>
\n+
299template <typename VERTEX, typename MASK>
\n+
300inline void
\n+
\n+\n+
302 MASK& tan1Mask, MASK& tan2Mask) const {
\n+
303
\n+
304 int valence = vertex.GetNumEdges();
\n+
305
\n+
306 tan1Mask.SetNumVertexWeights(1);
\n+
307 tan1Mask.SetNumEdgeWeights(valence);
\n+
308 tan1Mask.SetNumFaceWeights(0);
\n+
309 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n+
310
\n+
311 tan2Mask.SetNumVertexWeights(1);
\n+
312 tan2Mask.SetNumEdgeWeights(valence);
\n+
313 tan2Mask.SetNumFaceWeights(0);
\n+
314 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n+
315
\n+
316 // Should be at least 2 edges -- be sure to clear weights for any more:
\n+
317 tan1Mask.VertexWeight(0) = -1.0f;
\n+
318 tan1Mask.EdgeWeight(0) = 1.0f;
\n+
319 tan1Mask.EdgeWeight(1) = 0.0f;
\n+
320
\n+
321 tan2Mask.VertexWeight(0) = -1.0f;
\n+
322 tan2Mask.EdgeWeight(0) = 0.0f;
\n+
323 tan2Mask.EdgeWeight(1) = 1.0f;
\n+
324
\n+
325 for (int i = 2; i < valence; ++i) {
\n+
326 tan1Mask.EdgeWeight(i) = 0.0f;
\n+
327 tan2Mask.EdgeWeight(i) = 0.0f;
\n+
328 }
\n+
329}
\n+
\n+
330
\n+
331template <>
\n+
332template <typename VERTEX, typename MASK>
\n+
333inline void
\n+
\n+\n+
335 MASK& tan1Mask, MASK& tan2Mask, int const creaseEnds[2]) const {
\n+
336
\n+
337 typedef typename MASK::Weight Weight;
\n+
338
\n+
339 //
\n+
340 // First, the tangent along the crease:
\n+
341 // The first crease edge is considered the "leading" edge of the span
\n+
342 // of surface for which we are evaluating tangents and the second edge the
\n+
343 // "trailing edge". By convention, the tangent along the crease is oriented
\n+
344 // in the direction of the leading edge.
\n+
345 //
\n+
346 int numEdges = vertex.GetNumEdges();
\n+
347 int numFaces = vertex.GetNumFaces();
\n+
348
\n+
349 tan1Mask.SetNumVertexWeights(1);
\n+
350 tan1Mask.SetNumEdgeWeights(numEdges);
\n+
351 tan1Mask.SetNumFaceWeights(numFaces);
\n+
352 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n+
353
\n+
354 tan1Mask.VertexWeight(0) = 0.0f;
\n+
355 for (int i = 0; i < numEdges; ++i) {
\n+
356 tan1Mask.EdgeWeight(i) = 0.0f;
\n+
357 }
\n+
358 for (int i = 0; i < numFaces; ++i) {
\n+
359 tan1Mask.FaceWeight(i) = 0.0f;
\n+
360 }
\n+
361
\n+
362 tan1Mask.EdgeWeight(creaseEnds[0]) = 0.5f;
\n+
363 tan1Mask.EdgeWeight(creaseEnds[1]) = -0.5f;
\n+
364
\n+
365 //
\n+
366 // Second, the tangent across the interior faces:
\n+
367 // Note this is ambiguous for an interior vertex. We currently return
\n+
368 // the tangent for the surface in the counter-clockwise span between the
\n+
369 // leading and trailing edges that form the crease. Given the expected
\n+
370 // computation of a surface normal as Tan1 X Tan2, this tangent should be
\n+
371 // oriented "inward" from the crease/boundary -- across the surface rather
\n+
372 // than outward and away from it.
\n+
373 //
\n+
374 tan2Mask.SetNumVertexWeights(1);
\n+
375 tan2Mask.SetNumEdgeWeights(numEdges);
\n+
376 tan2Mask.SetNumFaceWeights(numFaces);
\n+
377 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n+
378
\n+
379 // Prepend weights of 0 preceding the crease:
\n+
380 for (int i = 0; i < creaseEnds[0]; ++i) {
\n+
381 tan2Mask.EdgeWeight(i) = 0.0f;
\n+
382 tan2Mask.FaceWeight(i) = 0.0f;
\n+
383 }
\n+
384
\n+
385 // Assign weights to crease edge and interior points:
\n+
386 int interiorEdgeCount = creaseEnds[1] - creaseEnds[0] - 1;
\n+
387 if (interiorEdgeCount == 1) {
\n+
388 // The regular case -- uniform B-spline cross-tangent:
\n+
389
\n+
390 tan2Mask.VertexWeight(0) = (Weight)(-4.0 / 6.0);
\n+
391
\n+
392 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight)(-1.0 / 6.0);
\n+
393 tan2Mask.EdgeWeight(creaseEnds[0] + 1) = (Weight)( 4.0 / 6.0);
\n+
394 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight)(-1.0 / 6.0);
\n+
395
\n+
396 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight)(1.0 / 6.0);
\n+
397 tan2Mask.FaceWeight(creaseEnds[0] + 1) = (Weight)(1.0 / 6.0);
\n+
398 } else if (interiorEdgeCount > 1) {
\n+
399 // The irregular case -- formulae from Biermann et al:
\n+
400
\n+
401 double k = (double) (interiorEdgeCount + 1);
\n+
402 double theta = M_PI / k;
\n+
403
\n+
404 double cosTheta = std::cos(theta);
\n+
405 double sinTheta = std::sin(theta);
\n+
406
\n+
407 // Loop/Schaefer use a different divisor here (3*k + cos(theta)):
\n+
408 double commonDenom = 1.0f / (k * (3.0f + cosTheta));
\n+
409 double R = (cosTheta + 1.0f) / sinTheta;
\n+
410
\n+
411 double vertexWeight = 4.0f * R * (cosTheta - 1.0f);
\n+
412 double creaseWeight = -R * (1.0f + 2.0f * cosTheta);
\n+
413
\n+
414 tan2Mask.VertexWeight(0) = (Weight) (vertexWeight * commonDenom);
\n+
415
\n+
416 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight) (creaseWeight * commonDenom);
\n+
417 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight) (creaseWeight * commonDenom);
\n+
418
\n+
419 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight) (sinTheta * commonDenom);
\n+
420
\n+
421 double sinThetaI = 0.0f;
\n+
422 double sinThetaIplus1 = sinTheta;
\n+
423 for (int i = 1; i < k; ++i) {
\n+
424 sinThetaI = sinThetaIplus1;
\n+
425 sinThetaIplus1 = std::sin((i+1)*theta);
\n+
426
\n+
427 tan2Mask.EdgeWeight(creaseEnds[0] + i) = (Weight) ((4.0f * sinThetaI) * commonDenom);
\n+
428 tan2Mask.FaceWeight(creaseEnds[0] + i) = (Weight) ((sinThetaI + sinThetaIplus1) * commonDenom);
\n+
429 }
\n+
430 } else {
\n+
431 // Special case for a single face -- simple average of boundary edges:
\n+
432
\n+
433 tan2Mask.VertexWeight(0) = -6.0f;
\n+
434
\n+
435 tan2Mask.EdgeWeight(creaseEnds[0]) = 3.0f;
\n+
436 tan2Mask.EdgeWeight(creaseEnds[1]) = 3.0f;
\n+
437
\n+
438 tan2Mask.FaceWeight(creaseEnds[0]) = 0.0f;
\n+
439 }
\n+
440
\n+
441 // Append weights of 0 following the crease:
\n+
442 for (int i = creaseEnds[1]; i < numFaces; ++i) {
\n+
443 tan2Mask.FaceWeight(i) = 0.0f;
\n+
444 }
\n+
445 for (int i = creaseEnds[1] + 1; i < numEdges; ++i) {
\n+
446 tan2Mask.EdgeWeight(i) = 0.0f;
\n+
447 }
\n+
448}
\n+
\n+
449
\n+
450template <>
\n+
451template <typename VERTEX, typename MASK>
\n+
452inline void
\n+
\n+\n+
454 MASK& tan1Mask, MASK& tan2Mask) const {
\n+
455
\n+
456 typedef typename MASK::Weight Weight;
\n+
457
\n+
458 int valence = vertex.GetNumFaces();
\n+
459 if (valence == 2) {
\n+
460 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);
\n+
461 return;
\n+
462 }
\n+
463
\n+
464 // Compute tan1 initially -- tan2 is simply a rotation:
\n+
465 tan1Mask.SetNumVertexWeights(1);
\n+
466 tan1Mask.SetNumEdgeWeights(valence);
\n+
467 tan1Mask.SetNumFaceWeights(valence);
\n+
468 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n+
469
\n+
470 tan1Mask.VertexWeight(0) = 0.0f;
\n+
471
\n+
472 if (valence == 4) {
\n+
473 tan1Mask.EdgeWeight(0) = 4.0f;
\n+
474 tan1Mask.EdgeWeight(1) = 0.0f;
\n+
475 tan1Mask.EdgeWeight(2) = -4.0f;
\n+
476 tan1Mask.EdgeWeight(3) = 0.0f;
\n+
477
\n+
478 tan1Mask.FaceWeight(0) = 1.0f;
\n+
479 tan1Mask.FaceWeight(1) = -1.0f;
\n+
480 tan1Mask.FaceWeight(2) = -1.0f;
\n+
481 tan1Mask.FaceWeight(3) = 1.0f;
\n+
482 } else {
\n+
483 double theta = 2.0f * M_PI / (double)valence;
\n+
484
\n+
485 double cosTheta = std::cos(theta);
\n+
486 double cosHalfTheta = std::cos(theta * 0.5f);
\n+
487
\n+
488 double lambda = (5.0 / 16.0) + (1.0 / 16.0) *
\n+
489 (cosTheta + cosHalfTheta * std::sqrt(2.0f * (9.0f + cosTheta)));
\n+
490
\n+
491 double edgeWeightScale = 4.0f;
\n+
492 double faceWeightScale = 1.0f / (4.0f * lambda - 1.0f);
\n+
493
\n+
494 for (int i = 0; i < valence; ++i) {
\n+
495 double cosThetaI = std::cos( i * theta);
\n+
496 double cosThetaIplus1 = std::cos((i+1)* theta);
\n+
497
\n+
498 tan1Mask.EdgeWeight(i) = (Weight) (edgeWeightScale * cosThetaI);
\n+
499 tan1Mask.FaceWeight(i) = (Weight) (faceWeightScale * (cosThetaI + cosThetaIplus1));
\n+
500 }
\n+
501 }
\n+
502
\n+
503 // Now rotate/copy tan1 weights to tan2:
\n+
504 tan2Mask.SetNumVertexWeights(1);
\n+
505 tan2Mask.SetNumEdgeWeights(valence);
\n+
506 tan2Mask.SetNumFaceWeights(valence);
\n+
507 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n+
508
\n+
509 tan2Mask.VertexWeight(0) = 0.0f;
\n+
510 if (valence == 4) {
\n+
511 tan2Mask.EdgeWeight(0) = 0.0f;
\n+
512 tan2Mask.EdgeWeight(1) = 4.0f;
\n+
513 tan2Mask.EdgeWeight(2) = 0.0f;
\n+
514 tan2Mask.EdgeWeight(3) = -4.0f;
\n+
515
\n+
516 tan2Mask.FaceWeight(0) = 1.0f;
\n+
517 tan2Mask.FaceWeight(1) = 1.0f;
\n+
518 tan2Mask.FaceWeight(2) = -1.0f;
\n+
519 tan2Mask.FaceWeight(3) = -1.0f;
\n+
520 } else {
\n+
521 tan2Mask.EdgeWeight(0) = tan1Mask.EdgeWeight(valence-1);
\n+
522 tan2Mask.FaceWeight(0) = tan1Mask.FaceWeight(valence-1);
\n+
523 for (int i = 1; i < valence; ++i) {
\n+
524 tan2Mask.EdgeWeight(i) = tan1Mask.EdgeWeight(i-1);
\n+
525 tan2Mask.FaceWeight(i) = tan1Mask.FaceWeight(i-1);
\n+
526 }
\n+
527 }
\n+
528}
\n+
\n+
529
\n+
530} // end namespace sdc
\n+
531
\n+
532} // end namespace OPENSUBDIV_VERSION
\n+
533using namespace OPENSUBDIV_VERSION;
\n+
534} // end namespace OpenSubdiv
\n+
535
\n+
536#endif /* OPENSUBDIV3_SDC_CATMARK_SCHEME_H */
\n \n
Split
Enumerated type for all face splitting schemes.
Definition types.h:47
\n
@ SPLIT_TO_QUADS
Used by Catmark and Bilinear.
Definition types.h:48
\n-\n+
@ TRI_SUB_SMOOTH
"smooth triangle" weights (Catmark scheme only)
Definition options.h:74
\n+
void assignSmoothMaskForEdge(EDGE const &edge, MASK &mask) const
\n \n-
void ComputeVertexVertexMask(VERTEX const &vertexNeighborhood, MASK &vertexVertexMask, Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule childRule=Crease::RULE_UNKNOWN) const
Vertex-vertex masks If known, a single Rule or pair of Rules can be specified (indicating a crease tr...
Definition scheme.h:512
\n+
void assignCreaseMaskForVertex(VERTEX const &edge, MASK &mask, int const creaseEnds[2]) const
\n
void assignCreaseLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2, int const creaseEnds[2]) const
\n \n-
void ComputeEdgeVertexMask(EDGE const &edgeNeighborhood, MASK &edgeVertexMask, Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule childRule=Crease::RULE_UNKNOWN) const
Edge-vertex masks If known, the Rule for the edge and/or the derived vertex can be specified to accel...
Definition scheme.h:392
\n
void assignSmoothLimitMask(VERTEX const &vertex, MASK &pos) const
\n \n
void assignCreaseLimitMask(VERTEX const &vertex, MASK &pos, int const creaseEnds[2]) const
\n+
void assignSmoothMaskForVertex(VERTEX const &edge, MASK &mask) const
\n \n
void assignSmoothLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2) const
\n
void assignCornerLimitMask(VERTEX const &vertex, MASK &pos) const
\n
void assignCornerLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2) const
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-bilinearScheme.h\n+catmarkScheme.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2014 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -23,211 +23,592 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_SDC_BILINEAR_SCHEME_H\n-25#define OPENSUBDIV3_SDC_BILINEAR_SCHEME_H\n+24#ifndef OPENSUBDIV3_SDC_CATMARK_SCHEME_H\n+25#define OPENSUBDIV3_SDC_CATMARK_SCHEME_H\n 26\n 27#include \"../version.h\"\n 28\n 29#include \"../sdc/scheme.h\"\n 30\n-31namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-32namespace OPENSUBDIV_VERSION {\n+31#include \n+32#include \n 33\n-_\b3_\b4namespace Sdc {\n-35\n-36//\n-37// Specializations for Scheme:\n-38//\n-39\n-40//\n-41// Bilinear traits:\n-42//\n-43template <>\n-_\b4_\b4inline _\bS_\bp_\bl_\bi_\bt _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be() { return\n-_\bS_\bP_\bL_\bI_\bT_\b__\bT_\bO_\b__\bQ_\bU_\bA_\bD_\bS; }\n-45\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Sdc {\n+38\n+39//\n+40// Specializations for Scheme:\n+41//\n+42\n+43//\n+44// Catmark traits:\n+45//\n 46template <>\n-_\b4_\b7inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() { return 4; }\n+_\b4_\b7inline _\bS_\bp_\bl_\bi_\bt _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be() { return\n+_\bS_\bP_\bL_\bI_\bT_\b__\bT_\bO_\b__\bQ_\bU_\bA_\bD_\bS; }\n 48\n 49template <>\n-_\b5_\b0inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be() { return 4; }\n+_\b5_\b0inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() { return 4; }\n 51\n 52template <>\n-_\b5_\b3inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be() { return 0; }\n+_\b5_\b3inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be() { return 4; }\n 54\n-55\n-56//\n-57// Refinement masks:\n-58//\n-59template <>\n-60template \n-61void\n-_\b6_\b2_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk(EDGE const& edge, MASK& mask,\n-63 _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be, _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be) const {\n-64 // This should be inline, otherwise trivially replicate it:\n-65 assignCreaseMaskForEdge(edge, mask);\n-66}\n-67\n+55template <>\n+_\b5_\b6inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be() { return 1; }\n+57\n+58\n+59//\n+60// Masks for edge-vertices: the hard Crease mask does not need to be\n+specialized\n+61// (simply the midpoint), so all that is left is the Smooth case:\n+62//\n+63// The Smooth mask is complicated by the need to support the \"triangle\n+subdivision\"\n+64// option, which applies different weighting in the presence of triangles. It\n+is\n+65// up for debate as to whether this is useful or not -- we may be able to\n+deprecate\n+66// this option.\n+67//\n 68template <>\n-69template \n-70void\n-_\b7_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n-mask,\n-72 _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be, _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be) const {\n-73 // This should be inline, otherwise trivially replicate it:\n-74 assignCornerMaskForVertex(vertex, mask);\n-75}\n+69template \n+70inline void\n+_\b7_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bE_\bd_\bg_\be(EDGE const& edge, MASK& mask)\n+const {\n+72\n+73 typedef typename MASK::Weight Weight;\n+74\n+75 int faceCount = edge.GetNumFaces();\n 76\n-77\n-78//\n-79// Limit masks for position -- the limit position of all vertices is the\n-refined vertex.\n-80//\n-81template <>\n-82template \n-83inline void\n-_\b8_\b4_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& /* vertex */,\n-MASK& posMask) const {\n-85\n-86 posMask.SetNumVertexWeights(1);\n-87 posMask.SetNumEdgeWeights(0);\n-88 posMask.SetNumFaceWeights(0);\n-89 posMask.SetFaceWeightsForFaceCenters(false);\n-90\n-91 posMask.VertexWeight(0) = 1.0f;\n-92}\n-93\n-94template <>\n-95template \n-96inline void\n-_\b9_\b7_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n-posMask,\n-98 int const /* creaseEnds */[2]) const {\n-99\n-100 assignCornerLimitMask(vertex, posMask);\n-101}\n-102\n-103template <>\n-104template \n-105inline void\n-_\b1_\b0_\b6_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n-posMask) const {\n-107\n-108 assignCornerLimitMask(vertex, posMask);\n-109}\n+77 mask.SetNumVertexWeights(2);\n+78 mask.SetNumEdgeWeights(0);\n+79 mask.SetNumFaceWeights(faceCount);\n+80 mask.SetFaceWeightsForFaceCenters(true);\n+81\n+82 //\n+83 // Determine if we need to inspect incident faces and apply alternate\n+weighting for\n+84 // triangles -- and if so, determine which of the two are triangles.\n+85 //\n+86 bool face0IsTri = false;\n+87 bool face1IsTri = false;\n+88 bool useTriangleOption = (_options.GetTriangleSubdivision() == _\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bT_\bR_\bI_\b__\bS_\bU_\bB_\b__\bS_\bM_\bO_\bO_\bT_\bH);\n+89 if (useTriangleOption) {\n+90 if (faceCount == 2) {\n+91 //\n+92 // Ideally we want to avoid this inspection when we have already subdivided\n+at\n+93 // least once -- need something in the Edge interface to help avoid this,\n+e.g.\n+94 // an IsRegular() query, the subdivision level...\n+95 //\n+96 int vertsPerFace[2];\n+97 edge.GetNumVerticesPerFace(vertsPerFace);\n+98\n+99 face0IsTri = (vertsPerFace[0] == 3);\n+100 face1IsTri = (vertsPerFace[1] == 3);\n+101 useTriangleOption = face0IsTri || face1IsTri;\n+102 } else {\n+103 useTriangleOption = false;\n+104 }\n+105 }\n+106\n+107 if (! useTriangleOption) {\n+108 mask.VertexWeight(0) = 0.25f;\n+109 mask.VertexWeight(1) = 0.25f;\n 110\n-111//\n-112// Limit masks for tangents -- these are ambiguous around all vertices.\n-Provide\n-113// the tangents based on the incident edges of the first face.\n-114//\n-115template <>\n-116template \n-117inline void\n-_\b1_\b1_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& /\n-* vertex */,\n-119 MASK& tan1Mask, MASK& tan2Mask) const {\n-120\n-121 tan1Mask.SetNumVertexWeights(1);\n-122 tan1Mask.SetNumEdgeWeights(2);\n-123 tan1Mask.SetNumFaceWeights(0);\n-124 tan1Mask.SetFaceWeightsForFaceCenters(false);\n+111 if (faceCount == 2) {\n+112 mask.FaceWeight(0) = 0.25f;\n+113 mask.FaceWeight(1) = 0.25f;\n+114 } else {\n+115 Weight fWeight = 0.5f / (Weight)faceCount;\n+116 for (int i = 0; i < faceCount; ++i) {\n+117 mask.FaceWeight(i) = fWeight;\n+118 }\n+119 }\n+120 } else {\n+121 //\n+122 // This mimics the implementation in Hbr in terms of order of operations.\n+123 //\n+124 const Weight CATMARK_SMOOTH_TRI_EDGE_WEIGHT = (Weight) 0.470;\n 125\n-126 tan2Mask.SetNumVertexWeights(1);\n-127 tan2Mask.SetNumEdgeWeights(2);\n-128 tan2Mask.SetNumFaceWeights(0);\n-129 tan2Mask.SetFaceWeightsForFaceCenters(false);\n-130\n-131 tan1Mask.VertexWeight(0) = -1.0f;\n-132 tan1Mask.EdgeWeight(0) = 1.0f;\n-133 tan1Mask.EdgeWeight(1) = 0.0f;\n+126 Weight f0Weight = face0IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;\n+127 Weight f1Weight = face1IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;\n+128\n+129 Weight fWeight = 0.5f * (f0Weight + f1Weight);\n+130 Weight vWeight = 0.5f * (1.0f - 2.0f * fWeight);\n+131\n+132 mask.VertexWeight(0) = vWeight;\n+133 mask.VertexWeight(1) = vWeight;\n 134\n-135 tan2Mask.VertexWeight(0) = -1.0f;\n-136 tan2Mask.EdgeWeight(0) = 0.0f;\n-137 tan2Mask.EdgeWeight(1) = 1.0f;\n+135 mask.FaceWeight(0) = fWeight;\n+136 mask.FaceWeight(1) = fWeight;\n+137 }\n 138}\n 139\n-140template <>\n-141template \n-142inline void\n-_\b1_\b4_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n-144 MASK& tan1Mask, MASK& tan2Mask, int const /* creaseEnds */[2]) const {\n-145\n-146 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);\n-147}\n-148\n-149template <>\n-150template \n-151inline void\n-_\b1_\b5_\b2_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n-153 MASK& tan1Mask, MASK& tan2Mask) const {\n-154\n-155 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);\n-156}\n-157\n-158} // end namespace sdc\n-159\n-160} // end namespace OPENSUBDIV_VERSION\n-161using namespace OPENSUBDIV_VERSION;\n-162} // end namespace OpenSubdiv\n-163\n-164#endif /* OPENSUBDIV3_SDC_BILINEAR_SCHEME_H */\n+140\n+141//\n+142// Masks for vertex-vertices: the hard Corner mask does not need to be\n+specialized\n+143// (simply the vertex itself), leaving the Crease and Smooth cases (Dart is\n+smooth):\n+144//\n+145template <>\n+146template \n+147inline void\n+_\b1_\b4_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx(VERTEX const& vertex,\n+MASK& mask,\n+149 int const creaseEnds[2]) const {\n+150 typedef typename MASK::Weight Weight;\n+151\n+152 int valence = vertex.GetNumEdges();\n+153\n+154 mask.SetNumVertexWeights(1);\n+155 mask.SetNumEdgeWeights(valence);\n+156 mask.SetNumFaceWeights(0);\n+157 mask.SetFaceWeightsForFaceCenters(false);\n+158\n+159 Weight vWeight = 0.75f;\n+160 Weight eWeight = 0.125f;\n+161\n+162 mask.VertexWeight(0) = vWeight;\n+163 for (int i = 0; i < valence; ++i) {\n+164 mask.EdgeWeight(i) = 0.0f;\n+165 }\n+166 mask.EdgeWeight(creaseEnds[0]) = eWeight;\n+167 mask.EdgeWeight(creaseEnds[1]) = eWeight;\n+168}\n+169\n+170template <>\n+171template \n+172inline void\n+_\b1_\b7_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx(VERTEX const& vertex,\n+MASK& mask) const {\n+174\n+175 typedef typename MASK::Weight Weight;\n+176\n+177 //\n+178 // A Smooth vertex must be manifold and interior -- manifold boundary\n+vertices will be\n+179 // Creases and non-manifold vertices of any kind will be Corners or\n+Creases. If smooth\n+180 // rules for non-manifold vertices are ever defined, this will need\n+adjusting:\n+181 //\n+182 assert(vertex.GetNumFaces() == vertex.GetNumEdges());\n+183\n+184 int valence = vertex.GetNumFaces();\n+185\n+186 mask.SetNumVertexWeights(1);\n+187 mask.SetNumEdgeWeights(valence);\n+188 mask.SetNumFaceWeights(valence);\n+189 mask.SetFaceWeightsForFaceCenters(true);\n+190\n+191 Weight vWeight = (Weight)(valence - 2) / (Weight)valence;\n+192 Weight fWeight = 1.0f / (Weight)(valence * valence);\n+193 Weight eWeight = fWeight;\n+194\n+195 mask.VertexWeight(0) = vWeight;\n+196 for (int i = 0; i < valence; ++i) {\n+197 mask.EdgeWeight(i) = eWeight;\n+198 mask.FaceWeight(i) = fWeight;\n+199 }\n+200}\n+201\n+202//\n+203// Limit masks for position:\n+204//\n+205template <>\n+206template \n+207inline void\n+_\b2_\b0_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& /* vertex */,\n+MASK& posMask) const {\n+209\n+210 posMask.SetNumVertexWeights(1);\n+211 posMask.SetNumEdgeWeights(0);\n+212 posMask.SetNumFaceWeights(0);\n+213 posMask.SetFaceWeightsForFaceCenters(false);\n+214\n+215 posMask.VertexWeight(0) = 1.0f;\n+216}\n+217\n+218template <>\n+219template \n+220inline void\n+_\b2_\b2_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n+posMask,\n+222 int const creaseEnds[2]) const {\n+223\n+224 typedef typename MASK::Weight Weight;\n+225\n+226 int valence = vertex.GetNumEdges();\n+227\n+228 posMask.SetNumVertexWeights(1);\n+229 posMask.SetNumEdgeWeights(valence);\n+230 posMask.SetNumFaceWeights(0);\n+231 posMask.SetFaceWeightsForFaceCenters(false);\n+232\n+233 Weight vWeight = (Weight)(2.0 / 3.0);\n+234 Weight eWeight = (Weight)(1.0 / 6.0);\n+235\n+236 posMask.VertexWeight(0) = vWeight;\n+237 for (int i = 0; i < valence; ++i) {\n+238 posMask.EdgeWeight(i) = 0.0f;\n+239 }\n+240 posMask.EdgeWeight(creaseEnds[0]) = eWeight;\n+241 posMask.EdgeWeight(creaseEnds[1]) = eWeight;\n+242}\n+243\n+244template <>\n+245template \n+246inline void\n+_\b2_\b4_\b7_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n+posMask) const {\n+248\n+249 typedef typename MASK::Weight Weight;\n+250\n+251 int valence = vertex.GetNumFaces();\n+252 if (valence == 2) {\n+253 assignCornerLimitMask(vertex, posMask);\n+254 return;\n+255 }\n+256\n+257 posMask.SetNumVertexWeights(1);\n+258 posMask.SetNumEdgeWeights(valence);\n+259 posMask.SetNumFaceWeights(valence);\n+260 posMask.SetFaceWeightsForFaceCenters(false);\n+261\n+262 // Specialize for the regular case:\n+263 if (valence == 4) {\n+264 Weight fWeight = (Weight)(1.0 / 36.0);\n+265 Weight eWeight = (Weight)(1.0 / 9.0);\n+266 Weight vWeight = (Weight)(4.0 / 9.0);\n+267\n+268 posMask.VertexWeight(0) = vWeight;\n+269\n+270 posMask.EdgeWeight(0) = eWeight;\n+271 posMask.EdgeWeight(1) = eWeight;\n+272 posMask.EdgeWeight(2) = eWeight;\n+273 posMask.EdgeWeight(3) = eWeight;\n+274\n+275 posMask.FaceWeight(0) = fWeight;\n+276 posMask.FaceWeight(1) = fWeight;\n+277 posMask.FaceWeight(2) = fWeight;\n+278 posMask.FaceWeight(3) = fWeight;\n+279 } else {\n+280 Weight Valence = (Weight) valence;\n+281\n+282 Weight fWeight = 1.0f / (Valence * (Valence + 5.0f));\n+283 Weight eWeight = 4.0f * fWeight;\n+284 Weight vWeight = 1.0f - Valence * (eWeight + fWeight);\n+285\n+286 posMask.VertexWeight(0) = vWeight;\n+287 for (int i = 0; i < valence; ++i) {\n+288 posMask.EdgeWeight(i) = eWeight;\n+289 posMask.FaceWeight(i) = fWeight;\n+290 }\n+291 }\n+292}\n+293\n+294//\n+295// Limit masks for tangents -- these are stubs for now, or have a temporary\n+296// implementation\n+297//\n+298template <>\n+299template \n+300inline void\n+_\b3_\b0_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n+302 MASK& tan1Mask, MASK& tan2Mask) const {\n+303\n+304 int valence = vertex.GetNumEdges();\n+305\n+306 tan1Mask.SetNumVertexWeights(1);\n+307 tan1Mask.SetNumEdgeWeights(valence);\n+308 tan1Mask.SetNumFaceWeights(0);\n+309 tan1Mask.SetFaceWeightsForFaceCenters(false);\n+310\n+311 tan2Mask.SetNumVertexWeights(1);\n+312 tan2Mask.SetNumEdgeWeights(valence);\n+313 tan2Mask.SetNumFaceWeights(0);\n+314 tan2Mask.SetFaceWeightsForFaceCenters(false);\n+315\n+316 // Should be at least 2 edges -- be sure to clear weights for any more:\n+317 tan1Mask.VertexWeight(0) = -1.0f;\n+318 tan1Mask.EdgeWeight(0) = 1.0f;\n+319 tan1Mask.EdgeWeight(1) = 0.0f;\n+320\n+321 tan2Mask.VertexWeight(0) = -1.0f;\n+322 tan2Mask.EdgeWeight(0) = 0.0f;\n+323 tan2Mask.EdgeWeight(1) = 1.0f;\n+324\n+325 for (int i = 2; i < valence; ++i) {\n+326 tan1Mask.EdgeWeight(i) = 0.0f;\n+327 tan2Mask.EdgeWeight(i) = 0.0f;\n+328 }\n+329}\n+330\n+331template <>\n+332template \n+333inline void\n+_\b3_\b3_\b4_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n+335 MASK& tan1Mask, MASK& tan2Mask, int const creaseEnds[2]) const {\n+336\n+337 typedef typename MASK::Weight Weight;\n+338\n+339 //\n+340 // First, the tangent along the crease:\n+341 // The first crease edge is considered the \"leading\" edge of the span\n+342 // of surface for which we are evaluating tangents and the second edge the\n+343 // \"trailing edge\". By convention, the tangent along the crease is oriented\n+344 // in the direction of the leading edge.\n+345 //\n+346 int numEdges = vertex.GetNumEdges();\n+347 int numFaces = vertex.GetNumFaces();\n+348\n+349 tan1Mask.SetNumVertexWeights(1);\n+350 tan1Mask.SetNumEdgeWeights(numEdges);\n+351 tan1Mask.SetNumFaceWeights(numFaces);\n+352 tan1Mask.SetFaceWeightsForFaceCenters(false);\n+353\n+354 tan1Mask.VertexWeight(0) = 0.0f;\n+355 for (int i = 0; i < numEdges; ++i) {\n+356 tan1Mask.EdgeWeight(i) = 0.0f;\n+357 }\n+358 for (int i = 0; i < numFaces; ++i) {\n+359 tan1Mask.FaceWeight(i) = 0.0f;\n+360 }\n+361\n+362 tan1Mask.EdgeWeight(creaseEnds[0]) = 0.5f;\n+363 tan1Mask.EdgeWeight(creaseEnds[1]) = -0.5f;\n+364\n+365 //\n+366 // Second, the tangent across the interior faces:\n+367 // Note this is ambiguous for an interior vertex. We currently return\n+368 // the tangent for the surface in the counter-clockwise span between the\n+369 // leading and trailing edges that form the crease. Given the expected\n+370 // computation of a surface normal as Tan1 X Tan2, this tangent should be\n+371 // oriented \"inward\" from the crease/boundary -- across the surface rather\n+372 // than outward and away from it.\n+373 //\n+374 tan2Mask.SetNumVertexWeights(1);\n+375 tan2Mask.SetNumEdgeWeights(numEdges);\n+376 tan2Mask.SetNumFaceWeights(numFaces);\n+377 tan2Mask.SetFaceWeightsForFaceCenters(false);\n+378\n+379 // Prepend weights of 0 preceding the crease:\n+380 for (int i = 0; i < creaseEnds[0]; ++i) {\n+381 tan2Mask.EdgeWeight(i) = 0.0f;\n+382 tan2Mask.FaceWeight(i) = 0.0f;\n+383 }\n+384\n+385 // Assign weights to crease edge and interior points:\n+386 int interiorEdgeCount = creaseEnds[1] - creaseEnds[0] - 1;\n+387 if (interiorEdgeCount == 1) {\n+388 // The regular case -- uniform B-spline cross-tangent:\n+389\n+390 tan2Mask.VertexWeight(0) = (Weight)(-4.0 / 6.0);\n+391\n+392 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight)(-1.0 / 6.0);\n+393 tan2Mask.EdgeWeight(creaseEnds[0] + 1) = (Weight)( 4.0 / 6.0);\n+394 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight)(-1.0 / 6.0);\n+395\n+396 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight)(1.0 / 6.0);\n+397 tan2Mask.FaceWeight(creaseEnds[0] + 1) = (Weight)(1.0 / 6.0);\n+398 } else if (interiorEdgeCount > 1) {\n+399 // The irregular case -- formulae from Biermann et al:\n+400\n+401 double k = (double) (interiorEdgeCount + 1);\n+402 double theta = M_PI / k;\n+403\n+404 double cosTheta = std::cos(theta);\n+405 double sinTheta = std::sin(theta);\n+406\n+407 // Loop/Schaefer use a different divisor here (3*k + cos(theta)):\n+408 double commonDenom = 1.0f / (k * (3.0f + cosTheta));\n+409 double R = (cosTheta + 1.0f) / sinTheta;\n+410\n+411 double vertexWeight = 4.0f * R * (cosTheta - 1.0f);\n+412 double creaseWeight = -R * (1.0f + 2.0f * cosTheta);\n+413\n+414 tan2Mask.VertexWeight(0) = (Weight) (vertexWeight * commonDenom);\n+415\n+416 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight) (creaseWeight * commonDenom);\n+417 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight) (creaseWeight * commonDenom);\n+418\n+419 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight) (sinTheta * commonDenom);\n+420\n+421 double sinThetaI = 0.0f;\n+422 double sinThetaIplus1 = sinTheta;\n+423 for (int i = 1; i < k; ++i) {\n+424 sinThetaI = sinThetaIplus1;\n+425 sinThetaIplus1 = std::sin((i+1)*theta);\n+426\n+427 tan2Mask.EdgeWeight(creaseEnds[0] + i) = (Weight) ((4.0f * sinThetaI) *\n+commonDenom);\n+428 tan2Mask.FaceWeight(creaseEnds[0] + i) = (Weight) ((sinThetaI +\n+sinThetaIplus1) * commonDenom);\n+429 }\n+430 } else {\n+431 // Special case for a single face -- simple average of boundary edges:\n+432\n+433 tan2Mask.VertexWeight(0) = -6.0f;\n+434\n+435 tan2Mask.EdgeWeight(creaseEnds[0]) = 3.0f;\n+436 tan2Mask.EdgeWeight(creaseEnds[1]) = 3.0f;\n+437\n+438 tan2Mask.FaceWeight(creaseEnds[0]) = 0.0f;\n+439 }\n+440\n+441 // Append weights of 0 following the crease:\n+442 for (int i = creaseEnds[1]; i < numFaces; ++i) {\n+443 tan2Mask.FaceWeight(i) = 0.0f;\n+444 }\n+445 for (int i = creaseEnds[1] + 1; i < numEdges; ++i) {\n+446 tan2Mask.EdgeWeight(i) = 0.0f;\n+447 }\n+448}\n+449\n+450template <>\n+451template \n+452inline void\n+_\b4_\b5_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n+454 MASK& tan1Mask, MASK& tan2Mask) const {\n+455\n+456 typedef typename MASK::Weight Weight;\n+457\n+458 int valence = vertex.GetNumFaces();\n+459 if (valence == 2) {\n+460 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);\n+461 return;\n+462 }\n+463\n+464 // Compute tan1 initially -- tan2 is simply a rotation:\n+465 tan1Mask.SetNumVertexWeights(1);\n+466 tan1Mask.SetNumEdgeWeights(valence);\n+467 tan1Mask.SetNumFaceWeights(valence);\n+468 tan1Mask.SetFaceWeightsForFaceCenters(false);\n+469\n+470 tan1Mask.VertexWeight(0) = 0.0f;\n+471\n+472 if (valence == 4) {\n+473 tan1Mask.EdgeWeight(0) = 4.0f;\n+474 tan1Mask.EdgeWeight(1) = 0.0f;\n+475 tan1Mask.EdgeWeight(2) = -4.0f;\n+476 tan1Mask.EdgeWeight(3) = 0.0f;\n+477\n+478 tan1Mask.FaceWeight(0) = 1.0f;\n+479 tan1Mask.FaceWeight(1) = -1.0f;\n+480 tan1Mask.FaceWeight(2) = -1.0f;\n+481 tan1Mask.FaceWeight(3) = 1.0f;\n+482 } else {\n+483 double theta = 2.0f * M_PI / (double)valence;\n+484\n+485 double cosTheta = std::cos(theta);\n+486 double cosHalfTheta = std::cos(theta * 0.5f);\n+487\n+488 double lambda = (5.0 / 16.0) + (1.0 / 16.0) *\n+489 (cosTheta + cosHalfTheta * std::sqrt(2.0f * (9.0f + cosTheta)));\n+490\n+491 double edgeWeightScale = 4.0f;\n+492 double faceWeightScale = 1.0f / (4.0f * lambda - 1.0f);\n+493\n+494 for (int i = 0; i < valence; ++i) {\n+495 double cosThetaI = std::cos( i * theta);\n+496 double cosThetaIplus1 = std::cos((i+1)* theta);\n+497\n+498 tan1Mask.EdgeWeight(i) = (Weight) (edgeWeightScale * cosThetaI);\n+499 tan1Mask.FaceWeight(i) = (Weight) (faceWeightScale * (cosThetaI +\n+cosThetaIplus1));\n+500 }\n+501 }\n+502\n+503 // Now rotate/copy tan1 weights to tan2:\n+504 tan2Mask.SetNumVertexWeights(1);\n+505 tan2Mask.SetNumEdgeWeights(valence);\n+506 tan2Mask.SetNumFaceWeights(valence);\n+507 tan2Mask.SetFaceWeightsForFaceCenters(false);\n+508\n+509 tan2Mask.VertexWeight(0) = 0.0f;\n+510 if (valence == 4) {\n+511 tan2Mask.EdgeWeight(0) = 0.0f;\n+512 tan2Mask.EdgeWeight(1) = 4.0f;\n+513 tan2Mask.EdgeWeight(2) = 0.0f;\n+514 tan2Mask.EdgeWeight(3) = -4.0f;\n+515\n+516 tan2Mask.FaceWeight(0) = 1.0f;\n+517 tan2Mask.FaceWeight(1) = 1.0f;\n+518 tan2Mask.FaceWeight(2) = -1.0f;\n+519 tan2Mask.FaceWeight(3) = -1.0f;\n+520 } else {\n+521 tan2Mask.EdgeWeight(0) = tan1Mask.EdgeWeight(valence-1);\n+522 tan2Mask.FaceWeight(0) = tan1Mask.FaceWeight(valence-1);\n+523 for (int i = 1; i < valence; ++i) {\n+524 tan2Mask.EdgeWeight(i) = tan1Mask.EdgeWeight(i-1);\n+525 tan2Mask.FaceWeight(i) = tan1Mask.FaceWeight(i-1);\n+526 }\n+527 }\n+528}\n+529\n+530} // end namespace sdc\n+531\n+532} // end namespace OPENSUBDIV_VERSION\n+533using namespace OPENSUBDIV_VERSION;\n+534} // end namespace OpenSubdiv\n+535\n+536#endif /* OPENSUBDIV3_SDC_CATMARK_SCHEME_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bp_\bl_\bi_\bt\n Split\n Enumerated type for all face splitting schemes.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bP_\bL_\bI_\bT_\b__\bT_\bO_\b__\bQ_\bU_\bA_\bD_\bS\n @ SPLIT_TO_QUADS\n Used by Catmark and Bilinear.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n-Rule\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bT_\bR_\bI_\b__\bS_\bU_\bB_\b__\bS_\bM_\bO_\bO_\bT_\bH\n+@ TRI_SUB_SMOOTH\n+\"smooth triangle\" weights (Catmark scheme only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bE_\bd_\bg_\be\n+void assignSmoothMaskForEdge(EDGE const &edge, MASK &mask) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be\n static Split GetTopologicalSplitType()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk\n-void ComputeVertexVertexMask(VERTEX const &vertexNeighborhood, MASK\n-&vertexVertexMask, Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule\n-childRule=Crease::RULE_UNKNOWN) const\n-Vertex-vertex masks If known, a single Rule or pair of Rules can be specified\n-(indicating a crease tr...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bc_\bh_\be_\bm_\be_\b._\bh_\b:_\b5_\b1_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx\n+void assignCreaseMaskForVertex(VERTEX const &edge, MASK &mask, int const\n+creaseEnds[2]) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n void assignCreaseLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n &tan2, int const creaseEnds[2]) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n static int GetRegularFaceSize()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk\n-void ComputeEdgeVertexMask(EDGE const &edgeNeighborhood, MASK &edgeVertexMask,\n-Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule childRule=Crease::\n-RULE_UNKNOWN) const\n-Edge-vertex masks If known, the Rule for the edge and/or the derived vertex can\n-be specified to accel...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bc_\bh_\be_\bm_\be_\b._\bh_\b:_\b3_\b9_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n void assignSmoothLimitMask(VERTEX const &vertex, MASK &pos) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be\n static int GetLocalNeighborhoodSize()\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n void assignCreaseLimitMask(VERTEX const &vertex, MASK &pos, int const\n creaseEnds[2]) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx\n+void assignSmoothMaskForVertex(VERTEX const &edge, MASK &mask) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be\n static int GetRegularVertexValence()\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n void assignSmoothLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n &tan2) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n void assignCornerLimitMask(VERTEX const &vertex, MASK &pos) const\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n void assignCornerLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n &tan2) const\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bs_\bd_\bc\n- * _\bb_\bi_\bl_\bi_\bn_\be_\ba_\br_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n+ * _\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00791.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00791.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/cudaEvaluator.h File Reference\n+OpenSubdiv: opensubdiv/osd/opencl.h File Reference\n \n \n \n \n \n \n \n@@ -87,50 +87,24 @@\n
No Matches
\n \n \n \n \n \n
\n- \n-
cudaEvaluator.h File Reference
\n+
opencl.h File Reference
\n
\n
\n-
#include "../version.h"
\n-#include <vector>
\n-#include "../osd/bufferDescriptor.h"
\n-#include "../osd/types.h"
\n+
#include <CL/opencl.h>
\n
\n

Go to the source code of this file.

\n-\n-\n-\n-\n-\n-\n-\n-

\n-Classes

class  CudaStencilTable
 CUDA stencil table. More...
 
class  CudaEvaluator
 
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

\n-Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,11 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-cudaEvaluator.h File Reference\n-#include \"../version.h\"\n-#include \n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+opencl.h File Reference\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-\u00a0 CUDA stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-\u00a0\n-N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n-\u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n-\u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n-\u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n-\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00791_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00791_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/cudaEvaluator.h Source File\n+OpenSubdiv: opensubdiv/osd/opencl.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
cudaEvaluator.h
\n+
opencl.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2014 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,582 +119,32 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_CUDA_EVALUATOR_H
\n-
26#define OPENSUBDIV3_OSD_CUDA_EVALUATOR_H
\n+
25#ifndef OPENSUBDIV3_OSD_OPENCL_H
\n+
26#define OPENSUBDIV3_OSD_OPENCL_H
\n
27
\n-
28#include "../version.h"
\n-
29
\n-
30#include <vector>
\n-
31#include "../osd/bufferDescriptor.h"
\n-
32#include "../osd/types.h"
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Far {
\n-
38 class PatchTable;
\n-
39 class StencilTable;
\n-
40 class LimitStencilTable;
\n-
41}
\n-
42
\n-
43namespace Osd {
\n-
44
\n-
\n-\n-
53public:
\n-
\n-
54 static CudaStencilTable *Create(Far::StencilTable const *stencilTable,
\n-
55 void *deviceContext = NULL) {
\n-
56 (void)deviceContext; // unused
\n-
57 return new CudaStencilTable(stencilTable);
\n-
58 }
\n-
\n-
\n-
59 static CudaStencilTable *Create(Far::LimitStencilTable const *limitStencilTable,
\n-
60 void *deviceContext = NULL) {
\n-
61 (void)deviceContext; // unused
\n-
62 return new CudaStencilTable(limitStencilTable);
\n-
63 }
\n-
\n-
64
\n-
65 explicit CudaStencilTable(Far::StencilTable const *stencilTable);
\n-
66 explicit CudaStencilTable(Far::LimitStencilTable const *limitStencilTable);
\n-\n-
68
\n-
69 // interfaces needed for CudaCompute
\n-
70 void *GetSizesBuffer() const { return _sizes; }
\n-
71 void *GetOffsetsBuffer() const { return _offsets; }
\n-
72 void *GetIndicesBuffer() const { return _indices; }
\n-
73 void *GetWeightsBuffer() const { return _weights; }
\n-
74 void *GetDuWeightsBuffer() const { return _duWeights; }
\n-
75 void *GetDvWeightsBuffer() const { return _dvWeights; }
\n-
76 void *GetDuuWeightsBuffer() const { return _duuWeights; }
\n-
77 void *GetDuvWeightsBuffer() const { return _duvWeights; }
\n-
78 void *GetDvvWeightsBuffer() const { return _dvvWeights; }
\n-
79 int GetNumStencils() const { return _numStencils; }
\n-
80
\n-
81private:
\n-
82 void * _sizes,
\n-
83 * _offsets,
\n-
84 * _indices,
\n-
85 * _weights,
\n-
86 * _duWeights,
\n-
87 * _dvWeights,
\n-
88 * _duuWeights,
\n-
89 * _duvWeights,
\n-
90 * _dvvWeights;
\n-
91 int _numStencils;
\n-
92};
\n-
\n-
93
\n-
\n-\n-
95public:
\n-
101
\n-
125 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
126 static bool EvalStencils(
\n-
127 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
128 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
129 STENCIL_TABLE const *stencilTable,
\n-
130 const void *instance = NULL,
\n-
131 void * deviceContext = NULL) {
\n-
132
\n-
133 (void)instance; // unused
\n-
134 (void)deviceContext; // unused
\n-
135 return EvalStencils(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
136 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
137 (int const *)stencilTable->GetSizesBuffer(),
\n-
138 (int const *)stencilTable->GetOffsetsBuffer(),
\n-
139 (int const *)stencilTable->GetIndicesBuffer(),
\n-
140 (float const *)stencilTable->GetWeightsBuffer(),
\n-
141 /*start = */ 0,
\n-
142 /*end = */ stencilTable->GetNumStencils());
\n-
143 }
\n-
\n-
144
\n-
171 static bool EvalStencils(
\n-
172 const float *src, BufferDescriptor const &srcDesc,
\n-
173 float *dst, BufferDescriptor const &dstDesc,
\n-
174 const int * sizes,
\n-
175 const int * offsets,
\n-
176 const int * indices,
\n-
177 const float * weights,
\n-
178 int start, int end);
\n-
179
\n-
217 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
218 static bool EvalStencils(
\n-
219 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
220 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
221 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
222 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
223 STENCIL_TABLE const *stencilTable,
\n-
224 const CudaEvaluator *instance = NULL,
\n-
225 void * deviceContext = NULL) {
\n-
226
\n-
227 (void)instance; // unused
\n-
228 (void)deviceContext; // unused
\n-
229
\n-
230 return EvalStencils(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
231 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
232 duBuffer->BindCudaBuffer(), duDesc,
\n-
233 dvBuffer->BindCudaBuffer(), dvDesc,
\n-
234 (int const *)stencilTable->GetSizesBuffer(),
\n-
235 (int const *)stencilTable->GetOffsetsBuffer(),
\n-
236 (int const *)stencilTable->GetIndicesBuffer(),
\n-
237 (float const *)stencilTable->GetWeightsBuffer(),
\n-
238 (float const *)stencilTable->GetDuWeightsBuffer(),
\n-
239 (float const *)stencilTable->GetDvWeightsBuffer(),
\n-
240 /*start = */ 0,
\n-
241 /*end = */ stencilTable->GetNumStencils());
\n-
242 }
\n-
\n-
243
\n-
284 static bool EvalStencils(
\n-
285 const float *src, BufferDescriptor const &srcDesc,
\n-
286 float *dst, BufferDescriptor const &dstDesc,
\n-
287 float *du, BufferDescriptor const &duDesc,
\n-
288 float *dv, BufferDescriptor const &dvDesc,
\n-
289 const int * sizes,
\n-
290 const int * offsets,
\n-
291 const int * indices,
\n-
292 const float * weights,
\n-
293 const float * duWeights,
\n-
294 const float * dvWeights,
\n-
295 int start, int end);
\n-
296
\n-
352 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
353 static bool EvalStencils(
\n-
354 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
355 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
356 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
357 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
358 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
359 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
360 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
361 STENCIL_TABLE const *stencilTable,
\n-
362 const CudaEvaluator *instance = NULL,
\n-
363 void * deviceContext = NULL) {
\n-
364
\n-
365 (void)instance; // unused
\n-
366 (void)deviceContext; // unused
\n-
367
\n-
368 return EvalStencils(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
369 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
370 duBuffer->BindCudaBuffer(), duDesc,
\n-
371 dvBuffer->BindCudaBuffer(), dvDesc,
\n-
372 duuBuffer->BindCudaBuffer(), duuDesc,
\n-
373 duvBuffer->BindCudaBuffer(), duvDesc,
\n-
374 dvvBuffer->BindCudaBuffer(), dvvDesc,
\n-
375 (int const *)stencilTable->GetSizesBuffer(),
\n-
376 (int const *)stencilTable->GetOffsetsBuffer(),
\n-
377 (int const *)stencilTable->GetIndicesBuffer(),
\n-
378 (float const *)stencilTable->GetWeightsBuffer(),
\n-
379 (float const *)stencilTable->GetDuWeightsBuffer(),
\n-
380 (float const *)stencilTable->GetDvWeightsBuffer(),
\n-
381 (float const *)stencilTable->GetDuuWeightsBuffer(),
\n-
382 (float const *)stencilTable->GetDuvWeightsBuffer(),
\n-
383 (float const *)stencilTable->GetDvvWeightsBuffer(),
\n-
384 /*start = */ 0,
\n-
385 /*end = */ stencilTable->GetNumStencils());
\n-
386 }
\n-
\n-
387
\n-
449 static bool EvalStencils(
\n-
450 const float *src, BufferDescriptor const &srcDesc,
\n-
451 float *dst, BufferDescriptor const &dstDesc,
\n-
452 float *du, BufferDescriptor const &duDesc,
\n-
453 float *dv, BufferDescriptor const &dvDesc,
\n-
454 float *duu, BufferDescriptor const &duuDesc,
\n-
455 float *duv, BufferDescriptor const &duvDesc,
\n-
456 float *dvv, BufferDescriptor const &dvvDesc,
\n-
457 const int * sizes,
\n-
458 const int * offsets,
\n-
459 const int * indices,
\n-
460 const float * weights,
\n-
461 const float * duWeights,
\n-
462 const float * dvWeights,
\n-
463 const float * duuWeights,
\n-
464 const float * duvWeights,
\n-
465 const float * dvvWeights,
\n-
466 int start, int end);
\n-
467
\n-
473
\n-
502 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
503 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
504 static bool EvalPatches(
\n-
505 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
506 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
507 int numPatchCoords,
\n-
508 PATCHCOORD_BUFFER *patchCoords,
\n-
509 PATCH_TABLE *patchTable,
\n-
510 CudaEvaluator const *instance,
\n-
511 void * deviceContext = NULL) {
\n-
512
\n-
513 (void)instance; // unused
\n-
514 (void)deviceContext; // unused
\n-
515
\n-
516 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
517 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
518 numPatchCoords,
\n-
519 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n-
520 (const PatchArray *)patchTable->GetPatchArrayBuffer(),
\n-
521 (const int *)patchTable->GetPatchIndexBuffer(),
\n-
522 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n-
523 }
\n-
\n-
524
\n-
563 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
564 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
565 static bool EvalPatches(
\n-
566 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
567 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
568 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
569 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
570 int numPatchCoords,
\n-
571 PATCHCOORD_BUFFER *patchCoords,
\n-
572 PATCH_TABLE *patchTable,
\n-
573 CudaEvaluator const *instance,
\n-
574 void * deviceContext = NULL) {
\n-
575
\n-
576 (void)instance; // unused
\n-
577 (void)deviceContext; // unused
\n-
578
\n-
579 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
580 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
581 duBuffer->BindCudaBuffer(), duDesc,
\n-
582 dvBuffer->BindCudaBuffer(), dvDesc,
\n-
583 numPatchCoords,
\n-
584 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n-
585 (const PatchArray *)patchTable->GetPatchArrayBuffer(),
\n-
586 (const int *)patchTable->GetPatchIndexBuffer(),
\n-
587 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n-
588 }
\n-
\n-
589
\n-
646 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
647 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
648 static bool EvalPatches(
\n-
649 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
650 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
651 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
652 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
653 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
654 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
655 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
656 int numPatchCoords,
\n-
657 PATCHCOORD_BUFFER *patchCoords,
\n-
658 PATCH_TABLE *patchTable,
\n-
659 CudaEvaluator const *instance,
\n-
660 void * deviceContext = NULL) {
\n-
661
\n-
662 (void)instance; // unused
\n-
663 (void)deviceContext; // unused
\n-
664
\n-
665 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
666 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
667 duBuffer->BindCudaBuffer(), duDesc,
\n-
668 dvBuffer->BindCudaBuffer(), dvDesc,
\n-
669 duuBuffer->BindCudaBuffer(), duuDesc,
\n-
670 duvBuffer->BindCudaBuffer(), duvDesc,
\n-
671 dvvBuffer->BindCudaBuffer(), dvvDesc,
\n-
672 numPatchCoords,
\n-
673 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n-
674 (const PatchArray *)patchTable->GetPatchArrayBuffer(),
\n-
675 (const int *)patchTable->GetPatchIndexBuffer(),
\n-
676 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n-
677 }
\n-
\n-
678
\n-
706 static bool EvalPatches(
\n-
707 const float *src, BufferDescriptor const &srcDesc,
\n-
708 float *dst, BufferDescriptor const &dstDesc,
\n-
709 int numPatchCoords,
\n-
710 const PatchCoord *patchCoords,
\n-
711 const PatchArray *patchArrays,
\n-
712 const int *patchIndices,
\n-
713 const PatchParam *patchParams);
\n-
714
\n-
752 static bool EvalPatches(
\n-
753 const float *src, BufferDescriptor const &srcDesc,
\n-
754 float *dst, BufferDescriptor const &dstDesc,
\n-
755 float *du, BufferDescriptor const &duDesc,
\n-
756 float *dv, BufferDescriptor const &dvDesc,
\n-
757 int numPatchCoords,
\n-
758 PatchCoord const *patchCoords,
\n-
759 PatchArray const *patchArrays,
\n-
760 const int *patchIndices,
\n-
761 PatchParam const *patchParams);
\n-
762
\n-
815 static bool EvalPatches(
\n-
816 const float *src, BufferDescriptor const &srcDesc,
\n-
817 float *dst, BufferDescriptor const &dstDesc,
\n-
818 float *du, BufferDescriptor const &duDesc,
\n-
819 float *dv, BufferDescriptor const &dvDesc,
\n-
820 float *duu, BufferDescriptor const &duuDesc,
\n-
821 float *duv, BufferDescriptor const &duvDesc,
\n-
822 float *dvv, BufferDescriptor const &dvvDesc,
\n-
823 int numPatchCoords,
\n-
824 PatchCoord const *patchCoords,
\n-
825 PatchArray const *patchArrays,
\n-
826 const int *patchIndices,
\n-
827 PatchParam const *patchParams);
\n-
828
\n-
857 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
858 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
860 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
861 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
862 int numPatchCoords,
\n-
863 PATCHCOORD_BUFFER *patchCoords,
\n-
864 PATCH_TABLE *patchTable,
\n-
865 CudaEvaluator const *instance,
\n-
866 void * deviceContext = NULL) {
\n-
867
\n-
868 (void)instance; // unused
\n-
869 (void)deviceContext; // unused
\n-
870
\n-
871 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
872 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
873 numPatchCoords,
\n-
874 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n-
875 (const PatchArray *)patchTable->GetVaryingPatchArrayBuffer(),
\n-
876 (const int *)patchTable->GetVaryingPatchIndexBuffer(),
\n-
877 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n-
878 }
\n-
\n-
879
\n-
920 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
921 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
923 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
924 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
925 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
926 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
927 int numPatchCoords,
\n-
928 PATCHCOORD_BUFFER *patchCoords,
\n-
929 PATCH_TABLE *patchTable,
\n-
930 CudaEvaluator const *instance,
\n-
931 void * deviceContext = NULL) {
\n-
932
\n-
933 (void)instance; // unused
\n-
934 (void)deviceContext; // unused
\n-
935
\n-
936 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
937 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
938 duBuffer->BindCudaBuffer(), duDesc,
\n-
939 dvBuffer->BindCudaBuffer(), dvDesc,
\n-
940 numPatchCoords,
\n-
941 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n-
942 (const PatchArray *)patchTable->GetVaryingPatchArrayBuffer(),
\n-
943 (const int *)patchTable->GetVaryingPatchIndexBuffer(),
\n-
944 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n-
945 }
\n-
\n-
946
\n-
1005 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1006 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1008 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1009 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1010 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1011 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1012 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1013 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1014 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1015 int numPatchCoords,
\n-
1016 PATCHCOORD_BUFFER *patchCoords,
\n-
1017 PATCH_TABLE *patchTable,
\n-
1018 CudaEvaluator const *instance,
\n-
1019 void * deviceContext = NULL) {
\n-
1020
\n-
1021 (void)instance; // unused
\n-
1022 (void)deviceContext; // unused
\n-
1023
\n-
1024 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
1025 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
1026 duBuffer->BindCudaBuffer(), duDesc,
\n-
1027 dvBuffer->BindCudaBuffer(), dvDesc,
\n-
1028 duuBuffer->BindCudaBuffer(), duuDesc,
\n-
1029 duvBuffer->BindCudaBuffer(), duvDesc,
\n-
1030 dvvBuffer->BindCudaBuffer(), dvvDesc,
\n-
1031 numPatchCoords,
\n-
1032 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n-
1033 (const PatchArray *)patchTable->GetVaryingPatchArrayBuffer(),
\n-
1034 (const int *)patchTable->GetVaryingPatchIndexBuffer(),
\n-
1035 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n-
1036 }
\n-
\n-
1037
\n-
1068 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1069 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1071 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1072 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1073 int numPatchCoords,
\n-
1074 PATCHCOORD_BUFFER *patchCoords,
\n-
1075 PATCH_TABLE *patchTable,
\n-
1076 int fvarChannel,
\n-
1077 CudaEvaluator const *instance,
\n-
1078 void * deviceContext = NULL) {
\n-
1079
\n-
1080 (void)instance; // unused
\n-
1081 (void)deviceContext; // unused
\n-
1082
\n-
1083 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
1084 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
1085 numPatchCoords,
\n-
1086 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n-
1087 (const PatchArray *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
1088 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1089 (const PatchParam *)patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1090 }
\n-
\n-
1091
\n-
1134 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1135 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1137 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1138 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1139 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1140 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1141 int numPatchCoords,
\n-
1142 PATCHCOORD_BUFFER *patchCoords,
\n-
1143 PATCH_TABLE *patchTable,
\n-
1144 int fvarChannel,
\n-
1145 CudaEvaluator const *instance,
\n-
1146 void * deviceContext = NULL) {
\n-
1147
\n-
1148 (void)instance; // unused
\n-
1149 (void)deviceContext; // unused
\n-
1150
\n-
1151 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
1152 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
1153 duBuffer->BindCudaBuffer(), duDesc,
\n-
1154 dvBuffer->BindCudaBuffer(), dvDesc,
\n-
1155 numPatchCoords,
\n-
1156 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n-
1157 (const PatchArray *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
1158 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1159 (const PatchParam *)patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1160 }
\n-
\n-
1161
\n-
1222 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1223 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1225 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1226 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1227 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1228 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1229 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1230 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1231 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1232 int numPatchCoords,
\n-
1233 PATCHCOORD_BUFFER *patchCoords,
\n-
1234 PATCH_TABLE *patchTable,
\n-
1235 int fvarChannel,
\n-
1236 CudaEvaluator const *instance,
\n-
1237 void * deviceContext = NULL) {
\n-
1238
\n-
1239 (void)instance; // unused
\n-
1240 (void)deviceContext; // unused
\n-
1241
\n-
1242 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n-
1243 dstBuffer->BindCudaBuffer(), dstDesc,
\n-
1244 duBuffer->BindCudaBuffer(), duDesc,
\n-
1245 dvBuffer->BindCudaBuffer(), dvDesc,
\n-
1246 duuBuffer->BindCudaBuffer(), duuDesc,
\n-
1247 duvBuffer->BindCudaBuffer(), duvDesc,
\n-
1248 dvvBuffer->BindCudaBuffer(), dvvDesc,
\n-
1249 numPatchCoords,
\n-
1250 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n-
1251 (const PatchArray *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
1252 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1253 (const PatchParam *)patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1254 }
\n-
\n-
1255
\n-
1261 static void Synchronize(void *deviceContext = NULL);
\n-
1262};
\n-
\n-
1263
\n-
1264
\n-
1265} // end namespace Osd
\n-
1266
\n-
1267} // end namespace OPENSUBDIV_VERSION
\n-
1268using namespace OPENSUBDIV_VERSION;
\n-
1269
\n-
1270} // end namespace OpenSubdiv
\n-
1271
\n-
1272
\n-
1273#endif // OPENSUBDIV3_OSD_CUDA_EVALUATOR_H
\n-\n-
Stencil table class wrapping the template for compatibility.
\n-
Limit stencil table class wrapping the template for compatibility.
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-\n-\n-\n-\n-\n-
CudaStencilTable(Far::LimitStencilTable const *limitStencilTable)
\n-\n-\n-\n-\n-
static CudaStencilTable * Create(Far::LimitStencilTable const *limitStencilTable, void *deviceContext=NULL)
\n-\n-\n-
CudaStencilTable(Far::StencilTable const *stencilTable)
\n-
static CudaStencilTable * Create(Far::StencilTable const *stencilTable, void *deviceContext=NULL)
\n-\n-
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const PatchCoord *patchCoords, const PatchArray *patchArrays, const int *patchIndices, const PatchParam *patchParams)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, const CudaEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n-
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, int start, int end)
Static eval stencils function which takes raw cuda buffers for input and output.
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const CudaEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n-
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndices, PatchParam const *patchParams)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, const void *instance=NULL, void *deviceContext=NULL)
Generic static compute function. This function has a same signature as other device kernels have so t...
\n-
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw cuda pointers for input and output.
\n-
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, const float *duuWeights, const float *duvWeights, const float *dvvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw cuda pointers for input and output.
\n-
static void Synchronize(void *deviceContext=NULL)
\n-
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndices, PatchParam const *patchParams)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
Coordinates set on a patch table.
Definition types.h:42
\n-\n-\n+
28#if defined(OPENSUBDIV_HAS_CLEW)
\n+
29# include <clew.h>
\n+
30#else
\n+
31# if defined(__APPLE__)
\n+
32# include <OpenCL/opencl.h>
\n+
33# else
\n+
34# include <CL/opencl.h>
\n+
35# endif
\n+
36#endif
\n+
37
\n+
38#endif // OPENSUBDIV3_OSD_CL_UTIL_H
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-cudaEvaluator.h\n+opencl.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2014 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,737 +24,25 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_CUDA_EVALUATOR_H\n-26#define OPENSUBDIV3_OSD_CUDA_EVALUATOR_H\n+25#ifndef OPENSUBDIV3_OSD_OPENCL_H\n+26#define OPENSUBDIV3_OSD_OPENCL_H\n 27\n-28#include \"../version.h\"\n-29\n-30#include \n-31#include \"../osd/bufferDescriptor.h\"\n-32#include \"../osd/types.h\"\n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Far {\n-38 class PatchTable;\n-39 class StencilTable;\n-40 class LimitStencilTable;\n-41}\n-42\n-43namespace Osd {\n-44\n-_\b5_\b2class _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n-53public:\n-_\b5_\b4 static _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-55 void *deviceContext = NULL) {\n-56 (void)deviceContext; // unused\n-57 return new _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable);\n-58 }\n-_\b5_\b9 static _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const\n-*limitStencilTable,\n-60 void *deviceContext = NULL) {\n-61 (void)deviceContext; // unused\n-62 return new _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(limitStencilTable);\n-63 }\n-64\n-_\b6_\b5 explicit _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable);\n-_\b6_\b6 explicit _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable);\n-_\b6_\b7 _\b~_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n-68\n-69 // interfaces needed for CudaCompute\n-_\b7_\b0 void *_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _sizes; }\n-_\b7_\b1 void *_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _offsets; }\n-_\b7_\b2 void *_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _indices; }\n-_\b7_\b3 void *_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _weights; }\n-_\b7_\b4 void *_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duWeights; }\n-_\b7_\b5 void *_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvWeights; }\n-_\b7_\b6 void *_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duuWeights; }\n-_\b7_\b7 void *_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duvWeights; }\n-_\b7_\b8 void *_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvvWeights; }\n-_\b7_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n-80\n-81private:\n-82 void * _sizes,\n-83 * _offsets,\n-84 * _indices,\n-85 * _weights,\n-86 * _duWeights,\n-87 * _dvWeights,\n-88 * _duuWeights,\n-89 * _duvWeights,\n-90 * _dvvWeights;\n-91 int _numStencils;\n-92};\n-93\n-_\b9_\b4class _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n-95public:\n-101\n-125 template \n-_\b1_\b2_\b6 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-127 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-128 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-129 STENCIL_TABLE const *stencilTable,\n-130 const void *instance = NULL,\n-131 void * deviceContext = NULL) {\n-132\n-133 (void)instance; // unused\n-134 (void)deviceContext; // unused\n-135 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-136 dstBuffer->BindCudaBuffer(), dstDesc,\n-137 (int const *)stencilTable->GetSizesBuffer(),\n-138 (int const *)stencilTable->GetOffsetsBuffer(),\n-139 (int const *)stencilTable->GetIndicesBuffer(),\n-140 (float const *)stencilTable->GetWeightsBuffer(),\n-141 /*start = */ 0,\n-142 /*end = */ stencilTable->GetNumStencils());\n-143 }\n-144\n-_\b1_\b7_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-172 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-173 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-174 const int * sizes,\n-175 const int * offsets,\n-176 const int * indices,\n-177 const float * weights,\n-178 int start, int end);\n-179\n-217 template \n-_\b2_\b1_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-219 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-220 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-221 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-222 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-223 STENCIL_TABLE const *stencilTable,\n-224 const _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n-225 void * deviceContext = NULL) {\n-226\n-227 (void)instance; // unused\n-228 (void)deviceContext; // unused\n-229\n-230 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-231 dstBuffer->BindCudaBuffer(), dstDesc,\n-232 duBuffer->BindCudaBuffer(), duDesc,\n-233 dvBuffer->BindCudaBuffer(), dvDesc,\n-234 (int const *)stencilTable->GetSizesBuffer(),\n-235 (int const *)stencilTable->GetOffsetsBuffer(),\n-236 (int const *)stencilTable->GetIndicesBuffer(),\n-237 (float const *)stencilTable->GetWeightsBuffer(),\n-238 (float const *)stencilTable->GetDuWeightsBuffer(),\n-239 (float const *)stencilTable->GetDvWeightsBuffer(),\n-240 /*start = */ 0,\n-241 /*end = */ stencilTable->GetNumStencils());\n-242 }\n-243\n-_\b2_\b8_\b4 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-285 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-286 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-287 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-288 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-289 const int * sizes,\n-290 const int * offsets,\n-291 const int * indices,\n-292 const float * weights,\n-293 const float * duWeights,\n-294 const float * dvWeights,\n-295 int start, int end);\n-296\n-352 template \n-_\b3_\b5_\b3 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-354 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-355 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-356 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-357 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-358 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-359 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-360 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-361 STENCIL_TABLE const *stencilTable,\n-362 const _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n-363 void * deviceContext = NULL) {\n-364\n-365 (void)instance; // unused\n-366 (void)deviceContext; // unused\n-367\n-368 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-369 dstBuffer->BindCudaBuffer(), dstDesc,\n-370 duBuffer->BindCudaBuffer(), duDesc,\n-371 dvBuffer->BindCudaBuffer(), dvDesc,\n-372 duuBuffer->BindCudaBuffer(), duuDesc,\n-373 duvBuffer->BindCudaBuffer(), duvDesc,\n-374 dvvBuffer->BindCudaBuffer(), dvvDesc,\n-375 (int const *)stencilTable->GetSizesBuffer(),\n-376 (int const *)stencilTable->GetOffsetsBuffer(),\n-377 (int const *)stencilTable->GetIndicesBuffer(),\n-378 (float const *)stencilTable->GetWeightsBuffer(),\n-379 (float const *)stencilTable->GetDuWeightsBuffer(),\n-380 (float const *)stencilTable->GetDvWeightsBuffer(),\n-381 (float const *)stencilTable->GetDuuWeightsBuffer(),\n-382 (float const *)stencilTable->GetDuvWeightsBuffer(),\n-383 (float const *)stencilTable->GetDvvWeightsBuffer(),\n-384 /*start = */ 0,\n-385 /*end = */ stencilTable->GetNumStencils());\n-386 }\n-387\n-_\b4_\b4_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-450 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-451 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-452 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-453 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-454 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-455 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-456 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-457 const int * sizes,\n-458 const int * offsets,\n-459 const int * indices,\n-460 const float * weights,\n-461 const float * duWeights,\n-462 const float * dvWeights,\n-463 const float * duuWeights,\n-464 const float * duvWeights,\n-465 const float * dvvWeights,\n-466 int start, int end);\n-467\n-473\n-502 template \n-_\b5_\b0_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-505 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-506 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-507 int numPatchCoords,\n-508 PATCHCOORD_BUFFER *patchCoords,\n-509 PATCH_TABLE *patchTable,\n-510 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-511 void * deviceContext = NULL) {\n-512\n-513 (void)instance; // unused\n-514 (void)deviceContext; // unused\n-515\n-516 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-517 dstBuffer->BindCudaBuffer(), dstDesc,\n-518 numPatchCoords,\n-519 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n-520 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetPatchArrayBuffer(),\n-521 (const int *)patchTable->GetPatchIndexBuffer(),\n-522 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n-523 }\n-524\n-563 template \n-_\b5_\b6_\b5 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-566 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-567 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-568 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-569 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-570 int numPatchCoords,\n-571 PATCHCOORD_BUFFER *patchCoords,\n-572 PATCH_TABLE *patchTable,\n-573 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-574 void * deviceContext = NULL) {\n-575\n-576 (void)instance; // unused\n-577 (void)deviceContext; // unused\n-578\n-579 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-580 dstBuffer->BindCudaBuffer(), dstDesc,\n-581 duBuffer->BindCudaBuffer(), duDesc,\n-582 dvBuffer->BindCudaBuffer(), dvDesc,\n-583 numPatchCoords,\n-584 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n-585 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetPatchArrayBuffer(),\n-586 (const int *)patchTable->GetPatchIndexBuffer(),\n-587 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n-588 }\n-589\n-646 template \n-_\b6_\b4_\b8 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-649 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-650 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-651 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-652 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-653 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-654 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-655 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-656 int numPatchCoords,\n-657 PATCHCOORD_BUFFER *patchCoords,\n-658 PATCH_TABLE *patchTable,\n-659 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-660 void * deviceContext = NULL) {\n-661\n-662 (void)instance; // unused\n-663 (void)deviceContext; // unused\n-664\n-665 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-666 dstBuffer->BindCudaBuffer(), dstDesc,\n-667 duBuffer->BindCudaBuffer(), duDesc,\n-668 dvBuffer->BindCudaBuffer(), dvDesc,\n-669 duuBuffer->BindCudaBuffer(), duuDesc,\n-670 duvBuffer->BindCudaBuffer(), duvDesc,\n-671 dvvBuffer->BindCudaBuffer(), dvvDesc,\n-672 numPatchCoords,\n-673 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n-674 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetPatchArrayBuffer(),\n-675 (const int *)patchTable->GetPatchIndexBuffer(),\n-676 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n-677 }\n-678\n-_\b7_\b0_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-707 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-708 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-709 int numPatchCoords,\n-710 const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *patchCoords,\n-711 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *patchArrays,\n-712 const int *patchIndices,\n-713 const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *patchParams);\n-714\n-_\b7_\b5_\b2 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-753 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-754 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-755 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-756 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-757 int numPatchCoords,\n-758 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n-759 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n-760 const int *patchIndices,\n-761 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParams);\n-762\n-_\b8_\b1_\b5 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-816 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-817 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-818 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-819 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-820 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-821 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-822 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-823 int numPatchCoords,\n-824 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n-825 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n-826 const int *patchIndices,\n-827 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParams);\n-828\n-857 template \n-_\b8_\b5_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-860 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-861 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-862 int numPatchCoords,\n-863 PATCHCOORD_BUFFER *patchCoords,\n-864 PATCH_TABLE *patchTable,\n-865 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-866 void * deviceContext = NULL) {\n-867\n-868 (void)instance; // unused\n-869 (void)deviceContext; // unused\n-870\n-871 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-872 dstBuffer->BindCudaBuffer(), dstDesc,\n-873 numPatchCoords,\n-874 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n-875 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetVaryingPatchArrayBuffer(),\n-876 (const int *)patchTable->GetVaryingPatchIndexBuffer(),\n-877 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n-878 }\n-879\n-920 template \n-_\b9_\b2_\b2 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-923 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-924 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-925 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-926 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-927 int numPatchCoords,\n-928 PATCHCOORD_BUFFER *patchCoords,\n-929 PATCH_TABLE *patchTable,\n-930 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-931 void * deviceContext = NULL) {\n-932\n-933 (void)instance; // unused\n-934 (void)deviceContext; // unused\n-935\n-936 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-937 dstBuffer->BindCudaBuffer(), dstDesc,\n-938 duBuffer->BindCudaBuffer(), duDesc,\n-939 dvBuffer->BindCudaBuffer(), dvDesc,\n-940 numPatchCoords,\n-941 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n-942 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetVaryingPatchArrayBuffer(),\n-943 (const int *)patchTable->GetVaryingPatchIndexBuffer(),\n-944 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n-945 }\n-946\n-1005 template \n-_\b1_\b0_\b0_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1008 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1009 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1010 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1011 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1012 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1013 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1014 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1015 int numPatchCoords,\n-1016 PATCHCOORD_BUFFER *patchCoords,\n-1017 PATCH_TABLE *patchTable,\n-1018 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1019 void * deviceContext = NULL) {\n-1020\n-1021 (void)instance; // unused\n-1022 (void)deviceContext; // unused\n-1023\n-1024 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-1025 dstBuffer->BindCudaBuffer(), dstDesc,\n-1026 duBuffer->BindCudaBuffer(), duDesc,\n-1027 dvBuffer->BindCudaBuffer(), dvDesc,\n-1028 duuBuffer->BindCudaBuffer(), duuDesc,\n-1029 duvBuffer->BindCudaBuffer(), duvDesc,\n-1030 dvvBuffer->BindCudaBuffer(), dvvDesc,\n-1031 numPatchCoords,\n-1032 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n-1033 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetVaryingPatchArrayBuffer(),\n-1034 (const int *)patchTable->GetVaryingPatchIndexBuffer(),\n-1035 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n-1036 }\n-1037\n-1068 template \n-_\b1_\b0_\b7_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1071 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1072 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1073 int numPatchCoords,\n-1074 PATCHCOORD_BUFFER *patchCoords,\n-1075 PATCH_TABLE *patchTable,\n-1076 int fvarChannel,\n-1077 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1078 void * deviceContext = NULL) {\n-1079\n-1080 (void)instance; // unused\n-1081 (void)deviceContext; // unused\n-1082\n-1083 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-1084 dstBuffer->BindCudaBuffer(), dstDesc,\n-1085 numPatchCoords,\n-1086 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n-1087 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-1088 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1089 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1090 }\n-1091\n-1134 template \n-_\b1_\b1_\b3_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1137 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1138 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1139 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1140 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1141 int numPatchCoords,\n-1142 PATCHCOORD_BUFFER *patchCoords,\n-1143 PATCH_TABLE *patchTable,\n-1144 int fvarChannel,\n-1145 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1146 void * deviceContext = NULL) {\n-1147\n-1148 (void)instance; // unused\n-1149 (void)deviceContext; // unused\n-1150\n-1151 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-1152 dstBuffer->BindCudaBuffer(), dstDesc,\n-1153 duBuffer->BindCudaBuffer(), duDesc,\n-1154 dvBuffer->BindCudaBuffer(), dvDesc,\n-1155 numPatchCoords,\n-1156 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n-1157 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-1158 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1159 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1160 }\n-1161\n-1222 template \n-_\b1_\b2_\b2_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1225 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1226 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1227 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1228 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1229 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1230 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1231 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1232 int numPatchCoords,\n-1233 PATCHCOORD_BUFFER *patchCoords,\n-1234 PATCH_TABLE *patchTable,\n-1235 int fvarChannel,\n-1236 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1237 void * deviceContext = NULL) {\n-1238\n-1239 (void)instance; // unused\n-1240 (void)deviceContext; // unused\n-1241\n-1242 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n-1243 dstBuffer->BindCudaBuffer(), dstDesc,\n-1244 duBuffer->BindCudaBuffer(), duDesc,\n-1245 dvBuffer->BindCudaBuffer(), dvDesc,\n-1246 duuBuffer->BindCudaBuffer(), duuDesc,\n-1247 duvBuffer->BindCudaBuffer(), duvDesc,\n-1248 dvvBuffer->BindCudaBuffer(), dvvDesc,\n-1249 numPatchCoords,\n-1250 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n-1251 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-1252 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1253 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1254 }\n-1255\n-_\b1_\b2_\b6_\b1 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(void *deviceContext = NULL);\n-1262};\n-1263\n-1264\n-1265} // end namespace Osd\n-1266\n-1267} // end namespace OPENSUBDIV_VERSION\n-1268using namespace OPENSUBDIV_VERSION;\n-1269\n-1270} // end namespace OpenSubdiv\n-1271\n-1272\n-1273#endif // OPENSUBDIV3_OSD_CUDA_EVALUATOR_H\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Limit stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-BufferDescriptor is a struct which describes buffer elements in interleaved\n-data buffers....\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-CUDA stencil table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-void * GetDuvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-~CudaStencilTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-void * GetDuWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-void * GetDvvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-void * GetOffsetsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-CudaStencilTable(Far::LimitStencilTable const *limitStencilTable)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-void * GetDvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-int GetNumStencils() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-void * GetDuuWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-void * GetWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CudaStencilTable * Create(Far::LimitStencilTable const\n-*limitStencilTable, void *deviceContext=NULL)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n-void * GetSizesBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n-void * GetIndicesBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-CudaStencilTable(Far::StencilTable const *stencilTable)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CudaStencilTable * Create(Far::StencilTable const *stencilTable, void\n-*deviceContext=NULL)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const\n-PatchCoord *patchCoords, const PatchArray *patchArrays, const int\n-*patchIndices, const PatchParam *patchParams)\n-Static limit eval function. It takes an array of PatchCoord and evaluate limit\n-values on given PatchT...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void\n-*deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b2_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void\n-*deviceContext=NULL)\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n-const CudaEvaluator *instance=NULL, void *deviceContext=NULL)\n-Generic static eval stencils function with derivatives. This function has a\n-same signature as other d...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int\n-*offsets, const int *indices, const float *weights, int start, int end)\n-Static eval stencils function which takes raw cuda buffers for input and\n-output.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n-CudaEvaluator const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const\n-CudaEvaluator *instance=NULL, void *deviceContext=NULL)\n-Generic static eval stencils function with derivatives. This function has a\n-same signature as other d...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n-BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n-float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord\n-const *patchCoords, PatchArray const *patchArrays, const int *patchIndices,\n-PatchParam const *patchParams)\n-Static limit eval function. It takes an array of PatchCoord and evaluate limit\n-values on given PatchT...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CudaEvaluator const\n-*instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b3_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n-const *stencilTable, const void *instance=NULL, void *deviceContext=NULL)\n-Generic static compute function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int\n-*offsets, const int *indices, const float *weights, const float *duWeights,\n-const float *dvWeights, int start, int end)\n-Static eval stencils function with derivatives, which takes raw cuda pointers\n-for input and output.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n-BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n-float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int\n-*offsets, const int *indices, const float *weights, const float *duWeights,\n-const float *dvWeights, const float *duuWeights, const float *duvWeights, const\n-float *dvvWeights, int start, int end)\n-Static eval stencils function with derivatives, which takes raw cuda pointers\n-for input and output.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(void *deviceContext=NULL)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords,\n-PatchCoord const *patchCoords, PatchArray const *patchArrays, const int\n-*patchIndices, PatchParam const *patchParams)\n-Static limit eval function. It takes an array of PatchCoord and evaluate limit\n-values on given PatchT...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const\n-*instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const\n-*instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b0_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n-CudaEvaluator const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b2_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n-fvarChannel, CudaEvaluator const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b7_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd\n-Coordinates set on a patch table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b2_\b7\n+28#if defined(OPENSUBDIV_HAS_CLEW)\n+29# include \n+30#else\n+31# if defined(__APPLE__)\n+32# include \n+33# else\n+34# include \n+35# endif\n+36#endif\n+37\n+38#endif // OPENSUBDIV3_OSD_CL_UTIL_H\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00794.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00794.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/clVertexBuffer.h File Reference\n+OpenSubdiv: opensubdiv/osd/cudaEvaluator.h File Reference\n \n \n \n \n \n \n \n@@ -90,41 +90,47 @@\n \n \n \n
\n \n-
clVertexBuffer.h File Reference
\n+
cudaEvaluator.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../osd/opencl.h"
\n+#include <vector>
\n+#include "../osd/bufferDescriptor.h"
\n+#include "../osd/types.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n \n

\n Classes

class  CLVertexBuffer
 Concrete vertex buffer class for OpenCL subdivision. More...
class  CudaStencilTable
 CUDA stencil table. More...
 
class  CudaEvaluator
 
\n \n \n \n \n \n+\n+\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,24 +1,30 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-clVertexBuffer.h File Reference\n+cudaEvaluator.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\"\n+#include \n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-\u00a0 Concrete vertex buffer class for OpenCL subdivision. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+\u00a0 CUDA stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n+\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00794.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00794.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,4 @@\n var a00794 = [\n- [\"CLVertexBuffer\", \"a01149.html\", \"a01149\"]\n+ [\"CudaStencilTable\", \"a01173.html\", \"a01173\"],\n+ [\"CudaEvaluator\", \"a01177.html\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00794_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00794_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/clVertexBuffer.h Source File\n+OpenSubdiv: opensubdiv/osd/cudaEvaluator.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
clVertexBuffer.h
\n+
cudaEvaluator.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,95 +119,582 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H
\n-
26#define OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H
\n+
25#ifndef OPENSUBDIV3_OSD_CUDA_EVALUATOR_H
\n+
26#define OPENSUBDIV3_OSD_CUDA_EVALUATOR_H
\n
27
\n
28#include "../version.h"
\n-
29#include "../osd/opencl.h"
\n-
30
\n-
31namespace OpenSubdiv {
\n-
32namespace OPENSUBDIV_VERSION {
\n+
29
\n+
30#include <vector>
\n+
31#include "../osd/bufferDescriptor.h"
\n+
32#include "../osd/types.h"
\n
33
\n-
34namespace Osd {
\n-
35
\n-
\n-\n-
43
\n-
44public:
\n-
46 static CLVertexBuffer * Create(int numElements, int numVertices, cl_context clContext);
\n-
47
\n-
48 template <typename DEVICE_CONTEXT>
\n-
\n-
49 static CLVertexBuffer * Create(int numElements, int numVertices,
\n-
50 DEVICE_CONTEXT context) {
\n-
51 return Create(numElements, numVertices, context->GetContext());
\n-
52 }
\n-
\n-
53
\n-\n-
56
\n-
59 void UpdateData(const float *src, int startVertex, int numVertices, cl_command_queue clQueue,
\n-
60 cl_event* startEvents = NULL, unsigned int numStartEvents = 0, cl_event* endEvent = NULL);
\n-
61
\n-
62 template<typename DEVICE_CONTEXT>
\n-
\n-
63 void UpdateData(const float *src, int startVertex, int numVertices,
\n-
64 DEVICE_CONTEXT context,
\n-
65 cl_event* startEvents = NULL, unsigned int numStartEvents = 0, cl_event* endEvent = NULL) {
\n-
66 UpdateData(src, startVertex, numVertices, context->GetCommandQueue(), startEvents, numStartEvents, endEvent);
\n-
67 }
\n-
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Far {
\n+
38 class PatchTable;
\n+
39 class StencilTable;
\n+
40 class LimitStencilTable;
\n+
41}
\n+
42
\n+
43namespace Osd {
\n+
44
\n+
\n+\n+
53public:
\n+
\n+
54 static CudaStencilTable *Create(Far::StencilTable const *stencilTable,
\n+
55 void *deviceContext = NULL) {
\n+
56 (void)deviceContext; // unused
\n+
57 return new CudaStencilTable(stencilTable);
\n+
58 }
\n+
\n+
\n+
59 static CudaStencilTable *Create(Far::LimitStencilTable const *limitStencilTable,
\n+
60 void *deviceContext = NULL) {
\n+
61 (void)deviceContext; // unused
\n+
62 return new CudaStencilTable(limitStencilTable);
\n+
63 }
\n+
\n+
64
\n+
65 explicit CudaStencilTable(Far::StencilTable const *stencilTable);
\n+
66 explicit CudaStencilTable(Far::LimitStencilTable const *limitStencilTable);
\n+\n
68
\n-
70 int GetNumElements() const;
\n-
71
\n-
73 int GetNumVertices() const;
\n-
74
\n-
76 cl_mem BindCLBuffer(cl_command_queue queue);
\n-
77
\n-
78protected:
\n-
80 CLVertexBuffer(int numElements, int numVertices, cl_context clContext);
\n-
81
\n-
84 bool allocate(cl_context clContext);
\n-
85
\n-
86private:
\n-
87 int _numElements;
\n-
88 int _numVertices;
\n-
89 cl_mem _clMemory;
\n-
90};
\n+
69 // interfaces needed for CudaCompute
\n+
70 void *GetSizesBuffer() const { return _sizes; }
\n+
71 void *GetOffsetsBuffer() const { return _offsets; }
\n+
72 void *GetIndicesBuffer() const { return _indices; }
\n+
73 void *GetWeightsBuffer() const { return _weights; }
\n+
74 void *GetDuWeightsBuffer() const { return _duWeights; }
\n+
75 void *GetDvWeightsBuffer() const { return _dvWeights; }
\n+
76 void *GetDuuWeightsBuffer() const { return _duuWeights; }
\n+
77 void *GetDuvWeightsBuffer() const { return _duvWeights; }
\n+
78 void *GetDvvWeightsBuffer() const { return _dvvWeights; }
\n+
79 int GetNumStencils() const { return _numStencils; }
\n+
80
\n+
81private:
\n+
82 void * _sizes,
\n+
83 * _offsets,
\n+
84 * _indices,
\n+
85 * _weights,
\n+
86 * _duWeights,
\n+
87 * _dvWeights,
\n+
88 * _duuWeights,
\n+
89 * _duvWeights,
\n+
90 * _dvvWeights;
\n+
91 int _numStencils;
\n+
92};
\n
\n-
91
\n-
92} // end namespace Osd
\n
93
\n-
94} // end namespace OPENSUBDIV_VERSION
\n-
95using namespace OPENSUBDIV_VERSION;
\n-
96
\n-
97} // end namespace OpenSubdiv
\n-
98
\n-
99#endif // OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H
\n+
\n+\n+
95public:
\n+
101
\n+
125 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
126 static bool EvalStencils(
\n+
127 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
128 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
129 STENCIL_TABLE const *stencilTable,
\n+
130 const void *instance = NULL,
\n+
131 void * deviceContext = NULL) {
\n+
132
\n+
133 (void)instance; // unused
\n+
134 (void)deviceContext; // unused
\n+
135 return EvalStencils(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
136 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
137 (int const *)stencilTable->GetSizesBuffer(),
\n+
138 (int const *)stencilTable->GetOffsetsBuffer(),
\n+
139 (int const *)stencilTable->GetIndicesBuffer(),
\n+
140 (float const *)stencilTable->GetWeightsBuffer(),
\n+
141 /*start = */ 0,
\n+
142 /*end = */ stencilTable->GetNumStencils());
\n+
143 }
\n+
\n+
144
\n+
171 static bool EvalStencils(
\n+
172 const float *src, BufferDescriptor const &srcDesc,
\n+
173 float *dst, BufferDescriptor const &dstDesc,
\n+
174 const int * sizes,
\n+
175 const int * offsets,
\n+
176 const int * indices,
\n+
177 const float * weights,
\n+
178 int start, int end);
\n+
179
\n+
217 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
218 static bool EvalStencils(
\n+
219 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
220 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
221 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
222 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
223 STENCIL_TABLE const *stencilTable,
\n+
224 const CudaEvaluator *instance = NULL,
\n+
225 void * deviceContext = NULL) {
\n+
226
\n+
227 (void)instance; // unused
\n+
228 (void)deviceContext; // unused
\n+
229
\n+
230 return EvalStencils(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
231 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
232 duBuffer->BindCudaBuffer(), duDesc,
\n+
233 dvBuffer->BindCudaBuffer(), dvDesc,
\n+
234 (int const *)stencilTable->GetSizesBuffer(),
\n+
235 (int const *)stencilTable->GetOffsetsBuffer(),
\n+
236 (int const *)stencilTable->GetIndicesBuffer(),
\n+
237 (float const *)stencilTable->GetWeightsBuffer(),
\n+
238 (float const *)stencilTable->GetDuWeightsBuffer(),
\n+
239 (float const *)stencilTable->GetDvWeightsBuffer(),
\n+
240 /*start = */ 0,
\n+
241 /*end = */ stencilTable->GetNumStencils());
\n+
242 }
\n+
\n+
243
\n+
284 static bool EvalStencils(
\n+
285 const float *src, BufferDescriptor const &srcDesc,
\n+
286 float *dst, BufferDescriptor const &dstDesc,
\n+
287 float *du, BufferDescriptor const &duDesc,
\n+
288 float *dv, BufferDescriptor const &dvDesc,
\n+
289 const int * sizes,
\n+
290 const int * offsets,
\n+
291 const int * indices,
\n+
292 const float * weights,
\n+
293 const float * duWeights,
\n+
294 const float * dvWeights,
\n+
295 int start, int end);
\n+
296
\n+
352 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
353 static bool EvalStencils(
\n+
354 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
355 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
356 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
357 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
358 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
359 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
360 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
361 STENCIL_TABLE const *stencilTable,
\n+
362 const CudaEvaluator *instance = NULL,
\n+
363 void * deviceContext = NULL) {
\n+
364
\n+
365 (void)instance; // unused
\n+
366 (void)deviceContext; // unused
\n+
367
\n+
368 return EvalStencils(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
369 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
370 duBuffer->BindCudaBuffer(), duDesc,
\n+
371 dvBuffer->BindCudaBuffer(), dvDesc,
\n+
372 duuBuffer->BindCudaBuffer(), duuDesc,
\n+
373 duvBuffer->BindCudaBuffer(), duvDesc,
\n+
374 dvvBuffer->BindCudaBuffer(), dvvDesc,
\n+
375 (int const *)stencilTable->GetSizesBuffer(),
\n+
376 (int const *)stencilTable->GetOffsetsBuffer(),
\n+
377 (int const *)stencilTable->GetIndicesBuffer(),
\n+
378 (float const *)stencilTable->GetWeightsBuffer(),
\n+
379 (float const *)stencilTable->GetDuWeightsBuffer(),
\n+
380 (float const *)stencilTable->GetDvWeightsBuffer(),
\n+
381 (float const *)stencilTable->GetDuuWeightsBuffer(),
\n+
382 (float const *)stencilTable->GetDuvWeightsBuffer(),
\n+
383 (float const *)stencilTable->GetDvvWeightsBuffer(),
\n+
384 /*start = */ 0,
\n+
385 /*end = */ stencilTable->GetNumStencils());
\n+
386 }
\n+
\n+
387
\n+
449 static bool EvalStencils(
\n+
450 const float *src, BufferDescriptor const &srcDesc,
\n+
451 float *dst, BufferDescriptor const &dstDesc,
\n+
452 float *du, BufferDescriptor const &duDesc,
\n+
453 float *dv, BufferDescriptor const &dvDesc,
\n+
454 float *duu, BufferDescriptor const &duuDesc,
\n+
455 float *duv, BufferDescriptor const &duvDesc,
\n+
456 float *dvv, BufferDescriptor const &dvvDesc,
\n+
457 const int * sizes,
\n+
458 const int * offsets,
\n+
459 const int * indices,
\n+
460 const float * weights,
\n+
461 const float * duWeights,
\n+
462 const float * dvWeights,
\n+
463 const float * duuWeights,
\n+
464 const float * duvWeights,
\n+
465 const float * dvvWeights,
\n+
466 int start, int end);
\n+
467
\n+
473
\n+
502 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
503 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
504 static bool EvalPatches(
\n+
505 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
506 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
507 int numPatchCoords,
\n+
508 PATCHCOORD_BUFFER *patchCoords,
\n+
509 PATCH_TABLE *patchTable,
\n+
510 CudaEvaluator const *instance,
\n+
511 void * deviceContext = NULL) {
\n+
512
\n+
513 (void)instance; // unused
\n+
514 (void)deviceContext; // unused
\n+
515
\n+
516 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
517 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
518 numPatchCoords,
\n+
519 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n+
520 (const PatchArray *)patchTable->GetPatchArrayBuffer(),
\n+
521 (const int *)patchTable->GetPatchIndexBuffer(),
\n+
522 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n+
523 }
\n+
\n+
524
\n+
563 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
564 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
565 static bool EvalPatches(
\n+
566 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
567 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
568 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
569 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
570 int numPatchCoords,
\n+
571 PATCHCOORD_BUFFER *patchCoords,
\n+
572 PATCH_TABLE *patchTable,
\n+
573 CudaEvaluator const *instance,
\n+
574 void * deviceContext = NULL) {
\n+
575
\n+
576 (void)instance; // unused
\n+
577 (void)deviceContext; // unused
\n+
578
\n+
579 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
580 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
581 duBuffer->BindCudaBuffer(), duDesc,
\n+
582 dvBuffer->BindCudaBuffer(), dvDesc,
\n+
583 numPatchCoords,
\n+
584 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n+
585 (const PatchArray *)patchTable->GetPatchArrayBuffer(),
\n+
586 (const int *)patchTable->GetPatchIndexBuffer(),
\n+
587 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n+
588 }
\n+
\n+
589
\n+
646 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
647 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
648 static bool EvalPatches(
\n+
649 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
650 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
651 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
652 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
653 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
654 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
655 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
656 int numPatchCoords,
\n+
657 PATCHCOORD_BUFFER *patchCoords,
\n+
658 PATCH_TABLE *patchTable,
\n+
659 CudaEvaluator const *instance,
\n+
660 void * deviceContext = NULL) {
\n+
661
\n+
662 (void)instance; // unused
\n+
663 (void)deviceContext; // unused
\n+
664
\n+
665 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
666 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
667 duBuffer->BindCudaBuffer(), duDesc,
\n+
668 dvBuffer->BindCudaBuffer(), dvDesc,
\n+
669 duuBuffer->BindCudaBuffer(), duuDesc,
\n+
670 duvBuffer->BindCudaBuffer(), duvDesc,
\n+
671 dvvBuffer->BindCudaBuffer(), dvvDesc,
\n+
672 numPatchCoords,
\n+
673 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n+
674 (const PatchArray *)patchTable->GetPatchArrayBuffer(),
\n+
675 (const int *)patchTable->GetPatchIndexBuffer(),
\n+
676 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n+
677 }
\n+
\n+
678
\n+
706 static bool EvalPatches(
\n+
707 const float *src, BufferDescriptor const &srcDesc,
\n+
708 float *dst, BufferDescriptor const &dstDesc,
\n+
709 int numPatchCoords,
\n+
710 const PatchCoord *patchCoords,
\n+
711 const PatchArray *patchArrays,
\n+
712 const int *patchIndices,
\n+
713 const PatchParam *patchParams);
\n+
714
\n+
752 static bool EvalPatches(
\n+
753 const float *src, BufferDescriptor const &srcDesc,
\n+
754 float *dst, BufferDescriptor const &dstDesc,
\n+
755 float *du, BufferDescriptor const &duDesc,
\n+
756 float *dv, BufferDescriptor const &dvDesc,
\n+
757 int numPatchCoords,
\n+
758 PatchCoord const *patchCoords,
\n+
759 PatchArray const *patchArrays,
\n+
760 const int *patchIndices,
\n+
761 PatchParam const *patchParams);
\n+
762
\n+
815 static bool EvalPatches(
\n+
816 const float *src, BufferDescriptor const &srcDesc,
\n+
817 float *dst, BufferDescriptor const &dstDesc,
\n+
818 float *du, BufferDescriptor const &duDesc,
\n+
819 float *dv, BufferDescriptor const &dvDesc,
\n+
820 float *duu, BufferDescriptor const &duuDesc,
\n+
821 float *duv, BufferDescriptor const &duvDesc,
\n+
822 float *dvv, BufferDescriptor const &dvvDesc,
\n+
823 int numPatchCoords,
\n+
824 PatchCoord const *patchCoords,
\n+
825 PatchArray const *patchArrays,
\n+
826 const int *patchIndices,
\n+
827 PatchParam const *patchParams);
\n+
828
\n+
857 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
858 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
860 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
861 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
862 int numPatchCoords,
\n+
863 PATCHCOORD_BUFFER *patchCoords,
\n+
864 PATCH_TABLE *patchTable,
\n+
865 CudaEvaluator const *instance,
\n+
866 void * deviceContext = NULL) {
\n+
867
\n+
868 (void)instance; // unused
\n+
869 (void)deviceContext; // unused
\n+
870
\n+
871 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
872 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
873 numPatchCoords,
\n+
874 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n+
875 (const PatchArray *)patchTable->GetVaryingPatchArrayBuffer(),
\n+
876 (const int *)patchTable->GetVaryingPatchIndexBuffer(),
\n+
877 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n+
878 }
\n+
\n+
879
\n+
920 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
921 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
923 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
924 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
925 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
926 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
927 int numPatchCoords,
\n+
928 PATCHCOORD_BUFFER *patchCoords,
\n+
929 PATCH_TABLE *patchTable,
\n+
930 CudaEvaluator const *instance,
\n+
931 void * deviceContext = NULL) {
\n+
932
\n+
933 (void)instance; // unused
\n+
934 (void)deviceContext; // unused
\n+
935
\n+
936 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
937 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
938 duBuffer->BindCudaBuffer(), duDesc,
\n+
939 dvBuffer->BindCudaBuffer(), dvDesc,
\n+
940 numPatchCoords,
\n+
941 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n+
942 (const PatchArray *)patchTable->GetVaryingPatchArrayBuffer(),
\n+
943 (const int *)patchTable->GetVaryingPatchIndexBuffer(),
\n+
944 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n+
945 }
\n+
\n+
946
\n+
1005 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1006 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1008 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1009 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1010 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1011 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1012 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1013 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1014 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1015 int numPatchCoords,
\n+
1016 PATCHCOORD_BUFFER *patchCoords,
\n+
1017 PATCH_TABLE *patchTable,
\n+
1018 CudaEvaluator const *instance,
\n+
1019 void * deviceContext = NULL) {
\n+
1020
\n+
1021 (void)instance; // unused
\n+
1022 (void)deviceContext; // unused
\n+
1023
\n+
1024 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
1025 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
1026 duBuffer->BindCudaBuffer(), duDesc,
\n+
1027 dvBuffer->BindCudaBuffer(), dvDesc,
\n+
1028 duuBuffer->BindCudaBuffer(), duuDesc,
\n+
1029 duvBuffer->BindCudaBuffer(), duvDesc,
\n+
1030 dvvBuffer->BindCudaBuffer(), dvvDesc,
\n+
1031 numPatchCoords,
\n+
1032 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n+
1033 (const PatchArray *)patchTable->GetVaryingPatchArrayBuffer(),
\n+
1034 (const int *)patchTable->GetVaryingPatchIndexBuffer(),
\n+
1035 (const PatchParam *)patchTable->GetPatchParamBuffer());
\n+
1036 }
\n+
\n+
1037
\n+
1068 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1069 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1071 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1072 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1073 int numPatchCoords,
\n+
1074 PATCHCOORD_BUFFER *patchCoords,
\n+
1075 PATCH_TABLE *patchTable,
\n+
1076 int fvarChannel,
\n+
1077 CudaEvaluator const *instance,
\n+
1078 void * deviceContext = NULL) {
\n+
1079
\n+
1080 (void)instance; // unused
\n+
1081 (void)deviceContext; // unused
\n+
1082
\n+
1083 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
1084 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
1085 numPatchCoords,
\n+
1086 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n+
1087 (const PatchArray *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
1088 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1089 (const PatchParam *)patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1090 }
\n+
\n+
1091
\n+
1134 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1135 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1137 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1138 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1139 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1140 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1141 int numPatchCoords,
\n+
1142 PATCHCOORD_BUFFER *patchCoords,
\n+
1143 PATCH_TABLE *patchTable,
\n+
1144 int fvarChannel,
\n+
1145 CudaEvaluator const *instance,
\n+
1146 void * deviceContext = NULL) {
\n+
1147
\n+
1148 (void)instance; // unused
\n+
1149 (void)deviceContext; // unused
\n+
1150
\n+
1151 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
1152 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
1153 duBuffer->BindCudaBuffer(), duDesc,
\n+
1154 dvBuffer->BindCudaBuffer(), dvDesc,
\n+
1155 numPatchCoords,
\n+
1156 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n+
1157 (const PatchArray *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
1158 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1159 (const PatchParam *)patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1160 }
\n+
\n+
1161
\n+
1222 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1223 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1225 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1226 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1227 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1228 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1229 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1230 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1231 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1232 int numPatchCoords,
\n+
1233 PATCHCOORD_BUFFER *patchCoords,
\n+
1234 PATCH_TABLE *patchTable,
\n+
1235 int fvarChannel,
\n+
1236 CudaEvaluator const *instance,
\n+
1237 void * deviceContext = NULL) {
\n+
1238
\n+
1239 (void)instance; // unused
\n+
1240 (void)deviceContext; // unused
\n+
1241
\n+
1242 return EvalPatches(srcBuffer->BindCudaBuffer(), srcDesc,
\n+
1243 dstBuffer->BindCudaBuffer(), dstDesc,
\n+
1244 duBuffer->BindCudaBuffer(), duDesc,
\n+
1245 dvBuffer->BindCudaBuffer(), dvDesc,
\n+
1246 duuBuffer->BindCudaBuffer(), duuDesc,
\n+
1247 duvBuffer->BindCudaBuffer(), duvDesc,
\n+
1248 dvvBuffer->BindCudaBuffer(), dvvDesc,
\n+
1249 numPatchCoords,
\n+
1250 (const PatchCoord *)patchCoords->BindCudaBuffer(),
\n+
1251 (const PatchArray *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
1252 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1253 (const PatchParam *)patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1254 }
\n+
\n+
1255
\n+
1261 static void Synchronize(void *deviceContext = NULL);
\n+
1262};
\n+
\n+
1263
\n+
1264
\n+
1265} // end namespace Osd
\n+
1266
\n+
1267} // end namespace OPENSUBDIV_VERSION
\n+
1268using namespace OPENSUBDIV_VERSION;
\n+
1269
\n+
1270} // end namespace OpenSubdiv
\n+
1271
\n+
1272
\n+
1273#endif // OPENSUBDIV3_OSD_CUDA_EVALUATOR_H
\n \n-
Concrete vertex buffer class for OpenCL subdivision.
\n-
void UpdateData(const float *src, int startVertex, int numVertices, DEVICE_CONTEXT context, cl_event *startEvents=NULL, unsigned int numStartEvents=0, cl_event *endEvent=NULL)
\n-\n-
CLVertexBuffer(int numElements, int numVertices, cl_context clContext)
Constructor.
\n-
void UpdateData(const float *src, int startVertex, int numVertices, cl_command_queue clQueue, cl_event *startEvents=NULL, unsigned int numStartEvents=0, cl_event *endEvent=NULL)
\n-
int GetNumElements() const
Returns how many elements defined in this vertex buffer.
\n-\n-
int GetNumVertices() const
Returns how many vertices allocated in this vertex buffer.
\n-
static CLVertexBuffer * Create(int numElements, int numVertices, cl_context clContext)
Creator. Returns NULL if error.
\n-
static CLVertexBuffer * Create(int numElements, int numVertices, DEVICE_CONTEXT context)
\n-
cl_mem BindCLBuffer(cl_command_queue queue)
Returns the CL memory object.
\n+
Stencil table class wrapping the template for compatibility.
\n+
Limit stencil table class wrapping the template for compatibility.
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+\n+\n+\n+\n+\n+
CudaStencilTable(Far::LimitStencilTable const *limitStencilTable)
\n+\n+\n+\n+\n+
static CudaStencilTable * Create(Far::LimitStencilTable const *limitStencilTable, void *deviceContext=NULL)
\n+\n+\n+
CudaStencilTable(Far::StencilTable const *stencilTable)
\n+
static CudaStencilTable * Create(Far::StencilTable const *stencilTable, void *deviceContext=NULL)
\n+\n+
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const PatchCoord *patchCoords, const PatchArray *patchArrays, const int *patchIndices, const PatchParam *patchParams)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, const CudaEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n+
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, int start, int end)
Static eval stencils function which takes raw cuda buffers for input and output.
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const CudaEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n+
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndices, PatchParam const *patchParams)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, const void *instance=NULL, void *deviceContext=NULL)
Generic static compute function. This function has a same signature as other device kernels have so t...
\n+
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw cuda pointers for input and output.
\n+
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, const float *duuWeights, const float *duvWeights, const float *dvvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw cuda pointers for input and output.
\n+
static void Synchronize(void *deviceContext=NULL)
\n+
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndices, PatchParam const *patchParams)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CudaEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
Coordinates set on a patch table.
Definition types.h:42
\n+\n+\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-clVertexBuffer.h\n+cudaEvaluator.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,114 +24,737 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H\n-26#define OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H\n+25#ifndef OPENSUBDIV3_OSD_CUDA_EVALUATOR_H\n+26#define OPENSUBDIV3_OSD_CUDA_EVALUATOR_H\n 27\n 28#include \"../version.h\"\n-29#include \"../osd/opencl.h\"\n-30\n-31namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-32namespace OPENSUBDIV_VERSION {\n+29\n+30#include \n+31#include \"../osd/bufferDescriptor.h\"\n+32#include \"../osd/types.h\"\n 33\n-34namespace Osd {\n-35\n-_\b4_\b2class _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n-43\n-44public:\n-_\b4_\b6 static _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices, cl_context\n-clContext);\n-47\n-48 template \n-_\b4_\b9 static _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n-50 DEVICE_CONTEXT context) {\n-51 return _\bC_\br_\be_\ba_\bt_\be(numElements, numVertices, context->GetContext());\n-52 }\n-53\n-_\b5_\b5 _\b~_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br();\n-56\n-_\b5_\b9 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n-cl_command_queue clQueue,\n-60 cl_event* startEvents = NULL, unsigned int numStartEvents = 0, cl_event*\n-endEvent = NULL);\n-61\n-62 template\n-_\b6_\b3 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n-64 DEVICE_CONTEXT context,\n-65 cl_event* startEvents = NULL, unsigned int numStartEvents = 0, cl_event*\n-endEvent = NULL) {\n-66 _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(src, startVertex, numVertices, context->GetCommandQueue(),\n-startEvents, numStartEvents, endEvent);\n-67 }\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Far {\n+38 class PatchTable;\n+39 class StencilTable;\n+40 class LimitStencilTable;\n+41}\n+42\n+43namespace Osd {\n+44\n+_\b5_\b2class _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n+53public:\n+_\b5_\b4 static _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+55 void *deviceContext = NULL) {\n+56 (void)deviceContext; // unused\n+57 return new _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable);\n+58 }\n+_\b5_\b9 static _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const\n+*limitStencilTable,\n+60 void *deviceContext = NULL) {\n+61 (void)deviceContext; // unused\n+62 return new _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(limitStencilTable);\n+63 }\n+64\n+_\b6_\b5 explicit _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable);\n+_\b6_\b6 explicit _\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable);\n+_\b6_\b7 _\b~_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n 68\n-_\b7_\b0 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const;\n-71\n-_\b7_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n-74\n-_\b7_\b6 cl_mem _\bB_\bi_\bn_\bd_\bC_\bL_\bB_\bu_\bf_\bf_\be_\br(cl_command_queue queue);\n-77\n-78protected:\n-_\b8_\b0 _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices, cl_context clContext);\n-81\n-_\b8_\b4 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(cl_context clContext);\n-85\n-86private:\n-87 int _numElements;\n-88 int _numVertices;\n-89 cl_mem _clMemory;\n-90};\n-91\n-92} // end namespace Osd\n+69 // interfaces needed for CudaCompute\n+_\b7_\b0 void *_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _sizes; }\n+_\b7_\b1 void *_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _offsets; }\n+_\b7_\b2 void *_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _indices; }\n+_\b7_\b3 void *_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _weights; }\n+_\b7_\b4 void *_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duWeights; }\n+_\b7_\b5 void *_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvWeights; }\n+_\b7_\b6 void *_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duuWeights; }\n+_\b7_\b7 void *_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duvWeights; }\n+_\b7_\b8 void *_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvvWeights; }\n+_\b7_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n+80\n+81private:\n+82 void * _sizes,\n+83 * _offsets,\n+84 * _indices,\n+85 * _weights,\n+86 * _duWeights,\n+87 * _dvWeights,\n+88 * _duuWeights,\n+89 * _duvWeights,\n+90 * _dvvWeights;\n+91 int _numStencils;\n+92};\n 93\n-94} // end namespace OPENSUBDIV_VERSION\n-95using namespace OPENSUBDIV_VERSION;\n-96\n-97} // end namespace OpenSubdiv\n-98\n-99#endif // OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H\n+_\b9_\b4class _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n+95public:\n+101\n+125 template \n+_\b1_\b2_\b6 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+127 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+128 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+129 STENCIL_TABLE const *stencilTable,\n+130 const void *instance = NULL,\n+131 void * deviceContext = NULL) {\n+132\n+133 (void)instance; // unused\n+134 (void)deviceContext; // unused\n+135 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+136 dstBuffer->BindCudaBuffer(), dstDesc,\n+137 (int const *)stencilTable->GetSizesBuffer(),\n+138 (int const *)stencilTable->GetOffsetsBuffer(),\n+139 (int const *)stencilTable->GetIndicesBuffer(),\n+140 (float const *)stencilTable->GetWeightsBuffer(),\n+141 /*start = */ 0,\n+142 /*end = */ stencilTable->GetNumStencils());\n+143 }\n+144\n+_\b1_\b7_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+172 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+173 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+174 const int * sizes,\n+175 const int * offsets,\n+176 const int * indices,\n+177 const float * weights,\n+178 int start, int end);\n+179\n+217 template \n+_\b2_\b1_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+219 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+220 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+221 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+222 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+223 STENCIL_TABLE const *stencilTable,\n+224 const _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n+225 void * deviceContext = NULL) {\n+226\n+227 (void)instance; // unused\n+228 (void)deviceContext; // unused\n+229\n+230 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+231 dstBuffer->BindCudaBuffer(), dstDesc,\n+232 duBuffer->BindCudaBuffer(), duDesc,\n+233 dvBuffer->BindCudaBuffer(), dvDesc,\n+234 (int const *)stencilTable->GetSizesBuffer(),\n+235 (int const *)stencilTable->GetOffsetsBuffer(),\n+236 (int const *)stencilTable->GetIndicesBuffer(),\n+237 (float const *)stencilTable->GetWeightsBuffer(),\n+238 (float const *)stencilTable->GetDuWeightsBuffer(),\n+239 (float const *)stencilTable->GetDvWeightsBuffer(),\n+240 /*start = */ 0,\n+241 /*end = */ stencilTable->GetNumStencils());\n+242 }\n+243\n+_\b2_\b8_\b4 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+285 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+286 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+287 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+288 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+289 const int * sizes,\n+290 const int * offsets,\n+291 const int * indices,\n+292 const float * weights,\n+293 const float * duWeights,\n+294 const float * dvWeights,\n+295 int start, int end);\n+296\n+352 template \n+_\b3_\b5_\b3 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+354 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+355 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+356 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+357 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+358 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+359 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+360 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+361 STENCIL_TABLE const *stencilTable,\n+362 const _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n+363 void * deviceContext = NULL) {\n+364\n+365 (void)instance; // unused\n+366 (void)deviceContext; // unused\n+367\n+368 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+369 dstBuffer->BindCudaBuffer(), dstDesc,\n+370 duBuffer->BindCudaBuffer(), duDesc,\n+371 dvBuffer->BindCudaBuffer(), dvDesc,\n+372 duuBuffer->BindCudaBuffer(), duuDesc,\n+373 duvBuffer->BindCudaBuffer(), duvDesc,\n+374 dvvBuffer->BindCudaBuffer(), dvvDesc,\n+375 (int const *)stencilTable->GetSizesBuffer(),\n+376 (int const *)stencilTable->GetOffsetsBuffer(),\n+377 (int const *)stencilTable->GetIndicesBuffer(),\n+378 (float const *)stencilTable->GetWeightsBuffer(),\n+379 (float const *)stencilTable->GetDuWeightsBuffer(),\n+380 (float const *)stencilTable->GetDvWeightsBuffer(),\n+381 (float const *)stencilTable->GetDuuWeightsBuffer(),\n+382 (float const *)stencilTable->GetDuvWeightsBuffer(),\n+383 (float const *)stencilTable->GetDvvWeightsBuffer(),\n+384 /*start = */ 0,\n+385 /*end = */ stencilTable->GetNumStencils());\n+386 }\n+387\n+_\b4_\b4_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+450 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+451 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+452 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+453 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+454 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+455 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+456 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+457 const int * sizes,\n+458 const int * offsets,\n+459 const int * indices,\n+460 const float * weights,\n+461 const float * duWeights,\n+462 const float * dvWeights,\n+463 const float * duuWeights,\n+464 const float * duvWeights,\n+465 const float * dvvWeights,\n+466 int start, int end);\n+467\n+473\n+502 template \n+_\b5_\b0_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+505 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+506 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+507 int numPatchCoords,\n+508 PATCHCOORD_BUFFER *patchCoords,\n+509 PATCH_TABLE *patchTable,\n+510 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+511 void * deviceContext = NULL) {\n+512\n+513 (void)instance; // unused\n+514 (void)deviceContext; // unused\n+515\n+516 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+517 dstBuffer->BindCudaBuffer(), dstDesc,\n+518 numPatchCoords,\n+519 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n+520 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetPatchArrayBuffer(),\n+521 (const int *)patchTable->GetPatchIndexBuffer(),\n+522 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n+523 }\n+524\n+563 template \n+_\b5_\b6_\b5 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+566 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+567 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+568 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+569 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+570 int numPatchCoords,\n+571 PATCHCOORD_BUFFER *patchCoords,\n+572 PATCH_TABLE *patchTable,\n+573 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+574 void * deviceContext = NULL) {\n+575\n+576 (void)instance; // unused\n+577 (void)deviceContext; // unused\n+578\n+579 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+580 dstBuffer->BindCudaBuffer(), dstDesc,\n+581 duBuffer->BindCudaBuffer(), duDesc,\n+582 dvBuffer->BindCudaBuffer(), dvDesc,\n+583 numPatchCoords,\n+584 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n+585 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetPatchArrayBuffer(),\n+586 (const int *)patchTable->GetPatchIndexBuffer(),\n+587 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n+588 }\n+589\n+646 template \n+_\b6_\b4_\b8 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+649 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+650 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+651 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+652 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+653 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+654 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+655 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+656 int numPatchCoords,\n+657 PATCHCOORD_BUFFER *patchCoords,\n+658 PATCH_TABLE *patchTable,\n+659 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+660 void * deviceContext = NULL) {\n+661\n+662 (void)instance; // unused\n+663 (void)deviceContext; // unused\n+664\n+665 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+666 dstBuffer->BindCudaBuffer(), dstDesc,\n+667 duBuffer->BindCudaBuffer(), duDesc,\n+668 dvBuffer->BindCudaBuffer(), dvDesc,\n+669 duuBuffer->BindCudaBuffer(), duuDesc,\n+670 duvBuffer->BindCudaBuffer(), duvDesc,\n+671 dvvBuffer->BindCudaBuffer(), dvvDesc,\n+672 numPatchCoords,\n+673 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n+674 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetPatchArrayBuffer(),\n+675 (const int *)patchTable->GetPatchIndexBuffer(),\n+676 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n+677 }\n+678\n+_\b7_\b0_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+707 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+708 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+709 int numPatchCoords,\n+710 const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *patchCoords,\n+711 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *patchArrays,\n+712 const int *patchIndices,\n+713 const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *patchParams);\n+714\n+_\b7_\b5_\b2 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+753 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+754 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+755 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+756 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+757 int numPatchCoords,\n+758 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n+759 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n+760 const int *patchIndices,\n+761 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParams);\n+762\n+_\b8_\b1_\b5 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+816 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+817 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+818 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+819 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+820 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+821 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+822 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+823 int numPatchCoords,\n+824 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n+825 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n+826 const int *patchIndices,\n+827 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParams);\n+828\n+857 template \n+_\b8_\b5_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+860 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+861 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+862 int numPatchCoords,\n+863 PATCHCOORD_BUFFER *patchCoords,\n+864 PATCH_TABLE *patchTable,\n+865 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+866 void * deviceContext = NULL) {\n+867\n+868 (void)instance; // unused\n+869 (void)deviceContext; // unused\n+870\n+871 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+872 dstBuffer->BindCudaBuffer(), dstDesc,\n+873 numPatchCoords,\n+874 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n+875 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetVaryingPatchArrayBuffer(),\n+876 (const int *)patchTable->GetVaryingPatchIndexBuffer(),\n+877 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n+878 }\n+879\n+920 template \n+_\b9_\b2_\b2 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+923 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+924 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+925 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+926 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+927 int numPatchCoords,\n+928 PATCHCOORD_BUFFER *patchCoords,\n+929 PATCH_TABLE *patchTable,\n+930 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+931 void * deviceContext = NULL) {\n+932\n+933 (void)instance; // unused\n+934 (void)deviceContext; // unused\n+935\n+936 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+937 dstBuffer->BindCudaBuffer(), dstDesc,\n+938 duBuffer->BindCudaBuffer(), duDesc,\n+939 dvBuffer->BindCudaBuffer(), dvDesc,\n+940 numPatchCoords,\n+941 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n+942 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetVaryingPatchArrayBuffer(),\n+943 (const int *)patchTable->GetVaryingPatchIndexBuffer(),\n+944 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n+945 }\n+946\n+1005 template \n+_\b1_\b0_\b0_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1008 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1009 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1010 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1011 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1012 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1013 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1014 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1015 int numPatchCoords,\n+1016 PATCHCOORD_BUFFER *patchCoords,\n+1017 PATCH_TABLE *patchTable,\n+1018 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1019 void * deviceContext = NULL) {\n+1020\n+1021 (void)instance; // unused\n+1022 (void)deviceContext; // unused\n+1023\n+1024 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+1025 dstBuffer->BindCudaBuffer(), dstDesc,\n+1026 duBuffer->BindCudaBuffer(), duDesc,\n+1027 dvBuffer->BindCudaBuffer(), dvDesc,\n+1028 duuBuffer->BindCudaBuffer(), duuDesc,\n+1029 duvBuffer->BindCudaBuffer(), duvDesc,\n+1030 dvvBuffer->BindCudaBuffer(), dvvDesc,\n+1031 numPatchCoords,\n+1032 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n+1033 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetVaryingPatchArrayBuffer(),\n+1034 (const int *)patchTable->GetVaryingPatchIndexBuffer(),\n+1035 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetPatchParamBuffer());\n+1036 }\n+1037\n+1068 template \n+_\b1_\b0_\b7_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1071 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1072 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1073 int numPatchCoords,\n+1074 PATCHCOORD_BUFFER *patchCoords,\n+1075 PATCH_TABLE *patchTable,\n+1076 int fvarChannel,\n+1077 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1078 void * deviceContext = NULL) {\n+1079\n+1080 (void)instance; // unused\n+1081 (void)deviceContext; // unused\n+1082\n+1083 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+1084 dstBuffer->BindCudaBuffer(), dstDesc,\n+1085 numPatchCoords,\n+1086 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n+1087 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+1088 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1089 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1090 }\n+1091\n+1134 template \n+_\b1_\b1_\b3_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1137 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1138 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1139 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1140 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1141 int numPatchCoords,\n+1142 PATCHCOORD_BUFFER *patchCoords,\n+1143 PATCH_TABLE *patchTable,\n+1144 int fvarChannel,\n+1145 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1146 void * deviceContext = NULL) {\n+1147\n+1148 (void)instance; // unused\n+1149 (void)deviceContext; // unused\n+1150\n+1151 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+1152 dstBuffer->BindCudaBuffer(), dstDesc,\n+1153 duBuffer->BindCudaBuffer(), duDesc,\n+1154 dvBuffer->BindCudaBuffer(), dvDesc,\n+1155 numPatchCoords,\n+1156 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n+1157 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+1158 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1159 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1160 }\n+1161\n+1222 template \n+_\b1_\b2_\b2_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1225 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1226 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1227 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1228 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1229 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1230 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1231 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1232 int numPatchCoords,\n+1233 PATCHCOORD_BUFFER *patchCoords,\n+1234 PATCH_TABLE *patchTable,\n+1235 int fvarChannel,\n+1236 _\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1237 void * deviceContext = NULL) {\n+1238\n+1239 (void)instance; // unused\n+1240 (void)deviceContext; // unused\n+1241\n+1242 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCudaBuffer(), srcDesc,\n+1243 dstBuffer->BindCudaBuffer(), dstDesc,\n+1244 duBuffer->BindCudaBuffer(), duDesc,\n+1245 dvBuffer->BindCudaBuffer(), dvDesc,\n+1246 duuBuffer->BindCudaBuffer(), duuDesc,\n+1247 duvBuffer->BindCudaBuffer(), duvDesc,\n+1248 dvvBuffer->BindCudaBuffer(), dvvDesc,\n+1249 numPatchCoords,\n+1250 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *)patchCoords->BindCudaBuffer(),\n+1251 (const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *)patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+1252 (const int *)patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1253 (const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *)patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1254 }\n+1255\n+_\b1_\b2_\b6_\b1 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(void *deviceContext = NULL);\n+1262};\n+1263\n+1264\n+1265} // end namespace Osd\n+1266\n+1267} // end namespace OPENSUBDIV_VERSION\n+1268using namespace OPENSUBDIV_VERSION;\n+1269\n+1270} // end namespace OpenSubdiv\n+1271\n+1272\n+1273#endif // OPENSUBDIV3_OSD_CUDA_EVALUATOR_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-Concrete vertex buffer class for OpenCL subdivision.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n-void UpdateData(const float *src, int startVertex, int numVertices,\n-DEVICE_CONTEXT context, cl_event *startEvents=NULL, unsigned int\n-numStartEvents=0, cl_event *endEvent=NULL)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\b~_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-~CLVertexBuffer()\n-Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-CLVertexBuffer(int numElements, int numVertices, cl_context clContext)\n-Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n-void UpdateData(const float *src, int startVertex, int numVertices,\n-cl_command_queue clQueue, cl_event *startEvents=NULL, unsigned int\n-numStartEvents=0, cl_event *endEvent=NULL)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-int GetNumElements() const\n-Returns how many elements defined in this vertex buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n-bool allocate(cl_context clContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int GetNumVertices() const\n-Returns how many vertices allocated in this vertex buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLVertexBuffer * Create(int numElements, int numVertices, cl_context\n-clContext)\n-Creator. Returns NULL if error.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLVertexBuffer * Create(int numElements, int numVertices, DEVICE_CONTEXT\n-context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bC_\bL_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem BindCLBuffer(cl_command_queue queue)\n-Returns the CL memory object.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Limit stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+BufferDescriptor is a struct which describes buffer elements in interleaved\n+data buffers....\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+CUDA stencil table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+void * GetDuvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+~CudaStencilTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+void * GetDuWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+void * GetDvvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+void * GetOffsetsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+CudaStencilTable(Far::LimitStencilTable const *limitStencilTable)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+void * GetDvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+int GetNumStencils() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+void * GetDuuWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+void * GetWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CudaStencilTable * Create(Far::LimitStencilTable const\n+*limitStencilTable, void *deviceContext=NULL)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n+void * GetSizesBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n+void * GetIndicesBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+CudaStencilTable(Far::StencilTable const *stencilTable)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CudaStencilTable * Create(Far::StencilTable const *stencilTable, void\n+*deviceContext=NULL)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const\n+PatchCoord *patchCoords, const PatchArray *patchArrays, const int\n+*patchIndices, const PatchParam *patchParams)\n+Static limit eval function. It takes an array of PatchCoord and evaluate limit\n+values on given PatchT...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void\n+*deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b2_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const *instance, void\n+*deviceContext=NULL)\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n+const CudaEvaluator *instance=NULL, void *deviceContext=NULL)\n+Generic static eval stencils function with derivatives. This function has a\n+same signature as other d...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int\n+*offsets, const int *indices, const float *weights, int start, int end)\n+Static eval stencils function which takes raw cuda buffers for input and\n+output.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n+CudaEvaluator const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const\n+CudaEvaluator *instance=NULL, void *deviceContext=NULL)\n+Generic static eval stencils function with derivatives. This function has a\n+same signature as other d...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n+BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n+float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord\n+const *patchCoords, PatchArray const *patchArrays, const int *patchIndices,\n+PatchParam const *patchParams)\n+Static limit eval function. It takes an array of PatchCoord and evaluate limit\n+values on given PatchT...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CudaEvaluator const\n+*instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b3_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n+const *stencilTable, const void *instance=NULL, void *deviceContext=NULL)\n+Generic static compute function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int\n+*offsets, const int *indices, const float *weights, const float *duWeights,\n+const float *dvWeights, int start, int end)\n+Static eval stencils function with derivatives, which takes raw cuda pointers\n+for input and output.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n+BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n+float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int\n+*offsets, const int *indices, const float *weights, const float *duWeights,\n+const float *dvWeights, const float *duuWeights, const float *duvWeights, const\n+float *dvvWeights, int start, int end)\n+Static eval stencils function with derivatives, which takes raw cuda pointers\n+for input and output.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(void *deviceContext=NULL)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords,\n+PatchCoord const *patchCoords, PatchArray const *patchArrays, const int\n+*patchIndices, PatchParam const *patchParams)\n+Static limit eval function. It takes an array of PatchCoord and evaluate limit\n+values on given PatchT...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const\n+*instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CudaEvaluator const\n+*instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b0_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n+CudaEvaluator const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b2_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, CudaEvaluator const *instance, void *deviceContext=NULL)\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n+fvarChannel, CudaEvaluator const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b7_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd\n+Coordinates set on a patch table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b2_\b7\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bc_\bu_\bd_\ba_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00797.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00797.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/opencl.h File Reference\n+OpenSubdiv: opensubdiv/osd/clVertexBuffer.h File Reference\n \n \n \n \n \n \n \n@@ -87,24 +87,44 @@\n
No Matches
\n \n \n \n \n \n
\n-
opencl.h File Reference
\n+ \n+
clVertexBuffer.h File Reference
\n
\n
\n-
#include <CL/opencl.h>
\n+
#include "../version.h"
\n+#include "../osd/opencl.h"
\n
\n

Go to the source code of this file.

\n+\n+\n+\n+\n+\n+

\n+Classes

class  CLVertexBuffer
 Concrete vertex buffer class for OpenCL subdivision. More...
 
\n+\n+\n+\n+\n+\n+\n+\n+

\n+Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,11 +1,24 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-opencl.h File Reference\n-#include \n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+clVertexBuffer.h File Reference\n+#include \"../version.h\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+class \u00a0 _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+\u00a0 Concrete vertex buffer class for OpenCL subdivision. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n+\u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n+\u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n+\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\n+ * _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00797_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00797_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/opencl.h Source File\n+OpenSubdiv: opensubdiv/osd/clVertexBuffer.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
opencl.h
\n+
clVertexBuffer.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2014 Pixar
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,32 +119,95 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_OPENCL_H
\n-
26#define OPENSUBDIV3_OSD_OPENCL_H
\n+
25#ifndef OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H
\n+
26#define OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H
\n
27
\n-
28#if defined(OPENSUBDIV_HAS_CLEW)
\n-
29# include <clew.h>
\n-
30#else
\n-
31# if defined(__APPLE__)
\n-
32# include <OpenCL/opencl.h>
\n-
33# else
\n-
34# include <CL/opencl.h>
\n-
35# endif
\n-
36#endif
\n-
37
\n-
38#endif // OPENSUBDIV3_OSD_CL_UTIL_H
\n+
28#include "../version.h"
\n+
29#include "../osd/opencl.h"
\n+
30
\n+
31namespace OpenSubdiv {
\n+
32namespace OPENSUBDIV_VERSION {
\n+
33
\n+
34namespace Osd {
\n+
35
\n+
\n+\n+
43
\n+
44public:
\n+
46 static CLVertexBuffer * Create(int numElements, int numVertices, cl_context clContext);
\n+
47
\n+
48 template <typename DEVICE_CONTEXT>
\n+
\n+
49 static CLVertexBuffer * Create(int numElements, int numVertices,
\n+
50 DEVICE_CONTEXT context) {
\n+
51 return Create(numElements, numVertices, context->GetContext());
\n+
52 }
\n+
\n+
53
\n+\n+
56
\n+
59 void UpdateData(const float *src, int startVertex, int numVertices, cl_command_queue clQueue,
\n+
60 cl_event* startEvents = NULL, unsigned int numStartEvents = 0, cl_event* endEvent = NULL);
\n+
61
\n+
62 template<typename DEVICE_CONTEXT>
\n+
\n+
63 void UpdateData(const float *src, int startVertex, int numVertices,
\n+
64 DEVICE_CONTEXT context,
\n+
65 cl_event* startEvents = NULL, unsigned int numStartEvents = 0, cl_event* endEvent = NULL) {
\n+
66 UpdateData(src, startVertex, numVertices, context->GetCommandQueue(), startEvents, numStartEvents, endEvent);
\n+
67 }
\n+
\n+
68
\n+
70 int GetNumElements() const;
\n+
71
\n+
73 int GetNumVertices() const;
\n+
74
\n+
76 cl_mem BindCLBuffer(cl_command_queue queue);
\n+
77
\n+
78protected:
\n+
80 CLVertexBuffer(int numElements, int numVertices, cl_context clContext);
\n+
81
\n+
84 bool allocate(cl_context clContext);
\n+
85
\n+
86private:
\n+
87 int _numElements;
\n+
88 int _numVertices;
\n+
89 cl_mem _clMemory;
\n+
90};
\n+
\n+
91
\n+
92} // end namespace Osd
\n+
93
\n+
94} // end namespace OPENSUBDIV_VERSION
\n+
95using namespace OPENSUBDIV_VERSION;
\n+
96
\n+
97} // end namespace OpenSubdiv
\n+
98
\n+
99#endif // OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H
\n+\n+
Concrete vertex buffer class for OpenCL subdivision.
\n+
void UpdateData(const float *src, int startVertex, int numVertices, DEVICE_CONTEXT context, cl_event *startEvents=NULL, unsigned int numStartEvents=0, cl_event *endEvent=NULL)
\n+\n+
CLVertexBuffer(int numElements, int numVertices, cl_context clContext)
Constructor.
\n+
void UpdateData(const float *src, int startVertex, int numVertices, cl_command_queue clQueue, cl_event *startEvents=NULL, unsigned int numStartEvents=0, cl_event *endEvent=NULL)
\n+
int GetNumElements() const
Returns how many elements defined in this vertex buffer.
\n+\n+
int GetNumVertices() const
Returns how many vertices allocated in this vertex buffer.
\n+
static CLVertexBuffer * Create(int numElements, int numVertices, cl_context clContext)
Creator. Returns NULL if error.
\n+
static CLVertexBuffer * Create(int numElements, int numVertices, DEVICE_CONTEXT context)
\n+
cl_mem BindCLBuffer(cl_command_queue queue)
Returns the CL memory object.
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-opencl.h\n+clVertexBuffer.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2014 Pixar\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,25 +24,114 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_OPENCL_H\n-26#define OPENSUBDIV3_OSD_OPENCL_H\n+25#ifndef OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H\n+26#define OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H\n 27\n-28#if defined(OPENSUBDIV_HAS_CLEW)\n-29# include \n-30#else\n-31# if defined(__APPLE__)\n-32# include \n-33# else\n-34# include \n-35# endif\n-36#endif\n-37\n-38#endif // OPENSUBDIV3_OSD_CL_UTIL_H\n+28#include \"../version.h\"\n+29#include \"../osd/opencl.h\"\n+30\n+31namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+32namespace OPENSUBDIV_VERSION {\n+33\n+34namespace Osd {\n+35\n+_\b4_\b2class _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n+43\n+44public:\n+_\b4_\b6 static _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices, cl_context\n+clContext);\n+47\n+48 template \n+_\b4_\b9 static _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n+50 DEVICE_CONTEXT context) {\n+51 return _\bC_\br_\be_\ba_\bt_\be(numElements, numVertices, context->GetContext());\n+52 }\n+53\n+_\b5_\b5 _\b~_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br();\n+56\n+_\b5_\b9 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n+cl_command_queue clQueue,\n+60 cl_event* startEvents = NULL, unsigned int numStartEvents = 0, cl_event*\n+endEvent = NULL);\n+61\n+62 template\n+_\b6_\b3 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n+64 DEVICE_CONTEXT context,\n+65 cl_event* startEvents = NULL, unsigned int numStartEvents = 0, cl_event*\n+endEvent = NULL) {\n+66 _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(src, startVertex, numVertices, context->GetCommandQueue(),\n+startEvents, numStartEvents, endEvent);\n+67 }\n+68\n+_\b7_\b0 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const;\n+71\n+_\b7_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n+74\n+_\b7_\b6 cl_mem _\bB_\bi_\bn_\bd_\bC_\bL_\bB_\bu_\bf_\bf_\be_\br(cl_command_queue queue);\n+77\n+78protected:\n+_\b8_\b0 _\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices, cl_context clContext);\n+81\n+_\b8_\b4 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(cl_context clContext);\n+85\n+86private:\n+87 int _numElements;\n+88 int _numVertices;\n+89 cl_mem _clMemory;\n+90};\n+91\n+92} // end namespace Osd\n+93\n+94} // end namespace OPENSUBDIV_VERSION\n+95using namespace OPENSUBDIV_VERSION;\n+96\n+97} // end namespace OpenSubdiv\n+98\n+99#endif // OPENSUBDIV3_OSD_CL_VERTEX_BUFFER_H\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+Concrete vertex buffer class for OpenCL subdivision.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n+void UpdateData(const float *src, int startVertex, int numVertices,\n+DEVICE_CONTEXT context, cl_event *startEvents=NULL, unsigned int\n+numStartEvents=0, cl_event *endEvent=NULL)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\b~_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+~CLVertexBuffer()\n+Destructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+CLVertexBuffer(int numElements, int numVertices, cl_context clContext)\n+Constructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n+void UpdateData(const float *src, int startVertex, int numVertices,\n+cl_command_queue clQueue, cl_event *startEvents=NULL, unsigned int\n+numStartEvents=0, cl_event *endEvent=NULL)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+int GetNumElements() const\n+Returns how many elements defined in this vertex buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n+bool allocate(cl_context clContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int GetNumVertices() const\n+Returns how many vertices allocated in this vertex buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLVertexBuffer * Create(int numElements, int numVertices, cl_context\n+clContext)\n+Creator. Returns NULL if error.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLVertexBuffer * Create(int numElements, int numVertices, DEVICE_CONTEXT\n+context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bC_\bL_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem BindCLBuffer(cl_command_queue queue)\n+Returns the CL memory object.\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\n+ * _\bc_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00800.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00800.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
clPatchTable.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../osd/opencl.h"
\n+#include "../osd/opencl.h"
\n #include "../osd/nonCopyable.h"
\n #include "../osd/types.h"
\n #include <vector>
\n
\n

Go to the source code of this file.

\n \n \n \n

\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00803.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00803.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlCommon.h File Reference\n+OpenSubdiv: opensubdiv/osd/clEvaluator.h File Reference\n \n \n \n \n \n \n \n@@ -90,40 +90,47 @@\n \n \n \n
\n \n-
mtlCommon.h File Reference
\n+
clEvaluator.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include <cstddef>
\n+#include "../osd/opencl.h"
\n+#include "../osd/types.h"
\n+#include "../osd/bufferDescriptor.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n+\n+\n+\n+\n \n

\n Classes

class  MTLContext
class  CLStencilTable
 OpenCL stencil table. More...
 
class  CLEvaluator
 
\n \n \n \n \n \n+\n+\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,23 +1,30 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-mtlCommon.h File Reference\n+clEvaluator.h File Reference\n #include \"../version.h\"\n-#include \n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n+class \u00a0 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+\u00a0 OpenCL stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n+\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\n+ * _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00803.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00803.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,4 @@\n var a00803 = [\n- [\"MTLContext\", \"a01277.html\", \"a01277\"]\n+ [\"CLStencilTable\", \"a01137.html\", \"a01137\"],\n+ [\"CLEvaluator\", \"a01141.html\", \"a01141\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00803_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00803_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlCommon.h Source File\n+OpenSubdiv: opensubdiv/osd/clEvaluator.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
mtlCommon.h
\n+
clEvaluator.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,53 +119,1283 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_MTL_COMMON_H
\n-
26#define OPENSUBDIV3_OSD_MTL_COMMON_H
\n+
25#ifndef OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n+
26#define OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include <cstddef>
\n-
31
\n-
32@protocol MTLDevice;
\n-
33@protocol MTLCommandQueue;
\n-
34
\n-
35namespace OpenSubdiv {
\n-
36namespace OPENSUBDIV_VERSION {
\n-
37
\n-
38namespace Osd {
\n-
39
\n-
\n-\n-
41public:
\n-
42 id<MTLDevice> device = nullptr;
\n-
43 id<MTLCommandQueue> commandQueue = nullptr;
\n-
44};
\n-
\n-
45
\n-
46} // end namespace Osd
\n-
47
\n-
48} // end namespace OPENSUBDIV_VERSION
\n-
49using namespace OPENSUBDIV_VERSION;
\n-
50
\n-
51} // end namespace OpenSubdiv
\n-
52
\n-
53#endif //OPENSUBDIV3_OSD_MTL_COMMON_H
\n+
30#include "../osd/opencl.h"
\n+
31#include "../osd/types.h"
\n+
32#include "../osd/bufferDescriptor.h"
\n+
33
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Far {
\n+
38 class PatchTable;
\n+
39 class StencilTable;
\n+
40 class LimitStencilTable;
\n+
41}
\n+
42
\n+
43namespace Osd {
\n+
44
\n+
\n+\n+
53public:
\n+
54 template <typename DEVICE_CONTEXT>
\n+
\n+
55 static CLStencilTable *Create(Far::StencilTable const *stencilTable,
\n+
56 DEVICE_CONTEXT context) {
\n+
57 return new CLStencilTable(stencilTable, context->GetContext());
\n+
58 }
\n+
\n+
59
\n+
60 template <typename DEVICE_CONTEXT>
\n+
\n+\n+
62 Far::LimitStencilTable const *limitStencilTable,
\n+
63 DEVICE_CONTEXT context) {
\n+
64 return new CLStencilTable(limitStencilTable, context->GetContext());
\n+
65 }
\n+
\n+
66
\n+
67 CLStencilTable(Far::StencilTable const *stencilTable,
\n+
68 cl_context clContext);
\n+
69 CLStencilTable(Far::LimitStencilTable const *limitStencilTable,
\n+
70 cl_context clContext);
\n+\n+
72
\n+
73 // interfaces needed for CLComputeKernel
\n+
74 cl_mem GetSizesBuffer() const { return _sizes; }
\n+
75 cl_mem GetOffsetsBuffer() const { return _offsets; }
\n+
76 cl_mem GetIndicesBuffer() const { return _indices; }
\n+
77 cl_mem GetWeightsBuffer() const { return _weights; }
\n+
78 cl_mem GetDuWeightsBuffer() const { return _duWeights; }
\n+
79 cl_mem GetDvWeightsBuffer() const { return _dvWeights; }
\n+
80 cl_mem GetDuuWeightsBuffer() const { return _duuWeights; }
\n+
81 cl_mem GetDuvWeightsBuffer() const { return _duvWeights; }
\n+
82 cl_mem GetDvvWeightsBuffer() const { return _dvvWeights; }
\n+
83 int GetNumStencils() const { return _numStencils; }
\n+
84
\n+
85private:
\n+
86 cl_mem _sizes;
\n+
87 cl_mem _offsets;
\n+
88 cl_mem _indices;
\n+
89 cl_mem _weights;
\n+
90 cl_mem _duWeights;
\n+
91 cl_mem _dvWeights;
\n+
92 cl_mem _duuWeights;
\n+
93 cl_mem _duvWeights;
\n+
94 cl_mem _dvvWeights;
\n+
95 int _numStencils;
\n+
96};
\n+
\n+
97
\n+
98// ---------------------------------------------------------------------------
\n+
99
\n+
\n+\n+
101public:
\n+
102 typedef bool Instantiatable;
\n+
103
\n+
105 template <typename DEVICE_CONTEXT>
\n+
\n+
106 static CLEvaluator *Create(BufferDescriptor const &srcDesc,
\n+
107 BufferDescriptor const &dstDesc,
\n+
108 BufferDescriptor const &duDesc,
\n+
109 BufferDescriptor const &dvDesc,
\n+
110 DEVICE_CONTEXT deviceContext) {
\n+
111 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n+
112 deviceContext->GetContext(),
\n+
113 deviceContext->GetCommandQueue());
\n+
114 }
\n+
\n+
115
\n+
\n+
116 static CLEvaluator * Create(BufferDescriptor const &srcDesc,
\n+
117 BufferDescriptor const &dstDesc,
\n+
118 BufferDescriptor const &duDesc,
\n+
119 BufferDescriptor const &dvDesc,
\n+
120 cl_context clContext,
\n+
121 cl_command_queue clCommandQueue) {
\n+
122 CLEvaluator *instance = new CLEvaluator(clContext, clCommandQueue);
\n+
123 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc))
\n+
124 return instance;
\n+
125 delete instance;
\n+
126 return NULL;
\n+
127 }
\n+
\n+
128
\n+
130 template <typename DEVICE_CONTEXT>
\n+
\n+
131 static CLEvaluator *Create(BufferDescriptor const &srcDesc,
\n+
132 BufferDescriptor const &dstDesc,
\n+
133 BufferDescriptor const &duDesc,
\n+
134 BufferDescriptor const &dvDesc,
\n+
135 BufferDescriptor const &duuDesc,
\n+
136 BufferDescriptor const &duvDesc,
\n+
137 BufferDescriptor const &dvvDesc,
\n+
138 DEVICE_CONTEXT deviceContext) {
\n+
139 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n+
140 duuDesc, duvDesc, dvvDesc,
\n+
141 deviceContext->GetContext(),
\n+
142 deviceContext->GetCommandQueue());
\n+
143 }
\n+
\n+
144
\n+
\n+
145 static CLEvaluator * Create(BufferDescriptor const &srcDesc,
\n+
146 BufferDescriptor const &dstDesc,
\n+
147 BufferDescriptor const &duDesc,
\n+
148 BufferDescriptor const &dvDesc,
\n+
149 BufferDescriptor const &duuDesc,
\n+
150 BufferDescriptor const &duvDesc,
\n+
151 BufferDescriptor const &dvvDesc,
\n+
152 cl_context clContext,
\n+
153 cl_command_queue clCommandQueue) {
\n+
154 CLEvaluator *instance = new CLEvaluator(clContext, clCommandQueue);
\n+
155 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc,
\n+
156 duuDesc, duvDesc, dvvDesc))
\n+
157 return instance;
\n+
158 delete instance;
\n+
159 return NULL;
\n+
160 }
\n+
\n+
161
\n+
163 CLEvaluator(cl_context context, cl_command_queue queue);
\n+
164
\n+\n+
167
\n+
173
\n+
217 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
218 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n+
\n+
219 static bool EvalStencils(
\n+
220 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
221 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
222 STENCIL_TABLE const *stencilTable,
\n+
223 CLEvaluator const *instance,
\n+
224 DEVICE_CONTEXT deviceContext,
\n+
225 unsigned int numStartEvents=0,
\n+
226 const cl_event* startEvents=NULL,
\n+
227 cl_event* endEvent=NULL) {
\n+
228
\n+
229 if (instance) {
\n+
230 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
231 dstBuffer, dstDesc,
\n+
232 stencilTable,
\n+
233 numStartEvents, startEvents, endEvent);
\n+
234 } else {
\n+
235 // Create an instance on demand (slow)
\n+
236 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
239 deviceContext);
\n+
240 if (instance) {
\n+
241 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
242 dstBuffer, dstDesc,
\n+
243 stencilTable,
\n+
244 numStartEvents, startEvents, endEvent);
\n+
245 delete instance;
\n+
246 return r;
\n+
247 }
\n+
248 return false;
\n+
249 }
\n+
250 }
\n+
\n+
251
\n+
307 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
308 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n+
\n+
309 static bool EvalStencils(
\n+
310 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
311 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
312 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
313 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
314 STENCIL_TABLE const *stencilTable,
\n+
315 CLEvaluator const *instance,
\n+
316 DEVICE_CONTEXT deviceContext,
\n+
317 unsigned int numStartEvents=0,
\n+
318 const cl_event* startEvents=NULL,
\n+
319 cl_event* endEvent=NULL) {
\n+
320
\n+
321 if (instance) {
\n+
322 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
323 dstBuffer, dstDesc,
\n+
324 duBuffer, duDesc,
\n+
325 dvBuffer, dvDesc,
\n+
326 stencilTable,
\n+
327 numStartEvents, startEvents, endEvent);
\n+
328 } else {
\n+
329 // Create an instance on demand (slow)
\n+
330 instance = Create(srcDesc, dstDesc, duDesc, dvDesc,
\n+
331 deviceContext);
\n+
332 if (instance) {
\n+
333 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
334 dstBuffer, dstDesc,
\n+
335 duBuffer, duDesc,
\n+
336 dvBuffer, dvDesc,
\n+
337 stencilTable,
\n+
338 numStartEvents, startEvents, endEvent);
\n+
339 delete instance;
\n+
340 return r;
\n+
341 }
\n+
342 return false;
\n+
343 }
\n+
344 }
\n+
\n+
345
\n+
419 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
420 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n+
\n+
421 static bool EvalStencils(
\n+
422 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
423 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
424 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
425 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
426 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
427 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
428 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
429 STENCIL_TABLE const *stencilTable,
\n+
430 CLEvaluator const *instance,
\n+
431 DEVICE_CONTEXT deviceContext,
\n+
432 unsigned int numStartEvents=0,
\n+
433 const cl_event* startEvents=NULL,
\n+
434 cl_event* endEvent=NULL) {
\n+
435
\n+
436 if (instance) {
\n+
437 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
438 dstBuffer, dstDesc,
\n+
439 duBuffer, duDesc,
\n+
440 dvBuffer, dvDesc,
\n+
441 duuBuffer, duuDesc,
\n+
442 duvBuffer, duvDesc,
\n+
443 dvvBuffer, dvvDesc,
\n+
444 stencilTable,
\n+
445 numStartEvents, startEvents, endEvent);
\n+
446 } else {
\n+
447 // Create an instance on demand (slow)
\n+
448 instance = Create(srcDesc, dstDesc,
\n+
449 duDesc, dvDesc,
\n+
450 duuDesc, duvDesc, dvvDesc,
\n+
451 deviceContext);
\n+
452 if (instance) {
\n+
453 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
454 dstBuffer, dstDesc,
\n+
455 duBuffer, duDesc,
\n+
456 dvBuffer, dvDesc,
\n+
457 duuBuffer, duuDesc,
\n+
458 duvBuffer, duvDesc,
\n+
459 dvvBuffer, dvvDesc,
\n+
460 stencilTable,
\n+
461 numStartEvents, startEvents, endEvent);
\n+
462 delete instance;
\n+
463 return r;
\n+
464 }
\n+
465 return false;
\n+
466 }
\n+
467 }
\n+
\n+
468
\n+
499 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
501 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
502 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
503 STENCIL_TABLE const *stencilTable,
\n+
504 unsigned int numStartEvents=0,
\n+
505 const cl_event* startEvents=NULL,
\n+
506 cl_event* endEvent=NULL) const {
\n+
507 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
508 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
509 stencilTable->GetSizesBuffer(),
\n+
510 stencilTable->GetOffsetsBuffer(),
\n+
511 stencilTable->GetIndicesBuffer(),
\n+
512 stencilTable->GetWeightsBuffer(),
\n+
513 0,
\n+
514 stencilTable->GetNumStencils(),
\n+
515 numStartEvents, startEvents, endEvent);
\n+
516 }
\n+
\n+
517
\n+
560 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
562 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
563 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
564 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
565 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
566 STENCIL_TABLE const *stencilTable,
\n+
567 unsigned int numStartEvents=0,
\n+
568 const cl_event* startEvents=NULL,
\n+
569 cl_event* endEvent=NULL) const {
\n+
570 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
571 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
572 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
573 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
574 stencilTable->GetSizesBuffer(),
\n+
575 stencilTable->GetOffsetsBuffer(),
\n+
576 stencilTable->GetIndicesBuffer(),
\n+
577 stencilTable->GetWeightsBuffer(),
\n+
578 stencilTable->GetDuWeightsBuffer(),
\n+
579 stencilTable->GetDvWeightsBuffer(),
\n+
580 0,
\n+
581 stencilTable->GetNumStencils(),
\n+
582 numStartEvents, startEvents, endEvent);
\n+
583 }
\n+
\n+
584
\n+
645 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
647 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
648 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
649 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
650 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
651 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
652 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
653 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
654 STENCIL_TABLE const *stencilTable,
\n+
655 unsigned int numStartEvents=0,
\n+
656 const cl_event* startEvents=NULL,
\n+
657 cl_event* endEvent=NULL) const {
\n+
658 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
659 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
660 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
661 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
662 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n+
663 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n+
664 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n+
665 stencilTable->GetSizesBuffer(),
\n+
666 stencilTable->GetOffsetsBuffer(),
\n+
667 stencilTable->GetIndicesBuffer(),
\n+
668 stencilTable->GetWeightsBuffer(),
\n+
669 stencilTable->GetDuWeightsBuffer(),
\n+
670 stencilTable->GetDvWeightsBuffer(),
\n+
671 stencilTable->GetDuuWeightsBuffer(),
\n+
672 stencilTable->GetDuvWeightsBuffer(),
\n+
673 stencilTable->GetDvvWeightsBuffer(),
\n+
674 0,
\n+
675 stencilTable->GetNumStencils(),
\n+
676 numStartEvents, startEvents, endEvent);
\n+
677 }
\n+
\n+
678
\n+
681 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n+
682 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
683 cl_mem sizes,
\n+
684 cl_mem offsets,
\n+
685 cl_mem indices,
\n+
686 cl_mem weights,
\n+
687 int start,
\n+
688 int end,
\n+
689 unsigned int numStartEvents=0,
\n+
690 const cl_event* startEvents=NULL,
\n+
691 cl_event* endEvent=NULL) const;
\n+
692
\n+
741 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n+
742 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
743 cl_mem du, BufferDescriptor const &duDesc,
\n+
744 cl_mem dv, BufferDescriptor const &dvDesc,
\n+
745 cl_mem sizes,
\n+
746 cl_mem offsets,
\n+
747 cl_mem indices,
\n+
748 cl_mem weights,
\n+
749 cl_mem duWeights,
\n+
750 cl_mem dvWeights,
\n+
751 int start,
\n+
752 int end,
\n+
753 unsigned int numStartEvents=0,
\n+
754 const cl_event* startEvents=NULL,
\n+
755 cl_event* endEvent=NULL) const;
\n+
756
\n+
823 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n+
824 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
825 cl_mem du, BufferDescriptor const &duDesc,
\n+
826 cl_mem dv, BufferDescriptor const &dvDesc,
\n+
827 cl_mem duu, BufferDescriptor const &duuDesc,
\n+
828 cl_mem duv, BufferDescriptor const &duvDesc,
\n+
829 cl_mem dvv, BufferDescriptor const &dvvDesc,
\n+
830 cl_mem sizes,
\n+
831 cl_mem offsets,
\n+
832 cl_mem indices,
\n+
833 cl_mem weights,
\n+
834 cl_mem duWeights,
\n+
835 cl_mem dvWeights,
\n+
836 cl_mem duuWeights,
\n+
837 cl_mem duvWeights,
\n+
838 cl_mem dvvWeights,
\n+
839 int start,
\n+
840 int end,
\n+
841 unsigned int numStartEvents=0,
\n+
842 const cl_event* startEvents=NULL,
\n+
843 cl_event* endEvent=NULL) const;
\n+
844
\n+
850
\n+
899 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
900 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
901 typename DEVICE_CONTEXT>
\n+
\n+
902 static bool EvalPatches(
\n+
903 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
904 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
905 int numPatchCoords,
\n+
906 PATCHCOORD_BUFFER *patchCoords,
\n+
907 PATCH_TABLE *patchTable,
\n+
908 CLEvaluator const *instance,
\n+
909 DEVICE_CONTEXT deviceContext,
\n+
910 unsigned int numStartEvents=0,
\n+
911 const cl_event* startEvents=NULL,
\n+
912 cl_event* endEvent=NULL) {
\n+
913
\n+
914 if (instance) {
\n+
915 return instance->EvalPatches(srcBuffer, srcDesc,
\n+
916 dstBuffer, dstDesc,
\n+
917 numPatchCoords, patchCoords,
\n+
918 patchTable,
\n+
919 numStartEvents, startEvents, endEvent);
\n+
920 } else {
\n+
921 // Create an instance on demand (slow)
\n+
922 (void)deviceContext; // unused
\n+
923 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
926 deviceContext);
\n+
927 if (instance) {
\n+
928 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n+
929 dstBuffer, dstDesc,
\n+
930 numPatchCoords, patchCoords,
\n+
931 patchTable,
\n+
932 numStartEvents, startEvents, endEvent);
\n+
933 delete instance;
\n+
934 return r;
\n+
935 }
\n+
936 return false;
\n+
937 }
\n+
938 }
\n+
\n+
939
\n+
1000 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1001 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1002 typename DEVICE_CONTEXT>
\n+
\n+
1003 static bool EvalPatches(
\n+
1004 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1005 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1006 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1007 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1008 int numPatchCoords,
\n+
1009 PATCHCOORD_BUFFER *patchCoords,
\n+
1010 PATCH_TABLE *patchTable,
\n+
1011 CLEvaluator const *instance,
\n+
1012 DEVICE_CONTEXT deviceContext,
\n+
1013 unsigned int numStartEvents=0,
\n+
1014 const cl_event* startEvents=NULL,
\n+
1015 cl_event* endEvent=NULL) {
\n+
1016
\n+
1017 if (instance) {
\n+
1018 return instance->EvalPatches(srcBuffer, srcDesc,
\n+
1019 dstBuffer, dstDesc,
\n+
1020 duBuffer, duDesc,
\n+
1021 dvBuffer, dvDesc,
\n+
1022 numPatchCoords, patchCoords,
\n+
1023 patchTable,
\n+
1024 numStartEvents, startEvents, endEvent);
\n+
1025 } else {
\n+
1026 // Create an instance on demand (slow)
\n+
1027 (void)deviceContext; // unused
\n+
1028 instance = Create(srcDesc, dstDesc, duDesc, dvDesc, deviceContext);
\n+
1029 if (instance) {
\n+
1030 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n+
1031 dstBuffer, dstDesc,
\n+
1032 duBuffer, duDesc,
\n+
1033 dvBuffer, dvDesc,
\n+
1034 numPatchCoords, patchCoords,
\n+
1035 patchTable,
\n+
1036 numStartEvents, startEvents, endEvent);
\n+
1037 delete instance;
\n+
1038 return r;
\n+
1039 }
\n+
1040 return false;
\n+
1041 }
\n+
1042 }
\n+
\n+
1043
\n+
1122 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1123 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1124 typename DEVICE_CONTEXT>
\n+
\n+
1125 static bool EvalPatches(
\n+
1126 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1127 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1128 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1129 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1130 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1131 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1132 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1133 int numPatchCoords,
\n+
1134 PATCHCOORD_BUFFER *patchCoords,
\n+
1135 PATCH_TABLE *patchTable,
\n+
1136 CLEvaluator const *instance,
\n+
1137 DEVICE_CONTEXT deviceContext,
\n+
1138 unsigned int numStartEvents=0,
\n+
1139 const cl_event* startEvents=NULL,
\n+
1140 cl_event* endEvent=NULL) {
\n+
1141
\n+
1142 if (instance) {
\n+
1143 return instance->EvalPatches(srcBuffer, srcDesc,
\n+
1144 dstBuffer, dstDesc,
\n+
1145 duBuffer, duDesc,
\n+
1146 dvBuffer, dvDesc,
\n+
1147 duuBuffer, duuDesc,
\n+
1148 duvBuffer, duvDesc,
\n+
1149 dvvBuffer, dvvDesc,
\n+
1150 numPatchCoords, patchCoords,
\n+
1151 patchTable,
\n+
1152 numStartEvents, startEvents, endEvent);
\n+
1153 } else {
\n+
1154 // Create an instance on demand (slow)
\n+
1155 (void)deviceContext; // unused
\n+
1156 instance = Create(srcDesc, dstDesc,
\n+
1157 duDesc, dvDesc,
\n+
1158 duuDesc, duvDesc, dvvDesc,
\n+
1159 deviceContext);
\n+
1160 if (instance) {
\n+
1161 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n+
1162 dstBuffer, dstDesc,
\n+
1163 duBuffer, duDesc,
\n+
1164 dvBuffer, dvDesc,
\n+
1165 duuBuffer, duuDesc,
\n+
1166 duvBuffer, duvDesc,
\n+
1167 dvvBuffer, dvvDesc,
\n+
1168 numPatchCoords, patchCoords,
\n+
1169 patchTable,
\n+
1170 numStartEvents, startEvents, endEvent);
\n+
1171 delete instance;
\n+
1172 return r;
\n+
1173 }
\n+
1174 return false;
\n+
1175 }
\n+
1176 }
\n+
\n+
1177
\n+
1215 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1216 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1218 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1219 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1220 int numPatchCoords,
\n+
1221 PATCHCOORD_BUFFER *patchCoords,
\n+
1222 PATCH_TABLE *patchTable,
\n+
1223 unsigned int numStartEvents=0,
\n+
1224 const cl_event* startEvents=NULL,
\n+
1225 cl_event* endEvent=NULL) const {
\n+
1226
\n+
1227 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1228 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1229 0, BufferDescriptor(),
\n+
1230 0, BufferDescriptor(),
\n+
1231 numPatchCoords,
\n+
1232 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1233 patchTable->GetPatchArrayBuffer(),
\n+
1234 patchTable->GetPatchIndexBuffer(),
\n+
1235 patchTable->GetPatchParamBuffer(),
\n+
1236 numStartEvents, startEvents, endEvent);
\n+
1237 }
\n+
\n+
1238
\n+
1286 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1287 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1289 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1290 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1291 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1292 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1293 int numPatchCoords,
\n+
1294 PATCHCOORD_BUFFER *patchCoords,
\n+
1295 PATCH_TABLE *patchTable,
\n+
1296 unsigned int numStartEvents=0,
\n+
1297 const cl_event* startEvents=NULL,
\n+
1298 cl_event* endEvent=NULL) const {
\n+
1299
\n+
1300 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1301 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1302 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
1303 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
1304 numPatchCoords,
\n+
1305 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1306 patchTable->GetPatchArrayBuffer(),
\n+
1307 patchTable->GetPatchIndexBuffer(),
\n+
1308 patchTable->GetPatchParamBuffer(),
\n+
1309 numStartEvents, startEvents, endEvent);
\n+
1310 }
\n+
\n+
1311
\n+
1377 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1378 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1380 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1381 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1382 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1383 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1384 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1385 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1386 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1387 int numPatchCoords,
\n+
1388 PATCHCOORD_BUFFER *patchCoords,
\n+
1389 PATCH_TABLE *patchTable,
\n+
1390 unsigned int numStartEvents=0,
\n+
1391 const cl_event* startEvents=NULL,
\n+
1392 cl_event* endEvent=NULL) const {
\n+
1393
\n+
1394 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1395 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1396 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
1397 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
1398 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n+
1399 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n+
1400 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n+
1401 numPatchCoords,
\n+
1402 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1403 patchTable->GetPatchArrayBuffer(),
\n+
1404 patchTable->GetPatchIndexBuffer(),
\n+
1405 patchTable->GetPatchParamBuffer(),
\n+
1406 numStartEvents, startEvents, endEvent);
\n+
1407 }
\n+
\n+
1408
\n+
1409 bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc,
\n+
1410 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
1411 cl_mem du, BufferDescriptor const &duDesc,
\n+
1412 cl_mem dv, BufferDescriptor const &dvDesc,
\n+
1413 int numPatchCoords,
\n+
1414 cl_mem patchCoordsBuffer,
\n+
1415 cl_mem patchArrayBuffer,
\n+
1416 cl_mem patchIndexBuffer,
\n+
1417 cl_mem patchParamsBuffer,
\n+
1418 unsigned int numStartEvents=0,
\n+
1419 const cl_event* startEvents=NULL,
\n+
1420 cl_event* endEvent=NULL) const;
\n+
1421
\n+
1422 bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc,
\n+
1423 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
1424 cl_mem du, BufferDescriptor const &duDesc,
\n+
1425 cl_mem dv, BufferDescriptor const &dvDesc,
\n+
1426 cl_mem duu, BufferDescriptor const &duuDesc,
\n+
1427 cl_mem duv, BufferDescriptor const &duvDesc,
\n+
1428 cl_mem dvv, BufferDescriptor const &dvvDesc,
\n+
1429 int numPatchCoords,
\n+
1430 cl_mem patchCoordsBuffer,
\n+
1431 cl_mem patchArrayBuffer,
\n+
1432 cl_mem patchIndexBuffer,
\n+
1433 cl_mem patchParamsBuffer,
\n+
1434 unsigned int numStartEvents=0,
\n+
1435 const cl_event* startEvents=NULL,
\n+
1436 cl_event* endEvent=NULL) const;
\n+
1437
\n+
1486 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1487 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1488 typename DEVICE_CONTEXT>
\n+
\n+\n+
1490 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1491 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1492 int numPatchCoords,
\n+
1493 PATCHCOORD_BUFFER *patchCoords,
\n+
1494 PATCH_TABLE *patchTable,
\n+
1495 CLEvaluator const *instance,
\n+
1496 DEVICE_CONTEXT deviceContext,
\n+
1497 unsigned int numStartEvents=0,
\n+
1498 const cl_event* startEvents=NULL,
\n+
1499 cl_event* endEvent=NULL) {
\n+
1500
\n+
1501 if (instance) {
\n+
1502 return instance->EvalPatchesVarying(
\n+
1503 srcBuffer, srcDesc,
\n+
1504 dstBuffer, dstDesc,
\n+
1505 numPatchCoords, patchCoords,
\n+
1506 patchTable,
\n+
1507 numStartEvents, startEvents, endEvent);
\n+
1508 } else {
\n+
1509 // Create an instance on demand (slow)
\n+
1510 (void)deviceContext; // unused
\n+
1511 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
1514 deviceContext);
\n+
1515 if (instance) {
\n+
1516 bool r = instance->EvalPatchesVarying(
\n+
1517 srcBuffer, srcDesc,
\n+
1518 dstBuffer, dstDesc,
\n+
1519 numPatchCoords, patchCoords,
\n+
1520 patchTable,
\n+
1521 numStartEvents, startEvents, endEvent);
\n+
1522 delete instance;
\n+
1523 return r;
\n+
1524 }
\n+
1525 return false;
\n+
1526 }
\n+
1527 }
\n+
\n+
1528
\n+
1566 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1567 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1569 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1570 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1571 int numPatchCoords,
\n+
1572 PATCHCOORD_BUFFER *patchCoords,
\n+
1573 PATCH_TABLE *patchTable,
\n+
1574 unsigned int numStartEvents=0,
\n+
1575 const cl_event* startEvents=NULL,
\n+
1576 cl_event* endEvent=NULL) const {
\n+
1577
\n+
1578 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1579 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1580 0, BufferDescriptor(),
\n+
1581 0, BufferDescriptor(),
\n+
1582 numPatchCoords,
\n+
1583 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1584 patchTable->GetVaryingPatchArrayBuffer(),
\n+
1585 patchTable->GetVaryingPatchIndexBuffer(),
\n+
1586 patchTable->GetPatchParamBuffer(),
\n+
1587 numStartEvents, startEvents, endEvent);
\n+
1588 }
\n+
\n+
1589
\n+
1650 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1651 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1652 typename DEVICE_CONTEXT>
\n+
\n+\n+
1654 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1655 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1656 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1657 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1658 int numPatchCoords,
\n+
1659 PATCHCOORD_BUFFER *patchCoords,
\n+
1660 PATCH_TABLE *patchTable,
\n+
1661 CLEvaluator const *instance,
\n+
1662 DEVICE_CONTEXT deviceContext,
\n+
1663 unsigned int numStartEvents=0,
\n+
1664 const cl_event* startEvents=NULL,
\n+
1665 cl_event* endEvent=NULL) {
\n+
1666
\n+
1667 if (instance) {
\n+
1668 return instance->EvalPatchesVarying(
\n+
1669 srcBuffer, srcDesc,
\n+
1670 dstBuffer, dstDesc,
\n+
1671 duBuffer, duDesc,
\n+
1672 dvBuffer, dvDesc,
\n+
1673 numPatchCoords, patchCoords,
\n+
1674 patchTable,
\n+
1675 numStartEvents, startEvents, endEvent);
\n+
1676 } else {
\n+
1677 // Create an instance on demand (slow)
\n+
1678 (void)deviceContext; // unused
\n+
1679 instance = Create(srcDesc, dstDesc,
\n+
1680 duDesc, dvDesc,
\n+
1681 deviceContext);
\n+
1682 if (instance) {
\n+
1683 bool r = instance->EvalPatchesVarying(
\n+
1684 srcBuffer, srcDesc,
\n+
1685 dstBuffer, dstDesc,
\n+
1686 duBuffer, duDesc,
\n+
1687 dvBuffer, dvDesc,
\n+
1688 numPatchCoords, patchCoords,
\n+
1689 patchTable,
\n+
1690 numStartEvents, startEvents, endEvent);
\n+
1691 delete instance;
\n+
1692 return r;
\n+
1693 }
\n+
1694 return false;
\n+
1695 }
\n+
1696 }
\n+
\n+
1697
\n+
1747 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1748 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1750 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1751 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1752 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1753 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1754 int numPatchCoords,
\n+
1755 PATCHCOORD_BUFFER *patchCoords,
\n+
1756 PATCH_TABLE *patchTable,
\n+
1757 unsigned int numStartEvents=0,
\n+
1758 const cl_event* startEvents=NULL,
\n+
1759 cl_event* endEvent=NULL) const {
\n+
1760
\n+
1761 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1762 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1763 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
1764 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
1765 numPatchCoords,
\n+
1766 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1767 patchTable->GetVaryingPatchArrayBuffer(),
\n+
1768 patchTable->GetVaryingPatchIndexBuffer(),
\n+
1769 patchTable->GetPatchParamBuffer(),
\n+
1770 numStartEvents, startEvents, endEvent);
\n+
1771 }
\n+
\n+
1772
\n+
1851 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1852 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1853 typename DEVICE_CONTEXT>
\n+
\n+\n+
1855 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1856 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1857 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1858 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1859 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1860 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1861 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1862 int numPatchCoords,
\n+
1863 PATCHCOORD_BUFFER *patchCoords,
\n+
1864 PATCH_TABLE *patchTable,
\n+
1865 CLEvaluator const *instance,
\n+
1866 DEVICE_CONTEXT deviceContext,
\n+
1867 unsigned int numStartEvents=0,
\n+
1868 const cl_event* startEvents=NULL,
\n+
1869 cl_event* endEvent=NULL) {
\n+
1870
\n+
1871 if (instance) {
\n+
1872 return instance->EvalPatchesVarying(
\n+
1873 srcBuffer, srcDesc,
\n+
1874 dstBuffer, dstDesc,
\n+
1875 duBuffer, duDesc,
\n+
1876 dvBuffer, dvDesc,
\n+
1877 duuBuffer, duuDesc,
\n+
1878 duvBuffer, duvDesc,
\n+
1879 dvvBuffer, dvvDesc,
\n+
1880 numPatchCoords, patchCoords,
\n+
1881 patchTable,
\n+
1882 numStartEvents, startEvents, endEvent);
\n+
1883 } else {
\n+
1884 // Create an instance on demand (slow)
\n+
1885 (void)deviceContext; // unused
\n+
1886 instance = Create(srcDesc, dstDesc,
\n+
1887 duDesc, dvDesc,
\n+
1888 duuDesc, duvDesc, dvvDesc,
\n+
1889 deviceContext);
\n+
1890 if (instance) {
\n+
1891 bool r = instance->EvalPatchesVarying(
\n+
1892 srcBuffer, srcDesc,
\n+
1893 dstBuffer, dstDesc,
\n+
1894 duBuffer, duDesc,
\n+
1895 dvBuffer, dvDesc,
\n+
1896 duuBuffer, duuDesc,
\n+
1897 duvBuffer, duvDesc,
\n+
1898 dvvBuffer, dvvDesc,
\n+
1899 numPatchCoords, patchCoords,
\n+
1900 patchTable,
\n+
1901 numStartEvents, startEvents, endEvent);
\n+
1902 delete instance;
\n+
1903 return r;
\n+
1904 }
\n+
1905 return false;
\n+
1906 }
\n+
1907 }
\n+
\n+
1908
\n+
1976 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1977 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1979 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1980 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1981 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1982 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1983 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1984 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1985 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1986 int numPatchCoords,
\n+
1987 PATCHCOORD_BUFFER *patchCoords,
\n+
1988 PATCH_TABLE *patchTable,
\n+
1989 unsigned int numStartEvents=0,
\n+
1990 const cl_event* startEvents=NULL,
\n+
1991 cl_event* endEvent=NULL) const {
\n+
1992
\n+
1993 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1994 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1995 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
1996 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
1997 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n+
1998 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n+
1999 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n+
2000 numPatchCoords,
\n+
2001 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
2002 patchTable->GetVaryingPatchArrayBuffer(),
\n+
2003 patchTable->GetVaryingPatchIndexBuffer(),
\n+
2004 patchTable->GetPatchParamBuffer(),
\n+
2005 numStartEvents, startEvents, endEvent);
\n+
2006 }
\n+
\n+
2007
\n+
2058 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2059 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
2060 typename DEVICE_CONTEXT>
\n+
\n+\n+
2062 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2063 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2064 int numPatchCoords,
\n+
2065 PATCHCOORD_BUFFER *patchCoords,
\n+
2066 PATCH_TABLE *patchTable,
\n+
2067 int fvarChannel,
\n+
2068 CLEvaluator const *instance,
\n+
2069 DEVICE_CONTEXT deviceContext,
\n+
2070 unsigned int numStartEvents=0,
\n+
2071 const cl_event* startEvents=NULL,
\n+
2072 cl_event* endEvent=NULL) {
\n+
2073
\n+
2074 if (instance) {
\n+
2075 return instance->EvalPatchesFaceVarying(
\n+
2076 srcBuffer, srcDesc,
\n+
2077 dstBuffer, dstDesc,
\n+
2078 numPatchCoords, patchCoords,
\n+
2079 patchTable, fvarChannel,
\n+
2080 numStartEvents, startEvents, endEvent);
\n+
2081 } else {
\n+
2082 // Create an instance on demand (slow)
\n+
2083 (void)deviceContext; // unused
\n+
2084 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
2087 deviceContext);
\n+
2088 if (instance) {
\n+
2089 bool r = instance->EvalPatchesFaceVarying(
\n+
2090 srcBuffer, srcDesc,
\n+
2091 dstBuffer, dstDesc,
\n+
2092 numPatchCoords, patchCoords,
\n+
2093 patchTable, fvarChannel,
\n+
2094 numStartEvents, startEvents, endEvent);
\n+
2095 delete instance;
\n+
2096 return r;
\n+
2097 }
\n+
2098 return false;
\n+
2099 }
\n+
2100 }
\n+
\n+
2101
\n+
2141 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2142 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
2144 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2145 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2146 int numPatchCoords,
\n+
2147 PATCHCOORD_BUFFER *patchCoords,
\n+
2148 PATCH_TABLE *patchTable,
\n+
2149 int fvarChannel = 0,
\n+
2150 unsigned int numStartEvents=0,
\n+
2151 const cl_event* startEvents=NULL,
\n+
2152 cl_event* endEvent=NULL) const {
\n+
2153
\n+
2154 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
2155 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
2156 0, BufferDescriptor(),
\n+
2157 0, BufferDescriptor(),
\n+
2158 numPatchCoords,
\n+
2159 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
2160 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
2161 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
2162 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n+
2163 numStartEvents, startEvents, endEvent);
\n+
2164 }
\n+
\n+
2165
\n+
2228 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2229 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
2230 typename DEVICE_CONTEXT>
\n+
\n+\n+
2232 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2233 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2234 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
2235 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
2236 int numPatchCoords,
\n+
2237 PATCHCOORD_BUFFER *patchCoords,
\n+
2238 PATCH_TABLE *patchTable,
\n+
2239 int fvarChannel,
\n+
2240 CLEvaluator const *instance,
\n+
2241 DEVICE_CONTEXT deviceContext,
\n+
2242 unsigned int numStartEvents=0,
\n+
2243 const cl_event* startEvents=NULL,
\n+
2244 cl_event* endEvent=NULL) {
\n+
2245
\n+
2246 if (instance) {
\n+
2247 return instance->EvalPatchesFaceVarying(
\n+
2248 srcBuffer, srcDesc,
\n+
2249 dstBuffer, dstDesc,
\n+
2250 duBuffer, duDesc,
\n+
2251 dvBuffer, dvDesc,
\n+
2252 numPatchCoords, patchCoords,
\n+
2253 patchTable, fvarChannel,
\n+
2254 numStartEvents, startEvents, endEvent);
\n+
2255 } else {
\n+
2256 // Create an instance on demand (slow)
\n+
2257 (void)deviceContext; // unused
\n+
2258 instance = Create(srcDesc, dstDesc,
\n+
2259 duDesc, dvDesc, deviceContext);
\n+
2260 if (instance) {
\n+
2261 bool r = instance->EvalPatchesFaceVarying(
\n+
2262 srcBuffer, srcDesc,
\n+
2263 dstBuffer, dstDesc,
\n+
2264 duBuffer, duDesc,
\n+
2265 dvBuffer, dvDesc,
\n+
2266 numPatchCoords, patchCoords,
\n+
2267 patchTable, fvarChannel,
\n+
2268 numStartEvents, startEvents, endEvent);
\n+
2269 delete instance;
\n+
2270 return r;
\n+
2271 }
\n+
2272 return false;
\n+
2273 }
\n+
2274 }
\n+
\n+
2275
\n+
2327 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2328 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
2330 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2331 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2332 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
2333 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
2334 int numPatchCoords,
\n+
2335 PATCHCOORD_BUFFER *patchCoords,
\n+
2336 PATCH_TABLE *patchTable,
\n+
2337 int fvarChannel = 0,
\n+
2338 unsigned int numStartEvents=0,
\n+
2339 const cl_event* startEvents=NULL,
\n+
2340 cl_event* endEvent=NULL) const {
\n+
2341
\n+
2342 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
2343 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
2344 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
2345 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
2346 numPatchCoords,
\n+
2347 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
2348 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
2349 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
2350 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n+
2351 numStartEvents, startEvents, endEvent);
\n+
2352 }
\n+
\n+
2353
\n+
2434 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2435 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
2436 typename DEVICE_CONTEXT>
\n+
\n+\n+
2438 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2439 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2440 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
2441 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
2442 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
2443 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
2444 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
2445 int numPatchCoords,
\n+
2446 PATCHCOORD_BUFFER *patchCoords,
\n+
2447 PATCH_TABLE *patchTable,
\n+
2448 int fvarChannel,
\n+
2449 CLEvaluator const *instance,
\n+
2450 DEVICE_CONTEXT deviceContext,
\n+
2451 unsigned int numStartEvents=0,
\n+
2452 const cl_event* startEvents=NULL,
\n+
2453 cl_event* endEvent=NULL) {
\n+
2454
\n+
2455 if (instance) {
\n+
2456 return instance->EvalPatchesFaceVarying(
\n+
2457 srcBuffer, srcDesc,
\n+
2458 dstBuffer, dstDesc,
\n+
2459 duBuffer, duDesc,
\n+
2460 dvBuffer, dvDesc,
\n+
2461 duuBuffer, duuDesc,
\n+
2462 duvBuffer, duvDesc,
\n+
2463 dvvBuffer, dvvDesc,
\n+
2464 numPatchCoords, patchCoords,
\n+
2465 patchTable, fvarChannel,
\n+
2466 numStartEvents, startEvents, endEvent);
\n+
2467 } else {
\n+
2468 // Create an instance on demand (slow)
\n+
2469 (void)deviceContext; // unused
\n+
2470 instance = Create(srcDesc, dstDesc,
\n+
2471 duDesc, dvDesc,
\n+
2472 duuDesc, duvDesc, dvvDesc,
\n+
2473 deviceContext);
\n+
2474 if (instance) {
\n+
2475 bool r = instance->EvalPatchesFaceVarying(
\n+
2476 srcBuffer, srcDesc,
\n+
2477 dstBuffer, dstDesc,
\n+
2478 duBuffer, duDesc,
\n+
2479 dvBuffer, dvDesc,
\n+
2480 duuBuffer, duuDesc,
\n+
2481 duvBuffer, duvDesc,
\n+
2482 dvvBuffer, dvvDesc,
\n+
2483 numPatchCoords, patchCoords,
\n+
2484 patchTable, fvarChannel,
\n+
2485 numStartEvents, startEvents, endEvent);
\n+
2486 delete instance;
\n+
2487 return r;
\n+
2488 }
\n+
2489 return false;
\n+
2490 }
\n+
2491 }
\n+
\n+
2492
\n+
2562 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2563 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
2565 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2566 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2567 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
2568 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
2569 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
2570 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
2571 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
2572 int numPatchCoords,
\n+
2573 PATCHCOORD_BUFFER *patchCoords,
\n+
2574 PATCH_TABLE *patchTable,
\n+
2575 int fvarChannel = 0,
\n+
2576 unsigned int numStartEvents=0,
\n+
2577 const cl_event* startEvents=NULL,
\n+
2578 cl_event* endEvent=NULL) const {
\n+
2579
\n+
2580 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
2581 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
2582 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
2583 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
2584 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n+
2585 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n+
2586 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n+
2587 numPatchCoords,
\n+
2588 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
2589 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
2590 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
2591 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n+
2592 numStartEvents, startEvents, endEvent);
\n+
2593 }
\n+
\n+
2594
\n+
2600
\n+
2603 bool Compile(BufferDescriptor const &srcDesc,
\n+
2604 BufferDescriptor const &dstDesc,
\n+
2605 BufferDescriptor const &duDesc = BufferDescriptor(),
\n+
2606 BufferDescriptor const &dvDesc = BufferDescriptor(),
\n+
2607 BufferDescriptor const &duuDesc = BufferDescriptor(),
\n+
2608 BufferDescriptor const &duvDesc = BufferDescriptor(),
\n+
2609 BufferDescriptor const &dvvDesc = BufferDescriptor());
\n+
2610
\n+
2612 template <typename DEVICE_CONTEXT>
\n+
\n+
2613 static void Synchronize(DEVICE_CONTEXT deviceContext) {
\n+
2614 Synchronize(deviceContext->GetCommandQueue());
\n+
2615 }
\n+
\n+
2616
\n+
2617 static void Synchronize(cl_command_queue queue);
\n+
2618
\n+
2619private:
\n+
2620 cl_context _clContext;
\n+
2621 cl_command_queue _clCommandQueue;
\n+
2622 cl_program _program;
\n+
2623 cl_kernel _stencilKernel;
\n+
2624 cl_kernel _stencilDerivKernel;
\n+
2625 cl_kernel _patchKernel;
\n+
2626};
\n+
\n+
2627
\n+
2628} // end namespace Osd
\n+
2629
\n+
2630} // end namespace OPENSUBDIV_VERSION
\n+
2631using namespace OPENSUBDIV_VERSION;
\n+
2632
\n+
2633} // end namespace OpenSubdiv
\n+
2634
\n+
2635
\n+
2636#endif // OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n \n-\n-\n-\n+
Stencil table class wrapping the template for compatibility.
\n+
Limit stencil table class wrapping the template for compatibility.
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+\n+
CLStencilTable(Far::StencilTable const *stencilTable, cl_context clContext)
\n+\n+
static CLStencilTable * Create(Far::LimitStencilTable const *limitStencilTable, DEVICE_CONTEXT context)
Definition clEvaluator.h:61
\n+\n+\n+\n+\n+\n+\n+\n+\n+
static CLStencilTable * Create(Far::StencilTable const *stencilTable, DEVICE_CONTEXT context)
Definition clEvaluator.h:55
\n+
CLStencilTable(Far::LimitStencilTable const *limitStencilTable, cl_context clContext)
\n+\n+\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n+
static void Synchronize(cl_command_queue queue)
\n+\n+
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Dispatch the CL compute kernel asynchronously. returns false if the kernel hasn't been compiled yet.
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n+
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, cl_context clContext, cl_command_queue clCommandQueue)
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, int numPatchCoords, cl_mem patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n+
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n+
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+\n+
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, DEVICE_CONTEXT deviceContext)
Generic creator template.
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, DEVICE_CONTEXT deviceContext)
Generic creator template.
\n+
bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const &duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, cl_mem patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n+
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const &duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv, BufferDescriptor const &dvvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, cl_mem duuWeights, cl_mem duvWeights, cl_mem dvvWeights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Dispatch the CL compute kernel asynchronously. returns false if the kernel hasn't been compiled yet.
\n+
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static void Synchronize(DEVICE_CONTEXT deviceContext)
Wait the OpenCL kernels finish.
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n+
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, cl_context clContext, cl_command_queue clCommandQueue)
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n+
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
CLEvaluator(cl_context context, cl_command_queue queue)
Constructor.
\n+
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const &dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(), BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const &dvvDesc=BufferDescriptor())
\n+
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-mtlCommon.h\n+clEvaluator.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,50 +24,1553 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_MTL_COMMON_H\n-26#define OPENSUBDIV3_OSD_MTL_COMMON_H\n+25#ifndef OPENSUBDIV3_OSD_CL_EVALUATOR_H\n+26#define OPENSUBDIV3_OSD_CL_EVALUATOR_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \n-31\n-32@protocol MTLDevice;\n-33@protocol MTLCommandQueue;\n-34\n-35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-36namespace OPENSUBDIV_VERSION {\n-37\n-38namespace Osd {\n-39\n-_\b4_\b0class _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt {\n-41public:\n-_\b4_\b2 id _\bd_\be_\bv_\bi_\bc_\be = nullptr;\n-_\b4_\b3 id _\bc_\bo_\bm_\bm_\ba_\bn_\bd_\bQ_\bu_\be_\bu_\be = nullptr;\n-44};\n-45\n-46} // end namespace Osd\n-47\n-48} // end namespace OPENSUBDIV_VERSION\n-49using namespace OPENSUBDIV_VERSION;\n-50\n-51} // end namespace OpenSubdiv\n-52\n-53#endif //OPENSUBDIV3_OSD_MTL_COMMON_H\n+30#include \"../osd/opencl.h\"\n+31#include \"../osd/types.h\"\n+32#include \"../osd/bufferDescriptor.h\"\n+33\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Far {\n+38 class PatchTable;\n+39 class StencilTable;\n+40 class LimitStencilTable;\n+41}\n+42\n+43namespace Osd {\n+44\n+_\b5_\b2class _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n+53public:\n+54 template \n+_\b5_\b5 static _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+56 DEVICE_CONTEXT context) {\n+57 return new _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, context->GetContext());\n+58 }\n+59\n+60 template \n+_\b6_\b1 static _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(\n+62 _\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n+63 DEVICE_CONTEXT context) {\n+64 return new _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(limitStencilTable, context->GetContext());\n+65 }\n+66\n+_\b6_\b7 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+68 cl_context clContext);\n+_\b6_\b9 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n+70 cl_context clContext);\n+_\b7_\b1 _\b~_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n+72\n+73 // interfaces needed for CLComputeKernel\n+_\b7_\b4 cl_mem _\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _sizes; }\n+_\b7_\b5 cl_mem _\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _offsets; }\n+_\b7_\b6 cl_mem _\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _indices; }\n+_\b7_\b7 cl_mem _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _weights; }\n+_\b7_\b8 cl_mem _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duWeights; }\n+_\b7_\b9 cl_mem _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvWeights; }\n+_\b8_\b0 cl_mem _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duuWeights; }\n+_\b8_\b1 cl_mem _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duvWeights; }\n+_\b8_\b2 cl_mem _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvvWeights; }\n+_\b8_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n+84\n+85private:\n+86 cl_mem _sizes;\n+87 cl_mem _offsets;\n+88 cl_mem _indices;\n+89 cl_mem _weights;\n+90 cl_mem _duWeights;\n+91 cl_mem _dvWeights;\n+92 cl_mem _duuWeights;\n+93 cl_mem _duvWeights;\n+94 cl_mem _dvvWeights;\n+95 int _numStencils;\n+96};\n+97\n+98// --------------------------------------------------------------------------\n+-\n+99\n+_\b1_\b0_\b0class _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n+101public:\n+_\b1_\b0_\b2 typedef bool _\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be;\n+103\n+105 template \n+_\b1_\b0_\b6 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *_\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+108 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+109 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+110 DEVICE_CONTEXT deviceContext) {\n+111 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+112 deviceContext->GetContext(),\n+113 deviceContext->GetCommandQueue());\n+114 }\n+115\n+_\b1_\b1_\b6 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+117 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+118 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+119 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+120 cl_context clContext,\n+121 cl_command_queue clCommandQueue) {\n+122 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(clContext, clCommandQueue);\n+123 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc))\n+124 return instance;\n+125 delete instance;\n+126 return NULL;\n+127 }\n+128\n+130 template \n+_\b1_\b3_\b1 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *_\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+132 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+133 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+134 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+135 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+136 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+137 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+138 DEVICE_CONTEXT deviceContext) {\n+139 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+140 duuDesc, duvDesc, dvvDesc,\n+141 deviceContext->GetContext(),\n+142 deviceContext->GetCommandQueue());\n+143 }\n+144\n+_\b1_\b4_\b5 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+146 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+147 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+148 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+149 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+150 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+151 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+152 cl_context clContext,\n+153 cl_command_queue clCommandQueue) {\n+154 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(clContext, clCommandQueue);\n+155 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+156 duuDesc, duvDesc, dvvDesc))\n+157 return instance;\n+158 delete instance;\n+159 return NULL;\n+160 }\n+161\n+_\b1_\b6_\b3 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(cl_context context, cl_command_queue queue);\n+164\n+_\b1_\b6_\b6 _\b~_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n+167\n+173\n+217 template \n+_\b2_\b1_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+220 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+221 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+222 STENCIL_TABLE const *stencilTable,\n+223 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+224 DEVICE_CONTEXT deviceContext,\n+225 unsigned int numStartEvents=0,\n+226 const cl_event* startEvents=NULL,\n+227 cl_event* endEvent=NULL) {\n+228\n+229 if (instance) {\n+230 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+231 dstBuffer, dstDesc,\n+232 stencilTable,\n+233 numStartEvents, startEvents, endEvent);\n+234 } else {\n+235 // Create an instance on demand (slow)\n+236 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+237 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+238 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+239 deviceContext);\n+240 if (instance) {\n+241 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+242 dstBuffer, dstDesc,\n+243 stencilTable,\n+244 numStartEvents, startEvents, endEvent);\n+245 delete instance;\n+246 return r;\n+247 }\n+248 return false;\n+249 }\n+250 }\n+251\n+307 template \n+_\b3_\b0_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+310 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+311 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+312 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+313 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+314 STENCIL_TABLE const *stencilTable,\n+315 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+316 DEVICE_CONTEXT deviceContext,\n+317 unsigned int numStartEvents=0,\n+318 const cl_event* startEvents=NULL,\n+319 cl_event* endEvent=NULL) {\n+320\n+321 if (instance) {\n+322 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+323 dstBuffer, dstDesc,\n+324 duBuffer, duDesc,\n+325 dvBuffer, dvDesc,\n+326 stencilTable,\n+327 numStartEvents, startEvents, endEvent);\n+328 } else {\n+329 // Create an instance on demand (slow)\n+330 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+331 deviceContext);\n+332 if (instance) {\n+333 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+334 dstBuffer, dstDesc,\n+335 duBuffer, duDesc,\n+336 dvBuffer, dvDesc,\n+337 stencilTable,\n+338 numStartEvents, startEvents, endEvent);\n+339 delete instance;\n+340 return r;\n+341 }\n+342 return false;\n+343 }\n+344 }\n+345\n+419 template \n+_\b4_\b2_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+422 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+423 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+424 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+425 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+426 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+427 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+428 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+429 STENCIL_TABLE const *stencilTable,\n+430 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+431 DEVICE_CONTEXT deviceContext,\n+432 unsigned int numStartEvents=0,\n+433 const cl_event* startEvents=NULL,\n+434 cl_event* endEvent=NULL) {\n+435\n+436 if (instance) {\n+437 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+438 dstBuffer, dstDesc,\n+439 duBuffer, duDesc,\n+440 dvBuffer, dvDesc,\n+441 duuBuffer, duuDesc,\n+442 duvBuffer, duvDesc,\n+443 dvvBuffer, dvvDesc,\n+444 stencilTable,\n+445 numStartEvents, startEvents, endEvent);\n+446 } else {\n+447 // Create an instance on demand (slow)\n+448 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+449 duDesc, dvDesc,\n+450 duuDesc, duvDesc, dvvDesc,\n+451 deviceContext);\n+452 if (instance) {\n+453 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+454 dstBuffer, dstDesc,\n+455 duBuffer, duDesc,\n+456 dvBuffer, dvDesc,\n+457 duuBuffer, duuDesc,\n+458 duvBuffer, duvDesc,\n+459 dvvBuffer, dvvDesc,\n+460 stencilTable,\n+461 numStartEvents, startEvents, endEvent);\n+462 delete instance;\n+463 return r;\n+464 }\n+465 return false;\n+466 }\n+467 }\n+468\n+499 template \n+_\b5_\b0_\b0 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+501 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+502 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+503 STENCIL_TABLE const *stencilTable,\n+504 unsigned int numStartEvents=0,\n+505 const cl_event* startEvents=NULL,\n+506 cl_event* endEvent=NULL) const {\n+507 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+508 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+509 stencilTable->GetSizesBuffer(),\n+510 stencilTable->GetOffsetsBuffer(),\n+511 stencilTable->GetIndicesBuffer(),\n+512 stencilTable->GetWeightsBuffer(),\n+513 0,\n+514 stencilTable->GetNumStencils(),\n+515 numStartEvents, startEvents, endEvent);\n+516 }\n+517\n+560 template \n+_\b5_\b6_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+562 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+563 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+564 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+565 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+566 STENCIL_TABLE const *stencilTable,\n+567 unsigned int numStartEvents=0,\n+568 const cl_event* startEvents=NULL,\n+569 cl_event* endEvent=NULL) const {\n+570 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+571 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+572 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+573 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+574 stencilTable->GetSizesBuffer(),\n+575 stencilTable->GetOffsetsBuffer(),\n+576 stencilTable->GetIndicesBuffer(),\n+577 stencilTable->GetWeightsBuffer(),\n+578 stencilTable->GetDuWeightsBuffer(),\n+579 stencilTable->GetDvWeightsBuffer(),\n+580 0,\n+581 stencilTable->GetNumStencils(),\n+582 numStartEvents, startEvents, endEvent);\n+583 }\n+584\n+645 template \n+_\b6_\b4_\b6 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+647 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+648 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+649 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+650 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+651 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+652 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+653 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+654 STENCIL_TABLE const *stencilTable,\n+655 unsigned int numStartEvents=0,\n+656 const cl_event* startEvents=NULL,\n+657 cl_event* endEvent=NULL) const {\n+658 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+659 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+660 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+661 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+662 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n+663 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n+664 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n+665 stencilTable->GetSizesBuffer(),\n+666 stencilTable->GetOffsetsBuffer(),\n+667 stencilTable->GetIndicesBuffer(),\n+668 stencilTable->GetWeightsBuffer(),\n+669 stencilTable->GetDuWeightsBuffer(),\n+670 stencilTable->GetDvWeightsBuffer(),\n+671 stencilTable->GetDuuWeightsBuffer(),\n+672 stencilTable->GetDuvWeightsBuffer(),\n+673 stencilTable->GetDvvWeightsBuffer(),\n+674 0,\n+675 stencilTable->GetNumStencils(),\n+676 numStartEvents, startEvents, endEvent);\n+677 }\n+678\n+_\b6_\b8_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+682 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+683 cl_mem sizes,\n+684 cl_mem offsets,\n+685 cl_mem indices,\n+686 cl_mem weights,\n+687 int start,\n+688 int end,\n+689 unsigned int numStartEvents=0,\n+690 const cl_event* startEvents=NULL,\n+691 cl_event* endEvent=NULL) const;\n+692\n+_\b7_\b4_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+742 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+743 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+744 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+745 cl_mem sizes,\n+746 cl_mem offsets,\n+747 cl_mem indices,\n+748 cl_mem weights,\n+749 cl_mem duWeights,\n+750 cl_mem dvWeights,\n+751 int start,\n+752 int end,\n+753 unsigned int numStartEvents=0,\n+754 const cl_event* startEvents=NULL,\n+755 cl_event* endEvent=NULL) const;\n+756\n+_\b8_\b2_\b3 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+824 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+825 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+826 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+827 cl_mem duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+828 cl_mem duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+829 cl_mem dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+830 cl_mem sizes,\n+831 cl_mem offsets,\n+832 cl_mem indices,\n+833 cl_mem weights,\n+834 cl_mem duWeights,\n+835 cl_mem dvWeights,\n+836 cl_mem duuWeights,\n+837 cl_mem duvWeights,\n+838 cl_mem dvvWeights,\n+839 int start,\n+840 int end,\n+841 unsigned int numStartEvents=0,\n+842 const cl_event* startEvents=NULL,\n+843 cl_event* endEvent=NULL) const;\n+844\n+850\n+899 template \n+_\b9_\b0_\b2 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+903 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+904 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+905 int numPatchCoords,\n+906 PATCHCOORD_BUFFER *patchCoords,\n+907 PATCH_TABLE *patchTable,\n+908 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+909 DEVICE_CONTEXT deviceContext,\n+910 unsigned int numStartEvents=0,\n+911 const cl_event* startEvents=NULL,\n+912 cl_event* endEvent=NULL) {\n+913\n+914 if (instance) {\n+915 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+916 dstBuffer, dstDesc,\n+917 numPatchCoords, patchCoords,\n+918 patchTable,\n+919 numStartEvents, startEvents, endEvent);\n+920 } else {\n+921 // Create an instance on demand (slow)\n+922 (void)deviceContext; // unused\n+923 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+924 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+925 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+926 deviceContext);\n+927 if (instance) {\n+928 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+929 dstBuffer, dstDesc,\n+930 numPatchCoords, patchCoords,\n+931 patchTable,\n+932 numStartEvents, startEvents, endEvent);\n+933 delete instance;\n+934 return r;\n+935 }\n+936 return false;\n+937 }\n+938 }\n+939\n+1000 template \n+_\b1_\b0_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1004 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1005 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1006 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1007 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1008 int numPatchCoords,\n+1009 PATCHCOORD_BUFFER *patchCoords,\n+1010 PATCH_TABLE *patchTable,\n+1011 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1012 DEVICE_CONTEXT deviceContext,\n+1013 unsigned int numStartEvents=0,\n+1014 const cl_event* startEvents=NULL,\n+1015 cl_event* endEvent=NULL) {\n+1016\n+1017 if (instance) {\n+1018 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+1019 dstBuffer, dstDesc,\n+1020 duBuffer, duDesc,\n+1021 dvBuffer, dvDesc,\n+1022 numPatchCoords, patchCoords,\n+1023 patchTable,\n+1024 numStartEvents, startEvents, endEvent);\n+1025 } else {\n+1026 // Create an instance on demand (slow)\n+1027 (void)deviceContext; // unused\n+1028 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc, deviceContext);\n+1029 if (instance) {\n+1030 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+1031 dstBuffer, dstDesc,\n+1032 duBuffer, duDesc,\n+1033 dvBuffer, dvDesc,\n+1034 numPatchCoords, patchCoords,\n+1035 patchTable,\n+1036 numStartEvents, startEvents, endEvent);\n+1037 delete instance;\n+1038 return r;\n+1039 }\n+1040 return false;\n+1041 }\n+1042 }\n+1043\n+1122 template \n+_\b1_\b1_\b2_\b5 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1126 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1127 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1128 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1129 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1130 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1131 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1132 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1133 int numPatchCoords,\n+1134 PATCHCOORD_BUFFER *patchCoords,\n+1135 PATCH_TABLE *patchTable,\n+1136 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1137 DEVICE_CONTEXT deviceContext,\n+1138 unsigned int numStartEvents=0,\n+1139 const cl_event* startEvents=NULL,\n+1140 cl_event* endEvent=NULL) {\n+1141\n+1142 if (instance) {\n+1143 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+1144 dstBuffer, dstDesc,\n+1145 duBuffer, duDesc,\n+1146 dvBuffer, dvDesc,\n+1147 duuBuffer, duuDesc,\n+1148 duvBuffer, duvDesc,\n+1149 dvvBuffer, dvvDesc,\n+1150 numPatchCoords, patchCoords,\n+1151 patchTable,\n+1152 numStartEvents, startEvents, endEvent);\n+1153 } else {\n+1154 // Create an instance on demand (slow)\n+1155 (void)deviceContext; // unused\n+1156 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1157 duDesc, dvDesc,\n+1158 duuDesc, duvDesc, dvvDesc,\n+1159 deviceContext);\n+1160 if (instance) {\n+1161 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+1162 dstBuffer, dstDesc,\n+1163 duBuffer, duDesc,\n+1164 dvBuffer, dvDesc,\n+1165 duuBuffer, duuDesc,\n+1166 duvBuffer, duvDesc,\n+1167 dvvBuffer, dvvDesc,\n+1168 numPatchCoords, patchCoords,\n+1169 patchTable,\n+1170 numStartEvents, startEvents, endEvent);\n+1171 delete instance;\n+1172 return r;\n+1173 }\n+1174 return false;\n+1175 }\n+1176 }\n+1177\n+1215 template \n+_\b1_\b2_\b1_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1218 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1219 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1220 int numPatchCoords,\n+1221 PATCHCOORD_BUFFER *patchCoords,\n+1222 PATCH_TABLE *patchTable,\n+1223 unsigned int numStartEvents=0,\n+1224 const cl_event* startEvents=NULL,\n+1225 cl_event* endEvent=NULL) const {\n+1226\n+1227 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1228 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1229 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1230 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1231 numPatchCoords,\n+1232 patchCoords->BindCLBuffer(_clCommandQueue),\n+1233 patchTable->GetPatchArrayBuffer(),\n+1234 patchTable->GetPatchIndexBuffer(),\n+1235 patchTable->GetPatchParamBuffer(),\n+1236 numStartEvents, startEvents, endEvent);\n+1237 }\n+1238\n+1286 template \n+_\b1_\b2_\b8_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1289 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1290 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1291 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1292 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1293 int numPatchCoords,\n+1294 PATCHCOORD_BUFFER *patchCoords,\n+1295 PATCH_TABLE *patchTable,\n+1296 unsigned int numStartEvents=0,\n+1297 const cl_event* startEvents=NULL,\n+1298 cl_event* endEvent=NULL) const {\n+1299\n+1300 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1301 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1302 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+1303 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+1304 numPatchCoords,\n+1305 patchCoords->BindCLBuffer(_clCommandQueue),\n+1306 patchTable->GetPatchArrayBuffer(),\n+1307 patchTable->GetPatchIndexBuffer(),\n+1308 patchTable->GetPatchParamBuffer(),\n+1309 numStartEvents, startEvents, endEvent);\n+1310 }\n+1311\n+1377 template \n+_\b1_\b3_\b7_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1380 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1381 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1382 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1383 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1384 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1385 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1386 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1387 int numPatchCoords,\n+1388 PATCHCOORD_BUFFER *patchCoords,\n+1389 PATCH_TABLE *patchTable,\n+1390 unsigned int numStartEvents=0,\n+1391 const cl_event* startEvents=NULL,\n+1392 cl_event* endEvent=NULL) const {\n+1393\n+1394 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1395 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1396 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+1397 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+1398 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n+1399 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n+1400 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n+1401 numPatchCoords,\n+1402 patchCoords->BindCLBuffer(_clCommandQueue),\n+1403 patchTable->GetPatchArrayBuffer(),\n+1404 patchTable->GetPatchIndexBuffer(),\n+1405 patchTable->GetPatchParamBuffer(),\n+1406 numStartEvents, startEvents, endEvent);\n+1407 }\n+1408\n+_\b1_\b4_\b0_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1410 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1411 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1412 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1413 int numPatchCoords,\n+1414 cl_mem patchCoordsBuffer,\n+1415 cl_mem patchArrayBuffer,\n+1416 cl_mem patchIndexBuffer,\n+1417 cl_mem patchParamsBuffer,\n+1418 unsigned int numStartEvents=0,\n+1419 const cl_event* startEvents=NULL,\n+1420 cl_event* endEvent=NULL) const;\n+1421\n+_\b1_\b4_\b2_\b2 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1423 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1424 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1425 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1426 cl_mem duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1427 cl_mem duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1428 cl_mem dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1429 int numPatchCoords,\n+1430 cl_mem patchCoordsBuffer,\n+1431 cl_mem patchArrayBuffer,\n+1432 cl_mem patchIndexBuffer,\n+1433 cl_mem patchParamsBuffer,\n+1434 unsigned int numStartEvents=0,\n+1435 const cl_event* startEvents=NULL,\n+1436 cl_event* endEvent=NULL) const;\n+1437\n+1486 template \n+_\b1_\b4_\b8_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1490 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1491 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1492 int numPatchCoords,\n+1493 PATCHCOORD_BUFFER *patchCoords,\n+1494 PATCH_TABLE *patchTable,\n+1495 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1496 DEVICE_CONTEXT deviceContext,\n+1497 unsigned int numStartEvents=0,\n+1498 const cl_event* startEvents=NULL,\n+1499 cl_event* endEvent=NULL) {\n+1500\n+1501 if (instance) {\n+1502 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1503 srcBuffer, srcDesc,\n+1504 dstBuffer, dstDesc,\n+1505 numPatchCoords, patchCoords,\n+1506 patchTable,\n+1507 numStartEvents, startEvents, endEvent);\n+1508 } else {\n+1509 // Create an instance on demand (slow)\n+1510 (void)deviceContext; // unused\n+1511 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1512 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1513 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1514 deviceContext);\n+1515 if (instance) {\n+1516 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1517 srcBuffer, srcDesc,\n+1518 dstBuffer, dstDesc,\n+1519 numPatchCoords, patchCoords,\n+1520 patchTable,\n+1521 numStartEvents, startEvents, endEvent);\n+1522 delete instance;\n+1523 return r;\n+1524 }\n+1525 return false;\n+1526 }\n+1527 }\n+1528\n+1566 template \n+_\b1_\b5_\b6_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1569 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1570 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1571 int numPatchCoords,\n+1572 PATCHCOORD_BUFFER *patchCoords,\n+1573 PATCH_TABLE *patchTable,\n+1574 unsigned int numStartEvents=0,\n+1575 const cl_event* startEvents=NULL,\n+1576 cl_event* endEvent=NULL) const {\n+1577\n+1578 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1579 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1580 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1581 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1582 numPatchCoords,\n+1583 patchCoords->BindCLBuffer(_clCommandQueue),\n+1584 patchTable->GetVaryingPatchArrayBuffer(),\n+1585 patchTable->GetVaryingPatchIndexBuffer(),\n+1586 patchTable->GetPatchParamBuffer(),\n+1587 numStartEvents, startEvents, endEvent);\n+1588 }\n+1589\n+1650 template \n+_\b1_\b6_\b5_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1654 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1655 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1656 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1657 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1658 int numPatchCoords,\n+1659 PATCHCOORD_BUFFER *patchCoords,\n+1660 PATCH_TABLE *patchTable,\n+1661 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1662 DEVICE_CONTEXT deviceContext,\n+1663 unsigned int numStartEvents=0,\n+1664 const cl_event* startEvents=NULL,\n+1665 cl_event* endEvent=NULL) {\n+1666\n+1667 if (instance) {\n+1668 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1669 srcBuffer, srcDesc,\n+1670 dstBuffer, dstDesc,\n+1671 duBuffer, duDesc,\n+1672 dvBuffer, dvDesc,\n+1673 numPatchCoords, patchCoords,\n+1674 patchTable,\n+1675 numStartEvents, startEvents, endEvent);\n+1676 } else {\n+1677 // Create an instance on demand (slow)\n+1678 (void)deviceContext; // unused\n+1679 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1680 duDesc, dvDesc,\n+1681 deviceContext);\n+1682 if (instance) {\n+1683 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1684 srcBuffer, srcDesc,\n+1685 dstBuffer, dstDesc,\n+1686 duBuffer, duDesc,\n+1687 dvBuffer, dvDesc,\n+1688 numPatchCoords, patchCoords,\n+1689 patchTable,\n+1690 numStartEvents, startEvents, endEvent);\n+1691 delete instance;\n+1692 return r;\n+1693 }\n+1694 return false;\n+1695 }\n+1696 }\n+1697\n+1747 template \n+_\b1_\b7_\b4_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1750 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1751 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1752 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1753 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1754 int numPatchCoords,\n+1755 PATCHCOORD_BUFFER *patchCoords,\n+1756 PATCH_TABLE *patchTable,\n+1757 unsigned int numStartEvents=0,\n+1758 const cl_event* startEvents=NULL,\n+1759 cl_event* endEvent=NULL) const {\n+1760\n+1761 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1762 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1763 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+1764 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+1765 numPatchCoords,\n+1766 patchCoords->BindCLBuffer(_clCommandQueue),\n+1767 patchTable->GetVaryingPatchArrayBuffer(),\n+1768 patchTable->GetVaryingPatchIndexBuffer(),\n+1769 patchTable->GetPatchParamBuffer(),\n+1770 numStartEvents, startEvents, endEvent);\n+1771 }\n+1772\n+1851 template \n+_\b1_\b8_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1855 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1856 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1857 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1858 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1859 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1860 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1861 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1862 int numPatchCoords,\n+1863 PATCHCOORD_BUFFER *patchCoords,\n+1864 PATCH_TABLE *patchTable,\n+1865 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1866 DEVICE_CONTEXT deviceContext,\n+1867 unsigned int numStartEvents=0,\n+1868 const cl_event* startEvents=NULL,\n+1869 cl_event* endEvent=NULL) {\n+1870\n+1871 if (instance) {\n+1872 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1873 srcBuffer, srcDesc,\n+1874 dstBuffer, dstDesc,\n+1875 duBuffer, duDesc,\n+1876 dvBuffer, dvDesc,\n+1877 duuBuffer, duuDesc,\n+1878 duvBuffer, duvDesc,\n+1879 dvvBuffer, dvvDesc,\n+1880 numPatchCoords, patchCoords,\n+1881 patchTable,\n+1882 numStartEvents, startEvents, endEvent);\n+1883 } else {\n+1884 // Create an instance on demand (slow)\n+1885 (void)deviceContext; // unused\n+1886 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1887 duDesc, dvDesc,\n+1888 duuDesc, duvDesc, dvvDesc,\n+1889 deviceContext);\n+1890 if (instance) {\n+1891 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1892 srcBuffer, srcDesc,\n+1893 dstBuffer, dstDesc,\n+1894 duBuffer, duDesc,\n+1895 dvBuffer, dvDesc,\n+1896 duuBuffer, duuDesc,\n+1897 duvBuffer, duvDesc,\n+1898 dvvBuffer, dvvDesc,\n+1899 numPatchCoords, patchCoords,\n+1900 patchTable,\n+1901 numStartEvents, startEvents, endEvent);\n+1902 delete instance;\n+1903 return r;\n+1904 }\n+1905 return false;\n+1906 }\n+1907 }\n+1908\n+1976 template \n+_\b1_\b9_\b7_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1979 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1980 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1981 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1982 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1983 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1984 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1985 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1986 int numPatchCoords,\n+1987 PATCHCOORD_BUFFER *patchCoords,\n+1988 PATCH_TABLE *patchTable,\n+1989 unsigned int numStartEvents=0,\n+1990 const cl_event* startEvents=NULL,\n+1991 cl_event* endEvent=NULL) const {\n+1992\n+1993 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1994 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1995 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+1996 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+1997 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n+1998 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n+1999 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n+2000 numPatchCoords,\n+2001 patchCoords->BindCLBuffer(_clCommandQueue),\n+2002 patchTable->GetVaryingPatchArrayBuffer(),\n+2003 patchTable->GetVaryingPatchIndexBuffer(),\n+2004 patchTable->GetPatchParamBuffer(),\n+2005 numStartEvents, startEvents, endEvent);\n+2006 }\n+2007\n+2058 template \n+_\b2_\b0_\b6_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2062 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2063 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2064 int numPatchCoords,\n+2065 PATCHCOORD_BUFFER *patchCoords,\n+2066 PATCH_TABLE *patchTable,\n+2067 int fvarChannel,\n+2068 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+2069 DEVICE_CONTEXT deviceContext,\n+2070 unsigned int numStartEvents=0,\n+2071 const cl_event* startEvents=NULL,\n+2072 cl_event* endEvent=NULL) {\n+2073\n+2074 if (instance) {\n+2075 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2076 srcBuffer, srcDesc,\n+2077 dstBuffer, dstDesc,\n+2078 numPatchCoords, patchCoords,\n+2079 patchTable, fvarChannel,\n+2080 numStartEvents, startEvents, endEvent);\n+2081 } else {\n+2082 // Create an instance on demand (slow)\n+2083 (void)deviceContext; // unused\n+2084 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+2085 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2086 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2087 deviceContext);\n+2088 if (instance) {\n+2089 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2090 srcBuffer, srcDesc,\n+2091 dstBuffer, dstDesc,\n+2092 numPatchCoords, patchCoords,\n+2093 patchTable, fvarChannel,\n+2094 numStartEvents, startEvents, endEvent);\n+2095 delete instance;\n+2096 return r;\n+2097 }\n+2098 return false;\n+2099 }\n+2100 }\n+2101\n+2141 template \n+_\b2_\b1_\b4_\b3 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2144 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2145 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2146 int numPatchCoords,\n+2147 PATCHCOORD_BUFFER *patchCoords,\n+2148 PATCH_TABLE *patchTable,\n+2149 int fvarChannel = 0,\n+2150 unsigned int numStartEvents=0,\n+2151 const cl_event* startEvents=NULL,\n+2152 cl_event* endEvent=NULL) const {\n+2153\n+2154 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+2155 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+2156 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2157 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2158 numPatchCoords,\n+2159 patchCoords->BindCLBuffer(_clCommandQueue),\n+2160 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+2161 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+2162 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n+2163 numStartEvents, startEvents, endEvent);\n+2164 }\n+2165\n+2228 template \n+_\b2_\b2_\b3_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2232 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2233 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2234 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2235 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2236 int numPatchCoords,\n+2237 PATCHCOORD_BUFFER *patchCoords,\n+2238 PATCH_TABLE *patchTable,\n+2239 int fvarChannel,\n+2240 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+2241 DEVICE_CONTEXT deviceContext,\n+2242 unsigned int numStartEvents=0,\n+2243 const cl_event* startEvents=NULL,\n+2244 cl_event* endEvent=NULL) {\n+2245\n+2246 if (instance) {\n+2247 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2248 srcBuffer, srcDesc,\n+2249 dstBuffer, dstDesc,\n+2250 duBuffer, duDesc,\n+2251 dvBuffer, dvDesc,\n+2252 numPatchCoords, patchCoords,\n+2253 patchTable, fvarChannel,\n+2254 numStartEvents, startEvents, endEvent);\n+2255 } else {\n+2256 // Create an instance on demand (slow)\n+2257 (void)deviceContext; // unused\n+2258 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+2259 duDesc, dvDesc, deviceContext);\n+2260 if (instance) {\n+2261 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2262 srcBuffer, srcDesc,\n+2263 dstBuffer, dstDesc,\n+2264 duBuffer, duDesc,\n+2265 dvBuffer, dvDesc,\n+2266 numPatchCoords, patchCoords,\n+2267 patchTable, fvarChannel,\n+2268 numStartEvents, startEvents, endEvent);\n+2269 delete instance;\n+2270 return r;\n+2271 }\n+2272 return false;\n+2273 }\n+2274 }\n+2275\n+2327 template \n+_\b2_\b3_\b2_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2330 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2331 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2332 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2333 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2334 int numPatchCoords,\n+2335 PATCHCOORD_BUFFER *patchCoords,\n+2336 PATCH_TABLE *patchTable,\n+2337 int fvarChannel = 0,\n+2338 unsigned int numStartEvents=0,\n+2339 const cl_event* startEvents=NULL,\n+2340 cl_event* endEvent=NULL) const {\n+2341\n+2342 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+2343 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+2344 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+2345 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+2346 numPatchCoords,\n+2347 patchCoords->BindCLBuffer(_clCommandQueue),\n+2348 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+2349 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+2350 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n+2351 numStartEvents, startEvents, endEvent);\n+2352 }\n+2353\n+2434 template \n+_\b2_\b4_\b3_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2438 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2439 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2440 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2441 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2442 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+2443 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+2444 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+2445 int numPatchCoords,\n+2446 PATCHCOORD_BUFFER *patchCoords,\n+2447 PATCH_TABLE *patchTable,\n+2448 int fvarChannel,\n+2449 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+2450 DEVICE_CONTEXT deviceContext,\n+2451 unsigned int numStartEvents=0,\n+2452 const cl_event* startEvents=NULL,\n+2453 cl_event* endEvent=NULL) {\n+2454\n+2455 if (instance) {\n+2456 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2457 srcBuffer, srcDesc,\n+2458 dstBuffer, dstDesc,\n+2459 duBuffer, duDesc,\n+2460 dvBuffer, dvDesc,\n+2461 duuBuffer, duuDesc,\n+2462 duvBuffer, duvDesc,\n+2463 dvvBuffer, dvvDesc,\n+2464 numPatchCoords, patchCoords,\n+2465 patchTable, fvarChannel,\n+2466 numStartEvents, startEvents, endEvent);\n+2467 } else {\n+2468 // Create an instance on demand (slow)\n+2469 (void)deviceContext; // unused\n+2470 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+2471 duDesc, dvDesc,\n+2472 duuDesc, duvDesc, dvvDesc,\n+2473 deviceContext);\n+2474 if (instance) {\n+2475 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2476 srcBuffer, srcDesc,\n+2477 dstBuffer, dstDesc,\n+2478 duBuffer, duDesc,\n+2479 dvBuffer, dvDesc,\n+2480 duuBuffer, duuDesc,\n+2481 duvBuffer, duvDesc,\n+2482 dvvBuffer, dvvDesc,\n+2483 numPatchCoords, patchCoords,\n+2484 patchTable, fvarChannel,\n+2485 numStartEvents, startEvents, endEvent);\n+2486 delete instance;\n+2487 return r;\n+2488 }\n+2489 return false;\n+2490 }\n+2491 }\n+2492\n+2562 template \n+_\b2_\b5_\b6_\b4 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2565 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2566 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2567 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2568 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2569 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+2570 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+2571 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+2572 int numPatchCoords,\n+2573 PATCHCOORD_BUFFER *patchCoords,\n+2574 PATCH_TABLE *patchTable,\n+2575 int fvarChannel = 0,\n+2576 unsigned int numStartEvents=0,\n+2577 const cl_event* startEvents=NULL,\n+2578 cl_event* endEvent=NULL) const {\n+2579\n+2580 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+2581 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+2582 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+2583 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+2584 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n+2585 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n+2586 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n+2587 numPatchCoords,\n+2588 patchCoords->BindCLBuffer(_clCommandQueue),\n+2589 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+2590 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+2591 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n+2592 numStartEvents, startEvents, endEvent);\n+2593 }\n+2594\n+2600\n+_\b2_\b6_\b0_\b3 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2604 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2605 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2606 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2607 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2608 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2609 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n+2610\n+2612 template \n+_\b2_\b6_\b1_\b3 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(DEVICE_CONTEXT deviceContext) {\n+2614 _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(deviceContext->GetCommandQueue());\n+2615 }\n+2616\n+_\b2_\b6_\b1_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(cl_command_queue queue);\n+2618\n+2619private:\n+2620 cl_context _clContext;\n+2621 cl_command_queue _clCommandQueue;\n+2622 cl_program _program;\n+2623 cl_kernel _stencilKernel;\n+2624 cl_kernel _stencilDerivKernel;\n+2625 cl_kernel _patchKernel;\n+2626};\n+2627\n+2628} // end namespace Osd\n+2629\n+2630} // end namespace OPENSUBDIV_VERSION\n+2631using namespace OPENSUBDIV_VERSION;\n+2632\n+2633} // end namespace OpenSubdiv\n+2634\n+2635\n+2636#endif // OPENSUBDIV3_OSD_CL_EVALUATOR_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt_\b:_\b:_\bc_\bo_\bm_\bm_\ba_\bn_\bd_\bQ_\bu_\be_\bu_\be\n-id< MTLCommandQueue > commandQueue\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt_\b:_\b:_\bd_\be_\bv_\bi_\bc_\be\n-id< MTLDevice > device\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Limit stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+BufferDescriptor is a struct which describes buffer elements in interleaved\n+data buffers....\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+OpenCL stencil table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDvvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+CLStencilTable(Far::StencilTable const *stencilTable, cl_context clContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetOffsetsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLStencilTable * Create(Far::LimitStencilTable const *limitStencilTable,\n+DEVICE_CONTEXT context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetIndicesBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+int GetNumStencils() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetSizesBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDuuWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDuvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDuWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+~CLStencilTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLStencilTable * Create(Far::StencilTable const *stencilTable,\n+DEVICE_CONTEXT context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+CLStencilTable(Far::LimitStencilTable const *limitStencilTable, cl_context\n+clContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator\n+const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0,\n+const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic static stencil function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b0_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(cl_command_queue queue)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\b~_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+~CLEvaluator()\n+Destructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n+cl_mem dv, BufferDescriptor const &dvDesc, cl_mem sizes, cl_mem offsets, cl_mem\n+indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, int start, int\n+end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL) const\n+Dispatch the CL compute kernel asynchronously. returns false if the kernel\n+hasn't been compiled yet.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n+const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL)\n+Generic static stencil function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n+const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n+cl_context clContext, cl_command_queue clCommandQueue)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const\n+*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b2_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n+cl_mem dv, BufferDescriptor const &dvDesc, int numPatchCoords, cl_mem\n+patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem\n+patchParamsBuffer, unsigned int numStartEvents=0, const cl_event\n+*startEvents=NULL, cl_event *endEvent=NULL) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b9_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0,\n+const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n+Generic stencil function.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n+bool Instantiatable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n+const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n+DEVICE_CONTEXT deviceContext)\n+Generic creator template.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n+fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b0_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n+const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n+BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc,\n+BufferDescriptor const &dvvDesc, DEVICE_CONTEXT deviceContext)\n+Generic creator template.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n+cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const\n+&duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, cl_mem patchCoordsBuffer,\n+cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n+cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const\n+&duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv,\n+BufferDescriptor const &dvvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices,\n+cl_mem weights, cl_mem duWeights, cl_mem dvWeights, cl_mem duuWeights, cl_mem\n+duvWeights, cl_mem dvvWeights, int start, int end, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+const\n+Dispatch the CL compute kernel asynchronously. returns false if the kernel\n+hasn't been compiled yet.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b5_\b6_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b1_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, unsigned\n+int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL) const\n+Generic stencil function.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance,\n+DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event\n+*startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(DEVICE_CONTEXT deviceContext)\n+Wait the OpenCL kernels finish.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b6_\b1_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance,\n+DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event\n+*startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b2_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n+CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic static stencil function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem sizes, cl_mem offsets, cl_mem indices,\n+cl_mem weights, int start, int end, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n+CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b8_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b3_\b2_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n+CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b4_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n+const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n+BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc,\n+BufferDescriptor const &dvvDesc, cl_context clContext, cl_command_queue\n+clCommandQueue)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n+cl_event *endEvent=NULL) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b7_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const\n+*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b0_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b5_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const\n+*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n+*stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n+cl_event *endEvent=NULL) const\n+Generic stencil function.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n+cl_event *endEvent=NULL) const\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+CLEvaluator(cl_context context, cl_command_queue queue)\n+Constructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n+bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc,\n+BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const\n+&dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(),\n+BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const\n+&dvvDesc=BufferDescriptor())\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n+fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n+cl_event *endEvent=NULL) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b4_\b3\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\n+ * _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00806.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00806.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/clEvaluator.h File Reference\n+OpenSubdiv: opensubdiv/osd/mtlCommon.h File Reference\n \n \n \n \n \n \n \n@@ -90,47 +90,40 @@\n \n \n \n
\n \n-
clEvaluator.h File Reference
\n+
mtlCommon.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../osd/opencl.h"
\n-#include "../osd/types.h"
\n-#include "../osd/bufferDescriptor.h"
\n+#include <cstddef>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n-\n-\n+\n \n

\n Classes

class  CLStencilTable
 OpenCL stencil table. More...
 
class  CLEvaluator
class  MTLContext
 
\n \n \n \n \n \n-\n-\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,23 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-clEvaluator.h File Reference\n+mtlCommon.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-\u00a0 OpenCL stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+class \u00a0 _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n-\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00806.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00806.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,3 @@\n var a00806 = [\n- [\"CLStencilTable\", \"a01137.html\", \"a01137\"],\n- [\"CLEvaluator\", \"a01141.html\", \"a01141\"]\n+ [\"MTLContext\", \"a01277.html\", \"a01277\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00806_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00806_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/clEvaluator.h Source File\n+OpenSubdiv: opensubdiv/osd/mtlCommon.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
clEvaluator.h
\n+
mtlCommon.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,1283 +119,53 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n-
26#define OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n+
25#ifndef OPENSUBDIV3_OSD_MTL_COMMON_H
\n+
26#define OPENSUBDIV3_OSD_MTL_COMMON_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../osd/opencl.h"
\n-
31#include "../osd/types.h"
\n-
32#include "../osd/bufferDescriptor.h"
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Far {
\n-
38 class PatchTable;
\n-
39 class StencilTable;
\n-
40 class LimitStencilTable;
\n-
41}
\n-
42
\n-
43namespace Osd {
\n-
44
\n-
\n-\n-
53public:
\n-
54 template <typename DEVICE_CONTEXT>
\n-
\n-
55 static CLStencilTable *Create(Far::StencilTable const *stencilTable,
\n-
56 DEVICE_CONTEXT context) {
\n-
57 return new CLStencilTable(stencilTable, context->GetContext());
\n-
58 }
\n-
\n-
59
\n-
60 template <typename DEVICE_CONTEXT>
\n-
\n-\n-
62 Far::LimitStencilTable const *limitStencilTable,
\n-
63 DEVICE_CONTEXT context) {
\n-
64 return new CLStencilTable(limitStencilTable, context->GetContext());
\n-
65 }
\n-
\n-
66
\n-
67 CLStencilTable(Far::StencilTable const *stencilTable,
\n-
68 cl_context clContext);
\n-
69 CLStencilTable(Far::LimitStencilTable const *limitStencilTable,
\n-
70 cl_context clContext);
\n-\n-
72
\n-
73 // interfaces needed for CLComputeKernel
\n-
74 cl_mem GetSizesBuffer() const { return _sizes; }
\n-
75 cl_mem GetOffsetsBuffer() const { return _offsets; }
\n-
76 cl_mem GetIndicesBuffer() const { return _indices; }
\n-
77 cl_mem GetWeightsBuffer() const { return _weights; }
\n-
78 cl_mem GetDuWeightsBuffer() const { return _duWeights; }
\n-
79 cl_mem GetDvWeightsBuffer() const { return _dvWeights; }
\n-
80 cl_mem GetDuuWeightsBuffer() const { return _duuWeights; }
\n-
81 cl_mem GetDuvWeightsBuffer() const { return _duvWeights; }
\n-
82 cl_mem GetDvvWeightsBuffer() const { return _dvvWeights; }
\n-
83 int GetNumStencils() const { return _numStencils; }
\n-
84
\n-
85private:
\n-
86 cl_mem _sizes;
\n-
87 cl_mem _offsets;
\n-
88 cl_mem _indices;
\n-
89 cl_mem _weights;
\n-
90 cl_mem _duWeights;
\n-
91 cl_mem _dvWeights;
\n-
92 cl_mem _duuWeights;
\n-
93 cl_mem _duvWeights;
\n-
94 cl_mem _dvvWeights;
\n-
95 int _numStencils;
\n-
96};
\n-
\n-
97
\n-
98// ---------------------------------------------------------------------------
\n-
99
\n-
\n-\n-
101public:
\n-
102 typedef bool Instantiatable;
\n-
103
\n-
105 template <typename DEVICE_CONTEXT>
\n-
\n-
106 static CLEvaluator *Create(BufferDescriptor const &srcDesc,
\n-
107 BufferDescriptor const &dstDesc,
\n-
108 BufferDescriptor const &duDesc,
\n-
109 BufferDescriptor const &dvDesc,
\n-
110 DEVICE_CONTEXT deviceContext) {
\n-
111 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n-
112 deviceContext->GetContext(),
\n-
113 deviceContext->GetCommandQueue());
\n-
114 }
\n-
\n-
115
\n-
\n-
116 static CLEvaluator * Create(BufferDescriptor const &srcDesc,
\n-
117 BufferDescriptor const &dstDesc,
\n-
118 BufferDescriptor const &duDesc,
\n-
119 BufferDescriptor const &dvDesc,
\n-
120 cl_context clContext,
\n-
121 cl_command_queue clCommandQueue) {
\n-
122 CLEvaluator *instance = new CLEvaluator(clContext, clCommandQueue);
\n-
123 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc))
\n-
124 return instance;
\n-
125 delete instance;
\n-
126 return NULL;
\n-
127 }
\n-
\n-
128
\n-
130 template <typename DEVICE_CONTEXT>
\n-
\n-
131 static CLEvaluator *Create(BufferDescriptor const &srcDesc,
\n-
132 BufferDescriptor const &dstDesc,
\n-
133 BufferDescriptor const &duDesc,
\n-
134 BufferDescriptor const &dvDesc,
\n-
135 BufferDescriptor const &duuDesc,
\n-
136 BufferDescriptor const &duvDesc,
\n-
137 BufferDescriptor const &dvvDesc,
\n-
138 DEVICE_CONTEXT deviceContext) {
\n-
139 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n-
140 duuDesc, duvDesc, dvvDesc,
\n-
141 deviceContext->GetContext(),
\n-
142 deviceContext->GetCommandQueue());
\n-
143 }
\n-
\n-
144
\n-
\n-
145 static CLEvaluator * Create(BufferDescriptor const &srcDesc,
\n-
146 BufferDescriptor const &dstDesc,
\n-
147 BufferDescriptor const &duDesc,
\n-
148 BufferDescriptor const &dvDesc,
\n-
149 BufferDescriptor const &duuDesc,
\n-
150 BufferDescriptor const &duvDesc,
\n-
151 BufferDescriptor const &dvvDesc,
\n-
152 cl_context clContext,
\n-
153 cl_command_queue clCommandQueue) {
\n-
154 CLEvaluator *instance = new CLEvaluator(clContext, clCommandQueue);
\n-
155 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc,
\n-
156 duuDesc, duvDesc, dvvDesc))
\n-
157 return instance;
\n-
158 delete instance;
\n-
159 return NULL;
\n-
160 }
\n-
\n-
161
\n-
163 CLEvaluator(cl_context context, cl_command_queue queue);
\n-
164
\n-\n-
167
\n-
173
\n-
217 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
218 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n-
\n-
219 static bool EvalStencils(
\n-
220 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
221 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
222 STENCIL_TABLE const *stencilTable,
\n-
223 CLEvaluator const *instance,
\n-
224 DEVICE_CONTEXT deviceContext,
\n-
225 unsigned int numStartEvents=0,
\n-
226 const cl_event* startEvents=NULL,
\n-
227 cl_event* endEvent=NULL) {
\n-
228
\n-
229 if (instance) {
\n-
230 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
231 dstBuffer, dstDesc,
\n-
232 stencilTable,
\n-
233 numStartEvents, startEvents, endEvent);
\n-
234 } else {
\n-
235 // Create an instance on demand (slow)
\n-
236 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
239 deviceContext);
\n-
240 if (instance) {
\n-
241 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
242 dstBuffer, dstDesc,
\n-
243 stencilTable,
\n-
244 numStartEvents, startEvents, endEvent);
\n-
245 delete instance;
\n-
246 return r;
\n-
247 }
\n-
248 return false;
\n-
249 }
\n-
250 }
\n-
\n-
251
\n-
307 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
308 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n-
\n-
309 static bool EvalStencils(
\n-
310 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
311 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
312 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
313 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
314 STENCIL_TABLE const *stencilTable,
\n-
315 CLEvaluator const *instance,
\n-
316 DEVICE_CONTEXT deviceContext,
\n-
317 unsigned int numStartEvents=0,
\n-
318 const cl_event* startEvents=NULL,
\n-
319 cl_event* endEvent=NULL) {
\n-
320
\n-
321 if (instance) {
\n-
322 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
323 dstBuffer, dstDesc,
\n-
324 duBuffer, duDesc,
\n-
325 dvBuffer, dvDesc,
\n-
326 stencilTable,
\n-
327 numStartEvents, startEvents, endEvent);
\n-
328 } else {
\n-
329 // Create an instance on demand (slow)
\n-
330 instance = Create(srcDesc, dstDesc, duDesc, dvDesc,
\n-
331 deviceContext);
\n-
332 if (instance) {
\n-
333 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
334 dstBuffer, dstDesc,
\n-
335 duBuffer, duDesc,
\n-
336 dvBuffer, dvDesc,
\n-
337 stencilTable,
\n-
338 numStartEvents, startEvents, endEvent);
\n-
339 delete instance;
\n-
340 return r;
\n-
341 }
\n-
342 return false;
\n-
343 }
\n-
344 }
\n-
\n-
345
\n-
419 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
420 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n-
\n-
421 static bool EvalStencils(
\n-
422 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
423 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
424 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
425 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
426 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
427 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
428 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
429 STENCIL_TABLE const *stencilTable,
\n-
430 CLEvaluator const *instance,
\n-
431 DEVICE_CONTEXT deviceContext,
\n-
432 unsigned int numStartEvents=0,
\n-
433 const cl_event* startEvents=NULL,
\n-
434 cl_event* endEvent=NULL) {
\n-
435
\n-
436 if (instance) {
\n-
437 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
438 dstBuffer, dstDesc,
\n-
439 duBuffer, duDesc,
\n-
440 dvBuffer, dvDesc,
\n-
441 duuBuffer, duuDesc,
\n-
442 duvBuffer, duvDesc,
\n-
443 dvvBuffer, dvvDesc,
\n-
444 stencilTable,
\n-
445 numStartEvents, startEvents, endEvent);
\n-
446 } else {
\n-
447 // Create an instance on demand (slow)
\n-
448 instance = Create(srcDesc, dstDesc,
\n-
449 duDesc, dvDesc,
\n-
450 duuDesc, duvDesc, dvvDesc,
\n-
451 deviceContext);
\n-
452 if (instance) {
\n-
453 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
454 dstBuffer, dstDesc,
\n-
455 duBuffer, duDesc,
\n-
456 dvBuffer, dvDesc,
\n-
457 duuBuffer, duuDesc,
\n-
458 duvBuffer, duvDesc,
\n-
459 dvvBuffer, dvvDesc,
\n-
460 stencilTable,
\n-
461 numStartEvents, startEvents, endEvent);
\n-
462 delete instance;
\n-
463 return r;
\n-
464 }
\n-
465 return false;
\n-
466 }
\n-
467 }
\n-
\n-
468
\n-
499 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
501 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
502 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
503 STENCIL_TABLE const *stencilTable,
\n-
504 unsigned int numStartEvents=0,
\n-
505 const cl_event* startEvents=NULL,
\n-
506 cl_event* endEvent=NULL) const {
\n-
507 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
508 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
509 stencilTable->GetSizesBuffer(),
\n-
510 stencilTable->GetOffsetsBuffer(),
\n-
511 stencilTable->GetIndicesBuffer(),
\n-
512 stencilTable->GetWeightsBuffer(),
\n-
513 0,
\n-
514 stencilTable->GetNumStencils(),
\n-
515 numStartEvents, startEvents, endEvent);
\n-
516 }
\n-
\n-
517
\n-
560 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
562 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
563 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
564 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
565 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
566 STENCIL_TABLE const *stencilTable,
\n-
567 unsigned int numStartEvents=0,
\n-
568 const cl_event* startEvents=NULL,
\n-
569 cl_event* endEvent=NULL) const {
\n-
570 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
571 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
572 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
573 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
574 stencilTable->GetSizesBuffer(),
\n-
575 stencilTable->GetOffsetsBuffer(),
\n-
576 stencilTable->GetIndicesBuffer(),
\n-
577 stencilTable->GetWeightsBuffer(),
\n-
578 stencilTable->GetDuWeightsBuffer(),
\n-
579 stencilTable->GetDvWeightsBuffer(),
\n-
580 0,
\n-
581 stencilTable->GetNumStencils(),
\n-
582 numStartEvents, startEvents, endEvent);
\n-
583 }
\n-
\n-
584
\n-
645 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
647 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
648 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
649 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
650 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
651 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
652 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
653 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
654 STENCIL_TABLE const *stencilTable,
\n-
655 unsigned int numStartEvents=0,
\n-
656 const cl_event* startEvents=NULL,
\n-
657 cl_event* endEvent=NULL) const {
\n-
658 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
659 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
660 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
661 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
662 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n-
663 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n-
664 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n-
665 stencilTable->GetSizesBuffer(),
\n-
666 stencilTable->GetOffsetsBuffer(),
\n-
667 stencilTable->GetIndicesBuffer(),
\n-
668 stencilTable->GetWeightsBuffer(),
\n-
669 stencilTable->GetDuWeightsBuffer(),
\n-
670 stencilTable->GetDvWeightsBuffer(),
\n-
671 stencilTable->GetDuuWeightsBuffer(),
\n-
672 stencilTable->GetDuvWeightsBuffer(),
\n-
673 stencilTable->GetDvvWeightsBuffer(),
\n-
674 0,
\n-
675 stencilTable->GetNumStencils(),
\n-
676 numStartEvents, startEvents, endEvent);
\n-
677 }
\n-
\n-
678
\n-
681 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n-
682 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
683 cl_mem sizes,
\n-
684 cl_mem offsets,
\n-
685 cl_mem indices,
\n-
686 cl_mem weights,
\n-
687 int start,
\n-
688 int end,
\n-
689 unsigned int numStartEvents=0,
\n-
690 const cl_event* startEvents=NULL,
\n-
691 cl_event* endEvent=NULL) const;
\n-
692
\n-
741 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n-
742 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
743 cl_mem du, BufferDescriptor const &duDesc,
\n-
744 cl_mem dv, BufferDescriptor const &dvDesc,
\n-
745 cl_mem sizes,
\n-
746 cl_mem offsets,
\n-
747 cl_mem indices,
\n-
748 cl_mem weights,
\n-
749 cl_mem duWeights,
\n-
750 cl_mem dvWeights,
\n-
751 int start,
\n-
752 int end,
\n-
753 unsigned int numStartEvents=0,
\n-
754 const cl_event* startEvents=NULL,
\n-
755 cl_event* endEvent=NULL) const;
\n-
756
\n-
823 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n-
824 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
825 cl_mem du, BufferDescriptor const &duDesc,
\n-
826 cl_mem dv, BufferDescriptor const &dvDesc,
\n-
827 cl_mem duu, BufferDescriptor const &duuDesc,
\n-
828 cl_mem duv, BufferDescriptor const &duvDesc,
\n-
829 cl_mem dvv, BufferDescriptor const &dvvDesc,
\n-
830 cl_mem sizes,
\n-
831 cl_mem offsets,
\n-
832 cl_mem indices,
\n-
833 cl_mem weights,
\n-
834 cl_mem duWeights,
\n-
835 cl_mem dvWeights,
\n-
836 cl_mem duuWeights,
\n-
837 cl_mem duvWeights,
\n-
838 cl_mem dvvWeights,
\n-
839 int start,
\n-
840 int end,
\n-
841 unsigned int numStartEvents=0,
\n-
842 const cl_event* startEvents=NULL,
\n-
843 cl_event* endEvent=NULL) const;
\n-
844
\n-
850
\n-
899 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
900 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
901 typename DEVICE_CONTEXT>
\n-
\n-
902 static bool EvalPatches(
\n-
903 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
904 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
905 int numPatchCoords,
\n-
906 PATCHCOORD_BUFFER *patchCoords,
\n-
907 PATCH_TABLE *patchTable,
\n-
908 CLEvaluator const *instance,
\n-
909 DEVICE_CONTEXT deviceContext,
\n-
910 unsigned int numStartEvents=0,
\n-
911 const cl_event* startEvents=NULL,
\n-
912 cl_event* endEvent=NULL) {
\n-
913
\n-
914 if (instance) {
\n-
915 return instance->EvalPatches(srcBuffer, srcDesc,
\n-
916 dstBuffer, dstDesc,
\n-
917 numPatchCoords, patchCoords,
\n-
918 patchTable,
\n-
919 numStartEvents, startEvents, endEvent);
\n-
920 } else {
\n-
921 // Create an instance on demand (slow)
\n-
922 (void)deviceContext; // unused
\n-
923 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
926 deviceContext);
\n-
927 if (instance) {
\n-
928 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n-
929 dstBuffer, dstDesc,
\n-
930 numPatchCoords, patchCoords,
\n-
931 patchTable,
\n-
932 numStartEvents, startEvents, endEvent);
\n-
933 delete instance;
\n-
934 return r;
\n-
935 }
\n-
936 return false;
\n-
937 }
\n-
938 }
\n-
\n-
939
\n-
1000 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1001 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1002 typename DEVICE_CONTEXT>
\n-
\n-
1003 static bool EvalPatches(
\n-
1004 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1005 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1006 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1007 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1008 int numPatchCoords,
\n-
1009 PATCHCOORD_BUFFER *patchCoords,
\n-
1010 PATCH_TABLE *patchTable,
\n-
1011 CLEvaluator const *instance,
\n-
1012 DEVICE_CONTEXT deviceContext,
\n-
1013 unsigned int numStartEvents=0,
\n-
1014 const cl_event* startEvents=NULL,
\n-
1015 cl_event* endEvent=NULL) {
\n-
1016
\n-
1017 if (instance) {
\n-
1018 return instance->EvalPatches(srcBuffer, srcDesc,
\n-
1019 dstBuffer, dstDesc,
\n-
1020 duBuffer, duDesc,
\n-
1021 dvBuffer, dvDesc,
\n-
1022 numPatchCoords, patchCoords,
\n-
1023 patchTable,
\n-
1024 numStartEvents, startEvents, endEvent);
\n-
1025 } else {
\n-
1026 // Create an instance on demand (slow)
\n-
1027 (void)deviceContext; // unused
\n-
1028 instance = Create(srcDesc, dstDesc, duDesc, dvDesc, deviceContext);
\n-
1029 if (instance) {
\n-
1030 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n-
1031 dstBuffer, dstDesc,
\n-
1032 duBuffer, duDesc,
\n-
1033 dvBuffer, dvDesc,
\n-
1034 numPatchCoords, patchCoords,
\n-
1035 patchTable,
\n-
1036 numStartEvents, startEvents, endEvent);
\n-
1037 delete instance;
\n-
1038 return r;
\n-
1039 }
\n-
1040 return false;
\n-
1041 }
\n-
1042 }
\n-
\n-
1043
\n-
1122 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1123 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1124 typename DEVICE_CONTEXT>
\n-
\n-
1125 static bool EvalPatches(
\n-
1126 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1127 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1128 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1129 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1130 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1131 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1132 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1133 int numPatchCoords,
\n-
1134 PATCHCOORD_BUFFER *patchCoords,
\n-
1135 PATCH_TABLE *patchTable,
\n-
1136 CLEvaluator const *instance,
\n-
1137 DEVICE_CONTEXT deviceContext,
\n-
1138 unsigned int numStartEvents=0,
\n-
1139 const cl_event* startEvents=NULL,
\n-
1140 cl_event* endEvent=NULL) {
\n-
1141
\n-
1142 if (instance) {
\n-
1143 return instance->EvalPatches(srcBuffer, srcDesc,
\n-
1144 dstBuffer, dstDesc,
\n-
1145 duBuffer, duDesc,
\n-
1146 dvBuffer, dvDesc,
\n-
1147 duuBuffer, duuDesc,
\n-
1148 duvBuffer, duvDesc,
\n-
1149 dvvBuffer, dvvDesc,
\n-
1150 numPatchCoords, patchCoords,
\n-
1151 patchTable,
\n-
1152 numStartEvents, startEvents, endEvent);
\n-
1153 } else {
\n-
1154 // Create an instance on demand (slow)
\n-
1155 (void)deviceContext; // unused
\n-
1156 instance = Create(srcDesc, dstDesc,
\n-
1157 duDesc, dvDesc,
\n-
1158 duuDesc, duvDesc, dvvDesc,
\n-
1159 deviceContext);
\n-
1160 if (instance) {
\n-
1161 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n-
1162 dstBuffer, dstDesc,
\n-
1163 duBuffer, duDesc,
\n-
1164 dvBuffer, dvDesc,
\n-
1165 duuBuffer, duuDesc,
\n-
1166 duvBuffer, duvDesc,
\n-
1167 dvvBuffer, dvvDesc,
\n-
1168 numPatchCoords, patchCoords,
\n-
1169 patchTable,
\n-
1170 numStartEvents, startEvents, endEvent);
\n-
1171 delete instance;
\n-
1172 return r;
\n-
1173 }
\n-
1174 return false;
\n-
1175 }
\n-
1176 }
\n-
\n-
1177
\n-
1215 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1216 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1218 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1219 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1220 int numPatchCoords,
\n-
1221 PATCHCOORD_BUFFER *patchCoords,
\n-
1222 PATCH_TABLE *patchTable,
\n-
1223 unsigned int numStartEvents=0,
\n-
1224 const cl_event* startEvents=NULL,
\n-
1225 cl_event* endEvent=NULL) const {
\n-
1226
\n-
1227 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1228 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1229 0, BufferDescriptor(),
\n-
1230 0, BufferDescriptor(),
\n-
1231 numPatchCoords,
\n-
1232 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1233 patchTable->GetPatchArrayBuffer(),
\n-
1234 patchTable->GetPatchIndexBuffer(),
\n-
1235 patchTable->GetPatchParamBuffer(),
\n-
1236 numStartEvents, startEvents, endEvent);
\n-
1237 }
\n-
\n-
1238
\n-
1286 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1287 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1289 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1290 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1291 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1292 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1293 int numPatchCoords,
\n-
1294 PATCHCOORD_BUFFER *patchCoords,
\n-
1295 PATCH_TABLE *patchTable,
\n-
1296 unsigned int numStartEvents=0,
\n-
1297 const cl_event* startEvents=NULL,
\n-
1298 cl_event* endEvent=NULL) const {
\n-
1299
\n-
1300 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1301 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1302 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
1303 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
1304 numPatchCoords,
\n-
1305 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1306 patchTable->GetPatchArrayBuffer(),
\n-
1307 patchTable->GetPatchIndexBuffer(),
\n-
1308 patchTable->GetPatchParamBuffer(),
\n-
1309 numStartEvents, startEvents, endEvent);
\n-
1310 }
\n-
\n-
1311
\n-
1377 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1378 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1380 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1381 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1382 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1383 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1384 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1385 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1386 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1387 int numPatchCoords,
\n-
1388 PATCHCOORD_BUFFER *patchCoords,
\n-
1389 PATCH_TABLE *patchTable,
\n-
1390 unsigned int numStartEvents=0,
\n-
1391 const cl_event* startEvents=NULL,
\n-
1392 cl_event* endEvent=NULL) const {
\n-
1393
\n-
1394 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1395 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1396 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
1397 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
1398 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n-
1399 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n-
1400 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n-
1401 numPatchCoords,
\n-
1402 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1403 patchTable->GetPatchArrayBuffer(),
\n-
1404 patchTable->GetPatchIndexBuffer(),
\n-
1405 patchTable->GetPatchParamBuffer(),
\n-
1406 numStartEvents, startEvents, endEvent);
\n-
1407 }
\n-
\n-
1408
\n-
1409 bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc,
\n-
1410 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
1411 cl_mem du, BufferDescriptor const &duDesc,
\n-
1412 cl_mem dv, BufferDescriptor const &dvDesc,
\n-
1413 int numPatchCoords,
\n-
1414 cl_mem patchCoordsBuffer,
\n-
1415 cl_mem patchArrayBuffer,
\n-
1416 cl_mem patchIndexBuffer,
\n-
1417 cl_mem patchParamsBuffer,
\n-
1418 unsigned int numStartEvents=0,
\n-
1419 const cl_event* startEvents=NULL,
\n-
1420 cl_event* endEvent=NULL) const;
\n-
1421
\n-
1422 bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc,
\n-
1423 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
1424 cl_mem du, BufferDescriptor const &duDesc,
\n-
1425 cl_mem dv, BufferDescriptor const &dvDesc,
\n-
1426 cl_mem duu, BufferDescriptor const &duuDesc,
\n-
1427 cl_mem duv, BufferDescriptor const &duvDesc,
\n-
1428 cl_mem dvv, BufferDescriptor const &dvvDesc,
\n-
1429 int numPatchCoords,
\n-
1430 cl_mem patchCoordsBuffer,
\n-
1431 cl_mem patchArrayBuffer,
\n-
1432 cl_mem patchIndexBuffer,
\n-
1433 cl_mem patchParamsBuffer,
\n-
1434 unsigned int numStartEvents=0,
\n-
1435 const cl_event* startEvents=NULL,
\n-
1436 cl_event* endEvent=NULL) const;
\n-
1437
\n-
1486 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1487 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1488 typename DEVICE_CONTEXT>
\n-
\n-\n-
1490 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1491 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1492 int numPatchCoords,
\n-
1493 PATCHCOORD_BUFFER *patchCoords,
\n-
1494 PATCH_TABLE *patchTable,
\n-
1495 CLEvaluator const *instance,
\n-
1496 DEVICE_CONTEXT deviceContext,
\n-
1497 unsigned int numStartEvents=0,
\n-
1498 const cl_event* startEvents=NULL,
\n-
1499 cl_event* endEvent=NULL) {
\n-
1500
\n-
1501 if (instance) {
\n-
1502 return instance->EvalPatchesVarying(
\n-
1503 srcBuffer, srcDesc,
\n-
1504 dstBuffer, dstDesc,
\n-
1505 numPatchCoords, patchCoords,
\n-
1506 patchTable,
\n-
1507 numStartEvents, startEvents, endEvent);
\n-
1508 } else {
\n-
1509 // Create an instance on demand (slow)
\n-
1510 (void)deviceContext; // unused
\n-
1511 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
1514 deviceContext);
\n-
1515 if (instance) {
\n-
1516 bool r = instance->EvalPatchesVarying(
\n-
1517 srcBuffer, srcDesc,
\n-
1518 dstBuffer, dstDesc,
\n-
1519 numPatchCoords, patchCoords,
\n-
1520 patchTable,
\n-
1521 numStartEvents, startEvents, endEvent);
\n-
1522 delete instance;
\n-
1523 return r;
\n-
1524 }
\n-
1525 return false;
\n-
1526 }
\n-
1527 }
\n-
\n-
1528
\n-
1566 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1567 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1569 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1570 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1571 int numPatchCoords,
\n-
1572 PATCHCOORD_BUFFER *patchCoords,
\n-
1573 PATCH_TABLE *patchTable,
\n-
1574 unsigned int numStartEvents=0,
\n-
1575 const cl_event* startEvents=NULL,
\n-
1576 cl_event* endEvent=NULL) const {
\n-
1577
\n-
1578 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1579 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1580 0, BufferDescriptor(),
\n-
1581 0, BufferDescriptor(),
\n-
1582 numPatchCoords,
\n-
1583 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1584 patchTable->GetVaryingPatchArrayBuffer(),
\n-
1585 patchTable->GetVaryingPatchIndexBuffer(),
\n-
1586 patchTable->GetPatchParamBuffer(),
\n-
1587 numStartEvents, startEvents, endEvent);
\n-
1588 }
\n-
\n-
1589
\n-
1650 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1651 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1652 typename DEVICE_CONTEXT>
\n-
\n-\n-
1654 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1655 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1656 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1657 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1658 int numPatchCoords,
\n-
1659 PATCHCOORD_BUFFER *patchCoords,
\n-
1660 PATCH_TABLE *patchTable,
\n-
1661 CLEvaluator const *instance,
\n-
1662 DEVICE_CONTEXT deviceContext,
\n-
1663 unsigned int numStartEvents=0,
\n-
1664 const cl_event* startEvents=NULL,
\n-
1665 cl_event* endEvent=NULL) {
\n-
1666
\n-
1667 if (instance) {
\n-
1668 return instance->EvalPatchesVarying(
\n-
1669 srcBuffer, srcDesc,
\n-
1670 dstBuffer, dstDesc,
\n-
1671 duBuffer, duDesc,
\n-
1672 dvBuffer, dvDesc,
\n-
1673 numPatchCoords, patchCoords,
\n-
1674 patchTable,
\n-
1675 numStartEvents, startEvents, endEvent);
\n-
1676 } else {
\n-
1677 // Create an instance on demand (slow)
\n-
1678 (void)deviceContext; // unused
\n-
1679 instance = Create(srcDesc, dstDesc,
\n-
1680 duDesc, dvDesc,
\n-
1681 deviceContext);
\n-
1682 if (instance) {
\n-
1683 bool r = instance->EvalPatchesVarying(
\n-
1684 srcBuffer, srcDesc,
\n-
1685 dstBuffer, dstDesc,
\n-
1686 duBuffer, duDesc,
\n-
1687 dvBuffer, dvDesc,
\n-
1688 numPatchCoords, patchCoords,
\n-
1689 patchTable,
\n-
1690 numStartEvents, startEvents, endEvent);
\n-
1691 delete instance;
\n-
1692 return r;
\n-
1693 }
\n-
1694 return false;
\n-
1695 }
\n-
1696 }
\n-
\n-
1697
\n-
1747 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1748 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1750 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1751 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1752 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1753 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1754 int numPatchCoords,
\n-
1755 PATCHCOORD_BUFFER *patchCoords,
\n-
1756 PATCH_TABLE *patchTable,
\n-
1757 unsigned int numStartEvents=0,
\n-
1758 const cl_event* startEvents=NULL,
\n-
1759 cl_event* endEvent=NULL) const {
\n-
1760
\n-
1761 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1762 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1763 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
1764 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
1765 numPatchCoords,
\n-
1766 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1767 patchTable->GetVaryingPatchArrayBuffer(),
\n-
1768 patchTable->GetVaryingPatchIndexBuffer(),
\n-
1769 patchTable->GetPatchParamBuffer(),
\n-
1770 numStartEvents, startEvents, endEvent);
\n-
1771 }
\n-
\n-
1772
\n-
1851 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1852 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1853 typename DEVICE_CONTEXT>
\n-
\n-\n-
1855 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1856 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1857 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1858 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1859 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1860 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1861 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1862 int numPatchCoords,
\n-
1863 PATCHCOORD_BUFFER *patchCoords,
\n-
1864 PATCH_TABLE *patchTable,
\n-
1865 CLEvaluator const *instance,
\n-
1866 DEVICE_CONTEXT deviceContext,
\n-
1867 unsigned int numStartEvents=0,
\n-
1868 const cl_event* startEvents=NULL,
\n-
1869 cl_event* endEvent=NULL) {
\n-
1870
\n-
1871 if (instance) {
\n-
1872 return instance->EvalPatchesVarying(
\n-
1873 srcBuffer, srcDesc,
\n-
1874 dstBuffer, dstDesc,
\n-
1875 duBuffer, duDesc,
\n-
1876 dvBuffer, dvDesc,
\n-
1877 duuBuffer, duuDesc,
\n-
1878 duvBuffer, duvDesc,
\n-
1879 dvvBuffer, dvvDesc,
\n-
1880 numPatchCoords, patchCoords,
\n-
1881 patchTable,
\n-
1882 numStartEvents, startEvents, endEvent);
\n-
1883 } else {
\n-
1884 // Create an instance on demand (slow)
\n-
1885 (void)deviceContext; // unused
\n-
1886 instance = Create(srcDesc, dstDesc,
\n-
1887 duDesc, dvDesc,
\n-
1888 duuDesc, duvDesc, dvvDesc,
\n-
1889 deviceContext);
\n-
1890 if (instance) {
\n-
1891 bool r = instance->EvalPatchesVarying(
\n-
1892 srcBuffer, srcDesc,
\n-
1893 dstBuffer, dstDesc,
\n-
1894 duBuffer, duDesc,
\n-
1895 dvBuffer, dvDesc,
\n-
1896 duuBuffer, duuDesc,
\n-
1897 duvBuffer, duvDesc,
\n-
1898 dvvBuffer, dvvDesc,
\n-
1899 numPatchCoords, patchCoords,
\n-
1900 patchTable,
\n-
1901 numStartEvents, startEvents, endEvent);
\n-
1902 delete instance;
\n-
1903 return r;
\n-
1904 }
\n-
1905 return false;
\n-
1906 }
\n-
1907 }
\n-
\n-
1908
\n-
1976 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1977 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1979 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1980 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1981 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1982 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1983 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1984 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1985 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1986 int numPatchCoords,
\n-
1987 PATCHCOORD_BUFFER *patchCoords,
\n-
1988 PATCH_TABLE *patchTable,
\n-
1989 unsigned int numStartEvents=0,
\n-
1990 const cl_event* startEvents=NULL,
\n-
1991 cl_event* endEvent=NULL) const {
\n-
1992
\n-
1993 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1994 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1995 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
1996 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
1997 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n-
1998 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n-
1999 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n-
2000 numPatchCoords,
\n-
2001 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
2002 patchTable->GetVaryingPatchArrayBuffer(),
\n-
2003 patchTable->GetVaryingPatchIndexBuffer(),
\n-
2004 patchTable->GetPatchParamBuffer(),
\n-
2005 numStartEvents, startEvents, endEvent);
\n-
2006 }
\n-
\n-
2007
\n-
2058 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2059 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
2060 typename DEVICE_CONTEXT>
\n-
\n-\n-
2062 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2063 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2064 int numPatchCoords,
\n-
2065 PATCHCOORD_BUFFER *patchCoords,
\n-
2066 PATCH_TABLE *patchTable,
\n-
2067 int fvarChannel,
\n-
2068 CLEvaluator const *instance,
\n-
2069 DEVICE_CONTEXT deviceContext,
\n-
2070 unsigned int numStartEvents=0,
\n-
2071 const cl_event* startEvents=NULL,
\n-
2072 cl_event* endEvent=NULL) {
\n-
2073
\n-
2074 if (instance) {
\n-
2075 return instance->EvalPatchesFaceVarying(
\n-
2076 srcBuffer, srcDesc,
\n-
2077 dstBuffer, dstDesc,
\n-
2078 numPatchCoords, patchCoords,
\n-
2079 patchTable, fvarChannel,
\n-
2080 numStartEvents, startEvents, endEvent);
\n-
2081 } else {
\n-
2082 // Create an instance on demand (slow)
\n-
2083 (void)deviceContext; // unused
\n-
2084 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
2087 deviceContext);
\n-
2088 if (instance) {
\n-
2089 bool r = instance->EvalPatchesFaceVarying(
\n-
2090 srcBuffer, srcDesc,
\n-
2091 dstBuffer, dstDesc,
\n-
2092 numPatchCoords, patchCoords,
\n-
2093 patchTable, fvarChannel,
\n-
2094 numStartEvents, startEvents, endEvent);
\n-
2095 delete instance;
\n-
2096 return r;
\n-
2097 }
\n-
2098 return false;
\n-
2099 }
\n-
2100 }
\n-
\n-
2101
\n-
2141 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2142 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
2144 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2145 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2146 int numPatchCoords,
\n-
2147 PATCHCOORD_BUFFER *patchCoords,
\n-
2148 PATCH_TABLE *patchTable,
\n-
2149 int fvarChannel = 0,
\n-
2150 unsigned int numStartEvents=0,
\n-
2151 const cl_event* startEvents=NULL,
\n-
2152 cl_event* endEvent=NULL) const {
\n-
2153
\n-
2154 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
2155 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
2156 0, BufferDescriptor(),
\n-
2157 0, BufferDescriptor(),
\n-
2158 numPatchCoords,
\n-
2159 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
2160 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
2161 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
2162 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n-
2163 numStartEvents, startEvents, endEvent);
\n-
2164 }
\n-
\n-
2165
\n-
2228 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2229 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
2230 typename DEVICE_CONTEXT>
\n-
\n-\n-
2232 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2233 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2234 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
2235 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
2236 int numPatchCoords,
\n-
2237 PATCHCOORD_BUFFER *patchCoords,
\n-
2238 PATCH_TABLE *patchTable,
\n-
2239 int fvarChannel,
\n-
2240 CLEvaluator const *instance,
\n-
2241 DEVICE_CONTEXT deviceContext,
\n-
2242 unsigned int numStartEvents=0,
\n-
2243 const cl_event* startEvents=NULL,
\n-
2244 cl_event* endEvent=NULL) {
\n-
2245
\n-
2246 if (instance) {
\n-
2247 return instance->EvalPatchesFaceVarying(
\n-
2248 srcBuffer, srcDesc,
\n-
2249 dstBuffer, dstDesc,
\n-
2250 duBuffer, duDesc,
\n-
2251 dvBuffer, dvDesc,
\n-
2252 numPatchCoords, patchCoords,
\n-
2253 patchTable, fvarChannel,
\n-
2254 numStartEvents, startEvents, endEvent);
\n-
2255 } else {
\n-
2256 // Create an instance on demand (slow)
\n-
2257 (void)deviceContext; // unused
\n-
2258 instance = Create(srcDesc, dstDesc,
\n-
2259 duDesc, dvDesc, deviceContext);
\n-
2260 if (instance) {
\n-
2261 bool r = instance->EvalPatchesFaceVarying(
\n-
2262 srcBuffer, srcDesc,
\n-
2263 dstBuffer, dstDesc,
\n-
2264 duBuffer, duDesc,
\n-
2265 dvBuffer, dvDesc,
\n-
2266 numPatchCoords, patchCoords,
\n-
2267 patchTable, fvarChannel,
\n-
2268 numStartEvents, startEvents, endEvent);
\n-
2269 delete instance;
\n-
2270 return r;
\n-
2271 }
\n-
2272 return false;
\n-
2273 }
\n-
2274 }
\n-
\n-
2275
\n-
2327 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2328 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
2330 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2331 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2332 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
2333 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
2334 int numPatchCoords,
\n-
2335 PATCHCOORD_BUFFER *patchCoords,
\n-
2336 PATCH_TABLE *patchTable,
\n-
2337 int fvarChannel = 0,
\n-
2338 unsigned int numStartEvents=0,
\n-
2339 const cl_event* startEvents=NULL,
\n-
2340 cl_event* endEvent=NULL) const {
\n-
2341
\n-
2342 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
2343 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
2344 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
2345 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
2346 numPatchCoords,
\n-
2347 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
2348 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
2349 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
2350 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n-
2351 numStartEvents, startEvents, endEvent);
\n-
2352 }
\n-
\n-
2353
\n-
2434 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2435 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
2436 typename DEVICE_CONTEXT>
\n-
\n-\n-
2438 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2439 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2440 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
2441 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
2442 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
2443 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
2444 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
2445 int numPatchCoords,
\n-
2446 PATCHCOORD_BUFFER *patchCoords,
\n-
2447 PATCH_TABLE *patchTable,
\n-
2448 int fvarChannel,
\n-
2449 CLEvaluator const *instance,
\n-
2450 DEVICE_CONTEXT deviceContext,
\n-
2451 unsigned int numStartEvents=0,
\n-
2452 const cl_event* startEvents=NULL,
\n-
2453 cl_event* endEvent=NULL) {
\n-
2454
\n-
2455 if (instance) {
\n-
2456 return instance->EvalPatchesFaceVarying(
\n-
2457 srcBuffer, srcDesc,
\n-
2458 dstBuffer, dstDesc,
\n-
2459 duBuffer, duDesc,
\n-
2460 dvBuffer, dvDesc,
\n-
2461 duuBuffer, duuDesc,
\n-
2462 duvBuffer, duvDesc,
\n-
2463 dvvBuffer, dvvDesc,
\n-
2464 numPatchCoords, patchCoords,
\n-
2465 patchTable, fvarChannel,
\n-
2466 numStartEvents, startEvents, endEvent);
\n-
2467 } else {
\n-
2468 // Create an instance on demand (slow)
\n-
2469 (void)deviceContext; // unused
\n-
2470 instance = Create(srcDesc, dstDesc,
\n-
2471 duDesc, dvDesc,
\n-
2472 duuDesc, duvDesc, dvvDesc,
\n-
2473 deviceContext);
\n-
2474 if (instance) {
\n-
2475 bool r = instance->EvalPatchesFaceVarying(
\n-
2476 srcBuffer, srcDesc,
\n-
2477 dstBuffer, dstDesc,
\n-
2478 duBuffer, duDesc,
\n-
2479 dvBuffer, dvDesc,
\n-
2480 duuBuffer, duuDesc,
\n-
2481 duvBuffer, duvDesc,
\n-
2482 dvvBuffer, dvvDesc,
\n-
2483 numPatchCoords, patchCoords,
\n-
2484 patchTable, fvarChannel,
\n-
2485 numStartEvents, startEvents, endEvent);
\n-
2486 delete instance;
\n-
2487 return r;
\n-
2488 }
\n-
2489 return false;
\n-
2490 }
\n-
2491 }
\n-
\n-
2492
\n-
2562 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2563 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
2565 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2566 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2567 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
2568 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
2569 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
2570 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
2571 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
2572 int numPatchCoords,
\n-
2573 PATCHCOORD_BUFFER *patchCoords,
\n-
2574 PATCH_TABLE *patchTable,
\n-
2575 int fvarChannel = 0,
\n-
2576 unsigned int numStartEvents=0,
\n-
2577 const cl_event* startEvents=NULL,
\n-
2578 cl_event* endEvent=NULL) const {
\n-
2579
\n-
2580 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
2581 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
2582 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
2583 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
2584 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n-
2585 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n-
2586 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n-
2587 numPatchCoords,
\n-
2588 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
2589 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
2590 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
2591 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n-
2592 numStartEvents, startEvents, endEvent);
\n-
2593 }
\n-
\n-
2594
\n-
2600
\n-
2603 bool Compile(BufferDescriptor const &srcDesc,
\n-
2604 BufferDescriptor const &dstDesc,
\n-
2605 BufferDescriptor const &duDesc = BufferDescriptor(),
\n-
2606 BufferDescriptor const &dvDesc = BufferDescriptor(),
\n-
2607 BufferDescriptor const &duuDesc = BufferDescriptor(),
\n-
2608 BufferDescriptor const &duvDesc = BufferDescriptor(),
\n-
2609 BufferDescriptor const &dvvDesc = BufferDescriptor());
\n-
2610
\n-
2612 template <typename DEVICE_CONTEXT>
\n-
\n-
2613 static void Synchronize(DEVICE_CONTEXT deviceContext) {
\n-
2614 Synchronize(deviceContext->GetCommandQueue());
\n-
2615 }
\n-
\n-
2616
\n-
2617 static void Synchronize(cl_command_queue queue);
\n-
2618
\n-
2619private:
\n-
2620 cl_context _clContext;
\n-
2621 cl_command_queue _clCommandQueue;
\n-
2622 cl_program _program;
\n-
2623 cl_kernel _stencilKernel;
\n-
2624 cl_kernel _stencilDerivKernel;
\n-
2625 cl_kernel _patchKernel;
\n-
2626};
\n-
\n-
2627
\n-
2628} // end namespace Osd
\n-
2629
\n-
2630} // end namespace OPENSUBDIV_VERSION
\n-
2631using namespace OPENSUBDIV_VERSION;
\n-
2632
\n-
2633} // end namespace OpenSubdiv
\n-
2634
\n-
2635
\n-
2636#endif // OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n+
30#include <cstddef>
\n+
31
\n+
32@protocol MTLDevice;
\n+
33@protocol MTLCommandQueue;
\n+
34
\n+
35namespace OpenSubdiv {
\n+
36namespace OPENSUBDIV_VERSION {
\n+
37
\n+
38namespace Osd {
\n+
39
\n+
\n+\n+
41public:
\n+
42 id<MTLDevice> device = nullptr;
\n+
43 id<MTLCommandQueue> commandQueue = nullptr;
\n+
44};
\n+
\n+
45
\n+
46} // end namespace Osd
\n+
47
\n+
48} // end namespace OPENSUBDIV_VERSION
\n+
49using namespace OPENSUBDIV_VERSION;
\n+
50
\n+
51} // end namespace OpenSubdiv
\n+
52
\n+
53#endif //OPENSUBDIV3_OSD_MTL_COMMON_H
\n \n-
Stencil table class wrapping the template for compatibility.
\n-
Limit stencil table class wrapping the template for compatibility.
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-\n-
CLStencilTable(Far::StencilTable const *stencilTable, cl_context clContext)
\n-\n-
static CLStencilTable * Create(Far::LimitStencilTable const *limitStencilTable, DEVICE_CONTEXT context)
Definition clEvaluator.h:61
\n-\n-\n-\n-\n-\n-\n-\n-\n-
static CLStencilTable * Create(Far::StencilTable const *stencilTable, DEVICE_CONTEXT context)
Definition clEvaluator.h:55
\n-
CLStencilTable(Far::LimitStencilTable const *limitStencilTable, cl_context clContext)
\n-\n-\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n-
static void Synchronize(cl_command_queue queue)
\n-\n-
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Dispatch the CL compute kernel asynchronously. returns false if the kernel hasn't been compiled yet.
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n-
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, cl_context clContext, cl_command_queue clCommandQueue)
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, int numPatchCoords, cl_mem patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n-
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n-
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-\n-
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, DEVICE_CONTEXT deviceContext)
Generic creator template.
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, DEVICE_CONTEXT deviceContext)
Generic creator template.
\n-
bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const &duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, cl_mem patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n-
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const &duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv, BufferDescriptor const &dvvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, cl_mem duuWeights, cl_mem duvWeights, cl_mem dvvWeights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Dispatch the CL compute kernel asynchronously. returns false if the kernel hasn't been compiled yet.
\n-
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static void Synchronize(DEVICE_CONTEXT deviceContext)
Wait the OpenCL kernels finish.
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n-
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, cl_context clContext, cl_command_queue clCommandQueue)
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n-
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
CLEvaluator(cl_context context, cl_command_queue queue)
Constructor.
\n-
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const &dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(), BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const &dvvDesc=BufferDescriptor())
\n-
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-clEvaluator.h\n+mtlCommon.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,1553 +24,50 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_CL_EVALUATOR_H\n-26#define OPENSUBDIV3_OSD_CL_EVALUATOR_H\n+25#ifndef OPENSUBDIV3_OSD_MTL_COMMON_H\n+26#define OPENSUBDIV3_OSD_MTL_COMMON_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../osd/opencl.h\"\n-31#include \"../osd/types.h\"\n-32#include \"../osd/bufferDescriptor.h\"\n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Far {\n-38 class PatchTable;\n-39 class StencilTable;\n-40 class LimitStencilTable;\n-41}\n-42\n-43namespace Osd {\n-44\n-_\b5_\b2class _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n-53public:\n-54 template \n-_\b5_\b5 static _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-56 DEVICE_CONTEXT context) {\n-57 return new _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, context->GetContext());\n-58 }\n-59\n-60 template \n-_\b6_\b1 static _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(\n-62 _\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n-63 DEVICE_CONTEXT context) {\n-64 return new _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(limitStencilTable, context->GetContext());\n-65 }\n-66\n-_\b6_\b7 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-68 cl_context clContext);\n-_\b6_\b9 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n-70 cl_context clContext);\n-_\b7_\b1 _\b~_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n-72\n-73 // interfaces needed for CLComputeKernel\n-_\b7_\b4 cl_mem _\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _sizes; }\n-_\b7_\b5 cl_mem _\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _offsets; }\n-_\b7_\b6 cl_mem _\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _indices; }\n-_\b7_\b7 cl_mem _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _weights; }\n-_\b7_\b8 cl_mem _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duWeights; }\n-_\b7_\b9 cl_mem _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvWeights; }\n-_\b8_\b0 cl_mem _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duuWeights; }\n-_\b8_\b1 cl_mem _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duvWeights; }\n-_\b8_\b2 cl_mem _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvvWeights; }\n-_\b8_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n-84\n-85private:\n-86 cl_mem _sizes;\n-87 cl_mem _offsets;\n-88 cl_mem _indices;\n-89 cl_mem _weights;\n-90 cl_mem _duWeights;\n-91 cl_mem _dvWeights;\n-92 cl_mem _duuWeights;\n-93 cl_mem _duvWeights;\n-94 cl_mem _dvvWeights;\n-95 int _numStencils;\n-96};\n-97\n-98// --------------------------------------------------------------------------\n--\n-99\n-_\b1_\b0_\b0class _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n-101public:\n-_\b1_\b0_\b2 typedef bool _\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be;\n-103\n-105 template \n-_\b1_\b0_\b6 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *_\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-108 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-109 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-110 DEVICE_CONTEXT deviceContext) {\n-111 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-112 deviceContext->GetContext(),\n-113 deviceContext->GetCommandQueue());\n-114 }\n-115\n-_\b1_\b1_\b6 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-117 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-118 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-119 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-120 cl_context clContext,\n-121 cl_command_queue clCommandQueue) {\n-122 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(clContext, clCommandQueue);\n-123 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc))\n-124 return instance;\n-125 delete instance;\n-126 return NULL;\n-127 }\n-128\n-130 template \n-_\b1_\b3_\b1 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *_\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-132 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-133 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-134 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-135 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-136 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-137 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-138 DEVICE_CONTEXT deviceContext) {\n-139 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-140 duuDesc, duvDesc, dvvDesc,\n-141 deviceContext->GetContext(),\n-142 deviceContext->GetCommandQueue());\n-143 }\n-144\n-_\b1_\b4_\b5 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-146 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-147 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-148 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-149 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-150 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-151 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-152 cl_context clContext,\n-153 cl_command_queue clCommandQueue) {\n-154 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(clContext, clCommandQueue);\n-155 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-156 duuDesc, duvDesc, dvvDesc))\n-157 return instance;\n-158 delete instance;\n-159 return NULL;\n-160 }\n-161\n-_\b1_\b6_\b3 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(cl_context context, cl_command_queue queue);\n-164\n-_\b1_\b6_\b6 _\b~_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n-167\n-173\n-217 template \n-_\b2_\b1_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-220 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-221 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-222 STENCIL_TABLE const *stencilTable,\n-223 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-224 DEVICE_CONTEXT deviceContext,\n-225 unsigned int numStartEvents=0,\n-226 const cl_event* startEvents=NULL,\n-227 cl_event* endEvent=NULL) {\n-228\n-229 if (instance) {\n-230 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-231 dstBuffer, dstDesc,\n-232 stencilTable,\n-233 numStartEvents, startEvents, endEvent);\n-234 } else {\n-235 // Create an instance on demand (slow)\n-236 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-237 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-238 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-239 deviceContext);\n-240 if (instance) {\n-241 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-242 dstBuffer, dstDesc,\n-243 stencilTable,\n-244 numStartEvents, startEvents, endEvent);\n-245 delete instance;\n-246 return r;\n-247 }\n-248 return false;\n-249 }\n-250 }\n-251\n-307 template \n-_\b3_\b0_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-310 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-311 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-312 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-313 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-314 STENCIL_TABLE const *stencilTable,\n-315 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-316 DEVICE_CONTEXT deviceContext,\n-317 unsigned int numStartEvents=0,\n-318 const cl_event* startEvents=NULL,\n-319 cl_event* endEvent=NULL) {\n-320\n-321 if (instance) {\n-322 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-323 dstBuffer, dstDesc,\n-324 duBuffer, duDesc,\n-325 dvBuffer, dvDesc,\n-326 stencilTable,\n-327 numStartEvents, startEvents, endEvent);\n-328 } else {\n-329 // Create an instance on demand (slow)\n-330 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-331 deviceContext);\n-332 if (instance) {\n-333 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-334 dstBuffer, dstDesc,\n-335 duBuffer, duDesc,\n-336 dvBuffer, dvDesc,\n-337 stencilTable,\n-338 numStartEvents, startEvents, endEvent);\n-339 delete instance;\n-340 return r;\n-341 }\n-342 return false;\n-343 }\n-344 }\n-345\n-419 template \n-_\b4_\b2_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-422 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-423 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-424 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-425 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-426 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-427 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-428 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-429 STENCIL_TABLE const *stencilTable,\n-430 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-431 DEVICE_CONTEXT deviceContext,\n-432 unsigned int numStartEvents=0,\n-433 const cl_event* startEvents=NULL,\n-434 cl_event* endEvent=NULL) {\n-435\n-436 if (instance) {\n-437 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-438 dstBuffer, dstDesc,\n-439 duBuffer, duDesc,\n-440 dvBuffer, dvDesc,\n-441 duuBuffer, duuDesc,\n-442 duvBuffer, duvDesc,\n-443 dvvBuffer, dvvDesc,\n-444 stencilTable,\n-445 numStartEvents, startEvents, endEvent);\n-446 } else {\n-447 // Create an instance on demand (slow)\n-448 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-449 duDesc, dvDesc,\n-450 duuDesc, duvDesc, dvvDesc,\n-451 deviceContext);\n-452 if (instance) {\n-453 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-454 dstBuffer, dstDesc,\n-455 duBuffer, duDesc,\n-456 dvBuffer, dvDesc,\n-457 duuBuffer, duuDesc,\n-458 duvBuffer, duvDesc,\n-459 dvvBuffer, dvvDesc,\n-460 stencilTable,\n-461 numStartEvents, startEvents, endEvent);\n-462 delete instance;\n-463 return r;\n-464 }\n-465 return false;\n-466 }\n-467 }\n-468\n-499 template \n-_\b5_\b0_\b0 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-501 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-502 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-503 STENCIL_TABLE const *stencilTable,\n-504 unsigned int numStartEvents=0,\n-505 const cl_event* startEvents=NULL,\n-506 cl_event* endEvent=NULL) const {\n-507 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-508 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-509 stencilTable->GetSizesBuffer(),\n-510 stencilTable->GetOffsetsBuffer(),\n-511 stencilTable->GetIndicesBuffer(),\n-512 stencilTable->GetWeightsBuffer(),\n-513 0,\n-514 stencilTable->GetNumStencils(),\n-515 numStartEvents, startEvents, endEvent);\n-516 }\n-517\n-560 template \n-_\b5_\b6_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-562 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-563 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-564 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-565 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-566 STENCIL_TABLE const *stencilTable,\n-567 unsigned int numStartEvents=0,\n-568 const cl_event* startEvents=NULL,\n-569 cl_event* endEvent=NULL) const {\n-570 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-571 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-572 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-573 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-574 stencilTable->GetSizesBuffer(),\n-575 stencilTable->GetOffsetsBuffer(),\n-576 stencilTable->GetIndicesBuffer(),\n-577 stencilTable->GetWeightsBuffer(),\n-578 stencilTable->GetDuWeightsBuffer(),\n-579 stencilTable->GetDvWeightsBuffer(),\n-580 0,\n-581 stencilTable->GetNumStencils(),\n-582 numStartEvents, startEvents, endEvent);\n-583 }\n-584\n-645 template \n-_\b6_\b4_\b6 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-647 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-648 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-649 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-650 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-651 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-652 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-653 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-654 STENCIL_TABLE const *stencilTable,\n-655 unsigned int numStartEvents=0,\n-656 const cl_event* startEvents=NULL,\n-657 cl_event* endEvent=NULL) const {\n-658 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-659 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-660 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-661 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-662 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n-663 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n-664 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n-665 stencilTable->GetSizesBuffer(),\n-666 stencilTable->GetOffsetsBuffer(),\n-667 stencilTable->GetIndicesBuffer(),\n-668 stencilTable->GetWeightsBuffer(),\n-669 stencilTable->GetDuWeightsBuffer(),\n-670 stencilTable->GetDvWeightsBuffer(),\n-671 stencilTable->GetDuuWeightsBuffer(),\n-672 stencilTable->GetDuvWeightsBuffer(),\n-673 stencilTable->GetDvvWeightsBuffer(),\n-674 0,\n-675 stencilTable->GetNumStencils(),\n-676 numStartEvents, startEvents, endEvent);\n-677 }\n-678\n-_\b6_\b8_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-682 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-683 cl_mem sizes,\n-684 cl_mem offsets,\n-685 cl_mem indices,\n-686 cl_mem weights,\n-687 int start,\n-688 int end,\n-689 unsigned int numStartEvents=0,\n-690 const cl_event* startEvents=NULL,\n-691 cl_event* endEvent=NULL) const;\n-692\n-_\b7_\b4_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-742 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-743 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-744 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-745 cl_mem sizes,\n-746 cl_mem offsets,\n-747 cl_mem indices,\n-748 cl_mem weights,\n-749 cl_mem duWeights,\n-750 cl_mem dvWeights,\n-751 int start,\n-752 int end,\n-753 unsigned int numStartEvents=0,\n-754 const cl_event* startEvents=NULL,\n-755 cl_event* endEvent=NULL) const;\n-756\n-_\b8_\b2_\b3 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-824 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-825 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-826 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-827 cl_mem duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-828 cl_mem duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-829 cl_mem dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-830 cl_mem sizes,\n-831 cl_mem offsets,\n-832 cl_mem indices,\n-833 cl_mem weights,\n-834 cl_mem duWeights,\n-835 cl_mem dvWeights,\n-836 cl_mem duuWeights,\n-837 cl_mem duvWeights,\n-838 cl_mem dvvWeights,\n-839 int start,\n-840 int end,\n-841 unsigned int numStartEvents=0,\n-842 const cl_event* startEvents=NULL,\n-843 cl_event* endEvent=NULL) const;\n-844\n-850\n-899 template \n-_\b9_\b0_\b2 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-903 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-904 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-905 int numPatchCoords,\n-906 PATCHCOORD_BUFFER *patchCoords,\n-907 PATCH_TABLE *patchTable,\n-908 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-909 DEVICE_CONTEXT deviceContext,\n-910 unsigned int numStartEvents=0,\n-911 const cl_event* startEvents=NULL,\n-912 cl_event* endEvent=NULL) {\n-913\n-914 if (instance) {\n-915 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-916 dstBuffer, dstDesc,\n-917 numPatchCoords, patchCoords,\n-918 patchTable,\n-919 numStartEvents, startEvents, endEvent);\n-920 } else {\n-921 // Create an instance on demand (slow)\n-922 (void)deviceContext; // unused\n-923 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-924 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-925 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-926 deviceContext);\n-927 if (instance) {\n-928 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-929 dstBuffer, dstDesc,\n-930 numPatchCoords, patchCoords,\n-931 patchTable,\n-932 numStartEvents, startEvents, endEvent);\n-933 delete instance;\n-934 return r;\n-935 }\n-936 return false;\n-937 }\n-938 }\n-939\n-1000 template \n-_\b1_\b0_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1004 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1005 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1006 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1007 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1008 int numPatchCoords,\n-1009 PATCHCOORD_BUFFER *patchCoords,\n-1010 PATCH_TABLE *patchTable,\n-1011 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1012 DEVICE_CONTEXT deviceContext,\n-1013 unsigned int numStartEvents=0,\n-1014 const cl_event* startEvents=NULL,\n-1015 cl_event* endEvent=NULL) {\n-1016\n-1017 if (instance) {\n-1018 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-1019 dstBuffer, dstDesc,\n-1020 duBuffer, duDesc,\n-1021 dvBuffer, dvDesc,\n-1022 numPatchCoords, patchCoords,\n-1023 patchTable,\n-1024 numStartEvents, startEvents, endEvent);\n-1025 } else {\n-1026 // Create an instance on demand (slow)\n-1027 (void)deviceContext; // unused\n-1028 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc, deviceContext);\n-1029 if (instance) {\n-1030 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-1031 dstBuffer, dstDesc,\n-1032 duBuffer, duDesc,\n-1033 dvBuffer, dvDesc,\n-1034 numPatchCoords, patchCoords,\n-1035 patchTable,\n-1036 numStartEvents, startEvents, endEvent);\n-1037 delete instance;\n-1038 return r;\n-1039 }\n-1040 return false;\n-1041 }\n-1042 }\n-1043\n-1122 template \n-_\b1_\b1_\b2_\b5 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1126 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1127 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1128 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1129 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1130 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1131 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1132 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1133 int numPatchCoords,\n-1134 PATCHCOORD_BUFFER *patchCoords,\n-1135 PATCH_TABLE *patchTable,\n-1136 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1137 DEVICE_CONTEXT deviceContext,\n-1138 unsigned int numStartEvents=0,\n-1139 const cl_event* startEvents=NULL,\n-1140 cl_event* endEvent=NULL) {\n-1141\n-1142 if (instance) {\n-1143 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-1144 dstBuffer, dstDesc,\n-1145 duBuffer, duDesc,\n-1146 dvBuffer, dvDesc,\n-1147 duuBuffer, duuDesc,\n-1148 duvBuffer, duvDesc,\n-1149 dvvBuffer, dvvDesc,\n-1150 numPatchCoords, patchCoords,\n-1151 patchTable,\n-1152 numStartEvents, startEvents, endEvent);\n-1153 } else {\n-1154 // Create an instance on demand (slow)\n-1155 (void)deviceContext; // unused\n-1156 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1157 duDesc, dvDesc,\n-1158 duuDesc, duvDesc, dvvDesc,\n-1159 deviceContext);\n-1160 if (instance) {\n-1161 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-1162 dstBuffer, dstDesc,\n-1163 duBuffer, duDesc,\n-1164 dvBuffer, dvDesc,\n-1165 duuBuffer, duuDesc,\n-1166 duvBuffer, duvDesc,\n-1167 dvvBuffer, dvvDesc,\n-1168 numPatchCoords, patchCoords,\n-1169 patchTable,\n-1170 numStartEvents, startEvents, endEvent);\n-1171 delete instance;\n-1172 return r;\n-1173 }\n-1174 return false;\n-1175 }\n-1176 }\n-1177\n-1215 template \n-_\b1_\b2_\b1_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1218 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1219 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1220 int numPatchCoords,\n-1221 PATCHCOORD_BUFFER *patchCoords,\n-1222 PATCH_TABLE *patchTable,\n-1223 unsigned int numStartEvents=0,\n-1224 const cl_event* startEvents=NULL,\n-1225 cl_event* endEvent=NULL) const {\n-1226\n-1227 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1228 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1229 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1230 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1231 numPatchCoords,\n-1232 patchCoords->BindCLBuffer(_clCommandQueue),\n-1233 patchTable->GetPatchArrayBuffer(),\n-1234 patchTable->GetPatchIndexBuffer(),\n-1235 patchTable->GetPatchParamBuffer(),\n-1236 numStartEvents, startEvents, endEvent);\n-1237 }\n-1238\n-1286 template \n-_\b1_\b2_\b8_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1289 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1290 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1291 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1292 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1293 int numPatchCoords,\n-1294 PATCHCOORD_BUFFER *patchCoords,\n-1295 PATCH_TABLE *patchTable,\n-1296 unsigned int numStartEvents=0,\n-1297 const cl_event* startEvents=NULL,\n-1298 cl_event* endEvent=NULL) const {\n-1299\n-1300 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1301 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1302 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-1303 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-1304 numPatchCoords,\n-1305 patchCoords->BindCLBuffer(_clCommandQueue),\n-1306 patchTable->GetPatchArrayBuffer(),\n-1307 patchTable->GetPatchIndexBuffer(),\n-1308 patchTable->GetPatchParamBuffer(),\n-1309 numStartEvents, startEvents, endEvent);\n-1310 }\n-1311\n-1377 template \n-_\b1_\b3_\b7_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1380 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1381 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1382 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1383 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1384 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1385 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1386 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1387 int numPatchCoords,\n-1388 PATCHCOORD_BUFFER *patchCoords,\n-1389 PATCH_TABLE *patchTable,\n-1390 unsigned int numStartEvents=0,\n-1391 const cl_event* startEvents=NULL,\n-1392 cl_event* endEvent=NULL) const {\n-1393\n-1394 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1395 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1396 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-1397 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-1398 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n-1399 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n-1400 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n-1401 numPatchCoords,\n-1402 patchCoords->BindCLBuffer(_clCommandQueue),\n-1403 patchTable->GetPatchArrayBuffer(),\n-1404 patchTable->GetPatchIndexBuffer(),\n-1405 patchTable->GetPatchParamBuffer(),\n-1406 numStartEvents, startEvents, endEvent);\n-1407 }\n-1408\n-_\b1_\b4_\b0_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1410 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1411 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1412 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1413 int numPatchCoords,\n-1414 cl_mem patchCoordsBuffer,\n-1415 cl_mem patchArrayBuffer,\n-1416 cl_mem patchIndexBuffer,\n-1417 cl_mem patchParamsBuffer,\n-1418 unsigned int numStartEvents=0,\n-1419 const cl_event* startEvents=NULL,\n-1420 cl_event* endEvent=NULL) const;\n-1421\n-_\b1_\b4_\b2_\b2 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1423 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1424 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1425 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1426 cl_mem duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1427 cl_mem duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1428 cl_mem dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1429 int numPatchCoords,\n-1430 cl_mem patchCoordsBuffer,\n-1431 cl_mem patchArrayBuffer,\n-1432 cl_mem patchIndexBuffer,\n-1433 cl_mem patchParamsBuffer,\n-1434 unsigned int numStartEvents=0,\n-1435 const cl_event* startEvents=NULL,\n-1436 cl_event* endEvent=NULL) const;\n-1437\n-1486 template \n-_\b1_\b4_\b8_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1490 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1491 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1492 int numPatchCoords,\n-1493 PATCHCOORD_BUFFER *patchCoords,\n-1494 PATCH_TABLE *patchTable,\n-1495 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1496 DEVICE_CONTEXT deviceContext,\n-1497 unsigned int numStartEvents=0,\n-1498 const cl_event* startEvents=NULL,\n-1499 cl_event* endEvent=NULL) {\n-1500\n-1501 if (instance) {\n-1502 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1503 srcBuffer, srcDesc,\n-1504 dstBuffer, dstDesc,\n-1505 numPatchCoords, patchCoords,\n-1506 patchTable,\n-1507 numStartEvents, startEvents, endEvent);\n-1508 } else {\n-1509 // Create an instance on demand (slow)\n-1510 (void)deviceContext; // unused\n-1511 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1512 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1513 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1514 deviceContext);\n-1515 if (instance) {\n-1516 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1517 srcBuffer, srcDesc,\n-1518 dstBuffer, dstDesc,\n-1519 numPatchCoords, patchCoords,\n-1520 patchTable,\n-1521 numStartEvents, startEvents, endEvent);\n-1522 delete instance;\n-1523 return r;\n-1524 }\n-1525 return false;\n-1526 }\n-1527 }\n-1528\n-1566 template \n-_\b1_\b5_\b6_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1569 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1570 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1571 int numPatchCoords,\n-1572 PATCHCOORD_BUFFER *patchCoords,\n-1573 PATCH_TABLE *patchTable,\n-1574 unsigned int numStartEvents=0,\n-1575 const cl_event* startEvents=NULL,\n-1576 cl_event* endEvent=NULL) const {\n-1577\n-1578 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1579 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1580 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1581 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1582 numPatchCoords,\n-1583 patchCoords->BindCLBuffer(_clCommandQueue),\n-1584 patchTable->GetVaryingPatchArrayBuffer(),\n-1585 patchTable->GetVaryingPatchIndexBuffer(),\n-1586 patchTable->GetPatchParamBuffer(),\n-1587 numStartEvents, startEvents, endEvent);\n-1588 }\n-1589\n-1650 template \n-_\b1_\b6_\b5_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1654 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1655 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1656 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1657 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1658 int numPatchCoords,\n-1659 PATCHCOORD_BUFFER *patchCoords,\n-1660 PATCH_TABLE *patchTable,\n-1661 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1662 DEVICE_CONTEXT deviceContext,\n-1663 unsigned int numStartEvents=0,\n-1664 const cl_event* startEvents=NULL,\n-1665 cl_event* endEvent=NULL) {\n-1666\n-1667 if (instance) {\n-1668 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1669 srcBuffer, srcDesc,\n-1670 dstBuffer, dstDesc,\n-1671 duBuffer, duDesc,\n-1672 dvBuffer, dvDesc,\n-1673 numPatchCoords, patchCoords,\n-1674 patchTable,\n-1675 numStartEvents, startEvents, endEvent);\n-1676 } else {\n-1677 // Create an instance on demand (slow)\n-1678 (void)deviceContext; // unused\n-1679 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1680 duDesc, dvDesc,\n-1681 deviceContext);\n-1682 if (instance) {\n-1683 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1684 srcBuffer, srcDesc,\n-1685 dstBuffer, dstDesc,\n-1686 duBuffer, duDesc,\n-1687 dvBuffer, dvDesc,\n-1688 numPatchCoords, patchCoords,\n-1689 patchTable,\n-1690 numStartEvents, startEvents, endEvent);\n-1691 delete instance;\n-1692 return r;\n-1693 }\n-1694 return false;\n-1695 }\n-1696 }\n-1697\n-1747 template \n-_\b1_\b7_\b4_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1750 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1751 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1752 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1753 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1754 int numPatchCoords,\n-1755 PATCHCOORD_BUFFER *patchCoords,\n-1756 PATCH_TABLE *patchTable,\n-1757 unsigned int numStartEvents=0,\n-1758 const cl_event* startEvents=NULL,\n-1759 cl_event* endEvent=NULL) const {\n-1760\n-1761 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1762 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1763 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-1764 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-1765 numPatchCoords,\n-1766 patchCoords->BindCLBuffer(_clCommandQueue),\n-1767 patchTable->GetVaryingPatchArrayBuffer(),\n-1768 patchTable->GetVaryingPatchIndexBuffer(),\n-1769 patchTable->GetPatchParamBuffer(),\n-1770 numStartEvents, startEvents, endEvent);\n-1771 }\n-1772\n-1851 template \n-_\b1_\b8_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1855 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1856 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1857 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1858 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1859 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1860 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1861 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1862 int numPatchCoords,\n-1863 PATCHCOORD_BUFFER *patchCoords,\n-1864 PATCH_TABLE *patchTable,\n-1865 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1866 DEVICE_CONTEXT deviceContext,\n-1867 unsigned int numStartEvents=0,\n-1868 const cl_event* startEvents=NULL,\n-1869 cl_event* endEvent=NULL) {\n-1870\n-1871 if (instance) {\n-1872 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1873 srcBuffer, srcDesc,\n-1874 dstBuffer, dstDesc,\n-1875 duBuffer, duDesc,\n-1876 dvBuffer, dvDesc,\n-1877 duuBuffer, duuDesc,\n-1878 duvBuffer, duvDesc,\n-1879 dvvBuffer, dvvDesc,\n-1880 numPatchCoords, patchCoords,\n-1881 patchTable,\n-1882 numStartEvents, startEvents, endEvent);\n-1883 } else {\n-1884 // Create an instance on demand (slow)\n-1885 (void)deviceContext; // unused\n-1886 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1887 duDesc, dvDesc,\n-1888 duuDesc, duvDesc, dvvDesc,\n-1889 deviceContext);\n-1890 if (instance) {\n-1891 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1892 srcBuffer, srcDesc,\n-1893 dstBuffer, dstDesc,\n-1894 duBuffer, duDesc,\n-1895 dvBuffer, dvDesc,\n-1896 duuBuffer, duuDesc,\n-1897 duvBuffer, duvDesc,\n-1898 dvvBuffer, dvvDesc,\n-1899 numPatchCoords, patchCoords,\n-1900 patchTable,\n-1901 numStartEvents, startEvents, endEvent);\n-1902 delete instance;\n-1903 return r;\n-1904 }\n-1905 return false;\n-1906 }\n-1907 }\n-1908\n-1976 template \n-_\b1_\b9_\b7_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1979 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1980 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1981 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1982 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1983 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1984 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1985 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1986 int numPatchCoords,\n-1987 PATCHCOORD_BUFFER *patchCoords,\n-1988 PATCH_TABLE *patchTable,\n-1989 unsigned int numStartEvents=0,\n-1990 const cl_event* startEvents=NULL,\n-1991 cl_event* endEvent=NULL) const {\n-1992\n-1993 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1994 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1995 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-1996 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-1997 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n-1998 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n-1999 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n-2000 numPatchCoords,\n-2001 patchCoords->BindCLBuffer(_clCommandQueue),\n-2002 patchTable->GetVaryingPatchArrayBuffer(),\n-2003 patchTable->GetVaryingPatchIndexBuffer(),\n-2004 patchTable->GetPatchParamBuffer(),\n-2005 numStartEvents, startEvents, endEvent);\n-2006 }\n-2007\n-2058 template \n-_\b2_\b0_\b6_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2062 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2063 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2064 int numPatchCoords,\n-2065 PATCHCOORD_BUFFER *patchCoords,\n-2066 PATCH_TABLE *patchTable,\n-2067 int fvarChannel,\n-2068 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-2069 DEVICE_CONTEXT deviceContext,\n-2070 unsigned int numStartEvents=0,\n-2071 const cl_event* startEvents=NULL,\n-2072 cl_event* endEvent=NULL) {\n-2073\n-2074 if (instance) {\n-2075 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2076 srcBuffer, srcDesc,\n-2077 dstBuffer, dstDesc,\n-2078 numPatchCoords, patchCoords,\n-2079 patchTable, fvarChannel,\n-2080 numStartEvents, startEvents, endEvent);\n-2081 } else {\n-2082 // Create an instance on demand (slow)\n-2083 (void)deviceContext; // unused\n-2084 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-2085 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2086 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2087 deviceContext);\n-2088 if (instance) {\n-2089 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2090 srcBuffer, srcDesc,\n-2091 dstBuffer, dstDesc,\n-2092 numPatchCoords, patchCoords,\n-2093 patchTable, fvarChannel,\n-2094 numStartEvents, startEvents, endEvent);\n-2095 delete instance;\n-2096 return r;\n-2097 }\n-2098 return false;\n-2099 }\n-2100 }\n-2101\n-2141 template \n-_\b2_\b1_\b4_\b3 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2144 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2145 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2146 int numPatchCoords,\n-2147 PATCHCOORD_BUFFER *patchCoords,\n-2148 PATCH_TABLE *patchTable,\n-2149 int fvarChannel = 0,\n-2150 unsigned int numStartEvents=0,\n-2151 const cl_event* startEvents=NULL,\n-2152 cl_event* endEvent=NULL) const {\n-2153\n-2154 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-2155 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-2156 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2157 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2158 numPatchCoords,\n-2159 patchCoords->BindCLBuffer(_clCommandQueue),\n-2160 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-2161 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-2162 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n-2163 numStartEvents, startEvents, endEvent);\n-2164 }\n-2165\n-2228 template \n-_\b2_\b2_\b3_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2232 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2233 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2234 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2235 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2236 int numPatchCoords,\n-2237 PATCHCOORD_BUFFER *patchCoords,\n-2238 PATCH_TABLE *patchTable,\n-2239 int fvarChannel,\n-2240 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-2241 DEVICE_CONTEXT deviceContext,\n-2242 unsigned int numStartEvents=0,\n-2243 const cl_event* startEvents=NULL,\n-2244 cl_event* endEvent=NULL) {\n-2245\n-2246 if (instance) {\n-2247 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2248 srcBuffer, srcDesc,\n-2249 dstBuffer, dstDesc,\n-2250 duBuffer, duDesc,\n-2251 dvBuffer, dvDesc,\n-2252 numPatchCoords, patchCoords,\n-2253 patchTable, fvarChannel,\n-2254 numStartEvents, startEvents, endEvent);\n-2255 } else {\n-2256 // Create an instance on demand (slow)\n-2257 (void)deviceContext; // unused\n-2258 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-2259 duDesc, dvDesc, deviceContext);\n-2260 if (instance) {\n-2261 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2262 srcBuffer, srcDesc,\n-2263 dstBuffer, dstDesc,\n-2264 duBuffer, duDesc,\n-2265 dvBuffer, dvDesc,\n-2266 numPatchCoords, patchCoords,\n-2267 patchTable, fvarChannel,\n-2268 numStartEvents, startEvents, endEvent);\n-2269 delete instance;\n-2270 return r;\n-2271 }\n-2272 return false;\n-2273 }\n-2274 }\n-2275\n-2327 template \n-_\b2_\b3_\b2_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2330 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2331 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2332 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2333 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2334 int numPatchCoords,\n-2335 PATCHCOORD_BUFFER *patchCoords,\n-2336 PATCH_TABLE *patchTable,\n-2337 int fvarChannel = 0,\n-2338 unsigned int numStartEvents=0,\n-2339 const cl_event* startEvents=NULL,\n-2340 cl_event* endEvent=NULL) const {\n-2341\n-2342 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-2343 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-2344 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-2345 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-2346 numPatchCoords,\n-2347 patchCoords->BindCLBuffer(_clCommandQueue),\n-2348 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-2349 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-2350 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n-2351 numStartEvents, startEvents, endEvent);\n-2352 }\n-2353\n-2434 template \n-_\b2_\b4_\b3_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2438 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2439 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2440 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2441 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2442 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-2443 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-2444 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-2445 int numPatchCoords,\n-2446 PATCHCOORD_BUFFER *patchCoords,\n-2447 PATCH_TABLE *patchTable,\n-2448 int fvarChannel,\n-2449 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-2450 DEVICE_CONTEXT deviceContext,\n-2451 unsigned int numStartEvents=0,\n-2452 const cl_event* startEvents=NULL,\n-2453 cl_event* endEvent=NULL) {\n-2454\n-2455 if (instance) {\n-2456 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2457 srcBuffer, srcDesc,\n-2458 dstBuffer, dstDesc,\n-2459 duBuffer, duDesc,\n-2460 dvBuffer, dvDesc,\n-2461 duuBuffer, duuDesc,\n-2462 duvBuffer, duvDesc,\n-2463 dvvBuffer, dvvDesc,\n-2464 numPatchCoords, patchCoords,\n-2465 patchTable, fvarChannel,\n-2466 numStartEvents, startEvents, endEvent);\n-2467 } else {\n-2468 // Create an instance on demand (slow)\n-2469 (void)deviceContext; // unused\n-2470 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-2471 duDesc, dvDesc,\n-2472 duuDesc, duvDesc, dvvDesc,\n-2473 deviceContext);\n-2474 if (instance) {\n-2475 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2476 srcBuffer, srcDesc,\n-2477 dstBuffer, dstDesc,\n-2478 duBuffer, duDesc,\n-2479 dvBuffer, dvDesc,\n-2480 duuBuffer, duuDesc,\n-2481 duvBuffer, duvDesc,\n-2482 dvvBuffer, dvvDesc,\n-2483 numPatchCoords, patchCoords,\n-2484 patchTable, fvarChannel,\n-2485 numStartEvents, startEvents, endEvent);\n-2486 delete instance;\n-2487 return r;\n-2488 }\n-2489 return false;\n-2490 }\n-2491 }\n-2492\n-2562 template \n-_\b2_\b5_\b6_\b4 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2565 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2566 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2567 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2568 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2569 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-2570 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-2571 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-2572 int numPatchCoords,\n-2573 PATCHCOORD_BUFFER *patchCoords,\n-2574 PATCH_TABLE *patchTable,\n-2575 int fvarChannel = 0,\n-2576 unsigned int numStartEvents=0,\n-2577 const cl_event* startEvents=NULL,\n-2578 cl_event* endEvent=NULL) const {\n-2579\n-2580 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-2581 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-2582 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-2583 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-2584 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n-2585 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n-2586 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n-2587 numPatchCoords,\n-2588 patchCoords->BindCLBuffer(_clCommandQueue),\n-2589 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-2590 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-2591 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n-2592 numStartEvents, startEvents, endEvent);\n-2593 }\n-2594\n-2600\n-_\b2_\b6_\b0_\b3 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2604 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2605 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2606 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2607 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2608 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2609 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n-2610\n-2612 template \n-_\b2_\b6_\b1_\b3 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(DEVICE_CONTEXT deviceContext) {\n-2614 _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(deviceContext->GetCommandQueue());\n-2615 }\n-2616\n-_\b2_\b6_\b1_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(cl_command_queue queue);\n-2618\n-2619private:\n-2620 cl_context _clContext;\n-2621 cl_command_queue _clCommandQueue;\n-2622 cl_program _program;\n-2623 cl_kernel _stencilKernel;\n-2624 cl_kernel _stencilDerivKernel;\n-2625 cl_kernel _patchKernel;\n-2626};\n-2627\n-2628} // end namespace Osd\n-2629\n-2630} // end namespace OPENSUBDIV_VERSION\n-2631using namespace OPENSUBDIV_VERSION;\n-2632\n-2633} // end namespace OpenSubdiv\n-2634\n-2635\n-2636#endif // OPENSUBDIV3_OSD_CL_EVALUATOR_H\n+30#include \n+31\n+32@protocol MTLDevice;\n+33@protocol MTLCommandQueue;\n+34\n+35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+36namespace OPENSUBDIV_VERSION {\n+37\n+38namespace Osd {\n+39\n+_\b4_\b0class _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt {\n+41public:\n+_\b4_\b2 id _\bd_\be_\bv_\bi_\bc_\be = nullptr;\n+_\b4_\b3 id _\bc_\bo_\bm_\bm_\ba_\bn_\bd_\bQ_\bu_\be_\bu_\be = nullptr;\n+44};\n+45\n+46} // end namespace Osd\n+47\n+48} // end namespace OPENSUBDIV_VERSION\n+49using namespace OPENSUBDIV_VERSION;\n+50\n+51} // end namespace OpenSubdiv\n+52\n+53#endif //OPENSUBDIV3_OSD_MTL_COMMON_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Limit stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-BufferDescriptor is a struct which describes buffer elements in interleaved\n-data buffers....\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-OpenCL stencil table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDvvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-CLStencilTable(Far::StencilTable const *stencilTable, cl_context clContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetOffsetsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLStencilTable * Create(Far::LimitStencilTable const *limitStencilTable,\n-DEVICE_CONTEXT context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetIndicesBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-int GetNumStencils() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetSizesBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDuuWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDuvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDuWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-~CLStencilTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLStencilTable * Create(Far::StencilTable const *stencilTable,\n-DEVICE_CONTEXT context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-CLStencilTable(Far::LimitStencilTable const *limitStencilTable, cl_context\n-clContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator\n-const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0,\n-const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic static stencil function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b0_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(cl_command_queue queue)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\b~_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-~CLEvaluator()\n-Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n-cl_mem dv, BufferDescriptor const &dvDesc, cl_mem sizes, cl_mem offsets, cl_mem\n-indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, int start, int\n-end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL) const\n-Dispatch the CL compute kernel asynchronously. returns false if the kernel\n-hasn't been compiled yet.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n-const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL)\n-Generic static stencil function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n-const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n-cl_context clContext, cl_command_queue clCommandQueue)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const\n-*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b2_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n-cl_mem dv, BufferDescriptor const &dvDesc, int numPatchCoords, cl_mem\n-patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem\n-patchParamsBuffer, unsigned int numStartEvents=0, const cl_event\n-*startEvents=NULL, cl_event *endEvent=NULL) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b9_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0,\n-const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n-Generic stencil function.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n-bool Instantiatable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n-const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n-DEVICE_CONTEXT deviceContext)\n-Generic creator template.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n-fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b0_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n-const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n-BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc,\n-BufferDescriptor const &dvvDesc, DEVICE_CONTEXT deviceContext)\n-Generic creator template.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n-cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const\n-&duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, cl_mem patchCoordsBuffer,\n-cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n-cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const\n-&duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv,\n-BufferDescriptor const &dvvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices,\n-cl_mem weights, cl_mem duWeights, cl_mem dvWeights, cl_mem duuWeights, cl_mem\n-duvWeights, cl_mem dvvWeights, int start, int end, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-const\n-Dispatch the CL compute kernel asynchronously. returns false if the kernel\n-hasn't been compiled yet.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b5_\b6_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b1_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, unsigned\n-int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL) const\n-Generic stencil function.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance,\n-DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event\n-*startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(DEVICE_CONTEXT deviceContext)\n-Wait the OpenCL kernels finish.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b6_\b1_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance,\n-DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event\n-*startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b2_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n-CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic static stencil function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem sizes, cl_mem offsets, cl_mem indices,\n-cl_mem weights, int start, int end, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n-CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b8_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b3_\b2_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n-CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b4_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n-const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n-BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc,\n-BufferDescriptor const &dvvDesc, cl_context clContext, cl_command_queue\n-clCommandQueue)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n-cl_event *endEvent=NULL) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b7_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const\n-*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b0_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b5_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const\n-*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n-*stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n-cl_event *endEvent=NULL) const\n-Generic stencil function.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n-cl_event *endEvent=NULL) const\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-CLEvaluator(cl_context context, cl_command_queue queue)\n-Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n-bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc,\n-BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const\n-&dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(),\n-BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const\n-&dvvDesc=BufferDescriptor())\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n-fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n-cl_event *endEvent=NULL) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b4_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt_\b:_\b:_\bc_\bo_\bm_\bm_\ba_\bn_\bd_\bQ_\bu_\be_\bu_\be\n+id< MTLCommandQueue > commandQueue\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt_\b:_\b:_\bd_\be_\bv_\bi_\bc_\be\n+id< MTLDevice > device\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b2\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00809.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00809.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlMesh.h File Reference\n+OpenSubdiv: opensubdiv/osd/mtlPatchShaderSource.h File Reference\n \n \n \n \n \n \n \n@@ -88,43 +88,43 @@\n \n \n \n \n \n
\n \n-
mtlMesh.h File Reference
\n+Classes |\n+Namespaces
\n+
mtlPatchShaderSource.h File Reference
\n \n
\n-
#include "../version.h"
\n-#include "../osd/mesh.h"
\n-#include "../osd/mtlPatchTable.h"
\n+
import "../version.h"
\n+import "../far/patchDescriptor.h"
\n+import <string>
\n
\n

Go to the source code of this file.

\n \n+\n+\n+\n+

\n+Classes

class  MTLPatchShaderSource
 
\n \n \n \n \n \n \n \n-

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n-\n-\n-\n

\n-Typedefs

typedef MeshInterface< MTLPatchTableMTLMeshInterface
 
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,24 +1,24 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n-mtlMesh.h File Reference\n-#include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\be_\bs_\bh_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+mtlPatchShaderSource.h File Reference\n+import \"../version.h\"\n+import \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+import \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+class \u00a0 _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n-T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n-typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be< _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be >\u00a0 _\bM_\bT_\bL_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n-\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bM_\be_\bs_\bh_\b._\bh\n+ * _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00809.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00809.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00809 = [\n- [\"MTLMeshInterface\", \"a00809.html#aa41e5b43fe46eeb0f97ff6ebdb1935aa\", null]\n+ [\"MTLPatchShaderSource\", \"a01293.html\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00809_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00809_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlMesh.h Source File\n+OpenSubdiv: opensubdiv/osd/mtlPatchShaderSource.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
mtlMesh.h
\n+
mtlPatchShaderSource.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,44 +119,74 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_MTL_MESH_H
\n-
26#define OPENSUBDIV3_OSD_MTL_MESH_H
\n+
25#ifndef OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE_H
\n+
26#define OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE_H
\n
27
\n-
28#include "../version.h"
\n-
29#include "../osd/mesh.h"
\n-
30#include "../osd/mtlPatchTable.h"
\n+
28#import "../version.h"
\n+
29#import "../far/patchDescriptor.h"
\n+
30#import <string>
\n
31
\n-
32
\n-
33namespace OpenSubdiv {
\n-
34namespace OPENSUBDIV_VERSION {
\n-
35
\n-
36namespace Osd {
\n-
37
\n-\n-
39
\n-
40} // end namespace Osd
\n-
41
\n-
42} // end namespace OPENSUBDIV_VERSION
\n-
43using namespace OPENSUBDIV_VERSION;
\n+
32namespace OpenSubdiv {
\n+
33namespace OPENSUBDIV_VERSION {
\n+
34
\n+
35namespace Osd {
\n+
36
\n+
\n+\n+
38 public:
\n+
39 static std::string GetCommonShaderSource();
\n+
40
\n+
41 static std::string GetPatchBasisShaderSource();
\n+
42
\n+\n
44
\n-
45} // end namespace OpenSubdiv
\n+\n
46
\n-
47#endif // OPENSUBDIV3_OSD_MTL_MESH_H
\n+\n+
48
\n+
53 static std::string GetVertexShaderSource(
\n+\n+\n+
56 static std::string GetHullShaderSource(
\n+\n+\n+
59 static std::string GetDomainShaderSource(
\n+\n+\n+
62};
\n+
\n+
63
\n+
64} // end namespace Osd
\n+
65
\n+
66} // end namespace OPENSUBDIV_VERSION
\n+
67using namespace OPENSUBDIV_VERSION;
\n+
68
\n+
69} // end namespace OpenSubdiv
\n+
70
\n+
71#endif // OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE
\n \n-
MeshInterface< MTLPatchTable > MTLMeshInterface
Definition mtlMesh.h:38
\n-\n+\n+\n+
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)
\n+
static std::string GetHullShaderSource(Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
\n+
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)
\n+
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
Deprecated.
\n+
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
\n+
static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)
\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-mtlMesh.h\n+mtlPatchShaderSource.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,41 +24,87 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_MTL_MESH_H\n-26#define OPENSUBDIV3_OSD_MTL_MESH_H\n+25#ifndef OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE_H\n+26#define OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE_H\n 27\n-28#include \"../version.h\"\n-29#include \"../osd/mesh.h\"\n-30#include \"../osd/mtlPatchTable.h\"\n+28#import \"../version.h\"\n+29#import \"../far/patchDescriptor.h\"\n+30#import \n 31\n-32\n-33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-34namespace OPENSUBDIV_VERSION {\n-35\n-36namespace Osd {\n-37\n-_\b3_\b8typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b<_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b> _\bM_\bT_\bL_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be;\n-39\n-40} // end namespace Osd\n-41\n-42} // end namespace OPENSUBDIV_VERSION\n-43using namespace OPENSUBDIV_VERSION;\n+32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+33namespace OPENSUBDIV_VERSION {\n+34\n+35namespace Osd {\n+36\n+_\b3_\b7class _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be {\n+38 public:\n+_\b3_\b9 static std::string _\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n+40\n+_\b4_\b1 static std::string _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n+42\n+_\b4_\b3 static std::string _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n 44\n-45} // end namespace OpenSubdiv\n+_\b4_\b5 static std::string _\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n 46\n-47#endif // OPENSUBDIV3_OSD_MTL_MESH_H\n+_\b4_\b7 static std::string _\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n+48\n+_\b5_\b3 static std::string _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(\n+54 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type,\n+55 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be fvarType);\n+_\b5_\b6 static std::string _\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(\n+57 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type,\n+58 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be fvarType);\n+_\b5_\b9 static std::string _\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(\n+60 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type,\n+61 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be fvarType);\n+62};\n+63\n+64} // end namespace Osd\n+65\n+66} // end namespace OPENSUBDIV_VERSION\n+67using namespace OPENSUBDIV_VERSION;\n+68\n+69} // end namespace OpenSubdiv\n+70\n+71#endif // OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n-MeshInterface< MTLPatchTable > MTLMeshInterface\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bM_\be_\bs_\bh_\b._\bh_\b:_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\be_\bs_\bh_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n+Type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh_\b:_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:_\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetHullShaderSource(Far::PatchDescriptor::Type type, Far::\n+PatchDescriptor::Type fvarType)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type, Far::\n+PatchDescriptor::Type fvarType)\n+Deprecated.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type, Far::\n+PatchDescriptor::Type fvarType)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:_\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetPatchBasisShaderSource()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetCommonShaderSource()\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bM_\be_\bs_\bh_\b._\bh\n+ * _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00812.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00812.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlPatchShaderSource.h File Reference\n+OpenSubdiv: opensubdiv/osd/mtlMesh.h File Reference\n \n \n \n \n \n \n \n@@ -88,43 +88,43 @@\n \n \n \n \n \n
\n \n-
mtlPatchShaderSource.h File Reference
\n+Namespaces |\n+Typedefs
\n+
mtlMesh.h File Reference
\n \n
\n-
import "../version.h"
\n-import "../far/patchDescriptor.h"
\n-import <string>
\n+
#include "../version.h"
\n+#include "../osd/mesh.h"
\n+#include "../osd/mtlPatchTable.h"
\n
\n

Go to the source code of this file.

\n \n-\n-\n-\n-

\n-Classes

class  MTLPatchShaderSource
 
\n \n \n \n \n \n \n \n+

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n+\n+\n+\n

\n+Typedefs

typedef MeshInterface< MTLPatchTableMTLMeshInterface
 
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,24 +1,24 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-mtlPatchShaderSource.h File Reference\n-import \"../version.h\"\n-import \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n-import \n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n+mtlMesh.h File Reference\n+#include \"../version.h\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\be_\bs_\bh_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n+T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n+typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be< _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be >\u00a0 _\bM_\bT_\bL_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n+ * _\bm_\bt_\bl_\bM_\be_\bs_\bh_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00812.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00812.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00812 = [\n- [\"MTLPatchShaderSource\", \"a01293.html\", null]\n+ [\"MTLMeshInterface\", \"a00812.html#aa41e5b43fe46eeb0f97ff6ebdb1935aa\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00812_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00812_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlPatchShaderSource.h Source File\n+OpenSubdiv: opensubdiv/osd/mtlMesh.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
mtlPatchShaderSource.h
\n+
mtlMesh.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,74 +119,44 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE_H
\n-
26#define OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE_H
\n+
25#ifndef OPENSUBDIV3_OSD_MTL_MESH_H
\n+
26#define OPENSUBDIV3_OSD_MTL_MESH_H
\n
27
\n-
28#import "../version.h"
\n-
29#import "../far/patchDescriptor.h"
\n-
30#import <string>
\n+
28#include "../version.h"
\n+
29#include "../osd/mesh.h"
\n+
30#include "../osd/mtlPatchTable.h"
\n
31
\n-
32namespace OpenSubdiv {
\n-
33namespace OPENSUBDIV_VERSION {
\n-
34
\n-
35namespace Osd {
\n-
36
\n-
\n-\n-
38 public:
\n-
39 static std::string GetCommonShaderSource();
\n-
40
\n-
41 static std::string GetPatchBasisShaderSource();
\n-
42
\n-\n+
32
\n+
33namespace OpenSubdiv {
\n+
34namespace OPENSUBDIV_VERSION {
\n+
35
\n+
36namespace Osd {
\n+
37
\n+\n+
39
\n+
40} // end namespace Osd
\n+
41
\n+
42} // end namespace OPENSUBDIV_VERSION
\n+
43using namespace OPENSUBDIV_VERSION;
\n
44
\n-\n+
45} // end namespace OpenSubdiv
\n
46
\n-\n-
48
\n-
53 static std::string GetVertexShaderSource(
\n-\n-\n-
56 static std::string GetHullShaderSource(
\n-\n-\n-
59 static std::string GetDomainShaderSource(
\n-\n-\n-
62};
\n-
\n-
63
\n-
64} // end namespace Osd
\n-
65
\n-
66} // end namespace OPENSUBDIV_VERSION
\n-
67using namespace OPENSUBDIV_VERSION;
\n-
68
\n-
69} // end namespace OpenSubdiv
\n-
70
\n-
71#endif // OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE
\n+
47#endif // OPENSUBDIV3_OSD_MTL_MESH_H
\n \n-\n-\n-
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)
\n-
static std::string GetHullShaderSource(Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
\n-
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)
\n-
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
Deprecated.
\n-
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
\n-
static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)
\n-\n-\n+
MeshInterface< MTLPatchTable > MTLMeshInterface
Definition mtlMesh.h:38
\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-mtlPatchShaderSource.h\n+mtlMesh.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,87 +24,41 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE_H\n-26#define OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE_H\n+25#ifndef OPENSUBDIV3_OSD_MTL_MESH_H\n+26#define OPENSUBDIV3_OSD_MTL_MESH_H\n 27\n-28#import \"../version.h\"\n-29#import \"../far/patchDescriptor.h\"\n-30#import \n+28#include \"../version.h\"\n+29#include \"../osd/mesh.h\"\n+30#include \"../osd/mtlPatchTable.h\"\n 31\n-32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-33namespace OPENSUBDIV_VERSION {\n-34\n-35namespace Osd {\n-36\n-_\b3_\b7class _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be {\n-38 public:\n-_\b3_\b9 static std::string _\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n-40\n-_\b4_\b1 static std::string _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n-42\n-_\b4_\b3 static std::string _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n+32\n+33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+34namespace OPENSUBDIV_VERSION {\n+35\n+36namespace Osd {\n+37\n+_\b3_\b8typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b<_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b> _\bM_\bT_\bL_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be;\n+39\n+40} // end namespace Osd\n+41\n+42} // end namespace OPENSUBDIV_VERSION\n+43using namespace OPENSUBDIV_VERSION;\n 44\n-_\b4_\b5 static std::string _\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n+45} // end namespace OpenSubdiv\n 46\n-_\b4_\b7 static std::string _\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n-48\n-_\b5_\b3 static std::string _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(\n-54 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type,\n-55 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be fvarType);\n-_\b5_\b6 static std::string _\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(\n-57 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type,\n-58 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be fvarType);\n-_\b5_\b9 static std::string _\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(\n-60 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type,\n-61 _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be fvarType);\n-62};\n-63\n-64} // end namespace Osd\n-65\n-66} // end namespace OPENSUBDIV_VERSION\n-67using namespace OPENSUBDIV_VERSION;\n-68\n-69} // end namespace OpenSubdiv\n-70\n-71#endif // OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE\n+47#endif // OPENSUBDIV3_OSD_MTL_MESH_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n-Type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh_\b:_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:_\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetHullShaderSource(Far::PatchDescriptor::Type type, Far::\n-PatchDescriptor::Type fvarType)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type, Far::\n-PatchDescriptor::Type fvarType)\n-Deprecated.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type, Far::\n-PatchDescriptor::Type fvarType)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:_\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetPatchBasisShaderSource()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetCommonShaderSource()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+MeshInterface< MTLPatchTable > MTLMeshInterface\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bM_\be_\bs_\bh_\b._\bh_\b:_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\be_\bs_\bh_\b._\bh_\b:_\b6_\b8\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n+ * _\bm_\bt_\bl_\bM_\be_\bs_\bh_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00815.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00815.html", "unified_diff": "@@ -97,15 +97,15 @@\n
mtlPatchTable.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../far/patchDescriptor.h"
\n #include "../osd/nonCopyable.h"
\n #include "../osd/types.h"
\n-#include "../osd/mtlCommon.h"
\n+#include "../osd/mtlCommon.h"
\n
\n

Go to the source code of this file.

\n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00815_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00815_source.html", "unified_diff": "@@ -199,15 +199,15 @@\n
94
\n
95} //end namespace OpenSubdiv
\n
96
\n
97#endif //end OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H
\n \n
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-\n+\n \n
PatchArrayVector const & GetPatchArrays() const
\n
bool allocate(Far::PatchTable const *farPatchTable, MTLContext *context)
\n
static MTLPatchTable * Create(Far::PatchTable const *farPatchTable, MTLContext *context)
\n \n
std::vector< id< MTLBuffer > > _fvarIndexBuffers
\n
id< MTLBuffer > GetFVarPatchParamBuffer(int fvarChannel=0) const
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00818.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00818.html", "unified_diff": "@@ -96,15 +96,15 @@\n Namespaces\n
mtlLegacyGregoryPatchTable.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../far/patchTable.h"
\n #include "../osd/nonCopyable.h"
\n-#include "../osd/mtlCommon.h"
\n+#include "../osd/mtlCommon.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

class  MTLPatchTable
 
\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00818_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00818_source.html", "unified_diff": "@@ -203,15 +203,15 @@\n
90} //end namespace OpenSuddiv
\n
91
\n
92#endif // OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H
\n \n \n \n
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-\n+\n \n \n
static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
\n \n \n
static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const *farPatchTable, MTLContext *context)
\n
void UpdateVertexBuffer(id< MTLBuffer > vbo, int numVertices, int numVertexElements, MTLContext *context)
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00821.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00821.html", "unified_diff": "@@ -96,15 +96,15 @@\n Namespaces\n
mtlComputeEvaluator.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../osd/types.h"
\n #include "../osd/bufferDescriptor.h"
\n-#include "../osd/mtlCommon.h"
\n+#include "../osd/mtlCommon.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

class  MTLLegacyGregoryPatchTable
 
\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00821_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00821_source.html", "unified_diff": "@@ -1187,15 +1187,15 @@\n
2166
\n
2167#endif // OPENSUBDIV3_OSD_MTL_COMPUTE_EVALUATOR_H
\n \n
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n
Stencil table class wrapping the template for compatibility.
\n
Limit stencil table class wrapping the template for compatibility.
\n
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n+\n \n
MTLStencilTable(Far::LimitStencilTable const *stencilTable, MTLContext *context)
\n \n \n \n
MTLStencilTable(Far::StencilTable const *stencilTable, MTLContext *context)
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00824.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00824.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
mtlVertexBuffer.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../osd/mtlCommon.h"
\n+#include "../osd/mtlCommon.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

class  MTLStencilTable
 
\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00824_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00824_source.html", "unified_diff": "@@ -187,15 +187,15 @@\n
78} //end namespace OPENSUBDIV_VERSION
\n
79 using namespace OPENSUBDIV_VERSION;
\n
80
\n
81} //end namespace OpenSubdiv
\n
82
\n
83#endif // OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H
\n \n-\n+\n \n \n
CPUMTLVertexBuffer(int numElements, int numVertices)
\n
static CPUMTLVertexBuffer * Create(int numElements, int numVertices, MTLContext *context)
\n \n
void UpdateData(const float *src, int startVertex, int numVertices, MTLContext *context)
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00827.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00827.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/d3d11Mesh.h File Reference\n+OpenSubdiv: opensubdiv/osd/hlslPatchShaderSource.h File Reference\n \n \n \n \n \n \n \n@@ -88,43 +88,43 @@\n \n \n \n \n \n
\n \n-
d3d11Mesh.h File Reference
\n+Classes |\n+Namespaces
\n+
hlslPatchShaderSource.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../osd/mesh.h"
\n-#include "../osd/d3d11PatchTable.h"
\n+#include <string>
\n+#include "../far/patchDescriptor.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

class  CPUMTLVertexBuffer
 
\n+\n+\n+\n+

\n+Classes

class  HLSLPatchShaderSource
 
\n \n \n \n \n \n \n \n-

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n-\n-\n-\n

\n-Typedefs

typedef MeshInterface< D3D11PatchTableD3D11MeshInterface
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,24 +1,24 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n-d3d11Mesh.h File Reference\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+hlslPatchShaderSource.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\be_\bs_\bh_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bd_\b3_\bd_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n+#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+class \u00a0 _\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n-T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n-typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be< _\bD_\b3_\bD_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be >\u00a0 _\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n-\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh\n+ * _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00827.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00827.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00827 = [\n- [\"D3D11MeshInterface\", \"a00827.html#ae5c8e80d05d6eaee105d8eecfa9ab609\", null]\n+ [\"HLSLPatchShaderSource\", \"a01257.html\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00827_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00827_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/d3d11Mesh.h Source File\n+OpenSubdiv: opensubdiv/osd/hlslPatchShaderSource.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
d3d11Mesh.h
\n+
hlslPatchShaderSource.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,45 +119,61 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_D3D11MESH_H
\n-
26#define OPENSUBDIV3_OSD_D3D11MESH_H
\n+
25#ifndef OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n+
26#define OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n
27
\n
28#include "../version.h"
\n-
29
\n-
30#include "../osd/mesh.h"
\n-
31#include "../osd/d3d11PatchTable.h"
\n-
32
\n-
33namespace OpenSubdiv {
\n-
34namespace OPENSUBDIV_VERSION {
\n-
35
\n-
36namespace Osd {
\n-
37
\n-\n-
39
\n+
29#include <string>
\n+
30#include "../far/patchDescriptor.h"
\n+
31
\n+
32namespace OpenSubdiv {
\n+
33namespace OPENSUBDIV_VERSION {
\n+
34
\n+
35namespace Osd {
\n+
36
\n+
\n+\n+
38public:
\n+
39 static std::string GetCommonShaderSource();
\n
40
\n-
41} // end namespace Osd
\n+
41 static std::string GetPatchBasisShaderSource();
\n
42
\n-
43} // end namespace OPENSUBDIV_VERSION
\n-
44using namespace OPENSUBDIV_VERSION;
\n-
45
\n-
46} // end namespace OpenSubdiv
\n-
47
\n-
48#endif // OPENSUBDIV3_OSD_D3D11MESH_H
\n+\n+
44
\n+\n+
46
\n+\n+
48};
\n+
\n+
49
\n+
50} // end namespace Osd
\n+
51
\n+
52} // end namespace OPENSUBDIV_VERSION
\n+
53using namespace OPENSUBDIV_VERSION;
\n+
54
\n+
55} // end namespace OpenSubdiv
\n+
56
\n+
57#endif // OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n \n-
MeshInterface< D3D11PatchTable > D3D11MeshInterface
Definition d3d11Mesh.h:38
\n-\n+\n+\n+
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)
\n+
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)
\n+
static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)
\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-d3d11Mesh.h\n+hlslPatchShaderSource.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,42 +24,65 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_D3D11MESH_H\n-26#define OPENSUBDIV3_OSD_D3D11MESH_H\n+25#ifndef OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n+26#define OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n 27\n 28#include \"../version.h\"\n-29\n-30#include \"../osd/mesh.h\"\n-31#include \"../osd/d3d11PatchTable.h\"\n-32\n-33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-34namespace OPENSUBDIV_VERSION {\n-35\n-36namespace Osd {\n-37\n-_\b3_\b8typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b<_\bD_\b3_\bD_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b> _\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be;\n-39\n+29#include \n+30#include \"../far/patchDescriptor.h\"\n+31\n+32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+33namespace OPENSUBDIV_VERSION {\n+34\n+35namespace Osd {\n+36\n+_\b3_\b7class _\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be {\n+38public:\n+_\b3_\b9 static std::string _\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n 40\n-41} // end namespace Osd\n+_\b4_\b1 static std::string _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n 42\n-43} // end namespace OPENSUBDIV_VERSION\n-44using namespace OPENSUBDIV_VERSION;\n-45\n-46} // end namespace OpenSubdiv\n-47\n-48#endif // OPENSUBDIV3_OSD_D3D11MESH_H\n+_\b4_\b3 static std::string _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n+44\n+_\b4_\b5 static std::string _\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n+46\n+_\b4_\b7 static std::string _\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n+48};\n+49\n+50} // end namespace Osd\n+51\n+52} // end namespace OPENSUBDIV_VERSION\n+53using namespace OPENSUBDIV_VERSION;\n+54\n+55} // end namespace OpenSubdiv\n+56\n+57#endif // OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n-MeshInterface< D3D11PatchTable > D3D11MeshInterface\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh_\b:_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\be_\bs_\bh_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n+Type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh_\b:_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:_\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetPatchBasisShaderSource()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetCommonShaderSource()\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh\n+ * _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00830.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00830.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/hlslPatchShaderSource.h File Reference\n+OpenSubdiv: opensubdiv/osd/d3d11Mesh.h File Reference\n \n \n \n \n \n \n \n@@ -88,43 +88,43 @@\n \n \n \n \n \n
\n \n-
hlslPatchShaderSource.h File Reference
\n+Namespaces |\n+Typedefs
\n+
d3d11Mesh.h File Reference
\n \n
\n
#include "../version.h"
\n-#include <string>
\n-#include "../far/patchDescriptor.h"
\n+#include "../osd/mesh.h"
\n+#include "../osd/d3d11PatchTable.h"
\n
\n

Go to the source code of this file.

\n \n-\n-\n-\n-

\n-Classes

class  HLSLPatchShaderSource
 
\n \n \n \n \n \n \n \n+

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n+\n+\n+\n

\n+Typedefs

typedef MeshInterface< D3D11PatchTableD3D11MeshInterface
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,24 +1,24 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-hlslPatchShaderSource.h File Reference\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n+d3d11Mesh.h File Reference\n #include \"../version.h\"\n-#include \n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\be_\bs_\bh_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bd_\b3_\bd_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n+T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n+typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be< _\bD_\b3_\bD_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be >\u00a0 _\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n+ * _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00830.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00830.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00830 = [\n- [\"HLSLPatchShaderSource\", \"a01257.html\", null]\n+ [\"D3D11MeshInterface\", \"a00830.html#ae5c8e80d05d6eaee105d8eecfa9ab609\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00830_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00830_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/hlslPatchShaderSource.h Source File\n+OpenSubdiv: opensubdiv/osd/d3d11Mesh.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
hlslPatchShaderSource.h
\n+
d3d11Mesh.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,61 +119,45 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n-
26#define OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n+
25#ifndef OPENSUBDIV3_OSD_D3D11MESH_H
\n+
26#define OPENSUBDIV3_OSD_D3D11MESH_H
\n
27
\n
28#include "../version.h"
\n-
29#include <string>
\n-
30#include "../far/patchDescriptor.h"
\n-
31
\n-
32namespace OpenSubdiv {
\n-
33namespace OPENSUBDIV_VERSION {
\n-
34
\n-
35namespace Osd {
\n-
36
\n-
\n-\n-
38public:
\n-
39 static std::string GetCommonShaderSource();
\n+
29
\n+
30#include "../osd/mesh.h"
\n+
31#include "../osd/d3d11PatchTable.h"
\n+
32
\n+
33namespace OpenSubdiv {
\n+
34namespace OPENSUBDIV_VERSION {
\n+
35
\n+
36namespace Osd {
\n+
37
\n+\n+
39
\n
40
\n-
41 static std::string GetPatchBasisShaderSource();
\n+
41} // end namespace Osd
\n
42
\n-\n-
44
\n-\n-
46
\n-\n-
48};
\n-
\n-
49
\n-
50} // end namespace Osd
\n-
51
\n-
52} // end namespace OPENSUBDIV_VERSION
\n-
53using namespace OPENSUBDIV_VERSION;
\n-
54
\n-
55} // end namespace OpenSubdiv
\n-
56
\n-
57#endif // OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n+
43} // end namespace OPENSUBDIV_VERSION
\n+
44using namespace OPENSUBDIV_VERSION;
\n+
45
\n+
46} // end namespace OpenSubdiv
\n+
47
\n+
48#endif // OPENSUBDIV3_OSD_D3D11MESH_H
\n \n-\n-\n-
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)
\n-
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)
\n-
static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)
\n-\n-\n+
MeshInterface< D3D11PatchTable > D3D11MeshInterface
Definition d3d11Mesh.h:38
\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-hlslPatchShaderSource.h\n+d3d11Mesh.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,65 +24,42 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n-26#define OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n+25#ifndef OPENSUBDIV3_OSD_D3D11MESH_H\n+26#define OPENSUBDIV3_OSD_D3D11MESH_H\n 27\n 28#include \"../version.h\"\n-29#include \n-30#include \"../far/patchDescriptor.h\"\n-31\n-32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-33namespace OPENSUBDIV_VERSION {\n-34\n-35namespace Osd {\n-36\n-_\b3_\b7class _\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be {\n-38public:\n-_\b3_\b9 static std::string _\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n+29\n+30#include \"../osd/mesh.h\"\n+31#include \"../osd/d3d11PatchTable.h\"\n+32\n+33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+34namespace OPENSUBDIV_VERSION {\n+35\n+36namespace Osd {\n+37\n+_\b3_\b8typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b<_\bD_\b3_\bD_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b> _\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be;\n+39\n 40\n-_\b4_\b1 static std::string _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n+41} // end namespace Osd\n 42\n-_\b4_\b3 static std::string _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n-44\n-_\b4_\b5 static std::string _\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n-46\n-_\b4_\b7 static std::string _\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n-48};\n-49\n-50} // end namespace Osd\n-51\n-52} // end namespace OPENSUBDIV_VERSION\n-53using namespace OPENSUBDIV_VERSION;\n-54\n-55} // end namespace OpenSubdiv\n-56\n-57#endif // OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n+43} // end namespace OPENSUBDIV_VERSION\n+44using namespace OPENSUBDIV_VERSION;\n+45\n+46} // end namespace OpenSubdiv\n+47\n+48#endif // OPENSUBDIV3_OSD_D3D11MESH_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n-Type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh_\b:_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:_\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetPatchBasisShaderSource()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetCommonShaderSource()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+MeshInterface< D3D11PatchTable > D3D11MeshInterface\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh_\b:_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\be_\bs_\bh_\b._\bh_\b:_\b6_\b8\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n+ * _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00842.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00842.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/d3d11ComputeEvaluator.h File Reference\n+OpenSubdiv: opensubdiv/osd/cpuD3D11VertexBuffer.h File Reference\n \n \n \n \n \n \n \n@@ -90,45 +90,41 @@\n \n \n \n
\n \n-
d3d11ComputeEvaluator.h File Reference
\n+
cpuD3D11VertexBuffer.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../osd/bufferDescriptor.h"
\n+#include <cstddef>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n-\n-\n+\n+\n \n

\n Classes

class  D3D11StencilTable
 D3D11 stencil table. More...
 
class  D3D11ComputeEvaluator
class  CpuD3D11VertexBuffer
 Concrete vertex buffer class for Cpu subdivision and DirectX drawing. More...
 
\n \n \n \n \n \n-\n-\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-d3d11ComputeEvaluator.h File Reference\n+cpuD3D11VertexBuffer.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-\u00a0 D3D11 stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+class \u00a0 _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+\u00a0 Concrete vertex buffer class for Cpu subdivision and DirectX drawing.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n-\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00842.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00842.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,3 @@\n var a00842 = [\n- [\"D3D11StencilTable\", \"a01189.html\", \"a01189\"],\n- [\"D3D11ComputeEvaluator\", \"a01193.html\", \"a01193\"]\n+ [\"CpuD3D11VertexBuffer\", \"a01153.html\", \"a01153\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00842_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00842_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/d3d11ComputeEvaluator.h Source File\n+OpenSubdiv: opensubdiv/osd/cpuD3D11VertexBuffer.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
d3d11ComputeEvaluator.h
\n+
cpuD3D11VertexBuffer.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,225 +119,91 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n-
26#define OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n+
25#ifndef OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n+
26#define OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n
27
\n
28#include "../version.h"
\n-
29
\n-
30struct ID3D11DeviceContext;
\n+
29#include <cstddef>
\n+
30
\n
31struct ID3D11Buffer;
\n-
32struct ID3D11ComputeShader;
\n-
33struct ID3D11ClassLinkage;
\n-
34struct ID3D11ClassInstance;
\n-
35struct ID3D11ShaderResourceView;
\n-
36struct ID3D11UnorderedAccessView;
\n+
32struct ID3D11Device;
\n+
33struct ID3D11DeviceContext;
\n+
34
\n+
35namespace OpenSubdiv {
\n+
36namespace OPENSUBDIV_VERSION {
\n
37
\n-
38#include "../osd/bufferDescriptor.h"
\n+
38namespace Osd {
\n
39
\n-
40namespace OpenSubdiv {
\n-
41namespace OPENSUBDIV_VERSION {
\n-
42
\n-
43namespace Far {
\n-
44 class StencilTable;
\n-
45}
\n-
46
\n-
47namespace Osd {
\n-
48
\n-
\n-\n-
57public:
\n-
58 template <typename DEVICE_CONTEXT>
\n-
\n-
59 static D3D11StencilTable *Create(Far::StencilTable const *stencilTable,
\n-
60 DEVICE_CONTEXT context) {
\n-
61 return new D3D11StencilTable(stencilTable, context->GetDeviceContext());
\n-
62 }
\n-
\n-
63
\n-
\n-
64 static D3D11StencilTable *Create(Far::StencilTable const *stencilTable,
\n-
65 ID3D11DeviceContext *deviceContext) {
\n-
66 return new D3D11StencilTable(stencilTable, deviceContext);
\n-
67 }
\n-
\n-
68
\n-\n-
70 ID3D11DeviceContext *deviceContext);
\n-
71
\n-\n+
\n+\n+
49public:
\n+
51 static CpuD3D11VertexBuffer * Create(int numElements, int numVertices,
\n+
52 ID3D11DeviceContext *deviceContext);
\n+
53
\n+\n+
56
\n+
59 void UpdateData(const float *src, int startVertex, int numVertices,
\n+
60 void *deviceContext = NULL);
\n+
61
\n+
63 int GetNumElements() const;
\n+
64
\n+
66 int GetNumVertices() const;
\n+
67
\n+
69 float * BindCpuBuffer();
\n+
70
\n+
72 ID3D11Buffer *BindD3D11Buffer(ID3D11DeviceContext *deviceContext);
\n
73
\n-
74 // interfaces needed for D3D11ComputeEvaluator
\n-
75 ID3D11ShaderResourceView *GetSizesSRV() const { return _sizes; }
\n-
76 ID3D11ShaderResourceView *GetOffsetsSRV() const { return _offsets; }
\n-
77 ID3D11ShaderResourceView *GetIndicesSRV() const { return _indices; }
\n-
78 ID3D11ShaderResourceView *GetWeightsSRV() const { return _weights; }
\n-
79 int GetNumStencils() const { return _numStencils; }
\n-
80
\n-
81private:
\n-
82 ID3D11ShaderResourceView *_sizes;
\n-
83 ID3D11ShaderResourceView *_offsets;
\n-
84 ID3D11ShaderResourceView *_indices;
\n-
85 ID3D11ShaderResourceView *_weights;
\n-
86 ID3D11Buffer *_sizesBuffer;
\n-
87 ID3D11Buffer *_offsetsBuffer;
\n-
88 ID3D11Buffer *_indicesBuffer;
\n-
89 ID3D11Buffer *_weightsBuffer;
\n-
90
\n-
91 int _numStencils;
\n-
92};
\n+
\n+
75 ID3D11Buffer *BindVBO(ID3D11DeviceContext *deviceContext) {
\n+
76 return BindD3D11Buffer(deviceContext);
\n+
77 }
\n+
\n+
78
\n+
79protected:
\n+
81 CpuD3D11VertexBuffer(int numElements, int numVertices);
\n+
82
\n+
83 bool allocate(ID3D11Device *device);
\n+
84
\n+
85private:
\n+
86 int _numElements;
\n+
87 int _numVertices;
\n+
88 ID3D11Buffer *_d3d11Buffer;
\n+
89 float *_cpuBuffer;
\n+
90};
\n
\n+
91
\n+
92} // end namespace Osd
\n
93
\n-
94// ---------------------------------------------------------------------------
\n-
95
\n-
\n-\n-
97public:
\n-
98 typedef bool Instantiatable;
\n-\n-
100 BufferDescriptor const &dstDesc,
\n-
101 BufferDescriptor const &duDesc,
\n-
102 BufferDescriptor const &dvDesc,
\n-
103 ID3D11DeviceContext *deviceContext);
\n-
104
\n-\n-
106 BufferDescriptor const &dstDesc,
\n-
107 BufferDescriptor const &duDesc,
\n-
108 BufferDescriptor const &dvDesc,
\n-
109 BufferDescriptor const &duuDesc,
\n-
110 BufferDescriptor const &duvDesc,
\n-
111 BufferDescriptor const &dvvDesc,
\n-
112 ID3D11DeviceContext *deviceContext);
\n-
113
\n-\n-
116
\n-\n-
119
\n-
147 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
148 static bool EvalStencils(
\n-
149 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
150 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
151 STENCIL_TABLE const *stencilTable,
\n-
152 D3D11ComputeEvaluator const *instance,
\n-
153 ID3D11DeviceContext * deviceContext) {
\n-
154 if (instance) {
\n-
155 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
156 dstBuffer, dstDesc,
\n-
157 stencilTable,
\n-
158 deviceContext);
\n-
159 } else {
\n-
160 // Create an instance on demand (slow)
\n-
161 (void)deviceContext; // unused
\n-
162 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
165 deviceContext);
\n-
166 if (instance) {
\n-
167 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
168 dstBuffer, dstDesc,
\n-
169 stencilTable,
\n-
170 deviceContext);
\n-
171 delete instance;
\n-
172 return r;
\n-
173 }
\n-
174 return false;
\n-
175 }
\n-
176 }
\n-
\n-
177
\n-
180 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
182 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
183 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
184 STENCIL_TABLE const *stencilTable,
\n-
185 ID3D11DeviceContext *deviceContext) const {
\n-
186 return EvalStencils(srcBuffer->BindD3D11UAV(deviceContext), srcDesc,
\n-
187 dstBuffer->BindD3D11UAV(deviceContext), dstDesc,
\n-
188 stencilTable->GetSizesSRV(),
\n-
189 stencilTable->GetOffsetsSRV(),
\n-
190 stencilTable->GetIndicesSRV(),
\n-
191 stencilTable->GetWeightsSRV(),
\n-
192 /* start = */ 0,
\n-
193 /* end = */ stencilTable->GetNumStencils(),
\n-
194 deviceContext);
\n-
195 }
\n-
\n-
196
\n-
199 bool EvalStencils(ID3D11UnorderedAccessView *srcSRV,
\n-
200 BufferDescriptor const &srcDesc,
\n-
201 ID3D11UnorderedAccessView *dstUAV,
\n-
202 BufferDescriptor const &dstDesc,
\n-
203 ID3D11ShaderResourceView *sizesSRV,
\n-
204 ID3D11ShaderResourceView *offsetsSRV,
\n-
205 ID3D11ShaderResourceView *indicesSRV,
\n-
206 ID3D11ShaderResourceView *weightsSRV,
\n-
207 int start,
\n-
208 int end,
\n-
209 ID3D11DeviceContext *deviceContext) const;
\n-
210
\n-
212 bool Compile(BufferDescriptor const &srcDesc,
\n-
213 BufferDescriptor const &dstDesc,
\n-
214 ID3D11DeviceContext *deviceContext);
\n-
215
\n-
217 static void Synchronize(ID3D11DeviceContext *deviceContext);
\n-
218
\n-
219private:
\n-
220 ID3D11ComputeShader * _computeShader;
\n-
221 ID3D11ClassLinkage * _classLinkage;
\n-
222 ID3D11ClassInstance * _singleBufferKernel;
\n-
223 ID3D11ClassInstance * _separateBufferKernel;
\n-
224 ID3D11Buffer * _uniformArgs; // uniform parameters for kernels
\n-
225
\n-
226 int _workGroupSize;
\n-
227};
\n-
\n-
228
\n-
229} // end namespace Osd
\n-
230
\n-
231} // end namespace OPENSUBDIV_VERSION
\n-
232using namespace OPENSUBDIV_VERSION;
\n-
233
\n-
234} // end namespace OpenSubdiv
\n-
235
\n-
236
\n-
237#endif // OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n+
94} // end namespace OPENSUBDIV_VERSION
\n+
95using namespace OPENSUBDIV_VERSION;
\n+
96
\n+
97} // end namespace OpenSubdiv
\n+
98
\n+
99#endif // OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n \n-
Stencil table class wrapping the template for compatibility.
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-
static D3D11StencilTable * Create(Far::StencilTable const *stencilTable, DEVICE_CONTEXT context)
\n-\n-\n-\n-\n-
D3D11StencilTable(Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
\n-
static D3D11StencilTable * Create(Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
\n-\n-\n-\n-
static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, ID3D11DeviceContext *deviceContext)
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, D3D11ComputeEvaluator const *instance, ID3D11DeviceContext *deviceContext)
Generic static compute function. This function has a same signature as other device kernels have so t...
\n-
static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, ID3D11DeviceContext *deviceContext)
\n-\n-
static void Synchronize(ID3D11DeviceContext *deviceContext)
Wait the dispatched kernel finishes.
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, ID3D11DeviceContext *deviceContext) const
\n-
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, ID3D11DeviceContext *deviceContext)
Configure DX kernel. Returns false if it fails to compile the kernel.
\n-\n-\n-
bool EvalStencils(ID3D11UnorderedAccessView *srcSRV, BufferDescriptor const &srcDesc, ID3D11UnorderedAccessView *dstUAV, BufferDescriptor const &dstDesc, ID3D11ShaderResourceView *sizesSRV, ID3D11ShaderResourceView *offsetsSRV, ID3D11ShaderResourceView *indicesSRV, ID3D11ShaderResourceView *weightsSRV, int start, int end, ID3D11DeviceContext *deviceContext) const
\n+
Concrete vertex buffer class for Cpu subdivision and DirectX drawing.
\n+
static CpuD3D11VertexBuffer * Create(int numElements, int numVertices, ID3D11DeviceContext *deviceContext)
Creator. Returns NULL if error.
\n+
CpuD3D11VertexBuffer(int numElements, int numVertices)
Constructor.
\n+
int GetNumElements() const
Returns how many elements defined in this vertex buffer.
\n+
void UpdateData(const float *src, int startVertex, int numVertices, void *deviceContext=NULL)
\n+
int GetNumVertices() const
Returns how many vertices allocated in this vertex buffer.
\n+
ID3D11Buffer * BindD3D11Buffer(ID3D11DeviceContext *deviceContext)
Returns the D3D11 buffer object.
\n+
float * BindCpuBuffer()
Returns the address of CPU buffer.
\n+\n+\n+
ID3D11Buffer * BindVBO(ID3D11DeviceContext *deviceContext)
Returns the D3D11 buffer object (for Osd::Mesh interface)
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-d3d11ComputeEvaluator.h\n+cpuD3D11VertexBuffer.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,272 +24,105 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n-26#define OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n+25#ifndef OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n+26#define OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n 27\n 28#include \"../version.h\"\n-29\n-30struct ID3D11DeviceContext;\n+29#include \n+30\n 31struct ID3D11Buffer;\n-32struct ID3D11ComputeShader;\n-33struct ID3D11ClassLinkage;\n-34struct ID3D11ClassInstance;\n-35struct ID3D11ShaderResourceView;\n-36struct ID3D11UnorderedAccessView;\n+32struct ID3D11Device;\n+33struct ID3D11DeviceContext;\n+34\n+35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+36namespace OPENSUBDIV_VERSION {\n 37\n-38#include \"../osd/bufferDescriptor.h\"\n+38namespace Osd {\n 39\n-40namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-41namespace OPENSUBDIV_VERSION {\n-42\n-43namespace Far {\n-44 class StencilTable;\n-45}\n-46\n-47namespace Osd {\n-48\n-_\b5_\b6class _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n-57public:\n-58 template \n-_\b5_\b9 static _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-60 DEVICE_CONTEXT context) {\n-61 return new _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, context->GetDeviceContext());\n-62 }\n-63\n-_\b6_\b4 static _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-65 ID3D11DeviceContext *deviceContext) {\n-66 return new _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, deviceContext);\n-67 }\n-68\n-_\b6_\b9 _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-70 ID3D11DeviceContext *deviceContext);\n-71\n-_\b7_\b2 _\b~_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n+_\b4_\b8class _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n+49public:\n+_\b5_\b1 static _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n+52 ID3D11DeviceContext *deviceContext);\n+53\n+_\b5_\b5 virtual _\b~_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br();\n+56\n+_\b5_\b9 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n+60 void *deviceContext = NULL);\n+61\n+_\b6_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const;\n+64\n+_\b6_\b6 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n+67\n+_\b6_\b9 float * _\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br();\n+70\n+_\b7_\b2 ID3D11Buffer *_\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br(ID3D11DeviceContext *deviceContext);\n 73\n-74 // interfaces needed for D3D11ComputeEvaluator\n-_\b7_\b5 ID3D11ShaderResourceView *_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bS_\bR_\bV() const { return _sizes; }\n-_\b7_\b6 ID3D11ShaderResourceView *_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bS_\bR_\bV() const { return _offsets; }\n-_\b7_\b7 ID3D11ShaderResourceView *_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bS_\bR_\bV() const { return _indices; }\n-_\b7_\b8 ID3D11ShaderResourceView *_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bS_\bR_\bV() const { return _weights; }\n-_\b7_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n-80\n-81private:\n-82 ID3D11ShaderResourceView *_sizes;\n-83 ID3D11ShaderResourceView *_offsets;\n-84 ID3D11ShaderResourceView *_indices;\n-85 ID3D11ShaderResourceView *_weights;\n-86 ID3D11Buffer *_sizesBuffer;\n-87 ID3D11Buffer *_offsetsBuffer;\n-88 ID3D11Buffer *_indicesBuffer;\n-89 ID3D11Buffer *_weightsBuffer;\n-90\n-91 int _numStencils;\n-92};\n+_\b7_\b5 ID3D11Buffer *_\bB_\bi_\bn_\bd_\bV_\bB_\bO(ID3D11DeviceContext *deviceContext) {\n+76 return _\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br(deviceContext);\n+77 }\n+78\n+79protected:\n+_\b8_\b1 _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices);\n+82\n+_\b8_\b3 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(ID3D11Device *device);\n+84\n+85private:\n+86 int _numElements;\n+87 int _numVertices;\n+88 ID3D11Buffer *_d3d11Buffer;\n+89 float *_cpuBuffer;\n+90};\n+91\n+92} // end namespace Osd\n 93\n-94// --------------------------------------------------------------------------\n--\n-95\n-_\b9_\b6class _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n-97public:\n-_\b9_\b8 typedef bool _\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be;\n-_\b9_\b9 static _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-100 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-101 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-102 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-103 ID3D11DeviceContext *deviceContext);\n-104\n-_\b1_\b0_\b5 static _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-106 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-108 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-109 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-110 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-111 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-112 ID3D11DeviceContext *deviceContext);\n-113\n-_\b1_\b1_\b5 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n-116\n-_\b1_\b1_\b8 _\b~_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n-119\n-147 template \n-_\b1_\b4_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-149 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-150 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-151 STENCIL_TABLE const *stencilTable,\n-152 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-153 ID3D11DeviceContext * deviceContext) {\n-154 if (instance) {\n-155 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-156 dstBuffer, dstDesc,\n-157 stencilTable,\n-158 deviceContext);\n-159 } else {\n-160 // Create an instance on demand (slow)\n-161 (void)deviceContext; // unused\n-162 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-163 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-164 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-165 deviceContext);\n-166 if (instance) {\n-167 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-168 dstBuffer, dstDesc,\n-169 stencilTable,\n-170 deviceContext);\n-171 delete instance;\n-172 return r;\n-173 }\n-174 return false;\n-175 }\n-176 }\n-177\n-180 template \n-_\b1_\b8_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-182 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-183 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-184 STENCIL_TABLE const *stencilTable,\n-185 ID3D11DeviceContext *deviceContext) const {\n-186 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindD3D11UAV(deviceContext), srcDesc,\n-187 dstBuffer->BindD3D11UAV(deviceContext), dstDesc,\n-188 stencilTable->GetSizesSRV(),\n-189 stencilTable->GetOffsetsSRV(),\n-190 stencilTable->GetIndicesSRV(),\n-191 stencilTable->GetWeightsSRV(),\n-192 /* start = */ 0,\n-193 /* end = */ stencilTable->GetNumStencils(),\n-194 deviceContext);\n-195 }\n-196\n-_\b1_\b9_\b9 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(ID3D11UnorderedAccessView *srcSRV,\n-200 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-201 ID3D11UnorderedAccessView *dstUAV,\n-202 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-203 ID3D11ShaderResourceView *sizesSRV,\n-204 ID3D11ShaderResourceView *offsetsSRV,\n-205 ID3D11ShaderResourceView *indicesSRV,\n-206 ID3D11ShaderResourceView *weightsSRV,\n-207 int start,\n-208 int end,\n-209 ID3D11DeviceContext *deviceContext) const;\n-210\n-_\b2_\b1_\b2 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-213 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-214 ID3D11DeviceContext *deviceContext);\n-215\n-_\b2_\b1_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(ID3D11DeviceContext *deviceContext);\n-218\n-219private:\n-220 ID3D11ComputeShader * _computeShader;\n-221 ID3D11ClassLinkage * _classLinkage;\n-222 ID3D11ClassInstance * _singleBufferKernel;\n-223 ID3D11ClassInstance * _separateBufferKernel;\n-224 ID3D11Buffer * _uniformArgs; // uniform parameters for kernels\n-225\n-226 int _workGroupSize;\n-227};\n-228\n-229} // end namespace Osd\n-230\n-231} // end namespace OPENSUBDIV_VERSION\n-232using namespace OPENSUBDIV_VERSION;\n-233\n-234} // end namespace OpenSubdiv\n-235\n-236\n-237#endif // OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n+94} // end namespace OPENSUBDIV_VERSION\n+95using namespace OPENSUBDIV_VERSION;\n+96\n+97} // end namespace OpenSubdiv\n+98\n+99#endif // OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-BufferDescriptor is a struct which describes buffer elements in interleaved\n-data buffers....\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-D3D11 stencil table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static D3D11StencilTable * Create(Far::StencilTable const *stencilTable,\n-DEVICE_CONTEXT context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bS_\bR_\bV\n-ID3D11ShaderResourceView * GetOffsetsSRV() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-int GetNumStencils() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bS_\bR_\bV\n-ID3D11ShaderResourceView * GetIndicesSRV() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-~D3D11StencilTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-D3D11StencilTable(Far::StencilTable const *stencilTable, ID3D11DeviceContext\n-*deviceContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static D3D11StencilTable * Create(Far::StencilTable const *stencilTable,\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+Concrete vertex buffer class for Cpu subdivision and DirectX drawing.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CpuD3D11VertexBuffer * Create(int numElements, int numVertices,\n ID3D11DeviceContext *deviceContext)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bS_\bR_\bV\n-ID3D11ShaderResourceView * GetSizesSRV() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bS_\bR_\bV\n-ID3D11ShaderResourceView * GetWeightsSRV() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n-BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n-BufferDescriptor const &dvDesc, ID3D11DeviceContext *deviceContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n-const *stencilTable, D3D11ComputeEvaluator const *instance, ID3D11DeviceContext\n-*deviceContext)\n-Generic static compute function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n-BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n-BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc,\n-BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc,\n-ID3D11DeviceContext *deviceContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n-bool Instantiatable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(ID3D11DeviceContext *deviceContext)\n-Wait the dispatched kernel finishes.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n-*stencilTable, ID3D11DeviceContext *deviceContext) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n-bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc,\n-ID3D11DeviceContext *deviceContext)\n-Configure DX kernel. Returns false if it fails to compile the kernel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:\n-_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D3D11ComputeEvaluator()\n+Creator. Returns NULL if error.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+CpuD3D11VertexBuffer(int numElements, int numVertices)\n Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:\n-_\b~_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-~D3D11ComputeEvaluator()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+int GetNumElements() const\n+Returns how many elements defined in this vertex buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n+void UpdateData(const float *src, int startVertex, int numVertices, void\n+*deviceContext=NULL)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int GetNumVertices() const\n+Returns how many vertices allocated in this vertex buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br\n+ID3D11Buffer * BindD3D11Buffer(ID3D11DeviceContext *deviceContext)\n+Returns the D3D11 buffer object.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br\n+float * BindCpuBuffer()\n+Returns the address of CPU buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n+bool allocate(ID3D11Device *device)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:\n+_\b~_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+virtual ~CpuD3D11VertexBuffer()\n Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(ID3D11UnorderedAccessView *srcSRV, BufferDescriptor const\n-&srcDesc, ID3D11UnorderedAccessView *dstUAV, BufferDescriptor const &dstDesc,\n-ID3D11ShaderResourceView *sizesSRV, ID3D11ShaderResourceView *offsetsSRV,\n-ID3D11ShaderResourceView *indicesSRV, ID3D11ShaderResourceView *weightsSRV, int\n-start, int end, ID3D11DeviceContext *deviceContext) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bV_\bB_\bO\n+ID3D11Buffer * BindVBO(ID3D11DeviceContext *deviceContext)\n+Returns the D3D11 buffer object (for Osd::Mesh interface)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b7_\b5\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00845.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00845.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/cpuD3D11VertexBuffer.h File Reference\n+OpenSubdiv: opensubdiv/osd/d3d11ComputeEvaluator.h File Reference\n \n \n \n \n \n \n \n@@ -90,41 +90,45 @@\n \n \n \n
\n \n-
cpuD3D11VertexBuffer.h File Reference
\n+
d3d11ComputeEvaluator.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include <cstddef>
\n+#include "../osd/bufferDescriptor.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n \n

\n Classes

class  CpuD3D11VertexBuffer
 Concrete vertex buffer class for Cpu subdivision and DirectX drawing. More...
class  D3D11StencilTable
 D3D11 stencil table. More...
 
class  D3D11ComputeEvaluator
 
\n \n \n \n \n \n+\n+\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,28 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-cpuD3D11VertexBuffer.h File Reference\n+d3d11ComputeEvaluator.h File Reference\n #include \"../version.h\"\n-#include \n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-\u00a0 Concrete vertex buffer class for Cpu subdivision and DirectX drawing.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+\u00a0 D3D11 stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n+\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00845.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00845.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,4 @@\n var a00845 = [\n- [\"CpuD3D11VertexBuffer\", \"a01153.html\", \"a01153\"]\n+ [\"D3D11StencilTable\", \"a01189.html\", \"a01189\"],\n+ [\"D3D11ComputeEvaluator\", \"a01193.html\", \"a01193\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00845_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00845_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/cpuD3D11VertexBuffer.h Source File\n+OpenSubdiv: opensubdiv/osd/d3d11ComputeEvaluator.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
cpuD3D11VertexBuffer.h
\n+
d3d11ComputeEvaluator.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,91 +119,225 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n-
26#define OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n+
25#ifndef OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n+
26#define OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n
27
\n
28#include "../version.h"
\n-
29#include <cstddef>
\n-
30
\n+
29
\n+
30struct ID3D11DeviceContext;
\n
31struct ID3D11Buffer;
\n-
32struct ID3D11Device;
\n-
33struct ID3D11DeviceContext;
\n-
34
\n-
35namespace OpenSubdiv {
\n-
36namespace OPENSUBDIV_VERSION {
\n+
32struct ID3D11ComputeShader;
\n+
33struct ID3D11ClassLinkage;
\n+
34struct ID3D11ClassInstance;
\n+
35struct ID3D11ShaderResourceView;
\n+
36struct ID3D11UnorderedAccessView;
\n
37
\n-
38namespace Osd {
\n+
38#include "../osd/bufferDescriptor.h"
\n
39
\n-
\n-\n-
49public:
\n-
51 static CpuD3D11VertexBuffer * Create(int numElements, int numVertices,
\n-
52 ID3D11DeviceContext *deviceContext);
\n-
53
\n-\n-
56
\n-
59 void UpdateData(const float *src, int startVertex, int numVertices,
\n-
60 void *deviceContext = NULL);
\n-
61
\n-
63 int GetNumElements() const;
\n-
64
\n-
66 int GetNumVertices() const;
\n-
67
\n-
69 float * BindCpuBuffer();
\n-
70
\n-
72 ID3D11Buffer *BindD3D11Buffer(ID3D11DeviceContext *deviceContext);
\n+
40namespace OpenSubdiv {
\n+
41namespace OPENSUBDIV_VERSION {
\n+
42
\n+
43namespace Far {
\n+
44 class StencilTable;
\n+
45}
\n+
46
\n+
47namespace Osd {
\n+
48
\n+
\n+\n+
57public:
\n+
58 template <typename DEVICE_CONTEXT>
\n+
\n+
59 static D3D11StencilTable *Create(Far::StencilTable const *stencilTable,
\n+
60 DEVICE_CONTEXT context) {
\n+
61 return new D3D11StencilTable(stencilTable, context->GetDeviceContext());
\n+
62 }
\n+
\n+
63
\n+
\n+
64 static D3D11StencilTable *Create(Far::StencilTable const *stencilTable,
\n+
65 ID3D11DeviceContext *deviceContext) {
\n+
66 return new D3D11StencilTable(stencilTable, deviceContext);
\n+
67 }
\n+
\n+
68
\n+\n+
70 ID3D11DeviceContext *deviceContext);
\n+
71
\n+\n
73
\n-
\n-
75 ID3D11Buffer *BindVBO(ID3D11DeviceContext *deviceContext) {
\n-
76 return BindD3D11Buffer(deviceContext);
\n-
77 }
\n-
\n-
78
\n-
79protected:
\n-
81 CpuD3D11VertexBuffer(int numElements, int numVertices);
\n-
82
\n-
83 bool allocate(ID3D11Device *device);
\n-
84
\n-
85private:
\n-
86 int _numElements;
\n-
87 int _numVertices;
\n-
88 ID3D11Buffer *_d3d11Buffer;
\n-
89 float *_cpuBuffer;
\n-
90};
\n+
74 // interfaces needed for D3D11ComputeEvaluator
\n+
75 ID3D11ShaderResourceView *GetSizesSRV() const { return _sizes; }
\n+
76 ID3D11ShaderResourceView *GetOffsetsSRV() const { return _offsets; }
\n+
77 ID3D11ShaderResourceView *GetIndicesSRV() const { return _indices; }
\n+
78 ID3D11ShaderResourceView *GetWeightsSRV() const { return _weights; }
\n+
79 int GetNumStencils() const { return _numStencils; }
\n+
80
\n+
81private:
\n+
82 ID3D11ShaderResourceView *_sizes;
\n+
83 ID3D11ShaderResourceView *_offsets;
\n+
84 ID3D11ShaderResourceView *_indices;
\n+
85 ID3D11ShaderResourceView *_weights;
\n+
86 ID3D11Buffer *_sizesBuffer;
\n+
87 ID3D11Buffer *_offsetsBuffer;
\n+
88 ID3D11Buffer *_indicesBuffer;
\n+
89 ID3D11Buffer *_weightsBuffer;
\n+
90
\n+
91 int _numStencils;
\n+
92};
\n
\n-
91
\n-
92} // end namespace Osd
\n
93
\n-
94} // end namespace OPENSUBDIV_VERSION
\n-
95using namespace OPENSUBDIV_VERSION;
\n-
96
\n-
97} // end namespace OpenSubdiv
\n-
98
\n-
99#endif // OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n+
94// ---------------------------------------------------------------------------
\n+
95
\n+
\n+\n+
97public:
\n+
98 typedef bool Instantiatable;
\n+\n+
100 BufferDescriptor const &dstDesc,
\n+
101 BufferDescriptor const &duDesc,
\n+
102 BufferDescriptor const &dvDesc,
\n+
103 ID3D11DeviceContext *deviceContext);
\n+
104
\n+\n+
106 BufferDescriptor const &dstDesc,
\n+
107 BufferDescriptor const &duDesc,
\n+
108 BufferDescriptor const &dvDesc,
\n+
109 BufferDescriptor const &duuDesc,
\n+
110 BufferDescriptor const &duvDesc,
\n+
111 BufferDescriptor const &dvvDesc,
\n+
112 ID3D11DeviceContext *deviceContext);
\n+
113
\n+\n+
116
\n+\n+
119
\n+
147 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
148 static bool EvalStencils(
\n+
149 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
150 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
151 STENCIL_TABLE const *stencilTable,
\n+
152 D3D11ComputeEvaluator const *instance,
\n+
153 ID3D11DeviceContext * deviceContext) {
\n+
154 if (instance) {
\n+
155 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
156 dstBuffer, dstDesc,
\n+
157 stencilTable,
\n+
158 deviceContext);
\n+
159 } else {
\n+
160 // Create an instance on demand (slow)
\n+
161 (void)deviceContext; // unused
\n+
162 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
165 deviceContext);
\n+
166 if (instance) {
\n+
167 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
168 dstBuffer, dstDesc,
\n+
169 stencilTable,
\n+
170 deviceContext);
\n+
171 delete instance;
\n+
172 return r;
\n+
173 }
\n+
174 return false;
\n+
175 }
\n+
176 }
\n+
\n+
177
\n+
180 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
182 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
183 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
184 STENCIL_TABLE const *stencilTable,
\n+
185 ID3D11DeviceContext *deviceContext) const {
\n+
186 return EvalStencils(srcBuffer->BindD3D11UAV(deviceContext), srcDesc,
\n+
187 dstBuffer->BindD3D11UAV(deviceContext), dstDesc,
\n+
188 stencilTable->GetSizesSRV(),
\n+
189 stencilTable->GetOffsetsSRV(),
\n+
190 stencilTable->GetIndicesSRV(),
\n+
191 stencilTable->GetWeightsSRV(),
\n+
192 /* start = */ 0,
\n+
193 /* end = */ stencilTable->GetNumStencils(),
\n+
194 deviceContext);
\n+
195 }
\n+
\n+
196
\n+
199 bool EvalStencils(ID3D11UnorderedAccessView *srcSRV,
\n+
200 BufferDescriptor const &srcDesc,
\n+
201 ID3D11UnorderedAccessView *dstUAV,
\n+
202 BufferDescriptor const &dstDesc,
\n+
203 ID3D11ShaderResourceView *sizesSRV,
\n+
204 ID3D11ShaderResourceView *offsetsSRV,
\n+
205 ID3D11ShaderResourceView *indicesSRV,
\n+
206 ID3D11ShaderResourceView *weightsSRV,
\n+
207 int start,
\n+
208 int end,
\n+
209 ID3D11DeviceContext *deviceContext) const;
\n+
210
\n+
212 bool Compile(BufferDescriptor const &srcDesc,
\n+
213 BufferDescriptor const &dstDesc,
\n+
214 ID3D11DeviceContext *deviceContext);
\n+
215
\n+
217 static void Synchronize(ID3D11DeviceContext *deviceContext);
\n+
218
\n+
219private:
\n+
220 ID3D11ComputeShader * _computeShader;
\n+
221 ID3D11ClassLinkage * _classLinkage;
\n+
222 ID3D11ClassInstance * _singleBufferKernel;
\n+
223 ID3D11ClassInstance * _separateBufferKernel;
\n+
224 ID3D11Buffer * _uniformArgs; // uniform parameters for kernels
\n+
225
\n+
226 int _workGroupSize;
\n+
227};
\n+
\n+
228
\n+
229} // end namespace Osd
\n+
230
\n+
231} // end namespace OPENSUBDIV_VERSION
\n+
232using namespace OPENSUBDIV_VERSION;
\n+
233
\n+
234} // end namespace OpenSubdiv
\n+
235
\n+
236
\n+
237#endif // OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n \n-
Concrete vertex buffer class for Cpu subdivision and DirectX drawing.
\n-
static CpuD3D11VertexBuffer * Create(int numElements, int numVertices, ID3D11DeviceContext *deviceContext)
Creator. Returns NULL if error.
\n-
CpuD3D11VertexBuffer(int numElements, int numVertices)
Constructor.
\n-
int GetNumElements() const
Returns how many elements defined in this vertex buffer.
\n-
void UpdateData(const float *src, int startVertex, int numVertices, void *deviceContext=NULL)
\n-
int GetNumVertices() const
Returns how many vertices allocated in this vertex buffer.
\n-
ID3D11Buffer * BindD3D11Buffer(ID3D11DeviceContext *deviceContext)
Returns the D3D11 buffer object.
\n-
float * BindCpuBuffer()
Returns the address of CPU buffer.
\n-\n-\n-
ID3D11Buffer * BindVBO(ID3D11DeviceContext *deviceContext)
Returns the D3D11 buffer object (for Osd::Mesh interface)
\n+
Stencil table class wrapping the template for compatibility.
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+
static D3D11StencilTable * Create(Far::StencilTable const *stencilTable, DEVICE_CONTEXT context)
\n+\n+\n+\n+\n+
D3D11StencilTable(Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
\n+
static D3D11StencilTable * Create(Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
\n+\n+\n+\n+
static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, ID3D11DeviceContext *deviceContext)
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, D3D11ComputeEvaluator const *instance, ID3D11DeviceContext *deviceContext)
Generic static compute function. This function has a same signature as other device kernels have so t...
\n+
static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, ID3D11DeviceContext *deviceContext)
\n+\n+
static void Synchronize(ID3D11DeviceContext *deviceContext)
Wait the dispatched kernel finishes.
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, ID3D11DeviceContext *deviceContext) const
\n+
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, ID3D11DeviceContext *deviceContext)
Configure DX kernel. Returns false if it fails to compile the kernel.
\n+\n+\n+
bool EvalStencils(ID3D11UnorderedAccessView *srcSRV, BufferDescriptor const &srcDesc, ID3D11UnorderedAccessView *dstUAV, BufferDescriptor const &dstDesc, ID3D11ShaderResourceView *sizesSRV, ID3D11ShaderResourceView *offsetsSRV, ID3D11ShaderResourceView *indicesSRV, ID3D11ShaderResourceView *weightsSRV, int start, int end, ID3D11DeviceContext *deviceContext) const
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-cpuD3D11VertexBuffer.h\n+d3d11ComputeEvaluator.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,105 +24,272 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n-26#define OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n+25#ifndef OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n+26#define OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n 27\n 28#include \"../version.h\"\n-29#include \n-30\n+29\n+30struct ID3D11DeviceContext;\n 31struct ID3D11Buffer;\n-32struct ID3D11Device;\n-33struct ID3D11DeviceContext;\n-34\n-35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-36namespace OPENSUBDIV_VERSION {\n+32struct ID3D11ComputeShader;\n+33struct ID3D11ClassLinkage;\n+34struct ID3D11ClassInstance;\n+35struct ID3D11ShaderResourceView;\n+36struct ID3D11UnorderedAccessView;\n 37\n-38namespace Osd {\n+38#include \"../osd/bufferDescriptor.h\"\n 39\n-_\b4_\b8class _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n-49public:\n-_\b5_\b1 static _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n-52 ID3D11DeviceContext *deviceContext);\n-53\n-_\b5_\b5 virtual _\b~_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br();\n-56\n-_\b5_\b9 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n-60 void *deviceContext = NULL);\n-61\n-_\b6_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const;\n-64\n-_\b6_\b6 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n-67\n-_\b6_\b9 float * _\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br();\n-70\n-_\b7_\b2 ID3D11Buffer *_\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br(ID3D11DeviceContext *deviceContext);\n+40namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+41namespace OPENSUBDIV_VERSION {\n+42\n+43namespace Far {\n+44 class StencilTable;\n+45}\n+46\n+47namespace Osd {\n+48\n+_\b5_\b6class _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n+57public:\n+58 template \n+_\b5_\b9 static _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+60 DEVICE_CONTEXT context) {\n+61 return new _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, context->GetDeviceContext());\n+62 }\n+63\n+_\b6_\b4 static _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+65 ID3D11DeviceContext *deviceContext) {\n+66 return new _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, deviceContext);\n+67 }\n+68\n+_\b6_\b9 _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+70 ID3D11DeviceContext *deviceContext);\n+71\n+_\b7_\b2 _\b~_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n 73\n-_\b7_\b5 ID3D11Buffer *_\bB_\bi_\bn_\bd_\bV_\bB_\bO(ID3D11DeviceContext *deviceContext) {\n-76 return _\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br(deviceContext);\n-77 }\n-78\n-79protected:\n-_\b8_\b1 _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices);\n-82\n-_\b8_\b3 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(ID3D11Device *device);\n-84\n-85private:\n-86 int _numElements;\n-87 int _numVertices;\n-88 ID3D11Buffer *_d3d11Buffer;\n-89 float *_cpuBuffer;\n-90};\n-91\n-92} // end namespace Osd\n+74 // interfaces needed for D3D11ComputeEvaluator\n+_\b7_\b5 ID3D11ShaderResourceView *_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bS_\bR_\bV() const { return _sizes; }\n+_\b7_\b6 ID3D11ShaderResourceView *_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bS_\bR_\bV() const { return _offsets; }\n+_\b7_\b7 ID3D11ShaderResourceView *_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bS_\bR_\bV() const { return _indices; }\n+_\b7_\b8 ID3D11ShaderResourceView *_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bS_\bR_\bV() const { return _weights; }\n+_\b7_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n+80\n+81private:\n+82 ID3D11ShaderResourceView *_sizes;\n+83 ID3D11ShaderResourceView *_offsets;\n+84 ID3D11ShaderResourceView *_indices;\n+85 ID3D11ShaderResourceView *_weights;\n+86 ID3D11Buffer *_sizesBuffer;\n+87 ID3D11Buffer *_offsetsBuffer;\n+88 ID3D11Buffer *_indicesBuffer;\n+89 ID3D11Buffer *_weightsBuffer;\n+90\n+91 int _numStencils;\n+92};\n 93\n-94} // end namespace OPENSUBDIV_VERSION\n-95using namespace OPENSUBDIV_VERSION;\n-96\n-97} // end namespace OpenSubdiv\n-98\n-99#endif // OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n+94// --------------------------------------------------------------------------\n+-\n+95\n+_\b9_\b6class _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n+97public:\n+_\b9_\b8 typedef bool _\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be;\n+_\b9_\b9 static _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+100 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+101 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+102 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+103 ID3D11DeviceContext *deviceContext);\n+104\n+_\b1_\b0_\b5 static _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+106 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+108 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+109 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+110 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+111 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+112 ID3D11DeviceContext *deviceContext);\n+113\n+_\b1_\b1_\b5 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n+116\n+_\b1_\b1_\b8 _\b~_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n+119\n+147 template \n+_\b1_\b4_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+149 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+150 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+151 STENCIL_TABLE const *stencilTable,\n+152 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+153 ID3D11DeviceContext * deviceContext) {\n+154 if (instance) {\n+155 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+156 dstBuffer, dstDesc,\n+157 stencilTable,\n+158 deviceContext);\n+159 } else {\n+160 // Create an instance on demand (slow)\n+161 (void)deviceContext; // unused\n+162 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+163 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+164 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+165 deviceContext);\n+166 if (instance) {\n+167 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+168 dstBuffer, dstDesc,\n+169 stencilTable,\n+170 deviceContext);\n+171 delete instance;\n+172 return r;\n+173 }\n+174 return false;\n+175 }\n+176 }\n+177\n+180 template \n+_\b1_\b8_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+182 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+183 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+184 STENCIL_TABLE const *stencilTable,\n+185 ID3D11DeviceContext *deviceContext) const {\n+186 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindD3D11UAV(deviceContext), srcDesc,\n+187 dstBuffer->BindD3D11UAV(deviceContext), dstDesc,\n+188 stencilTable->GetSizesSRV(),\n+189 stencilTable->GetOffsetsSRV(),\n+190 stencilTable->GetIndicesSRV(),\n+191 stencilTable->GetWeightsSRV(),\n+192 /* start = */ 0,\n+193 /* end = */ stencilTable->GetNumStencils(),\n+194 deviceContext);\n+195 }\n+196\n+_\b1_\b9_\b9 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(ID3D11UnorderedAccessView *srcSRV,\n+200 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+201 ID3D11UnorderedAccessView *dstUAV,\n+202 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+203 ID3D11ShaderResourceView *sizesSRV,\n+204 ID3D11ShaderResourceView *offsetsSRV,\n+205 ID3D11ShaderResourceView *indicesSRV,\n+206 ID3D11ShaderResourceView *weightsSRV,\n+207 int start,\n+208 int end,\n+209 ID3D11DeviceContext *deviceContext) const;\n+210\n+_\b2_\b1_\b2 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+213 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+214 ID3D11DeviceContext *deviceContext);\n+215\n+_\b2_\b1_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(ID3D11DeviceContext *deviceContext);\n+218\n+219private:\n+220 ID3D11ComputeShader * _computeShader;\n+221 ID3D11ClassLinkage * _classLinkage;\n+222 ID3D11ClassInstance * _singleBufferKernel;\n+223 ID3D11ClassInstance * _separateBufferKernel;\n+224 ID3D11Buffer * _uniformArgs; // uniform parameters for kernels\n+225\n+226 int _workGroupSize;\n+227};\n+228\n+229} // end namespace Osd\n+230\n+231} // end namespace OPENSUBDIV_VERSION\n+232using namespace OPENSUBDIV_VERSION;\n+233\n+234} // end namespace OpenSubdiv\n+235\n+236\n+237#endif // OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-Concrete vertex buffer class for Cpu subdivision and DirectX drawing.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CpuD3D11VertexBuffer * Create(int numElements, int numVertices,\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+BufferDescriptor is a struct which describes buffer elements in interleaved\n+data buffers....\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+D3D11 stencil table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static D3D11StencilTable * Create(Far::StencilTable const *stencilTable,\n+DEVICE_CONTEXT context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bS_\bR_\bV\n+ID3D11ShaderResourceView * GetOffsetsSRV() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+int GetNumStencils() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bS_\bR_\bV\n+ID3D11ShaderResourceView * GetIndicesSRV() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+~D3D11StencilTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+D3D11StencilTable(Far::StencilTable const *stencilTable, ID3D11DeviceContext\n+*deviceContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static D3D11StencilTable * Create(Far::StencilTable const *stencilTable,\n ID3D11DeviceContext *deviceContext)\n-Creator. Returns NULL if error.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-CpuD3D11VertexBuffer(int numElements, int numVertices)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bS_\bR_\bV\n+ID3D11ShaderResourceView * GetSizesSRV() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bS_\bR_\bV\n+ID3D11ShaderResourceView * GetWeightsSRV() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n+BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n+BufferDescriptor const &dvDesc, ID3D11DeviceContext *deviceContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n+const *stencilTable, D3D11ComputeEvaluator const *instance, ID3D11DeviceContext\n+*deviceContext)\n+Generic static compute function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n+BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n+BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc,\n+BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc,\n+ID3D11DeviceContext *deviceContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n+bool Instantiatable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(ID3D11DeviceContext *deviceContext)\n+Wait the dispatched kernel finishes.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n+*stencilTable, ID3D11DeviceContext *deviceContext) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n+bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc,\n+ID3D11DeviceContext *deviceContext)\n+Configure DX kernel. Returns false if it fails to compile the kernel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:\n+_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D3D11ComputeEvaluator()\n Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-int GetNumElements() const\n-Returns how many elements defined in this vertex buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n-void UpdateData(const float *src, int startVertex, int numVertices, void\n-*deviceContext=NULL)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int GetNumVertices() const\n-Returns how many vertices allocated in this vertex buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br\n-ID3D11Buffer * BindD3D11Buffer(ID3D11DeviceContext *deviceContext)\n-Returns the D3D11 buffer object.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br\n-float * BindCpuBuffer()\n-Returns the address of CPU buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n-bool allocate(ID3D11Device *device)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:\n-_\b~_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-virtual ~CpuD3D11VertexBuffer()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:\n+_\b~_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+~D3D11ComputeEvaluator()\n Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bV_\bB_\bO\n-ID3D11Buffer * BindVBO(ID3D11DeviceContext *deviceContext)\n-Returns the D3D11 buffer object (for Osd::Mesh interface)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(ID3D11UnorderedAccessView *srcSRV, BufferDescriptor const\n+&srcDesc, ID3D11UnorderedAccessView *dstUAV, BufferDescriptor const &dstDesc,\n+ID3D11ShaderResourceView *sizesSRV, ID3D11ShaderResourceView *offsetsSRV,\n+ID3D11ShaderResourceView *indicesSRV, ID3D11ShaderResourceView *weightsSRV, int\n+start, int end, ID3D11DeviceContext *deviceContext) const\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00857.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00857.html", "unified_diff": "@@ -95,15 +95,15 @@\n Namespaces |\n Typedefs \n
glMesh.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../osd/mesh.h"
\n-#include "../osd/glPatchTable.h"
\n+#include "../osd/glPatchTable.h"
\n
\n

Go to the source code of this file.

\n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00860.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00860.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/glVertexBuffer.h File Reference\n+OpenSubdiv: opensubdiv/osd/glPatchTable.h File Reference\n \n \n \n \n \n \n \n@@ -90,42 +90,45 @@\n \n \n \n
\n \n-
glVertexBuffer.h File Reference
\n+
glPatchTable.h File Reference
\n
\n
\n
#include "../version.h"
\n+#include "../osd/nonCopyable.h"
\n #include "../osd/opengl.h"
\n-#include <cstddef>
\n+#include "../osd/types.h"
\n+#include <vector>
\n
\n

Go to the source code of this file.

\n

\n Namespaces

namespace  OpenSubdiv
 
\n \n-\n-\n+\n \n

\n Classes

class  GLVertexBuffer
 Concrete vertex buffer class for GLSL subdivision and OpenGL drawing. More...
class  GLPatchTable
 
\n \n \n \n \n \n+\n+\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,26 +1,28 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-glVertexBuffer.h File Reference\n+glPatchTable.h File Reference\n #include \"../version.h\"\n+#include \"../osd/nonCopyable.h\"\n #include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bg_\bl_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-\u00a0 Concrete vertex buffer class for GLSL subdivision and OpenGL drawing.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n+\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bg_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00860.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00860.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00860 = [\n- [\"GLVertexBuffer\", \"a01237.html\", \"a01237\"]\n+ [\"GLPatchTable\", \"a01229.html\", \"a01229\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00860_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00860_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/glVertexBuffer.h Source File\n+OpenSubdiv: opensubdiv/osd/glPatchTable.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
glVertexBuffer.h
\n+
glPatchTable.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,78 +119,200 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H
\n-
26#define OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H
\n+
25#ifndef OPENSUBDIV3_OSD_GL_PATCH_TABLE_H
\n+
26#define OPENSUBDIV3_OSD_GL_PATCH_TABLE_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../osd/opengl.h"
\n-
31#include <cstddef>
\n-
32
\n-
33namespace OpenSubdiv {
\n-
34namespace OPENSUBDIV_VERSION {
\n+
30#include "../osd/nonCopyable.h"
\n+
31#include "../osd/opengl.h"
\n+
32#include "../osd/types.h"
\n+
33
\n+
34#include <vector>
\n
35
\n-
36namespace Osd {
\n-
37
\n-
\n-\n-
45public:
\n-
47 static GLVertexBuffer * Create(int numElements, int numVertices,
\n-
48 void *deviceContext = NULL);
\n-
49
\n-\n-
52
\n-
55 void UpdateData(const float *src, int startVertex, int numVertices,
\n-
56 void *deviceContext = NULL);
\n-
57
\n-
59 int GetNumElements() const;
\n-
60
\n-
62 int GetNumVertices() const;
\n+
36namespace OpenSubdiv {
\n+
37namespace OPENSUBDIV_VERSION {
\n+
38
\n+
39namespace Far{
\n+
40 class PatchTable;
\n+
41};
\n+
42
\n+
43namespace Osd {
\n+
44
\n+
\n+
45class GLPatchTable : private NonCopyable<GLPatchTable> {
\n+
46public:
\n+
47 typedef GLuint VertexBufferBinding;
\n+
48
\n+\n+
50
\n+
51 static GLPatchTable *Create(Far::PatchTable const *farPatchTable,
\n+
52 void *deviceContext = NULL);
\n+
53
\n+
\n+\n+
56 return _patchArrays;
\n+
57 }
\n+
\n+
58
\n+
\n+
60 GLuint GetPatchIndexBuffer() const {
\n+
61 return _patchIndexBuffer;
\n+
62 }
\n+
\n
63
\n-
65 GLuint BindVBO(void *deviceContext = NULL);
\n-
66
\n-
67protected:
\n-
69 GLVertexBuffer(int numElements, int numVertices);
\n-
70
\n-
73 bool allocate();
\n-
74
\n-
75private:
\n-
76 int _numElements;
\n-
77 int _numVertices;
\n-
78 GLuint _vbo;
\n-
79};
\n-
\n-
80
\n-
81} // end namespace Osd
\n-
82
\n-
83} // end namespace OPENSUBDIV_VERSION
\n-
84using namespace OPENSUBDIV_VERSION;
\n-
85
\n-
86} // end namespace OpenSubdiv
\n-
87
\n-
88#endif // OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H
\n+
\n+
65 GLuint GetPatchParamBuffer() const {
\n+
66 return _patchParamBuffer;
\n+
67 }
\n+
\n+
68
\n+
\n+\n+
71 return _patchIndexTexture;
\n+
72 }
\n+
\n+
73
\n+
\n+\n+
76 return _patchParamTexture;
\n+
77 }
\n+
\n+
78
\n+
\n+\n+\n+
82 }
\n+
\n+
83
\n+
\n+\n+\n+
87 }
\n+
\n+
88
\n+
\n+\n+\n+
92 }
\n+
\n+
93
\n+
95 int GetNumFVarChannels() const { return (int)_fvarPatchArrays.size(); }
\n+
96
\n+
\n+
98 PatchArrayVector const &GetFVarPatchArrays(int fvarChannel = 0) const {
\n+
99 return _fvarPatchArrays[fvarChannel];
\n+
100 }
\n+
\n+
101
\n+
\n+
103 GLuint GetFVarPatchIndexBuffer(int fvarChannel = 0) const {
\n+
104 return _fvarIndexBuffers[fvarChannel];
\n+
105 }
\n+
\n+
106
\n+
\n+
108 GLuint GetFVarPatchIndexTextureBuffer(int fvarChannel = 0) const {
\n+
109 return _fvarIndexTextures[fvarChannel];
\n+
110 }
\n+
\n+
111
\n+
\n+
113 GLuint GetFVarPatchParamBuffer(int fvarChannel = 0) const {
\n+
114 return _fvarParamBuffers[fvarChannel];
\n+
115 }
\n+
\n+
116
\n+
\n+
118 GLuint GetFVarPatchParamTextureBuffer(int fvarChannel = 0) const {
\n+
119 return _fvarParamTextures[fvarChannel];
\n+
120 }
\n+
\n+
121
\n+
122protected:
\n+\n+
124
\n+
125 // allocate buffers from patchTable
\n+
126 bool allocate(Far::PatchTable const *farPatchTable);
\n+
127
\n+\n+
129
\n+\n+\n+
132
\n+\n+\n+
135
\n+\n+\n+\n+
139
\n+
140 std::vector<PatchArrayVector> _fvarPatchArrays;
\n+
141 std::vector<GLuint> _fvarIndexBuffers;
\n+
142 std::vector<GLuint> _fvarIndexTextures;
\n+
143
\n+
144 std::vector<GLuint> _fvarParamBuffers;
\n+
145 std::vector<GLuint> _fvarParamTextures;
\n+
146};
\n+
\n+
147
\n+
148
\n+
149} // end namespace Osd
\n+
150
\n+
151} // end namespace OPENSUBDIV_VERSION
\n+
152using namespace OPENSUBDIV_VERSION;
\n+
153
\n+
154} // end namespace OpenSubdiv
\n+
155
\n+
156#endif // OPENSUBDIV3_OSD_GL_PATCH_TABLE_H
\n \n-
Concrete vertex buffer class for GLSL subdivision and OpenGL drawing.
\n-\n-
GLuint BindVBO(void *deviceContext=NULL)
Returns the GL buffer object.
\n-
int GetNumElements() const
Returns how many elements defined in this vertex buffer.
\n-
void UpdateData(const float *src, int startVertex, int numVertices, void *deviceContext=NULL)
\n-
GLVertexBuffer(int numElements, int numVertices)
Constructor.
\n-
int GetNumVertices() const
Returns how many vertices allocated in this vertex buffer.
\n-
static GLVertexBuffer * Create(int numElements, int numVertices, void *deviceContext=NULL)
Creator. Returns NULL if error.
\n-\n+
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+\n+\n+\n+
PatchArrayVector const & GetPatchArrays() const
Returns the patch arrays for vertex index buffer data.
\n+
GLuint GetFVarPatchIndexBuffer(int fvarChannel=0) const
Returns the GL index buffer containing face-varying control vertices.
\n+\n+\n+
GLuint GetPatchParamTextureBuffer() const
Returns the GL texture buffer containing the patch parameter.
\n+\n+
bool allocate(Far::PatchTable const *farPatchTable)
\n+
static GLPatchTable * Create(Far::PatchTable const *farPatchTable, void *deviceContext=NULL)
\n+\n+\n+\n+\n+
GLuint GetPatchParamBuffer() const
Returns the GL index buffer containing the patch parameter.
\n+
GLuint GetFVarPatchParamBuffer(int fvarChannel=0) const
Returns the GL index buffer containing face-varying patch params.
\n+\n+\n+
GLuint GetFVarPatchIndexTextureBuffer(int fvarChannel=0) const
Returns the GL texture buffer containing face-varying control vertices.
\n+
GLuint GetFVarPatchParamTextureBuffer(int fvarChannel=0) const
Returns the GL texture buffer containing face-varying patch params.
\n+
GLuint GetPatchIndexBuffer() const
Returns the GL index buffer containing the patch control vertices.
\n+
int GetNumFVarChannels() const
Returns the number of face-varying channel buffers.
\n+
PatchArrayVector const & GetFVarPatchArrays(int fvarChannel=0) const
Returns the patch arrays for face-varying index buffer data.
\n+\n+\n+
std::vector< PatchArrayVector > _fvarPatchArrays
\n+
GLuint GetPatchIndexTextureBuffer() const
Returns the GL texture buffer containing the patch control vertices.
\n+
GLuint GetVaryingPatchIndexTextureBuffer() const
Returns the GL texture buffer containing the varying control vertices.
\n+\n+
GLuint GetVaryingPatchIndexBuffer() const
Returns the GL index buffer containing the varying control vertices.
\n+
PatchArrayVector const & GetVaryingPatchArrays() const
Returns the patch arrays for varying index buffer data.
\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-glVertexBuffer.h\n+glPatchTable.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,88 +24,249 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H\n-26#define OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H\n+25#ifndef OPENSUBDIV3_OSD_GL_PATCH_TABLE_H\n+26#define OPENSUBDIV3_OSD_GL_PATCH_TABLE_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../osd/opengl.h\"\n-31#include \n-32\n-33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-34namespace OPENSUBDIV_VERSION {\n+30#include \"../osd/nonCopyable.h\"\n+31#include \"../osd/opengl.h\"\n+32#include \"../osd/types.h\"\n+33\n+34#include \n 35\n-36namespace Osd {\n-37\n-_\b4_\b4class _\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n-45public:\n-_\b4_\b7 static _\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n-48 void *deviceContext = NULL);\n-49\n-_\b5_\b1 _\b~_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br();\n-52\n-_\b5_\b5 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n-56 void *deviceContext = NULL);\n-57\n-_\b5_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const;\n-60\n-_\b6_\b2 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n+36namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+37namespace OPENSUBDIV_VERSION {\n+38\n+39namespace Far{\n+40 class PatchTable;\n+41};\n+42\n+43namespace Osd {\n+44\n+_\b4_\b5class _\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be : private NonCopyable {\n+46public:\n+_\b4_\b7 typedef GLuint _\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bB_\bi_\bn_\bd_\bi_\bn_\bg;\n+48\n+_\b4_\b9 _\b~_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n+50\n+_\b5_\b1 static _\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable,\n+52 void *deviceContext = NULL);\n+53\n+_\b5_\b5 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const {\n+56 return _\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n+57 }\n+58\n+_\b6_\b0 GLuint _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const {\n+61 return _\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n+62 }\n 63\n-_\b6_\b5 GLuint _\bB_\bi_\bn_\bd_\bV_\bB_\bO(void *deviceContext = NULL);\n-66\n-67protected:\n-_\b6_\b9 _\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices);\n-70\n-_\b7_\b3 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be();\n-74\n-75private:\n-76 int _numElements;\n-77 int _numVertices;\n-78 GLuint _vbo;\n-79};\n-80\n-81} // end namespace Osd\n-82\n-83} // end namespace OPENSUBDIV_VERSION\n-84using namespace OPENSUBDIV_VERSION;\n-85\n-86} // end namespace OpenSubdiv\n-87\n-88#endif // OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H\n+_\b6_\b5 GLuint _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br() const {\n+66 return _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br;\n+67 }\n+68\n+_\b7_\b0 GLuint _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n+71 return _\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be;\n+72 }\n+73\n+_\b7_\b5 GLuint _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n+76 return _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be;\n+77 }\n+78\n+_\b8_\b0 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const {\n+81 return _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n+82 }\n+83\n+_\b8_\b5 GLuint _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const {\n+86 return _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n+87 }\n+88\n+_\b9_\b0 GLuint _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n+91 return _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be;\n+92 }\n+93\n+_\b9_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const { return (int)_\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs.size(); }\n+96\n+_\b9_\b8 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs(int fvarChannel = 0) const {\n+99 return _\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs[fvarChannel];\n+100 }\n+101\n+_\b1_\b0_\b3 GLuint _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const {\n+104 return _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs[fvarChannel];\n+105 }\n+106\n+_\b1_\b0_\b8 GLuint _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const {\n+109 return _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bs[fvarChannel];\n+110 }\n+111\n+_\b1_\b1_\b3 GLuint _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const {\n+114 return _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs[fvarChannel];\n+115 }\n+116\n+_\b1_\b1_\b8 GLuint _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const {\n+119 return _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bs[fvarChannel];\n+120 }\n+121\n+122protected:\n+_\b1_\b2_\b3 _\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n+124\n+125 // allocate buffers from patchTable\n+_\b1_\b2_\b6 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable);\n+127\n+_\b1_\b2_\b8 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n+129\n+_\b1_\b3_\b0 GLuint _\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n+_\b1_\b3_\b1 GLuint _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br;\n+132\n+_\b1_\b3_\b3 GLuint _\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be;\n+_\b1_\b3_\b4 GLuint _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be;\n+135\n+_\b1_\b3_\b6 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n+_\b1_\b3_\b7 GLuint _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n+_\b1_\b3_\b8 GLuint _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be;\n+139\n+_\b1_\b4_\b0 std::vector _\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n+_\b1_\b4_\b1 std::vector _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs;\n+_\b1_\b4_\b2 std::vector _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bs;\n+143\n+_\b1_\b4_\b4 std::vector _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs;\n+_\b1_\b4_\b5 std::vector _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bs;\n+146};\n+147\n+148\n+149} // end namespace Osd\n+150\n+151} // end namespace OPENSUBDIV_VERSION\n+152using namespace OPENSUBDIV_VERSION;\n+153\n+154} // end namespace OpenSubdiv\n+155\n+156#endif // OPENSUBDIV3_OSD_GL_PATCH_TABLE_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-Concrete vertex buffer class for GLSL subdivision and OpenGL drawing.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\b~_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-~GLVertexBuffer()\n-Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bV_\bB_\bO\n-GLuint BindVBO(void *deviceContext=NULL)\n-Returns the GL buffer object.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-int GetNumElements() const\n-Returns how many elements defined in this vertex buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n-void UpdateData(const float *src, int startVertex, int numVertices, void\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br\n+std::vector< PatchArray > PatchArrayVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+Container for arrays of parametric patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bB_\bi_\bn_\bd_\bi_\bn_\bg\n+GLuint VertexBufferBinding\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs\n+std::vector< GLuint > _fvarIndexBuffers\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector const & GetPatchArrays() const\n+Returns the patch arrays for vertex index buffer data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetFVarPatchIndexBuffer(int fvarChannel=0) const\n+Returns the GL index buffer containing face-varying control vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b0_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+~GLPatchTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs\n+std::vector< GLuint > _fvarParamBuffers\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetPatchParamTextureBuffer() const\n+Returns the GL texture buffer containing the patch parameter.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+GLuint _varyingIndexBuffer\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n+bool allocate(Far::PatchTable const *farPatchTable)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static GLPatchTable * Create(Far::PatchTable const *farPatchTable, void\n *deviceContext=NULL)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-GLVertexBuffer(int numElements, int numVertices)\n-Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int GetNumVertices() const\n-Returns how many vertices allocated in this vertex buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static GLVertexBuffer * Create(int numElements, int numVertices, void\n-*deviceContext=NULL)\n-Creator. Returns NULL if error.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n-bool allocate()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be\n+GLuint _varyingIndexTexture\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bs\n+std::vector< GLuint > _fvarParamTextures\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector _patchArrays\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b2_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+GLuint _patchIndexBuffer\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetPatchParamBuffer() const\n+Returns the GL index buffer containing the patch parameter.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetFVarPatchParamBuffer(int fvarChannel=0) const\n+Returns the GL index buffer containing face-varying patch params.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be\n+GLuint _patchParamTexture\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+GLPatchTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetFVarPatchIndexTextureBuffer(int fvarChannel=0) const\n+Returns the GL texture buffer containing face-varying control vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b0_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetFVarPatchParamTextureBuffer(int fvarChannel=0) const\n+Returns the GL texture buffer containing face-varying patch params.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetPatchIndexBuffer() const\n+Returns the GL index buffer containing the patch control vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+int GetNumFVarChannels() const\n+Returns the number of face-varying channel buffers.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector const & GetFVarPatchArrays(int fvarChannel=0) const\n+Returns the patch arrays for face-varying index buffer data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bs\n+std::vector< GLuint > _fvarIndexTextures\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be\n+GLuint _patchIndexTexture\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+std::vector< PatchArrayVector > _fvarPatchArrays\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetPatchIndexTextureBuffer() const\n+Returns the GL texture buffer containing the patch control vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetVaryingPatchIndexTextureBuffer() const\n+Returns the GL texture buffer containing the varying control vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector _varyingPatchArrays\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetVaryingPatchIndexBuffer() const\n+Returns the GL index buffer containing the varying control vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector const & GetVaryingPatchArrays() const\n+Returns the patch arrays for varying index buffer data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n+GLuint _patchParamBuffer\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b1\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bg_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00863.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00863.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/glLegacyGregoryPatchTable.h File Reference\n+OpenSubdiv: opensubdiv/osd/glVertexBuffer.h File Reference\n \n \n \n \n \n \n \n@@ -90,27 +90,27 @@\n \n \n \n
\n \n-
glLegacyGregoryPatchTable.h File Reference
\n+
glVertexBuffer.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/patchTable.h"
\n-#include "../osd/nonCopyable.h"
\n #include "../osd/opengl.h"
\n+#include <cstddef>
\n
\n

Go to the source code of this file.

\n \n \n-\n+\n+\n \n

\n Classes

class  GLLegacyGregoryPatchTable
class  GLVertexBuffer
 Concrete vertex buffer class for GLSL subdivision and OpenGL drawing. More...
 
\n \n \n \n \n@@ -119,13 +119,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,26 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-glLegacyGregoryPatchTable.h File Reference\n+glVertexBuffer.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n-#include \"../osd/nonCopyable.h\"\n #include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bg_\bl_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+class \u00a0 _\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+\u00a0 Concrete vertex buffer class for GLSL subdivision and OpenGL drawing.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bg_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00863.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00863.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00863 = [\n- [\"GLLegacyGregoryPatchTable\", \"a01225.html\", \"a01225\"]\n+ [\"GLVertexBuffer\", \"a01237.html\", \"a01237\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00863_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00863_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/glLegacyGregoryPatchTable.h Source File\n+OpenSubdiv: opensubdiv/osd/glVertexBuffer.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
glLegacyGregoryPatchTable.h
\n+
glVertexBuffer.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,103 +119,78 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H
\n-
26#define OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H
\n+
25#ifndef OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H
\n+
26#define OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../far/patchTable.h"
\n-
31#include "../osd/nonCopyable.h"
\n-
32#include "../osd/opengl.h"
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Osd {
\n-
38
\n-
\n-\n-
40 : private NonCopyable<GLLegacyGregoryPatchTable> {
\n-
41public:
\n-\n-
43
\n-\n-
45
\n-
46 void UpdateVertexBuffer(GLuint vbo);
\n-
47
\n-
\n-
48 GLuint GetVertexTextureBuffer() const {
\n-
49 return _vertexTextureBuffer;
\n-
50 }
\n-
\n-
51
\n-
\n-\n-
53 return _vertexValenceTextureBuffer;
\n-
54 }
\n-
\n-
55
\n-
\n-\n-
57 return _quadOffsetsTextureBuffer;
\n-
58 }
\n-
\n-
59
\n-
\n-\n-\n-
62 return _quadOffsetsBase[1];
\n-
63 }
\n-
64 return _quadOffsetsBase[0];
\n-
65 }
\n-
\n+
30#include "../osd/opengl.h"
\n+
31#include <cstddef>
\n+
32
\n+
33namespace OpenSubdiv {
\n+
34namespace OPENSUBDIV_VERSION {
\n+
35
\n+
36namespace Osd {
\n+
37
\n+
\n+\n+
45public:
\n+
47 static GLVertexBuffer * Create(int numElements, int numVertices,
\n+
48 void *deviceContext = NULL);
\n+
49
\n+\n+
52
\n+
55 void UpdateData(const float *src, int startVertex, int numVertices,
\n+
56 void *deviceContext = NULL);
\n+
57
\n+
59 int GetNumElements() const;
\n+
60
\n+
62 int GetNumVertices() const;
\n+
63
\n+
65 GLuint BindVBO(void *deviceContext = NULL);
\n
66
\n
67protected:
\n-\n-
69
\n-
70private:
\n-
71 GLuint _vertexTextureBuffer;
\n-
72 GLuint _vertexValenceTextureBuffer;
\n-
73 GLuint _quadOffsetsTextureBuffer;
\n-
74 GLuint _quadOffsetsBase[2]; // gregory, boundaryGregory
\n-
75};
\n-
\n-
76
\n-
77
\n-
78
\n-
79} // end namespace Osd
\n+
69 GLVertexBuffer(int numElements, int numVertices);
\n+
70
\n+
73 bool allocate();
\n+
74
\n+
75private:
\n+
76 int _numElements;
\n+
77 int _numVertices;
\n+
78 GLuint _vbo;
\n+
79};
\n+
\n
80
\n-
81} // end namespace OPENSUBDIV_VERSION
\n-
82using namespace OPENSUBDIV_VERSION;
\n-
83
\n-
84} // end namespace OpenSubdiv
\n+
81} // end namespace Osd
\n+
82
\n+
83} // end namespace OPENSUBDIV_VERSION
\n+
84using namespace OPENSUBDIV_VERSION;
\n
85
\n-
86#endif // OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H
\n+
86} // end namespace OpenSubdiv
\n+
87
\n+
88#endif // OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H
\n \n-\n-\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-\n-\n-\n-\n-\n-\n-\n-\n-
static GLLegacyGregoryPatchTable * Create(Far::PatchTable const *patchTable)
\n+
Concrete vertex buffer class for GLSL subdivision and OpenGL drawing.
\n+\n+
GLuint BindVBO(void *deviceContext=NULL)
Returns the GL buffer object.
\n+
int GetNumElements() const
Returns how many elements defined in this vertex buffer.
\n+
void UpdateData(const float *src, int startVertex, int numVertices, void *deviceContext=NULL)
\n+
GLVertexBuffer(int numElements, int numVertices)
Constructor.
\n+
int GetNumVertices() const
Returns how many vertices allocated in this vertex buffer.
\n+
static GLVertexBuffer * Create(int numElements, int numVertices, void *deviceContext=NULL)
Creator. Returns NULL if error.
\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-glLegacyGregoryPatchTable.h\n+glVertexBuffer.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,113 +24,88 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H\n-26#define OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H\n+25#ifndef OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H\n+26#define OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../far/patchTable.h\"\n-31#include \"../osd/nonCopyable.h\"\n-32#include \"../osd/opengl.h\"\n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Osd {\n-38\n-_\b3_\b9class _\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-40 : private NonCopyable {\n-41public:\n-_\b4_\b2 _\b~_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n-43\n-_\b4_\b4 static _\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *patchTable);\n-45\n-_\b4_\b6 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(GLuint vbo);\n-47\n-_\b4_\b8 GLuint _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n-49 return _vertexTextureBuffer;\n-50 }\n-51\n-_\b5_\b2 GLuint _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n-53 return _vertexValenceTextureBuffer;\n-54 }\n-55\n-_\b5_\b6 GLuint _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n-57 return _quadOffsetsTextureBuffer;\n-58 }\n-59\n-_\b6_\b0 GLuint _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\ba_\bs_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type) {\n-61 if (type == _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY) {\n-62 return _quadOffsetsBase[1];\n-63 }\n-64 return _quadOffsetsBase[0];\n-65 }\n+30#include \"../osd/opengl.h\"\n+31#include \n+32\n+33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+34namespace OPENSUBDIV_VERSION {\n+35\n+36namespace Osd {\n+37\n+_\b4_\b4class _\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n+45public:\n+_\b4_\b7 static _\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n+48 void *deviceContext = NULL);\n+49\n+_\b5_\b1 _\b~_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br();\n+52\n+_\b5_\b5 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n+56 void *deviceContext = NULL);\n+57\n+_\b5_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const;\n+60\n+_\b6_\b2 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n+63\n+_\b6_\b5 GLuint _\bB_\bi_\bn_\bd_\bV_\bB_\bO(void *deviceContext = NULL);\n 66\n 67protected:\n-_\b6_\b8 _\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n-69\n-70private:\n-71 GLuint _vertexTextureBuffer;\n-72 GLuint _vertexValenceTextureBuffer;\n-73 GLuint _quadOffsetsTextureBuffer;\n-74 GLuint _quadOffsetsBase[2]; // gregory, boundaryGregory\n-75};\n-76\n-77\n-78\n-79} // end namespace Osd\n+_\b6_\b9 _\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices);\n+70\n+_\b7_\b3 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be();\n+74\n+75private:\n+76 int _numElements;\n+77 int _numVertices;\n+78 GLuint _vbo;\n+79};\n 80\n-81} // end namespace OPENSUBDIV_VERSION\n-82using namespace OPENSUBDIV_VERSION;\n-83\n-84} // end namespace OpenSubdiv\n+81} // end namespace Osd\n+82\n+83} // end namespace OPENSUBDIV_VERSION\n+84using namespace OPENSUBDIV_VERSION;\n 85\n-86#endif // OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H\n+86} // end namespace OpenSubdiv\n+87\n+88#endif // OPENSUBDIV3_OSD_GL_VERTEX_BUFFER_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n-Type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY\n-@ GREGORY_BOUNDARY\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-Container for arrays of parametric patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetVertexValenceTextureBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetQuadOffsetsTextureBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\b~_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-~GLLegacyGregoryPatchTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-GLLegacyGregoryPatchTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bU_\bp_\bd_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-void UpdateVertexBuffer(GLuint vbo)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\ba_\bs_\be\n-GLuint GetQuadOffsetsBase(Far::PatchDescriptor::Type type)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetVertexTextureBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static GLLegacyGregoryPatchTable * Create(Far::PatchTable const *patchTable)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+Concrete vertex buffer class for GLSL subdivision and OpenGL drawing.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\b~_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+~GLVertexBuffer()\n+Destructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bV_\bB_\bO\n+GLuint BindVBO(void *deviceContext=NULL)\n+Returns the GL buffer object.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+int GetNumElements() const\n+Returns how many elements defined in this vertex buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n+void UpdateData(const float *src, int startVertex, int numVertices, void\n+*deviceContext=NULL)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+GLVertexBuffer(int numElements, int numVertices)\n+Constructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int GetNumVertices() const\n+Returns how many vertices allocated in this vertex buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static GLVertexBuffer * Create(int numElements, int numVertices, void\n+*deviceContext=NULL)\n+Creator. Returns NULL if error.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n+bool allocate()\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bg_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00866.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00866.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/glPatchTable.h File Reference\n+OpenSubdiv: opensubdiv/osd/glLegacyGregoryPatchTable.h File Reference\n \n \n \n \n \n \n \n@@ -90,45 +90,42 @@\n \n \n \n
\n \n-
glPatchTable.h File Reference
\n+
glLegacyGregoryPatchTable.h File Reference
\n
\n
\n
#include "../version.h"
\n+#include "../far/patchTable.h"
\n #include "../osd/nonCopyable.h"
\n #include "../osd/opengl.h"
\n-#include "../osd/types.h"
\n-#include <vector>
\n
\n

Go to the source code of this file.

\n \n \n-\n+\n \n

\n Classes

class  GLPatchTable
class  GLLegacyGregoryPatchTable
 
\n \n \n \n \n \n-\n-\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-glPatchTable.h File Reference\n+glLegacyGregoryPatchTable.h File Reference\n #include \"../version.h\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n #include \"../osd/nonCopyable.h\"\n #include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bg_\bl_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+class \u00a0 _\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n-\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00866.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00866.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00866 = [\n- [\"GLPatchTable\", \"a01229.html\", \"a01229\"]\n+ [\"GLLegacyGregoryPatchTable\", \"a01225.html\", \"a01225\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00866_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00866_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/glPatchTable.h Source File\n+OpenSubdiv: opensubdiv/osd/glLegacyGregoryPatchTable.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
glPatchTable.h
\n+
glLegacyGregoryPatchTable.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,200 +119,103 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_GL_PATCH_TABLE_H
\n-
26#define OPENSUBDIV3_OSD_GL_PATCH_TABLE_H
\n+
25#ifndef OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H
\n+
26#define OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../osd/nonCopyable.h"
\n-
31#include "../osd/opengl.h"
\n-
32#include "../osd/types.h"
\n+
30#include "../far/patchTable.h"
\n+
31#include "../osd/nonCopyable.h"
\n+
32#include "../osd/opengl.h"
\n
33
\n-
34#include <vector>
\n-
35
\n-
36namespace OpenSubdiv {
\n-
37namespace OPENSUBDIV_VERSION {
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Osd {
\n
38
\n-
39namespace Far{
\n-
40 class PatchTable;
\n-
41};
\n-
42
\n-
43namespace Osd {
\n-
44
\n-
\n-
45class GLPatchTable : private NonCopyable<GLPatchTable> {
\n-
46public:
\n-
47 typedef GLuint VertexBufferBinding;
\n-
48
\n-\n-
50
\n-
51 static GLPatchTable *Create(Far::PatchTable const *farPatchTable,
\n-
52 void *deviceContext = NULL);
\n-
53
\n-
\n-\n-
56 return _patchArrays;
\n-
57 }
\n+
\n+\n+
40 : private NonCopyable<GLLegacyGregoryPatchTable> {
\n+
41public:
\n+\n+
43
\n+\n+
45
\n+
46 void UpdateVertexBuffer(GLuint vbo);
\n+
47
\n+
\n+
48 GLuint GetVertexTextureBuffer() const {
\n+
49 return _vertexTextureBuffer;
\n+
50 }
\n+
\n+
51
\n+
\n+\n+
53 return _vertexValenceTextureBuffer;
\n+
54 }
\n+
\n+
55
\n+
\n+\n+
57 return _quadOffsetsTextureBuffer;
\n+
58 }
\n
\n-
58
\n+
59
\n
\n-
60 GLuint GetPatchIndexBuffer() const {
\n-
61 return _patchIndexBuffer;
\n-
62 }
\n-
\n-
63
\n-
\n-
65 GLuint GetPatchParamBuffer() const {
\n-
66 return _patchParamBuffer;
\n-
67 }
\n-
\n-
68
\n-
\n-\n-
71 return _patchIndexTexture;
\n-
72 }
\n-
\n-
73
\n-
\n-\n-
76 return _patchParamTexture;
\n-
77 }
\n+\n+\n+
62 return _quadOffsetsBase[1];
\n+
63 }
\n+
64 return _quadOffsetsBase[0];
\n+
65 }
\n+
\n+
66
\n+
67protected:
\n+\n+
69
\n+
70private:
\n+
71 GLuint _vertexTextureBuffer;
\n+
72 GLuint _vertexValenceTextureBuffer;
\n+
73 GLuint _quadOffsetsTextureBuffer;
\n+
74 GLuint _quadOffsetsBase[2]; // gregory, boundaryGregory
\n+
75};
\n
\n+
76
\n+
77
\n
78
\n-
\n-\n-\n-
82 }
\n-
\n+
79} // end namespace Osd
\n+
80
\n+
81} // end namespace OPENSUBDIV_VERSION
\n+
82using namespace OPENSUBDIV_VERSION;
\n
83
\n-
\n-\n-\n-
87 }
\n-
\n-
88
\n-
\n-\n-\n-
92 }
\n-
\n-
93
\n-
95 int GetNumFVarChannels() const { return (int)_fvarPatchArrays.size(); }
\n-
96
\n-
\n-
98 PatchArrayVector const &GetFVarPatchArrays(int fvarChannel = 0) const {
\n-
99 return _fvarPatchArrays[fvarChannel];
\n-
100 }
\n-
\n-
101
\n-
\n-
103 GLuint GetFVarPatchIndexBuffer(int fvarChannel = 0) const {
\n-
104 return _fvarIndexBuffers[fvarChannel];
\n-
105 }
\n-
\n-
106
\n-
\n-
108 GLuint GetFVarPatchIndexTextureBuffer(int fvarChannel = 0) const {
\n-
109 return _fvarIndexTextures[fvarChannel];
\n-
110 }
\n-
\n-
111
\n-
\n-
113 GLuint GetFVarPatchParamBuffer(int fvarChannel = 0) const {
\n-
114 return _fvarParamBuffers[fvarChannel];
\n-
115 }
\n-
\n-
116
\n-
\n-
118 GLuint GetFVarPatchParamTextureBuffer(int fvarChannel = 0) const {
\n-
119 return _fvarParamTextures[fvarChannel];
\n-
120 }
\n-
\n-
121
\n-
122protected:
\n-\n-
124
\n-
125 // allocate buffers from patchTable
\n-
126 bool allocate(Far::PatchTable const *farPatchTable);
\n-
127
\n-\n-
129
\n-\n-\n-
132
\n-\n-\n-
135
\n-\n-\n-\n-
139
\n-
140 std::vector<PatchArrayVector> _fvarPatchArrays;
\n-
141 std::vector<GLuint> _fvarIndexBuffers;
\n-
142 std::vector<GLuint> _fvarIndexTextures;
\n-
143
\n-
144 std::vector<GLuint> _fvarParamBuffers;
\n-
145 std::vector<GLuint> _fvarParamTextures;
\n-
146};
\n-
\n-
147
\n-
148
\n-
149} // end namespace Osd
\n-
150
\n-
151} // end namespace OPENSUBDIV_VERSION
\n-
152using namespace OPENSUBDIV_VERSION;
\n-
153
\n-
154} // end namespace OpenSubdiv
\n-
155
\n-
156#endif // OPENSUBDIV3_OSD_GL_PATCH_TABLE_H
\n+
84} // end namespace OpenSubdiv
\n+
85
\n+
86#endif // OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H
\n \n-
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n+\n+\n
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-\n-\n-\n-
PatchArrayVector const & GetPatchArrays() const
Returns the patch arrays for vertex index buffer data.
\n-
GLuint GetFVarPatchIndexBuffer(int fvarChannel=0) const
Returns the GL index buffer containing face-varying control vertices.
\n-\n-\n-
GLuint GetPatchParamTextureBuffer() const
Returns the GL texture buffer containing the patch parameter.
\n-\n-
bool allocate(Far::PatchTable const *farPatchTable)
\n-
static GLPatchTable * Create(Far::PatchTable const *farPatchTable, void *deviceContext=NULL)
\n-\n-\n-\n-\n-
GLuint GetPatchParamBuffer() const
Returns the GL index buffer containing the patch parameter.
\n-
GLuint GetFVarPatchParamBuffer(int fvarChannel=0) const
Returns the GL index buffer containing face-varying patch params.
\n-\n-\n-
GLuint GetFVarPatchIndexTextureBuffer(int fvarChannel=0) const
Returns the GL texture buffer containing face-varying control vertices.
\n-
GLuint GetFVarPatchParamTextureBuffer(int fvarChannel=0) const
Returns the GL texture buffer containing face-varying patch params.
\n-
GLuint GetPatchIndexBuffer() const
Returns the GL index buffer containing the patch control vertices.
\n-
int GetNumFVarChannels() const
Returns the number of face-varying channel buffers.
\n-
PatchArrayVector const & GetFVarPatchArrays(int fvarChannel=0) const
Returns the patch arrays for face-varying index buffer data.
\n-\n-\n-
std::vector< PatchArrayVector > _fvarPatchArrays
\n-
GLuint GetPatchIndexTextureBuffer() const
Returns the GL texture buffer containing the patch control vertices.
\n-
GLuint GetVaryingPatchIndexTextureBuffer() const
Returns the GL texture buffer containing the varying control vertices.
\n-\n-
GLuint GetVaryingPatchIndexBuffer() const
Returns the GL index buffer containing the varying control vertices.
\n-
PatchArrayVector const & GetVaryingPatchArrays() const
Returns the patch arrays for varying index buffer data.
\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+
static GLLegacyGregoryPatchTable * Create(Far::PatchTable const *patchTable)
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-glPatchTable.h\n+glLegacyGregoryPatchTable.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,249 +24,113 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_GL_PATCH_TABLE_H\n-26#define OPENSUBDIV3_OSD_GL_PATCH_TABLE_H\n+25#ifndef OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H\n+26#define OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../osd/nonCopyable.h\"\n-31#include \"../osd/opengl.h\"\n-32#include \"../osd/types.h\"\n+30#include \"../far/patchTable.h\"\n+31#include \"../osd/nonCopyable.h\"\n+32#include \"../osd/opengl.h\"\n 33\n-34#include \n-35\n-36namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-37namespace OPENSUBDIV_VERSION {\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Osd {\n 38\n-39namespace Far{\n-40 class PatchTable;\n-41};\n-42\n-43namespace Osd {\n-44\n-_\b4_\b5class _\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be : private NonCopyable {\n-46public:\n-_\b4_\b7 typedef GLuint _\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bB_\bi_\bn_\bd_\bi_\bn_\bg;\n-48\n-_\b4_\b9 _\b~_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n-50\n-_\b5_\b1 static _\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable,\n-52 void *deviceContext = NULL);\n-53\n-_\b5_\b5 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const {\n-56 return _\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n-57 }\n-58\n-_\b6_\b0 GLuint _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const {\n-61 return _\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n-62 }\n-63\n-_\b6_\b5 GLuint _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br() const {\n-66 return _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br;\n-67 }\n-68\n-_\b7_\b0 GLuint _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n-71 return _\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be;\n-72 }\n-73\n-_\b7_\b5 GLuint _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n-76 return _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be;\n-77 }\n+_\b3_\b9class _\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+40 : private NonCopyable {\n+41public:\n+_\b4_\b2 _\b~_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n+43\n+_\b4_\b4 static _\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *patchTable);\n+45\n+_\b4_\b6 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(GLuint vbo);\n+47\n+_\b4_\b8 GLuint _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n+49 return _vertexTextureBuffer;\n+50 }\n+51\n+_\b5_\b2 GLuint _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n+53 return _vertexValenceTextureBuffer;\n+54 }\n+55\n+_\b5_\b6 GLuint _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n+57 return _quadOffsetsTextureBuffer;\n+58 }\n+59\n+_\b6_\b0 GLuint _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\ba_\bs_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type) {\n+61 if (type == _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY) {\n+62 return _quadOffsetsBase[1];\n+63 }\n+64 return _quadOffsetsBase[0];\n+65 }\n+66\n+67protected:\n+_\b6_\b8 _\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n+69\n+70private:\n+71 GLuint _vertexTextureBuffer;\n+72 GLuint _vertexValenceTextureBuffer;\n+73 GLuint _quadOffsetsTextureBuffer;\n+74 GLuint _quadOffsetsBase[2]; // gregory, boundaryGregory\n+75};\n+76\n+77\n 78\n-_\b8_\b0 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const {\n-81 return _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n-82 }\n+79} // end namespace Osd\n+80\n+81} // end namespace OPENSUBDIV_VERSION\n+82using namespace OPENSUBDIV_VERSION;\n 83\n-_\b8_\b5 GLuint _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const {\n-86 return _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n-87 }\n-88\n-_\b9_\b0 GLuint _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br() const {\n-91 return _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be;\n-92 }\n-93\n-_\b9_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const { return (int)_\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs.size(); }\n-96\n-_\b9_\b8 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs(int fvarChannel = 0) const {\n-99 return _\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs[fvarChannel];\n-100 }\n-101\n-_\b1_\b0_\b3 GLuint _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const {\n-104 return _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs[fvarChannel];\n-105 }\n-106\n-_\b1_\b0_\b8 GLuint _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const {\n-109 return _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bs[fvarChannel];\n-110 }\n-111\n-_\b1_\b1_\b3 GLuint _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const {\n-114 return _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs[fvarChannel];\n-115 }\n-116\n-_\b1_\b1_\b8 GLuint _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const {\n-119 return _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bs[fvarChannel];\n-120 }\n-121\n-122protected:\n-_\b1_\b2_\b3 _\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n-124\n-125 // allocate buffers from patchTable\n-_\b1_\b2_\b6 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable);\n-127\n-_\b1_\b2_\b8 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n-129\n-_\b1_\b3_\b0 GLuint _\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n-_\b1_\b3_\b1 GLuint _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br;\n-132\n-_\b1_\b3_\b3 GLuint _\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be;\n-_\b1_\b3_\b4 GLuint _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be;\n-135\n-_\b1_\b3_\b6 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n-_\b1_\b3_\b7 GLuint _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n-_\b1_\b3_\b8 GLuint _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be;\n-139\n-_\b1_\b4_\b0 std::vector _\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n-_\b1_\b4_\b1 std::vector _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs;\n-_\b1_\b4_\b2 std::vector _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bs;\n-143\n-_\b1_\b4_\b4 std::vector _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs;\n-_\b1_\b4_\b5 std::vector _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bs;\n-146};\n-147\n-148\n-149} // end namespace Osd\n-150\n-151} // end namespace OPENSUBDIV_VERSION\n-152using namespace OPENSUBDIV_VERSION;\n-153\n-154} // end namespace OpenSubdiv\n-155\n-156#endif // OPENSUBDIV3_OSD_GL_PATCH_TABLE_H\n+84} // end namespace OpenSubdiv\n+85\n+86#endif // OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br\n-std::vector< PatchArray > PatchArrayVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n+Type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY\n+@ GREGORY_BOUNDARY\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n Container for arrays of parametric patches.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bB_\bi_\bn_\bd_\bi_\bn_\bg\n-GLuint VertexBufferBinding\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs\n-std::vector< GLuint > _fvarIndexBuffers\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector const & GetPatchArrays() const\n-Returns the patch arrays for vertex index buffer data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetFVarPatchIndexBuffer(int fvarChannel=0) const\n-Returns the GL index buffer containing face-varying control vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-~GLPatchTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs\n-std::vector< GLuint > _fvarParamBuffers\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetPatchParamTextureBuffer() const\n-Returns the GL texture buffer containing the patch parameter.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-GLuint _varyingIndexBuffer\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n-bool allocate(Far::PatchTable const *farPatchTable)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static GLPatchTable * Create(Far::PatchTable const *farPatchTable, void\n-*deviceContext=NULL)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be\n-GLuint _varyingIndexTexture\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bs\n-std::vector< GLuint > _fvarParamTextures\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector _patchArrays\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b2_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-GLuint _patchIndexBuffer\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetPatchParamBuffer() const\n-Returns the GL index buffer containing the patch parameter.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetFVarPatchParamBuffer(int fvarChannel=0) const\n-Returns the GL index buffer containing face-varying patch params.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be\n-GLuint _patchParamTexture\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-GLPatchTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetFVarPatchIndexTextureBuffer(int fvarChannel=0) const\n-Returns the GL texture buffer containing face-varying control vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b0_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetFVarPatchParamTextureBuffer(int fvarChannel=0) const\n-Returns the GL texture buffer containing face-varying patch params.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetPatchIndexBuffer() const\n-Returns the GL index buffer containing the patch control vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int GetNumFVarChannels() const\n-Returns the number of face-varying channel buffers.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector const & GetFVarPatchArrays(int fvarChannel=0) const\n-Returns the patch arrays for face-varying index buffer data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bs\n-std::vector< GLuint > _fvarIndexTextures\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be\n-GLuint _patchIndexTexture\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-std::vector< PatchArrayVector > _fvarPatchArrays\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetPatchIndexTextureBuffer() const\n-Returns the GL texture buffer containing the patch control vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetVaryingPatchIndexTextureBuffer() const\n-Returns the GL texture buffer containing the varying control vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector _varyingPatchArrays\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetVaryingPatchIndexBuffer() const\n-Returns the GL index buffer containing the varying control vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector const & GetVaryingPatchArrays() const\n-Returns the patch arrays for varying index buffer data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n-GLuint _patchParamBuffer\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetVertexValenceTextureBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetQuadOffsetsTextureBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\b~_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+~GLLegacyGregoryPatchTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+GLLegacyGregoryPatchTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bU_\bp_\bd_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+void UpdateVertexBuffer(GLuint vbo)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\ba_\bs_\be\n+GLuint GetQuadOffsetsBase(Far::PatchDescriptor::Type type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bT_\be_\bx_\bt_\bu_\br_\be_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetVertexTextureBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static GLLegacyGregoryPatchTable * Create(Far::PatchTable const *patchTable)\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bg_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bg_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00878.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00878.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/ompEvaluator.h File Reference\n+OpenSubdiv: opensubdiv/osd/ompKernel.h File Reference\n \n \n \n \n \n \n \n@@ -88,44 +88,45 @@\n \n \n \n \n \n
\n \n-
ompEvaluator.h File Reference
\n+Namespaces |\n+Functions
\n+
ompKernel.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../osd/bufferDescriptor.h"
\n-#include "../osd/types.h"
\n-#include <cstddef>
\n
\n

Go to the source code of this file.

\n \n-\n-\n-\n-

\n-Classes

class  OmpEvaluator
 
\n \n \n \n \n \n \n \n+

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n+\n+\n+\n+\n+\n+\n+\n

\n+Functions

void OmpEvalStencils (float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, int start, int end)
 
void OmpEvalStencils (float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *dstDu, BufferDescriptor const &dstDuDesc, float *dstDv, BufferDescriptor const &dstDvDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, float const *duWeights, float const *dvWeights, int start, int end)
 
void OmpEvalStencils (float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *dstDu, BufferDescriptor const &dstDuDesc, float *dstDv, BufferDescriptor const &dstDvDesc, float *dstDuu, BufferDescriptor const &dstDuuDesc, float *dstDuv, BufferDescriptor const &dstDuvDesc, float *dstDvv, BufferDescriptor const &dstDvvDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, float const *duWeights, float const *dvWeights, float const *duuWeights, float const *duvWeights, float const *dvvWeights, int start, int end)
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,41 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-ompEvaluator.h File Reference\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+ompKernel.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+void\u00a0 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs (float const *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc, float\n+ *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc, int const *sizes, int const\n+ *offsets, int const *indices, float const *weights, int start, int end)\n+\u00a0\n+void\u00a0 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs (float const *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc, float\n+ *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc, float *dstDu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+ const &dstDuDesc, float *dstDv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvDesc, int\n+ const *sizes, int const *offsets, int const *indices, float const\n+ *weights, float const *duWeights, float const *dvWeights, int start, int\n+ end)\n+\u00a0\n+void\u00a0 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs (float const *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc, float\n+ *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc, float *dstDu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+ const &dstDuDesc, float *dstDv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvDesc, float\n+ *dstDuu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuuDesc, float *dstDuv,\n+ _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuvDesc, float *dstDvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const\n+ &dstDvvDesc, int const *sizes, int const *offsets, int const *indices,\n+ float const *weights, float const *duWeights, float const *dvWeights,\n+ float const *duuWeights, float const *duvWeights, float const\n+ *dvvWeights, int start, int end)\n+\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bo_\bm_\bp_\bK_\be_\br_\bn_\be_\bl_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00878.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00878.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,5 @@\n var a00878 = [\n- [\"OmpEvaluator\", \"a01305.html\", null]\n+ [\"OmpEvalStencils\", \"a00878.html#a44a05502feb5015035bc81b93cffb99c\", null],\n+ [\"OmpEvalStencils\", \"a00878.html#a907dc53421460557871ddc35f77751f5\", null],\n+ [\"OmpEvalStencils\", \"a00878.html#a870745ff3e883b32547d4db42b3be2bd\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00878_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00878_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/ompEvaluator.h Source File\n+OpenSubdiv: opensubdiv/osd/ompKernel.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
ompEvaluator.h
\n+
ompKernel.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,528 +119,82 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_OMP_EVALUATOR_H
\n-
26#define OPENSUBDIV3_OSD_OMP_EVALUATOR_H
\n+
25#ifndef OPENSUBDIV3_OSD_OMP_KERNEL_H
\n+
26#define OPENSUBDIV3_OSD_OMP_KERNEL_H
\n
27
\n
28#include "../version.h"
\n-
29#include "../osd/bufferDescriptor.h"
\n-
30#include "../osd/types.h"
\n-
31
\n-
32#include <cstddef>
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n+
29
\n+
30namespace OpenSubdiv {
\n+
31namespace OPENSUBDIV_VERSION {
\n+
32
\n+
33namespace Osd {
\n+
34
\n+
35struct BufferDescriptor;
\n
36
\n-
37namespace Osd {
\n-
38
\n-
\n-\n-
40public:
\n-
46
\n-
71 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
72 static bool EvalStencils(
\n-
73 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
74 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
75 STENCIL_TABLE const *stencilTable,
\n-
76 const OmpEvaluator *instance = NULL,
\n-
77 void * deviceContext = NULL) {
\n-
78
\n-
79 (void)instance; // unused
\n-
80 (void)deviceContext; // unused
\n-
81
\n-
82 if (stencilTable->GetNumStencils() == 0)
\n-
83 return false;
\n+
37void
\n+
38OmpEvalStencils(float const * src, BufferDescriptor const &srcDesc,
\n+
39 float * dst, BufferDescriptor const &dstDesc,
\n+
40 int const * sizes,
\n+
41 int const * offsets,
\n+
42 int const * indices,
\n+
43 float const * weights,
\n+
44 int start, int end);
\n+
45
\n+
46void
\n+
47OmpEvalStencils(float const * src, BufferDescriptor const &srcDesc,
\n+
48 float * dst, BufferDescriptor const &dstDesc,
\n+
49 float * dstDu, BufferDescriptor const &dstDuDesc,
\n+
50 float * dstDv, BufferDescriptor const &dstDvDesc,
\n+
51 int const * sizes,
\n+
52 int const * offsets,
\n+
53 int const * indices,
\n+
54 float const * weights,
\n+
55 float const * duWeights,
\n+
56 float const * dvWeights,
\n+
57 int start, int end);
\n+
58
\n+
59void
\n+
60OmpEvalStencils(float const * src, BufferDescriptor const &srcDesc,
\n+
61 float * dst, BufferDescriptor const &dstDesc,
\n+
62 float * dstDu, BufferDescriptor const &dstDuDesc,
\n+
63 float * dstDv, BufferDescriptor const &dstDvDesc,
\n+
64 float * dstDuu, BufferDescriptor const &dstDuuDesc,
\n+
65 float * dstDuv, BufferDescriptor const &dstDuvDesc,
\n+
66 float * dstDvv, BufferDescriptor const &dstDvvDesc,
\n+
67 int const * sizes,
\n+
68 int const * offsets,
\n+
69 int const * indices,
\n+
70 float const * weights,
\n+
71 float const * duWeights,
\n+
72 float const * dvWeights,
\n+
73 float const * duuWeights,
\n+
74 float const * duvWeights,
\n+
75 float const * dvvWeights,
\n+
76 int start, int end);
\n+
77
\n+
78} // end namespace Osd
\n+
79
\n+
80} // end namespace OPENSUBDIV_VERSION
\n+
81using namespace OPENSUBDIV_VERSION;
\n+
82
\n+
83} // end namespace OpenSubdiv
\n
84
\n-
85 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
86 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
87 &stencilTable->GetSizes()[0],
\n-
88 &stencilTable->GetOffsets()[0],
\n-
89 &stencilTable->GetControlIndices()[0],
\n-
90 &stencilTable->GetWeights()[0],
\n-
91 /*start = */ 0,
\n-
92 /*end = */ stencilTable->GetNumStencils());
\n-
93 }
\n-
\n-
94
\n-
121 static bool EvalStencils(
\n-
122 const float *src, BufferDescriptor const &srcDesc,
\n-
123 float *dst, BufferDescriptor const &dstDesc,
\n-
124 const int * sizes,
\n-
125 const int * offsets,
\n-
126 const int * indices,
\n-
127 const float * weights,
\n-
128 int start, int end);
\n-
129
\n-
167 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
168 static bool EvalStencils(
\n-
169 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
170 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
171 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
172 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
173 STENCIL_TABLE const *stencilTable,
\n-
174 const OmpEvaluator *instance = NULL,
\n-
175 void * deviceContext = NULL) {
\n-
176
\n-
177 (void)instance; // unused
\n-
178 (void)deviceContext; // unused
\n-
179
\n-
180 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
181 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
182 duBuffer->BindCpuBuffer(), duDesc,
\n-
183 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
184 &stencilTable->GetSizes()[0],
\n-
185 &stencilTable->GetOffsets()[0],
\n-
186 &stencilTable->GetControlIndices()[0],
\n-
187 &stencilTable->GetWeights()[0],
\n-
188 &stencilTable->GetDuWeights()[0],
\n-
189 &stencilTable->GetDvWeights()[0],
\n-
190 /*start = */ 0,
\n-
191 /*end = */ stencilTable->GetNumStencils());
\n-
192 }
\n-
\n-
193
\n-
234 static bool EvalStencils(
\n-
235 const float *src, BufferDescriptor const &srcDesc,
\n-
236 float *dst, BufferDescriptor const &dstDesc,
\n-
237 float *du, BufferDescriptor const &duDesc,
\n-
238 float *dv, BufferDescriptor const &dvDesc,
\n-
239 const int * sizes,
\n-
240 const int * offsets,
\n-
241 const int * indices,
\n-
242 const float * weights,
\n-
243 const float * duWeights,
\n-
244 const float * dvWeights,
\n-
245 int start, int end);
\n-
246
\n-
302 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
303 static bool EvalStencils(
\n-
304 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
305 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
306 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
307 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
308 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
309 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
310 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
311 STENCIL_TABLE const *stencilTable,
\n-
312 const OmpEvaluator *instance = NULL,
\n-
313 void * deviceContext = NULL) {
\n-
314
\n-
315 (void)instance; // unused
\n-
316 (void)deviceContext; // unused
\n-
317
\n-
318 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
319 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
320 duBuffer->BindCpuBuffer(), duDesc,
\n-
321 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
322 duuBuffer->BindCpuBuffer(), duuDesc,
\n-
323 duvBuffer->BindCpuBuffer(), duvDesc,
\n-
324 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n-
325 &stencilTable->GetSizes()[0],
\n-
326 &stencilTable->GetOffsets()[0],
\n-
327 &stencilTable->GetControlIndices()[0],
\n-
328 &stencilTable->GetWeights()[0],
\n-
329 &stencilTable->GetDuWeights()[0],
\n-
330 &stencilTable->GetDvWeights()[0],
\n-
331 &stencilTable->GetDuuWeights()[0],
\n-
332 &stencilTable->GetDuvWeights()[0],
\n-
333 &stencilTable->GetDvvWeights()[0],
\n-
334 /*start = */ 0,
\n-
335 /*end = */ stencilTable->GetNumStencils());
\n-
336 }
\n-
\n-
337
\n-
399 static bool EvalStencils(
\n-
400 const float *src, BufferDescriptor const &srcDesc,
\n-
401 float *dst, BufferDescriptor const &dstDesc,
\n-
402 float *du, BufferDescriptor const &duDesc,
\n-
403 float *dv, BufferDescriptor const &dvDesc,
\n-
404 float *duu, BufferDescriptor const &duuDesc,
\n-
405 float *duv, BufferDescriptor const &duvDesc,
\n-
406 float *dvv, BufferDescriptor const &dvvDesc,
\n-
407 const int * sizes,
\n-
408 const int * offsets,
\n-
409 const int * indices,
\n-
410 const float * weights,
\n-
411 const float * duWeights,
\n-
412 const float * dvWeights,
\n-
413 const float * duuWeights,
\n-
414 const float * duvWeights,
\n-
415 const float * dvvWeights,
\n-
416 int start, int end);
\n-
417
\n-
423
\n-
452 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
453 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
454 static bool EvalPatches(
\n-
455 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
456 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
457 int numPatchCoords,
\n-
458 PATCHCOORD_BUFFER *patchCoords,
\n-
459 PATCH_TABLE *patchTable,
\n-
460 OmpEvaluator const *instance = NULL,
\n-
461 void * deviceContext = NULL) {
\n-
462
\n-
463 (void)instance; // unused
\n-
464 (void)deviceContext; // unused
\n-
465
\n-
466 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
467 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
468 numPatchCoords,
\n-
469 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
470 patchTable->GetPatchArrayBuffer(),
\n-
471 patchTable->GetPatchIndexBuffer(),
\n-
472 patchTable->GetPatchParamBuffer());
\n-
473 }
\n-
\n-
474
\n-
515 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
516 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
517 static bool EvalPatches(
\n-
518 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
519 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
520 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
521 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
522 int numPatchCoords,
\n-
523 PATCHCOORD_BUFFER *patchCoords,
\n-
524 PATCH_TABLE *patchTable,
\n-
525 OmpEvaluator const *instance = NULL,
\n-
526 void * deviceContext = NULL) {
\n-
527
\n-
528 (void)instance; // unused
\n-
529 (void)deviceContext; // unused
\n-
530
\n-
531 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.
\n-
532 // ideally all buffer classes should have templated by datatype
\n-
533 // so that downcast isn't needed there.
\n-
534 // (e.g. Osd::CpuBuffer<PatchCoord> )
\n-
535 //
\n-
536 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
537 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
538 duBuffer->BindCpuBuffer(), duDesc,
\n-
539 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
540 numPatchCoords,
\n-
541 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
542 patchTable->GetPatchArrayBuffer(),
\n-
543 patchTable->GetPatchIndexBuffer(),
\n-
544 patchTable->GetPatchParamBuffer());
\n-
545 }
\n-
\n-
546
\n-
605 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
606 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
607 static bool EvalPatches(
\n-
608 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
609 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
610 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
611 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
612 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
613 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
614 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
615 int numPatchCoords,
\n-
616 PATCHCOORD_BUFFER *patchCoords,
\n-
617 PATCH_TABLE *patchTable,
\n-
618 OmpEvaluator const *instance = NULL,
\n-
619 void * deviceContext = NULL) {
\n-
620
\n-
621 (void)instance; // unused
\n-
622 (void)deviceContext; // unused
\n-
623
\n-
624 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.
\n-
625 // ideally all buffer classes should have templated by datatype
\n-
626 // so that downcast isn't needed there.
\n-
627 // (e.g. Osd::CpuBuffer<PatchCoord> )
\n-
628 //
\n-
629 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
630 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
631 duBuffer->BindCpuBuffer(), duDesc,
\n-
632 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
633 duuBuffer->BindCpuBuffer(), duuDesc,
\n-
634 duvBuffer->BindCpuBuffer(), duvDesc,
\n-
635 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n-
636 numPatchCoords,
\n-
637 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
638 patchTable->GetPatchArrayBuffer(),
\n-
639 patchTable->GetPatchIndexBuffer(),
\n-
640 patchTable->GetPatchParamBuffer());
\n-
641 }
\n-
\n-
642
\n-
670 static bool EvalPatches(
\n-
671 const float *src, BufferDescriptor const &srcDesc,
\n-
672 float *dst, BufferDescriptor const &dstDesc,
\n-
673 int numPatchCoords,
\n-
674 const PatchCoord *patchCoords,
\n-
675 const PatchArray *patchArrays,
\n-
676 const int *patchIndexBuffer,
\n-
677 const PatchParam *patchParamBuffer);
\n-
678
\n-
716 static bool EvalPatches(
\n-
717 const float *src, BufferDescriptor const &srcDesc,
\n-
718 float *dst, BufferDescriptor const &dstDesc,
\n-
719 float *du, BufferDescriptor const &duDesc,
\n-
720 float *dv, BufferDescriptor const &dvDesc,
\n-
721 int numPatchCoords,
\n-
722 PatchCoord const *patchCoords,
\n-
723 PatchArray const *patchArrays,
\n-
724 const int *patchIndexBuffer,
\n-
725 PatchParam const *patchParamBuffer);
\n-
726
\n-
779 static bool EvalPatches(
\n-
780 const float *src, BufferDescriptor const &srcDesc,
\n-
781 float *dst, BufferDescriptor const &dstDesc,
\n-
782 float *du, BufferDescriptor const &duDesc,
\n-
783 float *dv, BufferDescriptor const &dvDesc,
\n-
784 float *duu, BufferDescriptor const &duuDesc,
\n-
785 float *duv, BufferDescriptor const &duvDesc,
\n-
786 float *dvv, BufferDescriptor const &dvvDesc,
\n-
787 int numPatchCoords,
\n-
788 PatchCoord const *patchCoords,
\n-
789 PatchArray const *patchArrays,
\n-
790 const int *patchIndexBuffer,
\n-
791 PatchParam const *patchParamBuffer);
\n-
792
\n-
821 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
822 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
824 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
825 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
826 int numPatchCoords,
\n-
827 PATCHCOORD_BUFFER *patchCoords,
\n-
828 PATCH_TABLE *patchTable,
\n-
829 OmpEvaluator const *instance = NULL,
\n-
830 void * deviceContext = NULL) {
\n-
831
\n-
832 (void)instance; // unused
\n-
833 (void)deviceContext; // unused
\n-
834
\n-
835 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
836 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
837 numPatchCoords,
\n-
838 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
839 patchTable->GetVaryingPatchArrayBuffer(),
\n-
840 patchTable->GetVaryingPatchIndexBuffer(),
\n-
841 patchTable->GetPatchParamBuffer());
\n-
842 }
\n-
\n-
843
\n-
884 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
885 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
887 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
888 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
889 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
890 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
891 int numPatchCoords,
\n-
892 PATCHCOORD_BUFFER *patchCoords,
\n-
893 PATCH_TABLE *patchTable,
\n-
894 OmpEvaluator const *instance = NULL,
\n-
895 void * deviceContext = NULL) {
\n-
896
\n-
897 (void)instance; // unused
\n-
898 (void)deviceContext; // unused
\n-
899
\n-
900 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
901 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
902 duBuffer->BindCpuBuffer(), duDesc,
\n-
903 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
904 numPatchCoords,
\n-
905 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
906 patchTable->GetVaryingPatchArrayBuffer(),
\n-
907 patchTable->GetVaryingPatchIndexBuffer(),
\n-
908 patchTable->GetPatchParamBuffer());
\n-
909 }
\n-
\n-
910
\n-
969 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
970 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
972 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
973 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
974 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
975 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
976 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
977 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
978 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
979 int numPatchCoords,
\n-
980 PATCHCOORD_BUFFER *patchCoords,
\n-
981 PATCH_TABLE *patchTable,
\n-
982 OmpEvaluator const *instance = NULL,
\n-
983 void * deviceContext = NULL) {
\n-
984
\n-
985 (void)instance; // unused
\n-
986 (void)deviceContext; // unused
\n-
987
\n-
988 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
989 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
990 duBuffer->BindCpuBuffer(), duDesc,
\n-
991 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
992 duuBuffer->BindCpuBuffer(), duuDesc,
\n-
993 duvBuffer->BindCpuBuffer(), duvDesc,
\n-
994 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n-
995 numPatchCoords,
\n-
996 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
997 patchTable->GetVaryingPatchArrayBuffer(),
\n-
998 patchTable->GetVaryingPatchIndexBuffer(),
\n-
999 patchTable->GetPatchParamBuffer());
\n-
1000 }
\n-
\n-
1001
\n-
1032 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1033 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1035 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1036 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1037 int numPatchCoords,
\n-
1038 PATCHCOORD_BUFFER *patchCoords,
\n-
1039 PATCH_TABLE *patchTable,
\n-
1040 int fvarChannel,
\n-
1041 OmpEvaluator const *instance = NULL,
\n-
1042 void * deviceContext = NULL) {
\n-
1043
\n-
1044 (void)instance; // unused
\n-
1045 (void)deviceContext; // unused
\n-
1046
\n-
1047 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
1048 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
1049 numPatchCoords,
\n-
1050 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
1051 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
1052 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1053 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1054 }
\n-
\n-
1055
\n-
1098 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1099 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1101 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1102 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1103 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1104 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1105 int numPatchCoords,
\n-
1106 PATCHCOORD_BUFFER *patchCoords,
\n-
1107 PATCH_TABLE *patchTable,
\n-
1108 int fvarChannel,
\n-
1109 OmpEvaluator const *instance = NULL,
\n-
1110 void * deviceContext = NULL) {
\n-
1111
\n-
1112 (void)instance; // unused
\n-
1113 (void)deviceContext; // unused
\n-
1114
\n-
1115 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
1116 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
1117 duBuffer->BindCpuBuffer(), duDesc,
\n-
1118 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
1119 numPatchCoords,
\n-
1120 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
1121 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
1122 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1123 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1124 }
\n-
\n-
1125
\n-
1186 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1187 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1189 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1190 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1191 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1192 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1193 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1194 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1195 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1196 int numPatchCoords,
\n-
1197 PATCHCOORD_BUFFER *patchCoords,
\n-
1198 PATCH_TABLE *patchTable,
\n-
1199 int fvarChannel,
\n-
1200 OmpEvaluator const *instance = NULL,
\n-
1201 void * deviceContext = NULL) {
\n-
1202
\n-
1203 (void)instance; // unused
\n-
1204 (void)deviceContext; // unused
\n-
1205
\n-
1206 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
1207 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
1208 duBuffer->BindCpuBuffer(), duDesc,
\n-
1209 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
1210 duuBuffer->BindCpuBuffer(), duuDesc,
\n-
1211 duvBuffer->BindCpuBuffer(), duvDesc,
\n-
1212 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n-
1213 numPatchCoords,
\n-
1214 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
1215 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
1216 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1217 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1218 }
\n-
\n-
1219
\n-
1225
\n-
1226 static void Synchronize(void *deviceContext = NULL);
\n-
1227
\n-
1228 static void SetNumThreads(int numThreads);
\n-
1229};
\n-
\n-
1230
\n-
1231
\n-
1232} // end namespace Osd
\n-
1233
\n-
1234} // end namespace OPENSUBDIV_VERSION
\n-
1235using namespace OPENSUBDIV_VERSION;
\n-
1236
\n-
1237} // end namespace OpenSubdiv
\n-
1238
\n-
1239
\n-
1240#endif // OPENSUBDIV3_OSD_OMP_EVALUATOR_H
\n+
85#endif // OPENSUBDIV3_OSD_OMP_KERNEL_H
\n \n+
void OmpEvalStencils(float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, int start, int end)
\n
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, int start, int end)
Static eval stencils function which takes raw CPU pointers for input and output.
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const OmpEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n-
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw CPU pointers for input and output.
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, const float *duuWeights, const float *duvWeights, const float *dvvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw CPU pointers for input and output.
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, const OmpEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function. This function has a same signature as other device kernels hav...
\n-
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer, PatchParam const *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
static void Synchronize(void *deviceContext=NULL)
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, const OmpEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer, PatchParam const *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n-\n-
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const PatchCoord *patchCoords, const PatchArray *patchArrays, const int *patchIndexBuffer, const PatchParam *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
Coordinates set on a patch table.
Definition types.h:42
\n-\n-\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-ompEvaluator.h\n+ompKernel.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,655 +24,82 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_OMP_EVALUATOR_H\n-26#define OPENSUBDIV3_OSD_OMP_EVALUATOR_H\n+25#ifndef OPENSUBDIV3_OSD_OMP_KERNEL_H\n+26#define OPENSUBDIV3_OSD_OMP_KERNEL_H\n 27\n 28#include \"../version.h\"\n-29#include \"../osd/bufferDescriptor.h\"\n-30#include \"../osd/types.h\"\n-31\n-32#include \n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n+29\n+30namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+31namespace OPENSUBDIV_VERSION {\n+32\n+33namespace Osd {\n+34\n+35struct BufferDescriptor;\n 36\n-37namespace Osd {\n-38\n-_\b3_\b9class _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n-40public:\n-46\n-71 template \n-_\b7_\b2 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-73 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-74 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-75 STENCIL_TABLE const *stencilTable,\n-76 const _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n-77 void * deviceContext = NULL) {\n-78\n-79 (void)instance; // unused\n-80 (void)deviceContext; // unused\n-81\n-82 if (stencilTable->GetNumStencils() == 0)\n-83 return false;\n+37void\n+_\b3_\b8_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(float const * src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+39 float * dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+40 int const * sizes,\n+41 int const * offsets,\n+42 int const * indices,\n+43 float const * weights,\n+44 int start, int end);\n+45\n+46void\n+_\b4_\b7_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(float const * src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+48 float * dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+49 float * dstDu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuDesc,\n+50 float * dstDv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvDesc,\n+51 int const * sizes,\n+52 int const * offsets,\n+53 int const * indices,\n+54 float const * weights,\n+55 float const * duWeights,\n+56 float const * dvWeights,\n+57 int start, int end);\n+58\n+59void\n+_\b6_\b0_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(float const * src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+61 float * dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+62 float * dstDu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuDesc,\n+63 float * dstDv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvDesc,\n+64 float * dstDuu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuuDesc,\n+65 float * dstDuv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuvDesc,\n+66 float * dstDvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvvDesc,\n+67 int const * sizes,\n+68 int const * offsets,\n+69 int const * indices,\n+70 float const * weights,\n+71 float const * duWeights,\n+72 float const * dvWeights,\n+73 float const * duuWeights,\n+74 float const * duvWeights,\n+75 float const * dvvWeights,\n+76 int start, int end);\n+77\n+78} // end namespace Osd\n+79\n+80} // end namespace OPENSUBDIV_VERSION\n+81using namespace OPENSUBDIV_VERSION;\n+82\n+83} // end namespace OpenSubdiv\n 84\n-85 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-86 dstBuffer->BindCpuBuffer(), dstDesc,\n-87 &stencilTable->GetSizes()[0],\n-88 &stencilTable->GetOffsets()[0],\n-89 &stencilTable->GetControlIndices()[0],\n-90 &stencilTable->GetWeights()[0],\n-91 /*start = */ 0,\n-92 /*end = */ stencilTable->GetNumStencils());\n-93 }\n-94\n-_\b1_\b2_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-122 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-123 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-124 const int * sizes,\n-125 const int * offsets,\n-126 const int * indices,\n-127 const float * weights,\n-128 int start, int end);\n-129\n-167 template \n-_\b1_\b6_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-169 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-170 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-171 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-172 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-173 STENCIL_TABLE const *stencilTable,\n-174 const _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n-175 void * deviceContext = NULL) {\n-176\n-177 (void)instance; // unused\n-178 (void)deviceContext; // unused\n-179\n-180 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-181 dstBuffer->BindCpuBuffer(), dstDesc,\n-182 duBuffer->BindCpuBuffer(), duDesc,\n-183 dvBuffer->BindCpuBuffer(), dvDesc,\n-184 &stencilTable->GetSizes()[0],\n-185 &stencilTable->GetOffsets()[0],\n-186 &stencilTable->GetControlIndices()[0],\n-187 &stencilTable->GetWeights()[0],\n-188 &stencilTable->GetDuWeights()[0],\n-189 &stencilTable->GetDvWeights()[0],\n-190 /*start = */ 0,\n-191 /*end = */ stencilTable->GetNumStencils());\n-192 }\n-193\n-_\b2_\b3_\b4 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-235 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-236 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-237 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-238 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-239 const int * sizes,\n-240 const int * offsets,\n-241 const int * indices,\n-242 const float * weights,\n-243 const float * duWeights,\n-244 const float * dvWeights,\n-245 int start, int end);\n-246\n-302 template \n-_\b3_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-304 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-305 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-306 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-307 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-308 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-309 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-310 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-311 STENCIL_TABLE const *stencilTable,\n-312 const _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n-313 void * deviceContext = NULL) {\n-314\n-315 (void)instance; // unused\n-316 (void)deviceContext; // unused\n-317\n-318 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-319 dstBuffer->BindCpuBuffer(), dstDesc,\n-320 duBuffer->BindCpuBuffer(), duDesc,\n-321 dvBuffer->BindCpuBuffer(), dvDesc,\n-322 duuBuffer->BindCpuBuffer(), duuDesc,\n-323 duvBuffer->BindCpuBuffer(), duvDesc,\n-324 dvvBuffer->BindCpuBuffer(), dvvDesc,\n-325 &stencilTable->GetSizes()[0],\n-326 &stencilTable->GetOffsets()[0],\n-327 &stencilTable->GetControlIndices()[0],\n-328 &stencilTable->GetWeights()[0],\n-329 &stencilTable->GetDuWeights()[0],\n-330 &stencilTable->GetDvWeights()[0],\n-331 &stencilTable->GetDuuWeights()[0],\n-332 &stencilTable->GetDuvWeights()[0],\n-333 &stencilTable->GetDvvWeights()[0],\n-334 /*start = */ 0,\n-335 /*end = */ stencilTable->GetNumStencils());\n-336 }\n-337\n-_\b3_\b9_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-400 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-401 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-402 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-403 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-404 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-405 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-406 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-407 const int * sizes,\n-408 const int * offsets,\n-409 const int * indices,\n-410 const float * weights,\n-411 const float * duWeights,\n-412 const float * dvWeights,\n-413 const float * duuWeights,\n-414 const float * duvWeights,\n-415 const float * dvvWeights,\n-416 int start, int end);\n-417\n-423\n-452 template \n-_\b4_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-455 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-456 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-457 int numPatchCoords,\n-458 PATCHCOORD_BUFFER *patchCoords,\n-459 PATCH_TABLE *patchTable,\n-460 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-461 void * deviceContext = NULL) {\n-462\n-463 (void)instance; // unused\n-464 (void)deviceContext; // unused\n-465\n-466 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-467 dstBuffer->BindCpuBuffer(), dstDesc,\n-468 numPatchCoords,\n-469 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-470 patchTable->GetPatchArrayBuffer(),\n-471 patchTable->GetPatchIndexBuffer(),\n-472 patchTable->GetPatchParamBuffer());\n-473 }\n-474\n-515 template \n-_\b5_\b1_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-518 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-519 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-520 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-521 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-522 int numPatchCoords,\n-523 PATCHCOORD_BUFFER *patchCoords,\n-524 PATCH_TABLE *patchTable,\n-525 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-526 void * deviceContext = NULL) {\n-527\n-528 (void)instance; // unused\n-529 (void)deviceContext; // unused\n-530\n-531 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.\n-532 // ideally all buffer classes should have templated by datatype\n-533 // so that downcast isn't needed there.\n-534 // (e.g. Osd::CpuBuffer )\n-535 //\n-536 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-537 dstBuffer->BindCpuBuffer(), dstDesc,\n-538 duBuffer->BindCpuBuffer(), duDesc,\n-539 dvBuffer->BindCpuBuffer(), dvDesc,\n-540 numPatchCoords,\n-541 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-542 patchTable->GetPatchArrayBuffer(),\n-543 patchTable->GetPatchIndexBuffer(),\n-544 patchTable->GetPatchParamBuffer());\n-545 }\n-546\n-605 template \n-_\b6_\b0_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-608 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-609 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-610 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-611 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-612 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-613 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-614 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-615 int numPatchCoords,\n-616 PATCHCOORD_BUFFER *patchCoords,\n-617 PATCH_TABLE *patchTable,\n-618 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-619 void * deviceContext = NULL) {\n-620\n-621 (void)instance; // unused\n-622 (void)deviceContext; // unused\n-623\n-624 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.\n-625 // ideally all buffer classes should have templated by datatype\n-626 // so that downcast isn't needed there.\n-627 // (e.g. Osd::CpuBuffer )\n-628 //\n-629 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-630 dstBuffer->BindCpuBuffer(), dstDesc,\n-631 duBuffer->BindCpuBuffer(), duDesc,\n-632 dvBuffer->BindCpuBuffer(), dvDesc,\n-633 duuBuffer->BindCpuBuffer(), duuDesc,\n-634 duvBuffer->BindCpuBuffer(), duvDesc,\n-635 dvvBuffer->BindCpuBuffer(), dvvDesc,\n-636 numPatchCoords,\n-637 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-638 patchTable->GetPatchArrayBuffer(),\n-639 patchTable->GetPatchIndexBuffer(),\n-640 patchTable->GetPatchParamBuffer());\n-641 }\n-642\n-_\b6_\b7_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-671 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-672 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-673 int numPatchCoords,\n-674 const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *patchCoords,\n-675 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *patchArrays,\n-676 const int *patchIndexBuffer,\n-677 const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *patchParamBuffer);\n-678\n-_\b7_\b1_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-717 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-718 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-719 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-720 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-721 int numPatchCoords,\n-722 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n-723 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n-724 const int *patchIndexBuffer,\n-725 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParamBuffer);\n-726\n-_\b7_\b7_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-780 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-781 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-782 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-783 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-784 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-785 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-786 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-787 int numPatchCoords,\n-788 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n-789 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n-790 const int *patchIndexBuffer,\n-791 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParamBuffer);\n-792\n-821 template \n-_\b8_\b2_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-824 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-825 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-826 int numPatchCoords,\n-827 PATCHCOORD_BUFFER *patchCoords,\n-828 PATCH_TABLE *patchTable,\n-829 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-830 void * deviceContext = NULL) {\n-831\n-832 (void)instance; // unused\n-833 (void)deviceContext; // unused\n-834\n-835 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-836 dstBuffer->BindCpuBuffer(), dstDesc,\n-837 numPatchCoords,\n-838 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-839 patchTable->GetVaryingPatchArrayBuffer(),\n-840 patchTable->GetVaryingPatchIndexBuffer(),\n-841 patchTable->GetPatchParamBuffer());\n-842 }\n-843\n-884 template \n-_\b8_\b8_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-887 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-888 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-889 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-890 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-891 int numPatchCoords,\n-892 PATCHCOORD_BUFFER *patchCoords,\n-893 PATCH_TABLE *patchTable,\n-894 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-895 void * deviceContext = NULL) {\n-896\n-897 (void)instance; // unused\n-898 (void)deviceContext; // unused\n-899\n-900 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-901 dstBuffer->BindCpuBuffer(), dstDesc,\n-902 duBuffer->BindCpuBuffer(), duDesc,\n-903 dvBuffer->BindCpuBuffer(), dvDesc,\n-904 numPatchCoords,\n-905 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-906 patchTable->GetVaryingPatchArrayBuffer(),\n-907 patchTable->GetVaryingPatchIndexBuffer(),\n-908 patchTable->GetPatchParamBuffer());\n-909 }\n-910\n-969 template \n-_\b9_\b7_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-972 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-973 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-974 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-975 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-976 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-977 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-978 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-979 int numPatchCoords,\n-980 PATCHCOORD_BUFFER *patchCoords,\n-981 PATCH_TABLE *patchTable,\n-982 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-983 void * deviceContext = NULL) {\n-984\n-985 (void)instance; // unused\n-986 (void)deviceContext; // unused\n-987\n-988 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-989 dstBuffer->BindCpuBuffer(), dstDesc,\n-990 duBuffer->BindCpuBuffer(), duDesc,\n-991 dvBuffer->BindCpuBuffer(), dvDesc,\n-992 duuBuffer->BindCpuBuffer(), duuDesc,\n-993 duvBuffer->BindCpuBuffer(), duvDesc,\n-994 dvvBuffer->BindCpuBuffer(), dvvDesc,\n-995 numPatchCoords,\n-996 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-997 patchTable->GetVaryingPatchArrayBuffer(),\n-998 patchTable->GetVaryingPatchIndexBuffer(),\n-999 patchTable->GetPatchParamBuffer());\n-1000 }\n-1001\n-1032 template \n-_\b1_\b0_\b3_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1035 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1036 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1037 int numPatchCoords,\n-1038 PATCHCOORD_BUFFER *patchCoords,\n-1039 PATCH_TABLE *patchTable,\n-1040 int fvarChannel,\n-1041 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-1042 void * deviceContext = NULL) {\n-1043\n-1044 (void)instance; // unused\n-1045 (void)deviceContext; // unused\n-1046\n-1047 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-1048 dstBuffer->BindCpuBuffer(), dstDesc,\n-1049 numPatchCoords,\n-1050 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-1051 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-1052 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1053 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1054 }\n-1055\n-1098 template \n-_\b1_\b1_\b0_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1101 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1102 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1103 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1104 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1105 int numPatchCoords,\n-1106 PATCHCOORD_BUFFER *patchCoords,\n-1107 PATCH_TABLE *patchTable,\n-1108 int fvarChannel,\n-1109 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-1110 void * deviceContext = NULL) {\n-1111\n-1112 (void)instance; // unused\n-1113 (void)deviceContext; // unused\n-1114\n-1115 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-1116 dstBuffer->BindCpuBuffer(), dstDesc,\n-1117 duBuffer->BindCpuBuffer(), duDesc,\n-1118 dvBuffer->BindCpuBuffer(), dvDesc,\n-1119 numPatchCoords,\n-1120 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-1121 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-1122 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1123 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1124 }\n-1125\n-1186 template \n-_\b1_\b1_\b8_\b8 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1189 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1190 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1191 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1192 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1193 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1194 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1195 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1196 int numPatchCoords,\n-1197 PATCHCOORD_BUFFER *patchCoords,\n-1198 PATCH_TABLE *patchTable,\n-1199 int fvarChannel,\n-1200 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-1201 void * deviceContext = NULL) {\n-1202\n-1203 (void)instance; // unused\n-1204 (void)deviceContext; // unused\n-1205\n-1206 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-1207 dstBuffer->BindCpuBuffer(), dstDesc,\n-1208 duBuffer->BindCpuBuffer(), duDesc,\n-1209 dvBuffer->BindCpuBuffer(), dvDesc,\n-1210 duuBuffer->BindCpuBuffer(), duuDesc,\n-1211 duvBuffer->BindCpuBuffer(), duvDesc,\n-1212 dvvBuffer->BindCpuBuffer(), dvvDesc,\n-1213 numPatchCoords,\n-1214 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-1215 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-1216 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1217 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1218 }\n-1219\n-1225\n-_\b1_\b2_\b2_\b6 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(void *deviceContext = NULL);\n-1227\n-_\b1_\b2_\b2_\b8 static void _\bS_\be_\bt_\bN_\bu_\bm_\bT_\bh_\br_\be_\ba_\bd_\bs(int numThreads);\n-1229};\n-1230\n-1231\n-1232} // end namespace Osd\n-1233\n-1234} // end namespace OPENSUBDIV_VERSION\n-1235using namespace OPENSUBDIV_VERSION;\n-1236\n-1237} // end namespace OpenSubdiv\n-1238\n-1239\n-1240#endif // OPENSUBDIV3_OSD_OMP_EVALUATOR_H\n+85#endif // OPENSUBDIV3_OSD_OMP_KERNEL_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+void OmpEvalStencils(float const *src, BufferDescriptor const &srcDesc, float\n+*dst, BufferDescriptor const &dstDesc, int const *sizes, int const *offsets,\n+int const *indices, float const *weights, int start, int end)\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n BufferDescriptor is a struct which describes buffer elements in interleaved\n data buffers....\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n-fvarChannel, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int\n-*offsets, const int *indices, const float *weights, int start, int end)\n-Static eval stencils function which takes raw CPU pointers for input and\n-output.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const\n-*instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const\n-OmpEvaluator *instance=NULL, void *deviceContext=NULL)\n-Generic static eval stencils function with derivatives. This function has a\n-same signature as other d...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int\n-*offsets, const int *indices, const float *weights, const float *duWeights,\n-const float *dvWeights, int start, int end)\n-Static eval stencils function with derivatives, which takes raw CPU pointers\n-for input and output.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n-OmpEvaluator const *instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, OmpEvaluator const\n-*instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n-BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n-float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int\n-*offsets, const int *indices, const float *weights, const float *duWeights,\n-const float *dvWeights, const float *duuWeights, const float *duvWeights, const\n-float *dvvWeights, int start, int end)\n-Static eval stencils function with derivatives, which takes raw CPU pointers\n-for input and output.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n-const *stencilTable, const OmpEvaluator *instance=NULL, void\n-*deviceContext=NULL)\n-Generic static eval stencils function. This function has a same signature as\n-other device kernels hav...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n-BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n-float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord\n-const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer,\n-PatchParam const *patchParamBuffer)\n-Static limit eval function. It takes an array of PatchCoord and evaluate limit\n-values on given PatchT...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void\n-*deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void\n-*deviceContext=NULL)\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b0_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(void *deviceContext=NULL)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n-const OmpEvaluator *instance=NULL, void *deviceContext=NULL)\n-Generic static eval stencils function with derivatives. This function has a\n-same signature as other d...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const\n-*instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords,\n-PatchCoord const *patchCoords, PatchArray const *patchArrays, const int\n-*patchIndexBuffer, PatchParam const *patchParamBuffer)\n-Static limit eval function. It takes an array of PatchCoord and evaluate limit\n-values on given PatchT...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bN_\bu_\bm_\bT_\bh_\br_\be_\ba_\bd_\bs\n-static void SetNumThreads(int numThreads)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const\n-PatchCoord *patchCoords, const PatchArray *patchArrays, const int\n-*patchIndexBuffer, const PatchParam *patchParamBuffer)\n-Static limit eval function. It takes an array of PatchCoord and evaluate limit\n-values on given PatchT...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n-OmpEvaluator const *instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd\n-Coordinates set on a patch table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b2_\b7\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bo_\bm_\bp_\bK_\be_\br_\bn_\be_\bl_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00881.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00881.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/ompKernel.h File Reference\n+OpenSubdiv: opensubdiv/osd/ompEvaluator.h File Reference\n \n \n \n \n \n \n \n@@ -88,45 +88,44 @@\n \n \n \n \n \n
\n \n-
ompKernel.h File Reference
\n+Classes |\n+Namespaces
\n+
ompEvaluator.h File Reference
\n \n
\n
#include "../version.h"
\n+#include "../osd/bufferDescriptor.h"
\n+#include "../osd/types.h"
\n+#include <cstddef>
\n
\n

Go to the source code of this file.

\n \n+\n+\n+\n+

\n+Classes

class  OmpEvaluator
 
\n \n \n \n \n \n \n \n-

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n-\n-\n-\n-\n-\n-\n-\n

\n-Functions

void OmpEvalStencils (float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, int start, int end)
 
void OmpEvalStencils (float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *dstDu, BufferDescriptor const &dstDuDesc, float *dstDv, BufferDescriptor const &dstDvDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, float const *duWeights, float const *dvWeights, int start, int end)
 
void OmpEvalStencils (float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *dstDu, BufferDescriptor const &dstDuDesc, float *dstDv, BufferDescriptor const &dstDvDesc, float *dstDuu, BufferDescriptor const &dstDuuDesc, float *dstDuv, BufferDescriptor const &dstDuvDesc, float *dstDvv, BufferDescriptor const &dstDvvDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, float const *duWeights, float const *dvWeights, float const *duuWeights, float const *duvWeights, float const *dvvWeights, int start, int end)
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,41 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-ompKernel.h File Reference\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+ompEvaluator.h File Reference\n #include \"../version.h\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+class \u00a0 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n-F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-void\u00a0 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs (float const *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc, float\n- *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc, int const *sizes, int const\n- *offsets, int const *indices, float const *weights, int start, int end)\n-\u00a0\n-void\u00a0 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs (float const *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc, float\n- *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc, float *dstDu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n- const &dstDuDesc, float *dstDv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvDesc, int\n- const *sizes, int const *offsets, int const *indices, float const\n- *weights, float const *duWeights, float const *dvWeights, int start, int\n- end)\n-\u00a0\n-void\u00a0 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs (float const *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc, float\n- *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc, float *dstDu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n- const &dstDuDesc, float *dstDv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvDesc, float\n- *dstDuu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuuDesc, float *dstDuv,\n- _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuvDesc, float *dstDvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const\n- &dstDvvDesc, int const *sizes, int const *offsets, int const *indices,\n- float const *weights, float const *duWeights, float const *dvWeights,\n- float const *duuWeights, float const *duvWeights, float const\n- *dvvWeights, int start, int end)\n-\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bo_\bm_\bp_\bK_\be_\br_\bn_\be_\bl_\b._\bh\n+ * _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00881.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00881.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,5 +1,3 @@\n var a00881 = [\n- [\"OmpEvalStencils\", \"a00881.html#a44a05502feb5015035bc81b93cffb99c\", null],\n- [\"OmpEvalStencils\", \"a00881.html#a907dc53421460557871ddc35f77751f5\", null],\n- [\"OmpEvalStencils\", \"a00881.html#a870745ff3e883b32547d4db42b3be2bd\", null]\n+ [\"OmpEvaluator\", \"a01305.html\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00881_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00881_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/ompKernel.h Source File\n+OpenSubdiv: opensubdiv/osd/ompEvaluator.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
ompKernel.h
\n+
ompEvaluator.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,82 +119,528 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_OMP_KERNEL_H
\n-
26#define OPENSUBDIV3_OSD_OMP_KERNEL_H
\n+
25#ifndef OPENSUBDIV3_OSD_OMP_EVALUATOR_H
\n+
26#define OPENSUBDIV3_OSD_OMP_EVALUATOR_H
\n
27
\n
28#include "../version.h"
\n-
29
\n-
30namespace OpenSubdiv {
\n-
31namespace OPENSUBDIV_VERSION {
\n-
32
\n-
33namespace Osd {
\n-
34
\n-
35struct BufferDescriptor;
\n+
29#include "../osd/bufferDescriptor.h"
\n+
30#include "../osd/types.h"
\n+
31
\n+
32#include <cstddef>
\n+
33
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n
36
\n-
37void
\n-
38OmpEvalStencils(float const * src, BufferDescriptor const &srcDesc,
\n-
39 float * dst, BufferDescriptor const &dstDesc,
\n-
40 int const * sizes,
\n-
41 int const * offsets,
\n-
42 int const * indices,
\n-
43 float const * weights,
\n-
44 int start, int end);
\n-
45
\n-
46void
\n-
47OmpEvalStencils(float const * src, BufferDescriptor const &srcDesc,
\n-
48 float * dst, BufferDescriptor const &dstDesc,
\n-
49 float * dstDu, BufferDescriptor const &dstDuDesc,
\n-
50 float * dstDv, BufferDescriptor const &dstDvDesc,
\n-
51 int const * sizes,
\n-
52 int const * offsets,
\n-
53 int const * indices,
\n-
54 float const * weights,
\n-
55 float const * duWeights,
\n-
56 float const * dvWeights,
\n-
57 int start, int end);
\n-
58
\n-
59void
\n-
60OmpEvalStencils(float const * src, BufferDescriptor const &srcDesc,
\n-
61 float * dst, BufferDescriptor const &dstDesc,
\n-
62 float * dstDu, BufferDescriptor const &dstDuDesc,
\n-
63 float * dstDv, BufferDescriptor const &dstDvDesc,
\n-
64 float * dstDuu, BufferDescriptor const &dstDuuDesc,
\n-
65 float * dstDuv, BufferDescriptor const &dstDuvDesc,
\n-
66 float * dstDvv, BufferDescriptor const &dstDvvDesc,
\n-
67 int const * sizes,
\n-
68 int const * offsets,
\n-
69 int const * indices,
\n-
70 float const * weights,
\n-
71 float const * duWeights,
\n-
72 float const * dvWeights,
\n-
73 float const * duuWeights,
\n-
74 float const * duvWeights,
\n-
75 float const * dvvWeights,
\n-
76 int start, int end);
\n-
77
\n-
78} // end namespace Osd
\n-
79
\n-
80} // end namespace OPENSUBDIV_VERSION
\n-
81using namespace OPENSUBDIV_VERSION;
\n-
82
\n-
83} // end namespace OpenSubdiv
\n+
37namespace Osd {
\n+
38
\n+
\n+\n+
40public:
\n+
46
\n+
71 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
72 static bool EvalStencils(
\n+
73 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
74 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
75 STENCIL_TABLE const *stencilTable,
\n+
76 const OmpEvaluator *instance = NULL,
\n+
77 void * deviceContext = NULL) {
\n+
78
\n+
79 (void)instance; // unused
\n+
80 (void)deviceContext; // unused
\n+
81
\n+
82 if (stencilTable->GetNumStencils() == 0)
\n+
83 return false;
\n
84
\n-
85#endif // OPENSUBDIV3_OSD_OMP_KERNEL_H
\n+
85 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
86 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
87 &stencilTable->GetSizes()[0],
\n+
88 &stencilTable->GetOffsets()[0],
\n+
89 &stencilTable->GetControlIndices()[0],
\n+
90 &stencilTable->GetWeights()[0],
\n+
91 /*start = */ 0,
\n+
92 /*end = */ stencilTable->GetNumStencils());
\n+
93 }
\n+
\n+
94
\n+
121 static bool EvalStencils(
\n+
122 const float *src, BufferDescriptor const &srcDesc,
\n+
123 float *dst, BufferDescriptor const &dstDesc,
\n+
124 const int * sizes,
\n+
125 const int * offsets,
\n+
126 const int * indices,
\n+
127 const float * weights,
\n+
128 int start, int end);
\n+
129
\n+
167 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
168 static bool EvalStencils(
\n+
169 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
170 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
171 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
172 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
173 STENCIL_TABLE const *stencilTable,
\n+
174 const OmpEvaluator *instance = NULL,
\n+
175 void * deviceContext = NULL) {
\n+
176
\n+
177 (void)instance; // unused
\n+
178 (void)deviceContext; // unused
\n+
179
\n+
180 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
181 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
182 duBuffer->BindCpuBuffer(), duDesc,
\n+
183 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
184 &stencilTable->GetSizes()[0],
\n+
185 &stencilTable->GetOffsets()[0],
\n+
186 &stencilTable->GetControlIndices()[0],
\n+
187 &stencilTable->GetWeights()[0],
\n+
188 &stencilTable->GetDuWeights()[0],
\n+
189 &stencilTable->GetDvWeights()[0],
\n+
190 /*start = */ 0,
\n+
191 /*end = */ stencilTable->GetNumStencils());
\n+
192 }
\n+
\n+
193
\n+
234 static bool EvalStencils(
\n+
235 const float *src, BufferDescriptor const &srcDesc,
\n+
236 float *dst, BufferDescriptor const &dstDesc,
\n+
237 float *du, BufferDescriptor const &duDesc,
\n+
238 float *dv, BufferDescriptor const &dvDesc,
\n+
239 const int * sizes,
\n+
240 const int * offsets,
\n+
241 const int * indices,
\n+
242 const float * weights,
\n+
243 const float * duWeights,
\n+
244 const float * dvWeights,
\n+
245 int start, int end);
\n+
246
\n+
302 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
303 static bool EvalStencils(
\n+
304 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
305 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
306 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
307 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
308 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
309 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
310 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
311 STENCIL_TABLE const *stencilTable,
\n+
312 const OmpEvaluator *instance = NULL,
\n+
313 void * deviceContext = NULL) {
\n+
314
\n+
315 (void)instance; // unused
\n+
316 (void)deviceContext; // unused
\n+
317
\n+
318 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
319 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
320 duBuffer->BindCpuBuffer(), duDesc,
\n+
321 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
322 duuBuffer->BindCpuBuffer(), duuDesc,
\n+
323 duvBuffer->BindCpuBuffer(), duvDesc,
\n+
324 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n+
325 &stencilTable->GetSizes()[0],
\n+
326 &stencilTable->GetOffsets()[0],
\n+
327 &stencilTable->GetControlIndices()[0],
\n+
328 &stencilTable->GetWeights()[0],
\n+
329 &stencilTable->GetDuWeights()[0],
\n+
330 &stencilTable->GetDvWeights()[0],
\n+
331 &stencilTable->GetDuuWeights()[0],
\n+
332 &stencilTable->GetDuvWeights()[0],
\n+
333 &stencilTable->GetDvvWeights()[0],
\n+
334 /*start = */ 0,
\n+
335 /*end = */ stencilTable->GetNumStencils());
\n+
336 }
\n+
\n+
337
\n+
399 static bool EvalStencils(
\n+
400 const float *src, BufferDescriptor const &srcDesc,
\n+
401 float *dst, BufferDescriptor const &dstDesc,
\n+
402 float *du, BufferDescriptor const &duDesc,
\n+
403 float *dv, BufferDescriptor const &dvDesc,
\n+
404 float *duu, BufferDescriptor const &duuDesc,
\n+
405 float *duv, BufferDescriptor const &duvDesc,
\n+
406 float *dvv, BufferDescriptor const &dvvDesc,
\n+
407 const int * sizes,
\n+
408 const int * offsets,
\n+
409 const int * indices,
\n+
410 const float * weights,
\n+
411 const float * duWeights,
\n+
412 const float * dvWeights,
\n+
413 const float * duuWeights,
\n+
414 const float * duvWeights,
\n+
415 const float * dvvWeights,
\n+
416 int start, int end);
\n+
417
\n+
423
\n+
452 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
453 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
454 static bool EvalPatches(
\n+
455 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
456 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
457 int numPatchCoords,
\n+
458 PATCHCOORD_BUFFER *patchCoords,
\n+
459 PATCH_TABLE *patchTable,
\n+
460 OmpEvaluator const *instance = NULL,
\n+
461 void * deviceContext = NULL) {
\n+
462
\n+
463 (void)instance; // unused
\n+
464 (void)deviceContext; // unused
\n+
465
\n+
466 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
467 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
468 numPatchCoords,
\n+
469 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
470 patchTable->GetPatchArrayBuffer(),
\n+
471 patchTable->GetPatchIndexBuffer(),
\n+
472 patchTable->GetPatchParamBuffer());
\n+
473 }
\n+
\n+
474
\n+
515 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
516 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
517 static bool EvalPatches(
\n+
518 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
519 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
520 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
521 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
522 int numPatchCoords,
\n+
523 PATCHCOORD_BUFFER *patchCoords,
\n+
524 PATCH_TABLE *patchTable,
\n+
525 OmpEvaluator const *instance = NULL,
\n+
526 void * deviceContext = NULL) {
\n+
527
\n+
528 (void)instance; // unused
\n+
529 (void)deviceContext; // unused
\n+
530
\n+
531 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.
\n+
532 // ideally all buffer classes should have templated by datatype
\n+
533 // so that downcast isn't needed there.
\n+
534 // (e.g. Osd::CpuBuffer<PatchCoord> )
\n+
535 //
\n+
536 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
537 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
538 duBuffer->BindCpuBuffer(), duDesc,
\n+
539 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
540 numPatchCoords,
\n+
541 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
542 patchTable->GetPatchArrayBuffer(),
\n+
543 patchTable->GetPatchIndexBuffer(),
\n+
544 patchTable->GetPatchParamBuffer());
\n+
545 }
\n+
\n+
546
\n+
605 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
606 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
607 static bool EvalPatches(
\n+
608 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
609 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
610 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
611 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
612 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
613 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
614 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
615 int numPatchCoords,
\n+
616 PATCHCOORD_BUFFER *patchCoords,
\n+
617 PATCH_TABLE *patchTable,
\n+
618 OmpEvaluator const *instance = NULL,
\n+
619 void * deviceContext = NULL) {
\n+
620
\n+
621 (void)instance; // unused
\n+
622 (void)deviceContext; // unused
\n+
623
\n+
624 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.
\n+
625 // ideally all buffer classes should have templated by datatype
\n+
626 // so that downcast isn't needed there.
\n+
627 // (e.g. Osd::CpuBuffer<PatchCoord> )
\n+
628 //
\n+
629 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
630 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
631 duBuffer->BindCpuBuffer(), duDesc,
\n+
632 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
633 duuBuffer->BindCpuBuffer(), duuDesc,
\n+
634 duvBuffer->BindCpuBuffer(), duvDesc,
\n+
635 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n+
636 numPatchCoords,
\n+
637 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
638 patchTable->GetPatchArrayBuffer(),
\n+
639 patchTable->GetPatchIndexBuffer(),
\n+
640 patchTable->GetPatchParamBuffer());
\n+
641 }
\n+
\n+
642
\n+
670 static bool EvalPatches(
\n+
671 const float *src, BufferDescriptor const &srcDesc,
\n+
672 float *dst, BufferDescriptor const &dstDesc,
\n+
673 int numPatchCoords,
\n+
674 const PatchCoord *patchCoords,
\n+
675 const PatchArray *patchArrays,
\n+
676 const int *patchIndexBuffer,
\n+
677 const PatchParam *patchParamBuffer);
\n+
678
\n+
716 static bool EvalPatches(
\n+
717 const float *src, BufferDescriptor const &srcDesc,
\n+
718 float *dst, BufferDescriptor const &dstDesc,
\n+
719 float *du, BufferDescriptor const &duDesc,
\n+
720 float *dv, BufferDescriptor const &dvDesc,
\n+
721 int numPatchCoords,
\n+
722 PatchCoord const *patchCoords,
\n+
723 PatchArray const *patchArrays,
\n+
724 const int *patchIndexBuffer,
\n+
725 PatchParam const *patchParamBuffer);
\n+
726
\n+
779 static bool EvalPatches(
\n+
780 const float *src, BufferDescriptor const &srcDesc,
\n+
781 float *dst, BufferDescriptor const &dstDesc,
\n+
782 float *du, BufferDescriptor const &duDesc,
\n+
783 float *dv, BufferDescriptor const &dvDesc,
\n+
784 float *duu, BufferDescriptor const &duuDesc,
\n+
785 float *duv, BufferDescriptor const &duvDesc,
\n+
786 float *dvv, BufferDescriptor const &dvvDesc,
\n+
787 int numPatchCoords,
\n+
788 PatchCoord const *patchCoords,
\n+
789 PatchArray const *patchArrays,
\n+
790 const int *patchIndexBuffer,
\n+
791 PatchParam const *patchParamBuffer);
\n+
792
\n+
821 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
822 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
824 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
825 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
826 int numPatchCoords,
\n+
827 PATCHCOORD_BUFFER *patchCoords,
\n+
828 PATCH_TABLE *patchTable,
\n+
829 OmpEvaluator const *instance = NULL,
\n+
830 void * deviceContext = NULL) {
\n+
831
\n+
832 (void)instance; // unused
\n+
833 (void)deviceContext; // unused
\n+
834
\n+
835 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
836 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
837 numPatchCoords,
\n+
838 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
839 patchTable->GetVaryingPatchArrayBuffer(),
\n+
840 patchTable->GetVaryingPatchIndexBuffer(),
\n+
841 patchTable->GetPatchParamBuffer());
\n+
842 }
\n+
\n+
843
\n+
884 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
885 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
887 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
888 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
889 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
890 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
891 int numPatchCoords,
\n+
892 PATCHCOORD_BUFFER *patchCoords,
\n+
893 PATCH_TABLE *patchTable,
\n+
894 OmpEvaluator const *instance = NULL,
\n+
895 void * deviceContext = NULL) {
\n+
896
\n+
897 (void)instance; // unused
\n+
898 (void)deviceContext; // unused
\n+
899
\n+
900 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
901 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
902 duBuffer->BindCpuBuffer(), duDesc,
\n+
903 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
904 numPatchCoords,
\n+
905 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
906 patchTable->GetVaryingPatchArrayBuffer(),
\n+
907 patchTable->GetVaryingPatchIndexBuffer(),
\n+
908 patchTable->GetPatchParamBuffer());
\n+
909 }
\n+
\n+
910
\n+
969 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
970 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
972 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
973 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
974 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
975 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
976 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
977 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
978 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
979 int numPatchCoords,
\n+
980 PATCHCOORD_BUFFER *patchCoords,
\n+
981 PATCH_TABLE *patchTable,
\n+
982 OmpEvaluator const *instance = NULL,
\n+
983 void * deviceContext = NULL) {
\n+
984
\n+
985 (void)instance; // unused
\n+
986 (void)deviceContext; // unused
\n+
987
\n+
988 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
989 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
990 duBuffer->BindCpuBuffer(), duDesc,
\n+
991 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
992 duuBuffer->BindCpuBuffer(), duuDesc,
\n+
993 duvBuffer->BindCpuBuffer(), duvDesc,
\n+
994 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n+
995 numPatchCoords,
\n+
996 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
997 patchTable->GetVaryingPatchArrayBuffer(),
\n+
998 patchTable->GetVaryingPatchIndexBuffer(),
\n+
999 patchTable->GetPatchParamBuffer());
\n+
1000 }
\n+
\n+
1001
\n+
1032 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1033 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1035 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1036 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1037 int numPatchCoords,
\n+
1038 PATCHCOORD_BUFFER *patchCoords,
\n+
1039 PATCH_TABLE *patchTable,
\n+
1040 int fvarChannel,
\n+
1041 OmpEvaluator const *instance = NULL,
\n+
1042 void * deviceContext = NULL) {
\n+
1043
\n+
1044 (void)instance; // unused
\n+
1045 (void)deviceContext; // unused
\n+
1046
\n+
1047 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
1048 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
1049 numPatchCoords,
\n+
1050 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
1051 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
1052 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1053 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1054 }
\n+
\n+
1055
\n+
1098 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1099 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1101 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1102 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1103 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1104 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1105 int numPatchCoords,
\n+
1106 PATCHCOORD_BUFFER *patchCoords,
\n+
1107 PATCH_TABLE *patchTable,
\n+
1108 int fvarChannel,
\n+
1109 OmpEvaluator const *instance = NULL,
\n+
1110 void * deviceContext = NULL) {
\n+
1111
\n+
1112 (void)instance; // unused
\n+
1113 (void)deviceContext; // unused
\n+
1114
\n+
1115 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
1116 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
1117 duBuffer->BindCpuBuffer(), duDesc,
\n+
1118 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
1119 numPatchCoords,
\n+
1120 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
1121 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
1122 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1123 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1124 }
\n+
\n+
1125
\n+
1186 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1187 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1189 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1190 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1191 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1192 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1193 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1194 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1195 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1196 int numPatchCoords,
\n+
1197 PATCHCOORD_BUFFER *patchCoords,
\n+
1198 PATCH_TABLE *patchTable,
\n+
1199 int fvarChannel,
\n+
1200 OmpEvaluator const *instance = NULL,
\n+
1201 void * deviceContext = NULL) {
\n+
1202
\n+
1203 (void)instance; // unused
\n+
1204 (void)deviceContext; // unused
\n+
1205
\n+
1206 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
1207 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
1208 duBuffer->BindCpuBuffer(), duDesc,
\n+
1209 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
1210 duuBuffer->BindCpuBuffer(), duuDesc,
\n+
1211 duvBuffer->BindCpuBuffer(), duvDesc,
\n+
1212 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n+
1213 numPatchCoords,
\n+
1214 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
1215 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
1216 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1217 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1218 }
\n+
\n+
1219
\n+
1225
\n+
1226 static void Synchronize(void *deviceContext = NULL);
\n+
1227
\n+
1228 static void SetNumThreads(int numThreads);
\n+
1229};
\n+
\n+
1230
\n+
1231
\n+
1232} // end namespace Osd
\n+
1233
\n+
1234} // end namespace OPENSUBDIV_VERSION
\n+
1235using namespace OPENSUBDIV_VERSION;
\n+
1236
\n+
1237} // end namespace OpenSubdiv
\n+
1238
\n+
1239
\n+
1240#endif // OPENSUBDIV3_OSD_OMP_EVALUATOR_H
\n \n-
void OmpEvalStencils(float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, int start, int end)
\n
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, int start, int end)
Static eval stencils function which takes raw CPU pointers for input and output.
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const OmpEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n+
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw CPU pointers for input and output.
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, const float *duuWeights, const float *duvWeights, const float *dvvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw CPU pointers for input and output.
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, const OmpEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function. This function has a same signature as other device kernels hav...
\n+
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer, PatchParam const *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
static void Synchronize(void *deviceContext=NULL)
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, const OmpEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer, PatchParam const *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n+\n+
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const PatchCoord *patchCoords, const PatchArray *patchArrays, const int *patchIndexBuffer, const PatchParam *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
Coordinates set on a patch table.
Definition types.h:42
\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-ompKernel.h\n+ompEvaluator.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,82 +24,655 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_OMP_KERNEL_H\n-26#define OPENSUBDIV3_OSD_OMP_KERNEL_H\n+25#ifndef OPENSUBDIV3_OSD_OMP_EVALUATOR_H\n+26#define OPENSUBDIV3_OSD_OMP_EVALUATOR_H\n 27\n 28#include \"../version.h\"\n-29\n-30namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-31namespace OPENSUBDIV_VERSION {\n-32\n-33namespace Osd {\n-34\n-35struct BufferDescriptor;\n+29#include \"../osd/bufferDescriptor.h\"\n+30#include \"../osd/types.h\"\n+31\n+32#include \n+33\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n 36\n-37void\n-_\b3_\b8_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(float const * src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-39 float * dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-40 int const * sizes,\n-41 int const * offsets,\n-42 int const * indices,\n-43 float const * weights,\n-44 int start, int end);\n-45\n-46void\n-_\b4_\b7_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(float const * src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-48 float * dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-49 float * dstDu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuDesc,\n-50 float * dstDv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvDesc,\n-51 int const * sizes,\n-52 int const * offsets,\n-53 int const * indices,\n-54 float const * weights,\n-55 float const * duWeights,\n-56 float const * dvWeights,\n-57 int start, int end);\n-58\n-59void\n-_\b6_\b0_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(float const * src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-61 float * dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-62 float * dstDu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuDesc,\n-63 float * dstDv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvDesc,\n-64 float * dstDuu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuuDesc,\n-65 float * dstDuv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDuvDesc,\n-66 float * dstDvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDvvDesc,\n-67 int const * sizes,\n-68 int const * offsets,\n-69 int const * indices,\n-70 float const * weights,\n-71 float const * duWeights,\n-72 float const * dvWeights,\n-73 float const * duuWeights,\n-74 float const * duvWeights,\n-75 float const * dvvWeights,\n-76 int start, int end);\n-77\n-78} // end namespace Osd\n-79\n-80} // end namespace OPENSUBDIV_VERSION\n-81using namespace OPENSUBDIV_VERSION;\n-82\n-83} // end namespace OpenSubdiv\n+37namespace Osd {\n+38\n+_\b3_\b9class _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n+40public:\n+46\n+71 template \n+_\b7_\b2 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+73 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+74 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+75 STENCIL_TABLE const *stencilTable,\n+76 const _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n+77 void * deviceContext = NULL) {\n+78\n+79 (void)instance; // unused\n+80 (void)deviceContext; // unused\n+81\n+82 if (stencilTable->GetNumStencils() == 0)\n+83 return false;\n 84\n-85#endif // OPENSUBDIV3_OSD_OMP_KERNEL_H\n+85 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+86 dstBuffer->BindCpuBuffer(), dstDesc,\n+87 &stencilTable->GetSizes()[0],\n+88 &stencilTable->GetOffsets()[0],\n+89 &stencilTable->GetControlIndices()[0],\n+90 &stencilTable->GetWeights()[0],\n+91 /*start = */ 0,\n+92 /*end = */ stencilTable->GetNumStencils());\n+93 }\n+94\n+_\b1_\b2_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+122 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+123 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+124 const int * sizes,\n+125 const int * offsets,\n+126 const int * indices,\n+127 const float * weights,\n+128 int start, int end);\n+129\n+167 template \n+_\b1_\b6_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+169 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+170 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+171 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+172 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+173 STENCIL_TABLE const *stencilTable,\n+174 const _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n+175 void * deviceContext = NULL) {\n+176\n+177 (void)instance; // unused\n+178 (void)deviceContext; // unused\n+179\n+180 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+181 dstBuffer->BindCpuBuffer(), dstDesc,\n+182 duBuffer->BindCpuBuffer(), duDesc,\n+183 dvBuffer->BindCpuBuffer(), dvDesc,\n+184 &stencilTable->GetSizes()[0],\n+185 &stencilTable->GetOffsets()[0],\n+186 &stencilTable->GetControlIndices()[0],\n+187 &stencilTable->GetWeights()[0],\n+188 &stencilTable->GetDuWeights()[0],\n+189 &stencilTable->GetDvWeights()[0],\n+190 /*start = */ 0,\n+191 /*end = */ stencilTable->GetNumStencils());\n+192 }\n+193\n+_\b2_\b3_\b4 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+235 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+236 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+237 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+238 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+239 const int * sizes,\n+240 const int * offsets,\n+241 const int * indices,\n+242 const float * weights,\n+243 const float * duWeights,\n+244 const float * dvWeights,\n+245 int start, int end);\n+246\n+302 template \n+_\b3_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+304 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+305 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+306 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+307 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+308 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+309 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+310 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+311 STENCIL_TABLE const *stencilTable,\n+312 const _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n+313 void * deviceContext = NULL) {\n+314\n+315 (void)instance; // unused\n+316 (void)deviceContext; // unused\n+317\n+318 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+319 dstBuffer->BindCpuBuffer(), dstDesc,\n+320 duBuffer->BindCpuBuffer(), duDesc,\n+321 dvBuffer->BindCpuBuffer(), dvDesc,\n+322 duuBuffer->BindCpuBuffer(), duuDesc,\n+323 duvBuffer->BindCpuBuffer(), duvDesc,\n+324 dvvBuffer->BindCpuBuffer(), dvvDesc,\n+325 &stencilTable->GetSizes()[0],\n+326 &stencilTable->GetOffsets()[0],\n+327 &stencilTable->GetControlIndices()[0],\n+328 &stencilTable->GetWeights()[0],\n+329 &stencilTable->GetDuWeights()[0],\n+330 &stencilTable->GetDvWeights()[0],\n+331 &stencilTable->GetDuuWeights()[0],\n+332 &stencilTable->GetDuvWeights()[0],\n+333 &stencilTable->GetDvvWeights()[0],\n+334 /*start = */ 0,\n+335 /*end = */ stencilTable->GetNumStencils());\n+336 }\n+337\n+_\b3_\b9_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+400 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+401 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+402 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+403 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+404 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+405 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+406 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+407 const int * sizes,\n+408 const int * offsets,\n+409 const int * indices,\n+410 const float * weights,\n+411 const float * duWeights,\n+412 const float * dvWeights,\n+413 const float * duuWeights,\n+414 const float * duvWeights,\n+415 const float * dvvWeights,\n+416 int start, int end);\n+417\n+423\n+452 template \n+_\b4_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+455 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+456 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+457 int numPatchCoords,\n+458 PATCHCOORD_BUFFER *patchCoords,\n+459 PATCH_TABLE *patchTable,\n+460 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+461 void * deviceContext = NULL) {\n+462\n+463 (void)instance; // unused\n+464 (void)deviceContext; // unused\n+465\n+466 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+467 dstBuffer->BindCpuBuffer(), dstDesc,\n+468 numPatchCoords,\n+469 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+470 patchTable->GetPatchArrayBuffer(),\n+471 patchTable->GetPatchIndexBuffer(),\n+472 patchTable->GetPatchParamBuffer());\n+473 }\n+474\n+515 template \n+_\b5_\b1_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+518 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+519 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+520 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+521 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+522 int numPatchCoords,\n+523 PATCHCOORD_BUFFER *patchCoords,\n+524 PATCH_TABLE *patchTable,\n+525 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+526 void * deviceContext = NULL) {\n+527\n+528 (void)instance; // unused\n+529 (void)deviceContext; // unused\n+530\n+531 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.\n+532 // ideally all buffer classes should have templated by datatype\n+533 // so that downcast isn't needed there.\n+534 // (e.g. Osd::CpuBuffer )\n+535 //\n+536 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+537 dstBuffer->BindCpuBuffer(), dstDesc,\n+538 duBuffer->BindCpuBuffer(), duDesc,\n+539 dvBuffer->BindCpuBuffer(), dvDesc,\n+540 numPatchCoords,\n+541 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+542 patchTable->GetPatchArrayBuffer(),\n+543 patchTable->GetPatchIndexBuffer(),\n+544 patchTable->GetPatchParamBuffer());\n+545 }\n+546\n+605 template \n+_\b6_\b0_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+608 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+609 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+610 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+611 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+612 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+613 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+614 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+615 int numPatchCoords,\n+616 PATCHCOORD_BUFFER *patchCoords,\n+617 PATCH_TABLE *patchTable,\n+618 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+619 void * deviceContext = NULL) {\n+620\n+621 (void)instance; // unused\n+622 (void)deviceContext; // unused\n+623\n+624 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.\n+625 // ideally all buffer classes should have templated by datatype\n+626 // so that downcast isn't needed there.\n+627 // (e.g. Osd::CpuBuffer )\n+628 //\n+629 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+630 dstBuffer->BindCpuBuffer(), dstDesc,\n+631 duBuffer->BindCpuBuffer(), duDesc,\n+632 dvBuffer->BindCpuBuffer(), dvDesc,\n+633 duuBuffer->BindCpuBuffer(), duuDesc,\n+634 duvBuffer->BindCpuBuffer(), duvDesc,\n+635 dvvBuffer->BindCpuBuffer(), dvvDesc,\n+636 numPatchCoords,\n+637 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+638 patchTable->GetPatchArrayBuffer(),\n+639 patchTable->GetPatchIndexBuffer(),\n+640 patchTable->GetPatchParamBuffer());\n+641 }\n+642\n+_\b6_\b7_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+671 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+672 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+673 int numPatchCoords,\n+674 const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *patchCoords,\n+675 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *patchArrays,\n+676 const int *patchIndexBuffer,\n+677 const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *patchParamBuffer);\n+678\n+_\b7_\b1_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+717 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+718 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+719 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+720 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+721 int numPatchCoords,\n+722 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n+723 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n+724 const int *patchIndexBuffer,\n+725 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParamBuffer);\n+726\n+_\b7_\b7_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+780 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+781 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+782 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+783 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+784 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+785 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+786 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+787 int numPatchCoords,\n+788 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n+789 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n+790 const int *patchIndexBuffer,\n+791 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParamBuffer);\n+792\n+821 template \n+_\b8_\b2_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+824 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+825 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+826 int numPatchCoords,\n+827 PATCHCOORD_BUFFER *patchCoords,\n+828 PATCH_TABLE *patchTable,\n+829 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+830 void * deviceContext = NULL) {\n+831\n+832 (void)instance; // unused\n+833 (void)deviceContext; // unused\n+834\n+835 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+836 dstBuffer->BindCpuBuffer(), dstDesc,\n+837 numPatchCoords,\n+838 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+839 patchTable->GetVaryingPatchArrayBuffer(),\n+840 patchTable->GetVaryingPatchIndexBuffer(),\n+841 patchTable->GetPatchParamBuffer());\n+842 }\n+843\n+884 template \n+_\b8_\b8_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+887 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+888 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+889 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+890 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+891 int numPatchCoords,\n+892 PATCHCOORD_BUFFER *patchCoords,\n+893 PATCH_TABLE *patchTable,\n+894 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+895 void * deviceContext = NULL) {\n+896\n+897 (void)instance; // unused\n+898 (void)deviceContext; // unused\n+899\n+900 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+901 dstBuffer->BindCpuBuffer(), dstDesc,\n+902 duBuffer->BindCpuBuffer(), duDesc,\n+903 dvBuffer->BindCpuBuffer(), dvDesc,\n+904 numPatchCoords,\n+905 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+906 patchTable->GetVaryingPatchArrayBuffer(),\n+907 patchTable->GetVaryingPatchIndexBuffer(),\n+908 patchTable->GetPatchParamBuffer());\n+909 }\n+910\n+969 template \n+_\b9_\b7_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+972 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+973 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+974 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+975 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+976 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+977 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+978 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+979 int numPatchCoords,\n+980 PATCHCOORD_BUFFER *patchCoords,\n+981 PATCH_TABLE *patchTable,\n+982 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+983 void * deviceContext = NULL) {\n+984\n+985 (void)instance; // unused\n+986 (void)deviceContext; // unused\n+987\n+988 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+989 dstBuffer->BindCpuBuffer(), dstDesc,\n+990 duBuffer->BindCpuBuffer(), duDesc,\n+991 dvBuffer->BindCpuBuffer(), dvDesc,\n+992 duuBuffer->BindCpuBuffer(), duuDesc,\n+993 duvBuffer->BindCpuBuffer(), duvDesc,\n+994 dvvBuffer->BindCpuBuffer(), dvvDesc,\n+995 numPatchCoords,\n+996 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+997 patchTable->GetVaryingPatchArrayBuffer(),\n+998 patchTable->GetVaryingPatchIndexBuffer(),\n+999 patchTable->GetPatchParamBuffer());\n+1000 }\n+1001\n+1032 template \n+_\b1_\b0_\b3_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1035 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1036 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1037 int numPatchCoords,\n+1038 PATCHCOORD_BUFFER *patchCoords,\n+1039 PATCH_TABLE *patchTable,\n+1040 int fvarChannel,\n+1041 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+1042 void * deviceContext = NULL) {\n+1043\n+1044 (void)instance; // unused\n+1045 (void)deviceContext; // unused\n+1046\n+1047 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+1048 dstBuffer->BindCpuBuffer(), dstDesc,\n+1049 numPatchCoords,\n+1050 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+1051 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+1052 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1053 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1054 }\n+1055\n+1098 template \n+_\b1_\b1_\b0_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1101 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1102 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1103 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1104 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1105 int numPatchCoords,\n+1106 PATCHCOORD_BUFFER *patchCoords,\n+1107 PATCH_TABLE *patchTable,\n+1108 int fvarChannel,\n+1109 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+1110 void * deviceContext = NULL) {\n+1111\n+1112 (void)instance; // unused\n+1113 (void)deviceContext; // unused\n+1114\n+1115 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+1116 dstBuffer->BindCpuBuffer(), dstDesc,\n+1117 duBuffer->BindCpuBuffer(), duDesc,\n+1118 dvBuffer->BindCpuBuffer(), dvDesc,\n+1119 numPatchCoords,\n+1120 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+1121 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+1122 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1123 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1124 }\n+1125\n+1186 template \n+_\b1_\b1_\b8_\b8 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1189 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1190 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1191 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1192 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1193 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1194 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1195 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1196 int numPatchCoords,\n+1197 PATCHCOORD_BUFFER *patchCoords,\n+1198 PATCH_TABLE *patchTable,\n+1199 int fvarChannel,\n+1200 _\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+1201 void * deviceContext = NULL) {\n+1202\n+1203 (void)instance; // unused\n+1204 (void)deviceContext; // unused\n+1205\n+1206 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+1207 dstBuffer->BindCpuBuffer(), dstDesc,\n+1208 duBuffer->BindCpuBuffer(), duDesc,\n+1209 dvBuffer->BindCpuBuffer(), dvDesc,\n+1210 duuBuffer->BindCpuBuffer(), duuDesc,\n+1211 duvBuffer->BindCpuBuffer(), duvDesc,\n+1212 dvvBuffer->BindCpuBuffer(), dvvDesc,\n+1213 numPatchCoords,\n+1214 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+1215 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+1216 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1217 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1218 }\n+1219\n+1225\n+_\b1_\b2_\b2_\b6 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(void *deviceContext = NULL);\n+1227\n+_\b1_\b2_\b2_\b8 static void _\bS_\be_\bt_\bN_\bu_\bm_\bT_\bh_\br_\be_\ba_\bd_\bs(int numThreads);\n+1229};\n+1230\n+1231\n+1232} // end namespace Osd\n+1233\n+1234} // end namespace OPENSUBDIV_VERSION\n+1235using namespace OPENSUBDIV_VERSION;\n+1236\n+1237} // end namespace OpenSubdiv\n+1238\n+1239\n+1240#endif // OPENSUBDIV3_OSD_OMP_EVALUATOR_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-void OmpEvalStencils(float const *src, BufferDescriptor const &srcDesc, float\n-*dst, BufferDescriptor const &dstDesc, int const *sizes, int const *offsets,\n-int const *indices, float const *weights, int start, int end)\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n BufferDescriptor is a struct which describes buffer elements in interleaved\n data buffers....\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n+fvarChannel, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int\n+*offsets, const int *indices, const float *weights, int start, int end)\n+Static eval stencils function which takes raw CPU pointers for input and\n+output.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const\n+*instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const\n+OmpEvaluator *instance=NULL, void *deviceContext=NULL)\n+Generic static eval stencils function with derivatives. This function has a\n+same signature as other d...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int\n+*offsets, const int *indices, const float *weights, const float *duWeights,\n+const float *dvWeights, int start, int end)\n+Static eval stencils function with derivatives, which takes raw CPU pointers\n+for input and output.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n+OmpEvaluator const *instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, OmpEvaluator const\n+*instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n+BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n+float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int\n+*offsets, const int *indices, const float *weights, const float *duWeights,\n+const float *dvWeights, const float *duuWeights, const float *duvWeights, const\n+float *dvvWeights, int start, int end)\n+Static eval stencils function with derivatives, which takes raw CPU pointers\n+for input and output.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n+const *stencilTable, const OmpEvaluator *instance=NULL, void\n+*deviceContext=NULL)\n+Generic static eval stencils function. This function has a same signature as\n+other device kernels hav...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n+BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n+float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord\n+const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer,\n+PatchParam const *patchParamBuffer)\n+Static limit eval function. It takes an array of PatchCoord and evaluate limit\n+values on given PatchT...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void\n+*deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void\n+*deviceContext=NULL)\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b0_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(void *deviceContext=NULL)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n+const OmpEvaluator *instance=NULL, void *deviceContext=NULL)\n+Generic static eval stencils function with derivatives. This function has a\n+same signature as other d...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b0_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const\n+*instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords,\n+PatchCoord const *patchCoords, PatchArray const *patchArrays, const int\n+*patchIndexBuffer, PatchParam const *patchParamBuffer)\n+Static limit eval function. It takes an array of PatchCoord and evaluate limit\n+values on given PatchT...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bN_\bu_\bm_\bT_\bh_\br_\be_\ba_\bd_\bs\n+static void SetNumThreads(int numThreads)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const\n+PatchCoord *patchCoords, const PatchArray *patchArrays, const int\n+*patchIndexBuffer, const PatchParam *patchParamBuffer)\n+Static limit eval function. It takes an array of PatchCoord and evaluate limit\n+values on given PatchT...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bO_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n+OmpEvaluator const *instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd\n+Coordinates set on a patch table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b2_\b7\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bo_\bm_\bp_\bK_\be_\br_\bn_\be_\bl_\b._\bh\n+ * _\bo_\bm_\bp_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Thu Feb 29 2024 12:58:19 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00887.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00887.html", "unified_diff": "@@ -102,17 +102,17 @@\n
\n
#include "../version.h"
\n #include <bitset>
\n #include <cassert>
\n #include <cstring>
\n #include <vector>
\n #include "../far/topologyRefiner.h"
\n-#include "../far/patchTableFactory.h"
\n+#include "../far/patchTableFactory.h"
\n #include "../far/stencilTable.h"
\n-#include "../far/stencilTableFactory.h"
\n+#include "../far/stencilTableFactory.h"
\n #include "../osd/bufferDescriptor.h"
\n
\n

Go to the source code of this file.

\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00887_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00887_source.html", "unified_diff": "@@ -900,26 +900,26 @@\n
std::bitset< NUM_MESH_BITS > MeshBitset
Definition mesh.h:63
\n
Far::StencilTable const * convertToCompatibleStencilTable< Far::StencilTable, Far::StencilTable, ID3D11DeviceContext >(Far::StencilTable const *table, ID3D11DeviceContext *)
Definition mesh.h:169
\n
Container for arrays of parametric patches.
Definition patchTable.h:55
\n
int GetMaxValence() const
Returns max vertex valence.
Definition patchTable.h:92
\n
StencilTable const * GetLocalPointStencilTable() const
Returns the stencil table to compute local point vertex values.
Definition patchTable.h:730
\n
StencilTable const * GetLocalPointVaryingStencilTable() const
Returns the stencil table to compute local point varying values.
Definition patchTable.h:735
\n
static PatchTable * Create(TopologyRefiner const &refiner, Options options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())
Instantiates a PatchTable from a client-provided TopologyRefiner.
\n-\n-
@ ENDCAP_LEGACY_GREGORY
legacy option for 2.x style Gregory patches (Catmark only)
\n-
@ ENDCAP_GREGORY_BASIS
use Gregory patches (highest quality, recommended default)
\n-
@ ENDCAP_BILINEAR_BASIS
use linear patches (simple quads or tris)
\n-
@ ENDCAP_BSPLINE_BASIS
use BSpline-like patches (same patch type as regular)
\n-\n+\n+
@ ENDCAP_LEGACY_GREGORY
legacy option for 2.x style Gregory patches (Catmark only)
\n+
@ ENDCAP_GREGORY_BASIS
use Gregory patches (highest quality, recommended default)
\n+
@ ENDCAP_BILINEAR_BASIS
use linear patches (simple quads or tris)
\n+
@ ENDCAP_BSPLINE_BASIS
use BSpline-like patches (same patch type as regular)
\n+\n
int GetNumControlVertices() const
Returns the number of control vertices indexed in the table.
\n
int GetNumStencils() const
Returns the number of stencils in the table.
\n
Stencil table class wrapping the template for compatibility.
\n
Limit stencil table class wrapping the template for compatibility.
\n-
static StencilTable const * Create(TopologyRefiner const &refiner, Options options=Options())
\n-
static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n+
static StencilTable const * Create(TopologyRefiner const &refiner, Options options=Options())
\n+
static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n
int GetNumVertices() const
Return the number of vertices in this level.
\n
Stores topology data for a specified set of refinement options.
\n
bool IsUniform() const
Returns true if uniform refinement has been applied.
\n
int GetNumFVarChannels() const
Returns the number of face-varying channels in the tables.
\n
void RefineUniform(UniformOptions options)
Refine the topology uniformly.
\n
TopologyLevel const & GetLevel(int level) const
Returns a handle to access data specific to a particular level.
\n
void RefineAdaptive(AdaptiveOptions options, ConstIndexArray selectedFaces=ConstIndexArray())
Feature Adaptive topology refinement.
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00912.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00912.html", "unified_diff": "@@ -291,15 +291,15 @@\n

\n Classes

class  MeshInterface< PATCH_TABLE >
\n \n \n \n
typedef MeshInterface<D3D11PatchTable> D3D11MeshInterface
\n
\n \n-

Definition at line 38 of file d3d11Mesh.h.

\n+

Definition at line 38 of file d3d11Mesh.h.

\n \n
\n \n \n

◆ GLMeshInterface

\n \n
\n@@ -339,15 +339,15 @@\n \n \n \n \n
typedef MeshInterface<MTLPatchTable> MTLMeshInterface
\n
\n \n-

Definition at line 38 of file mtlMesh.h.

\n+

Definition at line 38 of file mtlMesh.h.

\n \n
\n \n \n

◆ PatchArrayVector

\n \n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00921.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00921.html", "unified_diff": "@@ -97,15 +97,15 @@\n
Parameterization Class Reference
\n
\n
\n \n

Simple class defining the 2D parameterization of a face. \n More...

\n \n-

#include <parameterization.h>

\n+

#include <parameterization.h>

\n \n \n \n

\n Public Types

enum  Type {
\n   QUAD\n ,
\n   TRI\n@@ -192,15 +192,15 @@\n
 
\n

Detailed Description

\n

Simple class defining the 2D parameterization of a face.

\n

Parameterization is a simple class that provides information about the parameterization of a face in a local (u,v) coordinate system. It is defined by the size of a face (i.e. its number of vertices) and the subdivision scheme that determines its limit surface.

\n

As an example of how the subdivision scheme is essential in determining the Parameterization, consider the case of a triangle. A triangle is regular for the Loop scheme and so has a very simple parameterization as a triangular patch. But for the Catmull-Clark scheme, a triangle is an irregular face that must first be subdivided – making its limit surface a piecewise collection of quadrilateral patches.

\n \n-

Definition at line 52 of file parameterization.h.

\n+

Definition at line 52 of file parameterization.h.

\n

Member Enumeration Documentation

\n \n

◆ Type

\n \n
\n
\n \n@@ -217,15 +217,15 @@\n \n \n \n
TRI 

Triangle.

\n
QUAD_SUBFACES 

Partitioned into quadrilateral sub-faces.

\n
\n \n-

Definition at line 62 of file parameterization.h.

\n+

Definition at line 62 of file parameterization.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ Parameterization() [1/3]

\n \n@@ -277,15 +277,15 @@\n inline

\n
\n \n

Default construction produces an invalid instance.

\n \n-

Definition at line 84 of file parameterization.h.

\n+

Definition at line 84 of file parameterization.h.

\n \n
\n \n \n

◆ Parameterization() [3/3]

\n \n
\n@@ -371,15 +371,15 @@\n inline \n \n \n
\n \n

Convert (u,v) to a sub-face (return value) and its normalized (u,v) coordinate.

\n \n-

Definition at line 229 of file parameterization.h.

\n+

Definition at line 229 of file parameterization.h.

\n \n
\n \n \n

◆ ConvertCoordToSubFace()

\n \n
\n@@ -413,15 +413,15 @@\n inline \n \n \n
\n \n

Convert (u,v) to a sub-face (return value) and its local (u,v) coordinate.

\n \n-

Definition at line 215 of file parameterization.h.

\n+

Definition at line 215 of file parameterization.h.

\n \n
\n \n \n

◆ ConvertNormalizedSubFaceToCoord()

\n \n
\n@@ -461,15 +461,15 @@\n inline \n \n \n
\n \n

Convert a sub-face and its normalized (u,v) coordinate to (u,v)

\n \n-

Definition at line 235 of file parameterization.h.

\n+

Definition at line 235 of file parameterization.h.

\n \n
\n \n \n

◆ ConvertSubFaceToCoord()

\n \n
\n@@ -509,15 +509,15 @@\n inline \n \n \n
\n \n

Convert a sub-face and its local (u,v) coordinate to (u,v)

\n \n-

Definition at line 221 of file parameterization.h.

\n+

Definition at line 221 of file parameterization.h.

\n \n
\n \n \n

◆ GetCenterCoord()

\n \n
\n@@ -598,15 +598,15 @@\n inline \n \n \n
\n \n

Returns the size (number of vertices) of the corresponding face.

\n \n-

Definition at line 101 of file parameterization.h.

\n+

Definition at line 101 of file parameterization.h.

\n \n
\n \n \n

◆ GetSubFace()

\n \n
\n@@ -630,15 +630,15 @@\n inline \n \n \n
\n \n

Returns the integer sub-face containing the given (u,v)

\n \n-

Definition at line 202 of file parameterization.h.

\n+

Definition at line 202 of file parameterization.h.

\n \n
\n \n \n

◆ GetType()

\n \n
\n@@ -659,15 +659,15 @@\n inline \n \n \n
\n \n

Returns the type of parameterization assigned.

\n \n-

Definition at line 98 of file parameterization.h.

\n+

Definition at line 98 of file parameterization.h.

\n \n
\n \n \n

◆ GetVertexCoord()

\n \n
\n@@ -720,15 +720,15 @@\n inline \n \n \n
\n \n

Returns if Parameterization has been partitioned into sub-faces.

\n \n-

Definition at line 196 of file parameterization.h.

\n+

Definition at line 196 of file parameterization.h.

\n \n
\n \n \n

◆ IsValid()

\n \n
\n@@ -749,15 +749,15 @@\n inline \n \n \n
\n \n

Returns true if correctly initialized.

\n \n-

Definition at line 81 of file parameterization.h.

\n+

Definition at line 81 of file parameterization.h.

\n \n
\n \n \n

◆ operator=()

\n \n
\n@@ -780,15 +780,15 @@\n \n \n
\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Bfr
  • Parameterization
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00925.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00925.html", "unified_diff": "@@ -96,15 +96,15 @@\n
    RefinerSurfaceFactoryBase Class Reference
    \n
\n
\n \n

Intermediate subclass of SurfaceFactory with Far::TopologyRefiner as the mesh. \n More...

\n \n-

#include <refinerSurfaceFactory.h>

\n+

#include <refinerSurfaceFactory.h>

\n
\n Inheritance diagram for RefinerSurfaceFactoryBase:
\n
\n
\n \"\"/\n \n \"SurfaceFactory\"\n@@ -236,15 +236,15 @@\n \n

Detailed Description

\n

Intermediate subclass of SurfaceFactory with Far::TopologyRefiner as the mesh.

\n

RefinerSurfaceFactoryBase is an intermediate subclass of SurfaceFactory using Far::TopologyRefiner as the connected mesh representation.

\n

The SurfaceFactoryMeshAdapter interface for TopologyRefiner is provided in full, along with some public extensions specific to TopologyRefiner.

\n

Additional caching expectations of SurfaceFactory are NOT specified here. These are deferred to subclasses to implement different behaviors of the factory's internal caching. A template for such subclasses is additionally provided – allowing clients desiring a thread-safe cache to simply declare a subclass for a preferred thread-safe type.

\n \n-

Definition at line 58 of file refinerSurfaceFactory.h.

\n+

Definition at line 58 of file refinerSurfaceFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ RefinerSurfaceFactoryBase()

\n \n
\n
\n \n@@ -317,15 +317,15 @@\n inline\n \n
\n
\n \n

Return the instance of the mesh.

\n \n-

Definition at line 79 of file refinerSurfaceFactory.h.

\n+

Definition at line 79 of file refinerSurfaceFactory.h.

\n \n
\n
\n \n

◆ GetNumFaces()

\n \n
\n@@ -346,15 +346,15 @@\n inline \n \n \n
\n \n

Return the number of faces.

\n \n-

Definition at line 82 of file refinerSurfaceFactory.h.

\n+

Definition at line 82 of file refinerSurfaceFactory.h.

\n \n
\n
\n \n

◆ GetNumFVarChannels()

\n \n
\n@@ -375,20 +375,20 @@\n inline \n \n \n
\n \n

Return the number of face-varying channels.

\n \n-

Definition at line 85 of file refinerSurfaceFactory.h.

\n+

Definition at line 85 of file refinerSurfaceFactory.h.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Bfr
  • RefinerSurfaceFactoryBase
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00929.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00929.html", "unified_diff": "@@ -97,15 +97,15 @@\n
    RefinerSurfaceFactory< CACHE_TYPE > Class Template Reference
    \n
\n
\n \n

Template for concrete subclasses of RefinerSurfaceFactoryBase. \n More...

\n \n-

#include <refinerSurfaceFactory.h>

\n+

#include <refinerSurfaceFactory.h>

\n
\n Inheritance diagram for RefinerSurfaceFactory< CACHE_TYPE >:
\n
\n
\n \"\"/\n \n \"RefinerSurfaceFactoryBase\"\n@@ -241,15 +241,15 @@\n \n \n
CACHE_TYPEA subclass of SurfaceFactoryCache
\n \n \n

Note a default template parameter uses the base SurfaceFactoryCache for convenience, but which is not thread-safe.

\n \n-

Definition at line 157 of file refinerSurfaceFactory.h.

\n+

Definition at line 157 of file refinerSurfaceFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ RefinerSurfaceFactory()

\n \n
\n
\n
\n@@ -279,15 +279,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 159 of file refinerSurfaceFactory.h.

\n+

Definition at line 159 of file refinerSurfaceFactory.h.

\n \n
\n
\n \n

◆ ~RefinerSurfaceFactory()

\n \n
\n@@ -311,15 +311,15 @@\n \n \n
\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n
\n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Bfr
  • RefinerSurfaceFactory
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00941.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00941.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    SurfaceFactory Class Reference
    \n
\n
\n \n

Base class providing initialization of a Surface for each face of a mesh. \n More...

\n \n-

#include <surfaceFactory.h>

\n+

#include <surfaceFactory.h>

\n
\n Inheritance diagram for SurfaceFactory:
\n
\n
\n \"\"/\n \n \"SurfaceFactoryMeshAdapter\"\n@@ -245,15 +245,15 @@\n

A subclass of SurfaceFactory is written to support a specific type of connected mesh. The public interface of SurfaceFactory is both inherited by and extended by the subclasses. Expected extensions to the interface include one or more constructors (i.e. given a specific instance of the subclass' mesh type) as well as other methods that may involve the mesh's data types (primvars) in their native form.

\n

By inheriting the SurfaceFactoryMeshAdapter interface, SurfaceFactory requires its subclasses to implement the small suite of pure virtual methods to complete the factory's implementation for the subclass' mesh type. These methods provide the base factory with topological information about faces of that mesh – from which it creates instances of Surface defining their limit surface.

\n

The SurfaceFactory inherits rather than contains SurfaceFactoryMeshAdapter as instances of SurfaceFactoryMeshAdapter serve no purpose on their own, and the interface between the two is designed with the specific needs of the SurfaceFactory. When customizing a subclass of SurfaceFactory for a particular mesh type, this inheritance also avoids the need to coordinate the subclass of SurfaceFactory with the separate subclass of SurfaceFactoryMeshAdapter.

\n

It must be emphasized that a subclass of SurfaceFactory is written to support a specific type of \"connected\" mesh – not simply a container of data defining a mesh. The SurfaceFactoryMeshAdapter interface describes the complete topological neighborhood around a specific face, and without any connectivity between mesh components (e.g. given a vertex, what are its incident faces?), satisfying these methods will be impossible, or, at best, extremely inefficient.

\n

Ultimately a subclass of SurfaceFactory is expected to be a lightweight interface to a connected mesh – lightweight in terms of both time and memory usage. It's construction is expected to be trivial, after which it can quickly and efficiently provide a Surface for one or more faces of a mesh for immediate evaluation. So construction of an instance of a subclass should involve no heavy pre-processing – the greater the overhead of a subclass constructor, the more it violates the intention of the base class as a lightweight interface.

\n

Instances of SurfaceFactory are initialized with a set of Options that form part of the state of the factory and remain fixed for its lifetime. Such options are intended to ensure that the instances of Surface that it creates are consistent, as well as to enable/disable or otherwise manage caching for construction efficiency – either internally or between itself and other factories (advanced).

\n \n-

Definition at line 103 of file surfaceFactory.h.

\n+

Definition at line 103 of file surfaceFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ ~SurfaceFactory()

\n \n
\n
\n \n@@ -372,15 +372,15 @@\n inline\n \n
\n
\n \n

Construct a Surface for the default face-varying data.

\n \n-

Definition at line 551 of file surfaceFactory.h.

\n+

Definition at line 551 of file surfaceFactory.h.

\n \n
\n
\n \n

◆ CreateFaceVaryingSurface() [2/2]

\n \n
\n@@ -414,15 +414,15 @@\n inline \n \n \n
\n \n

Construct a Surface for specified face-varying data.

\n \n-

Definition at line 543 of file surfaceFactory.h.

\n+

Definition at line 543 of file surfaceFactory.h.

\n \n
\n
\n \n

◆ CreateVaryingSurface()

\n \n
\n@@ -446,15 +446,15 @@\n inline \n \n \n
\n \n

Construct a Surface for varying data.

\n \n-

Definition at line 535 of file surfaceFactory.h.

\n+

Definition at line 535 of file surfaceFactory.h.

\n \n
\n
\n \n

◆ CreateVertexSurface()

\n \n
\n@@ -478,15 +478,15 @@\n inline \n \n \n
\n \n

Construct a Surface for vertex data.

\n \n-

Definition at line 527 of file surfaceFactory.h.

\n+

Definition at line 527 of file surfaceFactory.h.

\n \n
\n \n \n

◆ FaceHasLimitSurface()

\n \n
\n@@ -549,15 +549,15 @@\n inline \n \n \n
\n \n

Return the set of subdivision options.

\n \n-

Definition at line 173 of file surfaceFactory.h.

\n+

Definition at line 173 of file surfaceFactory.h.

\n \n
\n \n \n

◆ GetSchemeType()

\n \n
\n@@ -578,15 +578,15 @@\n inline \n \n \n
\n \n

Return the subdivision scheme.

\n \n-

Definition at line 170 of file surfaceFactory.h.

\n+

Definition at line 170 of file surfaceFactory.h.

\n \n
\n \n \n

◆ InitFaceVaryingSurface() [1/2]

\n \n
\n@@ -629,15 +629,15 @@\n faceIndexIndex of face with limit surface of interest \n surfaceSurface to initialize for face-varying data \n \n \n \n
Returns
True if the face has a limit surface, the default face-varying ID was valid, and its Surface was successfully constructed
\n \n-

Definition at line 500 of file surfaceFactory.h.

\n+

Definition at line 500 of file surfaceFactory.h.

\n \n
\n \n \n

◆ InitFaceVaryingSurface() [2/2]

\n \n
\n@@ -686,15 +686,15 @@\n surfaceSurface to initialize for face-varying data \n fvarIDIdentifier of a specific set of face-varying data \n \n \n \n
Returns
True if the face has a limit surface, the given face-varying ID was valid, and its Surface was successfully constructed
\n \n-

Definition at line 494 of file surfaceFactory.h.

\n+

Definition at line 494 of file surfaceFactory.h.

\n \n
\n \n \n

◆ InitSurfaces()

\n \n
\n@@ -766,15 +766,15 @@\n fvarCountSize of array of face-varying Surfaces (optional) \n varSurfaceSurface to initialize for varying data (optional) \n \n \n \n
Returns
True if the face has a limit surface, any given face-varying IDs were valid, and all Surfaces were successfully constructed.
\n \n-

Definition at line 507 of file surfaceFactory.h.

\n+

Definition at line 507 of file surfaceFactory.h.

\n \n
\n \n \n

◆ InitVaryingSurface()

\n \n
\n@@ -816,15 +816,15 @@\n faceIndexIndex of face with limit surface of interest \n surfaceSurface to initialize for varying data \n \n \n \n
Returns
True if the face has a limit surface and it was successfully constructed
\n \n-

Definition at line 488 of file surfaceFactory.h.

\n+

Definition at line 488 of file surfaceFactory.h.

\n \n
\n \n \n

◆ InitVertexSurface()

\n \n
\n@@ -866,15 +866,15 @@\n faceIndexIndex of face with limit surface of interest \n surfaceSurface to initialize for vertex data \n \n \n \n
Returns
True if the face has a limit surface and it was successfully constructed
\n \n-

Definition at line 482 of file surfaceFactory.h.

\n+

Definition at line 482 of file surfaceFactory.h.

\n \n
\n \n \n

◆ operator=()

\n \n
\n@@ -925,15 +925,15 @@\n
\n \n

Subclass to identify an internal cache for use by base class.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Bfr
  • SurfaceFactory
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00945.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00945.html", "unified_diff": "@@ -97,15 +97,15 @@\n
    SurfaceFactory::Options Class Reference
    \n
\n
\n \n

Simple set of options assigned to instances of SurfaceFactory. \n More...

\n \n-

#include <surfaceFactory.h>

\n+

#include <surfaceFactory.h>

\n \n \n \n \n \n \n@@ -139,15 +139,15 @@\n \n

\n Public Member Functions

 Options ()
 
OptionsSetDefaultFVarID (FVarID id)
 Assign the default face-varying ID (none assigned by default)
 
\n

Detailed Description

\n

Simple set of options assigned to instances of SurfaceFactory.

\n

The Options class is a simple container specifying options for the construction of the SurfaceFactory to be applied during its lifetime.

\n

These options currently include choices to identify a default face-varying ID, to control caching behavior (on or off, use of external vs internal cache), and to control the accuracy of the resulting limit surface representations.

\n \n-

Definition at line 116 of file surfaceFactory.h.

\n+

Definition at line 116 of file surfaceFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ Options()

\n \n
\n
\n \n@@ -164,15 +164,15 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 118 of file surfaceFactory.h.

\n+

Definition at line 118 of file surfaceFactory.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ EnableCaching()

\n \n@@ -195,15 +195,15 @@\n inline \n \n \n
\n \n

Enable or disable caching (default is true):

\n \n-

Definition at line 457 of file surfaceFactory.h.

\n+

Definition at line 457 of file surfaceFactory.h.

\n \n
\n \n \n

◆ GetApproxLevelSharp()

\n \n
\n@@ -224,15 +224,15 @@\n inline \n \n \n
\n \n

Return maximum refinement level for sharp features.

\n \n-

Definition at line 147 of file surfaceFactory.h.

\n+

Definition at line 147 of file surfaceFactory.h.

\n \n
\n \n \n

◆ GetApproxLevelSmooth()

\n \n
\n@@ -253,15 +253,15 @@\n inline \n \n \n
\n \n

Return maximum refinement level for smooth features.

\n \n-

Definition at line 142 of file surfaceFactory.h.

\n+

Definition at line 142 of file surfaceFactory.h.

\n \n
\n \n \n

◆ GetDefaultFVarID()

\n \n
\n@@ -282,15 +282,15 @@\n inline \n \n \n
\n \n

Return the default face-varying ID.

\n \n-

Definition at line 125 of file surfaceFactory.h.

\n+

Definition at line 125 of file surfaceFactory.h.

\n \n
\n \n \n

◆ GetExternalCache()

\n \n
\n@@ -311,15 +311,15 @@\n inline \n \n \n
\n \n

Return any assigned external cache.

\n \n-

Definition at line 135 of file surfaceFactory.h.

\n+

Definition at line 135 of file surfaceFactory.h.

\n \n
\n \n \n

◆ IsCachingEnabled()

\n \n
\n@@ -340,15 +340,15 @@\n inline \n \n \n
\n \n

Return if caching is enable.

\n \n-

Definition at line 130 of file surfaceFactory.h.

\n+

Definition at line 130 of file surfaceFactory.h.

\n \n
\n \n \n

◆ SetApproxLevelSharp()

\n \n
\n@@ -370,15 +370,15 @@\n inline \n \n \n
\n \n

Assign maximum refinement level for sharp features.

\n \n-

Definition at line 472 of file surfaceFactory.h.

\n+

Definition at line 472 of file surfaceFactory.h.

\n \n
\n \n \n

◆ SetApproxLevelSmooth()

\n \n
\n@@ -400,15 +400,15 @@\n inline \n \n \n
\n \n

Assign maximum refinement level for smooth features.

\n \n-

Definition at line 467 of file surfaceFactory.h.

\n+

Definition at line 467 of file surfaceFactory.h.

\n \n
\n \n \n

◆ SetDefaultFVarID()

\n \n
\n@@ -430,15 +430,15 @@\n inline \n \n \n
\n \n

Assign the default face-varying ID (none assigned by default)

\n \n-

Definition at line 452 of file surfaceFactory.h.

\n+

Definition at line 452 of file surfaceFactory.h.

\n \n
\n \n \n

◆ SetExternalCache()

\n \n
\n@@ -460,20 +460,20 @@\n inline \n \n \n
\n \n

Assign an external cache to override the internal.

\n \n-

Definition at line 462 of file surfaceFactory.h.

\n+

Definition at line 462 of file surfaceFactory.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Bfr
  • SurfaceFactory
  • Options
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00949.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00949.html", "unified_diff": "@@ -97,15 +97,15 @@\n
    SurfaceFactoryCache Class Reference
    \n
\n
\n \n

Container used internally by SurfaceFactory to store reusable information. \n More...

\n \n-

#include <surfaceFactoryCache.h>

\n+

#include <surfaceFactoryCache.h>

\n
\n Inheritance diagram for SurfaceFactoryCache:
\n
\n
\n \"\"/\n \n \"SurfaceFactoryCacheThreaded<\n@@ -124,15 +124,15 @@\n  \n \n

Detailed Description

\n

Container used internally by SurfaceFactory to store reusable information.

\n

SurfaceFactoryCache is a container for storing/caching instances of the internal representation of complex patches used by SurfaceFactory so that they can be quickly identified and retrieved for reuse.

\n

It is intended for internal use by SurfaceFactory. Public access is available but limited to construction only – allowing an instance to be reused by assigning it to more than one SurfaceFactory.

\n \n-

Definition at line 59 of file surfaceFactoryCache.h.

\n+

Definition at line 59 of file surfaceFactoryCache.h.

\n

Constructor & Destructor Documentation

\n \n

◆ SurfaceFactoryCache() [1/2]

\n \n
\n
\n \n@@ -222,15 +222,15 @@\n \n
\n
\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n
\n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Bfr
  • SurfaceFactoryCache
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00953.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00953.html", "unified_diff": "@@ -97,15 +97,15 @@\n
    SurfaceFactoryCacheThreaded< MUTEX_TYPE, READ_LOCK_GUARD_TYPE, WRITE_LOCK_GUARD_TYPE > Class Template Reference
    \n
\n
\n \n

Template for declaring thread-safe subclasses of SurfaceFactoryCache. \n More...

\n \n-

#include <surfaceFactoryCache.h>

\n+

#include <surfaceFactoryCache.h>

\n
\n Inheritance diagram for SurfaceFactoryCacheThreaded< MUTEX_TYPE, READ_LOCK_GUARD_TYPE, WRITE_LOCK_GUARD_TYPE >:
\n
\n
\n \"\"/\n \n \"SurfaceFactoryCache\"\n@@ -137,15 +137,15 @@\n MUTEX_TYPEA mutex type with supported lock guards \n READ_LOCK_GUARD_TYPEA scoped lock guard allowing potentially shared access for read operations. \n WRITE_LOCK_GUARD_TYPEA scoped lock guard allowing exclusive access for write operations. \n \n \n \n \n-

Definition at line 118 of file surfaceFactoryCache.h.

\n+

Definition at line 118 of file surfaceFactoryCache.h.

\n

Constructor & Destructor Documentation

\n \n

◆ SurfaceFactoryCacheThreaded()

\n \n
\n
\n
\n@@ -164,15 +164,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 120 of file surfaceFactoryCache.h.

\n+

Definition at line 120 of file surfaceFactoryCache.h.

\n \n
\n
\n \n

◆ ~SurfaceFactoryCacheThreaded()

\n \n
\n@@ -196,15 +196,15 @@\n \n \n
\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n
\n \n
\n
\n
\n \n

Abstract interface adapting SurfaceFactory to a connected mesh representation. \n More...

\n \n-

#include <surfaceFactoryMeshAdapter.h>

\n+

#include <surfaceFactoryMeshAdapter.h>

\n
\n Inheritance diagram for SurfaceFactoryMeshAdapter:
\n
\n
\n \"\"/\n \n \"SurfaceFactory\"\n@@ -171,15 +171,15 @@\n  \n virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular (Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const\n  \n \n

Detailed Description

\n

Abstract interface adapting SurfaceFactory to a connected mesh representation.

\n \n-

Definition at line 65 of file surfaceFactoryMeshAdapter.h.

\n+

Definition at line 65 of file surfaceFactoryMeshAdapter.h.

\n

Member Typedef Documentation

\n \n

◆ FVarID

\n \n
\n
\n \n@@ -189,15 +189,15 @@\n
\n
\n \n

Type used to identify and specify face-varying primvars.

\n

A face-varying ID is used to specify face-varying primvars for evaluation so that they can be identified by the subclass for the mesh. It can be assigned as either a positive integer ID or pointer, with the subclass determining its interpretation.

\n

Often only one face-varying primvar is of interest, so a default can be assigned to the factory to avoid repeated specification.

\n \n-

Definition at line 80 of file surfaceFactoryMeshAdapter.h.

\n+

Definition at line 80 of file surfaceFactoryMeshAdapter.h.

\n \n
\n
\n \n

◆ Index

\n \n
\n@@ -207,15 +207,15 @@\n typedef int Index\n \n \n
\n \n

Integer type representing a mesh index.

\n \n-

Definition at line 68 of file surfaceFactoryMeshAdapter.h.

\n+

Definition at line 68 of file surfaceFactoryMeshAdapter.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ getFaceFVarValueIndices()

\n \n@@ -296,15 +296,15 @@\n \n \n inlineprotectedvirtual \n \n \n
\n \n-

Definition at line 224 of file surfaceFactoryMeshAdapter.h.

\n+

Definition at line 224 of file surfaceFactoryMeshAdapter.h.

\n \n
\n
\n \n

◆ getFaceNeighborhoodVertexIndicesIfRegular()

\n \n
\n@@ -334,15 +334,15 @@\n \n \n inlineprotectedvirtual \n \n \n
\n \n-

Definition at line 218 of file surfaceFactoryMeshAdapter.h.

\n+

Definition at line 218 of file surfaceFactoryMeshAdapter.h.

\n \n
\n
\n \n

◆ getFaceSize()

\n \n
\n@@ -571,15 +571,15 @@\n
\n \n

Describe the topology of incident faces around a face-vertex.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
\n \n

Factory for constructing a PatchTable from a TopologyRefiner. \n More...

\n \n-

#include <patchTableFactory.h>

\n+

#include <patchTableFactory.h>

\n \n \n \n \n \n \n@@ -124,29 +124,29 @@\n \n \n \n

\n Classes

struct  Options
 Public options for the PatchTable factory. More...
 
struct  PatchFaceTag
static PatchTableCreate (TopologyRefiner const &refiner, Options options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())
 Instantiates a PatchTable from a client-provided TopologyRefiner.
 
\n

Detailed Description

\n

Factory for constructing a PatchTable from a TopologyRefiner.

\n \n-

Definition at line 40 of file patchTableFactory.h.

\n+

Definition at line 40 of file patchTableFactory.h.

\n

Member Typedef Documentation

\n \n

◆ PatchTagVector

\n \n
\n
\n \n \n \n \n
typedef std::vector<PatchFaceTag> PatchTagVector
\n
\n \n-

Definition at line 208 of file patchTableFactory.h.

\n+

Definition at line 208 of file patchTableFactory.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ Create()

\n \n@@ -200,15 +200,15 @@\n \n \n
Returns
A new instance of PatchTable
\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PatchTableFactory
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01013.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01013.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    PatchTableFactory::Options Struct Reference
    \n
\n
\n \n

Public options for the PatchTable factory. \n More...

\n \n-

#include <patchTableFactory.h>

\n+

#include <patchTableFactory.h>

\n \n \n \n \n \n

\n Public Types

enum  EndCapType {
\n   ENDCAP_NONE = 0\n ,
\n   ENDCAP_BILINEAR_BASIS\n@@ -208,15 +208,15 @@\n
int const * fvarChannelIndices
 List containing the indices of the channels selected for the factory.
 
\n

Detailed Description

\n

Public options for the PatchTable factory.

\n \n-

Definition at line 45 of file patchTableFactory.h.

\n+

Definition at line 45 of file patchTableFactory.h.

\n

Member Enumeration Documentation

\n \n

◆ EndCapType

\n \n
\n
\n \n@@ -237,15 +237,15 @@\n \n \n \n
ENDCAP_GREGORY_BASIS 

use Gregory patches (highest quality, recommended default)

\n
ENDCAP_LEGACY_GREGORY 

legacy option for 2.x style Gregory patches (Catmark only)

\n
\n \n-

Definition at line 55 of file patchTableFactory.h.

\n+

Definition at line 55 of file patchTableFactory.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ Options()

\n \n@@ -266,15 +266,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 63 of file patchTableFactory.h.

\n+

Definition at line 63 of file patchTableFactory.h.

\n \n
\n \n

Member Function Documentation

\n \n

◆ GetEndCapType()

\n \n@@ -296,15 +296,15 @@\n inline \n \n \n
\n \n

Get endcap basis type.

\n \n-

Definition at line 85 of file patchTableFactory.h.

\n+

Definition at line 85 of file patchTableFactory.h.

\n \n
\n \n \n

◆ GetRefineAdaptiveOptions()

\n \n
\n@@ -325,15 +325,15 @@\n inline \n \n \n
\n \n

Determine adaptive refinement options to match assigned patch options.

\n \n-

Definition at line 100 of file patchTableFactory.h.

\n+

Definition at line 100 of file patchTableFactory.h.

\n \n
\n \n \n

◆ SetEndCapType()

\n \n
\n@@ -355,15 +355,15 @@\n inline \n \n \n
\n \n

Set endcap basis type.

\n \n-

Definition at line 88 of file patchTableFactory.h.

\n+

Definition at line 88 of file patchTableFactory.h.

\n \n
\n \n \n

◆ SetFVarPatchPrecision() [1/2]

\n \n
\n@@ -403,15 +403,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 215 of file patchTableFactory.h.

\n+

Definition at line 215 of file patchTableFactory.h.

\n \n
\n \n \n

◆ SetMaxIsolationLevel()

\n \n
\n@@ -433,15 +433,15 @@\n inline \n \n \n
\n \n

Set maximum isolation level.

\n \n-

Definition at line 91 of file patchTableFactory.h.

\n+

Definition at line 91 of file patchTableFactory.h.

\n \n
\n \n \n

◆ SetPatchPrecision() [1/2]

\n \n
\n@@ -481,15 +481,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 212 of file patchTableFactory.h.

\n+

Definition at line 212 of file patchTableFactory.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ endCapType

\n \n@@ -500,15 +500,15 @@\n unsigned int endCapType\n \n \n
\n \n

EndCapType.

\n \n-

Definition at line 120 of file patchTableFactory.h.

\n+

Definition at line 120 of file patchTableFactory.h.

\n \n
\n \n \n

◆ fvarChannelIndices

\n \n
\n@@ -518,15 +518,15 @@\n int const* fvarChannelIndices\n \n \n
\n \n

List containing the indices of the channels selected for the factory.

\n \n-

Definition at line 140 of file patchTableFactory.h.

\n+

Definition at line 140 of file patchTableFactory.h.

\n \n
\n \n \n

◆ fvarPatchPrecisionDouble

\n \n
\n@@ -536,15 +536,15 @@\n unsigned int fvarPatchPrecisionDouble\n \n \n
\n \n

Generate double-precision stencils for face-varying patches.

\n \n-

Definition at line 133 of file patchTableFactory.h.

\n+

Definition at line 133 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateAllLevels

\n \n
\n@@ -554,15 +554,15 @@\n unsigned int generateAllLevels\n \n \n
\n \n

Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)

\n \n-

Definition at line 110 of file patchTableFactory.h.

\n+

Definition at line 110 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateFVarLegacyLinearPatches

\n \n
\n@@ -572,15 +572,15 @@\n unsigned int generateFVarLegacyLinearPatches\n \n \n
\n \n

Generate all linear face-varying patches (legacy)

\n \n-

Definition at line 136 of file patchTableFactory.h.

\n+

Definition at line 136 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateFVarTables

\n \n
\n@@ -590,15 +590,15 @@\n unsigned int generateFVarTables\n \n \n
\n \n

Generate face-varying patch tables.

\n \n-

Definition at line 129 of file patchTableFactory.h.

\n+

Definition at line 129 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateLegacySharpCornerPatches

\n \n
\n@@ -608,15 +608,15 @@\n unsigned int generateLegacySharpCornerPatches\n \n \n
\n \n

Generate sharp regular patches at smooth corners (legacy)

\n \n-

Definition at line 137 of file patchTableFactory.h.

\n+

Definition at line 137 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateVaryingLocalPoints

\n \n
\n@@ -626,15 +626,15 @@\n unsigned int generateVaryingLocalPoints\n \n \n
\n \n

Generate local points with varying patches.

\n \n-

Definition at line 126 of file patchTableFactory.h.

\n+

Definition at line 126 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateVaryingTables

\n \n
\n@@ -644,15 +644,15 @@\n unsigned int generateVaryingTables\n \n \n
\n \n

Generate varying patch tables.

\n \n-

Definition at line 125 of file patchTableFactory.h.

\n+

Definition at line 125 of file patchTableFactory.h.

\n \n
\n \n \n

◆ includeBaseLevelIndices

\n \n
\n@@ -662,15 +662,15 @@\n unsigned int includeBaseLevelIndices\n \n \n
\n \n

Include base level in patch point indices (Uniform mode only)

\n \n-

Definition at line 111 of file patchTableFactory.h.

\n+

Definition at line 111 of file patchTableFactory.h.

\n \n
\n \n \n

◆ includeFVarBaseLevelIndices

\n \n
\n@@ -680,15 +680,15 @@\n unsigned int includeFVarBaseLevelIndices\n \n \n
\n \n

Include base level in face-varying patch point indices (Uniform mode only)

\n \n-

Definition at line 112 of file patchTableFactory.h.

\n+

Definition at line 112 of file patchTableFactory.h.

\n \n
\n \n \n

◆ maxIsolationLevel

\n \n
\n@@ -698,15 +698,15 @@\n unsigned int maxIsolationLevel\n \n \n
\n \n

Cap adaptive feature isolation to the given level (max. 10)

\n \n-

Definition at line 117 of file patchTableFactory.h.

\n+

Definition at line 117 of file patchTableFactory.h.

\n \n
\n \n \n

◆ numFVarChannels

\n \n
\n@@ -716,15 +716,15 @@\n int numFVarChannels\n \n \n
\n \n

Number of channel indices and interpolation modes passed.

\n \n-

Definition at line 139 of file patchTableFactory.h.

\n+

Definition at line 139 of file patchTableFactory.h.

\n \n
\n \n \n

◆ patchPrecisionDouble

\n \n
\n@@ -734,15 +734,15 @@\n unsigned int patchPrecisionDouble\n \n \n
\n \n

Generate double-precision stencils for vertex patches.

\n \n-

Definition at line 132 of file patchTableFactory.h.

\n+

Definition at line 132 of file patchTableFactory.h.

\n \n
\n \n \n

◆ shareEndCapPatchPoints

\n \n
\n@@ -751,15 +751,15 @@\n \n unsigned int shareEndCapPatchPoints\n \n \n
\n

Share endcap patch points among adjacent endcap patches. currently only work with GregoryBasis.

\n \n-

Definition at line 121 of file patchTableFactory.h.

\n+

Definition at line 121 of file patchTableFactory.h.

\n \n
\n \n \n

◆ triangulateQuads

\n \n
\n@@ -769,15 +769,15 @@\n unsigned int triangulateQuads\n \n \n
\n \n

Triangulate 'QUADS' primitives (Uniform mode only)

\n \n-

Definition at line 113 of file patchTableFactory.h.

\n+

Definition at line 113 of file patchTableFactory.h.

\n \n
\n \n \n

◆ useInfSharpPatch

\n \n
\n@@ -787,15 +787,15 @@\n unsigned int useInfSharpPatch\n \n \n
\n \n

Use infinitely-sharp patch.

\n \n-

Definition at line 116 of file patchTableFactory.h.

\n+

Definition at line 116 of file patchTableFactory.h.

\n \n
\n \n \n

◆ useSingleCreasePatch

\n \n
\n@@ -805,20 +805,20 @@\n unsigned int useSingleCreasePatch\n \n \n
\n \n

Use single crease patch.

\n \n-

Definition at line 115 of file patchTableFactory.h.

\n+

Definition at line 115 of file patchTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PatchTableFactory
  • Options
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01017.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01017.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    PatchTableFactory::PatchFaceTag Struct Reference
    \n
\n
\n \n

Obsolete internal struct not intended for public use – due to be deprecated. \n More...

\n \n-

#include <patchTableFactory.h>

\n+

#include <patchTableFactory.h>

\n \n \n \n \n \n \n@@ -133,15 +133,15 @@\n \n \n \n

\n Public Member Functions

void clear ()
 
void assignBoundaryPropertiesFromEdgeMask (int boundaryEdgeMask)
 
 
unsigned int _isSingleCrease: 1
 
\n

Detailed Description

\n

Obsolete internal struct not intended for public use – due to be deprecated.

\n \n-

Definition at line 192 of file patchTableFactory.h.

\n+

Definition at line 192 of file patchTableFactory.h.

\n

Member Function Documentation

\n \n

◆ assignBoundaryPropertiesFromEdgeMask()

\n \n
\n
\n \n@@ -219,15 +219,15 @@\n
\n \n \n \n
unsigned int _boundaryCount
\n
\n \n-

Definition at line 199 of file patchTableFactory.h.

\n+

Definition at line 199 of file patchTableFactory.h.

\n \n
\n
\n \n

◆ _boundaryIndex

\n \n
\n@@ -235,15 +235,15 @@\n \n \n \n \n
unsigned int _boundaryIndex
\n
\n \n-

Definition at line 198 of file patchTableFactory.h.

\n+

Definition at line 198 of file patchTableFactory.h.

\n \n
\n
\n \n

◆ _boundaryMask

\n \n
\n@@ -251,15 +251,15 @@\n \n \n \n \n
unsigned int _boundaryMask
\n
\n \n-

Definition at line 197 of file patchTableFactory.h.

\n+

Definition at line 197 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _hasBoundaryEdge

\n \n
\n@@ -267,15 +267,15 @@\n \n \n \n \n
unsigned int _hasBoundaryEdge
\n
\n \n-

Definition at line 200 of file patchTableFactory.h.

\n+

Definition at line 200 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _hasPatch

\n \n
\n@@ -283,15 +283,15 @@\n \n \n \n \n
unsigned int _hasPatch
\n
\n \n-

Definition at line 194 of file patchTableFactory.h.

\n+

Definition at line 194 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _isRegular

\n \n
\n@@ -299,15 +299,15 @@\n \n \n \n \n
unsigned int _isRegular
\n
\n \n-

Definition at line 195 of file patchTableFactory.h.

\n+

Definition at line 195 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _isSingleCrease

\n \n
\n@@ -315,15 +315,15 @@\n \n \n \n \n
unsigned int _isSingleCrease
\n
\n \n-

Definition at line 201 of file patchTableFactory.h.

\n+

Definition at line 201 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _transitionMask

\n \n
\n@@ -331,20 +331,20 @@\n \n \n \n \n
unsigned int _transitionMask
\n
\n \n-

Definition at line 196 of file patchTableFactory.h.

\n+

Definition at line 196 of file patchTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

Applies refinement operations to generic primvar data. \n More...

\n \n-

#include <primvarRefiner.h>

\n+

#include <primvarRefiner.h>

\n \n \n \n \n \n \n@@ -159,15 +159,15 @@\n \n \n

\n Public Member Functions

 PrimvarRefinerReal (TopologyRefiner const &refiner)
 
 ~PrimvarRefinerReal ()
 
void LimitFaceVarying (T const &src, U &dst, int channel=0) const
 
\n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::PrimvarRefinerReal< REAL >

Applies refinement operations to generic primvar data.

\n \n-

Definition at line 56 of file primvarRefiner.h.

\n+

Definition at line 56 of file primvarRefiner.h.

\n

Constructor & Destructor Documentation

\n \n

◆ PrimvarRefinerReal()

\n \n
\n
\n
\n@@ -187,15 +187,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 59 of file primvarRefiner.h.

\n+

Definition at line 59 of file primvarRefiner.h.

\n \n
\n
\n \n

◆ ~PrimvarRefinerReal()

\n \n
\n@@ -216,15 +216,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 60 of file primvarRefiner.h.

\n+

Definition at line 60 of file primvarRefiner.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ GetTopologyRefiner()

\n \n@@ -246,15 +246,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 62 of file primvarRefiner.h.

\n+

Definition at line 62 of file primvarRefiner.h.

\n \n
\n \n \n

◆ Interpolate()

\n \n
\n@@ -305,15 +305,15 @@\n levelThe refinement level\n srcSource primvar buffer (templating control vertex data)\n dstDestination primvar buffer (templating refined vertex data) \n \n \n \n \n-

Definition at line 267 of file primvarRefiner.h.

\n+

Definition at line 267 of file primvarRefiner.h.

\n \n
\n \n \n

◆ InterpolateFaceUniform()

\n \n
\n@@ -365,15 +365,15 @@\n levelThe refinement level\n srcSource primvar buffer\n dstDestination primvar buffer \n \n \n \n \n-

Definition at line 394 of file primvarRefiner.h.

\n+

Definition at line 394 of file primvarRefiner.h.

\n \n
\n \n \n

◆ InterpolateFaceVarying()

\n \n
\n@@ -423,15 +423,15 @@\n \n
\n \n

Apply face-varying interpolation weights to a primvar buffer associated with a particular face-varying channel.

\n

Unlike vertex and varying primvar buffers, there is not a 1-to-1 correspondence between vertices and face-varying values – typically there are more face-varying values than vertices. Each face-varying channel is also independent in how its values relate to the vertices.

\n

The destination buffer must allocate an array of data for all the refined values, i.e. at least refiner.GetLevel(level).GetNumFVarValues(channel).

\n \n-

Definition at line 293 of file primvarRefiner.h.

\n+

Definition at line 293 of file primvarRefiner.h.

\n \n
\n \n \n

◆ InterpolateVarying()

\n \n
\n@@ -483,15 +483,15 @@\n levelThe refinement level\n srcSource primvar buffer (templating control vertex data)\n dstDestination primvar buffer (templating refined vertex data) \n \n \n \n \n-

Definition at line 412 of file primvarRefiner.h.

\n+

Definition at line 412 of file primvarRefiner.h.

\n \n
\n \n \n

◆ Limit() [1/2]

\n \n
\n@@ -535,15 +535,15 @@\n \n \n \n
srcSource primvar buffer (refined data) for last level
dstPosDestination primvar buffer (data at the limit)
\n \n \n \n-

Definition at line 319 of file primvarRefiner.h.

\n+

Definition at line 319 of file primvarRefiner.h.

\n \n
\n \n \n

◆ Limit() [2/2]

\n \n
\n@@ -589,15 +589,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 344 of file primvarRefiner.h.

\n+

Definition at line 344 of file primvarRefiner.h.

\n \n
\n \n \n

◆ LimitFaceVarying()

\n \n
\n@@ -637,20 +637,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 369 of file primvarRefiner.h.

\n+

Definition at line 369 of file primvarRefiner.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
\n \n-

#include <primvarRefiner.h>

\n+

#include <primvarRefiner.h>

\n
\n Inheritance diagram for PrimvarRefiner:
\n
\n
\n \"\"/\n \n \"PrimvarRefinerReal<\n@@ -138,15 +138,15 @@\n void Limit (T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const\n  \n void LimitFaceVarying (T const &src, U &dst, int channel=0) const\n  \n \n

Detailed Description

\n
\n-

Definition at line 1265 of file primvarRefiner.h.

\n+

Definition at line 1265 of file primvarRefiner.h.

\n

Constructor & Destructor Documentation

\n \n

◆ PrimvarRefiner()

\n \n
\n
\n \n@@ -164,20 +164,20 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 1267 of file primvarRefiner.h.

\n+

Definition at line 1267 of file primvarRefiner.h.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n
\n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PrimvarRefiner
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01037.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01037.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    StencilTableFactoryReal< REAL > Class Template Reference
    \n
\n
\n \n

A specialized factory for StencilTable. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n \n \n \n \n

\n Classes

struct  Options
 
\n \n \n

\n@@ -140,15 +140,15 @@\n

 Utility function for stencil splicing for local point face-varying stencils.
 
\n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableFactoryReal< REAL >

A specialized factory for StencilTable.

\n \n-

Definition at line 51 of file stencilTableFactory.h.

\n+

Definition at line 51 of file stencilTableFactory.h.

\n

Member Enumeration Documentation

\n \n

◆ Mode

\n \n
\n
\n
\n@@ -164,15 +164,15 @@\n \n INTERPOLATE_VARYING 

varying primvar stencils

\n \n INTERPOLATE_FACE_VARYING 

face-varying primvar stencils

\n \n \n \n-

Definition at line 55 of file stencilTableFactory.h.

\n+

Definition at line 55 of file stencilTableFactory.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ AppendLocalPointStencilTable()

\n \n@@ -357,15 +357,15 @@\n baseStencilTableInput StencilTable for refined vertices\n localPointStencilTableStencilTable for the change of basis patch points.\n factorizeIf factorize is set to true, endcap stencils will be factorized with supporting vertices from baseStencil table so that the endcap points can be computed directly from control vertices. \n \n \n \n \n-

Definition at line 148 of file stencilTableFactory.h.

\n+

Definition at line 148 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ Create() [1/2]

\n \n
\n@@ -459,15 +459,15 @@\n \n \n \n
\n
\n
The documentation for this class was generated from the following files:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • StencilTableFactoryReal
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01041.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01041.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    LimitStencilTableFactoryReal< REAL > Class Template Reference
    \n
\n
\n \n

A specialized factory for LimitStencilTable. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n \n \n \n \n \n \n@@ -135,15 +135,15 @@\n

\n Classes

struct  LocationArray
 Descriptor for limit surface locations. More...
 
struct  Options
\n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal< REAL >

A specialized factory for LimitStencilTable.

\n

The LimitStencilTableFactory creates a table of limit stencils. Limit stencils can interpolate any arbitrary location on the limit surface. The stencils will be bilinear if the surface is refined uniformly, and bicubic if feature adaptive isolation is used instead.

\n

Surface locations are expressed as a combination of ptex face index and normalized (s,t) patch coordinates. The factory exposes the LocationArray struct as a container for these location descriptors.

\n \n-

Definition at line 209 of file stencilTableFactory.h.

\n+

Definition at line 209 of file stencilTableFactory.h.

\n

Member Typedef Documentation

\n \n

◆ LocationArrayVec

\n \n
\n
\n
\n@@ -151,15 +151,15 @@\n \n \n \n \n
typedef std::vector<LocationArray> LocationArrayVec
\n
\n \n-

Definition at line 244 of file stencilTableFactory.h.

\n+

Definition at line 244 of file stencilTableFactory.h.

\n \n
\n
\n

Member Enumeration Documentation

\n \n

◆ Mode

\n \n@@ -178,15 +178,15 @@\n \n INTERPOLATE_VARYING 

varying primvar stencils

\n \n INTERPOLATE_FACE_VARYING 

face-varying primvar stencils

\n \n \n \n-

Definition at line 213 of file stencilTableFactory.h.

\n+

Definition at line 213 of file stencilTableFactory.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ Create()

\n \n@@ -253,15 +253,15 @@\n \n \n \n \n \n
The documentation for this class was generated from the following files:\n \n \n \n
\n
\n
StencilTableFactoryReal< REAL >::Options Struct Reference
\n \n
\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n \n \n \n \n

\n Public Member Functions

 Options ()
 
\n \n \n \n

\n@@ -127,15 +127,15 @@\n

 
unsigned int fvarChannel
 
\n

Detailed Description

\n
template<typename REAL>
\n struct OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableFactoryReal< REAL >::Options
\n-

Definition at line 61 of file stencilTableFactory.h.

\n+

Definition at line 61 of file stencilTableFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ Options()

\n \n
\n
\n
\n@@ -154,15 +154,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 63 of file stencilTableFactory.h.

\n+

Definition at line 63 of file stencilTableFactory.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ factorizeIntermediateLevels

\n \n@@ -174,15 +174,15 @@\n \n unsigned int factorizeIntermediateLevels\n \n \n
\n

accumulate stencil weights from control vertices or from the stencils of the previous level

\n \n-

Definition at line 75 of file stencilTableFactory.h.

\n+

Definition at line 75 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ fvarChannel

\n \n
\n@@ -193,15 +193,15 @@\n \n unsigned int fvarChannel\n \n \n
\n

face-varying channel to use when generating face-varying stencils

\n \n-

Definition at line 79 of file stencilTableFactory.h.

\n+

Definition at line 79 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ generateControlVerts

\n \n
\n@@ -213,15 +213,15 @@\n unsigned int generateControlVerts\n \n \n
\n \n

generate stencils for control-vertices

\n \n-

Definition at line 73 of file stencilTableFactory.h.

\n+

Definition at line 73 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ generateIntermediateLevels

\n \n
\n@@ -233,15 +233,15 @@\n unsigned int generateIntermediateLevels\n \n \n
\n \n

vertices at all levels or highest only

\n \n-

Definition at line 74 of file stencilTableFactory.h.

\n+

Definition at line 74 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ generateOffsets

\n \n
\n@@ -253,15 +253,15 @@\n unsigned int generateOffsets\n \n \n
\n \n

populate optional \"_offsets\" field

\n \n-

Definition at line 72 of file stencilTableFactory.h.

\n+

Definition at line 72 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ interpolationMode

\n \n
\n@@ -273,15 +273,15 @@\n unsigned int interpolationMode\n \n \n
\n \n

interpolation mode

\n \n-

Definition at line 71 of file stencilTableFactory.h.

\n+

Definition at line 71 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ maxLevel

\n \n
\n@@ -293,20 +293,20 @@\n unsigned int maxLevel\n \n \n
\n \n

generate stencils up to 'maxLevel'

\n \n-

Definition at line 78 of file stencilTableFactory.h.

\n+

Definition at line 78 of file stencilTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
LimitStencilTableFactoryReal< REAL >::Options Struct Reference
\n \n
\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n \n \n \n \n

\n Public Member Functions

 Options ()
 
\n \n \n \n

\n@@ -120,15 +120,15 @@\n

unsigned int fvarChannel
 face-varying channel to use
 
\n

Detailed Description

\n
template<typename REAL>
\n struct OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal< REAL >::Options
\n-

Definition at line 219 of file stencilTableFactory.h.

\n+

Definition at line 219 of file stencilTableFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ Options()

\n \n
\n
\n
\n@@ -147,15 +147,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 221 of file stencilTableFactory.h.

\n+

Definition at line 221 of file stencilTableFactory.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ fvarChannel

\n \n@@ -168,15 +168,15 @@\n unsigned int fvarChannel\n \n \n
\n \n

face-varying channel to use

\n \n-

Definition at line 229 of file stencilTableFactory.h.

\n+

Definition at line 229 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ generate1stDerivatives

\n \n
\n@@ -188,15 +188,15 @@\n unsigned int generate1stDerivatives\n \n \n
\n \n

Generate weights for 1st derivatives.

\n \n-

Definition at line 227 of file stencilTableFactory.h.

\n+

Definition at line 227 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ generate2ndDerivatives

\n \n
\n@@ -208,15 +208,15 @@\n unsigned int generate2ndDerivatives\n \n \n
\n \n

Generate weights for 2nd derivatives.

\n \n-

Definition at line 228 of file stencilTableFactory.h.

\n+

Definition at line 228 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ interpolationMode

\n \n
\n@@ -228,20 +228,20 @@\n unsigned int interpolationMode\n \n \n
\n \n

interpolation mode

\n \n-

Definition at line 226 of file stencilTableFactory.h.

\n+

Definition at line 226 of file stencilTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

Descriptor for limit surface locations. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n \n \n \n \n

\n Public Member Functions

 LocationArray ()
 
\n \n \n

\n@@ -124,15 +124,15 @@\n

 array of v coordinates
 
\n

Detailed Description

\n
template<typename REAL>
\n struct OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal< REAL >::LocationArray

Descriptor for limit surface locations.

\n \n-

Definition at line 233 of file stencilTableFactory.h.

\n+

Definition at line 233 of file stencilTableFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ LocationArray()

\n \n
\n
\n
\n@@ -151,15 +151,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 235 of file stencilTableFactory.h.

\n+

Definition at line 235 of file stencilTableFactory.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ numLocations

\n \n@@ -172,15 +172,15 @@\n int numLocations\n \n \n
\n \n

number of (u,v) coordinates in the array

\n \n-

Definition at line 238 of file stencilTableFactory.h.

\n+

Definition at line 238 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ ptexIdx

\n \n
\n@@ -192,15 +192,15 @@\n int ptexIdx\n \n \n
\n \n

ptex face index

\n \n-

Definition at line 237 of file stencilTableFactory.h.

\n+

Definition at line 237 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ s

\n \n
\n@@ -212,15 +212,15 @@\n REAL const* s\n \n \n
\n \n

array of u coordinates

\n \n-

Definition at line 240 of file stencilTableFactory.h.

\n+

Definition at line 240 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ t

\n \n
\n@@ -232,20 +232,20 @@\n REAL const * t\n \n \n
\n \n

array of v coordinates

\n \n-

Definition at line 241 of file stencilTableFactory.h.

\n+

Definition at line 241 of file stencilTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

Stencil table factory class wrapping the template for compatibility. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n
\n Inheritance diagram for StencilTableFactory:
\n
\n
\n \"\"/\n \n \"StencilTableFactoryReal<\n@@ -146,15 +146,15 @@\n \"-\"/ Public Types inherited from StencilTableFactoryReal< float >\n enum  Mode \n  \n \n

Detailed Description

\n

Stencil table factory class wrapping the template for compatibility.

\n \n-

Definition at line 287 of file stencilTableFactory.h.

\n+

Definition at line 287 of file stencilTableFactory.h.

\n

Member Function Documentation

\n \n

◆ AppendLocalPointStencilTable()

\n \n
\n
\n \n@@ -194,15 +194,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 308 of file stencilTableFactory.h.

\n+

Definition at line 308 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ AppendLocalPointStencilTableFaceVarying()

\n \n
\n@@ -250,15 +250,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 334 of file stencilTableFactory.h.

\n+

Definition at line 334 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ AppendLocalPointStencilTableVarying()

\n \n
\n@@ -300,15 +300,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 321 of file stencilTableFactory.h.

\n+

Definition at line 321 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ Create() [1/2]

\n \n
\n@@ -338,15 +338,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 300 of file stencilTableFactory.h.

\n+

Definition at line 300 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ Create() [2/2]

\n \n
\n@@ -376,20 +376,20 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 293 of file stencilTableFactory.h.

\n+

Definition at line 293 of file stencilTableFactory.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • StencilTableFactory
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01093.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01093.html", "unified_diff": "@@ -97,15 +97,15 @@\n
    LimitStencilTableFactory Class Reference
    \n
\n
\n \n

Stencil table factory class wrapping the template for compatibility. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n
\n Inheritance diagram for LimitStencilTableFactory:
\n
\n
\n \"\"/\n \n \"LimitStencilTableFactoryReal<\n@@ -128,15 +128,15 @@\n  \n typedef std::vector< LocationArray > LocationArrayVec\n  \n \n

Detailed Description

\n

Stencil table factory class wrapping the template for compatibility.

\n \n-

Definition at line 354 of file stencilTableFactory.h.

\n+

Definition at line 354 of file stencilTableFactory.h.

\n

Member Function Documentation

\n \n

◆ Create()

\n \n
\n
\n \n@@ -182,20 +182,20 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 360 of file stencilTableFactory.h.

\n+

Definition at line 360 of file stencilTableFactory.h.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n
\n \n
\n
\n
\n \n

A simple reference to raw topology data for use with TopologyRefinerFactory. \n More...

\n \n-

#include <topologyDescriptor.h>

\n+

#include <topologyDescriptor.h>

\n \n \n \n \n

\n Classes

struct  FVarChannel
 
\n \n \n

\n@@ -148,15 +148,15 @@\n

FVarChannel const * fvarChannels
 
\n

Detailed Description

\n

A simple reference to raw topology data for use with TopologyRefinerFactory.

\n

TopologyDescriptor is a simple struct containing references to raw topology data used to construct a TopologyRefiner. It is not a requirement but a convenience for use with TopologyRefinerFactory when mesh topology is not available in an existing mesh data structure. It should be functionally complete and simple to use, but for more demanding situations, writing a custom Factory is usually warranted.

\n \n-

Definition at line 49 of file topologyDescriptor.h.

\n+

Definition at line 49 of file topologyDescriptor.h.

\n

Constructor & Destructor Documentation

\n \n

◆ TopologyDescriptor()

\n \n
\n
\n \n@@ -180,15 +180,15 @@\n
\n \n \n \n
Index const* cornerVertexIndices
\n
\n \n-

Definition at line 62 of file topologyDescriptor.h.

\n+

Definition at line 62 of file topologyDescriptor.h.

\n \n
\n
\n \n

◆ cornerWeights

\n \n
\n@@ -196,15 +196,15 @@\n \n \n \n \n
float const* cornerWeights
\n
\n \n-

Definition at line 63 of file topologyDescriptor.h.

\n+

Definition at line 63 of file topologyDescriptor.h.

\n \n
\n
\n \n

◆ creaseVertexIndexPairs

\n \n
\n@@ -212,15 +212,15 @@\n \n \n \n \n
Index const* creaseVertexIndexPairs
\n
\n \n-

Definition at line 58 of file topologyDescriptor.h.

\n+

Definition at line 58 of file topologyDescriptor.h.

\n \n
\n
\n \n

◆ creaseWeights

\n \n
\n@@ -228,15 +228,15 @@\n \n \n \n \n
float const* creaseWeights
\n
\n \n-

Definition at line 59 of file topologyDescriptor.h.

\n+

Definition at line 59 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ fvarChannels

\n \n
\n@@ -244,15 +244,15 @@\n \n \n \n \n
FVarChannel const* fvarChannels
\n
\n \n-

Definition at line 82 of file topologyDescriptor.h.

\n+

Definition at line 82 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ holeIndices

\n \n
\n@@ -260,15 +260,15 @@\n \n \n \n \n
Index const* holeIndices
\n
\n \n-

Definition at line 66 of file topologyDescriptor.h.

\n+

Definition at line 66 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ isLeftHanded

\n \n
\n@@ -276,15 +276,15 @@\n \n \n \n \n
bool isLeftHanded
\n
\n \n-

Definition at line 68 of file topologyDescriptor.h.

\n+

Definition at line 68 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numCorners

\n \n
\n@@ -292,15 +292,15 @@\n \n \n \n \n
int numCorners
\n
\n \n-

Definition at line 61 of file topologyDescriptor.h.

\n+

Definition at line 61 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numCreases

\n \n
\n@@ -308,15 +308,15 @@\n \n \n \n \n
int numCreases
\n
\n \n-

Definition at line 57 of file topologyDescriptor.h.

\n+

Definition at line 57 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numFaces

\n \n
\n@@ -324,15 +324,15 @@\n \n \n \n \n
int numFaces
\n
\n \n-

Definition at line 52 of file topologyDescriptor.h.

\n+

Definition at line 52 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numFVarChannels

\n \n
\n@@ -340,15 +340,15 @@\n \n \n \n \n
int numFVarChannels
\n
\n \n-

Definition at line 81 of file topologyDescriptor.h.

\n+

Definition at line 81 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numHoles

\n \n
\n@@ -356,15 +356,15 @@\n \n \n \n \n
int numHoles
\n
\n \n-

Definition at line 65 of file topologyDescriptor.h.

\n+

Definition at line 65 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numVertices

\n \n
\n@@ -372,15 +372,15 @@\n \n \n \n \n
int numVertices
\n
\n \n-

Definition at line 51 of file topologyDescriptor.h.

\n+

Definition at line 51 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numVertsPerFace

\n \n
\n@@ -388,15 +388,15 @@\n \n \n \n \n
int const* numVertsPerFace
\n
\n \n-

Definition at line 54 of file topologyDescriptor.h.

\n+

Definition at line 54 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ vertIndicesPerFace

\n \n
\n@@ -404,20 +404,20 @@\n \n \n \n \n
Index const* vertIndicesPerFace
\n
\n \n-

Definition at line 55 of file topologyDescriptor.h.

\n+

Definition at line 55 of file topologyDescriptor.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
TopologyDescriptor::FVarChannel Struct Reference
\n \n
\n \n-

#include <topologyDescriptor.h>

\n+

#include <topologyDescriptor.h>

\n \n \n \n \n

\n Public Member Functions

 FVarChannel ()
 
\n \n \n \n \n

\n@@ -111,15 +111,15 @@\n

int numValues
 
Index const * valueIndices
 
\n

Detailed Description

\n
\n-

Definition at line 73 of file topologyDescriptor.h.

\n+

Definition at line 73 of file topologyDescriptor.h.

\n

Constructor & Destructor Documentation

\n \n

◆ FVarChannel()

\n \n
\n
\n \n@@ -136,15 +136,15 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 78 of file topologyDescriptor.h.

\n+

Definition at line 78 of file topologyDescriptor.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ numValues

\n \n@@ -153,15 +153,15 @@\n \n \n \n \n
int numValues
\n
\n \n-

Definition at line 75 of file topologyDescriptor.h.

\n+

Definition at line 75 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ valueIndices

\n \n
\n@@ -169,20 +169,20 @@\n \n \n \n \n
Index const* valueIndices
\n
\n \n-

Definition at line 76 of file topologyDescriptor.h.

\n+

Definition at line 76 of file topologyDescriptor.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

OpenCL stencil table. \n More...

\n \n-

#include <clEvaluator.h>

\n+

#include <clEvaluator.h>

\n \n \n \n \n \n \n@@ -143,15 +143,15 @@\n \n

\n Public Member Functions

 CLStencilTable (Far::StencilTable const *stencilTable, cl_context clContext)
 
 CLStencilTable (Far::LimitStencilTable const *limitStencilTable, cl_context clContext)
 
 
\n

Detailed Description

\n

OpenCL stencil table.

\n

This class is an OpenCL buffer representation of Far::StencilTable.

\n

CLCompute consumes this table to apply stencils

\n \n-

Definition at line 52 of file clEvaluator.h.

\n+

Definition at line 52 of file clEvaluator.h.

\n

Constructor & Destructor Documentation

\n \n

◆ CLStencilTable() [1/2]

\n \n
\n
\n \n@@ -255,15 +255,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 61 of file clEvaluator.h.

\n+

Definition at line 61 of file clEvaluator.h.

\n \n
\n
\n \n

◆ Create() [2/2]

\n \n
\n@@ -295,15 +295,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 55 of file clEvaluator.h.

\n+

Definition at line 55 of file clEvaluator.h.

\n \n
\n
\n \n

◆ GetDuuWeightsBuffer()

\n \n
\n@@ -322,15 +322,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 80 of file clEvaluator.h.

\n+

Definition at line 80 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetDuvWeightsBuffer()

\n \n
\n@@ -349,15 +349,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 81 of file clEvaluator.h.

\n+

Definition at line 81 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetDuWeightsBuffer()

\n \n
\n@@ -376,15 +376,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 78 of file clEvaluator.h.

\n+

Definition at line 78 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetDvvWeightsBuffer()

\n \n
\n@@ -403,15 +403,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 82 of file clEvaluator.h.

\n+

Definition at line 82 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetDvWeightsBuffer()

\n \n
\n@@ -430,15 +430,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 79 of file clEvaluator.h.

\n+

Definition at line 79 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetIndicesBuffer()

\n \n
\n@@ -457,15 +457,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 76 of file clEvaluator.h.

\n+

Definition at line 76 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetNumStencils()

\n \n
\n@@ -484,15 +484,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 83 of file clEvaluator.h.

\n+

Definition at line 83 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetOffsetsBuffer()

\n \n
\n@@ -511,15 +511,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 75 of file clEvaluator.h.

\n+

Definition at line 75 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetSizesBuffer()

\n \n
\n@@ -538,15 +538,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 74 of file clEvaluator.h.

\n+

Definition at line 74 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetWeightsBuffer()

\n \n
\n@@ -565,20 +565,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 77 of file clEvaluator.h.

\n+

Definition at line 77 of file clEvaluator.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
CLEvaluator Class Reference
\n \n
\n \n-

#include <clEvaluator.h>

\n+

#include <clEvaluator.h>

\n \n \n \n \n

\n Public Types

typedef bool Instantiatable
 
\n \n \n \n \n

\n@@ -245,29 +245,29 @@\n

 Wait the OpenCL kernels finish.
 
static void Synchronize (cl_command_queue queue)
 
\n

Detailed Description

\n
\n-

Definition at line 100 of file clEvaluator.h.

\n+

Definition at line 100 of file clEvaluator.h.

\n

Member Typedef Documentation

\n \n

◆ Instantiatable

\n \n
\n
\n \n \n \n \n
typedef bool Instantiatable
\n
\n \n-

Definition at line 102 of file clEvaluator.h.

\n+

Definition at line 102 of file clEvaluator.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ CLEvaluator()

\n \n@@ -452,15 +452,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 145 of file clEvaluator.h.

\n+

Definition at line 145 of file clEvaluator.h.

\n \n
\n \n \n

◆ Create() [2/4]

\n \n
\n@@ -530,15 +530,15 @@\n inlinestatic \n \n \n
\n \n

Generic creator template.

\n \n-

Definition at line 131 of file clEvaluator.h.

\n+

Definition at line 131 of file clEvaluator.h.

\n \n
\n \n \n

◆ Create() [3/4]

\n \n
\n@@ -592,15 +592,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 116 of file clEvaluator.h.

\n+

Definition at line 116 of file clEvaluator.h.

\n \n
\n \n \n

◆ Create() [4/4]

\n \n
\n@@ -652,15 +652,15 @@\n inlinestatic \n \n \n
\n \n

Generic creator template.

\n \n-

Definition at line 106 of file clEvaluator.h.

\n+

Definition at line 106 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [1/8]

\n \n
\n@@ -1101,15 +1101,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1125 of file clEvaluator.h.

\n+

Definition at line 1125 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [4/8]

\n \n
\n@@ -1276,15 +1276,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1379 of file clEvaluator.h.

\n+

Definition at line 1379 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [5/8]

\n \n
\n@@ -1423,15 +1423,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1003 of file clEvaluator.h.

\n+

Definition at line 1003 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [6/8]

\n \n
\n@@ -1556,15 +1556,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1288 of file clEvaluator.h.

\n+

Definition at line 1288 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [7/8]

\n \n
\n@@ -1678,15 +1678,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 902 of file clEvaluator.h.

\n+

Definition at line 902 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [8/8]

\n \n
\n@@ -1783,15 +1783,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1217 of file clEvaluator.h.

\n+

Definition at line 1217 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [1/6]

\n \n
\n@@ -1979,15 +1979,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2437 of file clEvaluator.h.

\n+

Definition at line 2437 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [2/6]

\n \n
\n@@ -2161,15 +2161,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2564 of file clEvaluator.h.

\n+

Definition at line 2564 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [3/6]

\n \n
\n@@ -2315,15 +2315,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2231 of file clEvaluator.h.

\n+

Definition at line 2231 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [4/6]

\n \n
\n@@ -2455,15 +2455,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2329 of file clEvaluator.h.

\n+

Definition at line 2329 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [5/6]

\n \n
\n@@ -2581,15 +2581,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2061 of file clEvaluator.h.

\n+

Definition at line 2061 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [6/6]

\n \n
\n@@ -2693,15 +2693,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2143 of file clEvaluator.h.

\n+

Definition at line 2143 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [1/6]

\n \n
\n@@ -2882,15 +2882,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1854 of file clEvaluator.h.

\n+

Definition at line 1854 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [2/6]

\n \n
\n@@ -3057,15 +3057,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1978 of file clEvaluator.h.

\n+

Definition at line 1978 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [3/6]

\n \n
\n@@ -3204,15 +3204,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1653 of file clEvaluator.h.

\n+

Definition at line 1653 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [4/6]

\n \n
\n@@ -3337,15 +3337,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1749 of file clEvaluator.h.

\n+

Definition at line 1749 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [5/6]

\n \n
\n@@ -3456,15 +3456,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1489 of file clEvaluator.h.

\n+

Definition at line 1489 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [6/6]

\n \n
\n@@ -3561,15 +3561,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1568 of file clEvaluator.h.

\n+

Definition at line 1568 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [1/9]

\n \n
\n@@ -4206,15 +4206,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 421 of file clEvaluator.h.

\n+

Definition at line 421 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [5/9]

\n \n
\n@@ -4367,15 +4367,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 646 of file clEvaluator.h.

\n+

Definition at line 646 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [6/9]

\n \n
\n@@ -4500,15 +4500,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 309 of file clEvaluator.h.

\n+

Definition at line 309 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [7/9]

\n \n
\n@@ -4619,15 +4619,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 561 of file clEvaluator.h.

\n+

Definition at line 561 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [8/9]

\n \n
\n@@ -4727,15 +4727,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 219 of file clEvaluator.h.

\n+

Definition at line 219 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [9/9]

\n \n
\n@@ -4818,15 +4818,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 500 of file clEvaluator.h.

\n+

Definition at line 500 of file clEvaluator.h.

\n \n
\n \n \n

◆ Synchronize() [1/2]

\n \n
\n@@ -4876,20 +4876,20 @@\n inlinestatic \n \n \n
\n \n

Wait the OpenCL kernels finish.

\n \n-

Definition at line 2613 of file clEvaluator.h.

\n+

Definition at line 2613 of file clEvaluator.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • CLEvaluator
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01149.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01149.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    CLVertexBuffer Class Reference
    \n
\n
\n \n

Concrete vertex buffer class for OpenCL subdivision. \n More...

\n \n-

#include <clVertexBuffer.h>

\n+

#include <clVertexBuffer.h>

\n \n \n \n \n \n \n@@ -142,15 +142,15 @@\n \n \n

\n Public Member Functions

 ~CLVertexBuffer ()
 Destructor.
 
void UpdateData (const float *src, int startVertex, int numVertices, cl_command_queue clQueue, cl_event *startEvents=NULL, unsigned int numStartEvents=0, cl_event *endEvent=NULL)
bool allocate (cl_context clContext)
 
\n

Detailed Description

\n

Concrete vertex buffer class for OpenCL subdivision.

\n

CLVertexBuffer implements CLVertexBufferInterface. An instance of this buffer class can be passed to CLEvaluator

\n \n-

Definition at line 42 of file clVertexBuffer.h.

\n+

Definition at line 42 of file clVertexBuffer.h.

\n

Constructor & Destructor Documentation

\n \n

◆ ~CLVertexBuffer()

\n \n
\n
\n \n@@ -341,15 +341,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 49 of file clVertexBuffer.h.

\n+

Definition at line 49 of file clVertexBuffer.h.

\n \n
\n
\n \n

◆ GetNumElements()

\n \n
\n@@ -508,20 +508,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 63 of file clVertexBuffer.h.

\n+

Definition at line 63 of file clVertexBuffer.h.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • CLVertexBuffer
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01153.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01153.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    CpuD3D11VertexBuffer Class Reference
    \n
\n
\n \n

Concrete vertex buffer class for Cpu subdivision and DirectX drawing. \n More...

\n \n-

#include <cpuD3D11VertexBuffer.h>

\n+

#include <cpuD3D11VertexBuffer.h>

\n \n \n \n \n \n \n@@ -143,15 +143,15 @@\n \n

\n Public Member Functions

virtual ~CpuD3D11VertexBuffer ()
 Destructor.
 
void UpdateData (const float *src, int startVertex, int numVertices, void *deviceContext=NULL)
 
\n

Detailed Description

\n

Concrete vertex buffer class for Cpu subdivision and DirectX drawing.

\n

CpuD3D11VertexBuffer implements CpuVertexBufferInterface and D3D11VertexBufferInterface.

\n

An instance of this buffer class can be passed to CpuEvaluator.

\n \n-

Definition at line 48 of file cpuD3D11VertexBuffer.h.

\n+

Definition at line 48 of file cpuD3D11VertexBuffer.h.

\n

Constructor & Destructor Documentation

\n \n

◆ ~CpuD3D11VertexBuffer()

\n \n
\n
\n \n@@ -302,15 +302,15 @@\n inline\n \n
\n
\n \n

Returns the D3D11 buffer object (for Osd::Mesh interface)

\n \n-

Definition at line 75 of file cpuD3D11VertexBuffer.h.

\n+

Definition at line 75 of file cpuD3D11VertexBuffer.h.

\n \n
\n
\n \n

◆ Create()

\n \n
\n@@ -430,15 +430,15 @@\n \n
\n

This method is meant to be used in client code in order to provide coarse vertices data to Osd.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • CpuD3D11VertexBuffer
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01173.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01173.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    CudaStencilTable Class Reference
    \n
\n
\n \n

CUDA stencil table. \n More...

\n \n-

#include <cudaEvaluator.h>

\n+

#include <cudaEvaluator.h>

\n \n \n \n \n \n \n@@ -141,15 +141,15 @@\n \n

\n Public Member Functions

 CudaStencilTable (Far::StencilTable const *stencilTable)
 
 CudaStencilTable (Far::LimitStencilTable const *limitStencilTable)
 
 
\n

Detailed Description

\n

CUDA stencil table.

\n

This class is a cuda buffer representation of Far::StencilTable.

\n

CudaEvaluator consumes this table to apply stencils

\n \n-

Definition at line 52 of file cudaEvaluator.h.

\n+

Definition at line 52 of file cudaEvaluator.h.

\n

Constructor & Destructor Documentation

\n \n

◆ CudaStencilTable() [1/2]

\n \n
\n
\n \n@@ -247,15 +247,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 59 of file cudaEvaluator.h.

\n+

Definition at line 59 of file cudaEvaluator.h.

\n \n
\n
\n \n

◆ Create() [2/2]

\n \n
\n@@ -285,15 +285,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 54 of file cudaEvaluator.h.

\n+

Definition at line 54 of file cudaEvaluator.h.

\n \n
\n
\n \n

◆ GetDuuWeightsBuffer()

\n \n
\n@@ -312,15 +312,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 76 of file cudaEvaluator.h.

\n+

Definition at line 76 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ GetDuvWeightsBuffer()

\n \n
\n@@ -339,15 +339,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 77 of file cudaEvaluator.h.

\n+

Definition at line 77 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ GetDuWeightsBuffer()

\n \n
\n@@ -366,15 +366,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 74 of file cudaEvaluator.h.

\n+

Definition at line 74 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ GetDvvWeightsBuffer()

\n \n
\n@@ -393,15 +393,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 78 of file cudaEvaluator.h.

\n+

Definition at line 78 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ GetDvWeightsBuffer()

\n \n
\n@@ -420,15 +420,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 75 of file cudaEvaluator.h.

\n+

Definition at line 75 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ GetIndicesBuffer()

\n \n
\n@@ -447,15 +447,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 72 of file cudaEvaluator.h.

\n+

Definition at line 72 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ GetNumStencils()

\n \n
\n@@ -474,15 +474,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 79 of file cudaEvaluator.h.

\n+

Definition at line 79 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ GetOffsetsBuffer()

\n \n
\n@@ -501,15 +501,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 71 of file cudaEvaluator.h.

\n+

Definition at line 71 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ GetSizesBuffer()

\n \n
\n@@ -528,15 +528,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 70 of file cudaEvaluator.h.

\n+

Definition at line 70 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ GetWeightsBuffer()

\n \n
\n@@ -555,20 +555,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 73 of file cudaEvaluator.h.

\n+

Definition at line 73 of file cudaEvaluator.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
\n \n-

#include <cudaEvaluator.h>

\n+

#include <cudaEvaluator.h>

\n \n \n \n \n \n \n@@ -169,15 +169,15 @@\n \n \n \n \n

\n Static Public Member Functions

template<typename SRC_BUFFER , typename DST_BUFFER , typename STENCIL_TABLE >
static bool EvalStencils (SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, const void *instance=NULL, void *deviceContext=NULL)
 Generic static compute function. This function has a same signature as other device kernels have so that it can be called transparently from OsdMesh template interface.
 
 Generic limit eval function. This function has a same signature as other device kernels have so that it can be called in the same way.
 
static void Synchronize (void *deviceContext=NULL)
 
\n

Detailed Description

\n
\n-

Definition at line 94 of file cudaEvaluator.h.

\n+

Definition at line 94 of file cudaEvaluator.h.

\n

Member Function Documentation

\n \n

◆ EvalPatches() [1/6]

\n \n
\n
\n \n@@ -715,15 +715,15 @@\n \n \n \n
patchTableCudaPatchTable or equivalent
instancenot used in the cuda evaluator
deviceContextnot used in the cuda evaluator
\n \n \n \n-

Definition at line 648 of file cudaEvaluator.h.

\n+

Definition at line 648 of file cudaEvaluator.h.

\n \n
\n
\n \n

◆ EvalPatches() [5/6]

\n \n
\n@@ -841,15 +841,15 @@\n patchTableCudaPatchTable or equivalent\n instancenot used in the cuda evaluator\n deviceContextnot used in the cuda evaluator \n \n \n \n \n-

Definition at line 565 of file cudaEvaluator.h.

\n+

Definition at line 565 of file cudaEvaluator.h.

\n \n
\n
\n \n

◆ EvalPatches() [6/6]

\n \n
\n@@ -942,15 +942,15 @@\n patchTableCudaPatchTable or equivalent\n instancenot used in the cuda evaluator\n deviceContextnot used in the cuda evaluator \n \n \n \n \n-

Definition at line 504 of file cudaEvaluator.h.

\n+

Definition at line 504 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [1/3]

\n \n
\n@@ -1117,15 +1117,15 @@\n fvarChannelface-varying channel\n instancenot used in the cuda evaluator\n deviceContextnot used in the cuda evaluator \n \n \n \n \n-

Definition at line 1224 of file cudaEvaluator.h.

\n+

Definition at line 1224 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [2/3]

\n \n
\n@@ -1250,15 +1250,15 @@\n fvarChannelface-varying channel\n instancenot used in the cuda evaluator\n deviceContextnot used in the cuda evaluator \n \n \n \n \n-

Definition at line 1136 of file cudaEvaluator.h.

\n+

Definition at line 1136 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [3/3]

\n \n
\n@@ -1355,15 +1355,15 @@\n fvarChannelface-varying channel\n instancenot used in the cuda evaluator\n deviceContextnot used in the cuda evaluator \n \n \n \n \n-

Definition at line 1070 of file cudaEvaluator.h.

\n+

Definition at line 1070 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [1/3]

\n \n
\n@@ -1523,15 +1523,15 @@\n patchTableCudaPatchTable or equivalent\n instancenot used in the cuda evaluator\n deviceContextnot used in the cuda evaluator \n \n \n \n \n-

Definition at line 1007 of file cudaEvaluator.h.

\n+

Definition at line 1007 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [2/3]

\n \n
\n@@ -1649,15 +1649,15 @@\n patchTableCudaPatchTable or equivalent\n instancenot used in the cuda evaluator\n deviceContextnot used in the cuda evaluator \n \n \n \n \n-

Definition at line 922 of file cudaEvaluator.h.

\n+

Definition at line 922 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [3/3]

\n \n
\n@@ -1747,15 +1747,15 @@\n patchTableCudaPatchTable or equivalent\n instancenot used in the cuda evaluator\n deviceContextnot used in the cuda evaluator \n \n \n \n \n-

Definition at line 859 of file cudaEvaluator.h.

\n+

Definition at line 859 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [1/6]

\n \n
\n@@ -2351,15 +2351,15 @@\n stencilTablestencil table to be applied.\n instancenot used in the cuda kernel (declared as a typed pointer to prevent undesirable template resolution)\n deviceContextnot used in the cuda kernel \n \n \n \n \n-

Definition at line 353 of file cudaEvaluator.h.

\n+

Definition at line 353 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [5/6]

\n \n
\n@@ -2463,15 +2463,15 @@\n stencilTablestencil table to be applied.\n instancenot used in the cuda kernel (declared as a typed pointer to prevent undesirable template resolution)\n deviceContextnot used in the cuda kernel \n \n \n \n \n-

Definition at line 218 of file cudaEvaluator.h.

\n+

Definition at line 218 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [6/6]

\n \n
\n@@ -2550,15 +2550,15 @@\n stencilTablestencil table to be applied. The table must have Cuda memory interfaces.\n instancenot used in the CudaEvaluator\n deviceContextnot used in the CudaEvaluator \n \n \n \n \n-

Definition at line 126 of file cudaEvaluator.h.

\n+

Definition at line 126 of file cudaEvaluator.h.

\n \n
\n \n \n

◆ Synchronize()

\n \n
\n@@ -2584,15 +2584,15 @@\n
\n

Other methods

\n
\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • CudaEvaluator
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01189.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01189.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    D3D11StencilTable Class Reference
    \n
\n
\n \n

D3D11 stencil table. \n More...

\n \n-

#include <d3d11ComputeEvaluator.h>

\n+

#include <d3d11ComputeEvaluator.h>

\n \n \n \n \n \n \n@@ -130,15 +130,15 @@\n \n

\n Public Member Functions

 D3D11StencilTable (Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
 
 ~D3D11StencilTable ()
 
 
\n

Detailed Description

\n

D3D11 stencil table.

\n

This class is a D3D11 Shader Resource View representation of Far::StencilTable.

\n

D3D11ComputeEvaluator consumes this table to apply stencils

\n \n-

Definition at line 56 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 56 of file d3d11ComputeEvaluator.h.

\n

Constructor & Destructor Documentation

\n \n

◆ D3D11StencilTable()

\n \n
\n
\n \n@@ -214,15 +214,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 59 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 59 of file d3d11ComputeEvaluator.h.

\n \n
\n
\n \n

◆ Create() [2/2]

\n \n
\n@@ -252,15 +252,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 64 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 64 of file d3d11ComputeEvaluator.h.

\n \n
\n
\n \n

◆ GetIndicesSRV()

\n \n
\n@@ -279,15 +279,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 77 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 77 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ GetNumStencils()

\n \n
\n@@ -306,15 +306,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 79 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 79 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ GetOffsetsSRV()

\n \n
\n@@ -333,15 +333,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 76 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 76 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ GetSizesSRV()

\n \n
\n@@ -360,15 +360,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 75 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 75 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ GetWeightsSRV()

\n \n
\n@@ -387,20 +387,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 78 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 78 of file d3d11ComputeEvaluator.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
D3D11ComputeEvaluator Class Reference
\n \n
\n \n-

#include <d3d11ComputeEvaluator.h>

\n+

#include <d3d11ComputeEvaluator.h>

\n \n \n \n \n

\n Public Types

typedef bool Instantiatable
 
\n \n \n \n \n

\n@@ -136,29 +136,29 @@\n

 
static void Synchronize (ID3D11DeviceContext *deviceContext)
 Wait the dispatched kernel finishes.
 
\n

Detailed Description

\n
\n-

Definition at line 96 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 96 of file d3d11ComputeEvaluator.h.

\n

Member Typedef Documentation

\n \n

◆ Instantiatable

\n \n
\n
\n \n \n \n \n
typedef bool Instantiatable
\n
\n \n-

Definition at line 98 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 98 of file d3d11ComputeEvaluator.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ D3D11ComputeEvaluator()

\n \n@@ -519,15 +519,15 @@\n stencilTablestencil table to be applied. The table must have SSBO interfaces.\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextID3D11DeviceContext. \n \n \n \n \n-

Definition at line 148 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 148 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [3/3]

\n \n
\n@@ -584,15 +584,15 @@\n \n inline \n \n \n
\n

Dispatch the DX compute kernel on GPU asynchronously. returns false if the kernel hasn't been compiled yet.

\n \n-

Definition at line 181 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 181 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ Synchronize()

\n \n
\n@@ -617,15 +617,15 @@\n
\n \n

Wait the dispatched kernel finishes.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
GLLegacyGregoryPatchTable Class Reference
\n \n
\n \n-

#include <glLegacyGregoryPatchTable.h>

\n+

#include <glLegacyGregoryPatchTable.h>

\n
\n Inheritance diagram for GLLegacyGregoryPatchTable:
\n
\n
\n \"\"/\n
\n \n@@ -131,15 +131,15 @@\n \n \n \n

\n Protected Member Functions

 GLLegacyGregoryPatchTable ()
 
\n

Detailed Description

\n
\n-

Definition at line 39 of file glLegacyGregoryPatchTable.h.

\n+

Definition at line 39 of file glLegacyGregoryPatchTable.h.

\n

Constructor & Destructor Documentation

\n \n

◆ ~GLLegacyGregoryPatchTable()

\n \n
\n
\n \n@@ -226,15 +226,15 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 60 of file glLegacyGregoryPatchTable.h.

\n+

Definition at line 60 of file glLegacyGregoryPatchTable.h.

\n \n
\n
\n \n

◆ GetQuadOffsetsTextureBuffer()

\n \n
\n@@ -253,15 +253,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 56 of file glLegacyGregoryPatchTable.h.

\n+

Definition at line 56 of file glLegacyGregoryPatchTable.h.

\n \n
\n
\n \n

◆ GetVertexTextureBuffer()

\n \n
\n@@ -280,15 +280,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 48 of file glLegacyGregoryPatchTable.h.

\n+

Definition at line 48 of file glLegacyGregoryPatchTable.h.

\n \n
\n \n \n

◆ GetVertexValenceTextureBuffer()

\n \n
\n@@ -307,15 +307,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 52 of file glLegacyGregoryPatchTable.h.

\n+

Definition at line 52 of file glLegacyGregoryPatchTable.h.

\n \n
\n \n \n

◆ UpdateVertexBuffer()

\n \n
\n@@ -330,15 +330,15 @@\n \n \n
\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
GLPatchTable Class Reference
\n \n
\n \n-

#include <glPatchTable.h>

\n+

#include <glPatchTable.h>

\n
\n Inheritance diagram for GLPatchTable:
\n
\n
\n \"\"/\n
\n \n@@ -201,29 +201,29 @@\n \n \n \n \n
std::vector< GLuint > _fvarParamBuffers
 
std::vector< GLuint > _fvarParamTextures
 
\n

Detailed Description

\n
\n-

Definition at line 45 of file glPatchTable.h.

\n+

Definition at line 45 of file glPatchTable.h.

\n

Member Typedef Documentation

\n \n

◆ VertexBufferBinding

\n \n
\n
\n \n \n \n \n
typedef GLuint VertexBufferBinding
\n
\n \n-

Definition at line 47 of file glPatchTable.h.

\n+

Definition at line 47 of file glPatchTable.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ ~GLPatchTable()

\n \n@@ -351,15 +351,15 @@\n inline \n \n \n
\n \n

Returns the patch arrays for face-varying index buffer data.

\n \n-

Definition at line 98 of file glPatchTable.h.

\n+

Definition at line 98 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetFVarPatchIndexBuffer()

\n \n
\n@@ -381,15 +381,15 @@\n inline \n \n \n
\n \n

Returns the GL index buffer containing face-varying control vertices.

\n \n-

Definition at line 103 of file glPatchTable.h.

\n+

Definition at line 103 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetFVarPatchIndexTextureBuffer()

\n \n
\n@@ -411,15 +411,15 @@\n inline \n \n \n
\n \n

Returns the GL texture buffer containing face-varying control vertices.

\n \n-

Definition at line 108 of file glPatchTable.h.

\n+

Definition at line 108 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetFVarPatchParamBuffer()

\n \n
\n@@ -441,15 +441,15 @@\n inline \n \n \n
\n \n

Returns the GL index buffer containing face-varying patch params.

\n \n-

Definition at line 113 of file glPatchTable.h.

\n+

Definition at line 113 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetFVarPatchParamTextureBuffer()

\n \n
\n@@ -471,15 +471,15 @@\n inline \n \n \n
\n \n

Returns the GL texture buffer containing face-varying patch params.

\n \n-

Definition at line 118 of file glPatchTable.h.

\n+

Definition at line 118 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetNumFVarChannels()

\n \n
\n@@ -500,15 +500,15 @@\n inline \n \n \n
\n \n

Returns the number of face-varying channel buffers.

\n \n-

Definition at line 95 of file glPatchTable.h.

\n+

Definition at line 95 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetPatchArrays()

\n \n
\n@@ -529,15 +529,15 @@\n inline \n \n \n
\n \n

Returns the patch arrays for vertex index buffer data.

\n \n-

Definition at line 55 of file glPatchTable.h.

\n+

Definition at line 55 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetPatchIndexBuffer()

\n \n
\n@@ -558,15 +558,15 @@\n inline \n \n \n
\n \n

Returns the GL index buffer containing the patch control vertices.

\n \n-

Definition at line 60 of file glPatchTable.h.

\n+

Definition at line 60 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetPatchIndexTextureBuffer()

\n \n
\n@@ -587,15 +587,15 @@\n inline \n \n \n
\n \n

Returns the GL texture buffer containing the patch control vertices.

\n \n-

Definition at line 70 of file glPatchTable.h.

\n+

Definition at line 70 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetPatchParamBuffer()

\n \n
\n@@ -616,15 +616,15 @@\n inline \n \n \n
\n \n

Returns the GL index buffer containing the patch parameter.

\n \n-

Definition at line 65 of file glPatchTable.h.

\n+

Definition at line 65 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetPatchParamTextureBuffer()

\n \n
\n@@ -645,15 +645,15 @@\n inline \n \n \n
\n \n

Returns the GL texture buffer containing the patch parameter.

\n \n-

Definition at line 75 of file glPatchTable.h.

\n+

Definition at line 75 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetVaryingPatchArrays()

\n \n
\n@@ -674,15 +674,15 @@\n inline \n \n \n
\n \n

Returns the patch arrays for varying index buffer data.

\n \n-

Definition at line 80 of file glPatchTable.h.

\n+

Definition at line 80 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetVaryingPatchIndexBuffer()

\n \n
\n@@ -703,15 +703,15 @@\n inline \n \n \n
\n \n

Returns the GL index buffer containing the varying control vertices.

\n \n-

Definition at line 85 of file glPatchTable.h.

\n+

Definition at line 85 of file glPatchTable.h.

\n \n
\n \n \n

◆ GetVaryingPatchIndexTextureBuffer()

\n \n
\n@@ -732,15 +732,15 @@\n inline \n \n \n
\n \n

Returns the GL texture buffer containing the varying control vertices.

\n \n-

Definition at line 90 of file glPatchTable.h.

\n+

Definition at line 90 of file glPatchTable.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ _fvarIndexBuffers

\n \n@@ -757,15 +757,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 141 of file glPatchTable.h.

\n+

Definition at line 141 of file glPatchTable.h.

\n \n
\n \n \n

◆ _fvarIndexTextures

\n \n
\n@@ -781,15 +781,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 142 of file glPatchTable.h.

\n+

Definition at line 142 of file glPatchTable.h.

\n \n
\n \n \n

◆ _fvarParamBuffers

\n \n
\n@@ -805,15 +805,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 144 of file glPatchTable.h.

\n+

Definition at line 144 of file glPatchTable.h.

\n \n
\n \n \n

◆ _fvarParamTextures

\n \n
\n@@ -829,15 +829,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 145 of file glPatchTable.h.

\n+

Definition at line 145 of file glPatchTable.h.

\n \n
\n \n \n

◆ _fvarPatchArrays

\n \n
\n@@ -853,15 +853,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 140 of file glPatchTable.h.

\n+

Definition at line 140 of file glPatchTable.h.

\n \n
\n \n \n

◆ _patchArrays

\n \n
\n@@ -877,15 +877,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 128 of file glPatchTable.h.

\n+

Definition at line 128 of file glPatchTable.h.

\n \n
\n \n \n

◆ _patchIndexBuffer

\n \n
\n@@ -901,15 +901,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 130 of file glPatchTable.h.

\n+

Definition at line 130 of file glPatchTable.h.

\n \n
\n \n \n

◆ _patchIndexTexture

\n \n
\n@@ -925,15 +925,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 133 of file glPatchTable.h.

\n+

Definition at line 133 of file glPatchTable.h.

\n \n
\n \n \n

◆ _patchParamBuffer

\n \n
\n@@ -949,15 +949,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 131 of file glPatchTable.h.

\n+

Definition at line 131 of file glPatchTable.h.

\n \n
\n \n \n

◆ _patchParamTexture

\n \n
\n@@ -973,15 +973,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 134 of file glPatchTable.h.

\n+

Definition at line 134 of file glPatchTable.h.

\n \n
\n \n \n

◆ _varyingIndexBuffer

\n \n
\n@@ -997,15 +997,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 137 of file glPatchTable.h.

\n+

Definition at line 137 of file glPatchTable.h.

\n \n
\n \n \n

◆ _varyingIndexTexture

\n \n
\n@@ -1021,15 +1021,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 138 of file glPatchTable.h.

\n+

Definition at line 138 of file glPatchTable.h.

\n \n
\n \n \n

◆ _varyingPatchArrays

\n \n
\n@@ -1045,20 +1045,20 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 136 of file glPatchTable.h.

\n+

Definition at line 136 of file glPatchTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • GLPatchTable
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01237.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01237.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    GLVertexBuffer Class Reference
    \n
\n
\n \n

Concrete vertex buffer class for GLSL subdivision and OpenGL drawing. \n More...

\n \n-

#include <glVertexBuffer.h>

\n+

#include <glVertexBuffer.h>

\n \n \n \n \n \n \n@@ -136,15 +136,15 @@\n \n \n

\n Public Member Functions

 ~GLVertexBuffer ()
 Destructor.
 
void UpdateData (const float *src, int startVertex, int numVertices, void *deviceContext=NULL)
bool allocate ()
 
\n

Detailed Description

\n

Concrete vertex buffer class for GLSL subdivision and OpenGL drawing.

\n

GLVertexBuffer implements GLVertexBufferInterface. An instance of this buffer class can be passed to OsdGLComputeEvaluator.

\n \n-

Definition at line 44 of file glVertexBuffer.h.

\n+

Definition at line 44 of file glVertexBuffer.h.

\n

Constructor & Destructor Documentation

\n \n

◆ ~GLVertexBuffer()

\n \n
\n
\n \n@@ -366,15 +366,15 @@\n
\n
\n

This method is meant to be used in client code in order to provide coarse vertices data to Osd.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n \n \n
\n
\n
\n \n-

#include <hlslPatchShaderSource.h>

\n+

#include <hlslPatchShaderSource.h>

\n \n \n \n \n \n \n@@ -111,15 +111,15 @@\n \n \n \n \n

\n Static Public Member Functions

static std::string GetCommonShaderSource ()
 
static std::string GetPatchBasisShaderSource ()
 
static std::string GetHullShaderSource (Far::PatchDescriptor::Type type)
 
static std::string GetDomainShaderSource (Far::PatchDescriptor::Type type)
 
\n

Detailed Description

\n
\n-

Definition at line 37 of file hlslPatchShaderSource.h.

\n+

Definition at line 37 of file hlslPatchShaderSource.h.

\n

Member Function Documentation

\n \n

◆ GetCommonShaderSource()

\n \n
\n
\n \n@@ -242,15 +242,15 @@\n \n
\n
\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n \n \n
\n
\n
\n \n-

#include <mtlCommon.h>

\n+

#include <mtlCommon.h>

\n \n \n \n \n \n \n

\n Public Attributes

id< MTLDevice > device = nullptr
 
id< MTLCommandQueue > commandQueue = nullptr
 
\n

Detailed Description

\n
\n-

Definition at line 40 of file mtlCommon.h.

\n+

Definition at line 40 of file mtlCommon.h.

\n

Member Data Documentation

\n \n

◆ commandQueue

\n \n
\n
\n \n \n \n \n
id<MTLCommandQueue> commandQueue = nullptr
\n
\n \n-

Definition at line 43 of file mtlCommon.h.

\n+

Definition at line 43 of file mtlCommon.h.

\n \n
\n
\n \n

◆ device

\n \n
\n@@ -135,20 +135,20 @@\n \n \n \n \n
id<MTLDevice> device = nullptr
\n
\n \n-

Definition at line 42 of file mtlCommon.h.

\n+

Definition at line 42 of file mtlCommon.h.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
\n \n-

#include <mtlPatchShaderSource.h>

\n+

#include <mtlPatchShaderSource.h>

\n \n \n \n \n \n \n@@ -118,15 +118,15 @@\n \n \n \n \n

\n Static Public Member Functions

static std::string GetCommonShaderSource ()
 
static std::string GetPatchBasisShaderSource ()
 
static std::string GetHullShaderSource (Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
 
static std::string GetDomainShaderSource (Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
 
\n

Detailed Description

\n
\n-

Definition at line 37 of file mtlPatchShaderSource.h.

\n+

Definition at line 37 of file mtlPatchShaderSource.h.

\n

Member Function Documentation

\n \n

◆ GetCommonShaderSource()

\n \n
\n
\n \n@@ -360,15 +360,15 @@\n \n

Deprecated.

\n

These methods are deprecated. Clients should determine the patch type of a face-varying patch by inspecting the face-varying patch array descriptors.

\n \n \n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
\n \n-

#include <ompEvaluator.h>

\n+

#include <ompEvaluator.h>

\n
\n \n \n \n \n \n@@ -171,15 +171,15 @@\n \n \n \n \n

\n Static Public Member Functions

template<typename SRC_BUFFER , typename DST_BUFFER , typename STENCIL_TABLE >
static bool EvalStencils (SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, const OmpEvaluator *instance=NULL, void *deviceContext=NULL)
 Generic static eval stencils function. This function has a same signature as other device kernels have so that it can be called in the same way from OsdMesh template interface.
 
static void Synchronize (void *deviceContext=NULL)
 
static void SetNumThreads (int numThreads)
 
\n

Detailed Description

\n
\n-

Definition at line 39 of file ompEvaluator.h.

\n+

Definition at line 39 of file ompEvaluator.h.

\n

Member Function Documentation

\n \n

◆ EvalPatches() [1/6]

\n \n
\n
\n \n@@ -717,15 +717,15 @@\n \n \n \n
patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch
instancenot used in the omp evaluator
deviceContextnot used in the omp evaluator
\n \n \n \n-

Definition at line 607 of file ompEvaluator.h.

\n+

Definition at line 607 of file ompEvaluator.h.

\n \n
\n
\n \n

◆ EvalPatches() [5/6]

\n \n
\n@@ -843,15 +843,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the omp evaluator\n deviceContextnot used in the omp evaluator \n \n \n \n \n-

Definition at line 517 of file ompEvaluator.h.

\n+

Definition at line 517 of file ompEvaluator.h.

\n \n
\n
\n \n

◆ EvalPatches() [6/6]

\n \n
\n@@ -944,15 +944,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the omp evaluator\n deviceContextnot used in the omp evaluator \n \n \n \n \n-

Definition at line 454 of file ompEvaluator.h.

\n+

Definition at line 454 of file ompEvaluator.h.

\n \n
\n
\n \n

◆ EvalPatchesFaceVarying() [1/3]

\n \n
\n@@ -1119,15 +1119,15 @@\n fvarChannelface-varying channel\n instancenot used in the omp evaluator\n deviceContextnot used in the omp evaluator \n \n \n \n \n-

Definition at line 1188 of file ompEvaluator.h.

\n+

Definition at line 1188 of file ompEvaluator.h.

\n \n
\n
\n \n

◆ EvalPatchesFaceVarying() [2/3]

\n \n
\n@@ -1252,15 +1252,15 @@\n fvarChannelface-varying channel\n instancenot used in the omp evaluator\n deviceContextnot used in the omp evaluator \n \n \n \n \n-

Definition at line 1100 of file ompEvaluator.h.

\n+

Definition at line 1100 of file ompEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [3/3]

\n \n
\n@@ -1357,15 +1357,15 @@\n fvarChannelface-varying channel\n instancenot used in the omp evaluator\n deviceContextnot used in the omp evaluator \n \n \n \n \n-

Definition at line 1034 of file ompEvaluator.h.

\n+

Definition at line 1034 of file ompEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [1/3]

\n \n
\n@@ -1525,15 +1525,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the omp evaluator\n deviceContextnot used in the omp evaluator \n \n \n \n \n-

Definition at line 971 of file ompEvaluator.h.

\n+

Definition at line 971 of file ompEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [2/3]

\n \n
\n@@ -1651,15 +1651,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the omp evaluator\n deviceContextnot used in the omp evaluator \n \n \n \n \n-

Definition at line 886 of file ompEvaluator.h.

\n+

Definition at line 886 of file ompEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [3/3]

\n \n
\n@@ -1749,15 +1749,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the omp evaluator\n deviceContextnot used in the omp evaluator \n \n \n \n \n-

Definition at line 823 of file ompEvaluator.h.

\n+

Definition at line 823 of file ompEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [1/6]

\n \n
\n@@ -2353,15 +2353,15 @@\n stencilTableFar::StencilTable or equivalent\n instancenot used in the omp kernel (declared as a typed pointer to prevent undesirable template resolution)\n deviceContextnot used in the omp kernel \n \n \n \n \n-

Definition at line 303 of file ompEvaluator.h.

\n+

Definition at line 303 of file ompEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [5/6]

\n \n
\n@@ -2465,15 +2465,15 @@\n stencilTableFar::StencilTable or equivalent\n instancenot used in the omp kernel (declared as a typed pointer to prevent undesirable template resolution)\n deviceContextnot used in the omp kernel \n \n \n \n \n-

Definition at line 168 of file ompEvaluator.h.

\n+

Definition at line 168 of file ompEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [6/6]

\n \n
\n@@ -2552,15 +2552,15 @@\n stencilTableFar::StencilTable or equivalent\n instancenot used in the omp kernel (declared as a typed pointer to prevent undesirable template resolution)\n deviceContextnot used in the omp kernel \n \n \n \n \n-

Definition at line 72 of file ompEvaluator.h.

\n+

Definition at line 72 of file ompEvaluator.h.

\n \n
\n \n \n

◆ SetNumThreads()

\n \n
\n@@ -2612,15 +2612,15 @@\n
\n

Other methods

\n
\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • OmpEvaluator
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01333.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01333.html", "unified_diff": "@@ -369,15 +369,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 84 of file bilinearScheme.h.

\n+

Definition at line 84 of file bilinearScheme.h.

\n \n
\n \n \n

◆ assignCornerLimitMask() [2/4]

\n \n
\n@@ -407,15 +407,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 208 of file catmarkScheme.h.

\n+

Definition at line 208 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCornerLimitMask() [3/4]

\n \n
\n@@ -529,15 +529,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 118 of file bilinearScheme.h.

\n+

Definition at line 118 of file bilinearScheme.h.

\n \n
\n \n \n

◆ assignCornerLimitTangentMasks() [2/4]

\n \n
\n@@ -619,15 +619,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 301 of file catmarkScheme.h.

\n+

Definition at line 301 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCornerLimitTangentMasks() [4/4]

\n \n
\n@@ -833,15 +833,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 221 of file catmarkScheme.h.

\n+

Definition at line 221 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCreaseLimitMask() [3/4]

\n \n
\n@@ -921,15 +921,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 97 of file bilinearScheme.h.

\n+

Definition at line 97 of file bilinearScheme.h.

\n \n
\n \n \n

◆ assignCreaseLimitTangentMasks() [1/4]

\n \n
\n@@ -1023,15 +1023,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 334 of file catmarkScheme.h.

\n+

Definition at line 334 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCreaseLimitTangentMasks() [3/4]

\n \n
\n@@ -1123,15 +1123,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 143 of file bilinearScheme.h.

\n+

Definition at line 143 of file bilinearScheme.h.

\n \n
\n \n \n

◆ assignCreaseMaskForEdge() [1/2]

\n \n
\n@@ -1293,15 +1293,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 148 of file catmarkScheme.h.

\n+

Definition at line 148 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCreaseMaskForVertex() [3/3]

\n \n
\n@@ -1415,15 +1415,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 106 of file bilinearScheme.h.

\n+

Definition at line 106 of file bilinearScheme.h.

\n \n
\n \n \n

◆ assignSmoothLimitMask() [3/4]

\n \n
\n@@ -1453,15 +1453,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 247 of file catmarkScheme.h.

\n+

Definition at line 247 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignSmoothLimitMask() [4/4]

\n \n
\n@@ -1581,15 +1581,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 152 of file bilinearScheme.h.

\n+

Definition at line 152 of file bilinearScheme.h.

\n \n
\n \n \n

◆ assignSmoothLimitTangentMasks() [3/4]

\n \n
\n@@ -1625,15 +1625,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 453 of file catmarkScheme.h.

\n+

Definition at line 453 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignSmoothLimitTangentMasks() [4/4]

\n \n
\n@@ -1707,15 +1707,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 71 of file catmarkScheme.h.

\n+

Definition at line 71 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignSmoothMaskForEdge() [2/3]

\n \n
\n@@ -1863,15 +1863,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 173 of file catmarkScheme.h.

\n+

Definition at line 173 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignSmoothMaskForVertex() [3/3]

\n \n
\n@@ -1943,15 +1943,15 @@\n \n )\n const\n \n \n
\n \n-

Definition at line 62 of file bilinearScheme.h.

\n+

Definition at line 62 of file bilinearScheme.h.

\n \n
\n \n \n

◆ ComputeEdgeVertexMask() [2/2]

\n \n
\n@@ -2166,15 +2166,15 @@\n \n )\n const\n \n \n
\n \n-

Definition at line 71 of file bilinearScheme.h.

\n+

Definition at line 71 of file bilinearScheme.h.

\n \n
\n \n \n

◆ ComputeVertexVertexMask() [2/2]

\n \n
\n@@ -2241,15 +2241,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 53 of file bilinearScheme.h.

\n+

Definition at line 53 of file bilinearScheme.h.

\n \n
\n \n \n

◆ GetLocalNeighborhoodSize() [2/4]

\n \n
\n@@ -2268,15 +2268,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 56 of file catmarkScheme.h.

\n+

Definition at line 56 of file catmarkScheme.h.

\n \n
\n \n \n

◆ GetLocalNeighborhoodSize() [3/4]

\n \n
\n@@ -2378,15 +2378,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 47 of file bilinearScheme.h.

\n+

Definition at line 47 of file bilinearScheme.h.

\n \n
\n \n \n

◆ GetRegularFaceSize() [2/4]

\n \n
\n@@ -2405,15 +2405,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 50 of file catmarkScheme.h.

\n+

Definition at line 50 of file catmarkScheme.h.

\n \n
\n \n \n

◆ GetRegularFaceSize() [3/4]

\n \n
\n@@ -2486,15 +2486,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 50 of file bilinearScheme.h.

\n+

Definition at line 50 of file bilinearScheme.h.

\n \n
\n \n \n

◆ GetRegularVertexValence() [2/4]

\n \n
\n@@ -2513,15 +2513,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 53 of file catmarkScheme.h.

\n+

Definition at line 53 of file catmarkScheme.h.

\n \n
\n \n \n

◆ GetRegularVertexValence() [3/4]

\n \n
\n@@ -2594,15 +2594,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 44 of file bilinearScheme.h.

\n+

Definition at line 44 of file bilinearScheme.h.

\n \n
\n \n \n

◆ GetTopologicalSplitType() [2/4]

\n \n
\n@@ -2621,15 +2621,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 47 of file catmarkScheme.h.

\n+

Definition at line 47 of file catmarkScheme.h.

\n \n
\n \n \n

◆ GetTopologicalSplitType() [3/4]

\n \n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_2483050b711c1829a6434006d0beb10c.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_2483050b711c1829a6434006d0beb10c.html", "unified_diff": "@@ -95,83 +95,83 @@\n
\n
\n \n \n \n \n-\n+\n \n \n \n-\n+\n \n-\n+\n \n \n \n \n \n \n \n \n \n-\n+\n \n \n \n \n \n-\n+\n \n \n \n-\n+\n \n \n \n \n \n \n \n-\n+\n \n \n \n-\n+\n \n \n \n-\n+\n \n \n \n-\n+\n \n \n \n-\n+\n \n \n \n \n \n-\n+\n \n-\n+\n \n \n \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_2483050b711c1829a6434006d0beb10c.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_2483050b711c1829a6434006d0beb10c.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,42 +1,42 @@\n var dir_2483050b711c1829a6434006d0beb10c = [\n [\"bufferDescriptor.h\", \"a00899.html\", \"a00899\"],\n- [\"clEvaluator.h\", \"a00806.html\", \"a00806\"],\n+ [\"clEvaluator.h\", \"a00803.html\", \"a00803\"],\n [\"clPatchTable.h\", \"a00800.html\", \"a00800\"],\n- [\"clVertexBuffer.h\", \"a00794.html\", \"a00794\"],\n- [\"cpuD3D11VertexBuffer.h\", \"a00845.html\", \"a00845\"],\n+ [\"clVertexBuffer.h\", \"a00797.html\", \"a00797\"],\n+ [\"cpuD3D11VertexBuffer.h\", \"a00842.html\", \"a00842\"],\n [\"cpuEvaluator.h\", \"a00896.html\", \"a00896\"],\n [\"cpuGLVertexBuffer.h\", \"a00869.html\", \"a00869\"],\n [\"cpuPatchTable.h\", \"a00893.html\", \"a00893\"],\n [\"cpuVertexBuffer.h\", \"a00890.html\", \"a00890\"],\n- [\"cudaEvaluator.h\", \"a00791.html\", \"a00791\"],\n+ [\"cudaEvaluator.h\", \"a00794.html\", \"a00794\"],\n [\"cudaPatchTable.h\", \"a00788.html\", \"a00788\"],\n [\"cudaVertexBuffer.h\", \"a00902.html\", \"a00902\"],\n- [\"d3d11ComputeEvaluator.h\", \"a00842.html\", \"a00842\"],\n+ [\"d3d11ComputeEvaluator.h\", \"a00845.html\", \"a00845\"],\n [\"d3d11LegacyGregoryPatchTable.h\", \"a00839.html\", \"a00839\"],\n- [\"d3d11Mesh.h\", \"a00827.html\", \"a00827\"],\n+ [\"d3d11Mesh.h\", \"a00830.html\", \"a00830\"],\n [\"d3d11PatchTable.h\", \"a00836.html\", \"a00836\"],\n [\"d3d11VertexBuffer.h\", \"a00833.html\", \"a00833\"],\n [\"glComputeEvaluator.h\", \"a00848.html\", \"a00848\"],\n- [\"glLegacyGregoryPatchTable.h\", \"a00863.html\", \"a00863\"],\n+ [\"glLegacyGregoryPatchTable.h\", \"a00866.html\", \"a00866\"],\n [\"glMesh.h\", \"a00857.html\", \"a00857\"],\n- [\"glPatchTable.h\", \"a00866.html\", \"a00866\"],\n+ [\"glPatchTable.h\", \"a00860.html\", \"a00860\"],\n [\"glslPatchShaderSource.h\", \"a00854.html\", \"a00854\"],\n- [\"glVertexBuffer.h\", \"a00860.html\", \"a00860\"],\n+ [\"glVertexBuffer.h\", \"a00863.html\", \"a00863\"],\n [\"glXFBEvaluator.h\", \"a00851.html\", \"a00851\"],\n- [\"hlslPatchShaderSource.h\", \"a00830.html\", \"a00830\"],\n+ [\"hlslPatchShaderSource.h\", \"a00827.html\", \"a00827\"],\n [\"mesh.h\", \"a00887.html\", \"a00887\"],\n- [\"mtlCommon.h\", \"a00803.html\", \"a00803\"],\n+ [\"mtlCommon.h\", \"a00806.html\", \"a00806\"],\n [\"mtlComputeEvaluator.h\", \"a00821.html\", \"a00821\"],\n [\"mtlLegacyGregoryPatchTable.h\", \"a00818.html\", \"a00818\"],\n- [\"mtlMesh.h\", \"a00809.html\", \"a00809\"],\n- [\"mtlPatchShaderSource.h\", \"a00812.html\", \"a00812\"],\n+ [\"mtlMesh.h\", \"a00812.html\", \"a00812\"],\n+ [\"mtlPatchShaderSource.h\", \"a00809.html\", \"a00809\"],\n [\"mtlPatchTable.h\", \"a00815.html\", \"a00815\"],\n [\"mtlVertexBuffer.h\", \"a00824.html\", \"a00824\"],\n- [\"ompEvaluator.h\", \"a00878.html\", \"a00878\"],\n- [\"ompKernel.h\", \"a00881.html\", \"a00881\"],\n- [\"opencl.h\", \"a00797.html\", null],\n+ [\"ompEvaluator.h\", \"a00881.html\", \"a00881\"],\n+ [\"ompKernel.h\", \"a00878.html\", \"a00878\"],\n+ [\"opencl.h\", \"a00791.html\", null],\n [\"opengl.h\", \"a00884.html\", null],\n [\"tbbEvaluator.h\", \"a00875.html\", \"a00875\"],\n [\"tbbKernel.h\", \"a00872.html\", \"a00872\"],\n [\"types.h\", \"a01481.html\", \"a01481\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_7f420b72a822828cfa8b0561c695a5cc.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_7f420b72a822828cfa8b0561c695a5cc.html", "unified_diff": "@@ -103,25 +103,25 @@\n \n \n \n \n \n \n \n-\n+\n \n-\n+\n \n \n \n \n \n-\n+\n \n-\n+\n \n \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_7f420b72a822828cfa8b0561c695a5cc.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_7f420b72a822828cfa8b0561c695a5cc.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,17 +1,17 @@\n var dir_7f420b72a822828cfa8b0561c695a5cc = [\n [\"error.h\", \"a00743.html\", \"a00743\"],\n [\"patchDescriptor.h\", \"a00740.html\", \"a00740\"],\n [\"patchMap.h\", \"a00734.html\", \"a00734\"],\n [\"patchParam.h\", \"a00737.html\", \"a00737\"],\n [\"patchTable.h\", \"a00731.html\", \"a00731\"],\n- [\"patchTableFactory.h\", \"a00728.html\", \"a00728\"],\n- [\"primvarRefiner.h\", \"a00725.html\", \"a00725\"],\n+ [\"patchTableFactory.h\", \"a00725.html\", \"a00725\"],\n+ [\"primvarRefiner.h\", \"a00728.html\", \"a00728\"],\n [\"ptexIndices.h\", \"a00722.html\", \"a00722\"],\n [\"stencilTable.h\", \"a00719.html\", \"a00719\"],\n- [\"stencilTableFactory.h\", \"a00713.html\", \"a00713\"],\n- [\"topologyDescriptor.h\", \"a00716.html\", \"a00716\"],\n+ [\"stencilTableFactory.h\", \"a00716.html\", \"a00716\"],\n+ [\"topologyDescriptor.h\", \"a00713.html\", \"a00713\"],\n [\"topologyLevel.h\", \"a00710.html\", \"a00710\"],\n [\"topologyRefiner.h\", \"a00704.html\", \"a00704\"],\n [\"topologyRefinerFactory.h\", \"a00707.html\", \"a00707\"],\n [\"types.h\", \"a01478.html\", \"a01478\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_bd5473d7d5841d48919aaa9ad0cb1f9b.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_bd5473d7d5841d48919aaa9ad0cb1f9b.html", "unified_diff": "@@ -97,17 +97,17 @@\n

\n Files

 bufferDescriptor.h
 
 clEvaluator.h
 clEvaluator.h
 
 clPatchTable.h
 
 clVertexBuffer.h
 clVertexBuffer.h
 
 cpuD3D11VertexBuffer.h
 cpuD3D11VertexBuffer.h
 
 cpuEvaluator.h
 
 cpuGLVertexBuffer.h
 
 cpuPatchTable.h
 
 cpuVertexBuffer.h
 
 cudaEvaluator.h
 cudaEvaluator.h
 
 cudaPatchTable.h
 
 cudaVertexBuffer.h
 
 d3d11ComputeEvaluator.h
 d3d11ComputeEvaluator.h
 
 d3d11LegacyGregoryPatchTable.h
 
 d3d11Mesh.h
 d3d11Mesh.h
 
 d3d11PatchTable.h
 
 d3d11VertexBuffer.h
 
 glComputeEvaluator.h
 
 glLegacyGregoryPatchTable.h
 glLegacyGregoryPatchTable.h
 
 glMesh.h
 
 glPatchTable.h
 glPatchTable.h
 
 glslPatchShaderSource.h
 
 glVertexBuffer.h
 glVertexBuffer.h
 
 glXFBEvaluator.h
 
 hlslPatchShaderSource.h
 hlslPatchShaderSource.h
 
 mesh.h
 
 mtlCommon.h
 mtlCommon.h
 
 mtlComputeEvaluator.h
 
 mtlLegacyGregoryPatchTable.h
 
 mtlMesh.h
 mtlMesh.h
 
 mtlPatchShaderSource.h
 mtlPatchShaderSource.h
 
 mtlPatchTable.h
 
 mtlVertexBuffer.h
 
 ompEvaluator.h
 ompEvaluator.h
 
 ompKernel.h
 ompKernel.h
 
 opencl.h
 opencl.h
 
 opengl.h
 
 tbbEvaluator.h
 
 tbbKernel.h
 
 
 patchMap.h
 
 patchParam.h
 
 patchTable.h
 
 patchTableFactory.h
 patchTableFactory.h
 
 primvarRefiner.h
 primvarRefiner.h
 
 ptexIndices.h
 
 stencilTable.h
 
 stencilTableFactory.h
 stencilTableFactory.h
 
 topologyDescriptor.h
 topologyDescriptor.h
 
 topologyLevel.h
 
 topologyRefiner.h
 
 topologyRefinerFactory.h
 
\n \n \n \n \n \n-\n+\n \n-\n+\n \n \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_bd5473d7d5841d48919aaa9ad0cb1f9b.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_bd5473d7d5841d48919aaa9ad0cb1f9b.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,11 +1,11 @@\n var dir_bd5473d7d5841d48919aaa9ad0cb1f9b = [\n [\"array.h\", \"a00767.html\", \"a00767\"],\n [\"componentInterfaces.h\", \"a00764.html\", null],\n- [\"fvarLevel.h\", \"a00758.html\", null],\n- [\"fvarRefinement.h\", \"a00761.html\", null],\n+ [\"fvarLevel.h\", \"a00761.html\", null],\n+ [\"fvarRefinement.h\", \"a00758.html\", null],\n [\"level.h\", \"a00755.html\", null],\n [\"refinement.h\", \"a00752.html\", null],\n [\"sparseSelector.h\", \"a00749.html\", null],\n [\"stackBuffer.h\", \"a00746.html\", null],\n [\"types.h\", \"a01487.html\", \"a01487\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_f61368944c63c2c1f8c69bc232e59c39.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_f61368944c63c2c1f8c69bc232e59c39.html", "unified_diff": "@@ -93,17 +93,17 @@\n
\n
sdc Directory Reference
\n
\n
\n

\n Files

 array.h
 
 componentInterfaces.h
 
 fvarLevel.h
 fvarLevel.h
 
 fvarRefinement.h
 fvarRefinement.h
 
 level.h
 
 refinement.h
 
 sparseSelector.h
 
\n \n-\n+\n \n-\n+\n \n \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_f61368944c63c2c1f8c69bc232e59c39.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_f61368944c63c2c1f8c69bc232e59c39.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,9 @@\n var dir_f61368944c63c2c1f8c69bc232e59c39 = [\n- [\"bilinearScheme.h\", \"a00785.html\", null],\n- [\"catmarkScheme.h\", \"a00782.html\", null],\n+ [\"bilinearScheme.h\", \"a00782.html\", null],\n+ [\"catmarkScheme.h\", \"a00785.html\", null],\n [\"crease.h\", \"a00779.html\", \"a00779\"],\n [\"loopScheme.h\", \"a00776.html\", null],\n [\"options.h\", \"a00773.html\", \"a00773\"],\n [\"scheme.h\", \"a00770.html\", \"a00770\"],\n [\"types.h\", \"a01484.html\", \"a01484\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_fa5edef2a780a73fbfb6a11f1af88ceb.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_fa5edef2a780a73fbfb6a11f1af88ceb.html", "unified_diff": "@@ -95,25 +95,25 @@\n \n
\n

\n Files

 bilinearScheme.h
 bilinearScheme.h
 
 catmarkScheme.h
 catmarkScheme.h
 
 crease.h
 
 loopScheme.h
 
 options.h
 
\n \n \n \n-\n+\n \n-\n+\n \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n \n \n \n \n

\n Files

 limits.h
 
 parameterization.h
 parameterization.h
 
 refinerSurfaceFactory.h
 refinerSurfaceFactory.h
 
 surface.h
 
 surfaceFactory.h
 surfaceFactory.h
 
 surfaceFactoryCache.h
 surfaceFactoryCache.h
 
 surfaceFactoryMeshAdapter.h
 surfaceFactoryMeshAdapter.h
 
 tessellation.h
 
 vertexDescriptor.h
 
\n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_fa5edef2a780a73fbfb6a11f1af88ceb.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_fa5edef2a780a73fbfb6a11f1af88ceb.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,11 +1,11 @@\n var dir_fa5edef2a780a73fbfb6a11f1af88ceb = [\n [\"limits.h\", \"a00698.html\", \"a00698\"],\n- [\"parameterization.h\", \"a00695.html\", \"a00695\"],\n- [\"refinerSurfaceFactory.h\", \"a00692.html\", \"a00692\"],\n+ [\"parameterization.h\", \"a00692.html\", \"a00692\"],\n+ [\"refinerSurfaceFactory.h\", \"a00695.html\", \"a00695\"],\n [\"surface.h\", \"a00689.html\", \"a00689\"],\n- [\"surfaceFactory.h\", \"a00680.html\", \"a00680\"],\n- [\"surfaceFactoryCache.h\", \"a00683.html\", \"a00683\"],\n- [\"surfaceFactoryMeshAdapter.h\", \"a00686.html\", \"a00686\"],\n+ [\"surfaceFactory.h\", \"a00686.html\", \"a00686\"],\n+ [\"surfaceFactoryCache.h\", \"a00680.html\", \"a00680\"],\n+ [\"surfaceFactoryMeshAdapter.h\", \"a00683.html\", \"a00683\"],\n [\"tessellation.h\", \"a00677.html\", \"a00677\"],\n [\"vertexDescriptor.h\", \"a00674.html\", \"a00674\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/files.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/files.html", "unified_diff": "@@ -95,92 +95,92 @@\n \n
\n
Here is a list of all files with brief descriptions:
\n
[detail level 123]
\n \n \n \n-\n-\n+\n+\n \n-\n-\n-\n+\n+\n+\n \n \n \n \n \n \n \n \n-\n-\n+\n+\n \n \n-\n-\n+\n+\n \n \n \n \n \n \n-\n+\n \n-\n-\n+\n+\n \n \n \n \n-\n+\n \n \n-\n+\n \n-\n+\n \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n \n-\n-\n+\n+\n \n \n-\n-\n-\n+\n+\n+\n \n \n \n \n \n-\n-\n+\n+\n \n \n \n \n \n \n \n \n-\n-\n+\n+\n \n \n \n \n \n
  opensubdiv
  bfr
 limits.h
 parameterization.h
 refinerSurfaceFactory.h
 parameterization.h
 refinerSurfaceFactory.h
 surface.h
 surfaceFactory.h
 surfaceFactoryCache.h
 surfaceFactoryMeshAdapter.h
 surfaceFactory.h
 surfaceFactoryCache.h
 surfaceFactoryMeshAdapter.h
 tessellation.h
 vertexDescriptor.h
  far
 error.h
 patchDescriptor.h
 patchMap.h
 patchParam.h
 patchTable.h
 patchTableFactory.h
 primvarRefiner.h
 patchTableFactory.h
 primvarRefiner.h
 ptexIndices.h
 stencilTable.h
 stencilTableFactory.h
 topologyDescriptor.h
 stencilTableFactory.h
 topologyDescriptor.h
 topologyLevel.h
 topologyRefiner.h
 topologyRefinerFactory.h
 types.h
  osd
 bufferDescriptor.h
 clEvaluator.h
 clEvaluator.h
 clPatchTable.h
 clVertexBuffer.h
 cpuD3D11VertexBuffer.h
 clVertexBuffer.h
 cpuD3D11VertexBuffer.h
 cpuEvaluator.h
 cpuGLVertexBuffer.h
 cpuPatchTable.h
 cpuVertexBuffer.h
 cudaEvaluator.h
 cudaEvaluator.h
 cudaPatchTable.h
 cudaVertexBuffer.h
 d3d11ComputeEvaluator.h
 d3d11ComputeEvaluator.h
 d3d11LegacyGregoryPatchTable.h
 d3d11Mesh.h
 d3d11Mesh.h
 d3d11PatchTable.h
 d3d11VertexBuffer.h
 glComputeEvaluator.h
 glLegacyGregoryPatchTable.h
 glLegacyGregoryPatchTable.h
 glMesh.h
 glPatchTable.h
 glPatchTable.h
 glslPatchShaderSource.h
 glVertexBuffer.h
 glVertexBuffer.h
 glXFBEvaluator.h
 hlslPatchShaderSource.h
 hlslPatchShaderSource.h
 mesh.h
 mtlCommon.h
 mtlCommon.h
 mtlComputeEvaluator.h
 mtlLegacyGregoryPatchTable.h
 mtlMesh.h
 mtlPatchShaderSource.h
 mtlMesh.h
 mtlPatchShaderSource.h
 mtlPatchTable.h
 mtlVertexBuffer.h
 ompEvaluator.h
 ompKernel.h
 opencl.h
 ompEvaluator.h
 ompKernel.h
 opencl.h
 opengl.h
 tbbEvaluator.h
 tbbKernel.h
 types.h
  sdc
 bilinearScheme.h
 catmarkScheme.h
 bilinearScheme.h
 catmarkScheme.h
 crease.h
 loopScheme.h
 options.h
 scheme.h
 types.h
  vtr
 array.h
 componentInterfaces.h
 fvarLevel.h
 fvarRefinement.h
 fvarLevel.h
 fvarRefinement.h
 level.h
 refinement.h
 sparseSelector.h
 stackBuffer.h
 types.h
\n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/navtreeindex0.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/navtreeindex0.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,44 +1,44 @@\n var NAVTREEINDEX0 = {\n \"a00674.html\": [2, 0, 0, 0, 8],\n \"a00674_source.html\": [2, 0, 0, 0, 8],\n \"a00677.html\": [2, 0, 0, 0, 7],\n \"a00677_source.html\": [2, 0, 0, 0, 7],\n- \"a00680.html\": [2, 0, 0, 0, 4],\n- \"a00680_source.html\": [2, 0, 0, 0, 4],\n- \"a00683.html\": [2, 0, 0, 0, 5],\n- \"a00683_source.html\": [2, 0, 0, 0, 5],\n- \"a00686.html\": [2, 0, 0, 0, 6],\n- \"a00686_source.html\": [2, 0, 0, 0, 6],\n+ \"a00680.html\": [2, 0, 0, 0, 5],\n+ \"a00680_source.html\": [2, 0, 0, 0, 5],\n+ \"a00683.html\": [2, 0, 0, 0, 6],\n+ \"a00683_source.html\": [2, 0, 0, 0, 6],\n+ \"a00686.html\": [2, 0, 0, 0, 4],\n+ \"a00686_source.html\": [2, 0, 0, 0, 4],\n \"a00689.html\": [2, 0, 0, 0, 3],\n \"a00689_source.html\": [2, 0, 0, 0, 3],\n- \"a00692.html\": [2, 0, 0, 0, 2],\n- \"a00692_source.html\": [2, 0, 0, 0, 2],\n- \"a00695.html\": [2, 0, 0, 0, 1],\n- \"a00695_source.html\": [2, 0, 0, 0, 1],\n+ \"a00692.html\": [2, 0, 0, 0, 1],\n+ \"a00692_source.html\": [2, 0, 0, 0, 1],\n+ \"a00695.html\": [2, 0, 0, 0, 2],\n+ \"a00695_source.html\": [2, 0, 0, 0, 2],\n \"a00698.html\": [2, 0, 0, 0, 0],\n \"a00698_source.html\": [2, 0, 0, 0, 0],\n \"a00704.html\": [2, 0, 0, 1, 12],\n \"a00704_source.html\": [2, 0, 0, 1, 12],\n \"a00707.html\": [2, 0, 0, 1, 13],\n \"a00707_source.html\": [2, 0, 0, 1, 13],\n \"a00710.html\": [2, 0, 0, 1, 11],\n \"a00710_source.html\": [2, 0, 0, 1, 11],\n- \"a00713.html\": [2, 0, 0, 1, 9],\n- \"a00713_source.html\": [2, 0, 0, 1, 9],\n- \"a00716.html\": [2, 0, 0, 1, 10],\n- \"a00716_source.html\": [2, 0, 0, 1, 10],\n+ \"a00713.html\": [2, 0, 0, 1, 10],\n+ \"a00713_source.html\": [2, 0, 0, 1, 10],\n+ \"a00716.html\": [2, 0, 0, 1, 9],\n+ \"a00716_source.html\": [2, 0, 0, 1, 9],\n \"a00719.html\": [2, 0, 0, 1, 8],\n \"a00719_source.html\": [2, 0, 0, 1, 8],\n \"a00722.html\": [2, 0, 0, 1, 7],\n \"a00722_source.html\": [2, 0, 0, 1, 7],\n- \"a00725.html\": [2, 0, 0, 1, 6],\n- \"a00725_source.html\": [2, 0, 0, 1, 6],\n- \"a00728.html\": [2, 0, 0, 1, 5],\n- \"a00728_source.html\": [2, 0, 0, 1, 5],\n+ \"a00725.html\": [2, 0, 0, 1, 5],\n+ \"a00725_source.html\": [2, 0, 0, 1, 5],\n+ \"a00728.html\": [2, 0, 0, 1, 6],\n+ \"a00728_source.html\": [2, 0, 0, 1, 6],\n \"a00731.html\": [2, 0, 0, 1, 4],\n \"a00731_source.html\": [2, 0, 0, 1, 4],\n \"a00734.html\": [2, 0, 0, 1, 2],\n \"a00734_source.html\": [2, 0, 0, 1, 2],\n \"a00737.html\": [2, 0, 0, 1, 3],\n \"a00737.html#a3139c7c52ddf26b2403e8e95ff63eeb3\": [2, 0, 0, 1, 3, 1],\n \"a00737.html#a46ea68db89cc3d55c4191ef7648281ce\": [2, 0, 0, 1, 3, 3],\n@@ -65,109 +65,109 @@\n \"a00746_source.html\": [2, 0, 0, 4, 7],\n \"a00749.html\": [2, 0, 0, 4, 6],\n \"a00749_source.html\": [2, 0, 0, 4, 6],\n \"a00752.html\": [2, 0, 0, 4, 5],\n \"a00752_source.html\": [2, 0, 0, 4, 5],\n \"a00755.html\": [2, 0, 0, 4, 4],\n \"a00755_source.html\": [2, 0, 0, 4, 4],\n- \"a00758.html\": [2, 0, 0, 4, 2],\n- \"a00758_source.html\": [2, 0, 0, 4, 2],\n- \"a00761.html\": [2, 0, 0, 4, 3],\n- \"a00761_source.html\": [2, 0, 0, 4, 3],\n+ \"a00758.html\": [2, 0, 0, 4, 3],\n+ \"a00758_source.html\": [2, 0, 0, 4, 3],\n+ \"a00761.html\": [2, 0, 0, 4, 2],\n+ \"a00761_source.html\": [2, 0, 0, 4, 2],\n \"a00764.html\": [2, 0, 0, 4, 1],\n \"a00764_source.html\": [2, 0, 0, 4, 1],\n \"a00767.html\": [2, 0, 0, 4, 0],\n \"a00767_source.html\": [2, 0, 0, 4, 0],\n \"a00770.html\": [2, 0, 0, 3, 5],\n \"a00770_source.html\": [2, 0, 0, 3, 5],\n \"a00773.html\": [2, 0, 0, 3, 4],\n \"a00773_source.html\": [2, 0, 0, 3, 4],\n \"a00776.html\": [2, 0, 0, 3, 3],\n \"a00776_source.html\": [2, 0, 0, 3, 3],\n \"a00779.html\": [2, 0, 0, 3, 2],\n \"a00779_source.html\": [2, 0, 0, 3, 2],\n- \"a00782.html\": [2, 0, 0, 3, 1],\n- \"a00782_source.html\": [2, 0, 0, 3, 1],\n- \"a00785.html\": [2, 0, 0, 3, 0],\n- \"a00785_source.html\": [2, 0, 0, 3, 0],\n+ \"a00782.html\": [2, 0, 0, 3, 0],\n+ \"a00782_source.html\": [2, 0, 0, 3, 0],\n+ \"a00785.html\": [2, 0, 0, 3, 1],\n+ \"a00785_source.html\": [2, 0, 0, 3, 1],\n \"a00788.html\": [2, 0, 0, 2, 10],\n \"a00788_source.html\": [2, 0, 0, 2, 10],\n- \"a00791.html\": [2, 0, 0, 2, 9],\n- \"a00791_source.html\": [2, 0, 0, 2, 9],\n- \"a00794.html\": [2, 0, 0, 2, 3],\n- \"a00794_source.html\": [2, 0, 0, 2, 3],\n- \"a00797.html\": [2, 0, 0, 2, 35],\n- \"a00797_source.html\": [2, 0, 0, 2, 35],\n+ \"a00791.html\": [2, 0, 0, 2, 35],\n+ \"a00791_source.html\": [2, 0, 0, 2, 35],\n+ \"a00794.html\": [2, 0, 0, 2, 9],\n+ \"a00794_source.html\": [2, 0, 0, 2, 9],\n+ \"a00797.html\": [2, 0, 0, 2, 3],\n+ \"a00797_source.html\": [2, 0, 0, 2, 3],\n \"a00800.html\": [2, 0, 0, 2, 2],\n \"a00800_source.html\": [2, 0, 0, 2, 2],\n- \"a00803.html\": [2, 0, 0, 2, 26],\n- \"a00803_source.html\": [2, 0, 0, 2, 26],\n- \"a00806.html\": [2, 0, 0, 2, 1],\n- \"a00806_source.html\": [2, 0, 0, 2, 1],\n- \"a00809.html\": [2, 0, 0, 2, 29],\n- \"a00809.html#aa41e5b43fe46eeb0f97ff6ebdb1935aa\": [2, 0, 0, 2, 29, 0],\n- \"a00809_source.html\": [2, 0, 0, 2, 29],\n- \"a00812.html\": [2, 0, 0, 2, 30],\n- \"a00812_source.html\": [2, 0, 0, 2, 30],\n+ \"a00803.html\": [2, 0, 0, 2, 1],\n+ \"a00803_source.html\": [2, 0, 0, 2, 1],\n+ \"a00806.html\": [2, 0, 0, 2, 26],\n+ \"a00806_source.html\": [2, 0, 0, 2, 26],\n+ \"a00809.html\": [2, 0, 0, 2, 30],\n+ \"a00809_source.html\": [2, 0, 0, 2, 30],\n+ \"a00812.html\": [2, 0, 0, 2, 29],\n+ \"a00812.html#aa41e5b43fe46eeb0f97ff6ebdb1935aa\": [2, 0, 0, 2, 29, 0],\n+ \"a00812_source.html\": [2, 0, 0, 2, 29],\n \"a00815.html\": [2, 0, 0, 2, 31],\n \"a00815_source.html\": [2, 0, 0, 2, 31],\n \"a00818.html\": [2, 0, 0, 2, 28],\n \"a00818_source.html\": [2, 0, 0, 2, 28],\n \"a00821.html\": [2, 0, 0, 2, 27],\n \"a00821_source.html\": [2, 0, 0, 2, 27],\n \"a00824.html\": [2, 0, 0, 2, 32],\n \"a00824_source.html\": [2, 0, 0, 2, 32],\n- \"a00827.html\": [2, 0, 0, 2, 14],\n- \"a00827.html#ae5c8e80d05d6eaee105d8eecfa9ab609\": [2, 0, 0, 2, 14, 0],\n- \"a00827_source.html\": [2, 0, 0, 2, 14],\n- \"a00830.html\": [2, 0, 0, 2, 24],\n- \"a00830_source.html\": [2, 0, 0, 2, 24],\n+ \"a00827.html\": [2, 0, 0, 2, 24],\n+ \"a00827_source.html\": [2, 0, 0, 2, 24],\n+ \"a00830.html\": [2, 0, 0, 2, 14],\n+ \"a00830.html#ae5c8e80d05d6eaee105d8eecfa9ab609\": [2, 0, 0, 2, 14, 0],\n+ \"a00830_source.html\": [2, 0, 0, 2, 14],\n \"a00833.html\": [2, 0, 0, 2, 16],\n \"a00833_source.html\": [2, 0, 0, 2, 16],\n \"a00836.html\": [2, 0, 0, 2, 15],\n \"a00836_source.html\": [2, 0, 0, 2, 15],\n \"a00839.html\": [2, 0, 0, 2, 13],\n \"a00839_source.html\": [2, 0, 0, 2, 13],\n- \"a00842.html\": [2, 0, 0, 2, 12],\n- \"a00842_source.html\": [2, 0, 0, 2, 12],\n- \"a00845.html\": [2, 0, 0, 2, 4],\n- \"a00845_source.html\": [2, 0, 0, 2, 4],\n+ \"a00842.html\": [2, 0, 0, 2, 4],\n+ \"a00842_source.html\": [2, 0, 0, 2, 4],\n+ \"a00845.html\": [2, 0, 0, 2, 12],\n+ \"a00845_source.html\": [2, 0, 0, 2, 12],\n \"a00848.html\": [2, 0, 0, 2, 17],\n \"a00848_source.html\": [2, 0, 0, 2, 17],\n \"a00851.html\": [2, 0, 0, 2, 23],\n \"a00851_source.html\": [2, 0, 0, 2, 23],\n \"a00854.html\": [2, 0, 0, 2, 21],\n \"a00854_source.html\": [2, 0, 0, 2, 21],\n \"a00857.html\": [2, 0, 0, 2, 19],\n \"a00857.html#a7f9cf2b729178bdbb847fc4afd91af9e\": [2, 0, 0, 2, 19, 0],\n \"a00857_source.html\": [2, 0, 0, 2, 19],\n- \"a00860.html\": [2, 0, 0, 2, 22],\n- \"a00860_source.html\": [2, 0, 0, 2, 22],\n- \"a00863.html\": [2, 0, 0, 2, 18],\n- \"a00863_source.html\": [2, 0, 0, 2, 18],\n- \"a00866.html\": [2, 0, 0, 2, 20],\n- \"a00866_source.html\": [2, 0, 0, 2, 20],\n+ \"a00860.html\": [2, 0, 0, 2, 20],\n+ \"a00860_source.html\": [2, 0, 0, 2, 20],\n+ \"a00863.html\": [2, 0, 0, 2, 22],\n+ \"a00863_source.html\": [2, 0, 0, 2, 22],\n+ \"a00866.html\": [2, 0, 0, 2, 18],\n+ \"a00866_source.html\": [2, 0, 0, 2, 18],\n \"a00869.html\": [2, 0, 0, 2, 6],\n \"a00869_source.html\": [2, 0, 0, 2, 6],\n \"a00872.html\": [2, 0, 0, 2, 38],\n \"a00872.html#a20e08be34d6183b6943ed7a1586eca4a\": [2, 0, 0, 2, 38, 1],\n \"a00872.html#a4a6a0fcc01638f2a0316b32ad158b485\": [2, 0, 0, 2, 38, 4],\n \"a00872.html#aa0c3c264a43eeddc5cb3a58b006d3d32\": [2, 0, 0, 2, 38, 0],\n \"a00872.html#aa65ed860a2fa5935d99129a898a8f0b6\": [2, 0, 0, 2, 38, 2],\n \"a00872.html#af23c35537952bfdd493441e5c42ff2ed\": [2, 0, 0, 2, 38, 3],\n \"a00872_source.html\": [2, 0, 0, 2, 38],\n \"a00875.html\": [2, 0, 0, 2, 37],\n \"a00875_source.html\": [2, 0, 0, 2, 37],\n- \"a00878.html\": [2, 0, 0, 2, 33],\n- \"a00878_source.html\": [2, 0, 0, 2, 33],\n- \"a00881.html\": [2, 0, 0, 2, 34],\n- \"a00881.html#a44a05502feb5015035bc81b93cffb99c\": [2, 0, 0, 2, 34, 0],\n- \"a00881.html#a870745ff3e883b32547d4db42b3be2bd\": [2, 0, 0, 2, 34, 2],\n- \"a00881.html#a907dc53421460557871ddc35f77751f5\": [2, 0, 0, 2, 34, 1],\n- \"a00881_source.html\": [2, 0, 0, 2, 34],\n+ \"a00878.html\": [2, 0, 0, 2, 34],\n+ \"a00878.html#a44a05502feb5015035bc81b93cffb99c\": [2, 0, 0, 2, 34, 0],\n+ \"a00878.html#a870745ff3e883b32547d4db42b3be2bd\": [2, 0, 0, 2, 34, 2],\n+ \"a00878.html#a907dc53421460557871ddc35f77751f5\": [2, 0, 0, 2, 34, 1],\n+ \"a00878_source.html\": [2, 0, 0, 2, 34],\n+ \"a00881.html\": [2, 0, 0, 2, 33],\n+ \"a00881_source.html\": [2, 0, 0, 2, 33],\n \"a00884.html\": [2, 0, 0, 2, 36],\n \"a00884_source.html\": [2, 0, 0, 2, 36],\n \"a00887.html\": [2, 0, 0, 2, 25],\n \"a00887.html#a06ceddf21c024b341a5b946049cd701a\": [2, 0, 0, 2, 25, 6],\n \"a00887.html#a1af6b50e9f8ae13d3d2f9d5b03b35492\": [2, 0, 0, 2, 25, 5],\n \"a00887.html#a1af6b50e9f8ae13d3d2f9d5b03b35492a4124233e4f787f999c7975afceab34f3\": [2, 0, 0, 2, 25, 5, 7],\n \"a00887.html#a1af6b50e9f8ae13d3d2f9d5b03b35492a5676712c77d29cfdd330e2802db1c464\": [2, 0, 0, 2, 25, 5, 11],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_10.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_10.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -10,15 +10,15 @@\n ['refinementlevel_4', ['refinementLevel', ['../a01117.html#a240d1e5f5b743486e8122db6223d4562', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::UniformOptions']]],\n ['refinemesh_5', ['refinemesh', ['../a01261.html#a51f237c3f08f6ddc2ea7ba5cb0d00b36', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MeshInterface::refineMesh(Far::TopologyRefiner &refiner, int level, bool adaptive, bool singleCreasePatch)'],\n ['../a01261.html#a173851f742adc30ac139af96fe63732d', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MeshInterface::refineMesh(Far::TopologyRefiner &refiner, int level, MeshBitset bits)']\n ]],\n ['refinersurfacefactory_6', ['refinersurfacefactory', ['../a00929.html#af74dafe122d798d4069b675c52f6665a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::RefinerSurfaceFactory::RefinerSurfaceFactory()'],\n ['../a00929.html', 1, 'RefinerSurfaceFactory< CACHE_TYPE >']\n ]],\n- ['refinersurfacefactory_2eh_7', ['refinerSurfaceFactory.h', ['../a00692.html', 1, '']]],\n+ ['refinersurfacefactory_2eh_7', ['refinerSurfaceFactory.h', ['../a00695.html', 1, '']]],\n ['refinersurfacefactorybase_8', ['refinersurfacefactorybase', ['../a00925.html', 1, 'RefinerSurfaceFactoryBase'],\n ['../a00925.html#af457c931d6d611e35737454f2c483f84', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::RefinerSurfaceFactoryBase::RefinerSurfaceFactoryBase()']\n ]],\n ['refineuniform_9', ['RefineUniform', ['../a01113.html#ad22b7ffd9f8f3b488e5f220cf00c8c82', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner']]],\n ['regdesc_10', ['regDesc', ['../a01317.html#a00efd3a5502664756617ee930cb4324c', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::PatchArray']]],\n ['regular_11', ['REGULAR', ['../a00973.html#a1d1cfd8ffb84e947f82999c682b666a7afc488491175a6dac9e5881e363ad4c41', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchDescriptor']]],\n ['reportinvalidtopology_12', ['reportInvalidTopology', ['../a01109.html#a0c4c1d44df4c480bd0adfa9e86891b39', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefinerFactory']]],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_11.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_11.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -103,15 +103,15 @@\n ['../a01057.html#a54db76b34112b5cb3c623be8789dd8f4', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTable::StencilTable(int numControlVerts)'],\n ['../a01057.html#acc553d2d5624ab2a790ae9613812393e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTable::StencilTable()'],\n ['../a01273.html#a6b90e8290c540c78bedd053e2cc42f31', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::Mesh::StencilTable'],\n ['../a01057.html', 1, 'StencilTable']\n ]],\n ['stenciltable_2eh_76', ['stencilTable.h', ['../a00719.html', 1, '']]],\n ['stenciltablefactory_77', ['StencilTableFactory', ['../a01089.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n- ['stenciltablefactory_2eh_78', ['stencilTableFactory.h', ['../a00713.html', 1, '']]],\n+ ['stenciltablefactory_2eh_78', ['stencilTableFactory.h', ['../a00716.html', 1, '']]],\n ['stenciltablefactoryreal_79', ['StencilTableFactoryReal', ['../a01037.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n ['stenciltablefactoryreal_3c_20float_20_3e_80', ['StencilTableFactoryReal< float >', ['../a01037.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n ['stenciltablefactoryreal_3c_20real_20_3e_81', ['stenciltablefactoryreal< real >', ['../a01045.html#af58f6a3f9b167c3330097c1a69ca36a8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilReal::StencilTableFactoryReal< REAL >'],\n ['../a01053.html#af58f6a3f9b167c3330097c1a69ca36a8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableReal::StencilTableFactoryReal< REAL >'],\n ['../a01061.html#af58f6a3f9b167c3330097c1a69ca36a8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilReal::StencilTableFactoryReal< REAL >']\n ]],\n ['stenciltablereal_82', ['stenciltablereal', ['../a01053.html', 1, 'StencilTableReal< REAL >'],\n@@ -134,25 +134,25 @@\n ]],\n ['surface_2eh_90', ['surface.h', ['../a00689.html', 1, '']]],\n ['surfacefactory_91', ['surfacefactory', ['../a00941.html#ae54ee5a9e2bcb2bfdf395084395a0719', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactory::SurfaceFactory(Sdc::SchemeType schemeType, Sdc::Options const &schemeOptions, Options const &limitOptions)'],\n ['../a00941.html#a5ac6bb6255796f79debe11e25b816093', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactory::SurfaceFactory(SurfaceFactory const &)=delete'],\n ['../a00933.html#a3bdc23048cdd1242d0a429413fa89256', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface::SurfaceFactory'],\n ['../a00941.html', 1, 'SurfaceFactory']\n ]],\n- ['surfacefactory_2eh_92', ['surfaceFactory.h', ['../a00680.html', 1, '']]],\n+ ['surfacefactory_2eh_92', ['surfaceFactory.h', ['../a00686.html', 1, '']]],\n ['surfacefactorycache_93', ['surfacefactorycache', ['../a00949.html#a3f63565868cb0b0871e2db37939ec0e2', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactoryCache::SurfaceFactoryCache()'],\n ['../a00949.html#a704742f6a7a07e766b5320c8d6f2f745', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactoryCache::SurfaceFactoryCache(SurfaceFactoryCache const &)=delete'],\n ['../a00949.html', 1, 'SurfaceFactoryCache']\n ]],\n- ['surfacefactorycache_2eh_94', ['surfaceFactoryCache.h', ['../a00683.html', 1, '']]],\n+ ['surfacefactorycache_2eh_94', ['surfaceFactoryCache.h', ['../a00680.html', 1, '']]],\n ['surfacefactorycachethreaded_95', ['surfacefactorycachethreaded', ['../a00953.html#a9e84b6f045809c700d7dc53c3a350afe', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactoryCacheThreaded::SurfaceFactoryCacheThreaded()'],\n ['../a00953.html', 1, 'SurfaceFactoryCacheThreaded< MUTEX_TYPE, READ_LOCK_GUARD_TYPE, WRITE_LOCK_GUARD_TYPE >']\n ]],\n ['surfacefactorymeshadapter_96', ['SurfaceFactoryMeshAdapter', ['../a00957.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr']]],\n- ['surfacefactorymeshadapter_2eh_97', ['surfaceFactoryMeshAdapter.h', ['../a00686.html', 1, '']]],\n+ ['surfacefactorymeshadapter_2eh_97', ['surfaceFactoryMeshAdapter.h', ['../a00683.html', 1, '']]],\n ['synchronize_98', ['synchronize', ['../a01141.html#a0529a707250f9931f945ec49d4e428d2', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLEvaluator::Synchronize(cl_command_queue queue)'],\n ['../a01141.html#a7e77f811e9d48160701e705bb4300388', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLEvaluator::Synchronize(DEVICE_CONTEXT deviceContext)'],\n ['../a01157.html#ae339a533e5f7a5021c5a4b40ec09c208', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CpuEvaluator::Synchronize()'],\n ['../a01309.html#a9689407af718de4263562bb3a760c1dd', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::TbbEvaluator::Synchronize()'],\n ['../a01305.html#a9689407af718de4263562bb3a760c1dd', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::OmpEvaluator::Synchronize()'],\n ['../a01285.html#a7e02041f843415c1056ea2ca3f7d0b62', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLComputeEvaluator::Synchronize()'],\n ['../a01273.html#ab945364bf8cadb3d1f8285551d9d49f0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::Mesh::Synchronize()'],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_12.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_12.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -19,15 +19,15 @@\n ['../a00961.html#a7f0af117d53701f7ca6e3eb2368b89bb', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::Tessellation(Parameterization const &p, int uniformRate, Options const &options=Options())']\n ]],\n ['tessellation_2eh_7', ['tessellation.h', ['../a00677.html', 1, '']]],\n ['topologycallback_8', ['TopologyCallback', ['../a01125.html#a896a964625491e084b3d776acd10f053', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefinerFactoryBase']]],\n ['topologydescriptor_9', ['topologydescriptor', ['../a01097.html', 1, 'TopologyDescriptor'],\n ['../a01097.html#a8209f1b69b0162ee2e7065d91088113d', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor::TopologyDescriptor()']\n ]],\n- ['topologydescriptor_2eh_10', ['topologyDescriptor.h', ['../a00716.html', 1, '']]],\n+ ['topologydescriptor_2eh_10', ['topologyDescriptor.h', ['../a00713.html', 1, '']]],\n ['topologyerror_11', ['TopologyError', ['../a01109.html#a5458be6ce3f2e63c8d8555f4ab3b2b62', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefinerFactory']]],\n ['topologylevel_12', ['topologylevel', ['../a01105.html', 1, 'TopologyLevel'],\n ['../a01105.html#a03a8183081b34983ade155e3636ba835', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyLevel::TopologyLevel()']\n ]],\n ['topologylevel_2eh_13', ['topologyLevel.h', ['../a00710.html', 1, '']]],\n ['topologyrefiner_14', ['topologyrefiner', ['../a01113.html', 1, 'TopologyRefiner'],\n ['../a01105.html#a094d2e51437ecd5ecc6a0cf2c4ce1e78', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyLevel::TopologyRefiner'],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_2.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_2.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -4,15 +4,15 @@\n ]],\n ['basetable_1', ['basetable', ['../a01057.html#a54f0bb223290a17a59f51f4cbcfbc2e2', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTable::BaseTable'],\n ['../a01073.html#a13d2ee8ca9cdc9073905193ea1cefd95', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTable::BaseTable']\n ]],\n ['begin_2', ['begin', ['../a01345.html#a29305669b60ca1680752e2fc3592ba99', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Vtr::ConstArray::begin()'],\n ['../a01349.html#ad69bd11391be1a1dba5c8202259664f8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Vtr::Array::begin()']\n ]],\n- ['bilinearscheme_2eh_3', ['bilinearScheme.h', ['../a00785.html', 1, '']]],\n+ ['bilinearscheme_2eh_3', ['bilinearScheme.h', ['../a00782.html', 1, '']]],\n ['bindclbuffer_4', ['BindCLBuffer', ['../a01149.html#ad9c25d5b96f9d5e971f677d32b406ec6', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLVertexBuffer']]],\n ['bindcpubuffer_5', ['bindcpubuffer', ['../a01153.html#adf7a9df5d3fc4d803bf5f1f374d90274', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CpuD3D11VertexBuffer::BindCpuBuffer()'],\n ['../a01161.html#adf7a9df5d3fc4d803bf5f1f374d90274', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CpuGLVertexBuffer::BindCpuBuffer()'],\n ['../a01169.html#adf7a9df5d3fc4d803bf5f1f374d90274', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CpuVertexBuffer::BindCpuBuffer()'],\n ['../a01301.html#adf7a9df5d3fc4d803bf5f1f374d90274', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CPUMTLVertexBuffer::BindCpuBuffer()']\n ]],\n ['bindcudabuffer_6', ['BindCudaBuffer', ['../a01185.html#a59eb144c23606529ba730ae15598af09', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CudaVertexBuffer']]],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_3.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_3.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,35 +1,35 @@\n var searchData = [\n- ['catmarkscheme_2eh_0', ['catmarkScheme.h', ['../a00782.html', 1, '']]],\n+ ['catmarkscheme_2eh_0', ['catmarkScheme.h', ['../a00785.html', 1, '']]],\n ['child_1', ['Child', ['../a00985.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchMap::QuadNode']]],\n ['clear_2', ['clear', ['../a01017.html#ac8bb3912a3ce86b15842e79d0b421204', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTableFactory::PatchFaceTag::clear()'],\n ['../a01069.html#aa71d36872f416feaa853788a7a7a7ef8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableReal::Clear()'],\n ['../a01053.html#aa71d36872f416feaa853788a7a7a7ef8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableReal::Clear()'],\n ['../a00989.html#aa71d36872f416feaa853788a7a7a7ef8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchParam::Clear()'],\n ['../a00933.html#aa71d36872f416feaa853788a7a7a7ef8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface::Clear()']\n ]],\n ['clearedgesharpness_3', ['ClearEdgeSharpness', ['../a00969.html#a831025d6d817c4afb1df7d5a705af378', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['clearincidentfacesizes_4', ['ClearIncidentFaceSizes', ['../a00969.html#a5c719e43580059139938a6ed0f851853', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['clearvertexsharpness_5', ['ClearVertexSharpness', ['../a00969.html#a68afc60df5a617f5d7e1580548b72f9b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['clevaluator_6', ['clevaluator', ['../a01141.html', 1, 'CLEvaluator'],\n ['../a01141.html#adbb0aafb7db3284f164499e8007c4cac', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLEvaluator::CLEvaluator()']\n ]],\n- ['clevaluator_2eh_7', ['clEvaluator.h', ['../a00806.html', 1, '']]],\n+ ['clevaluator_2eh_7', ['clEvaluator.h', ['../a00803.html', 1, '']]],\n ['clpatchtable_8', ['clpatchtable', ['../a01145.html', 1, 'CLPatchTable'],\n ['../a01145.html#ae69549a9493f9a51edfa7d11cec1d72f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLPatchTable::CLPatchTable()']\n ]],\n ['clpatchtable_2eh_9', ['clPatchTable.h', ['../a00800.html', 1, '']]],\n ['clstenciltable_10', ['clstenciltable', ['../a01137.html#af2994e79cf93c872e39659321750351a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLStencilTable::CLStencilTable()'],\n ['../a01137.html', 1, 'CLStencilTable'],\n ['../a01137.html#a33ca6bb1dba9f8e390a58395d164431e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLStencilTable::CLStencilTable()']\n ]],\n ['clvertexbuffer_11', ['clvertexbuffer', ['../a01149.html#a48e2b665b557d5f3f838bc552152160b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLVertexBuffer::CLVertexBuffer()'],\n ['../a01149.html', 1, 'CLVertexBuffer']\n ]],\n- ['clvertexbuffer_2eh_12', ['clVertexBuffer.h', ['../a00794.html', 1, '']]],\n+ ['clvertexbuffer_2eh_12', ['clVertexBuffer.h', ['../a00797.html', 1, '']]],\n ['combinevertexvertexmasks_13', ['CombineVertexVertexMasks', ['../a01337.html#a5ed800e9d702f57ae978fe60ba2a37dc', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Scheme::LocalMask']]],\n ['commandqueue_14', ['commandQueue', ['../a01277.html#a66809eb79c7e79a491fd8c889465166b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLContext']]],\n ['compile_15', ['compile', ['../a01141.html#ade1086349c1a452f60bcf281383ceec2', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLEvaluator::Compile()'],\n ['../a01193.html#a872e69a9fbf6f7b9f55112ecaf0c1b20', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11ComputeEvaluator::Compile()'],\n ['../a01213.html#ade1086349c1a452f60bcf281383ceec2', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLComputeEvaluator::Compile()'],\n ['../a01285.html#af6645aabc094e7549c6899915ce34f67', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLComputeEvaluator::Compile()'],\n ['../a01245.html#ade1086349c1a452f60bcf281383ceec2', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLXFBEvaluator::Compile()']\n@@ -77,15 +77,15 @@\n ['converttocompatiblestenciltable_3c_20far_3a_3astenciltable_2c_20far_3a_3astenciltable_2c_20id3d11devicecontext_20_3e_41', ['convertToCompatibleStencilTable< Far::StencilTable, Far::StencilTable, ID3D11DeviceContext >', ['../a00912.html#ab5753a2b0a0995c8e2259d2c4765f7df', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['converttocompatiblestenciltable_3c_20far_3a_3astenciltable_2c_20far_3a_3astenciltable_2c_20void_20_3e_42', ['convertToCompatibleStencilTable< Far::StencilTable, Far::StencilTable, void >', ['../a00912.html#a33f9830228f847fae1c30c9dffe02b5a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['cornervertexindices_43', ['cornerVertexIndices', ['../a01097.html#a3bf794743edda29fbee0653b65b75ba4', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]],\n ['cornerweights_44', ['cornerWeights', ['../a01097.html#a6d938f6b0a9ff0fa377ef675aa2c7fda', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]],\n ['cpud3d11vertexbuffer_45', ['cpud3d11vertexbuffer', ['../a01153.html', 1, 'CpuD3D11VertexBuffer'],\n ['../a01153.html#a632143bc1ec4fbbca2148b0e9e87bc08', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CpuD3D11VertexBuffer::CpuD3D11VertexBuffer()']\n ]],\n- ['cpud3d11vertexbuffer_2eh_46', ['cpuD3D11VertexBuffer.h', ['../a00845.html', 1, '']]],\n+ ['cpud3d11vertexbuffer_2eh_46', ['cpuD3D11VertexBuffer.h', ['../a00842.html', 1, '']]],\n ['cpuevaluator_47', ['CpuEvaluator', ['../a01157.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['cpuevaluator_2eh_48', ['cpuEvaluator.h', ['../a00896.html', 1, '']]],\n ['cpuglvertexbuffer_49', ['cpuglvertexbuffer', ['../a01161.html', 1, 'CpuGLVertexBuffer'],\n ['../a01161.html#a32dd2317d622c1b079e3219f97c86955', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CpuGLVertexBuffer::CpuGLVertexBuffer()']\n ]],\n ['cpuglvertexbuffer_2eh_50', ['cpuGLVertexBuffer.h', ['../a00869.html', 1, '']]],\n ['cpumtlvertexbuffer_51', ['cpumtlvertexbuffer', ['../a01301.html', 1, 'CPUMTLVertexBuffer'],\n@@ -174,15 +174,15 @@\n ]],\n ['createfacevaryingsurface_65', ['createfacevaryingsurface', ['../a00941.html#a67a5dcab87b052d231634dd9fcf5dee2', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactory::CreateFaceVaryingSurface(Index faceIndex) const'],\n ['../a00941.html#a59227e292ea63aa9641a090521cfd457', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactory::CreateFaceVaryingSurface(Index faceIndex, FVarID id) const']\n ]],\n ['createvaryingsurface_66', ['CreateVaryingSurface', ['../a00941.html#a81638f2ff6818fd96aa7cd1ad3ed0703', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactory']]],\n ['createvertexsurface_67', ['CreateVertexSurface', ['../a00941.html#a676cf019574c99fa77341ac09889192d', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactory']]],\n ['cudaevaluator_68', ['CudaEvaluator', ['../a01177.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n- ['cudaevaluator_2eh_69', ['cudaEvaluator.h', ['../a00791.html', 1, '']]],\n+ ['cudaevaluator_2eh_69', ['cudaEvaluator.h', ['../a00794.html', 1, '']]],\n ['cudapatchtable_70', ['cudapatchtable', ['../a01181.html', 1, 'CudaPatchTable'],\n ['../a01181.html#aefa9c1a9175327a40e7cf46ed32ced2f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CudaPatchTable::CudaPatchTable()']\n ]],\n ['cudapatchtable_2eh_71', ['cudaPatchTable.h', ['../a00788.html', 1, '']]],\n ['cudastenciltable_72', ['cudastenciltable', ['../a01173.html#a45150c630c07bbeabd4b91145cecf087', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CudaStencilTable::CudaStencilTable()'],\n ['../a01173.html', 1, 'CudaStencilTable'],\n ['../a01173.html#af872fc469b3696a745d30d22c2b89c4c', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CudaStencilTable::CudaStencilTable()']\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_4.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_4.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,17 +1,17 @@\n var searchData = [\n ['d3d11computeevaluator_0', ['d3d11computeevaluator', ['../a01193.html', 1, 'D3D11ComputeEvaluator'],\n ['../a01193.html#aa81511d3938d70d67a62217951cb8eb7', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11ComputeEvaluator::D3D11ComputeEvaluator()']\n ]],\n- ['d3d11computeevaluator_2eh_1', ['d3d11ComputeEvaluator.h', ['../a00842.html', 1, '']]],\n+ ['d3d11computeevaluator_2eh_1', ['d3d11ComputeEvaluator.h', ['../a00845.html', 1, '']]],\n ['d3d11legacygregorypatchtable_2', ['d3d11legacygregorypatchtable', ['../a01197.html', 1, 'D3D11LegacyGregoryPatchTable'],\n ['../a01197.html#af138b4535e4db5f013225c5924e0b243', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11LegacyGregoryPatchTable::D3D11LegacyGregoryPatchTable()']\n ]],\n ['d3d11legacygregorypatchtable_2eh_3', ['d3d11LegacyGregoryPatchTable.h', ['../a00839.html', 1, '']]],\n- ['d3d11mesh_2eh_4', ['d3d11Mesh.h', ['../a00827.html', 1, '']]],\n+ ['d3d11mesh_2eh_4', ['d3d11Mesh.h', ['../a00830.html', 1, '']]],\n ['d3d11meshinterface_5', ['D3D11MeshInterface', ['../a00912.html#ae5c8e80d05d6eaee105d8eecfa9ab609', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['d3d11patchtable_6', ['d3d11patchtable', ['../a01201.html#ac81ed5f09e3d3a2aae5a01802b343a6d', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11PatchTable::D3D11PatchTable()'],\n ['../a01201.html', 1, 'D3D11PatchTable']\n ]],\n ['d3d11patchtable_2eh_7', ['d3d11PatchTable.h', ['../a00836.html', 1, '']]],\n ['d3d11stenciltable_8', ['d3d11stenciltable', ['../a01189.html', 1, 'D3D11StencilTable'],\n ['../a01189.html#a7e3a2f5c281c55308400138222797dbc', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11StencilTable::D3D11StencilTable()']\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_6.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_6.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -31,12 +31,12 @@\n ['../a01081.html#a7cd8273eef086a749ce3d40063fb4a28', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal::Options::fvarChannel'],\n ['../a01101.html#a029d281df9f5dc8c00b52a35f8e0dfde', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor::FVarChannel::FVarChannel()'],\n ['../a01101.html', 1, 'TopologyDescriptor::FVarChannel']\n ]],\n ['fvarchannelindices_25', ['fvarChannelIndices', ['../a01013.html#a4c1ba8119a16ea0682a870ee7a8282a5', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTableFactory::Options']]],\n ['fvarchannels_26', ['fvarChannels', ['../a01097.html#a222697ec045f92879ae194eb2d92b526', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]],\n ['fvarid_27', ['FVarID', ['../a00957.html#af98288d7b5176d7295be622a10c6c64e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::SurfaceFactoryMeshAdapter']]],\n- ['fvarlevel_2eh_28', ['fvarLevel.h', ['../a00758.html', 1, '']]],\n+ ['fvarlevel_2eh_28', ['fvarLevel.h', ['../a00761.html', 1, '']]],\n ['fvarlinearinterpolation_29', ['FVarLinearInterpolation', ['../a01329.html#a5b87eaca6ca0833462c9d4ad84df167b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Options']]],\n ['fvarpatchprecisiondouble_30', ['fvarPatchPrecisionDouble', ['../a01013.html#a3f663e5c2b7e65976b6521c21ea59130', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTableFactory::Options']]],\n- ['fvarrefinement_2eh_31', ['fvarRefinement.h', ['../a00761.html', 1, '']]]\n+ ['fvarrefinement_2eh_31', ['fvarRefinement.h', ['../a00758.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_7.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_7.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -525,35 +525,35 @@\n ['glcomputeevaluator_268', ['glcomputeevaluator', ['../a01213.html#a9fe54ab76e32fb2dc6f7cd631ce2e678', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLComputeEvaluator::GLComputeEvaluator()'],\n ['../a01213.html', 1, 'GLComputeEvaluator']\n ]],\n ['glcomputeevaluator_2eh_269', ['glComputeEvaluator.h', ['../a00848.html', 1, '']]],\n ['gllegacygregorypatchtable_270', ['gllegacygregorypatchtable', ['../a01225.html#a5b78188b846b316c5c0cdb42f4ee9563', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLLegacyGregoryPatchTable::GLLegacyGregoryPatchTable()'],\n ['../a01225.html', 1, 'GLLegacyGregoryPatchTable']\n ]],\n- ['gllegacygregorypatchtable_2eh_271', ['glLegacyGregoryPatchTable.h', ['../a00863.html', 1, '']]],\n+ ['gllegacygregorypatchtable_2eh_271', ['glLegacyGregoryPatchTable.h', ['../a00866.html', 1, '']]],\n ['glmesh_2eh_272', ['glMesh.h', ['../a00857.html', 1, '']]],\n ['glmeshinterface_273', ['GLMeshInterface', ['../a00912.html#a7f9cf2b729178bdbb847fc4afd91af9e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['glpatchtable_274', ['glpatchtable', ['../a01229.html#a88c12681f62189c398c1d2dc32111264', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLPatchTable::GLPatchTable()'],\n ['../a01229.html', 1, 'GLPatchTable']\n ]],\n- ['glpatchtable_2eh_275', ['glPatchTable.h', ['../a00866.html', 1, '']]],\n+ ['glpatchtable_2eh_275', ['glPatchTable.h', ['../a00860.html', 1, '']]],\n ['glslpatchshadersource_276', ['GLSLPatchShaderSource', ['../a01233.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['glslpatchshadersource_2eh_277', ['glslPatchShaderSource.h', ['../a00854.html', 1, '']]],\n ['glstenciltablessbo_278', ['glstenciltablessbo', ['../a01209.html', 1, 'GLStencilTableSSBO'],\n ['../a01209.html#aaacee6173a99bb3d7bbfb0a352ef9828', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLStencilTableSSBO::GLStencilTableSSBO(Far::StencilTable const *stencilTable)'],\n ['../a01209.html#a27a911fea9736fbe935c0edc4de9b998', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLStencilTableSSBO::GLStencilTableSSBO(Far::LimitStencilTable const *limitStencilTable)']\n ]],\n ['glstenciltabletbo_279', ['glstenciltabletbo', ['../a01241.html', 1, 'GLStencilTableTBO'],\n ['../a01241.html#abbba46ba67be00a0eac751e3e731db6e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLStencilTableTBO::GLStencilTableTBO(Far::StencilTable const *stencilTable)'],\n ['../a01241.html#ac74a769daf1fe45575a16b738bb761cd', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLStencilTableTBO::GLStencilTableTBO(Far::LimitStencilTable const *limitStencilTable)']\n ]],\n ['glvertexbuffer_280', ['glvertexbuffer', ['../a01237.html', 1, 'GLVertexBuffer'],\n ['../a01237.html#aa6f38a53fba4a64d600b9c4695477049', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLVertexBuffer::GLVertexBuffer()']\n ]],\n- ['glvertexbuffer_2eh_281', ['glVertexBuffer.h', ['../a00860.html', 1, '']]],\n+ ['glvertexbuffer_2eh_281', ['glVertexBuffer.h', ['../a00863.html', 1, '']]],\n ['glxfbevaluator_282', ['glxfbevaluator', ['../a01245.html#a1932f725b28e271ab11ca768ba3bb01e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLXFBEvaluator::GLXFBEvaluator()'],\n ['../a01245.html', 1, 'GLXFBEvaluator']\n ]],\n ['glxfbevaluator_2eh_283', ['glXFBEvaluator.h', ['../a00851.html', 1, '']]],\n ['gregory_284', ['GREGORY', ['../a00973.html#a1d1cfd8ffb84e947f82999c682b666a7ae765e809376e5557d348d3e991a7273e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchDescriptor']]],\n ['gregory_5fbasis_285', ['GREGORY_BASIS', ['../a00973.html#a1d1cfd8ffb84e947f82999c682b666a7ad7d1a88a40ae8938e07af7a7745054b0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchDescriptor']]],\n ['gregory_5fboundary_286', ['GREGORY_BOUNDARY', ['../a00973.html#a1d1cfd8ffb84e947f82999c682b666a7ac4ae10df9c13e44880ca7be341e44f2a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchDescriptor']]],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_8.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_8.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -4,10 +4,10 @@\n ]],\n ['hasedgesharpness_1', ['HasEdgeSharpness', ['../a00969.html#a2c6d182581c88931784f62fe2b8ae666', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['hasholes_2', ['HasHoles', ['../a01113.html#a1b68f0501aabb94ba410e006181d2cc5', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner']]],\n ['hasincidentfacesizes_3', ['HasIncidentFaceSizes', ['../a00969.html#ad56c50bc5582768806d7890c55b63141', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['hassubfaces_4', ['HasSubFaces', ['../a00921.html#adc4cd156a8fdb843b0e233a922bb8a17', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Parameterization']]],\n ['hasvertexsharpness_5', ['HasVertexSharpness', ['../a00969.html#a4f46be1cfd41b34d8808363c83e9ff56', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['hlslpatchshadersource_6', ['HLSLPatchShaderSource', ['../a01257.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n- ['hlslpatchshadersource_2eh_7', ['hlslPatchShaderSource.h', ['../a00830.html', 1, '']]],\n+ ['hlslpatchshadersource_2eh_7', ['hlslPatchShaderSource.h', ['../a00827.html', 1, '']]],\n ['holeindices_8', ['holeIndices', ['../a01097.html#a4fcd8e9a636d89045d364607f2b035a1', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_b.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_b.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -22,26 +22,26 @@\n ['meshinterleavevarying_16', ['MeshInterleaveVarying', ['../a00912.html#a1af6b50e9f8ae13d3d2f9d5b03b35492a9313c644b9b2a998bcb55cfcc4582b1a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['meshuseinfsharppatch_17', ['MeshUseInfSharpPatch', ['../a00912.html#a1af6b50e9f8ae13d3d2f9d5b03b35492a8fab1b3018f94b5b2432c7435e795925', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['meshusesinglecreasepatch_18', ['MeshUseSingleCreasePatch', ['../a00912.html#a1af6b50e9f8ae13d3d2f9d5b03b35492a9058d69e1089fc77f1974a76c34e2071', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['meshusesmoothcornerpatch_19', ['MeshUseSmoothCornerPatch', ['../a00912.html#a1af6b50e9f8ae13d3d2f9d5b03b35492ab32b8ef595539e14041e2fb0e619e3f9', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['mode_20', ['mode', ['../a01037.html#a46c8a310cf4c094f8c80e1cb8dc1f911', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableFactoryReal::Mode'],\n ['../a01041.html#a46c8a310cf4c094f8c80e1cb8dc1f911', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal::Mode']\n ]],\n- ['mtlcommon_2eh_21', ['mtlCommon.h', ['../a00803.html', 1, '']]],\n+ ['mtlcommon_2eh_21', ['mtlCommon.h', ['../a00806.html', 1, '']]],\n ['mtlcomputeevaluator_22', ['mtlcomputeevaluator', ['../a01285.html#a10015b2c4f90f3a11e60cc88dcbb9d6b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLComputeEvaluator::MTLComputeEvaluator()'],\n ['../a01285.html', 1, 'MTLComputeEvaluator']\n ]],\n ['mtlcomputeevaluator_2eh_23', ['mtlComputeEvaluator.h', ['../a00821.html', 1, '']]],\n ['mtlcontext_24', ['MTLContext', ['../a01277.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['mtllegacygregorypatchtable_25', ['MTLLegacyGregoryPatchTable', ['../a01289.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['mtllegacygregorypatchtable_2eh_26', ['mtlLegacyGregoryPatchTable.h', ['../a00818.html', 1, '']]],\n- ['mtlmesh_2eh_27', ['mtlMesh.h', ['../a00809.html', 1, '']]],\n+ ['mtlmesh_2eh_27', ['mtlMesh.h', ['../a00812.html', 1, '']]],\n ['mtlmeshinterface_28', ['MTLMeshInterface', ['../a00912.html#aa41e5b43fe46eeb0f97ff6ebdb1935aa', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['mtlpatchshadersource_29', ['MTLPatchShaderSource', ['../a01293.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n- ['mtlpatchshadersource_2eh_30', ['mtlPatchShaderSource.h', ['../a00812.html', 1, '']]],\n+ ['mtlpatchshadersource_2eh_30', ['mtlPatchShaderSource.h', ['../a00809.html', 1, '']]],\n ['mtlpatchtable_31', ['mtlpatchtable', ['../a01297.html', 1, 'MTLPatchTable'],\n ['../a01297.html#a3f197c2ae3862390d72e7443a2525187', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLPatchTable::MTLPatchTable()']\n ]],\n ['mtlpatchtable_2eh_32', ['mtlPatchTable.h', ['../a00815.html', 1, '']]],\n ['mtlstenciltable_33', ['mtlstenciltable', ['../a01281.html', 1, 'MTLStencilTable'],\n ['../a01281.html#a015dc72c3360b4841ee2b3feb06c106f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLStencilTable::MTLStencilTable(Far::LimitStencilTable const *stencilTable, MTLContext *context)'],\n ['../a01281.html#a45e329ffe9fe4e32a1b21bfc89a6763f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLStencilTable::MTLStencilTable(Far::StencilTable const *stencilTable, MTLContext *context)']\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_d.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_d.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,17 +1,17 @@\n var searchData = [\n ['offset_0', ['offset', ['../a01133.html#aed7ea92f45bd273dde380a45ddced592', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::BufferDescriptor']]],\n ['ompevalstencils_1', ['ompevalstencils', ['../a00912.html#a44a05502feb5015035bc81b93cffb99c', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::OmpEvalStencils(float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *dstDu, BufferDescriptor const &dstDuDesc, float *dstDv, BufferDescriptor const &dstDvDesc, float *dstDuu, BufferDescriptor const &dstDuuDesc, float *dstDuv, BufferDescriptor const &dstDuvDesc, float *dstDvv, BufferDescriptor const &dstDvvDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, float const *duWeights, float const *dvWeights, float const *duuWeights, float const *duvWeights, float const *dvvWeights, int start, int end)'],\n ['../a00912.html#a907dc53421460557871ddc35f77751f5', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::OmpEvalStencils(float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *dstDu, BufferDescriptor const &dstDuDesc, float *dstDv, BufferDescriptor const &dstDvDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, float const *duWeights, float const *dvWeights, int start, int end)'],\n ['../a00912.html#a870745ff3e883b32547d4db42b3be2bd', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::OmpEvalStencils(float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, int start, int end)']\n ]],\n ['ompevaluator_2', ['OmpEvaluator', ['../a01305.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n- ['ompevaluator_2eh_3', ['ompEvaluator.h', ['../a00878.html', 1, '']]],\n- ['ompkernel_2eh_4', ['ompKernel.h', ['../a00881.html', 1, '']]],\n- ['opencl_2eh_5', ['opencl.h', ['../a00797.html', 1, '']]],\n+ ['ompevaluator_2eh_3', ['ompEvaluator.h', ['../a00881.html', 1, '']]],\n+ ['ompkernel_2eh_4', ['ompKernel.h', ['../a00878.html', 1, '']]],\n+ ['opencl_2eh_5', ['opencl.h', ['../a00791.html', 1, '']]],\n ['opengl_2eh_6', ['opengl.h', ['../a00884.html', 1, '']]],\n ['opensubdiv_7', ['OpenSubdiv', ['../a00905.html', 1, '']]],\n ['opensubdiv_3a_3aopensubdiv_5fversion_8', ['OPENSUBDIV_VERSION', ['../a00906.html', 1, 'OpenSubdiv']]],\n ['opensubdiv_3a_3aopensubdiv_5fversion_3a_3abfr_9', ['Bfr', ['../a00907.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION']]],\n ['opensubdiv_3a_3aopensubdiv_5fversion_3a_3afar_10', ['Far', ['../a00908.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION']]],\n ['opensubdiv_3a_3aopensubdiv_5fversion_3a_3aosd_11', ['Osd', ['../a00912.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION']]],\n ['opensubdiv_3a_3aopensubdiv_5fversion_3a_3asdc_12', ['Sdc', ['../a00913.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION']]],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_e.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_e.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,14 +1,14 @@\n var searchData = [\n ['parameterization_0', ['parameterization', ['../a00921.html#a64a4b29d36851a8d83be05af5b25f886', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Parameterization::Parameterization(Parameterization const &)=default'],\n ['../a00921.html#aa7e0b89d67d34c1dd7a37cdce95f9e2c', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Parameterization::Parameterization()'],\n ['../a00921.html#a301ad64c8ae0a3ba3af84377138a069f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Parameterization::Parameterization(Sdc::SchemeType scheme, int faceSize)'],\n ['../a00921.html', 1, 'Parameterization']\n ]],\n- ['parameterization_2eh_1', ['parameterization.h', ['../a00695.html', 1, '']]],\n+ ['parameterization_2eh_1', ['parameterization.h', ['../a00692.html', 1, '']]],\n ['patcharray_2', ['patcharray', ['../a01317.html', 1, 'PatchArray'],\n ['../a01317.html#ad9821423935395f540ff8d37d907600a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::PatchArray::PatchArray(Far::PatchDescriptor regDesc_in, Far::PatchDescriptor irregDesc_in, int numPatches_in, int indexBase_in, int primitiveIdBase_in)'],\n ['../a01317.html#a9c551db8af15f4a0ddf4c2a13ce2505e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::PatchArray::PatchArray(Far::PatchDescriptor desc_in, int numPatches_in, int indexBase_in, int primitiveIdBase_in)']\n ]],\n ['patcharrayvector_3', ['PatchArrayVector', ['../a00912.html#a98098cd229f60d2397d84a76fe654a31', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['patchbuilder_4', ['PatchBuilder', ['../a01113.html#a97612a1a955f8b65e6d7e7761ed1cef7', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner']]],\n ['patchcoord_5', ['patchcoord', ['../a01313.html#abe64006c4fe55b720f483bd7711bf216', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::PatchCoord::PatchCoord(Far::PatchTable::PatchHandle handleArg, float sArg, float tArg)'],\n@@ -45,15 +45,15 @@\n ['../a01261.html#adf9352136d44e5999629c6b4530bf4e0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MeshInterface::PatchTable']\n ]],\n ['patchtable_2eh_20', ['patchTable.h', ['../a00731.html', 1, '']]],\n ['patchtablebuilder_21', ['patchtablebuilder', ['../a00993.html#ad452cef79832abb71eef0c3d88acc1a0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::PatchTableBuilder'],\n ['../a01113.html#ad452cef79832abb71eef0c3d88acc1a0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::PatchTableBuilder']\n ]],\n ['patchtablefactory_22', ['PatchTableFactory', ['../a01009.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n- ['patchtablefactory_2eh_23', ['patchTableFactory.h', ['../a00728.html', 1, '']]],\n+ ['patchtablefactory_2eh_23', ['patchTableFactory.h', ['../a00725.html', 1, '']]],\n ['patchtagvector_24', ['PatchTagVector', ['../a01009.html#a37218ea13f75caee4c93cc4e94d26060', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTableFactory']]],\n ['patchvertstable_25', ['PatchVertsTable', ['../a00993.html#a9484ab8a323750c2f639ee8709b1349b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable']]],\n ['pointdescriptor_26', ['pointdescriptor', ['../a00937.html', 1, 'Surface< REAL >::PointDescriptor'],\n ['../a00937.html#ac60ab7fa3966237e2de95cc60defa4de', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface::PointDescriptor::PointDescriptor()'],\n ['../a00937.html#a69d66788e741236b1176159a1d609189', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface::PointDescriptor::PointDescriptor(int n)'],\n ['../a00937.html#a6e6069bdfef867e798fe863f40f4274a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface::PointDescriptor::PointDescriptor(int n, int m)']\n ]],\n@@ -69,15 +69,15 @@\n ['preservequads_36', ['preservequads', ['../a00965.html#a98820ec764e776bd556a9b80b872b78f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::Options::PreserveQuads(bool on)'],\n ['../a00965.html#ae2ec197b850e8bd12878cc67a503a07a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::Options::PreserveQuads() const']\n ]],\n ['primitiveidbase_37', ['primitiveIdBase', ['../a01317.html#a5a054ce6862ecc6ea8c404fadb1c9a15', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::PatchArray']]],\n ['primvarrefiner_38', ['primvarrefiner', ['../a01029.html#a643d81a2ae20ba1897433f5af5a3697a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PrimvarRefiner::PrimvarRefiner()'],\n ['../a01029.html', 1, 'PrimvarRefiner']\n ]],\n- ['primvarrefiner_2eh_39', ['primvarRefiner.h', ['../a00725.html', 1, '']]],\n+ ['primvarrefiner_2eh_39', ['primvarRefiner.h', ['../a00728.html', 1, '']]],\n ['primvarrefinerreal_40', ['primvarrefinerreal', ['../a01113.html#a2cb48b58c1c2ecef25abb39339a95ac1', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::PrimvarRefinerReal'],\n ['../a01021.html#a1fe1fbda93c01c326f13929d1c3c6247', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PrimvarRefinerReal::PrimvarRefinerReal()'],\n ['../a01021.html', 1, 'PrimvarRefinerReal< REAL >']\n ]],\n ['primvarrefinerreal_3c_20float_20_3e_41', ['PrimvarRefinerReal< float >', ['../a01021.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n ['print_42', ['print', ['../a00973.html#acd0f82d3c49b8a5dd436d4003c44b713', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchDescriptor::print()'],\n ['../a00993.html#acd0f82d3c49b8a5dd436d4003c44b713', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::print()']\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_1.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_1.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,4 @@\n var searchData = [\n- ['bilinearscheme_2eh_0', ['bilinearScheme.h', ['../a00785.html', 1, '']]],\n+ ['bilinearscheme_2eh_0', ['bilinearScheme.h', ['../a00782.html', 1, '']]],\n ['bufferdescriptor_2eh_1', ['bufferDescriptor.h', ['../a00899.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_2.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_2.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,16 +1,16 @@\n var searchData = [\n- ['catmarkscheme_2eh_0', ['catmarkScheme.h', ['../a00782.html', 1, '']]],\n- ['clevaluator_2eh_1', ['clEvaluator.h', ['../a00806.html', 1, '']]],\n+ ['catmarkscheme_2eh_0', ['catmarkScheme.h', ['../a00785.html', 1, '']]],\n+ ['clevaluator_2eh_1', ['clEvaluator.h', ['../a00803.html', 1, '']]],\n ['clpatchtable_2eh_2', ['clPatchTable.h', ['../a00800.html', 1, '']]],\n- ['clvertexbuffer_2eh_3', ['clVertexBuffer.h', ['../a00794.html', 1, '']]],\n+ ['clvertexbuffer_2eh_3', ['clVertexBuffer.h', ['../a00797.html', 1, '']]],\n ['componentinterfaces_2eh_4', ['componentInterfaces.h', ['../a00764.html', 1, '']]],\n- ['cpud3d11vertexbuffer_2eh_5', ['cpuD3D11VertexBuffer.h', ['../a00845.html', 1, '']]],\n+ ['cpud3d11vertexbuffer_2eh_5', ['cpuD3D11VertexBuffer.h', ['../a00842.html', 1, '']]],\n ['cpuevaluator_2eh_6', ['cpuEvaluator.h', ['../a00896.html', 1, '']]],\n ['cpuglvertexbuffer_2eh_7', ['cpuGLVertexBuffer.h', ['../a00869.html', 1, '']]],\n ['cpupatchtable_2eh_8', ['cpuPatchTable.h', ['../a00893.html', 1, '']]],\n ['cpuvertexbuffer_2eh_9', ['cpuVertexBuffer.h', ['../a00890.html', 1, '']]],\n ['crease_2eh_10', ['crease.h', ['../a00779.html', 1, '']]],\n- ['cudaevaluator_2eh_11', ['cudaEvaluator.h', ['../a00791.html', 1, '']]],\n+ ['cudaevaluator_2eh_11', ['cudaEvaluator.h', ['../a00794.html', 1, '']]],\n ['cudapatchtable_2eh_12', ['cudaPatchTable.h', ['../a00788.html', 1, '']]],\n ['cudavertexbuffer_2eh_13', ['cudaVertexBuffer.h', ['../a00902.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_3.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_3.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,7 +1,7 @@\n var searchData = [\n- ['d3d11computeevaluator_2eh_0', ['d3d11ComputeEvaluator.h', ['../a00842.html', 1, '']]],\n+ ['d3d11computeevaluator_2eh_0', ['d3d11ComputeEvaluator.h', ['../a00845.html', 1, '']]],\n ['d3d11legacygregorypatchtable_2eh_1', ['d3d11LegacyGregoryPatchTable.h', ['../a00839.html', 1, '']]],\n- ['d3d11mesh_2eh_2', ['d3d11Mesh.h', ['../a00827.html', 1, '']]],\n+ ['d3d11mesh_2eh_2', ['d3d11Mesh.h', ['../a00830.html', 1, '']]],\n ['d3d11patchtable_2eh_3', ['d3d11PatchTable.h', ['../a00836.html', 1, '']]],\n ['d3d11vertexbuffer_2eh_4', ['d3d11VertexBuffer.h', ['../a00833.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_5.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_5.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,4 @@\n var searchData = [\n- ['fvarlevel_2eh_0', ['fvarLevel.h', ['../a00758.html', 1, '']]],\n- ['fvarrefinement_2eh_1', ['fvarRefinement.h', ['../a00761.html', 1, '']]]\n+ ['fvarlevel_2eh_0', ['fvarLevel.h', ['../a00761.html', 1, '']]],\n+ ['fvarrefinement_2eh_1', ['fvarRefinement.h', ['../a00758.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_6.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_6.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,9 @@\n var searchData = [\n ['glcomputeevaluator_2eh_0', ['glComputeEvaluator.h', ['../a00848.html', 1, '']]],\n- ['gllegacygregorypatchtable_2eh_1', ['glLegacyGregoryPatchTable.h', ['../a00863.html', 1, '']]],\n+ ['gllegacygregorypatchtable_2eh_1', ['glLegacyGregoryPatchTable.h', ['../a00866.html', 1, '']]],\n ['glmesh_2eh_2', ['glMesh.h', ['../a00857.html', 1, '']]],\n- ['glpatchtable_2eh_3', ['glPatchTable.h', ['../a00866.html', 1, '']]],\n+ ['glpatchtable_2eh_3', ['glPatchTable.h', ['../a00860.html', 1, '']]],\n ['glslpatchshadersource_2eh_4', ['glslPatchShaderSource.h', ['../a00854.html', 1, '']]],\n- ['glvertexbuffer_2eh_5', ['glVertexBuffer.h', ['../a00860.html', 1, '']]],\n+ ['glvertexbuffer_2eh_5', ['glVertexBuffer.h', ['../a00863.html', 1, '']]],\n ['glxfbevaluator_2eh_6', ['glXFBEvaluator.h', ['../a00851.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_7.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_7.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var searchData = [\n- ['hlslpatchshadersource_2eh_0', ['hlslPatchShaderSource.h', ['../a00830.html', 1, '']]]\n+ ['hlslpatchshadersource_2eh_0', ['hlslPatchShaderSource.h', ['../a00827.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_9.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_9.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,10 +1,10 @@\n var searchData = [\n ['mesh_2eh_0', ['mesh.h', ['../a00887.html', 1, '']]],\n- ['mtlcommon_2eh_1', ['mtlCommon.h', ['../a00803.html', 1, '']]],\n+ ['mtlcommon_2eh_1', ['mtlCommon.h', ['../a00806.html', 1, '']]],\n ['mtlcomputeevaluator_2eh_2', ['mtlComputeEvaluator.h', ['../a00821.html', 1, '']]],\n ['mtllegacygregorypatchtable_2eh_3', ['mtlLegacyGregoryPatchTable.h', ['../a00818.html', 1, '']]],\n- ['mtlmesh_2eh_4', ['mtlMesh.h', ['../a00809.html', 1, '']]],\n- ['mtlpatchshadersource_2eh_5', ['mtlPatchShaderSource.h', ['../a00812.html', 1, '']]],\n+ ['mtlmesh_2eh_4', ['mtlMesh.h', ['../a00812.html', 1, '']]],\n+ ['mtlpatchshadersource_2eh_5', ['mtlPatchShaderSource.h', ['../a00809.html', 1, '']]],\n ['mtlpatchtable_2eh_6', ['mtlPatchTable.h', ['../a00815.html', 1, '']]],\n ['mtlvertexbuffer_2eh_7', ['mtlVertexBuffer.h', ['../a00824.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_a.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_a.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,7 +1,7 @@\n var searchData = [\n- ['ompevaluator_2eh_0', ['ompEvaluator.h', ['../a00878.html', 1, '']]],\n- ['ompkernel_2eh_1', ['ompKernel.h', ['../a00881.html', 1, '']]],\n- ['opencl_2eh_2', ['opencl.h', ['../a00797.html', 1, '']]],\n+ ['ompevaluator_2eh_0', ['ompEvaluator.h', ['../a00881.html', 1, '']]],\n+ ['ompkernel_2eh_1', ['ompKernel.h', ['../a00878.html', 1, '']]],\n+ ['opencl_2eh_2', ['opencl.h', ['../a00791.html', 1, '']]],\n ['opengl_2eh_3', ['opengl.h', ['../a00884.html', 1, '']]],\n ['options_2eh_4', ['options.h', ['../a00773.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_b.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_b.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,10 +1,10 @@\n var searchData = [\n- ['parameterization_2eh_0', ['parameterization.h', ['../a00695.html', 1, '']]],\n+ ['parameterization_2eh_0', ['parameterization.h', ['../a00692.html', 1, '']]],\n ['patchdescriptor_2eh_1', ['patchDescriptor.h', ['../a00740.html', 1, '']]],\n ['patchmap_2eh_2', ['patchMap.h', ['../a00734.html', 1, '']]],\n ['patchparam_2eh_3', ['patchParam.h', ['../a00737.html', 1, '']]],\n ['patchtable_2eh_4', ['patchTable.h', ['../a00731.html', 1, '']]],\n- ['patchtablefactory_2eh_5', ['patchTableFactory.h', ['../a00728.html', 1, '']]],\n- ['primvarrefiner_2eh_6', ['primvarRefiner.h', ['../a00725.html', 1, '']]],\n+ ['patchtablefactory_2eh_5', ['patchTableFactory.h', ['../a00725.html', 1, '']]],\n+ ['primvarrefiner_2eh_6', ['primvarRefiner.h', ['../a00728.html', 1, '']]],\n ['ptexindices_2eh_7', ['ptexIndices.h', ['../a00722.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_c.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_c.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,4 @@\n var searchData = [\n ['refinement_2eh_0', ['refinement.h', ['../a00752.html', 1, '']]],\n- ['refinersurfacefactory_2eh_1', ['refinerSurfaceFactory.h', ['../a00692.html', 1, '']]]\n+ ['refinersurfacefactory_2eh_1', ['refinerSurfaceFactory.h', ['../a00695.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_d.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_d.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,11 +1,11 @@\n var searchData = [\n ['scheme_2eh_0', ['scheme.h', ['../a00770.html', 1, '']]],\n ['sparseselector_2eh_1', ['sparseSelector.h', ['../a00749.html', 1, '']]],\n ['stackbuffer_2eh_2', ['stackBuffer.h', ['../a00746.html', 1, '']]],\n ['stenciltable_2eh_3', ['stencilTable.h', ['../a00719.html', 1, '']]],\n- ['stenciltablefactory_2eh_4', ['stencilTableFactory.h', ['../a00713.html', 1, '']]],\n+ ['stenciltablefactory_2eh_4', ['stencilTableFactory.h', ['../a00716.html', 1, '']]],\n ['surface_2eh_5', ['surface.h', ['../a00689.html', 1, '']]],\n- ['surfacefactory_2eh_6', ['surfaceFactory.h', ['../a00680.html', 1, '']]],\n- ['surfacefactorycache_2eh_7', ['surfaceFactoryCache.h', ['../a00683.html', 1, '']]],\n- ['surfacefactorymeshadapter_2eh_8', ['surfaceFactoryMeshAdapter.h', ['../a00686.html', 1, '']]]\n+ ['surfacefactory_2eh_6', ['surfaceFactory.h', ['../a00686.html', 1, '']]],\n+ ['surfacefactorycache_2eh_7', ['surfaceFactoryCache.h', ['../a00680.html', 1, '']]],\n+ ['surfacefactorymeshadapter_2eh_8', ['surfaceFactoryMeshAdapter.h', ['../a00683.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_e.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_e.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,12 +1,12 @@\n var searchData = [\n ['tbbevaluator_2eh_0', ['tbbEvaluator.h', ['../a00875.html', 1, '']]],\n ['tbbkernel_2eh_1', ['tbbKernel.h', ['../a00872.html', 1, '']]],\n ['tessellation_2eh_2', ['tessellation.h', ['../a00677.html', 1, '']]],\n- ['topologydescriptor_2eh_3', ['topologyDescriptor.h', ['../a00716.html', 1, '']]],\n+ ['topologydescriptor_2eh_3', ['topologyDescriptor.h', ['../a00713.html', 1, '']]],\n ['topologylevel_2eh_4', ['topologyLevel.h', ['../a00710.html', 1, '']]],\n ['topologyrefiner_2eh_5', ['topologyRefiner.h', ['../a00704.html', 1, '']]],\n ['topologyrefinerfactory_2eh_6', ['topologyRefinerFactory.h', ['../a00707.html', 1, '']]],\n ['types_2eh_7', ['types.h', ['../a01478.html', 1, '(Global Namespace)'],\n ['../a01481.html', 1, '(Global Namespace)'],\n ['../a01484.html', 1, '(Global Namespace)'],\n ['../a01487.html', 1, '(Global Namespace)']\n"}]}, {"source1": "./usr/share/doc/opensubdiv/tipuesearch/tipuesearch_content.js", "source2": "./usr/share/doc/opensubdiv/tipuesearch/tipuesearch_content.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,93 +1,88 @@\n var tipuesearch = {\n \"pages\": [{\n+ \"title\": \"bfr_tutorial_3_1.cpp\",\n+ \"text\": \"bfr_tutorial_3_1.cpp bfr_tutorial_3_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_3_1bfr_tutorial_3_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial illustrates the definition of a custom subclass of BfrSurfaceFactory -- providing a class with the SurfaceFactory interface adapted to a connected mesh representation. The bulk of this code is therefore identical to a previous tutorial 1.3 which illustrates simple use of a BfrSurface factory. The only difference here lies in the explicit local definition of the subclass of BfrSurfaceFactory for FarTopologyRefiner -- named CustomSurfaceFactory in this case. include .customSurfaceFactory.h include opensubdivfartopologyRefiner.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag bool uv2xyzFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false , uv2xyzFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else if strcmp argv i , -uv2xyz uv2xyzFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , std vector float const meshFaceVaryingUVs , Args const options Use simpler local type names for the Surface and its factory typedef CustomSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing When dealing with face-varying data, an identifier is necessary when constructing Surfaces in order to distinguish the different face-varying data channels. To avoid repeatedly specifying that identifier when only one is present or of interest, it can be specified via the Options. bool meshHasUVs meshTopology . GetNumFVarChannels 0 SurfaceFactory Options surfaceOptions if meshHasUVs surfaceOptions . SetDefaultFVarID 0 SurfaceFactory surfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface posSurface Surface uvSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector float outUV std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces surfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surfaces for position and UVs of this face. There are two ways to do this -- both illustrated here Creating Surfaces for the different data interpolation types independently is clear and convenient, but considerable work may be duplicated in the construction process in the case of non-linear face-varying Surfaces. So unless it is known that face-varying interpolation is linear, use of InitSurfaces is generally preferred. Remember also that the face-varying identifier is omitted from the initialization methods here as it was previously assigned to the SurfaceFactoryOptions. In the absence of an assignment of the default FVarID to the Options, a failure to specify the FVarID here will result in failure. The cases below are expanded for illustration purposes, and validity of the resulting Surface is tested here, rather than the return value of initialization methods. bool createSurfacesTogether true if meshHasUVs surfaceFactory . InitVertexSurface faceIndex , posSurface else if createSurfacesTogether surfaceFactory . InitSurfaces faceIndex , posSurface , uvSurface else if surfaceFactory . InitVertexSurface faceIndex , posSurface surfaceFactory . InitFaceVaryingSurface faceIndex , uvSurface if posSurface . IsValid continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern posSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Evaluate vertex positions Resize patch point and output arrays int pointSize 3 facePatchPoints . resize posSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays posSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize posSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Evaluate face-varying UVs when present if meshHasUVs Resize patch point and output arrays - note reuse of the same patch point array as position int pointSize 2 facePatchPoints . resize uvSurface . GetNumPatchPoints pointSize outUV . resize numOutCoords pointSize Populate patch point and output arrays uvSurface . PreparePatchPoints meshFaceVaryingUVs . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize uvSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outUV j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex if meshHasUVs options . uv2xyzFlag objWriter . WriteVertexPositions outUV , 2 objWriter . WriteFaces outFacets , tessFacetSize , false , false else objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv if meshHasUVs objWriter . WriteVertexUVs outUV objWriter . WriteFaces outFacets , tessFacetSize , true , meshHasUVs Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , meshFVarUVs , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"bfr_tutorial_3_1.html\"\n+ }, {\n \"title\": \"bfr_tutorial_3_2.cpp\",\n \"text\": \"bfr_tutorial_3_2.cpp bfr_tutorial_3_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_3_2bfr_tutorial_3_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial is a variation of tutorials showing simple uniform tessellation. Rather than constructing and evaluating a Surface at a time, this tutorial shows how Surfaces can be created and saved for repeated use. A simple SurfaceCache class is created that creates and stores the Surface for each face, along with the patch points associated with it. The main tessellation function remains essentially the same, but here it access the Surfaces from the SurfaceCache rather than computing them locally. Note that while this example illustrated the retention of all Surfaces for a mesh, this behavior is not recommended. It does not scale well for large meshes and undermines the memory savings that transient use of Surfaces is designed to achieve. Rather than storing Surfaces for all faces, maintaining a priority queue for a fixed number may be a reasonable compromise. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include memory include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args This simple class creates and dispenses Surfaces for all faces of a mesh. It consists primarily of an array of simple structs entries for each face and a single array of patch points for all Surfaces created. There are many ways to create such a cache depending on requirements. This is a simple example, but the interface presents some options that are worth considering. A SurfaceCache is constructed here given the following - a reference to the SurfaceFactory - the cache could just as easily take a reference to the mesh and construct the SurfaceFactory internally - the position data for the mesh - this is needed to compute patch points for the Surfaces - if caching UVs or any other primvar, other data needs to be provided -- along with the interpolation type for that data vertex, face-varying, etc. - option to cache patch points - the cache could store the Surfaces only or also include their patch points - storing patch points takes more memory but will eliminate any preparation time for evaluation of the Surface - option to cache all surfaces - the benefits to caching simple linear or regular surfaces are minimal -- and may even be detrimental - so only caching non-linear irregular surfaces is an option worth considering The SurfaceCache implementation here provides the options noted above. But for simplicity, the actual usage of the SurfaceCache does not deal with the permutations of additional work that is necessary when the Surfaces or their patch points are not cached. class SurfaceCache public typedef Bfr Surface float Surface typedef Bfr RefinerSurfaceFactory SurfaceFactory public SurfaceCache SurfaceFactory const surfaceFactory , std vector float const meshPoints , bool cachePatchPoints true , bool cacheAllSurfaces true SurfaceCache delete SurfaceCache default Public methods to retrieved cached Surfaces and their pre-computed patch points bool FaceHasLimitSurface int face return _entries face . hasLimit Surface const GetSurface int face return _entries face . surface . get float const GetPatchPoints int face return getPatchPoints face private Simple struct to keep track of Surface and more for each face struct FaceEntry FaceEntry surface , hasLimit false , pointOffset -1 std unique_ptr Surface const surface bool hasLimit int pointOffset Non-const version to be used internally to aide assignment float getPatchPoints int face return _entries face . surface _points . empty _points . data _entries face . pointOffset 3 0 private std vector FaceEntry _entries std vector float _points SurfaceCache SurfaceCache SurfaceFactory const surfaceFactory , std vector float const meshPoints , bool cachePatchPoints , bool cacheAllSurfaces int numFaces surfaceFactory . GetNumFaces _entries . resize numFaces int numPointsInCache 0 for int face 0 face numFaces face Surface s surfaceFactory . CreateVertexSurface float face if s FaceEntry entry _entries face entry . hasLimit true if cacheAllSurfaces s - IsRegular s - IsLinear entry . surface . reset s entry . pointOffset numPointsInCache numPointsInCache s - GetNumPatchPoints else delete s if cachePatchPoints _points . resize numPointsInCache 3 for int face 0 face numFaces face float patchPoints getPatchPoints face if patchPoints GetSurface face - PreparePatchPoints meshPoints . data , 3 , patchPoints , 3 The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions Initialize a SurfaceCache to construct Surfaces for all faces. From this point forward the SurfaceFactory is no longer used to access Surfaces. Note also that usage below is specific to the options used to initialize the SurfaceCache bool cachePatchPoints true bool cacheAllSurfaces true SurfaceCache surfaceCache meshSurfaceFactory , meshVertexPositions , cachePatchPoints , cacheAllSurfaces As with previous tutorials, output data associated with the face can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Retrieve the Surface for this face when present if surfaceCache . FaceHasLimitSurface faceIndex continue Surface const faceSurface surfaceCache . GetSurface faceIndex Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Retrieve the patch points for the Surface, then use them to evaluate output points for all identified coordinates float const facePatchPoints surfaceCache . GetPatchPoints faceIndex int pointSize 3 outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints , pointSize , outPos j , outDu j , outDv j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"bfr_tutorial_3_2.html\"\n }, {\n \"title\": \"osd_tutorial_0.cpp\",\n \"text\": \"osd_tutorial_0.cpp osd_tutorial_0.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsosdtutorial_0osd_tutorial_0.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial demonstrates the manipulation of Osd Evaluator and BufferDescriptor. include opensubdivfartopologyDescriptor.h include opensubdivfarstencilTableFactory.h include opensubdivosdcpuEvaluator.h include opensubdivosdcpuVertexBuffer.h include cstdio include cstring ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 24 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner const createTopologyRefiner int maxlevel ------------------------------------------------------------------------------ int main int , char int maxlevel 2 , nCoarseVerts 0 , nRefinedVerts 0 Setup phase Far StencilTable const stencilTable NULL Setup FarStencilTable Far TopologyRefiner const refiner createTopologyRefiner maxlevel Setup a factory to create FarStencilTable for more details see Far tutorials Far StencilTableFactory Options options options . generateOffsets true options . generateIntermediateLevels false stencilTable Far StencilTableFactory Create refiner , options nCoarseVerts refiner - GetLevel 0 . GetNumVertices nRefinedVerts stencilTable - GetNumStencils We are done with Far cleanup table delete refiner Setup a buffer for vertex primvar data Osd CpuVertexBuffer vbuffer Osd CpuVertexBuffer Create 3 , nCoarseVerts nRefinedVerts Execution phase every frame Pack the control vertex data at the start of the vertex buffer and update every time control data changes vbuffer - UpdateData g_verts , 0 , nCoarseVerts Osd BufferDescriptor srcDesc 0 , 3 , 3 Osd BufferDescriptor dstDesc nCoarseVerts 3 , 3 , 3 Launch the computation Osd CpuEvaluator EvalStencils vbuffer , srcDesc , vbuffer , dstDesc , stencilTable Visualization with Maya print a MEL script that generates particles at the location of the refined vertices printf particle float const refinedVerts vbuffer - BindCpuBuffer 3 nCoarseVerts for int i 0 i nRefinedVerts i float const vert refinedVerts 3 i printf -p f f f n , vert 0 , vert 1 , vert 2 printf -c 1 n delete stencilTable delete vbuffer ------------------------------------------------------------------------------ static Far TopologyRefiner const createTopologyRefiner int maxlevel Populate a topology descriptor with our raw data typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options Uniformly refine the topology up to maxlevel refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel return refiner ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"osd_tutorial_0.html\"\n }, {\n- \"title\": \"bfr_tutorial_3_1.cpp\",\n- \"text\": \"bfr_tutorial_3_1.cpp bfr_tutorial_3_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_3_1bfr_tutorial_3_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial illustrates the definition of a custom subclass of BfrSurfaceFactory -- providing a class with the SurfaceFactory interface adapted to a connected mesh representation. The bulk of this code is therefore identical to a previous tutorial 1.3 which illustrates simple use of a BfrSurface factory. The only difference here lies in the explicit local definition of the subclass of BfrSurfaceFactory for FarTopologyRefiner -- named CustomSurfaceFactory in this case. include .customSurfaceFactory.h include opensubdivfartopologyRefiner.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag bool uv2xyzFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false , uv2xyzFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else if strcmp argv i , -uv2xyz uv2xyzFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , std vector float const meshFaceVaryingUVs , Args const options Use simpler local type names for the Surface and its factory typedef CustomSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing When dealing with face-varying data, an identifier is necessary when constructing Surfaces in order to distinguish the different face-varying data channels. To avoid repeatedly specifying that identifier when only one is present or of interest, it can be specified via the Options. bool meshHasUVs meshTopology . GetNumFVarChannels 0 SurfaceFactory Options surfaceOptions if meshHasUVs surfaceOptions . SetDefaultFVarID 0 SurfaceFactory surfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface posSurface Surface uvSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector float outUV std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces surfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surfaces for position and UVs of this face. There are two ways to do this -- both illustrated here Creating Surfaces for the different data interpolation types independently is clear and convenient, but considerable work may be duplicated in the construction process in the case of non-linear face-varying Surfaces. So unless it is known that face-varying interpolation is linear, use of InitSurfaces is generally preferred. Remember also that the face-varying identifier is omitted from the initialization methods here as it was previously assigned to the SurfaceFactoryOptions. In the absence of an assignment of the default FVarID to the Options, a failure to specify the FVarID here will result in failure. The cases below are expanded for illustration purposes, and validity of the resulting Surface is tested here, rather than the return value of initialization methods. bool createSurfacesTogether true if meshHasUVs surfaceFactory . InitVertexSurface faceIndex , posSurface else if createSurfacesTogether surfaceFactory . InitSurfaces faceIndex , posSurface , uvSurface else if surfaceFactory . InitVertexSurface faceIndex , posSurface surfaceFactory . InitFaceVaryingSurface faceIndex , uvSurface if posSurface . IsValid continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern posSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Evaluate vertex positions Resize patch point and output arrays int pointSize 3 facePatchPoints . resize posSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays posSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize posSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Evaluate face-varying UVs when present if meshHasUVs Resize patch point and output arrays - note reuse of the same patch point array as position int pointSize 2 facePatchPoints . resize uvSurface . GetNumPatchPoints pointSize outUV . resize numOutCoords pointSize Populate patch point and output arrays uvSurface . PreparePatchPoints meshFaceVaryingUVs . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize uvSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outUV j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex if meshHasUVs options . uv2xyzFlag objWriter . WriteVertexPositions outUV , 2 objWriter . WriteFaces outFacets , tessFacetSize , false , false else objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv if meshHasUVs objWriter . WriteVertexUVs outUV objWriter . WriteFaces outFacets , tessFacetSize , true , meshHasUVs Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , meshFVarUVs , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"bfr_tutorial_1_5.cpp\",\n+ \"text\": \"bfr_tutorial_1_5.cpp bfr_tutorial_1_5.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_5bfr_tutorial_1_5.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial is an alternative to an earlier tutorial that showed uniform tessellation. This version differs by evaluating the points of the tessellation using limit stencils instead of the standard Surface evaluation methods. Limit stencils factor the evaluation into a set of coefficients for each control point affecting the Surface. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float faceControlPoints std vector float limitStencils std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Resize stencils and control point arrays based on the number of control points for the Surface int numControlPoints faceSurface . GetNumControlPoints limitStencils . resize 3 numControlPoints float pStencil limitStencils . data float duStencil limitStencils . data numControlPoints float dvStencil limitStencils . data numControlPoints 2 Limit stencils can be applied using the control points in a local array or directy from the mesh. Both are shown here, so if using the local array, resize and populate it bool gatherControlPoints true if gatherControlPoints faceControlPoints . resize numControlPoints 3 faceSurface . GatherControlPoints meshVertexPositions . data , 3 , faceControlPoints . data , 3 Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Evaluate and apply stencils to compute points of the tessellation outPos . resize numOutCoords 3 outDu . resize numOutCoords 3 outDv . resize numOutCoords 3 for int i 0 i numOutCoords i float const uv outCoords . data i 2 faceSurface . EvaluateStencil uv , pStencil , duStencil , dvStencil float p outPos . data i 3 float du outDu . data i 3 float dv outDv . data i 3 if gatherControlPoints float const controlPoints faceControlPoints . data faceSurface . ApplyStencil pStencil , controlPoints , 3 , p faceSurface . ApplyStencil duStencil , controlPoints , 3 , du faceSurface . ApplyStencil dvStencil , controlPoints , 3 , dv else float const meshPoints meshVertexPositions . data faceSurface . ApplyStencilFromMesh pStencil , meshPoints , 3 , p faceSurface . ApplyStencilFromMesh duStencil , meshPoints , 3 , du faceSurface . ApplyStencilFromMesh dvStencil , meshPoints , 3 , dv Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"bfr_tutorial_3_1.html\"\n+ \"loc\": \"bfr_tutorial_1_5.html\"\n }, {\n \"title\": \"bfr_tutorial_2_1.cpp\",\n \"text\": \"bfr_tutorial_2_1.cpp bfr_tutorial_2_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_2_1bfr_tutorial_2_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory, Surface and Tessellation classes by illustrating the use of non-uniform tessellation parameters with Tessellation. Tessellation rates for the edges of a face are determined by a length associated with each edge. That length may be computed using either the control hull or the limit surface. The length of a tessellation interval is required and will be inferred if not explicitly specified as a command line option. The tessellation rate for an edge is computed as its length divided by the length of the tessellation interval. A maximum tessellation rate is imposed to prevent accidental unbounded tessellation, but can easily be raised as needed. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio include cmath include algorithm Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType float tessInterval int tessRateMax bool useHullFlag bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessInterval 0.0f , tessRateMax 10 , useHullFlag false , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -length if i argc tessInterval float atof argv i else if strcmp argv i , -max if i argc tessRateMax atoi argv i else if strcmp argv i , -hull useHullFlag true else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args Local trivial functions for simple edge length calculations and the determination of associated tessellation rates inline float EdgeLength float const v0 , float const v1 float dv 3 dv 0 std abs v0 0 - v1 0 dv 1 std abs v0 1 - v1 1 dv 2 std abs v0 2 - v1 2 return std sqrt dv 0 dv 0 dv 1 dv 1 dv 2 dv 2 float FindLongestEdge Far TopologyRefiner const mesh , std vector float const vertPos , int pointSize float maxLength 0.0f int numEdges mesh . GetLevel 0 . GetNumEdges for int i 0 i numEdges i Far ConstIndexArray edgeVerts mesh . GetLevel 0 . GetEdgeVertices i float edgeLength EdgeLength vertPos edgeVerts 0 pointSize , vertPos edgeVerts 1 pointSize maxLength std max maxLength , edgeLength return maxLength void GetEdgeTessRates std vector float const vertPos , int pointSize , Args const options , int edgeRates int numEdges int vertPos . size pointSize for int i 0 i numEdges i int j i 1 numEdges float edgeLength EdgeLength vertPos i pointSize , vertPos j pointSize edgeRates i 1 int edgeLength options . tessInterval edgeRates i std min edgeRates i , options . tessRateMax The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector int faceTessRates std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Prepare the Surface patch points first as it may be evaluated to determine suitable edge-rates for Tessellation int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize For each of the N edges of the face, a tessellation rate is determined to initialize a non-uniform Tessellation pattern. Many metrics are possible -- some based on the geometry itself size, curvature, others dependent on viewpoint screen space size, center of view, etc. and many more. Simple techniques are chosen here for illustration and can easily be replaced. Here two methods are shown using lengths between the corners of the face -- the first using the vertex positions of the face and the second using points evaluated at the corners of its limit surface. Use of the control hull is more efficient avoiding the evaluation but may prove less effective in some cases though both estimates have their limitations. int N faceSurface . GetFaceSize Use the output array temporarily to hold the N positions outPos . resize N pointSize if options . useHullFlag Far ConstIndexArray verts meshTopology . GetLevel 0 . GetFaceVertices faceIndex for int i 0 , j 0 i N i , j pointSize float const vPos meshVertexPositions verts i pointSize outPos j vPos 0 outPos j 1 vPos 1 outPos j 2 vPos 2 else Bfr Parameterization faceParam faceSurface . GetParameterization for int i 0 , j 0 i N i , j pointSize float uv 2 faceParam . GetVertexCoord i , uv faceSurface . Evaluate uv , facePatchPoints . data , pointSize , outPos j faceTessRates . resize N GetEdgeTessRates outPos , pointSize , options , faceTessRates . data Declare a non-uniform Tessellation using the rates for each edge and identify coordinates of the points to evaluate Additional interior rates can be optionally provided 2 for quads, 1 for others but will be inferred in their absence. Bfr Tessellation tessPattern faceSurface . GetParameterization , N , faceTessRates . data , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Resize the output arrays and evaluate outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE If no interval length was specified, set one by finding the longest edge of the mesh and dividing it by the maximum tessellation rate if args . tessInterval 0.0f args . tessInterval FindLongestEdge meshTopology , meshVtxPositions , 3 float args . tessRateMax tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"bfr_tutorial_2_1.html\"\n }, {\n \"title\": \"bfr_tutorial_2_2.cpp\",\n \"text\": \"bfr_tutorial_2_2.cpp bfr_tutorial_2_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_2_2bfr_tutorial_2_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on others using the SurfaceFactory, Surface and Tessellation classes by using more of the functionality of the Tessellation class to construct a tessellation of the mesh that is topologically watertight, i.e. resulting points evaluated along shared edges or vertices are shared and not duplicated. Since Tessellation provides points around its boundary first, the evaluated points for shared vertices and edges are identified when constructed and reused when shared later. The boundary of the tessellation of a face is therefore a collection of shared points and methods of Tessellation help to remap the faces generated to the shared set of points. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio include cassert Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv using Far Index using Far IndexArray using Far ConstIndexArray Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args Simple local structs supporting shared points for vertices and edges namespace struct SharedVertex SharedVertex pointIndex -1 bool IsSet const return pointIndex 0 void Set int index pointIndex index int pointIndex struct SharedEdge SharedEdge pointIndex -1 , numPoints 0 bool IsSet const return pointIndex 0 void Set int index , int n pointIndex index , numPoints n int pointIndex int numPoints end namespace The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. This tessellation function differs from earlier tutorials in that it computes and reuses shared points at vertices and edges of the mesh. There are several ways to compute these shared points, and which is best depends on context. Dealing with shared data poses complications for threading in general, so computing all points for the vertices and edges up front may be preferred -- despite the fact that faces will be visited more than once first when generating potentially shared vertex or edge points, and later when generating any interior points. The loops for vertices and edges can be threaded and the indexing of the shared points is simpler. For the single-threaded case here, the faces are each processed in order and any shared points will be computed and used as needed. So each face is visited once and so each Surface initialized once but the bookkeeping to deal with indices of shared points becomes more complicated. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Declare vectors to identify shared tessellation points at vertices and edges and their indices around the boundary of a face Far TopologyLevel const baseLevel meshTopology . GetLevel 0 std vector SharedVertex sharedVerts baseLevel . GetNumVertices std vector SharedEdge sharedEdges baseLevel . GetNumEdges std vector int tessBoundaryIndices Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numMeshPointsEvaluated 0 int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Resize patch point and output arrays int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate the patch point array faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize Evaluate the sample points of the Tessellation First traverse the boundary of the face to determine whether to evaluate or share points on vertices and edges of the face. Both pre-existing and new boundary points are identified by index in an array for later use. The interior points are all trivially computed after the boundary is dealt with. Identify the boundary and interior coords and initialize the index array for the potentially shared boundary points int numBoundaryCoords tessPattern . GetNumBoundaryCoords int numInteriorCoords numOutCoords - numBoundaryCoords float const tessBoundaryCoords outCoords 0 float const tessInteriorCoords outCoords numBoundaryCoords 2 ConstIndexArray fVerts baseLevel . GetFaceVertices faceIndex ConstIndexArray fEdges baseLevel . GetFaceEdges faceIndex tessBoundaryIndices . resize numBoundaryCoords Walk around the face, inspecting each vertex and outgoing edge, and populating the index array of boundary points float patchPointData facePatchPoints . data int boundaryIndex 0 int numFacePointsEvaluated 0 for int i 0 i fVerts . size i Index vertIndex fVerts i Index edgeIndex fEdges i int edgeRate options . tessUniformRate Evaluateassign or retrieve the shared point for the vertex SharedVertex sharedVertex sharedVerts vertIndex if sharedVertex . IsSet Identify indices of the new shared point in both the mesh and face and increment their inventory int indexInMesh numMeshPointsEvaluated int indexInFace numFacePointsEvaluated sharedVertex . Set indexInMesh Evaluate new shared point and assign index to boundary float const uv tessBoundaryCoords boundaryIndex 2 int pIndex indexInFace pointSize faceSurface . Evaluate uv , patchPointData , pointSize , outPos pIndex , outDu pIndex , outDv pIndex tessBoundaryIndices boundaryIndex indexInMesh else Assign shared vertex point index to boundary tessBoundaryIndices boundaryIndex sharedVertex . pointIndex Evaluateassign or retrieve all shared points for the edge To keep this simple, assume the edge is manifold. So the second face sharing the edge has that edge in the opposite direction in its boundary relative to the first face -- making it necessary to reverse the order of shared points for the boundary of the second face. To support a non-manifold edge, all subsequent faces that share the assigned shared edge must determine if their orientation of that edge is reversed relative to the first face for which the shared edge points were evaluated. So a little more book-keeping andor inspection is required. if edgeRate 1 int pointsPerEdge edgeRate - 1 SharedEdge sharedEdge sharedEdges edgeIndex if sharedEdge . IsSet Identify indices of the new shared points in both the mesh and face and increment their inventory int nextInMesh numMeshPointsEvaluated int nextInFace numFacePointsEvaluated numFacePointsEvaluated pointsPerEdge numMeshPointsEvaluated pointsPerEdge sharedEdge . Set nextInMesh , pointsPerEdge Evaluate shared points and assign indices to boundary float const uv tessBoundaryCoords boundaryIndex 2 for int j 0 j pointsPerEdge j , uv 2 int pIndex nextInFace pointSize faceSurface . Evaluate uv , patchPointData , pointSize , outPos pIndex , outDu pIndex , outDv pIndex tessBoundaryIndices boundaryIndex nextInMesh else See note above on simplification for manifold edges assert baseLevel . IsEdgeNonManifold edgeIndex Assign shared points to boundary in reverse order int nextInMesh sharedEdge . pointIndex pointsPerEdge - 1 for int j 0 j pointsPerEdge j tessBoundaryIndices boundaryIndex nextInMesh -- Evaluate any interior points unique to this face -- appending them to those shared points computed above for the boundary if numInteriorCoords float const uv tessInteriorCoords int iLast numFacePointsEvaluated numInteriorCoords for int i numFacePointsEvaluated i iLast i , uv 2 int pIndex i pointSize faceSurface . Evaluate uv , patchPointData , pointSize , outPos pIndex , outDu pIndex , outDv pIndex numFacePointsEvaluated numInteriorCoords numMeshPointsEvaluated numInteriorCoords Remember to trimresize the arrays storing evaluation results for new points to reflect the size actually populated. outPos . resize numFacePointsEvaluated pointSize outDu . resize numFacePointsEvaluated pointSize outDv . resize numFacePointsEvaluated pointSize Identify the faces of the Tessellation Note that the coordinate indices used by the facets are local to the face i.e. they range from 0..N-1, where N is the number of coordinates in the pattern and so need to be offset when writing to Obj format. For more advanced use, the coordinates associated with the boundary and interior of the pattern are distinguishable so that those on the boundary can be easily remapped to refer to shared edge or corner points, while those in the interior can be separately offset or similarly remapped. So transform the indices of the facets here as needed using the indices of shared boundary points assembled above and a suitable offset for the new interior points added int tessInteriorOffset numMeshPointsEvaluated - numOutCoords int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , tessBoundaryIndices . data , tessInteriorOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"bfr_tutorial_2_2.html\"\n }, {\n- \"title\": \"bfr_tutorial_1_2.cpp\",\n- \"text\": \"bfr_tutorial_1_2.cpp bfr_tutorial_1_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_2bfr_tutorial_1_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory and Surface for evaluating the limit surface of faces by using the Tessellation class to determine the points to evaluate and the faces that connect them. The Tessellation class replaces the explicit determination of points and faces for the triangle fan of the previous example. Given a uniform tessellation rate via a command line option, Tessellation returns the set of coordinates to evaluate, and separately returns the faces that connect them. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Resize patch point and output arrays int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"bfr_tutorial_1_2.html\"\n- }, {\n \"title\": \"bfr_tutorial_1_4.cpp\",\n \"text\": \"bfr_tutorial_1_4.cpp bfr_tutorial_1_4.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_4bfr_tutorial_1_4.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory, Surface and Tessellation classes for evaluating and tessellating the limit surface of faces of a mesh by illustrating how the presence of additional data in the mesh arrays is handled. As in the previous tutorial, vertex positions and face-varying UVs are provided with the mesh to be evaluated. But here an additional color is interleaved with the position in the vertex data of the mesh and a third component is added to face-varying UV data making it u,v,w. To evaluate the position and 2D UVs while avoiding the color and unused third UV coordinate, the SurfacePointDescriptor class is used to describe the size and stride of the desired data to be evaluated in the arrays of mesh data. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag bool uv2xyzFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false , uv2xyzFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else if strcmp argv i , -uv2xyz uv2xyzFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVtxData , int vtxDataSize , std vector float const meshFVarData , int fvarDataSize , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface typedef Surface PointDescriptor SurfacePoint Identify the source positions and UVs within more general data arrays for the mesh. If position andor UV are not at the start of the vtx andor fvar data, simply offset the head of the array here accordingly bool meshHasUVs meshTopology . GetNumFVarChannels 0 float const meshPosData meshVtxData . data SurfacePoint meshPosPoint 3 , vtxDataSize float const meshUVData meshHasUVs meshFVarData . data 0 SurfacePoint meshUVPoint 2 , fvarDataSize Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing When dealing with face-varying data, an identifier is necessary when constructing Surfaces in order to distinguish the different face-varying data channels. To avoid repeatedly specifying that identifier when only one is present or of interest, it can be specified via the Options. SurfaceFactory Options surfaceOptions if meshHasUVs surfaceOptions . SetDefaultFVarID 0 SurfaceFactory surfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface posSurface Surface uvSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector float outUV std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces surfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surfaces for position and UVs of this face. There are two ways to do this -- both illustrated here Creating Surfaces for the different data interpolation types independently is clear and convenient, but considerable work may be duplicated in the construction process in the case of non-linear face-varying Surfaces. So unless it is known that face-varying interpolation is linear, use of InitSurfaces is generally preferred. Remember also that the face-varying identifier is omitted from the initialization methods here as it was previously assigned to the SurfaceFactoryOptions. In the absence of an assignment of the default FVarID to the Options, a failure to specify the FVarID here will result in failure. The cases below are expanded for illustration purposes, and validity of the resulting Surface is tested here, rather than the return value of initialization methods. bool createSurfacesTogether true if meshHasUVs surfaceFactory . InitVertexSurface faceIndex , posSurface else if createSurfacesTogether surfaceFactory . InitSurfaces faceIndex , posSurface , uvSurface else if surfaceFactory . InitVertexSurface faceIndex , posSurface surfaceFactory . InitFaceVaryingSurface faceIndex , uvSurface if posSurface . IsValid continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern posSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Evaluate vertex positions Resize patch point and output arrays int pointSize meshPosPoint . size facePatchPoints . resize posSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays float patchPosData facePatchPoints . data SurfacePoint patchPosPoint pointSize posSurface . PreparePatchPoints meshPosData , meshPosPoint , patchPosData , patchPosPoint for int i 0 , j 0 i numOutCoords i , j pointSize posSurface . Evaluate outCoords i 2 , patchPosData , patchPosPoint , outPos j , outDu j , outDv j Evaluate face-varying UVs when present if meshHasUVs Resize patch point and output arrays - note reuse of the same patch point array as position int pointSize meshUVPoint . size facePatchPoints . resize uvSurface . GetNumPatchPoints pointSize outUV . resize numOutCoords pointSize Populate patch point and output arrays float patchUVData facePatchPoints . data SurfacePoint patchUVPoint pointSize uvSurface . PreparePatchPoints meshUVData , meshUVPoint , patchUVData , patchUVPoint for int i 0 , j 0 i numOutCoords i , j pointSize uvSurface . Evaluate outCoords i 2 , patchUVData , patchUVPoint , outUV j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex if meshHasUVs options . uv2xyzFlag objWriter . WriteVertexPositions outUV , 2 objWriter . WriteFaces outFacets , tessFacetSize , false , false else objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv if meshHasUVs objWriter . WriteVertexUVs outUV objWriter . WriteFaces outFacets , tessFacetSize , true , meshHasUVs Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE Expand the loaded position and UV arrays to include additional data initialized with -1 for distinction, e.g. add a 4-tuple for RGBA color to the vertex data and add a third field w to the face-varying data int numPos int meshVtxPositions . size 3 int vtxSize 7 std vector float vtxData numPos vtxSize , -1.0f for int i 0 i numPos i vtxData i vtxSize meshVtxPositions i 3 vtxData i vtxSize 1 meshVtxPositions i 3 1 vtxData i vtxSize 2 meshVtxPositions i 3 2 int numUVs int meshFVarUVs . size 2 int fvarSize 3 std vector float fvarData numUVs fvarSize , -1.0f for int i 0 i numUVs i fvarData i fvarSize meshFVarUVs i 2 fvarData i fvarSize 1 meshFVarUVs i 2 1 Pass the expanded data arrays along with their respective strides tessellateToObj meshTopology , vtxData , vtxSize , fvarData , fvarSize , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"bfr_tutorial_1_4.html\"\n }, {\n \"title\": \"bfr_tutorial_1_3.cpp\",\n \"text\": \"bfr_tutorial_1_3.cpp bfr_tutorial_1_3.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_3bfr_tutorial_1_3.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory, Surface and Tessellation classes for evaluating and tessellating the limit surface of faces of a mesh by adding support for the evaluation of face-varying UVs. If UVs exist in the given mesh, they will be evaluated and included with the vertex positions and normals previously illustrated as part of the tessellation written to the Obj file. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag bool uv2xyzFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false , uv2xyzFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else if strcmp argv i , -uv2xyz uv2xyzFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , std vector float const meshFaceVaryingUVs , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing When dealing with face-varying data, an identifier is necessary when constructing Surfaces in order to distinguish the different face-varying data channels. To avoid repeatedly specifying that identifier when only one is present or of interest, it can be specified via the Options. bool meshHasUVs meshTopology . GetNumFVarChannels 0 SurfaceFactory Options surfaceOptions if meshHasUVs surfaceOptions . SetDefaultFVarID 0 SurfaceFactory surfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface posSurface Surface uvSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector float outUV std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces surfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surfaces for position and UVs of this face. There are two ways to do this -- both illustrated here Creating Surfaces for the different data interpolation types independently is clear and convenient, but considerable work may be duplicated in the construction process in the case of non-linear face-varying Surfaces. So unless it is known that face-varying interpolation is linear, use of InitSurfaces is generally preferred. Remember also that the face-varying identifier is omitted from the initialization methods here as it was previously assigned to the SurfaceFactoryOptions. In the absence of an assignment of the default FVarID to the Options, a failure to specify the FVarID here will result in failure. The cases below are expanded for illustration purposes, and validity of the resulting Surface is tested here, rather than the return value of initialization methods. bool createSurfacesTogether true if meshHasUVs surfaceFactory . InitVertexSurface faceIndex , posSurface else if createSurfacesTogether surfaceFactory . InitSurfaces faceIndex , posSurface , uvSurface else if surfaceFactory . InitVertexSurface faceIndex , posSurface surfaceFactory . InitFaceVaryingSurface faceIndex , uvSurface if posSurface . IsValid continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern posSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Evaluate vertex positions Resize patch point and output arrays int pointSize 3 facePatchPoints . resize posSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays posSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize posSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Evaluate face-varying UVs when present if meshHasUVs Resize patch point and output arrays - note reuse of the same patch point array as position int pointSize 2 facePatchPoints . resize uvSurface . GetNumPatchPoints pointSize outUV . resize numOutCoords pointSize Populate patch point and output arrays uvSurface . PreparePatchPoints meshFaceVaryingUVs . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize uvSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outUV j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex if meshHasUVs options . uv2xyzFlag objWriter . WriteVertexPositions outUV , 2 objWriter . WriteFaces outFacets , tessFacetSize , false , false else objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv if meshHasUVs objWriter . WriteVertexUVs outUV objWriter . WriteFaces outFacets , tessFacetSize , true , meshHasUVs Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , meshFVarUVs , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"bfr_tutorial_1_3.html\"\n }, {\n- \"title\": \"bfr_tutorial_1_5.cpp\",\n- \"text\": \"bfr_tutorial_1_5.cpp bfr_tutorial_1_5.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_5bfr_tutorial_1_5.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial is an alternative to an earlier tutorial that showed uniform tessellation. This version differs by evaluating the points of the tessellation using limit stencils instead of the standard Surface evaluation methods. Limit stencils factor the evaluation into a set of coefficients for each control point affecting the Surface. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float faceControlPoints std vector float limitStencils std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Resize stencils and control point arrays based on the number of control points for the Surface int numControlPoints faceSurface . GetNumControlPoints limitStencils . resize 3 numControlPoints float pStencil limitStencils . data float duStencil limitStencils . data numControlPoints float dvStencil limitStencils . data numControlPoints 2 Limit stencils can be applied using the control points in a local array or directy from the mesh. Both are shown here, so if using the local array, resize and populate it bool gatherControlPoints true if gatherControlPoints faceControlPoints . resize numControlPoints 3 faceSurface . GatherControlPoints meshVertexPositions . data , 3 , faceControlPoints . data , 3 Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Evaluate and apply stencils to compute points of the tessellation outPos . resize numOutCoords 3 outDu . resize numOutCoords 3 outDv . resize numOutCoords 3 for int i 0 i numOutCoords i float const uv outCoords . data i 2 faceSurface . EvaluateStencil uv , pStencil , duStencil , dvStencil float p outPos . data i 3 float du outDu . data i 3 float dv outDv . data i 3 if gatherControlPoints float const controlPoints faceControlPoints . data faceSurface . ApplyStencil pStencil , controlPoints , 3 , p faceSurface . ApplyStencil duStencil , controlPoints , 3 , du faceSurface . ApplyStencil dvStencil , controlPoints , 3 , dv else float const meshPoints meshVertexPositions . data faceSurface . ApplyStencilFromMesh pStencil , meshPoints , 3 , p faceSurface . ApplyStencilFromMesh duStencil , meshPoints , 3 , du faceSurface . ApplyStencilFromMesh dvStencil , meshPoints , 3 , dv Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"bfr_tutorial_1_5.html\"\n- }, {\n- \"title\": \"bfr_tutorial_1_1.cpp\",\n- \"text\": \"bfr_tutorial_1_1.cpp bfr_tutorial_1_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_1bfr_tutorial_1_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial illustrates the use of the SurfaceFactory, Surface and Parameterization classes for creating and evaluating the limit surface associated with each base face of a mesh. Following the creation of a connected mesh for a shape using a FarTopologyRefiner, as illustrated in Far tutorials, an instance of a SurfaceFactory is declared to process its faces. Each face of the mesh is evaluated and tessellated independently with a simple triangle fan, with results written out in Obj format for inspection. These classes make it simple to evaluate and tessellate all faces quads, tris or others while supporting the full set of subdivision options. While a triangle fan may be a trivial tessellation and so not very useful later examples using the Tessellation class provide more useful results with the same simplicity. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector int outTriangles Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Get the Parameterization of the Surface and use it to identify coordinates for evaluation -- in this case, at the vertices and center of the face to create a fan of triangles Bfr Parameterization faceParam faceSurface . GetParameterization int faceSize faceParam . GetFaceSize int numOutCoords faceSize 1 outCoords . resize numOutCoords 2 for int i 0 i faceSize i faceParam . GetVertexCoord i , outCoords i 2 faceParam . GetCenterCoord outCoords faceSize 2 Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Resize patch point and output arrays int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Identify the faces of the tessellation, i.e. the triangle fan connecting points at the vertices to the center last point Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. int objVertexIndexOffset objWriter . GetNumVertices outTriangles . resize faceSize 3 int outTriangle outTriangles . data for int i 0 i faceSize i , outTriangle 3 outTriangle 0 objVertexIndexOffset i outTriangle 1 objVertexIndexOffset i 1 faceSize outTriangle 2 objVertexIndexOffset faceSize Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outTriangles , 3 , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"far_tutorial_5_2.cpp\",\n+ \"text\": \"far_tutorial_5_2.cpp far_tutorial_5_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_5_2far_tutorial_5_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to manage the limit surface of a potentially large mesh by creating groups of patches for selected faces of the mesh. Familiarity with construction and evaluation of a PatchTable is assumed see tutorial_5_1. When the patches for a mesh do not need to be retained for further use, e.g. when simply computing points for a tessellation, the time and space required to construct a single large PatchTable can be considerable. By constructing, evaluating and discarding smaller PatchTables for subsets of the mesh, the high transient memory cost can be avoided when computed serially. When computed in parallel, there may be little memory savings, but the construction time can then be distributed. This tutorial creates simple geometry currently a lattice of cubes that can be expanded in complexity with a simple multiplier. The collection of faces are then divided into a specified number of groups from which patches will be constructed and evaluated. A simple tessellation a triangle fan around the midpoint of each face is then written in Obj format to the standard output. include ......regressioncommonarg_utils.h include ......regressioncommonfar_utils.h include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include opensubdivfarpatchTableFactory.h include opensubdivfarpatchMap.h include opensubdivfarptexIndices.h include cassert include cstdio include cstring include fstream include sstream using namespace OpenSubdiv using Far Index Global utilities in this namespace are not relevant to the tutorial. They simply serve to construct some default geometry to be processed in the form of a TopologyRefiner and vector of vertex positions. namespace Simple structs for x,y,z position and a 3-tuple for the set of vertices of a triangle struct Pos Pos Pos float x , float y , float z p 0 x , p 1 y , p 2 z Pos operator Pos const op const return Pos p 0 op . p 0 , p 1 op . p 1 , p 2 op . p 2 Clear and AddWithWeight required for interpolation void Clear void 0 p 0 p 1 p 2 0.0f void AddWithWeight Pos const src , float weight p 0 weight src . p 0 p 1 weight src . p 1 p 2 weight src . p 2 float p 3 typedef std vector Pos PosVector struct Tri Tri Tri int a , int b , int c v 0 a , v 1 b , v 2 c int v 3 typedef std vector Tri TriVector Functions to populate the topology and geometry arrays with simple shapes that we can multiply to increase complexity void appendDefaultPrimitive Pos const origin , std vector int vertsPerFace , std vector Index faceVerts , std vector Pos positionsPerVert Local topology and position of a cube centered at origin static float const cubePositions 8 3 -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f static int const cubeFaceVerts 6 4 0 , 3 , 2 , 1 , 4 , 5 , 6 , 7 , 0 , 4 , 7 , 3 , 1 , 2 , 6 , 5 , 0 , 1 , 5 , 4 , 3 , 7 , 6 , 2 Identify the next vertex before appending vertex positions int baseVertex int positionsPerVert . size for int i 0 i 8 i float const p cubePositions i positionsPerVert . push_back origin Pos p 0 , p 1 , p 2 Append number of verts-per-face and face-vertices for each face for int i 0 i 6 i vertsPerFace . push_back 4 for int j 0 j 4 j faceVerts . push_back baseVertex cubeFaceVerts i j void createDefaultGeometry int multiplier , std vector int vertsPerFace , std vector Index faceVerts , std vector Pos positionsPerVert Default primitive is currently a cube int const vertsPerPrimitive 8 int const facesPerPrimitive 6 int const faceVertsPerPrimitive 24 int nPrimitives multiplier multiplier multiplier positionsPerVert . reserve nPrimitives vertsPerPrimitive vertsPerFace . reserve nPrimitives facesPerPrimitive faceVerts . reserve nPrimitives faceVertsPerPrimitive for int x 0 x multiplier x for int y 0 y multiplier y for int z 0 z multiplier z appendDefaultPrimitive Pos float x 2.0f , float y 2.0f , float z 2.0f , vertsPerFace , faceVerts , positionsPerVert Create a TopologyRefiner from default geometry created above Far TopologyRefiner createTopologyRefinerDefault int multiplier , PosVector posVector std vector int topVertsPerFace std vector Index topFaceVerts createDefaultGeometry multiplier , topVertsPerFace , topFaceVerts , posVector typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_AND_CORNER Descriptor desc desc . numVertices int posVector . size desc . numFaces int topVertsPerFace . size desc . numVertsPerFace topVertsPerFace 0 desc . vertIndicesPerFace topFaceVerts 0 Instantiate a FarTopologyRefiner from the descriptor. Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options if refiner 0 exit EXIT_FAILURE bool dumpDefaultGeometryToObj false if dumpDefaultGeometryToObj int nVerts int posVector . size for int i 0 i nVerts i float const p posVector i . p printf v f f f n , p 0 , p 1 , p 2 int const fVerts topFaceVerts 0 int nFaces int topVertsPerFace . size for int i 0 i nFaces i printf f for int j 0 j topVertsPerFace i j printf d , 1 fVerts printf n exit EXIT_SUCCESS return refiner Create a TopologyRefiner from a specified Obj file geometry created internally Far TopologyRefiner createTopologyRefinerFromObj std string const objFileName , Sdc SchemeType schemeType , PosVector posVector const char filename objFileName . c_str const Shape shape 0 std ifstream ifs filename if ifs std stringstream ss ss ifs . rdbuf ifs . close std string shapeString ss . str shape Shape parseObj shapeString . c_str , ConvertSdcTypeToShapeScheme schemeType , false if shape 0 fprintf stderr , Error Cannot create Shape from .obj file s n , filename return 0 else fprintf stderr , Error Cannot open .obj file s n , filename return 0 Sdc SchemeType sdcType GetSdcType shape Sdc Options sdcOptions GetSdcOptions shape Far TopologyRefiner refiner Far TopologyRefinerFactory Shape Create shape , Far TopologyRefinerFactory Shape Options sdcType , sdcOptions if refiner 0 fprintf stderr , Error Unable to construct TopologyRefiner from .obj file s n , filename return 0 int numVertices refiner - GetNumVerticesTotal posVector . resize numVertices std memcpy posVector 0 . p 0 , shape - verts 0 , numVertices 3 sizeof float delete shape return refiner end namespace The PatchGroup bundles objects used to create and evaluate a sparse set of patches. Its construction creates a PatchTable and all other objects necessary to evaluate patches associated with the specified subset of faces provided. A simple method to tessellate a specified face is provided. Note that, since the data buffers for the base level and refined levels are separate we want to avoid copying primvar data for the base level of a potentially large mesh, that patch evaluation needs to account for the separation when combining control points. struct PatchGroup PatchGroup Far PatchTableFactory Options patchOptions , Far TopologyRefiner const baseRefinerArg , Far PtexIndices const basePtexIndicesArg , std vector Pos const basePositionsArg , std vector Index const baseFacesArg PatchGroup void TessellateBaseFace int face , PosVector tessPoints , TriVector tessTris const Const reference members Far TopologyRefiner const baseRefiner Far PtexIndices const basePtexIndices std vector Pos const basePositions std vector Index const baseFaces Members constructed to evaluate patches Far PatchTable patchTable Far PatchMap patchMap int patchFaceSize std vector Pos localPositions PatchGroup PatchGroup Far PatchTableFactory Options patchOptions , Far TopologyRefiner const baseRefinerArg , Far PtexIndices const basePtexIndicesArg , std vector Pos const basePositionsArg , std vector Index const baseFacesArg baseRefiner baseRefinerArg , basePtexIndices basePtexIndicesArg , basePositions basePositionsArg , baseFaces baseFacesArg Create a local refiner sharing the base level, apply adaptive refinement to the given subset of base faces, and construct a patch table and its associated map for the same set of faces Far ConstIndexArray groupFaces baseFaces 0 , int baseFaces . size Far TopologyRefiner localRefiner Far TopologyRefinerFactory Far TopologyDescriptor Create baseRefiner localRefiner - RefineAdaptive patchOptions . GetRefineAdaptiveOptions , groupFaces patchTable Far PatchTableFactory Create localRefiner , patchOptions , groupFaces patchMap new Far PatchMap patchTable patchFaceSize Sdc SchemeTypeTraits GetRegularFaceSize baseRefiner . GetSchemeType Compute the number of refined and local points needed to evaluate the patches, allocate and interpolate. This varies from tutorial_5_1 in that the primvar buffer for the base vertices is separate from the refined vertices and local patch points which must also be accounted for when evaluating the patches. int nBaseVertices localRefiner - GetLevel 0 . GetNumVertices int nRefinedVertices localRefiner - GetNumVerticesTotal - nBaseVertices int nLocalPoints patchTable - GetNumLocalPoints localPositions . resize nRefinedVertices nLocalPoints if nRefinedVertices Far PrimvarRefiner primvarRefiner localRefiner Pos const src basePositions 0 Pos dst localPositions 0 for int level 1 level localRefiner - GetNumLevels level primvarRefiner . Interpolate level , src , dst src dst dst localRefiner - GetLevel level . GetNumVertices if nLocalPoints patchTable - GetLocalPointStencilTable - UpdateValues basePositions 0 , nBaseVertices , localPositions 0 , localPositions nRefinedVertices delete localRefiner PatchGroup PatchGroup delete patchTable delete patchMap void PatchGroup TessellateBaseFace int face , PosVector tessPoints , TriVector tessTris const Tesselate the face with points at the midpoint of the face and at each corner, and triangles connecting the midpoint to each edge. Irregular faces require an aribrary number of corners points, but all are at the origin of the child face of the irregular base face float const quadPoints 5 2 0.5f , 0.5f , 0.0f , 0.0f , 1.0f , 0.0f , 1.0f , 1.0f , 0.0f , 1.0f float const triPoints 4 2 0.5f , 0.5f , 0.0f , 0.0f , 1.0f , 0.0f , 0.0f , 1.0f float const irregPoints 4 2 1.0f , 1.0f , 0.0f , 0.0f Determine the topology of the given base face and the resulting tessellation points and faces to generate int baseFace baseFaces face int faceSize baseRefiner . GetLevel 0 . GetFaceVertices baseFace . size bool faceIsIrregular faceSize patchFaceSize int nTessPoints faceSize 1 int nTessFaces faceSize tessPoints . resize nTessPoints tessTris . resize nTessFaces Compute the mid and corner points -- remember that for an irregular face, we must reference the individual ptex faces for each corner int ptexFace basePtexIndices . GetFaceId baseFace int numBaseVerts int basePositions . size for int i 0 i nTessPoints i Choose the s,t coordinate from the fixed tessellation float const st faceIsIrregular irregPoints i 0 faceSize 4 quadPoints i triPoints i Locate the patch corresponding to the face ptex idx and s,t and evaluate int patchFace ptexFace if faceIsIrregular i 0 patchFace i - 1 Far PatchTable PatchHandle const handle patchMap - FindPatch patchFace , st 0 , st 1 assert handle float pWeights 20 patchTable - EvaluateBasis handle , st 0 , st 1 , pWeights Identify the patch cvs and combine with the evaluated weights -- remember to distinguish cvs in the base level Far ConstIndexArray cvIndices patchTable - GetPatchVertices handle Pos pos tessPoints i pos . Clear for int cv 0 cv cvIndices . size cv int cvIndex cvIndices cv if cvIndex numBaseVerts pos . AddWithWeight basePositions cvIndex , pWeights cv else pos . AddWithWeight localPositions cvIndex - numBaseVerts , pWeights cv Assign triangles connecting the midpoint of the base face to the points computed at the ends of each of its edges for int i 0 i nTessFaces i tessTris i Tri 0 , 1 i , 1 i 1 faceSize Command line arguments parsed to provide run-time options class Args public std string inputObjFile Sdc SchemeType schemeType int geoMultiplier int maxPatchDepth int numPatchGroups bool noTessFlag bool noOutputFlag public Args int argc , char argv inputObjFile , schemeType Sdc SCHEME_CATMARK , geoMultiplier 10 , maxPatchDepth 3 , numPatchGroups 10 , noTessFlag false , noOutputFlag false Parse and assign standard arguments and Obj files ArgOptions args args . Parse argc , argv maxPatchDepth args . GetLevel schemeType ConvertShapeSchemeToSdcType args . GetDefaultScheme const std vector const char objFiles args . GetObjFiles if objFiles . empty for size_t i 1 i objFiles . size i fprintf stderr , Warning .obj file s ignored n , objFiles i inputObjFile std string objFiles 0 Parse remaining arguments specific to this example const std vector const char rargs args . GetRemainingArgs for size_t i 0 i rargs . size i if strcmp rargs i , -groups if i rargs . size numPatchGroups atoi rargs i else if strcmp rargs i , -mult if i rargs . size geoMultiplier atoi rargs i else if strcmp rargs i , -notess noTessFlag true else if strcmp rargs i , -nooutput noOutputFlag true else fprintf stderr , Warning Argument s ignored n , rargs i private Args Load command line arguments and geometry, then divide the mesh into groups of faces from which to create and tessellate patches int main int argc , char argv Args args argc , argv Create or load the base geometry command line arguments allow a .obj file to be specified. In addition to the TopologyRefiner and set of positions for the base vertices, a set of PtexIndices is also required to evaluate patches, so build it here once for use elsewhere std vector Pos basePositions Far TopologyRefiner baseRefinerPtr args . inputObjFile . empty createTopologyRefinerDefault args . geoMultiplier , basePositions createTopologyRefinerFromObj args . inputObjFile , args . schemeType , basePositions assert baseRefinerPtr Far TopologyRefiner baseRefiner baseRefinerPtr Far PtexIndices basePtexIndices baseRefiner Determine the sizes of the patch groups specified -- there will be two sizes that differ by one to account for unequal division int numBaseFaces baseRefiner . GetNumFacesTotal int numPatchGroups args . numPatchGroups if numPatchGroups numBaseFaces numPatchGroups numBaseFaces else if numPatchGroups 1 numPatchGroups 1 int lesserGroupSize numBaseFaces numPatchGroups int numLargerGroups numBaseFaces - numPatchGroups lesserGroupSize Define the options used to construct the patches for each group. Unless suppressed, a tessellation in Obj format will also be printed to standard output, so keep track of the vertex indices. Far PatchTableFactory Options patchOptions args . maxPatchDepth patchOptions . generateVaryingTables false patchOptions . shareEndCapPatchPoints false patchOptions . endCapType Far PatchTableFactory Options ENDCAP_GREGORY_BASIS int objVertCount 0 PosVector tessPoints TriVector tessFaces for int i 0 i numPatchGroups i Initialize a vector with a group of base faces from which to create and evaluate patches Index minFace i lesserGroupSize std min i , numLargerGroups Index maxFace minFace lesserGroupSize i numLargerGroups std vector Far Index baseFaces maxFace - minFace for int face minFace face maxFace face baseFaces face - minFace face Declare a PatchGroup and tessellate its base faces -- generating vertices and faces in Obj format to standard output PatchGroup patchGroup patchOptions , baseRefiner , basePtexIndices , basePositions , baseFaces if args . noTessFlag continue if args . noOutputFlag printf g patchGroup_d n , i for int j 0 j int baseFaces . size j patchGroup . TessellateBaseFace j , tessPoints , tessFaces if args . noOutputFlag int nVerts int tessPoints . size for int k 0 k nVerts k float const p tessPoints k . p printf v f f f n , p 0 , p 1 , p 2 int nTris int tessFaces . size int vBase 1 objVertCount for int k 0 k nTris k int const v tessFaces k . v printf f d d d n , vBase v 0 , vBase v 1 , vBase v 2 objVertCount nVerts delete baseRefinerPtr return EXIT_SUCCESS Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"bfr_tutorial_1_1.html\"\n+ \"loc\": \"far_tutorial_5_2.html\"\n }, {\n \"title\": \"far_tutorial_5_3.cpp\",\n \"text\": \"far_tutorial_5_3.cpp far_tutorial_5_3.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_5_3far_tutorial_5_3.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to use a FarLimitStenciTable to repeatedly and efficiently evaluate a set of points and optionally derivatives on the limit surface. A LimitStencilTable derives from StencilTable but is specialized to factor the evaluation of limit positions and derivatives into stencils. This allows a set of limit properties to be efficiently recomputed in response to changes to the vertices of the base mesh. Constructing the different kinds of StencilTables can have a high cost, so whether that cost is worth it will depend on your usage e.g. if points are only computed once, using stencil tables is typically not worth the added cost. Any points on the limit surface can be identified for evaluation. In this example we create a crude tessellation similar to tutorial_5_2. The midpoint of each face and points near the corners of the face are evaluated and a triangle fan connects them. include ......regressioncommonarg_utils.h include ......regressioncommonfar_utils.h include opensubdivfartopologyDescriptor.h include opensubdivfarpatchTableFactory.h include opensubdivfarstencilTableFactory.h include opensubdivfarptexIndices.h include cassert include cstdio include cstring include fstream include sstream using namespace OpenSubdiv using Far Index Global utilities in this namespace are not relevant to the tutorial. They simply serve to construct some default geometry to be processed in the form of a TopologyRefiner and vector of vertex positions. namespace Simple structs for x,y,z position and a 3-tuple for the set of vertices of a triangle struct Pos Pos Pos float x , float y , float z p 0 x , p 1 y , p 2 z Pos operator Pos const op const return Pos p 0 op . p 0 , p 1 op . p 1 , p 2 op . p 2 Clear and AddWithWeight required for interpolation void Clear void 0 p 0 p 1 p 2 0.0f void AddWithWeight Pos const src , float weight p 0 weight src . p 0 p 1 weight src . p 1 p 2 weight src . p 2 float p 3 typedef std vector Pos PosVector struct Tri Tri Tri int a , int b , int c v 0 a , v 1 b , v 2 c int v 3 typedef std vector Tri TriVector Functions to populate the topology and geometry arrays a simple shape whose positions may be transformed void createCube std vector int vertsPerFace , std vector Index faceVertsPerFace , std vector Pos positionsPerVert Local topology and position of a cube centered at origin static float const cubePositions 8 3 -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f static int const cubeFaceVerts 6 4 0 , 3 , 2 , 1 , 4 , 5 , 6 , 7 , 0 , 4 , 7 , 3 , 1 , 2 , 6 , 5 , 0 , 1 , 5 , 4 , 3 , 7 , 6 , 2 Initialize verts-per-face and face-vertices for each face vertsPerFace . resize 6 faceVertsPerFace . resize 24 for int i 0 i 6 i vertsPerFace i 4 for int j 0 j 4 j faceVertsPerFace i 4 j cubeFaceVerts i j Initialize vertex positions positionsPerVert . resize 8 for int i 0 i 8 i float const p cubePositions i positionsPerVert i Pos p 0 , p 1 , p 2 Create a TopologyRefiner from default geometry created above Far TopologyRefiner createTopologyRefinerDefault PosVector posVector std vector int topVertsPerFace std vector Index topFaceVerts createCube topVertsPerFace , topFaceVerts , posVector typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_AND_CORNER Descriptor desc desc . numVertices int posVector . size desc . numFaces int topVertsPerFace . size desc . numVertsPerFace topVertsPerFace 0 desc . vertIndicesPerFace topFaceVerts 0 Instantiate a FarTopologyRefiner from the descriptor. Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options assert refiner return refiner Create a TopologyRefiner from a specified Obj file geometry created internally Far TopologyRefiner createTopologyRefinerFromObj std string const objFileName , Sdc SchemeType schemeType , PosVector posVector const char filename objFileName . c_str const Shape shape 0 std ifstream ifs filename if ifs std stringstream ss ss ifs . rdbuf ifs . close std string shapeString ss . str shape Shape parseObj shapeString . c_str , ConvertSdcTypeToShapeScheme schemeType , false if shape 0 fprintf stderr , Error Cannot create Shape from .obj file s n , filename return 0 else fprintf stderr , Error Cannot open .obj file s n , filename return 0 Sdc SchemeType sdcType GetSdcType shape Sdc Options sdcOptions GetSdcOptions shape Far TopologyRefiner refiner Far TopologyRefinerFactory Shape Create shape , Far TopologyRefinerFactory Shape Options sdcType , sdcOptions if refiner 0 fprintf stderr , Error Unable to construct TopologyRefiner from .obj file s n , filename return 0 int numVertices refiner - GetNumVerticesTotal posVector . resize numVertices std memcpy posVector 0 . p 0 , shape - verts 0 , numVertices 3 sizeof float delete shape return refiner Simple function to export an Obj file for the limit points -- which provides a simple tessllation similar to tutorial_5_2. int writeToObj Far TopologyLevel const baseLevel , std vector Pos const vertexPositions , int nextObjVertexIndex for size_t i 0 i vertexPositions . size i float const p vertexPositions i . p printf v f f f n , p 0 , p 1 , p 2 Connect the sequences of limit points center followed by corners into triangle fans for each base face for int i 0 i baseLevel . GetNumFaces i int faceSize baseLevel . GetFaceVertices i . size int vCenter nextObjVertexIndex 1 int vCorner vCenter 1 for int k 0 k faceSize k printf f d d d n , vCenter , vCorner k , vCorner k 1 faceSize nextObjVertexIndex faceSize 1 return nextObjVertexIndex end namespace Command line arguments parsed to provide run-time options class Args public std string inputObjFile Sdc SchemeType schemeType int maxPatchDepth int numPoses Pos poseOffset bool deriv1Flag bool noPatchesFlag bool noOutputFlag public Args int argc , char argv inputObjFile , schemeType Sdc SCHEME_CATMARK , maxPatchDepth 3 , numPoses 0 , poseOffset 1.0f , 0.0f , 0.0f , deriv1Flag false , noPatchesFlag false , noOutputFlag false Parse and assign standard arguments and Obj files ArgOptions args args . Parse argc , argv maxPatchDepth args . GetLevel schemeType ConvertShapeSchemeToSdcType args . GetDefaultScheme const std vector const char objFiles args . GetObjFiles if objFiles . empty for size_t i 1 i objFiles . size i fprintf stderr , Warning .obj file s ignored n , objFiles i inputObjFile std string objFiles 0 Parse remaining arguments specific to this example const std vector const char rargs args . GetRemainingArgs for size_t i 0 i rargs . size i if strcmp rargs i , -d1 deriv1Flag true else if strcmp rargs i , -nopatches noPatchesFlag true else if strcmp rargs i , -poses if i rargs . size numPoses atoi rargs i else if strcmp rargs i , -offset if i rargs . size poseOffset . p 0 float atof rargs i if i rargs . size poseOffset . p 1 float atof rargs i if i rargs . size poseOffset . p 2 float atof rargs i else if strcmp rargs i , -nooutput noOutputFlag true else fprintf stderr , Warning Argument s ignored n , rargs i private Args Assemble the set of locations for the limit points. The resulting vector of LocationArrays can contain arbitrary locations on the limit surface -- with multiple locations for the same patch grouped into a single array. In this case, for each base face, coordinates for the center and its corners are specified -- from which we will construct a triangle fan providing a crude tessellation similar to tutorial_5_2. typedef Far LimitStencilTableFactory LocationArray LocationArray int assembleLimitPointLocations Far TopologyRefiner const refiner , std vector LocationArray locations Coordinates for the center of the face and its corners slightly inset. Unlike most of the public interface for patches, the LocationArray refers to parameteric coordinates as s,t, so that convention will be followed here. Note that the s,t coordinates in a LocationArray are referred to by reference. The memory holding these s,t values must persist while the LimitStencilTable is constructed -- the arrays here are declared as static for that purpose. static float const quadSCoords 5 0.5f , 0.05f , 0.95f , 0.95f , 0.05f static float const quadTCoords 5 0.5f , 0.05f , 0.05f , 0.95f , 0.95f static float const triSCoords 4 0.33f , 0.05f , 0.95f , 0.05f static float const triTCoords 4 0.33f , 0.05f , 0.00f , 0.95f static float const irregSCoords 2 1.0f , 0.05f static float const irregTCoords 2 1.0f , 0.05f Since these are references to patches to be evaluated, we require use of the Ptex indices to identify the top-most parameterized patch, which is essential to dealing with non-quad faces in the case of Catmark. Far TopologyLevel const baseLevel refiner . GetLevel 0 Far PtexIndices basePtexIndices refiner int regFaceSize Sdc SchemeTypeTraits GetRegularFaceSize refiner . GetSchemeType For each base face, simply refer to the s,t arrays for regular quad and triangular patches with a single LocationArray. Otherwise, for irregular faces, the corners of the face come from different patches and so must be referenced in separate LocationArrays. locations . clear int numLimitPoints 0 for int i 0 i baseLevel . GetNumFaces i int baseFaceSize baseLevel . GetFaceVertices i . size int basePtexId basePtexIndices . GetFaceId i bool faceIsRegular baseFaceSize regFaceSize if faceIsRegular All coordinates are on the same top-level patch LocationArray loc loc . ptexIdx basePtexId loc . numLocations baseFaceSize 1 if baseFaceSize 4 loc . s quadSCoords loc . t quadTCoords else loc . s triSCoords loc . t triTCoords locations . push_back loc else Center coordinate is on the first sub-patch while those on near the corners are on each successive sub-patch LocationArray loc loc . numLocations 1 for int j 0 j baseFaceSize j bool isPerimeter j 0 loc . ptexIdx basePtexId isPerimeter j -1 0 loc . s irregSCoords isPerimeter loc . t irregTCoords isPerimeter locations . push_back loc numLimitPoints baseFaceSize 1 return numLimitPoints Load command line arguments and geometry, build the LimitStencilTable for a set of points on the limit surface and compute those points for several orientations of the mesh int main int argc , char argv Args args argc , argv Create or load the base geometry command line arguments allow a .obj file to be specified, providing a TopologyRefiner and a set of base vertex positions to work with std vector Pos basePositions Far TopologyRefiner refinerPtr args . inputObjFile . empty createTopologyRefinerDefault basePositions createTopologyRefinerFromObj args . inputObjFile , args . schemeType , basePositions assert refinerPtr Far TopologyRefiner refiner refinerPtr Far TopologyLevel const baseLevel refiner . GetLevel 0 Use of LimitStencilTable requires either explicit or implicit use of a PatchTable. A PatchTable is not required to construct a LimitStencilTable -- one will be constructed internally for use and discarded -- but explicit construction is recommended to control the many legacy options for PatchTable, rather than relying on internal defaults. Adaptive refinement is required in both cases to indicate the accuracy of the patches. Note that if a TopologyRefiner and PatchTable are not used for any other purpose than computing the limit points, that specifying the subset of faces containing those limit points in the adaptive refinement and PatchTable construction can avoid unnecessary overhead. Far PatchTable patchTablePtr 0 if args . noPatchesFlag refiner . RefineAdaptive Far TopologyRefiner AdaptiveOptions args . maxPatchDepth else Far PatchTableFactory Options patchOptions args . maxPatchDepth patchOptions . useInfSharpPatch true patchOptions . generateLegacySharpCornerPatches false patchOptions . generateVaryingTables false patchOptions . generateFVarTables false patchOptions . endCapType Far PatchTableFactory Options ENDCAP_GREGORY_BASIS refiner . RefineAdaptive patchOptions . GetRefineAdaptiveOptions patchTablePtr Far PatchTableFactory Create refiner , patchOptions assert patchTablePtr Assemble the set of locations for the limit points. For each base face, coordinates for the center and its corners are specified -- from which we will construct a triangle fan providing a crude tessellation similar to tutorial_5_2. std vector LocationArray locations int numLimitPoints assembleLimitPointLocations refiner , locations Construct a LimitStencilTable from the refiner, patch table optional and the collection of limit point locations. Stencils can optionally be created for computing dervatives -- the default is to compute 1st derivative stencils, so be sure to disable that if not necessary Far LimitStencilTableFactory Options limitOptions limitOptions . generate1stDerivatives args . deriv1Flag Far LimitStencilTable const limitStencilTablePtr Far LimitStencilTableFactory Create refiner , locations , 0 , optional StencilTable for the refined points patchTablePtr , optional PatchTable limitOptions assert limitStencilTablePtr Far LimitStencilTable const limitStencilTable limitStencilTablePtr Apply the constructed LimitStencilTable to compute limit positions from the base level vertex positions. This is trivial if computing all positions in one invokation. The UpdateValues method and those for derivatives are overloaded to optionally accept a subrange of indices to distribute the computation std vector Pos limitPositions numLimitPoints limitStencilTable . UpdateValues basePositions , limitPositions Call with the optional subrange limitStencilTable . UpdateValues basePositions , limitPositions , 0 , numLimitPoints 2 limitStencilTable . UpdateValues basePositions , limitPositions , numLimitPoints 2 1 , numLimitPoints Write vertices and faces in Obj format for the original limit points int objVertCount 0 if args . noOutputFlag printf g base_mesh n objVertCount writeToObj baseLevel , limitPositions , objVertCount Recompute the limit points and output faces for different poses of the original mesh -- in this case simply translated. Also optionally compute 1st derivatives though they are not used here std vector Pos posePositions basePositions std vector Pos limitDu args . deriv1Flag numLimitPoints 0 std vector Pos limitDv args . deriv1Flag numLimitPoints 0 for int i 0 i args . numPoses i Trivially transform the base vertex positions and re-compute for size_t j 0 j basePositions . size j posePositions j posePositions j args . poseOffset limitStencilTable . UpdateValues posePositions , limitPositions if args . deriv1Flag limitStencilTable . UpdateDerivs posePositions , limitDu , limitDv if args . noOutputFlag printf n g pose_d n , i objVertCount writeToObj baseLevel , limitPositions , objVertCount delete refinerPtr delete patchTablePtr delete limitStencilTablePtr return EXIT_SUCCESS Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_5_3.html\"\n }, {\n- \"title\": \"far_tutorial_5_2.cpp\",\n- \"text\": \"far_tutorial_5_2.cpp far_tutorial_5_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_5_2far_tutorial_5_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to manage the limit surface of a potentially large mesh by creating groups of patches for selected faces of the mesh. Familiarity with construction and evaluation of a PatchTable is assumed see tutorial_5_1. When the patches for a mesh do not need to be retained for further use, e.g. when simply computing points for a tessellation, the time and space required to construct a single large PatchTable can be considerable. By constructing, evaluating and discarding smaller PatchTables for subsets of the mesh, the high transient memory cost can be avoided when computed serially. When computed in parallel, there may be little memory savings, but the construction time can then be distributed. This tutorial creates simple geometry currently a lattice of cubes that can be expanded in complexity with a simple multiplier. The collection of faces are then divided into a specified number of groups from which patches will be constructed and evaluated. A simple tessellation a triangle fan around the midpoint of each face is then written in Obj format to the standard output. include ......regressioncommonarg_utils.h include ......regressioncommonfar_utils.h include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include opensubdivfarpatchTableFactory.h include opensubdivfarpatchMap.h include opensubdivfarptexIndices.h include cassert include cstdio include cstring include fstream include sstream using namespace OpenSubdiv using Far Index Global utilities in this namespace are not relevant to the tutorial. They simply serve to construct some default geometry to be processed in the form of a TopologyRefiner and vector of vertex positions. namespace Simple structs for x,y,z position and a 3-tuple for the set of vertices of a triangle struct Pos Pos Pos float x , float y , float z p 0 x , p 1 y , p 2 z Pos operator Pos const op const return Pos p 0 op . p 0 , p 1 op . p 1 , p 2 op . p 2 Clear and AddWithWeight required for interpolation void Clear void 0 p 0 p 1 p 2 0.0f void AddWithWeight Pos const src , float weight p 0 weight src . p 0 p 1 weight src . p 1 p 2 weight src . p 2 float p 3 typedef std vector Pos PosVector struct Tri Tri Tri int a , int b , int c v 0 a , v 1 b , v 2 c int v 3 typedef std vector Tri TriVector Functions to populate the topology and geometry arrays with simple shapes that we can multiply to increase complexity void appendDefaultPrimitive Pos const origin , std vector int vertsPerFace , std vector Index faceVerts , std vector Pos positionsPerVert Local topology and position of a cube centered at origin static float const cubePositions 8 3 -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f static int const cubeFaceVerts 6 4 0 , 3 , 2 , 1 , 4 , 5 , 6 , 7 , 0 , 4 , 7 , 3 , 1 , 2 , 6 , 5 , 0 , 1 , 5 , 4 , 3 , 7 , 6 , 2 Identify the next vertex before appending vertex positions int baseVertex int positionsPerVert . size for int i 0 i 8 i float const p cubePositions i positionsPerVert . push_back origin Pos p 0 , p 1 , p 2 Append number of verts-per-face and face-vertices for each face for int i 0 i 6 i vertsPerFace . push_back 4 for int j 0 j 4 j faceVerts . push_back baseVertex cubeFaceVerts i j void createDefaultGeometry int multiplier , std vector int vertsPerFace , std vector Index faceVerts , std vector Pos positionsPerVert Default primitive is currently a cube int const vertsPerPrimitive 8 int const facesPerPrimitive 6 int const faceVertsPerPrimitive 24 int nPrimitives multiplier multiplier multiplier positionsPerVert . reserve nPrimitives vertsPerPrimitive vertsPerFace . reserve nPrimitives facesPerPrimitive faceVerts . reserve nPrimitives faceVertsPerPrimitive for int x 0 x multiplier x for int y 0 y multiplier y for int z 0 z multiplier z appendDefaultPrimitive Pos float x 2.0f , float y 2.0f , float z 2.0f , vertsPerFace , faceVerts , positionsPerVert Create a TopologyRefiner from default geometry created above Far TopologyRefiner createTopologyRefinerDefault int multiplier , PosVector posVector std vector int topVertsPerFace std vector Index topFaceVerts createDefaultGeometry multiplier , topVertsPerFace , topFaceVerts , posVector typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_AND_CORNER Descriptor desc desc . numVertices int posVector . size desc . numFaces int topVertsPerFace . size desc . numVertsPerFace topVertsPerFace 0 desc . vertIndicesPerFace topFaceVerts 0 Instantiate a FarTopologyRefiner from the descriptor. Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options if refiner 0 exit EXIT_FAILURE bool dumpDefaultGeometryToObj false if dumpDefaultGeometryToObj int nVerts int posVector . size for int i 0 i nVerts i float const p posVector i . p printf v f f f n , p 0 , p 1 , p 2 int const fVerts topFaceVerts 0 int nFaces int topVertsPerFace . size for int i 0 i nFaces i printf f for int j 0 j topVertsPerFace i j printf d , 1 fVerts printf n exit EXIT_SUCCESS return refiner Create a TopologyRefiner from a specified Obj file geometry created internally Far TopologyRefiner createTopologyRefinerFromObj std string const objFileName , Sdc SchemeType schemeType , PosVector posVector const char filename objFileName . c_str const Shape shape 0 std ifstream ifs filename if ifs std stringstream ss ss ifs . rdbuf ifs . close std string shapeString ss . str shape Shape parseObj shapeString . c_str , ConvertSdcTypeToShapeScheme schemeType , false if shape 0 fprintf stderr , Error Cannot create Shape from .obj file s n , filename return 0 else fprintf stderr , Error Cannot open .obj file s n , filename return 0 Sdc SchemeType sdcType GetSdcType shape Sdc Options sdcOptions GetSdcOptions shape Far TopologyRefiner refiner Far TopologyRefinerFactory Shape Create shape , Far TopologyRefinerFactory Shape Options sdcType , sdcOptions if refiner 0 fprintf stderr , Error Unable to construct TopologyRefiner from .obj file s n , filename return 0 int numVertices refiner - GetNumVerticesTotal posVector . resize numVertices std memcpy posVector 0 . p 0 , shape - verts 0 , numVertices 3 sizeof float delete shape return refiner end namespace The PatchGroup bundles objects used to create and evaluate a sparse set of patches. Its construction creates a PatchTable and all other objects necessary to evaluate patches associated with the specified subset of faces provided. A simple method to tessellate a specified face is provided. Note that, since the data buffers for the base level and refined levels are separate we want to avoid copying primvar data for the base level of a potentially large mesh, that patch evaluation needs to account for the separation when combining control points. struct PatchGroup PatchGroup Far PatchTableFactory Options patchOptions , Far TopologyRefiner const baseRefinerArg , Far PtexIndices const basePtexIndicesArg , std vector Pos const basePositionsArg , std vector Index const baseFacesArg PatchGroup void TessellateBaseFace int face , PosVector tessPoints , TriVector tessTris const Const reference members Far TopologyRefiner const baseRefiner Far PtexIndices const basePtexIndices std vector Pos const basePositions std vector Index const baseFaces Members constructed to evaluate patches Far PatchTable patchTable Far PatchMap patchMap int patchFaceSize std vector Pos localPositions PatchGroup PatchGroup Far PatchTableFactory Options patchOptions , Far TopologyRefiner const baseRefinerArg , Far PtexIndices const basePtexIndicesArg , std vector Pos const basePositionsArg , std vector Index const baseFacesArg baseRefiner baseRefinerArg , basePtexIndices basePtexIndicesArg , basePositions basePositionsArg , baseFaces baseFacesArg Create a local refiner sharing the base level, apply adaptive refinement to the given subset of base faces, and construct a patch table and its associated map for the same set of faces Far ConstIndexArray groupFaces baseFaces 0 , int baseFaces . size Far TopologyRefiner localRefiner Far TopologyRefinerFactory Far TopologyDescriptor Create baseRefiner localRefiner - RefineAdaptive patchOptions . GetRefineAdaptiveOptions , groupFaces patchTable Far PatchTableFactory Create localRefiner , patchOptions , groupFaces patchMap new Far PatchMap patchTable patchFaceSize Sdc SchemeTypeTraits GetRegularFaceSize baseRefiner . GetSchemeType Compute the number of refined and local points needed to evaluate the patches, allocate and interpolate. This varies from tutorial_5_1 in that the primvar buffer for the base vertices is separate from the refined vertices and local patch points which must also be accounted for when evaluating the patches. int nBaseVertices localRefiner - GetLevel 0 . GetNumVertices int nRefinedVertices localRefiner - GetNumVerticesTotal - nBaseVertices int nLocalPoints patchTable - GetNumLocalPoints localPositions . resize nRefinedVertices nLocalPoints if nRefinedVertices Far PrimvarRefiner primvarRefiner localRefiner Pos const src basePositions 0 Pos dst localPositions 0 for int level 1 level localRefiner - GetNumLevels level primvarRefiner . Interpolate level , src , dst src dst dst localRefiner - GetLevel level . GetNumVertices if nLocalPoints patchTable - GetLocalPointStencilTable - UpdateValues basePositions 0 , nBaseVertices , localPositions 0 , localPositions nRefinedVertices delete localRefiner PatchGroup PatchGroup delete patchTable delete patchMap void PatchGroup TessellateBaseFace int face , PosVector tessPoints , TriVector tessTris const Tesselate the face with points at the midpoint of the face and at each corner, and triangles connecting the midpoint to each edge. Irregular faces require an aribrary number of corners points, but all are at the origin of the child face of the irregular base face float const quadPoints 5 2 0.5f , 0.5f , 0.0f , 0.0f , 1.0f , 0.0f , 1.0f , 1.0f , 0.0f , 1.0f float const triPoints 4 2 0.5f , 0.5f , 0.0f , 0.0f , 1.0f , 0.0f , 0.0f , 1.0f float const irregPoints 4 2 1.0f , 1.0f , 0.0f , 0.0f Determine the topology of the given base face and the resulting tessellation points and faces to generate int baseFace baseFaces face int faceSize baseRefiner . GetLevel 0 . GetFaceVertices baseFace . size bool faceIsIrregular faceSize patchFaceSize int nTessPoints faceSize 1 int nTessFaces faceSize tessPoints . resize nTessPoints tessTris . resize nTessFaces Compute the mid and corner points -- remember that for an irregular face, we must reference the individual ptex faces for each corner int ptexFace basePtexIndices . GetFaceId baseFace int numBaseVerts int basePositions . size for int i 0 i nTessPoints i Choose the s,t coordinate from the fixed tessellation float const st faceIsIrregular irregPoints i 0 faceSize 4 quadPoints i triPoints i Locate the patch corresponding to the face ptex idx and s,t and evaluate int patchFace ptexFace if faceIsIrregular i 0 patchFace i - 1 Far PatchTable PatchHandle const handle patchMap - FindPatch patchFace , st 0 , st 1 assert handle float pWeights 20 patchTable - EvaluateBasis handle , st 0 , st 1 , pWeights Identify the patch cvs and combine with the evaluated weights -- remember to distinguish cvs in the base level Far ConstIndexArray cvIndices patchTable - GetPatchVertices handle Pos pos tessPoints i pos . Clear for int cv 0 cv cvIndices . size cv int cvIndex cvIndices cv if cvIndex numBaseVerts pos . AddWithWeight basePositions cvIndex , pWeights cv else pos . AddWithWeight localPositions cvIndex - numBaseVerts , pWeights cv Assign triangles connecting the midpoint of the base face to the points computed at the ends of each of its edges for int i 0 i nTessFaces i tessTris i Tri 0 , 1 i , 1 i 1 faceSize Command line arguments parsed to provide run-time options class Args public std string inputObjFile Sdc SchemeType schemeType int geoMultiplier int maxPatchDepth int numPatchGroups bool noTessFlag bool noOutputFlag public Args int argc , char argv inputObjFile , schemeType Sdc SCHEME_CATMARK , geoMultiplier 10 , maxPatchDepth 3 , numPatchGroups 10 , noTessFlag false , noOutputFlag false Parse and assign standard arguments and Obj files ArgOptions args args . Parse argc , argv maxPatchDepth args . GetLevel schemeType ConvertShapeSchemeToSdcType args . GetDefaultScheme const std vector const char objFiles args . GetObjFiles if objFiles . empty for size_t i 1 i objFiles . size i fprintf stderr , Warning .obj file s ignored n , objFiles i inputObjFile std string objFiles 0 Parse remaining arguments specific to this example const std vector const char rargs args . GetRemainingArgs for size_t i 0 i rargs . size i if strcmp rargs i , -groups if i rargs . size numPatchGroups atoi rargs i else if strcmp rargs i , -mult if i rargs . size geoMultiplier atoi rargs i else if strcmp rargs i , -notess noTessFlag true else if strcmp rargs i , -nooutput noOutputFlag true else fprintf stderr , Warning Argument s ignored n , rargs i private Args Load command line arguments and geometry, then divide the mesh into groups of faces from which to create and tessellate patches int main int argc , char argv Args args argc , argv Create or load the base geometry command line arguments allow a .obj file to be specified. In addition to the TopologyRefiner and set of positions for the base vertices, a set of PtexIndices is also required to evaluate patches, so build it here once for use elsewhere std vector Pos basePositions Far TopologyRefiner baseRefinerPtr args . inputObjFile . empty createTopologyRefinerDefault args . geoMultiplier , basePositions createTopologyRefinerFromObj args . inputObjFile , args . schemeType , basePositions assert baseRefinerPtr Far TopologyRefiner baseRefiner baseRefinerPtr Far PtexIndices basePtexIndices baseRefiner Determine the sizes of the patch groups specified -- there will be two sizes that differ by one to account for unequal division int numBaseFaces baseRefiner . GetNumFacesTotal int numPatchGroups args . numPatchGroups if numPatchGroups numBaseFaces numPatchGroups numBaseFaces else if numPatchGroups 1 numPatchGroups 1 int lesserGroupSize numBaseFaces numPatchGroups int numLargerGroups numBaseFaces - numPatchGroups lesserGroupSize Define the options used to construct the patches for each group. Unless suppressed, a tessellation in Obj format will also be printed to standard output, so keep track of the vertex indices. Far PatchTableFactory Options patchOptions args . maxPatchDepth patchOptions . generateVaryingTables false patchOptions . shareEndCapPatchPoints false patchOptions . endCapType Far PatchTableFactory Options ENDCAP_GREGORY_BASIS int objVertCount 0 PosVector tessPoints TriVector tessFaces for int i 0 i numPatchGroups i Initialize a vector with a group of base faces from which to create and evaluate patches Index minFace i lesserGroupSize std min i , numLargerGroups Index maxFace minFace lesserGroupSize i numLargerGroups std vector Far Index baseFaces maxFace - minFace for int face minFace face maxFace face baseFaces face - minFace face Declare a PatchGroup and tessellate its base faces -- generating vertices and faces in Obj format to standard output PatchGroup patchGroup patchOptions , baseRefiner , basePtexIndices , basePositions , baseFaces if args . noTessFlag continue if args . noOutputFlag printf g patchGroup_d n , i for int j 0 j int baseFaces . size j patchGroup . TessellateBaseFace j , tessPoints , tessFaces if args . noOutputFlag int nVerts int tessPoints . size for int k 0 k nVerts k float const p tessPoints k . p printf v f f f n , p 0 , p 1 , p 2 int nTris int tessFaces . size int vBase 1 objVertCount for int k 0 k nTris k int const v tessFaces k . v printf f d d d n , vBase v 0 , vBase v 1 , vBase v 2 objVertCount nVerts delete baseRefinerPtr return EXIT_SUCCESS Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"bfr_tutorial_1_1.cpp\",\n+ \"text\": \"bfr_tutorial_1_1.cpp bfr_tutorial_1_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_1bfr_tutorial_1_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial illustrates the use of the SurfaceFactory, Surface and Parameterization classes for creating and evaluating the limit surface associated with each base face of a mesh. Following the creation of a connected mesh for a shape using a FarTopologyRefiner, as illustrated in Far tutorials, an instance of a SurfaceFactory is declared to process its faces. Each face of the mesh is evaluated and tessellated independently with a simple triangle fan, with results written out in Obj format for inspection. These classes make it simple to evaluate and tessellate all faces quads, tris or others while supporting the full set of subdivision options. While a triangle fan may be a trivial tessellation and so not very useful later examples using the Tessellation class provide more useful results with the same simplicity. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector int outTriangles Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Get the Parameterization of the Surface and use it to identify coordinates for evaluation -- in this case, at the vertices and center of the face to create a fan of triangles Bfr Parameterization faceParam faceSurface . GetParameterization int faceSize faceParam . GetFaceSize int numOutCoords faceSize 1 outCoords . resize numOutCoords 2 for int i 0 i faceSize i faceParam . GetVertexCoord i , outCoords i 2 faceParam . GetCenterCoord outCoords faceSize 2 Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Resize patch point and output arrays int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Identify the faces of the tessellation, i.e. the triangle fan connecting points at the vertices to the center last point Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. int objVertexIndexOffset objWriter . GetNumVertices outTriangles . resize faceSize 3 int outTriangle outTriangles . data for int i 0 i faceSize i , outTriangle 3 outTriangle 0 objVertexIndexOffset i outTriangle 1 objVertexIndexOffset i 1 faceSize outTriangle 2 objVertexIndexOffset faceSize Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outTriangles , 3 , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"far_tutorial_5_2.html\"\n+ \"loc\": \"bfr_tutorial_1_1.html\"\n+ }, {\n+ \"title\": \"bfr_tutorial_1_2.cpp\",\n+ \"text\": \"bfr_tutorial_1_2.cpp bfr_tutorial_1_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_2bfr_tutorial_1_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory and Surface for evaluating the limit surface of faces by using the Tessellation class to determine the points to evaluate and the faces that connect them. The Tessellation class replaces the explicit determination of points and faces for the triangle fan of the previous example. Given a uniform tessellation rate via a command line option, Tessellation returns the set of coordinates to evaluate, and separately returns the faces that connect them. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Resize patch point and output arrays int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"bfr_tutorial_1_2.html\"\n }, {\n \"title\": \"far_tutorial_5_1.cpp\",\n \"text\": \"far_tutorial_5_1.cpp far_tutorial_5_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_5_1far_tutorial_5_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to interpolate surface limits at arbitrary parametric locations using feature adaptive FarPatchTables. The evaluation of the limit surface at arbitrary locations requires the adaptive isolation of topological features. This process converts the input polygonal control cage into a collection of bi-cubic patches. We can then evaluate the patches at random parametric locations and obtain analytical positions and tangents on the limit surface. The results are dumped into a MEL script that draws streak particle systems that show the tangent and bi-tangent at the random samples locations. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include opensubdivfarpatchTableFactory.h include opensubdivfarpatchMap.h include opensubdivfarptexIndices.h include cassert include cstdio include cstring include cfloat using namespace OpenSubdiv typedef double Real pyramid geometry from catmark_pyramid_crease0.h static int const g_nverts 5 static Real const g_verts 24 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 2.0f , 0.0f , 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 0.0f , static int const g_vertsperface 5 3 , 3 , 3 , 3 , 4 static int const g_nfaces 5 static int const g_faceverts 16 0 , 1 , 2 , 0 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 4 , 3 , 2 , 1 static int const g_ncreases 4 static int const g_creaseverts 8 4 , 3 , 3 , 2 , 2 , 1 , 1 , 4 static float const g_creaseweights 4 3.0f , 3.0f , 3.0f , 3.0f Creates a FarTopologyRefiner from the pyramid shape above static Far TopologyRefiner createTopologyRefiner ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex void Clear void 0 point 0 point 1 point 2 0.0f void AddWithWeight Vertex const src , Real weight point 0 weight src . point 0 point 1 weight src . point 1 point 2 weight src . point 2 Real point 3 ------------------------------------------------------------------------------ Limit frame container implementation -- this interface is not strictly required but follows a similar pattern to Vertex. struct LimitFrame void Clear void 0 point 0 point 1 point 2 0.0f deriv1 0 deriv1 1 deriv1 2 0.0f deriv2 0 deriv2 1 deriv2 2 0.0f void AddWithWeight Vertex const src , Real weight , Real d1Weight , Real d2Weight point 0 weight src . point 0 point 1 weight src . point 1 point 2 weight src . point 2 deriv1 0 d1Weight src . point 0 deriv1 1 d1Weight src . point 1 deriv1 2 d1Weight src . point 2 deriv2 0 d2Weight src . point 0 deriv2 1 d2Weight src . point 1 deriv2 2 d2Weight src . point 2 Real point 3 , deriv1 3 , deriv2 3 ------------------------------------------------------------------------------ int main int , char Generate a FarTopologyRefiner see tutorial_1_1 for details. Far TopologyRefiner refiner createTopologyRefiner Patches are constructed from adaptively refined faces, but the processes of constructing the PatchTable and of applying adaptive refinement have historically been separate. Adaptive refinement is applied purely to satisfy the needs of the desired PatchTable, so options associated with adaptive refinement should be derived from those specified for the PatchTable. This is not a strict requirement, but it will avoid problems arising from specifyingcoordinating the two independently especially when dealing with face-varying patches. Initialize options for the PatchTable Choose patches adaptively refined to level 3 since the sharpest crease in the shape is 3.0f in g_creaseweights, and include the inf-sharp crease option just to illustrate the need to syncronize options. int maxPatchLevel 3 Far PatchTableFactory Options patchOptions maxPatchLevel patchOptions . SetPatchPrecision Real patchOptions . useInfSharpPatch true patchOptions . generateVaryingTables false patchOptions . endCapType Far PatchTableFactory Options ENDCAP_GREGORY_BASIS Initialize corresonding options for adaptive refinement Far TopologyRefiner AdaptiveOptions adaptiveOptions maxPatchLevel bool assignAdaptiveOptionsExplicitly false if assignAdaptiveOptionsExplicitly adaptiveOptions . useInfSharpPatch true else Be sure patch options were intialized with the desired max level adaptiveOptions patchOptions . GetRefineAdaptiveOptions assert adaptiveOptions . useInfSharpPatch patchOptions . useInfSharpPatch Apply adaptive refinement and construct the associated PatchTable to evaluate the limit surface refiner - RefineAdaptive adaptiveOptions Far PatchTable const patchTable Far PatchTableFactory Create refiner , patchOptions Compute the total number of points we need to evaluate the PatchTable. Approximations at irregular or extraordinary features require the use of additional points associated with the patches that are referred to as local points i.e. local to the PatchTable. int nRefinerVertices refiner - GetNumVerticesTotal int nLocalPoints patchTable - GetNumLocalPoints Create a buffer to hold the position of the refined verts and local points, then copy the coarse positions at the beginning. std vector Vertex verts nRefinerVertices nLocalPoints std memcpy verts 0 , g_verts , g_nverts 3 sizeof Real Adaptive refinement may result in fewer levels than the max specified. int nRefinedLevels refiner - GetNumLevels Interpolate vertex primvar data they are the control vertices of the limit patches see tutorial_1_1 for details Far PrimvarRefinerReal Real primvarRefiner refiner Vertex src verts 0 for int level 1 level nRefinedLevels level Vertex dst src refiner - GetLevel level -1 . GetNumVertices primvarRefiner . Interpolate level , src , dst src dst Evaluate local points from interpolated vertex primvars. if nLocalPoints patchTable - GetLocalPointStencilTable Real - UpdateValues verts 0 , verts nRefinerVertices Create a FarPatchMap to help locating patches in the table Far PatchMap patchmap patchTable Create a FarPtexIndices to help find indices of ptex faces. Far PtexIndices ptexIndices refiner Generate random samples on each ptex face int nsamplesPerFace 200 , nfaces ptexIndices . GetNumFaces std vector LimitFrame samples nsamplesPerFace nfaces srand static_cast int 2147483647 Real pWeights 20 , dsWeights 20 , dtWeights 20 for int face 0 , count 0 face nfaces face for int sample 0 sample nsamplesPerFace sample , count Real s Real rand Real RAND_MAX , t Real rand Real RAND_MAX Locate the patch corresponding to the face ptex idx and s,t Far PatchTable PatchHandle const handle patchmap . FindPatch face , s , t assert handle Evaluate the patch weights, identify the CVs and compute the limit frame patchTable - EvaluateBasis handle , s , t , pWeights , dsWeights , dtWeights Far ConstIndexArray cvs patchTable - GetPatchVertices handle LimitFrame dst samples count dst . Clear for int cv 0 cv cvs . size cv dst . AddWithWeight verts cvs cv , pWeights cv , dsWeights cv , dtWeights cv Visualization with Maya print a MEL script that generates particles at the location of the limit vertices int nsamples int samples . size printf file -f -new n Output particle positions for the tangent printf particle -n deriv1 for int sample 0 sample nsamples sample Real const pos samples sample . point printf -p f f f n , pos 0 , pos 1 , pos 2 printf n Set per-particle direction using the limit tangent display as Streak printf setAttr deriv1.particleRenderType 6 n printf setAttr deriv1.velocity -type vectorArray d , nsamples for int sample 0 sample nsamples sample Real const tan1 samples sample . deriv1 printf f f f n , tan1 0 , tan1 1 , tan1 2 printf n Output particle positions for the bi-tangent printf particle -n deriv2 for int sample 0 sample nsamples sample Real const pos samples sample . point printf -p f f f n , pos 0 , pos 1 , pos 2 printf n printf setAttr deriv2.particleRenderType 6 n printf setAttr deriv2.velocity -type vectorArray d , nsamples for int sample 0 sample nsamples sample Real const tan2 samples sample . deriv2 printf f f f n , tan2 0 , tan2 1 , tan2 2 printf n Exercise to the reader cross tangent bi-tangent for limit surface normal... Force Maya DAG update to see the result in the viewport printf currentTime -edit currentTime -q n printf select deriv1Shape deriv2Shape n delete refiner delete patchTable return EXIT_SUCCESS ------------------------------------------------------------------------------ static Far TopologyRefiner createTopologyRefiner typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_faceverts desc . numCreases g_ncreases desc . creaseVertexIndexPairs g_creaseverts desc . creaseWeights g_creaseweights Instantiate a FarTopologyRefiner from the descriptor. Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options return refiner Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_5_1.html\"\n }, {\n \"title\": \"far_tutorial_4_3.cpp\",\n \"text\": \"far_tutorial_4_3.cpp far_tutorial_4_3.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_4_3far_tutorial_4_3.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to create and manipulate table of cascading stencils. We initialize a FarTopologyRefiner with a cube and apply uniform refinement. We then use a FarStencilTableFactory to generate a stencil table. We set the factory Options to not factorize intermediate levels, thus giving a table of cascading stencils. We then apply the stencils to the vertex position primvar data, and insert a hierarchical edit at level 1. This edit is smoothed by the application of the subsequent stencil cascades. The results are dumped into an OBJ file that shows the intermediate levels of refinement of the original cube. include opensubdivfartopologyDescriptor.h include opensubdivfarstencilTable.h include opensubdivfarstencilTableFactory.h include cstdio include cstring ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z float const GetPosition const return _position float GetPosition return _position private float _position 3 ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 24 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner createTopologyRefiner ------------------------------------------------------------------------------ int main int , char Generate a FarTopologyRefiner see tutorial_1_1 for details. Far TopologyRefiner refiner createTopologyRefiner Uniformly refine the topology up to maxlevel. int maxlevel 4 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Use the FarStencilTable factory to create cascading stencil table note we want stencils for each refinement level cascade mode is achieved by setting factorizeIntermediateLevels to false Far StencilTableFactory Options options options . generateIntermediateLevels true options . factorizeIntermediateLevels false options . generateOffsets true Far StencilTable const stencilTable Far StencilTableFactory Create refiner , options std vector Vertex vertexBuffer refiner - GetNumVerticesTotal - g_nverts Vertex destVerts vertexBuffer 0 int start 0 , end 0 stencil batches for each level of subdivision for int level 0 level maxlevel level int nverts refiner - GetLevel level 1 . GetNumVertices Vertex const srcVerts reinterpret_cast Vertex g_verts if level 0 srcVerts vertexBuffer start start end end nverts stencilTable - UpdateValues srcVerts , destVerts , start , end apply 2 hierarchical edits on level 1 vertices if level 1 float pos destVerts start 5 . GetPosition pos 1 0.5f pos destVerts start 20 . GetPosition pos 0 0.25f Output OBJ of the highest level refined ----------- Vertex verts vertexBuffer 0 Print vertex positions for int level 1 , firstvert 0 level maxlevel level Far TopologyLevel const refLevel refiner - GetLevel level printf g level_d n , level int nverts refLevel . GetNumVertices for int vert 0 vert nverts vert float const pos verts vert . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 verts nverts Print faces for int face 0 face refLevel . GetNumFaces face Far ConstIndexArray fverts refLevel . GetFaceVertices face all refined Catmark faces should be quads assert fverts . size 4 printf f for int vert 0 vert fverts . size vert printf d , fverts vert firstvert 1 OBJ uses 1-based arrays... printf n firstvert nverts delete refiner delete stencilTable return EXIT_SUCCESS ------------------------------------------------------------------------------ static Far TopologyRefiner createTopologyRefiner Populate a topology descriptor with our raw data. typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor. return Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_4_3.html\"\n }, {\n- \"title\": \"far_tutorial_4_2.cpp\",\n- \"text\": \"far_tutorial_4_2.cpp far_tutorial_4_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_4_2far_tutorial_4_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to create and manipulate both vertex and varying FarStencilTable to interpolate 2 primvar data buffers vertex positions and vertex colors. include opensubdivfartopologyDescriptor.h include opensubdivfarstencilTable.h include opensubdivfarstencilTableFactory.h include cstdio include cstring ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _data 0 src . _data 0 _data 1 src . _data 1 _data 2 src . _data 2 void Clear void 0 _data 0 _data 1 _data 2 0.0f void AddWithWeight Vertex const src , float weight _data 0 weight src . _data 0 _data 1 weight src . _data 1 _data 2 weight src . _data 2 Public interface ------------------------------------ float const GetData const return _data private float _data 3 ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 24 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f Per-vertex RGB color data static float g_colors 24 1.0f , 0.0f , 0.5f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner createTopologyRefiner ------------------------------------------------------------------------------ int main int , char Generate a FarTopologyRefiner see tutorial_1_1 for details. Far TopologyRefiner refiner createTopologyRefiner Uniformly refine the topology up to maxlevel. int maxlevel 4 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel int nverts refiner - GetLevel maxlevel . GetNumVertices Use the FarStencilTable factory to create discrete stencil table Far StencilTableFactory Options options options . generateIntermediateLevels false only the highest refinement level. options . generateOffsets true Vertex primvar data Create stencils table for vertex interpolation options . interpolationMode Far StencilTableFactory INTERPOLATE_VERTEX Far StencilTable const vertexStencils Far StencilTableFactory Create refiner , options assert nverts vertexStencils - GetNumStencils Allocate vertex primvar buffer 1 stencil for each vertex std vector Vertex vertexBuffer vertexStencils - GetNumStencils Use the cube vertex positions as vertex primvar data Vertex vertexCVs reinterpret_cast Vertex g_verts Varying primvar data Create stencils table for varying interpolation options . interpolationMode Far StencilTableFactory INTERPOLATE_VARYING Far StencilTable const varyingStencils Far StencilTableFactory Create refiner , options assert nverts varyingStencils - GetNumStencils Allocate varying primvar buffer 1 stencil for each vertex std vector Vertex varyingBuffer varyingStencils - GetNumStencils Use per-vertex array of RGB colors as varying primvar data Vertex varyingCVs reinterpret_cast Vertex g_colors delete refiner Apply stencils in frame loop This section would be applied every frame after control vertices have been moved. Apply stencils on the control vertex data to update the primvar data of the refined vertices. vertexStencils - UpdateValues vertexCVs , vertexBuffer 0 varyingStencils - UpdateValues varyingCVs , varyingBuffer 0 Visualization with Maya print a MEL script that generates particles at the location of the refined vertices printf particle for int vert 0 vert int nverts vert float const pos vertexBuffer vert . GetData printf -p f f f n , pos 0 , pos 1 , pos 2 printf -c 1 n Set particle point size 20 -- very large printf addAttr -is true -ln pointSize -at long -dv 20 particleShape1 n Add per-particle color attribute rgbPP printf addAttr -ln rgbPP -dt vectorArray particleShape1 n Set per-particle color values from our varying primvar data printf setAttr particleShape1.rgbPP -type vectorArray d , nverts for int vert 0 vert nverts vert float const color varyingBuffer vert . GetData printf f f f n , color 0 , color 1 , color 2 printf n delete vertexStencils delete varyingStencils return EXIT_SUCCESS ------------------------------------------------------------------------------ static Far TopologyRefiner createTopologyRefiner Populate a topology descriptor with our raw data. typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor. Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options return refiner ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"far_tutorial_4_2.html\"\n- }, {\n \"title\": \"far_tutorial_3_1.cpp\",\n \"text\": \"far_tutorial_3_1.cpp far_tutorial_3_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_3_1far_tutorial_3_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to interface a high-level topology representation with Far for better efficiency. In tutorial 0, we showed how to instantiate topology from a simple face-vertex list. Here we will show how to take advantage of more complex data structures. Many client applications that manipulate geometry use advanced data structures such as half-edge, quad-edge or winged-edge in order to represent complex topological relationships beyond the usual face-vertex lists. We can take advantage of this information. Far provides an advanced interface that allows such a client application to communicate advanced component relationships directly and avoid having Far rebuilding them redundantly. include opensubdivfartopologyRefinerFactory.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ using namespace OpenSubdiv ------------------------------------------------------------------------------ For this tutorial, we provide the complete topological representation of a simple pyramid. In our case, we store it as a simple sequence of integers, with the understanding that client-code would provide a fully implemented data-structure such as quad-edges or winged-edges. Pyramid geometry from catmark_pyramid.h - extended for this tutorial static int g_nverts 5 , g_nedges 8 , g_nfaces 5 vertex positions static float g_verts 5 3 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 2.0f , 0.0f , 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 0.0f number of vertices in each face static int g_facenverts 5 3 , 3 , 3 , 3 , 4 index of face vertices static int g_faceverts 16 0 , 1 , 2 , 0 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 4 , 3 , 2 , 1 index of edge vertices 2 per edge static int g_edgeverts 16 0 , 1 , 1 , 2 , 2 , 0 , 2 , 3 , 3 , 0 , 3 , 4 , 4 , 0 , 4 , 1 index of face edges static int g_faceedges 16 0 , 1 , 2 , 2 , 3 , 4 , 4 , 5 , 6 , 6 , 7 , 0 , 5 , 3 , 1 , 7 number of faces adjacent to each edge static int g_edgenfaces 8 2 , 2 , 2 , 2 , 2 , 2 , 2 , 2 index of faces incident to a given edge static int g_edgefaces 16 0 , 3 , 0 , 4 , 0 , 1 , 1 , 4 , 1 , 2 , 2 , 4 , 2 , 3 , 3 , 4 number of faces incident to each vertex static int g_vertexnfaces 5 4 , 3 , 3 , 3 , 3 index of faces incident to each vertex static int g_vertexfaces 25 0 , 1 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 1 , 4 , 2 , 2 , 4 , 3 number of edges incident to each vertex static int g_vertexnedges 5 4 , 3 , 3 , 3 , 3 index of edges incident to each vertex static int g_vertexedges 25 0 , 2 , 4 , 6 , 1 , 0 , 7 , 2 , 1 , 3 , 4 , 3 , 5 , 6 , 5 , 7 Edge crease sharpness static float g_edgeCreases 8 0.0f , 2.5f , 0.0f , 2.5f , 0.0f , 2.5f , 0.0f , 2.5f ------------------------------------------------------------------------------ Because existing client-code may not provide an exact match for the topological queries required by Fars interface, we can provide a converter class. This can be particularly useful for instance if the client data-structure requires additional relationships to be mapped. For instance, half-edge representations do not store unique edge indices and it can be difficult to traverse edges or faces adjacent to a given vertex. Using an intermediate wrapper class allows us to leverage existing relationships information from a mesh, and generate the missing components temporarily. For a practical example, you can look at the file hbr_to_vtr.h in the same tutorial directory. This example implements a OsdHbrConverter class as a way of interfacing PRmans half-edge representation to Far. struct Converter public Sdc SchemeType GetType const return Sdc SCHEME_CATMARK Sdc Options GetOptions const Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY return options int GetNumFaces const return g_nfaces int GetNumEdges const return g_nedges int GetNumVertices const return g_nverts Face relationships int GetNumFaceVerts int face const return g_facenverts face int const GetFaceVerts int face const return g_faceverts getCompOffset g_facenverts , face int const GetFaceEdges int face const return g_faceedges getCompOffset g_facenverts , face Edge relationships int const GetEdgeVertices int edge const return g_edgeverts edge 2 int GetNumEdgeFaces int edge const return g_edgenfaces edge int const GetEdgeFaces int edge const return g_edgefaces getCompOffset g_edgenfaces , edge Vertex relationships int GetNumVertexEdges int vert const return g_vertexnedges vert int const GetVertexEdges int vert const return g_vertexedges getCompOffset g_vertexnedges , vert int GetNumVertexFaces int vert const return g_vertexnfaces vert int const GetVertexFaces int vert const return g_vertexfaces getCompOffset g_vertexnfaces , vert private int getCompOffset int const comps , int comp const int ofs 0 for int i 0 i comp i ofs comps i return ofs ------------------------------------------------------------------------------ namespace OpenSubdiv namespace OPENSUBDIV_VERSION namespace Far template bool TopologyRefinerFactory Converter resizeComponentTopology TopologyRefiner refiner , Converter const conv Faces and face-verts int nfaces conv . GetNumFaces setNumBaseFaces refiner , nfaces for int face 0 face nfaces face int nv conv . GetNumFaceVerts face setNumBaseFaceVertices refiner , face , nv Edges and edge-faces int nedges conv . GetNumEdges setNumBaseEdges refiner , nedges for int edge 0 edge nedges edge int nf conv . GetNumEdgeFaces edge setNumBaseEdgeFaces refiner , edge , nf Vertices and vert-faces and vert-edges int nverts conv . GetNumVertices setNumBaseVertices refiner , nverts for int vert 0 vert nverts vert int ne conv . GetNumVertexEdges vert , nf conv . GetNumVertexFaces vert setNumBaseVertexEdges refiner , vert , ne setNumBaseVertexFaces refiner , vert , nf return true template bool TopologyRefinerFactory Converter assignComponentTopology TopologyRefiner refiner , Converter const conv using Far IndexArray Face relations int nfaces conv . GetNumFaces for int face 0 face nfaces face IndexArray dstFaceVerts getBaseFaceVertices refiner , face IndexArray dstFaceEdges getBaseFaceEdges refiner , face int const faceverts conv . GetFaceVerts face int const faceedges conv . GetFaceEdges face for int vert 0 vert conv . GetNumFaceVerts face vert dstFaceVerts vert faceverts vert dstFaceEdges vert faceedges vert Edge relations Note if your representation is unable to provide edge relationships ex half-edges, you can comment out this section and Far will automatically generate the missing information. int nedges conv . GetNumEdges for int edge 0 edge nedges edge Edge-vertices IndexArray dstEdgeVerts getBaseEdgeVertices refiner , edge dstEdgeVerts 0 conv . GetEdgeVertices edge 0 dstEdgeVerts 1 conv . GetEdgeVertices edge 1 Edge-faces IndexArray dstEdgeFaces getBaseEdgeFaces refiner , edge for int face 0 face conv . GetNumEdgeFaces face face dstEdgeFaces face conv . GetEdgeFaces edge face Vertex relations int nverts conv . GetNumVertices for int vert 0 vert nverts vert Vert-Faces IndexArray vertFaces getBaseVertexFaces refiner , vert LocalIndexArray vertInFaceIndices getBaseVertexFaceLocalIndicesrefiner, vert for int face 0 face conv . GetNumVertexFaces vert face vertFaces face conv . GetVertexFaces vert face Vert-Edges IndexArray vertEdges getBaseVertexEdges refiner , vert LocalIndexArray vertInEdgeIndices getBaseVertexEdgeLocalIndicesrefiner, vert for int edge 0 edge conv . GetNumVertexEdges vert edge vertEdges edge conv . GetVertexEdges vert edge populateBaseLocalIndices refiner return true template bool TopologyRefinerFactory Converter assignComponentTags TopologyRefiner refiner , Converter const conv arbitrarily sharpen the 4 bottom edges of the pyramid to 2.5f for int edge 0 edge conv . GetNumEdges edge setBaseEdgeSharpness refiner , edge , g_edgeCreases edge return true ifdef _MSC_VER template void TopologyRefinerFactory Converter reportInvalidTopology TopologyError errCode , char const msg , Converter const mesh Optional topology validation error reporting This method is called whenever the factory encounters topology validation errors. By default, nothing is reported Warning msg template bool TopologyRefinerFactory Converter assignFaceVaryingTopology TopologyRefiner refiner , Converter const conv Because of the way MSVC specializes templated functions, we had to remove the default stubs in FarTopologyRefinerFactory. In this example, no face-varying data is being added, but we still need to implement a template specialization or MSVC linker fails. return true endif namespace Far namespace OPENSUBDIV_VERSION namespace OpenSubdiv ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ int main int , char Converter conv Far TopologyRefiner refiner Far TopologyRefinerFactory Converter Create conv , Far TopologyRefinerFactory Converter Options conv . GetType , conv . GetOptions int maxlevel 5 Uniformly refine the topology up to maxlevel refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Allocate a buffer for vertex primvar data. The buffer length is set to be the sum of all children vertices up to the highest level of refinement. std vector Vertex vbuffer refiner - GetNumVerticesTotal Vertex verts vbuffer 0 Initialize coarse mesh positions int nCoarseVerts g_nverts for int i 0 i nCoarseVerts i verts i . SetPosition g_verts i 0 , g_verts i 1 , g_verts i 2 Interpolate vertex primvar data Far PrimvarRefiner primvarRefiner refiner Vertex src verts for int level 1 level maxlevel level Vertex dst src refiner - GetLevel level -1 . GetNumVertices primvarRefiner . Interpolate level , src , dst src dst Output OBJ of the highest level refined ----------- Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int nverts refLastLevel . GetNumVertices int nfaces refLastLevel . GetNumFaces Print vertex positions int firstOfLastVerts refiner - GetNumVerticesTotal - nverts for int vert 0 vert nverts vert float const pos verts firstOfLastVerts vert . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print faces for int face 0 face nfaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face all refined Catmark faces should be quads assert fverts . size 4 printf f for int vert 0 vert fverts . size vert printf d , fverts vert 1 OBJ uses 1-based arrays... printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_3_1.html\"\n }, {\n- \"title\": \"far_tutorial_2_2.cpp\",\n- \"text\": \"far_tutorial_2_2.cpp far_tutorial_2_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_2_2far_tutorial_2_2.cpp ------------------------------------------------------------------------------ Tutorial description Building on tutorial 0, this example shows how to instantiate a simple mesh, refine it uniformly and then interpolate both vertex and face-varying primvar data. The resulting interpolated data is output as an obj file, with the face-varying data recorded in the uv texture layout. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ Face-varying implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ Face-varying container implementation. We are using a uv texture layout as a face-varying primitive variable attribute. Because face-varying data is specified per-face-per-vertex, we cannot use the same container that we use for vertex or varying data. We specify a new container, which only carries u,v coordinates. Similarly to our Vertex container, we add a minimalistic interpolation interface with a Clear and AddWithWeight methods. struct FVarVertexUV Minimal required interface ---------------------- void Clear u v 0.0f void AddWithWeight FVarVertexUV const src , float weight u weight src . u v weight src . v Basic uv layout channel float u , v struct FVarVertexColor Minimal required interface ---------------------- void Clear r g b a 0.0f void AddWithWeight FVarVertexColor const src , float weight r weight src . r g weight src . g b weight src . b a weight src . a Basic color layout channel float r , g , b , a ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h vertex primitive variable data topology static float g_verts 8 3 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 face-varying primitive variable data topology for UVs static float g_uvs 14 2 0.375 , 0.00 , 0.625 , 0.00 , 0.375 , 0.25 , 0.625 , 0.25 , 0.375 , 0.50 , 0.625 , 0.50 , 0.375 , 0.75 , 0.625 , 0.75 , 0.375 , 1.00 , 0.625 , 1.00 , 0.875 , 0.00 , 0.875 , 0.25 , 0.125 , 0.00 , 0.125 , 0.25 static int g_nuvs 14 static int g_uvIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 9 , 8 , 1 , 10 , 11 , 3 , 12 , 0 , 2 , 13 face-varying primitive variable data topology for color static float g_colors 24 4 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 static int g_ncolors 24 static int g_colorIndices 24 0 , 3 , 9 , 6 , 7 , 10 , 15 , 12 , 13 , 16 , 21 , 18 , 19 , 22 , 4 , 1 , 5 , 23 , 17 , 11 , 20 , 2 , 8 , 14 using namespace OpenSubdiv ------------------------------------------------------------------------------ int main int , char int maxlevel 3 typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY options . SetFVarLinearInterpolation Sdc Options FVAR_LINEAR_NONE Populate a topology descriptor with our raw data Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices int channelUV 0 int channelColor 1 Create a face-varying channel descriptor Descriptor FVarChannel channels 2 channels channelUV . numValues g_nuvs channels channelUV . valueIndices g_uvIndices channels channelColor . numValues g_ncolors channels channelColor . valueIndices g_colorIndices Add the channel topology to the main descriptor desc . numFVarChannels 2 desc . fvarChannels channels Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options Uniformly refine the topology up to maxlevel note fullTopologyInLastLevel must be true to work with face-varying data Far TopologyRefiner UniformOptions refineOptions maxlevel refineOptions . fullTopologyInLastLevel true refiner - RefineUniform refineOptions Allocate and initialize the vertex primvar data see tutorial 2 for more details. std vector Vertex vbuffer refiner - GetNumVerticesTotal Vertex verts vbuffer 0 for int i 0 i g_nverts i verts i . SetPosition g_verts i 0 , g_verts i 1 , g_verts i 2 Allocate and initialize the first channel of face-varying primvar data UVs std vector FVarVertexUV fvBufferUV refiner - GetNumFVarValuesTotal channelUV FVarVertexUV fvVertsUV fvBufferUV 0 for int i 0 i g_nuvs i fvVertsUV i . u g_uvs i 0 fvVertsUV i . v g_uvs i 1 Allocate interpolate the face-varying primvar data colors std vector FVarVertexColor fvBufferColor refiner - GetNumFVarValuesTotal channelColor FVarVertexColor fvVertsColor fvBufferColor 0 for int i 0 i g_ncolors i fvVertsColor i . r g_colors i 0 fvVertsColor i . g g_colors i 1 fvVertsColor i . b g_colors i 2 fvVertsColor i . a g_colors i 3 Interpolate both vertex and face-varying primvar data Far PrimvarRefiner primvarRefiner refiner Vertex srcVert verts FVarVertexUV srcFVarUV fvVertsUV FVarVertexColor srcFVarColor fvVertsColor for int level 1 level maxlevel level Vertex dstVert srcVert refiner - GetLevel level -1 . GetNumVertices FVarVertexUV dstFVarUV srcFVarUV refiner - GetLevel level -1 . GetNumFVarValues channelUV FVarVertexColor dstFVarColor srcFVarColor refiner - GetLevel level -1 . GetNumFVarValues channelColor primvarRefiner . Interpolate level , srcVert , dstVert primvarRefiner . InterpolateFaceVarying level , srcFVarUV , dstFVarUV , channelUV primvarRefiner . InterpolateFaceVarying level , srcFVarColor , dstFVarColor , channelColor srcVert dstVert srcFVarUV dstFVarUV srcFVarColor dstFVarColor Output OBJ of the highest level refined ----------- Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int nverts refLastLevel . GetNumVertices int nuvs refLastLevel . GetNumFVarValues channelUV int ncolors refLastLevel . GetNumFVarValues channelColor int nfaces refLastLevel . GetNumFaces Print vertex positions int firstOfLastVerts refiner - GetNumVerticesTotal - nverts for int vert 0 vert nverts vert float const pos verts firstOfLastVerts vert . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print uvs int firstOfLastUvs refiner - GetNumFVarValuesTotal channelUV - nuvs for int fvvert 0 fvvert nuvs fvvert FVarVertexUV const uv fvVertsUV firstOfLastUvs fvvert printf vt f f n , uv . u , uv . v Print colors int firstOfLastColors refiner - GetNumFVarValuesTotal channelColor - ncolors for int fvvert 0 fvvert ncolors fvvert FVarVertexColor const c fvVertsColor firstOfLastColors fvvert printf c f f f f n , c . r , c . g , c . b , c . a Print faces for int face 0 face nfaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face Far ConstIndexArray fuvs refLastLevel . GetFaceFVarValues face , channelUV all refined Catmark faces should be quads assert fverts . size 4 fuvs . size 4 printf f for int vert 0 vert fverts . size vert OBJ uses 1-based arrays... printf dd , fverts vert 1 , fuvs vert 1 printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"far_tutorial_4_2.cpp\",\n+ \"text\": \"far_tutorial_4_2.cpp far_tutorial_4_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_4_2far_tutorial_4_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to create and manipulate both vertex and varying FarStencilTable to interpolate 2 primvar data buffers vertex positions and vertex colors. include opensubdivfartopologyDescriptor.h include opensubdivfarstencilTable.h include opensubdivfarstencilTableFactory.h include cstdio include cstring ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _data 0 src . _data 0 _data 1 src . _data 1 _data 2 src . _data 2 void Clear void 0 _data 0 _data 1 _data 2 0.0f void AddWithWeight Vertex const src , float weight _data 0 weight src . _data 0 _data 1 weight src . _data 1 _data 2 weight src . _data 2 Public interface ------------------------------------ float const GetData const return _data private float _data 3 ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 24 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f Per-vertex RGB color data static float g_colors 24 1.0f , 0.0f , 0.5f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner createTopologyRefiner ------------------------------------------------------------------------------ int main int , char Generate a FarTopologyRefiner see tutorial_1_1 for details. Far TopologyRefiner refiner createTopologyRefiner Uniformly refine the topology up to maxlevel. int maxlevel 4 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel int nverts refiner - GetLevel maxlevel . GetNumVertices Use the FarStencilTable factory to create discrete stencil table Far StencilTableFactory Options options options . generateIntermediateLevels false only the highest refinement level. options . generateOffsets true Vertex primvar data Create stencils table for vertex interpolation options . interpolationMode Far StencilTableFactory INTERPOLATE_VERTEX Far StencilTable const vertexStencils Far StencilTableFactory Create refiner , options assert nverts vertexStencils - GetNumStencils Allocate vertex primvar buffer 1 stencil for each vertex std vector Vertex vertexBuffer vertexStencils - GetNumStencils Use the cube vertex positions as vertex primvar data Vertex vertexCVs reinterpret_cast Vertex g_verts Varying primvar data Create stencils table for varying interpolation options . interpolationMode Far StencilTableFactory INTERPOLATE_VARYING Far StencilTable const varyingStencils Far StencilTableFactory Create refiner , options assert nverts varyingStencils - GetNumStencils Allocate varying primvar buffer 1 stencil for each vertex std vector Vertex varyingBuffer varyingStencils - GetNumStencils Use per-vertex array of RGB colors as varying primvar data Vertex varyingCVs reinterpret_cast Vertex g_colors delete refiner Apply stencils in frame loop This section would be applied every frame after control vertices have been moved. Apply stencils on the control vertex data to update the primvar data of the refined vertices. vertexStencils - UpdateValues vertexCVs , vertexBuffer 0 varyingStencils - UpdateValues varyingCVs , varyingBuffer 0 Visualization with Maya print a MEL script that generates particles at the location of the refined vertices printf particle for int vert 0 vert int nverts vert float const pos vertexBuffer vert . GetData printf -p f f f n , pos 0 , pos 1 , pos 2 printf -c 1 n Set particle point size 20 -- very large printf addAttr -is true -ln pointSize -at long -dv 20 particleShape1 n Add per-particle color attribute rgbPP printf addAttr -ln rgbPP -dt vectorArray particleShape1 n Set per-particle color values from our varying primvar data printf setAttr particleShape1.rgbPP -type vectorArray d , nverts for int vert 0 vert nverts vert float const color varyingBuffer vert . GetData printf f f f n , color 0 , color 1 , color 2 printf n delete vertexStencils delete varyingStencils return EXIT_SUCCESS ------------------------------------------------------------------------------ static Far TopologyRefiner createTopologyRefiner Populate a topology descriptor with our raw data. typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor. Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options return refiner ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"far_tutorial_2_2.html\"\n+ \"loc\": \"far_tutorial_4_2.html\"\n }, {\n \"title\": \"far_tutorial_4_1.cpp\",\n \"text\": \"far_tutorial_4_1.cpp far_tutorial_4_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_4_1far_tutorial_4_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to create and manipulate FarStencilTable. We use the factorized stencils to interpolate vertex primvar data buffers. include opensubdivfartopologyDescriptor.h include opensubdivfarstencilTable.h include opensubdivfarstencilTableFactory.h include cstdio include cstring ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z float const GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 24 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner createTopologyRefiner ------------------------------------------------------------------------------ int main int , char Generate a FarTopologyRefiner see tutorial_1_1 for details. Far TopologyRefiner refiner createTopologyRefiner Uniformly refine the topology up to maxlevel. int maxlevel 3 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Use the FarStencilTable factory to create discrete stencil table note we only want stencils for the highest refinement level. Far StencilTableFactory Options options options . generateIntermediateLevels false options . generateOffsets true Far StencilTable const stencilTable Far StencilTableFactory Create refiner , options Allocate vertex primvar buffer 1 stencil for each vertex int nstencils stencilTable - GetNumStencils std vector Vertex vertexBuffer nstencils Quick dirty re-cast of the primvar data from our cube this is where you would drive shape deformations every frame Vertex controlValues reinterpret_cast Vertex g_verts This section would be applied every frame after control vertices have been moved. Apply stencils on the control vertex data to update the primvar data of the refined vertices. stencilTable - UpdateValues controlValues , vertexBuffer 0 Visualization with Maya print a MEL script that generates particles at the location of the refined vertices printf particle for int i 0 i int vertexBuffer . size i float const pos vertexBuffer i . GetPosition printf -p f f f n , pos 0 , pos 1 , pos 2 printf -c 1 n delete refiner delete stencilTable return EXIT_SUCCESS ------------------------------------------------------------------------------ static Far TopologyRefiner createTopologyRefiner Populate a topology descriptor with our raw data. typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor. return Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_4_1.html\"\n }, {\n \"title\": \"far_tutorial_2_3.cpp\",\n@@ -101,134 +96,139 @@\n \"loc\": \"far_tutorial_2_1.html\"\n }, {\n \"title\": \"far_tutorial_1_2.cpp\",\n \"text\": \"far_tutorial_1_2.cpp far_tutorial_1_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_1_2far_tutorial_1_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial illustrates two different styles of defining classes for interpolating primvar data with the template methods in Far. The most common usage involves data of a fixed size, so the focus here is on an alternative supporting variable length data. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio using namespace OpenSubdiv Vertex data containers for interpolation - Coord3 is fixed to support 3 floats - Coord2 is fixed to support 2 floats - CoordBuffer can support a specified number of floats struct Coord3 Coord3 Coord3 float x , float y , float z _xyz 0 x , _xyz 1 y , _xyz 2 z void Clear _xyz 0 _xyz 1 _xyz 2 0.0f void AddWithWeight Coord3 const src , float weight _xyz 0 weight src . _xyz 0 _xyz 1 weight src . _xyz 1 _xyz 2 weight src . _xyz 2 float const Coords const return _xyz 0 private float _xyz 3 struct Coord2 Coord2 Coord2 float u , float v _uv 0 u , _uv 1 v void Clear _uv 0 _uv 1 0.0f void AddWithWeight Coord2 const src , float weight _uv 0 weight src . _uv 0 _uv 1 weight src . _uv 1 float const Coords const return _uv 0 private float _uv 2 struct CoordBuffer The head of an external buffer and stride is specified on construction CoordBuffer float data , int size _data data , _size size CoordBuffer _data 0 , _size 0 void Clear for int i 0 i _size i _data i 0.0f void AddWithWeight CoordBuffer const src , float weight assert src . _size _size for int i 0 i _size i _data i weight src . _data i float const Coords const return _data Defining to return a location elsewhere in the buffer is the key requirement to supporting interpolatible data of varying size CoordBuffer operator int index const return CoordBuffer _data index _size , _size private float _data int _size Global cube geometry from catmark_cube.h Topology static int g_nverts 8 static int g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 Primvar data static float g_verts 8 3 0.0f , 0.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 1.0f , 1.0f , 0.0f , 0.0f , 0.0f , 0.0f , 1.0f , 0.0f , 0.0f Creates FarTopologyRefiner from raw geometry above see tutorial_1_1 for more details static Far TopologyRefiner createFarTopologyRefiner typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options return refiner Overview of main - create a FarTopologyRefiner and uniformly refine it - allocate separate and combined data buffers for vertex positions and UVs - populate all refined data buffers and compare results - write the result in Obj format Disable warnings for exact floating point comparisons ifdef __INTEL_COMPILER pragma warning disable 1572 endif int main int , char Instantiate a FarTopologyRefiner from the global geometry Far TopologyRefiner refiner createFarTopologyRefiner Uniformly refine the topology up to maxlevel int maxlevel 2 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Allocate and populate data buffers for vertex primvar data -- positions and UVs. We assign UV coordiantes by simply projectingassigning XY values. The position and UV buffers use their associated data types, while the combined buffer uses 5 floats per vertex. int numBaseVertices g_nverts int numTotalVertices refiner - GetNumVerticesTotal std vector Coord3 posData numTotalVertices std vector Coord2 uvData numTotalVertices int combinedStride 3 2 std vector float combinedData numTotalVertices combinedStride for int i 0 i numBaseVertices i posData i Coord3 g_verts i 0 , g_verts i 1 , g_verts i 2 uvData i Coord2 g_verts i 0 , g_verts i 1 float coordCombined combinedData i combinedStride coordCombined 0 g_verts i 0 coordCombined 1 g_verts i 1 coordCombined 2 g_verts i 2 coordCombined 3 g_verts i 0 coordCombined 4 g_verts i 1 Interpolate vertex primvar data Far PrimvarRefiner primvarRefiner refiner Coord3 posSrc posData 0 Coord2 uvSrc uvData 0 CoordBuffer combinedSrc combinedData 0 , combinedStride for int level 1 level maxlevel level int numLevelVerts refiner - GetLevel level -1 . GetNumVertices Coord3 posDst posSrc numLevelVerts Coord2 uvDst uvSrc numLevelVerts CoordBuffer combinedDst combinedSrc numLevelVerts primvarRefiner . Interpolate level , posSrc , posDst primvarRefiner . Interpolate level , uvSrc , uvDst primvarRefiner . Interpolate level , combinedSrc , combinedDst posSrc posDst uvSrc uvDst combinedSrc combinedDst Verify that the combined coords match the separate results for int i numBaseVertices i numTotalVertices i float const posCoords posData i . Coords float const uvCoords uvData i . Coords float const combCoords combinedData combinedStride i assert combCoords 0 posCoords 0 assert combCoords 1 posCoords 1 assert combCoords 2 posCoords 2 assert combCoords 3 uvCoords 0 assert combCoords 4 uvCoords 1 Output OBJ of the highest level refined Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int firstOfLastVerts numTotalVertices - refLastLevel . GetNumVertices Print vertex positions printf Vertices n for int vert firstOfLastVerts vert numTotalVertices vert float const pos combinedData vert combinedStride printf v f f f n , pos 0 , pos 1 , pos 2 printf UV coordinates n for int vert firstOfLastVerts vert numTotalVertices vert float const uv combinedData vert combinedStride 3 printf vt f f n , uv 0 , uv 1 Print faces int numFaces refLastLevel . GetNumFaces printf Faces n for int face 0 face numFaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face printf f for int fvert 0 fvert fverts . size fvert int objIndex 1 fverts fvert OBJ uses 1-based arrays... printf dd , objIndex , objIndex printf n delete refiner return EXIT_SUCCESS Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_1_2.html\"\n }, {\n+ \"title\": \"far_tutorial_2_2.cpp\",\n+ \"text\": \"far_tutorial_2_2.cpp far_tutorial_2_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_2_2far_tutorial_2_2.cpp ------------------------------------------------------------------------------ Tutorial description Building on tutorial 0, this example shows how to instantiate a simple mesh, refine it uniformly and then interpolate both vertex and face-varying primvar data. The resulting interpolated data is output as an obj file, with the face-varying data recorded in the uv texture layout. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ Face-varying implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ Face-varying container implementation. We are using a uv texture layout as a face-varying primitive variable attribute. Because face-varying data is specified per-face-per-vertex, we cannot use the same container that we use for vertex or varying data. We specify a new container, which only carries u,v coordinates. Similarly to our Vertex container, we add a minimalistic interpolation interface with a Clear and AddWithWeight methods. struct FVarVertexUV Minimal required interface ---------------------- void Clear u v 0.0f void AddWithWeight FVarVertexUV const src , float weight u weight src . u v weight src . v Basic uv layout channel float u , v struct FVarVertexColor Minimal required interface ---------------------- void Clear r g b a 0.0f void AddWithWeight FVarVertexColor const src , float weight r weight src . r g weight src . g b weight src . b a weight src . a Basic color layout channel float r , g , b , a ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h vertex primitive variable data topology static float g_verts 8 3 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 face-varying primitive variable data topology for UVs static float g_uvs 14 2 0.375 , 0.00 , 0.625 , 0.00 , 0.375 , 0.25 , 0.625 , 0.25 , 0.375 , 0.50 , 0.625 , 0.50 , 0.375 , 0.75 , 0.625 , 0.75 , 0.375 , 1.00 , 0.625 , 1.00 , 0.875 , 0.00 , 0.875 , 0.25 , 0.125 , 0.00 , 0.125 , 0.25 static int g_nuvs 14 static int g_uvIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 9 , 8 , 1 , 10 , 11 , 3 , 12 , 0 , 2 , 13 face-varying primitive variable data topology for color static float g_colors 24 4 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 static int g_ncolors 24 static int g_colorIndices 24 0 , 3 , 9 , 6 , 7 , 10 , 15 , 12 , 13 , 16 , 21 , 18 , 19 , 22 , 4 , 1 , 5 , 23 , 17 , 11 , 20 , 2 , 8 , 14 using namespace OpenSubdiv ------------------------------------------------------------------------------ int main int , char int maxlevel 3 typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY options . SetFVarLinearInterpolation Sdc Options FVAR_LINEAR_NONE Populate a topology descriptor with our raw data Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices int channelUV 0 int channelColor 1 Create a face-varying channel descriptor Descriptor FVarChannel channels 2 channels channelUV . numValues g_nuvs channels channelUV . valueIndices g_uvIndices channels channelColor . numValues g_ncolors channels channelColor . valueIndices g_colorIndices Add the channel topology to the main descriptor desc . numFVarChannels 2 desc . fvarChannels channels Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options Uniformly refine the topology up to maxlevel note fullTopologyInLastLevel must be true to work with face-varying data Far TopologyRefiner UniformOptions refineOptions maxlevel refineOptions . fullTopologyInLastLevel true refiner - RefineUniform refineOptions Allocate and initialize the vertex primvar data see tutorial 2 for more details. std vector Vertex vbuffer refiner - GetNumVerticesTotal Vertex verts vbuffer 0 for int i 0 i g_nverts i verts i . SetPosition g_verts i 0 , g_verts i 1 , g_verts i 2 Allocate and initialize the first channel of face-varying primvar data UVs std vector FVarVertexUV fvBufferUV refiner - GetNumFVarValuesTotal channelUV FVarVertexUV fvVertsUV fvBufferUV 0 for int i 0 i g_nuvs i fvVertsUV i . u g_uvs i 0 fvVertsUV i . v g_uvs i 1 Allocate interpolate the face-varying primvar data colors std vector FVarVertexColor fvBufferColor refiner - GetNumFVarValuesTotal channelColor FVarVertexColor fvVertsColor fvBufferColor 0 for int i 0 i g_ncolors i fvVertsColor i . r g_colors i 0 fvVertsColor i . g g_colors i 1 fvVertsColor i . b g_colors i 2 fvVertsColor i . a g_colors i 3 Interpolate both vertex and face-varying primvar data Far PrimvarRefiner primvarRefiner refiner Vertex srcVert verts FVarVertexUV srcFVarUV fvVertsUV FVarVertexColor srcFVarColor fvVertsColor for int level 1 level maxlevel level Vertex dstVert srcVert refiner - GetLevel level -1 . GetNumVertices FVarVertexUV dstFVarUV srcFVarUV refiner - GetLevel level -1 . GetNumFVarValues channelUV FVarVertexColor dstFVarColor srcFVarColor refiner - GetLevel level -1 . GetNumFVarValues channelColor primvarRefiner . Interpolate level , srcVert , dstVert primvarRefiner . InterpolateFaceVarying level , srcFVarUV , dstFVarUV , channelUV primvarRefiner . InterpolateFaceVarying level , srcFVarColor , dstFVarColor , channelColor srcVert dstVert srcFVarUV dstFVarUV srcFVarColor dstFVarColor Output OBJ of the highest level refined ----------- Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int nverts refLastLevel . GetNumVertices int nuvs refLastLevel . GetNumFVarValues channelUV int ncolors refLastLevel . GetNumFVarValues channelColor int nfaces refLastLevel . GetNumFaces Print vertex positions int firstOfLastVerts refiner - GetNumVerticesTotal - nverts for int vert 0 vert nverts vert float const pos verts firstOfLastVerts vert . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print uvs int firstOfLastUvs refiner - GetNumFVarValuesTotal channelUV - nuvs for int fvvert 0 fvvert nuvs fvvert FVarVertexUV const uv fvVertsUV firstOfLastUvs fvvert printf vt f f n , uv . u , uv . v Print colors int firstOfLastColors refiner - GetNumFVarValuesTotal channelColor - ncolors for int fvvert 0 fvvert ncolors fvvert FVarVertexColor const c fvVertsColor firstOfLastColors fvvert printf c f f f f n , c . r , c . g , c . b , c . a Print faces for int face 0 face nfaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face Far ConstIndexArray fuvs refLastLevel . GetFaceFVarValues face , channelUV all refined Catmark faces should be quads assert fverts . size 4 fuvs . size 4 printf f for int vert 0 vert fverts . size vert OBJ uses 1-based arrays... printf dd , fverts vert 1 , fuvs vert 1 printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"far_tutorial_2_2.html\"\n+ }, {\n \"title\": \"far_tutorial_1_1.cpp\",\n \"text\": \"far_tutorial_1_1.cpp far_tutorial_1_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_1_1far_tutorial_1_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial presents in a very succinct way the requisite steps to instantiate and refine a mesh with Far from simple topological data. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 8 3 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv ------------------------------------------------------------------------------ int main int , char Populate a topology descriptor with our raw data typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options int maxlevel 2 Uniformly refine the topology up to maxlevel refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Allocate a buffer for vertex primvar data. The buffer length is set to be the sum of all children vertices up to the highest level of refinement. std vector Vertex vbuffer refiner - GetNumVerticesTotal Vertex verts vbuffer 0 Initialize coarse mesh positions int nCoarseVerts g_nverts for int i 0 i nCoarseVerts i verts i . SetPosition g_verts i 0 , g_verts i 1 , g_verts i 2 Interpolate vertex primvar data Far PrimvarRefiner primvarRefiner refiner Vertex src verts for int level 1 level maxlevel level Vertex dst src refiner - GetLevel level -1 . GetNumVertices primvarRefiner . Interpolate level , src , dst src dst Output OBJ of the highest level refined ----------- Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int nverts refLastLevel . GetNumVertices int nfaces refLastLevel . GetNumFaces Print vertex positions int firstOfLastVerts refiner - GetNumVerticesTotal - nverts for int vert 0 vert nverts vert float const pos verts firstOfLastVerts vert . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print faces for int face 0 face nfaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face all refined Catmark faces should be quads assert fverts . size 4 printf f for int vert 0 vert fverts . size vert printf d , fverts vert 1 OBJ uses 1-based arrays... printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_1_1.html\"\n }, {\n- \"title\": \"hbr_tutorial_0.cpp\",\n- \"text\": \"hbr_tutorial_0.cpp hbr_tutorial_0.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialshbrtutorial_0hbr_tutorial_0.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial presents in a very succinct way the requisite steps to instantiate an Hbr mesh from simple topological data. include opensubdivhbrmesh.h include opensubdivhbrcatmark.h include cstdio ------------------------------------------------------------------------------ Vertex container implementation. The HbrMeshT class is a templated interface that expects a vertex class to perform interpolation on arbitrary vertex data. For the template specialization of the HbrMesh interface to be met, our Vertex object to implement a minimal set of constructors and member functions. Since we are not going to subdivide the mesh, the struct presented here has been left minimalistic. The only customization added to our container was to provide storage and accessors for the position of a 3D vertex. struct Vertex Hbr minimal required interface ---------------------- Vertex Vertex int i Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 void AddWithWeight Vertex const , float void AddVaryingWithWeight Vertex const , float Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 typedef OpenSubdiv HbrMesh Vertex Hmesh typedef OpenSubdiv HbrFace Vertex Hface typedef OpenSubdiv HbrVertex Vertex Hvertex typedef OpenSubdiv HbrHalfedge Vertex Hhalfedge ------------------------------------------------------------------------------ Pyramid geometry from catmark_pyramid.h static float verts 5 3 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 2.0f , 0.0f , 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 0.0f static int nverts 5 , nfaces 5 static int facenverts 5 3 , 3 , 3 , 3 , 4 static int faceverts 16 0 , 1 , 2 , 0 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 4 , 3 , 2 , 1 ------------------------------------------------------------------------------ int main int , char Create a subdivision scheme Catmull-Clark here OpenSubdiv HbrCatmarkSubdivision Vertex catmark new OpenSubdiv HbrCatmarkSubdivision Vertex Create an empty Hbr mesh Hmesh hmesh new Hmesh catmark Populate the vertices Vertex v for int i 0 i nverts i Primitive variable data must be set here in our case we set the 3D position of the vertex. v . SetPosition verts i 0 , verts i 1 , verts i 2 Add the vertex to the mesh. hmesh - NewVertex i , v Create the topology int fv faceverts for int i 0 i nfaces i int nv facenverts i hmesh - NewFace nv , fv , 0 fv nv Set subdivision options By default vertex interpolation is set to none on boundaries, which can produce un-expected results, so we change it to edge-only. hmesh - SetInterpolateBoundaryMethod Hmesh k_InterpolateBoundaryEdgeOnly Call Finish to finalize the data structures before using the mesh. hmesh - Finish printf Created a pyramid with d faces and d vertices. n , hmesh - GetNumFaces , hmesh - GetNumVertices delete hmesh delete catmark ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"hbr_tutorial_2.cpp\",\n+ \"text\": \"hbr_tutorial_2.cpp hbr_tutorial_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialshbrtutorial_2hbr_tutorial_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to subdivide uniformly a simple Hbr mesh. We are building upon previous tutorials and assuming a fully instantiated mesh we start with an HbrMesh pointer initialized from the same pyramid shape used in hbr_tutorial_0. We then apply the Refine function sequentially to all the faces in the mesh to generate several levels of uniform subdivision. The resulting data is then dumped to the terminal in Wavefront OBJ format for inspection. include opensubdivhbrmesh.h include opensubdivhbrcatmark.h include cassert include cstdio ------------------------------------------------------------------------------ For this tutorial, we have to flesh out the Vertex class further. Note that now the copy constructor, Clear and AddwithWeight methods have been implemented to interpolate our float3 position data. This vertex specialization pattern leaves client-code free to implement arbitrary vertex primvar data schemes or none at all to conserve efficiency struct Vertex Hbr minimal required interface ---------------------- Vertex Vertex int i Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 void AddVaryingWithWeight Vertex const , float Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 typedef OpenSubdiv HbrMesh Vertex Hmesh typedef OpenSubdiv HbrFace Vertex Hface typedef OpenSubdiv HbrVertex Vertex Hvertex typedef OpenSubdiv HbrHalfedge Vertex Hhalfedge Hmesh createMesh ------------------------------------------------------------------------------ int main int , char Hmesh hmesh createMesh int maxlevel 2 , 2 levels of subdivision firstface 0 , marker to the first face index of level 2 firstvertex 0 marker to the first vertex index of level 2 Refine the mesh to maxlevel for int level 0 level maxlevel level Total number of faces in the mesh, across all levels Note this function iterates over the list of faces and can be slow int nfaces hmesh - GetNumFaces if level maxlevel -1 Save our vertex marker firstvertex hmesh - GetNumVertices Iterate over the faces of the current level of subdivision for int face firstface face nfaces face Hface f hmesh - GetFace face Note hole tags would have to be dealt with here. f - Refine Save our face index marker for the next level firstface nfaces Output OBJ of the highest level refined ----------- Print vertex positions int nverts hmesh - GetNumVertices for int vert firstvertex vert nverts vert float const pos hmesh - GetVertex vert - GetData . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print faces for int face firstface face hmesh - GetNumFaces face Hface f hmesh - GetFace face assert f - GetNumVertices 4 printf f for int vert 0 vert 4 vert OBJ uses 1-based arrays printf d , f - GetVertex vert - GetID - firstvertex 1 printf n ------------------------------------------------------------------------------ Creates an Hbr mesh see hbr_tutorial_0 and hbr_tutorial_1 for more details Hmesh createMesh Pyramid geometry from catmark_pyramid.h static float verts 5 3 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 2.0f , 0.0f , 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 0.0f static int nverts 5 , nfaces 5 static int facenverts 5 3 , 3 , 3 , 3 , 4 static int faceverts 16 0 , 1 , 2 , 0 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 4 , 3 , 2 , 1 OpenSubdiv HbrCatmarkSubdivision Vertex catmark new OpenSubdiv HbrCatmarkSubdivision Vertex Hmesh hmesh new Hmesh catmark Populate the vertices Vertex v for int i 0 i nverts i v . SetPosition verts i 0 , verts i 1 , verts i 2 hmesh - NewVertex i , v Create the topology int fv faceverts for int i 0 i nfaces i int nv facenverts i bool valid true for int j 0 j nv j Hvertex const origin hmesh - GetVertex fv j , destination hmesh - GetVertex fv j 1 nv Hhalfedge const opposite destination - GetEdge origin Make sure that the vertices exist in the mesh if origin NULL destination NULL printf An edge was specified that connected a nonexistent vertex n valid false break Check for a degenerate edge if origin destination printf An edge was specified that connected a vertex to itself n valid false break Check that no more than 2 faces are adjacent to the edge if opposite opposite - GetOpposite printf A non-manifold edge incident to more than 2 faces was found n valid false break Check that the edge is unique and oriented properly if origin - GetEdge destination printf An edge connecting two vertices was specified more than once. Its likely that an incident face was flipped n valid false break if valid hmesh - NewFace nv , fv , 0 else printf Skipped face d n , i fv nv hmesh - SetInterpolateBoundaryMethod Hmesh k_InterpolateBoundaryEdgeOnly hmesh - Finish return hmesh ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"hbr_tutorial_0.html\"\n+ \"loc\": \"hbr_tutorial_2.html\"\n }, {\n \"title\": \"hbr_tutorial_1.cpp\",\n \"text\": \"hbr_tutorial_1.cpp hbr_tutorial_1.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialshbrtutorial_1hbr_tutorial_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to safely create Hbr meshes from arbitrary topology. Because Hbr is a half-edge data structure, it cannot represent non-manifold topology. Ensuring that the geometry used is manifold is a requirement to use Hbr safely. This tutorial presents some simple tests to detect inappropriate topology. include opensubdivhbrmesh.h include opensubdivhbrcatmark.h include cstdio ------------------------------------------------------------------------------ struct Vertex Hbr minimal required interface ---------------------- Vertex Vertex int i Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 void AddWithWeight Vertex const , float void AddVaryingWithWeight Vertex const , float Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 typedef OpenSubdiv HbrMesh Vertex Hmesh typedef OpenSubdiv HbrFace Vertex Hface typedef OpenSubdiv HbrVertex Vertex Hvertex typedef OpenSubdiv HbrHalfedge Vertex Hhalfedge ------------------------------------------------------------------------------ Non-manifold geometry from catmark_fan.h o o f2 o------------o------------o f0 f1 o------------ o------------o The shared edge of a fan is adjacent to 3 faces, and therefore non-manifold. static float verts 8 3 -1.0 , 0.0 , -1.0 , -1.0 , 0.0 , 0.0 , 0.0 , 0.0 , 0.0 , 0.0 , 0.0 , -1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 0.0 , -1.0 , 0.0 , 1.0 , 0.0 , 0.0 , 1.0 , -1.0 static int nverts 8 , nfaces 3 static int facenverts 3 4 , 4 , 4 static int faceverts 12 0 , 1 , 2 , 3 , 3 , 2 , 4 , 5 , 3 , 2 , 6 , 7 ------------------------------------------------------------------------------ int main int , char OpenSubdiv HbrCatmarkSubdivision Vertex catmark new OpenSubdiv HbrCatmarkSubdivision Vertex Hmesh hmesh new Hmesh catmark Vertex v for int i 0 i nverts i v . SetPosition verts i 0 , verts i 1 , verts i 2 hmesh - NewVertex i , v Create the topology int fv faceverts for int i 0 i nfaces i int nv facenverts i bool valid true for int j 0 j nv j Hvertex const origin hmesh - GetVertex fv j , destination hmesh - GetVertex fv j 1 nv Hhalfedge const opposite destination - GetEdge origin Make sure that the vertices exist in the mesh if origin NULL destination NULL printf An edge was specified that connected a nonexistent vertex n valid false break Check for a degenerate edge if origin destination printf An edge was specified that connected a vertex to itself n valid false break Check that no more than 2 faces are adjacent to the edge if opposite opposite - GetOpposite printf A non-manifold edge incident to more than 2 faces was found n valid false break Check that the edge is unique and oriented properly if origin - GetEdge destination printf An edge connecting two vertices was specified more than once. Its likely that an incident face was flipped n valid false break if valid hmesh - NewFace nv , fv , 0 else printf Skipped face d n , i fv nv hmesh - SetInterpolateBoundaryMethod Hmesh k_InterpolateBoundaryEdgeOnly hmesh - Finish printf Created a fan with d faces and d vertices. n , hmesh - GetNumFaces , hmesh - GetNumVertices delete hmesh delete catmark ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"hbr_tutorial_1.html\"\n }, {\n- \"title\": \"hbr_tutorial_2.cpp\",\n- \"text\": \"hbr_tutorial_2.cpp hbr_tutorial_2.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialshbrtutorial_2hbr_tutorial_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to subdivide uniformly a simple Hbr mesh. We are building upon previous tutorials and assuming a fully instantiated mesh we start with an HbrMesh pointer initialized from the same pyramid shape used in hbr_tutorial_0. We then apply the Refine function sequentially to all the faces in the mesh to generate several levels of uniform subdivision. The resulting data is then dumped to the terminal in Wavefront OBJ format for inspection. include opensubdivhbrmesh.h include opensubdivhbrcatmark.h include cassert include cstdio ------------------------------------------------------------------------------ For this tutorial, we have to flesh out the Vertex class further. Note that now the copy constructor, Clear and AddwithWeight methods have been implemented to interpolate our float3 position data. This vertex specialization pattern leaves client-code free to implement arbitrary vertex primvar data schemes or none at all to conserve efficiency struct Vertex Hbr minimal required interface ---------------------- Vertex Vertex int i Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 void AddVaryingWithWeight Vertex const , float Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 typedef OpenSubdiv HbrMesh Vertex Hmesh typedef OpenSubdiv HbrFace Vertex Hface typedef OpenSubdiv HbrVertex Vertex Hvertex typedef OpenSubdiv HbrHalfedge Vertex Hhalfedge Hmesh createMesh ------------------------------------------------------------------------------ int main int , char Hmesh hmesh createMesh int maxlevel 2 , 2 levels of subdivision firstface 0 , marker to the first face index of level 2 firstvertex 0 marker to the first vertex index of level 2 Refine the mesh to maxlevel for int level 0 level maxlevel level Total number of faces in the mesh, across all levels Note this function iterates over the list of faces and can be slow int nfaces hmesh - GetNumFaces if level maxlevel -1 Save our vertex marker firstvertex hmesh - GetNumVertices Iterate over the faces of the current level of subdivision for int face firstface face nfaces face Hface f hmesh - GetFace face Note hole tags would have to be dealt with here. f - Refine Save our face index marker for the next level firstface nfaces Output OBJ of the highest level refined ----------- Print vertex positions int nverts hmesh - GetNumVertices for int vert firstvertex vert nverts vert float const pos hmesh - GetVertex vert - GetData . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print faces for int face firstface face hmesh - GetNumFaces face Hface f hmesh - GetFace face assert f - GetNumVertices 4 printf f for int vert 0 vert 4 vert OBJ uses 1-based arrays printf d , f - GetVertex vert - GetID - firstvertex 1 printf n ------------------------------------------------------------------------------ Creates an Hbr mesh see hbr_tutorial_0 and hbr_tutorial_1 for more details Hmesh createMesh Pyramid geometry from catmark_pyramid.h static float verts 5 3 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 2.0f , 0.0f , 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 0.0f static int nverts 5 , nfaces 5 static int facenverts 5 3 , 3 , 3 , 3 , 4 static int faceverts 16 0 , 1 , 2 , 0 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 4 , 3 , 2 , 1 OpenSubdiv HbrCatmarkSubdivision Vertex catmark new OpenSubdiv HbrCatmarkSubdivision Vertex Hmesh hmesh new Hmesh catmark Populate the vertices Vertex v for int i 0 i nverts i v . SetPosition verts i 0 , verts i 1 , verts i 2 hmesh - NewVertex i , v Create the topology int fv faceverts for int i 0 i nfaces i int nv facenverts i bool valid true for int j 0 j nv j Hvertex const origin hmesh - GetVertex fv j , destination hmesh - GetVertex fv j 1 nv Hhalfedge const opposite destination - GetEdge origin Make sure that the vertices exist in the mesh if origin NULL destination NULL printf An edge was specified that connected a nonexistent vertex n valid false break Check for a degenerate edge if origin destination printf An edge was specified that connected a vertex to itself n valid false break Check that no more than 2 faces are adjacent to the edge if opposite opposite - GetOpposite printf A non-manifold edge incident to more than 2 faces was found n valid false break Check that the edge is unique and oriented properly if origin - GetEdge destination printf An edge connecting two vertices was specified more than once. Its likely that an incident face was flipped n valid false break if valid hmesh - NewFace nv , fv , 0 else printf Skipped face d n , i fv nv hmesh - SetInterpolateBoundaryMethod Hmesh k_InterpolateBoundaryEdgeOnly hmesh - Finish return hmesh ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"Using Hbr\",\n+ \"text\": \"Using Hbr Using Hbr 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Vertex Template API Creating a Mesh Instantiating an HbrMesh Creating Vertices Creating Faces Wrapping Things Up Boundary Interpolation Rules Adding Creases Vertex Creases Edge Creases Holes Hierarchical Edits Face-varying Data Instantiating the HbrMesh Setting the Face-Varying Data Retrieving the Face-Varying Data Valence Operators Managing Singular Vertices Note As of OpenSubdiv 3.0, all Hbr dependencies have been removed from the core APIs Sdc , Vtr , Far , Osd . The legacy source code of Hbr is provided purely for regression and legacy purposes. If your code is currently depending on Hbr functionality, we recommend migrating to the newer APIs as we cannot guarantee that this code will be maintained in future releases. For more information see the 3.0 release notes Vertex Template API The Hbr API abstracts the vertex class through templating. Client-code is expected to provide a vertex class that implements the requisite interpolation functionality. Here is an example of a simple vertex class that accounts for 3D position, but does not support arbitrary variables or varying interpolation. struct Vertex Vertex Vertex int i Vertex const Vertex src _pos 0 src . _pos 0 _pos 1 src . _pos 1 _pos 2 src . _pos 2 Vertex void AddWithWeight const Vertex src , float weight , void 0 _pos 0 weight src . _pos 0 _pos 1 weight src . _pos 1 _pos 2 weight src . _pos 2 void AddVaryingWithWeight const Vertex , float , void 0 void Clear void 0 _pos 0 _pos 1 _pos 2 0.0f void SetPosition float x , float y , float z _pos 0 x _pos 1 y _pos 2 z void ApplyVertexEdit const OpenSubdiv HbrVertexEdit Vertex edit const float src edit . GetEdit switch edit . GetOperation case OpenSubdiv HbrHierarchicalEdit Vertex Set _pos 0 src 0 _pos 1 src 1 _pos 2 src 2 break case OpenSubdiv HbrHierarchicalEdit Vertex Add _pos 0 src 0 _pos 1 src 1 _pos 2 src 2 break case OpenSubdiv HbrHierarchicalEdit Vertex Subtract _pos 0 - src 0 _pos 1 - src 1 _pos 2 - src 2 break void ApplyMovingVertexEdit const OpenSubdiv HbrMovingVertexEdit Vertex custom functions data not required by Hbr ------------------------- Vertex float x , float y , float z _pos 0 x _pos 1 y _pos 2 z const float GetPos const return _pos float _pos 3 In some cases, if only topological analysis is required, the class can be left un-implemented. Far and Osd for instance store vertex data in serialized interleaved vectors. Here is the OsdVertex class for reference class Vertex public Vertex Vertex int index Vertex Vertex const src void AddWithWeight Vertex const i , float weight , void 0 void AddVaryingWithWeight const Vertex i , float weight , void 0 void Clear void 0 void ApplyVertexEdit FarVertexEdit const Creating a Mesh The following tutorial walks through the steps of instantiating a simple Hbr mesh. The code found in regressioncommonshape_utils.h can also be used as an example. While this implementation covers many of Hbr s features, it does not provide coverage for the complete Renderman specification though. Instantiating an HbrMesh First we need to instantiate a mesh object. Hbr supports 3 subdivision schemes Catmull-Clark catmark Loop Bilinear The scheme is selected by passing an specialized instance of HbrSubdivisionT , HbrCatmarkSubdivisionT in this case. The scheme can be shared across multiple mesh objects, so we only need a single instance. static OpenSubdiv HbrCatmarkSubdivision Vertex _scheme OpenSubdiv HbrMesh Vertex mesh new OpenSubdiv HbrMesh Vertex _scheme Creating Vertices Adding vertices to the mesh is accomplished using the HbrMeshNewVertex method. Because Hbr uses a dedicated vertex allocator to help alleviate the performance impact of intensive fragmented memory allocations. This optimization results in the following design pattern Vertex vtx for int i 0 i numVerts i Vertex v mesh - NewVertex i , vtx v-SetPosition We instantiate a single default vertex object named vtx on the stack. We then recover the pointer to the actual vertex created in the mesh from the NewVertex method. Once we have recovered that pointer, we can set the data for our vertex by using any of the custom accessors. Creating Faces Once all the vertices have been registered in the mesh, we can start adding the faces with HbrMeshNewFace . Assuming we had an obj style reader, we need to know the number of vertices in the face and the indices of these vertices. for int f 0 f numFaces f int nverts obj - GetNumVertices f const int faceverts obj - GetFaceVerts f mesh - NewFace nv , fv , 0 However, Hbr is not able to handle non-manifold geometry. In order to avoid tripping asserts or causing memory violations, lets rewrite the previous loop with some some prototype code to check the validity of the topology. for int f 0 f numFaces f int nv obj - GetNumVertices f const int fv obj - GetFaceVerts f triangles only for Loop subdivision if scheme kLoop and nv 3 printf Trying to create a Loop subd with non-triangle face n continue now check the half-edges connectivity for int j 0 j nv j OpenSubdiv HbrVertex T origin mesh - GetVertex fv j OpenSubdiv HbrVertex T destination mesh - GetVertex fv j 1 nv OpenSubdiv HbrHalfedge T opposite destination - GetEdge origin if origin NULL destination NULL printf An edge was specified that connected a nonexistent vertex n continue if origin destination printf An edge was specified that connected a vertex to itself n continue if opposite opposite - GetOpposite printf A non-manifold edge incident to more than 2 faces was found n continue if origin - GetEdge destination printf An edge connecting two vertices was specified more than once. Its likely that an incident face was flipped n continue mesh - NewFace nv , fv , 0 Wrapping Things Up Once we have vertices and faces set in our mesh, we still need to wrap things up by calling HbrMeshFinish mesh - Finish Finish iterates over the mesh to apply the boundary interpolation rules and checks for singular vertices. At this point, there is one final topology check remaining to validate the mesh mesh - Finish if mesh - GetNumDisconnectedVertices printf The specified subdivmesh contains disconnected surface components. n abort or iterate over the mesh to remove the offending vertices Boundary Interpolation Rules The rule-set can be selected using the following accessors Vertex and varying data mesh - SetInterpolateBoundaryMethod OpenSubdiv HbrMesh Vertex k_InterpolateBoundaryEdgeOnly Face-varying data mesh - SetFVarInterpolateBoundaryMethod OpenSubdiv HbrMesh Vertex k_InterpolateBoundaryEdgeOnly Additional information on boundary interpolation rules can be found here Warning The boundary interpolation rules must be set before the call to HbrMeshFinish , which sets the sharpness values to boundary edges and vertices based on these rules. Adding Creases Hbr supports a sharpness attribute on both edges and vertices. Sharpness is set using the SetSharpnessfloat accessors. Vertex Creases Given an index, vertices are very easy to access in the mesh. int idx vertex index float sharp the edge sharpness OpenSubdiv HbrVertex Vertex v mesh - GetVertex idx if v v - SetSharpness std max 0.0f , sharp else printf cannot find vertex for corner tag d n , idx Edge Creases Usually, edge creases are described with a vertex indices pair. Here is some sample code to locate the matching half-edge and set a crease sharpness. int v0 , v1 vertex indices float sharp the edge sharpness OpenSubdiv HbrVertex Vertex v mesh - GetVertex v0 , w mesh - GetVertex v1 OpenSubdiv HbrHalfedge Vertex e 0 if v w if e v - GetEdge w 0 e w - GetEdge v if e e - SetSharpness std max 0.0f , sharp else printf cannot find edge for crease tag d,d n , v0 , v1 Holes Hbr faces support a hole tag. int idx the face index OpenSubdiv HbrFace Vertex f mesh - GetFace idx if f f - SetHole else printf cannot find face for hole tag d n , idx Note The hole tag is hierarchical sub-faces can also be marked as holes. See Hierarchical Edits Hierarchical Edits Hbr supports the following types of hierarchical edits Type Function Corner edits Modify vertex sharpness Crease edits Modify edge sharpness FaceEdit Modify custom face data FVarEdit Modify face-varying data VertexEdit Modify vertex and varying data HoleEdit Set hole tag Modifications are one of the following 3 operations Operation Set Add Subtract Here is a simple example that creates a hierarchical vertex edit. path 655, 2, 3, 0 int faceid 655 , nsubfaces 2 , subfaces 2 2 , 3 , vertexid 0 int offset 0 , offset to the vertex or varying data numElems 3 number of elements to apply the modifier to x,y,z 3 bool isP false shortcut to identify modifications to the vertex position P OpenSubdiv HbrHierarchicalEdit Vertex Operation op OpenSubdiv HbrHierarchicalEdit T Set float values 3 1.0f , 0.5f , 0.0f edit values OpenSubdiv HbrVertexEdit T edit new OpenSubdiv HbrVertexEdit T faceid , nsubfaces , subfaces , vertexid , offset , floatwidth , isP , op , values Face-varying Data Here is a walk-through of how to store face-varying data for a u,v pair. Unlike vertex and varying data which is accessed through the templated vertex API, face-varying data is directly aggregated as vectors of float data. Instantiating the HbrMesh The HbrMesh needs to retain some knowledge about the face-varying data that it carries in order to refine it correctly. int fvarwidth 2 total width of the fvar data static int indices 1 0 , 1 offset set to 0 widths 1 2 2 floats in a u,v pair int const fvarcount fvarwidth 0 1 0 , fvarindices fvarwidth 0 indices NULL , fvarwidths fvarwidth 0 widths NULL mesh new OpenSubdiv HbrMesh T _scheme , fvarcount , fvarindices , fvarwidths , fvarwidth Setting the Face-Varying Data After the topology has been created, Hbr is ready to accept face-varying data. Here is some sample code for int i 0 , idx 0 i numFaces i OpenSubdiv HbrFace Vertex f mesh - GetFace i int nv f - GetNumVertices note this is not the fastest way OpenSubdiv HbrHalfedge Vertex e f - GetFirstEdge for int j 0 j nv j , e e - GetNext OpenSubdiv HbrFVarData Vertex fvt e - GetOrgVertex - GetFVarData f float const fvdata GetFaceVaryingData i , j if not fvt . IsInitialized if no fvar daa exists yet on the vertex fvt . SetAllData 2 , fvdata else if not fvt . CompareAll 2 , fvdata if there already is fvar data and there is a boundary add the new data OpenSubdiv HbrFVarData T nfvt e - GetOrgVertex - NewFVarData f nfvt . SetAllData 2 , fvdata Retrieving the Face-Varying Data The HbrFVarData structures are expanded during the refinement process, with every sub-face being assigned a set of interpolated face-varying data. This data can be accessed in 2 ways From a face, passing a vertex index OpenSubdivHbrFaceVertex f OpenSubdiv HbrFVarData const fv f . GetFVarData vindex const float data fv . GetData From a vertex, passing a pointer to an incident face OpenSubdivHbrFaceVertex f OpenSubdiv HbrFVarData const fv myVertex . GetFVarData f const float data fv . GetData Valence Operators When manipulating meshes, it is often necessary to iterate over neighboring faces or vertices. Rather than gather lists of pointers and return them, Hbr exposes an operator pattern that guarantees consistent mesh traversals. The following example shows how to use an operator to count the number of neighboring vertices use HbrVertexGetValence for proper valence counts OpenSubdivHbrVertexVertex v class MyOperator public OpenSubdiv HbrVertexOperator Vertex public int count MyOperator count 0 virtual void operator OpenSubdiv HbrVertex Vertex v count MyOperator op v - ApplyOperatorSurroundingVertices op Managing Singular Vertices Certain topological configurations would force vertices to share multiple half-edge cycles. Because Hbr is a half-edge representation, these singular vertices have to be duplicated as part of the HbrMeshFinish phase of the instantiation. These duplicated vertices can cause problems for client-code that tries to populate buffers of vertex or varying data. The following sample code shows how to match the vertex data to singular vertex splits Populating an OsdCpuVertexBuffer with vertex data positions,... float const vtxData inMeshFn . getRawPoints returnStatus OpenSubdiv OsdCpuVertexBuffer vertexBuffer OpenSubdiv OsdCpuVertexBuffer Create numVertexElements , numFarVerts vertexBuffer - UpdateData vtxData , 0 , numVertices Duplicate the vertex data into the split singular vertices std vector std pair int , int const splits hbrMesh - GetSplitVertices for int i 0 i int splits . size i vertexBuffer - UpdateData vtxData splits i . second numVertexElements , splits i . first , 1 Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"hbr_tutorial_2.html\"\n+ \"loc\": \"using_osd_hbr.html\"\n }, {\n \"title\": \"Subdivision Surfaces\",\n \"text\": \"Subdivision Surfaces Subdivision Surfaces 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Overview Piecewise Parametric Surfaces Parametric Patches Piecewise Surfaces Arbitrary Topology Regular versus Irregular Features Non-manifold Topology Subdivision versus Tessellation Subdivision Tessellation Which to Use Mesh Data and Topology Separating Data from Topology Vertex and Varying Data Face-Varying Data and Topology Schemes and Options Subdivision Schemes Boundary Interpolation Rules Face-varying Interpolation Rules Semi-Sharp Creases Other Options Chaikin Rule Triangle Subdivision Rule Overview Subdivision surfaces are a common modeling primitive that has gained popularity in animation and visual effects over the past decades. As the name suggests, subdivision surfaces are fundamentally surfaces . More specifically, subdivision surfaces are piecewise parametric surfaces defined over meshes of arbitrary topology -- both concepts that will be described in the sections that follow. Subdivision is both an operation that can be applied to a polygonal mesh to refine it, and a mathematical tool that defines the underlying smooth surface to which repeated subdivision of the mesh converges. Explicit subdivision is simple to apply some number of times to provide a smoother mesh, and that simplicity has historically lead to many tools representing the shape this way. In contrast, deriving the smooth surface that ultimately defines the shape -- its limit surface -- is considerably more complex but provides greater accuracy and flexibility. These differences have led to confusion in how some tools expose subdivision surfaces. The ultimate goal is to have all tools use subdivision surfaces as true surface primitives. The focus here is therefore less on subdivision and more on the nature of the surface that results from it. In addition to providing a consistent implementation of subdivision -- one that includes a number of widely used feature extensions -- a significant value of OpenSubdiv is that it makes the limit surface more accessible. Since its introduction, OpenSubdiv has received interest from users and developers with a wide variety of skills, interests and backgrounds. This document is intended to present subdivision surfaces from a perspective helpful in making use of OpenSubdiv. One purpose it serves is to provide a high level overview for those with less experience with the algorithms or mathematics of subdivision. The other is to provide an overview of the feature set available with OpenSubdiv, and to introduce those capabilities with the terminology used by OpenSubdiv as much of it is overloaded. Piecewise Parametric Surfaces Piecewise parametric surfaces are arguably the most widely used geometric representation in industrial design, entertainment and many other areas. Many of the objects we deal with everyday -- cars, mobile phones, laptops -- were all designed and visualized first as piecewise parametric surfaces before those designs were approved and pursued. Piecewise parametric surfaces are ultimately just collections of simpler modeling primitives referred to as patches. Patches constitute the pieces of the larger surface in much the same way as a face or polygon constitutes a piece of a polygonal mesh. Parametric Patches Patches are the building blocks of piecewise smooth surfaces, and many different kinds of patches have evolved to meet the needs of geometric modeling. Two of the more effective and common patches are illustrated below Single bicubic B-Spline patch Single bicubic Bezier patch Patches consist of a set of points or vertices that affect a rectangular piece of smooth surface triangular patches also exist. That rectangle is parameterized in its two directions, transforming a simple 2D rectangle into the 3D surface u,v 2D domain of a patch Mapping from u,v to x,y,z The points that control the shape of the surface are usually referred to as control points or control vertices, and the collection of the entire set defining a patch as the control mesh, the control hull, the control cage or simply the hull, the cage, etc. For the sake of brevity we will frequently use the term cage, which serves us more generally later. So a patch essentially consist of two entities its control points and the surface affected by them. The way the control points affect the surface is what makes the different types of patches unique. Even patches defined by the same number of points can have different behavior. Note that all 16 points of the B-Spline patch above are relatively far from the surface they define compared to the similar Bezier patch. The two patches in that example actually represent exactly the same piece of surface -- each with a set of control points having different effects on it. In mathematical terms, each control point has a basis function associated with it that affects the surface in a particular way when only that point is moved Bicubic B-Spline basis function Bicubic Bezier basis funciton It is these basis functions that often give rise to the names of the different patches. There are pros and cons to these different properties of the control points of patches, which become more apparent as we assemble patches into piecewise surfaces. Piecewise Surfaces Piecewise parametric surfaces are collections of patches. For rectangular patches, one of the simplest ways to construct a collection is to define a set of patches using a rectangular grid of control points Piecewise B-Spline surface Piecewise Bezier surface Note that we can overlap the points of adjacent B-spline patches. This overlapping means that moving one control point affects multiple patches -- but it also ensures that those patches always meet smoothly this was a design intention and not true for other patch types. Adjacent Bezier patches only share points at their boundaries and coordinating the points across those boundaries to keep the surface smooth is possible, but awkward. This makes B-splines a more favorable surface representation for interactive modeling, but Bezier patches serve many other useful purposes. A more complicated B-spline surface Part of a more complicated B-Spline surface Just as a patch consisted of a cage and a surface, the same is now true of the collection. The control cage is manipulated by a designer and the surface of each of the patches involved is displayed so they can assess its effect. Arbitrary Topology Piecewise surfaces discussed thus far have been restricted to collections of patches over regular grids of control points. There is a certain simplicity with rectangular parametric surfaces that is appealing, but a surface representation that supports arbitrary topology has many other advantages. Rectangular parametric surfaces gained widespread adoption despite their topological limitations, and their popularity continues today in some areas. Complex objects often need many such surfaces to represent them and a variety of techniques have evolved to assemble them effectively, including stitching multiple surfaces together or cutting holes into them trimming. These are complicated techniques, and while effective in some contexts e.g. industrial design they become cumbersome in others e.g. animation and visual effects. A single polygonal mesh can represent shapes with far more complexity than a single rectangular piecewise surface, but its faceted nature eventually becomes a problem. Subdivision surfaces combine the topological flexibility of polygonal meshes with the underlying smoothness of piecewise parametric surfaces. Just as rectangular piecewise parametric surfaces have a collection of control points its cage stored as a grid and an underlying surface, subdivision surfaces also have a collection of control points its cage stored as a mesh and an underlying surface often referred as its limit surface. Regular versus Irregular Features A mesh contains the vertices and faces that form the cage for the underlying surface, and the topology of that mesh can be arbitrarily complex. In areas where the faces and vertices of the mesh are connected to form rectangular grids, the limit surface becomes one of the rectangular piecewise parametric surfaces previously mentioned. These regions of the mesh are said to be regular they provide behavior familiar from the use of similar rectangular surfaces and their limit surface is relatively simple to deal with. All other areas are considered irregular they provide the desired topological flexibility and so are less familiar and less predictable in some cases and their limit surface can be much more complicated. Irregular features come in a number of forms. The most widely referred to is an extra-ordinary vertex, i.e. a vertex which, in the case of a quad subdivision scheme like Catmull-Clark, does not have four incident faces. Irregular vertex and incident faces Regular and irregular regions of the surface The presence of these irregular features makes the limit surface around them similarly irregular, i.e. it cannot be represented as simply as it can for regular regions. Its worth noting that irregular regions shrink in size and become more isolated as subdivision is applied. A face with a lot of extra-ordinary vertices around it makes for a very complicated surface, and isolating these features is a way to help deal with that complexity Two valence-5 vertices nearby Isolation subdivided once Isolation subdivided twice Its generally necessary to perform some kind of local subdivision in these areas to break these pieces of surface into smaller, more manageable pieces, and the term feature adaptive subdivision has become popular in recent years to describe this process. Whether this is done explicitly or implicitly, globally or locally, what matters most is that there is an underlying piece of limit surface for each face -- albeit a potentially complicated one at an irregular feature -- that can be evaluated in much the same way as rectangular piecewise surfaces. Patches of the regular regions Patches of the irregular region While supporting a smooth surface in these irregular areas is the main advantage of subdivision surfaces, both the complexity of the resulting surfaces and their quality are reasons to use them with care. When the topology is largely irregular, there is a higher cost associated with its surface, so minimizing irregularities is advantageous. And in some cases the surface quality, i.e. the perceived smoothness, of the irregular surfaces can lead to undesirable artefacts. An arbitrary polygonal mesh will often not make a good subdivision cage, regardless of how good that polygonal mesh appears. As with rectangular piecewise parametric surfaces, the cage should be shaped to affect the underlying surface it is intended to represent. See Modeling Tips for related recommendations. Non-manifold Topology Since the cage of a subdivision surface is stored in a mesh, and often manipulated in the same context as polygonal meshes, the topic of manifold versus non-manifold topology warrants some attention. There are many definitions or descriptions of what distinguishes a manifold mesh from one that is not. These range from concise but abstract mathematical definitions to sets of examples showing manifold and non-manifold meshes -- all have their value and an appropriate audience. The following is not a strict definition but serves well to illustrate most local topological configurations that cause a mesh to be non-manifold. Consider standing on the faces of a mesh and walking around each vertex in turn. Assuming a right-hand winding order of faces, stand on the side of the face in the positive normal direction. And when walking, step across each incident edge in a counter-clockwise direction to the next incident face. For an interior vertex start at the corner of any incident face walk around the vertex across each incident edge to the next unvisited face repeat if you arrive back where you started and any incident faces or edges were not visited, the mesh is non-manifold Similarly, for a boundary vertex start at the corner of the face containing the leading boundary edge walk around the vertex across each incident edge to the next unvisited face repeat if you arrive at another boundary edge and any incident faces or edges were not visited, the mesh is non-manifold If you can walk around all vertices this way and dont encounter any non-manifold features, the mesh is likely manifold. Obviously if a vertex has no faces, there is nothing to walk around and this test cant succeed, so it is again non-manifold. All of the faces around a vertex should also be in the same orientation, otherwise two adjacent faces have normals in opposite directions and the mesh will be considered non-manifold, so we should really include that constraint when stepping to the next face to be more strict. Consider walking around the indicated vertices of the following non-manifold meshes Edges with 2 incident faces Faces sharing a vertex but no edges As mentioned earlier, many tools do not support non-manifold meshes, and in some contexts, e.g. 3D printing, they should be strictly avoided. Sometimes a manifold mesh may be desired and enforced as an end result, but the mesh may temporarily become non-manifold due to a particular sequence of modeling operations. Rather than supporting or advocating the use of non-manifold meshes, OpenSubdiv strives to be robust in the presence of non-manifold features to simplify the usage of its clients -- sparing them the need for topological analysis to determine when OpenSubdiv can or cannot be used. Although subdivision rules are not as well standardized in areas where the mesh is not manifold, OpenSubdiv provides simple rules and a reasonable limit surface in most cases. Surface around edges with 2 incident faces Surface for faces sharing a vertex but no edges As with the case of regular versus irregular features, since every face has a corresponding piece of surface associated with it -- whether locally manifold or not -- the term arbitrary topology can be said to include non-manifold topology. Subdivision versus Tessellation The preceding sections illustrate subdivision surfaces as piecewise parametric surfaces of arbitrary topology. As piecewise parametric surfaces, they consist of a cage and the underlying surface defined by that cage. Two techniques used to display subdivision surfaces are subdivision and tessellation. Both have their legitimate uses, but there is an important distinction between them subdivision operates on a cage and produces a refined cage tessellation operates on a surface and produces a discretization of that surface The existence and relative simplicity of the subdivision algorithm makes it easy to apply repeatedly to approximate the shape of the surface, but with the result being a refined cage, that approximation is not always very accurate. When compared to a cage refined to a different level, or a tessellation that uses points evaluated directly on the limit surface, the discrepancies can be confusing. Subdivision Subdivision is the process that gives subdivision surfaces their name, but it is not unique to them. Being piecewise parametric surfaces, lets first look at subdivision in the context of the simpler parametric patches that comprise them. Subdivision is a special case of refinement , which is key to the success of some of the most widely used types of parametric patches and their aggregate surfaces. A surface can be refined when an algorithm exists such that more control points can be introduced while keeping the shape of the surface exactly the same . For interactive and design purposes, this allows a designer to introduce more resolution for finer control without introducing undesired side effects in the shape. For more analytical purposes, it allows the surface to be broken into pieces, often adaptively, while being faithful to the original shape. One reason why both B-spline and Bezier patches are so widely used is that both of them can be refined. Uniform subdivision -- the process of splitting each of the patches in one or both of its directions -- is a special case of refinement that both of these patch types support B-Spline surface and its cage Cage subdivided 1x Cage subdivided 2x In the cases illustrated above for B-Splines, the uniformly refined cages produce the same limit surface as the original granted in more pieces. So it is fair to say that both uniform B-splines and Bezier surfaces are subdivision surfaces. The limit surface remains the same with the many more control points roughly 4x with each iteration of subdivision, and those points are closer to but not on the surface. It may be tempting to use these new control points to represent the surface, but using the same number of points evaluated at corresponding uniformly spaced parametric locations on the surface is usually simpler and more effective. Note also that points of the cage typically do not have any normal vectors associated with them, though we can evaluate normals explicitly for arbitrary locations on the surface just as we do for position. So if displaying a cage as a shaded surface, normal vectors at each of the control points must be contrived. Both the positions and normals of the points on the finer cage are therefore both approximations. For more general subdivision surfaces, the same is true. Subdivision will refine a mesh of arbitrary topology, but the resulting points will not lie on the limit surface and any normal vectors contrived from and associated with these points will only be approximations to those of the limit surface. Tessellation There is little need to use subdivision to approximate a parametric surface when it can be computed directly, i.e. it can be tessellated. We can evaluate at arbitrary locations on the surface and connect the resulting points to form a tessellation -- a discretization of the limit surface -- that is far more flexible than the results achieved from uniform subdivision Uniform 3x3 tessellation of B-spline surface Curvature-adaptive tessellation of B-spline surface For a simple parametric surface, the direct evaluation of the limit surface is also simple, but for more complicated subdivision surfaces of arbitrary topology, this is less the case. The lack of a clear understanding of the relationship between the limit surface and the cage has historically lead to many applications avoiding tessellation. Its worth mentioning that subdivision can be used to generate a tessellation even when the limit surface is not available for direct evaluation. The recursive nature of subdivision does give rise to formulae that allow a point on the limit surface to be computed that corresponds to each point of the cage. This process is often referred to as snapping or pushing the points of the cage onto the limit surface. Subdivided 1x and snapped to limit surface Subdivided 2x and snapped to limit surface Since the end result is a connected set of points on the limit surface, this forms a tessellation of the limit surface, and we consider it a separate process to subdivision though it does make use of it. The fact that such a tessellation might have been achieved using subdivision is indistinguishable from the final result -- the same tessellation might just as easily have been generated by evaluating limit patches of the cage uniformly 2x, 4x, 8x, etc. along each edge. Which to Use Subdivision is undeniably useful in creating finer cages to manipulate the surface, but tessellation is preferred for displaying the surface when the patches are available for direct evaluation. There was a time when global refinement was pursued in limited circles as a way of rapidly evaluating parametric surfaces along isoparametric lines, but patch evaluation, i.e. tessellation, generally prevails. Considerable confusion has arisen due the way the two techniques have been employed and presented when displaying the shape in end-user applications. One can argue that if an application displays a representation of the surface that is satisfactory for its purposes, then it is not necessary to burden the user with additional terminology and choices. But when two representations of the same surface differ considerably between two applications, the lack of any explanation or control leads to confusion. As long as applications make different choices on how to display the surface, we seek a balance between simplicity and control. Since subdivided points do not lie on the limit surface, it is important to make it clear to users when subdivision is being used instead of tessellation. This is particularly true in applications where the cage and the surface are displayed in the same style as there is no visual cue for users to make that distinction. Mesh Data and Topology The ability of subdivision surfaces to support arbitrary topology leads to the use of meshes to store both the topology of the cage and the data values associated with its control points, i.e. its vertices. The shape of a mesh, or the subdivision surface that results from it, is a combination of the topology of the mesh and the position data associated with its vertices. When dealing with meshes there are advantages to separating the topology from the data, and this is even more important when dealing with subdivision surfaces. The shape referred to above is not just the shape of the mesh the cage in this case but could be the shape of a refined cage or the limit surface. By observing the roles that both the data and topology play in operations such as subdivision and evaluation, significant advantages can be gained by managing data, topology and the associated computations accordingly. While the main purpose of subdivision surfaces is to use position data associated with the vertices to define a smooth, continuous limit surface, there are many cases where non-positional data is associated with a mesh. That data may often be interpolated smoothly like position, but often it is preferred to interpolate it linearly or even make it discontinuous along edges of the mesh. Texture coordinates and color are common examples here. Other than position, which is assigned to and associated with vertices, there are no constraints on how arbitrary data can or should be associated or interpolated. Texture coordinates, for example, can be assigned to create a completely smooth limit surface like the position, linearly interpolated across faces, or even made discontinuous between them. There are, however, consequences to consider -- both in terms of data management and performance -- which are described below as the terminology and techniques used to achieve each are defined. Separating Data from Topology While the topology of meshes used to store subdivision surfaces is arbitrarily complex and variable, the topology of the parametric patches that make up its limit surface are simple and fixed. Bicubic B-Spline and Bezier patches are both defined by a simple 4x4 grid of control points and a set of basis functions for each point that collectively form the resulting surface. For such a patch, the position at a given parametric location is the result of the combination of position data associated with its control points and the weights of the corresponding basis functions weights being the values of basis functions evaluated at a parametric location. The topology and the basis functions remain the same, so we can make use of the weights independent of the data. If the positions of the control points change, we can simply recombine the new position data with the weights that we just used and apply the same combination. The fixed topology of a parametric patch and two shapes resulting from two sets of positions. Similarly, for a piecewise surface, the position at a given parametric location is the result of the single patch containing that parametric location evaluated at the given position. The control points involved are the subset of control points associated with that particular patch. If the topology of the surface is fixed, so too is the topology of the collection of patches that comprise that surface. If the positions of those control points change, we can recombine the new position data with the same weights for the subset of points associated with the patch. More complex but fixed topology of a surface and two shapes resulting from two sets of positions. This holds for a piecewise surface of arbitrary topology. Regardless of how complex the topology, as long as it remains fixed i.e. relationships between vertices, edges and faces does not change or anything other settings affecting subdivision rules, the same techniques apply. This is just one example of the value of separating computations involving topology from those involving the data. Both subdivision and evaluation can be factored into steps involving topology computing the weights and combining the data separately. Three shapes resulting from three sets of positions for a mesh of fixed topology. When the topology is fixed, enormous savings are possible by pre-computing information associated with the topology and organizing the data associated with the control points in a way that can be efficiently combined with it. This is key to understanding some of the techniques used to process subdivision surfaces. For a mesh of arbitrary topology, the control points of the underlying surface are the vertices, and position data associated with them is most familiar. But there is nothing that requires that the control points of a patch have to represent position -- the same techniques apply regardless of the type of data involved. Vertex and Varying Data The most typical and fundamental operation is to evaluate a position on the surface, i.e. evaluate the underlying patches of the limit surface using the x,y,z positions at the vertices of the mesh. Given a parametric u,v location on one such patch, the data-independent evaluation method first computes the weights and then combines the x,y,z vertex positions resulting in an x,y,z position at that location. But the weights and their combination can be applied to any data at the vertices, e.g. color, texture coordinates or anything else. Data associated with the vertices that is interpolated this way, including position, is said to be vertex data or to have vertex interpolation. Specifying other data as vertex data will result in it being smoothly interpolated in exactly the same way using exactly the same weights as the position. So to capture a simple 2D projection of the surface for texture coordinates, 2D values matching the x,y of the positions would be used. If linear interpolation of data associated with vertices is desired instead, the data is said to be varying data or to have varying interpolation. Here the non-linear evaluation of the patches defining the smooth limit surface is ignored and weights for simple linear interpolation are used. This is a common choice for texture coordinates as evaluation of texture without the need of bicubic patches is computationally cheaper. The linear interpolation will not capture the smoothness required of a true projection between the vertices, but both vertex and varying interpolation have their uses. Projected texture smoothly interpolated from vertex data Projected texture linearly interpolated from varying data Since both vertex and varying data is associated with vertices a unique value assigned to each, the resulting surface will be continuous -- piecewise smooth in the case of vertex data and piecewise linear in the case of varying. Face-Varying Data and Topology In order to support discontinuities in data on the surface, unlike vertex and varying data, there must be multiple values associated with vertices, edges andor faces, in order for a discontinuity to exist. Discontinuities are made possible by assigning values to the corners of faces, similar to the way in which vertices are assigned to the corners of faces when defining the topology of the mesh. Recalling the assignment of vertices to faces Vertex indices are assigned to all corners of each face as part of mesh construction and are often referred to as the face-vertices of an individual face or the mesh. All face-vertices that share the same vertex index will be connected by that vertex and share the same vertex data associated with it. By assigning a different set of indices to the face-vertices -- indices not referring to the vertices but some set of data to be associated with the corners of each face -- corners that share the same vertex no longer need to share the same data value and the data can be made discontinuous between faces This method of associating data values with the face-vertices of the mesh is said to be assigning face-varying data for face-varying interpolation. An interpolated value will vary continuously within a face i.e. the patch of the limit surface associated with the face but not necessarily across the edges or vertices shared with adjacent faces. Disjoint face-varying UV regions applied to the limit surface The combination of associating data values not with the vertices the control points but the face corners, and the resulting data-dependent discontinuities that result, make this a considerably more complicated approach than vertex or varying. The added complexity of the data alone is reason to only use it when necessary, i.e. when discontinuities are desired and present. Part of the complexity of dealing with face-varying data and interpolation is the way in which the interpolation behavior can be defined. Where the data is continuous, the interpolation can be specified to be as smooth as the underlying limit surface of vertex data or simply linear as achieved with varying data. Where the data is discontinuous -- across interior edges and around vertices -- the discontinuities create boundaries for the data, and partition the underlying surface into disjoint regions. The interpolation along these boundaries can also be specified as smooth or linear in a number of ways many of which have a historical basis. A more complete description of the different linear interpolation options with face-varying data and interpolation is given later. These options make it possible to treat the data as either vertex or varying, but with the added presence of discontinuities. An essential point to remember with face-varying interpolation is that each set of data is free to have its own discontinuities -- this leads to each data set having both unique topology and size. The topology specified for a collection of face-varying data is referred to as a channel and is unique to face-varying interpolation. Unlike vertex and varying interpolation, which both associate a data value with a vertex, the number of values in a face-varying channel is not fixed by the number of vertices or faces. The number of indices assigned to the face-corners will be the same for all channels, but the number of unique values referred to by these indices may not. We can take advantage of the common mesh topology in areas where the data is continuous, but we lose some of those advantages around the discontinuities. This results in the higher complexity and cost of a face-varying channel compared to vertex or varying data. If the topology for a channel is fixed, though, similar techniques can be applied to factor computation related to the topology so that changes to the data can be processed efficiently. Schemes and Options While previous sections have described subdivision surfaces in more general terms, this section describes a number of common variations often referred to as extensions to the subdivision algorithms and the ways that they are represented in OpenSubdiv. The number and nature of the extensions here significantly complicate what are otherwise fairly simple subdivision algorithms. Historically applications have supported either a subset or have had varying implementations of the same feature. OpenSubdiv strives to provide a consistent and efficient implementation of this feature set. Given the varying presentations of some of these features elsewhere, the naming chosen by OpenSubdiv is emphasized here. Subdivision Schemes OpenSubdiv provides two well known subdivision surface types -- Catmull-Clark often referred to more tersely as Catmark and Loop subdivision. Catmull-Clark is more widely used and suited to quad-dominant meshes, while Loop is preferred for and requires purely triangulated meshes. The many examples from previous sections have illustrated the more popular Catmull-Clark scheme. For an example of Loop Boundary Interpolation Rules Boundary interpolation rules control how subdivision and the limit surface behave for faces adjacent to boundary edges and vertices. The following choices are available via the enumeration SdcOptionsVtxBoundaryInterpolation Mode Behavior VTX_BOUNDARY_NONE No boundary edge interpolation is applied by default boundary faces are tagged as holes so that the boundary vertices continue to support the adjacent interior faces, but no surface corresponding to the boundary faces is generated boundary faces can be selectively interpolated by sharpening all boundary edges incident the vertices of the face VTX_BOUNDARY_EDGE_ONLY A sequence of boundary vertices defines a smooth curve to which the limit surface along boundary faces extends VTX_BOUNDARY_EDGE_AND_CORNER Similar to edge-only but the smooth curve resulting on the boundary is made to interpolate corner vertices vertices with exactly one incident face On a grid example In practice, it is rare to use no boundary interpolation at all -- this feature has its uses in allowing separate meshes to be seamlessly joined together by replicating the vertices along boundaries, but these uses are limited. Given the global nature of the setting, it is usually preferable to explicitly make the boundary faces holes in the areas where surfaces from separate meshes are joined, rather than sharpening edges to interpolate the desired boundaries everywhere else. The remaining edge only and edge and corner choices are then solely distinguished by whether or not the surface at corner vertices is smooth or sharp. Face-varying Interpolation Rules Face-varying interpolation rules control how face-varying data is interpolated both in the interior of face-varying regions smooth or linear and at the boundaries where it is discontinuous constrained to be linear or pinned in a number of ways. Where the topology is continuous and the interpolation chosen to be smooth, the behavior of face-varying interpolation will match that of the vertex interpolation. Choices for face-varying interpolation are most commonly available in the context of UVs for texture coordinates and a number of names for such choices have evolved in different applications over the years. The choices offered by OpenSubdiv cover a wide range of popular applications. The feature is named face-varying linear interpolation -- rather than boundary interpolation commonly used -- to emphasize that it can be applied to the entire surface not just boundaries and that the effects are to make the surface behave more linearly in various ways. The following choices are available for the SdcOptionsFVarLinearInterpolation enum -- the ordering here applying progressively more linear constraints Mode Behavior FVAR_LINEAR_NONE smooth everywhere the mesh is smooth FVAR_LINEAR_CORNERS_ONLY linearly interpolate sharpen or pin corners only FVAR_LINEAR_CORNERS_PLUS1 CORNERS_ONLY sharpening of junctions of 3 or more regions FVAR_LINEAR_CORNERS_PLUS2 CORNERS_PLUS1 sharpening of darts and concave corners FVAR_LINEAR_BOUNDARIES linear interpolation along all boundary edges and corners FVAR_LINEAR_ALL linear interpolation everywhere boundaries and interior These rules cannot make the interpolation of the face-varying data smoother than that of the vertices. The presence of sharp features of the mesh created by sharpness values, boundary interpolation rules, or the subdivision scheme itself e.g. Bilinear take precedence. All face-varying interpolation modes illustrated in UV space using a simple 4x4 grid of quads segmented into three UV regions their control point locations implied by interpolation in the FVAR_LINEAR_ALL case For those familiar, this shape and its assigned UV sets are available for inspection in the catmark_fvar_bound1 shape of OpenSubdivs example and regression shapes. Semi-Sharp Creases Just as some types of parametric surfaces support additional shaping controls to affect creasing along the boundaries between surface elements, OpenSubdiv provides additional sharpness values or weights associated with edges and vertices to achieve similar results over arbitrary topology. Setting sharpness values to a maximum value 10 in this case -- a number chosen for historical reasons effectively modifies the subdivision rules so that the boundaries between the piecewise smooth surfaces are infinitely sharp or discontinuous. But since real world surfaces never really have infinitely sharp edges, especially when viewed sufficiently close, it is often preferable to set the sharpness lower than this value, making the crease semi-sharp. A constant weight value assigned to a sequence of edges connected edges therefore enables the creation of features akin to fillets and blends without adding extra rows of vertices though that technique still has its merits Sharpness values range from 0-10, with a value of 0 or less having no effect on the surface and a value of 10 or more making the feature completely sharp. It should be noted that infinitely sharp creases are really tangent discontinuities in the surface, implying that the geometric normals are also discontinuous there. Therefore, displacing along the normal will likely tear apart the surface along the crease. If you really want to displace a surface at a crease, it may be better to make the crease semi-sharp. Other Options While the preceding options represent features available in a wide-variety of tools and modeling formats, a few others exist whose recognition and adoption is more limited. In some cases, they offer improvements to undesirable behavior of the subdivision algorithms, but their effects are less than ideal. Given both their limited effectiveness and lack of recognition, these options should be used with caution. Chaikin Rule The Chaikin Rule is a variation of the semi-sharp creasing method that attempts to improve the appearance of creases along a sequence of connected edges when the sharpness values differ. This choice modifies the subdivision of sharpness values using Chaikins curve subdivision algorithm to consider all sharpness values of edges around a common vertex when determining the sharpness of child edges. The creasing method can be set using the values defined in the enumeration SdcOptionsCreasingMethod Mode Behavior CREASE_UNIFORM Apply regular semi-sharp crease rules CREASE_CHAIKIN Apply Chaikin semi-sharp crease rules Example of contiguous semi-sharp creases interpolation Triangle Subdivision Rule The triangle subdivision rule is a rule added to the Catmull-Clark scheme that modifies the behavior at triangular faces to improve the undesirable surface artefacts that often result in such areas. Mode Behavior TRI_SUB_CATMARK Default Catmark scheme weights TRI_SUB_SMOOTH Smooth triangle weights Cylinder example This rule was empirically determined to make triangles subdivide more smoothly. However, this rule breaks the nice property that two separate meshes can be joined seamlessly by overlapping their boundaries i.e. when there are triangles at either boundary, it is impossible to join the meshes seamlessly Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"subdivision_surfaces.html\"\n }, {\n- \"title\": \"Using Hbr\",\n- \"text\": \"Using Hbr Using Hbr 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Vertex Template API Creating a Mesh Instantiating an HbrMesh Creating Vertices Creating Faces Wrapping Things Up Boundary Interpolation Rules Adding Creases Vertex Creases Edge Creases Holes Hierarchical Edits Face-varying Data Instantiating the HbrMesh Setting the Face-Varying Data Retrieving the Face-Varying Data Valence Operators Managing Singular Vertices Note As of OpenSubdiv 3.0, all Hbr dependencies have been removed from the core APIs Sdc , Vtr , Far , Osd . The legacy source code of Hbr is provided purely for regression and legacy purposes. If your code is currently depending on Hbr functionality, we recommend migrating to the newer APIs as we cannot guarantee that this code will be maintained in future releases. For more information see the 3.0 release notes Vertex Template API The Hbr API abstracts the vertex class through templating. Client-code is expected to provide a vertex class that implements the requisite interpolation functionality. Here is an example of a simple vertex class that accounts for 3D position, but does not support arbitrary variables or varying interpolation. struct Vertex Vertex Vertex int i Vertex const Vertex src _pos 0 src . _pos 0 _pos 1 src . _pos 1 _pos 2 src . _pos 2 Vertex void AddWithWeight const Vertex src , float weight , void 0 _pos 0 weight src . _pos 0 _pos 1 weight src . _pos 1 _pos 2 weight src . _pos 2 void AddVaryingWithWeight const Vertex , float , void 0 void Clear void 0 _pos 0 _pos 1 _pos 2 0.0f void SetPosition float x , float y , float z _pos 0 x _pos 1 y _pos 2 z void ApplyVertexEdit const OpenSubdiv HbrVertexEdit Vertex edit const float src edit . GetEdit switch edit . GetOperation case OpenSubdiv HbrHierarchicalEdit Vertex Set _pos 0 src 0 _pos 1 src 1 _pos 2 src 2 break case OpenSubdiv HbrHierarchicalEdit Vertex Add _pos 0 src 0 _pos 1 src 1 _pos 2 src 2 break case OpenSubdiv HbrHierarchicalEdit Vertex Subtract _pos 0 - src 0 _pos 1 - src 1 _pos 2 - src 2 break void ApplyMovingVertexEdit const OpenSubdiv HbrMovingVertexEdit Vertex custom functions data not required by Hbr ------------------------- Vertex float x , float y , float z _pos 0 x _pos 1 y _pos 2 z const float GetPos const return _pos float _pos 3 In some cases, if only topological analysis is required, the class can be left un-implemented. Far and Osd for instance store vertex data in serialized interleaved vectors. Here is the OsdVertex class for reference class Vertex public Vertex Vertex int index Vertex Vertex const src void AddWithWeight Vertex const i , float weight , void 0 void AddVaryingWithWeight const Vertex i , float weight , void 0 void Clear void 0 void ApplyVertexEdit FarVertexEdit const Creating a Mesh The following tutorial walks through the steps of instantiating a simple Hbr mesh. The code found in regressioncommonshape_utils.h can also be used as an example. While this implementation covers many of Hbr s features, it does not provide coverage for the complete Renderman specification though. Instantiating an HbrMesh First we need to instantiate a mesh object. Hbr supports 3 subdivision schemes Catmull-Clark catmark Loop Bilinear The scheme is selected by passing an specialized instance of HbrSubdivisionT , HbrCatmarkSubdivisionT in this case. The scheme can be shared across multiple mesh objects, so we only need a single instance. static OpenSubdiv HbrCatmarkSubdivision Vertex _scheme OpenSubdiv HbrMesh Vertex mesh new OpenSubdiv HbrMesh Vertex _scheme Creating Vertices Adding vertices to the mesh is accomplished using the HbrMeshNewVertex method. Because Hbr uses a dedicated vertex allocator to help alleviate the performance impact of intensive fragmented memory allocations. This optimization results in the following design pattern Vertex vtx for int i 0 i numVerts i Vertex v mesh - NewVertex i , vtx v-SetPosition We instantiate a single default vertex object named vtx on the stack. We then recover the pointer to the actual vertex created in the mesh from the NewVertex method. Once we have recovered that pointer, we can set the data for our vertex by using any of the custom accessors. Creating Faces Once all the vertices have been registered in the mesh, we can start adding the faces with HbrMeshNewFace . Assuming we had an obj style reader, we need to know the number of vertices in the face and the indices of these vertices. for int f 0 f numFaces f int nverts obj - GetNumVertices f const int faceverts obj - GetFaceVerts f mesh - NewFace nv , fv , 0 However, Hbr is not able to handle non-manifold geometry. In order to avoid tripping asserts or causing memory violations, lets rewrite the previous loop with some some prototype code to check the validity of the topology. for int f 0 f numFaces f int nv obj - GetNumVertices f const int fv obj - GetFaceVerts f triangles only for Loop subdivision if scheme kLoop and nv 3 printf Trying to create a Loop subd with non-triangle face n continue now check the half-edges connectivity for int j 0 j nv j OpenSubdiv HbrVertex T origin mesh - GetVertex fv j OpenSubdiv HbrVertex T destination mesh - GetVertex fv j 1 nv OpenSubdiv HbrHalfedge T opposite destination - GetEdge origin if origin NULL destination NULL printf An edge was specified that connected a nonexistent vertex n continue if origin destination printf An edge was specified that connected a vertex to itself n continue if opposite opposite - GetOpposite printf A non-manifold edge incident to more than 2 faces was found n continue if origin - GetEdge destination printf An edge connecting two vertices was specified more than once. Its likely that an incident face was flipped n continue mesh - NewFace nv , fv , 0 Wrapping Things Up Once we have vertices and faces set in our mesh, we still need to wrap things up by calling HbrMeshFinish mesh - Finish Finish iterates over the mesh to apply the boundary interpolation rules and checks for singular vertices. At this point, there is one final topology check remaining to validate the mesh mesh - Finish if mesh - GetNumDisconnectedVertices printf The specified subdivmesh contains disconnected surface components. n abort or iterate over the mesh to remove the offending vertices Boundary Interpolation Rules The rule-set can be selected using the following accessors Vertex and varying data mesh - SetInterpolateBoundaryMethod OpenSubdiv HbrMesh Vertex k_InterpolateBoundaryEdgeOnly Face-varying data mesh - SetFVarInterpolateBoundaryMethod OpenSubdiv HbrMesh Vertex k_InterpolateBoundaryEdgeOnly Additional information on boundary interpolation rules can be found here Warning The boundary interpolation rules must be set before the call to HbrMeshFinish , which sets the sharpness values to boundary edges and vertices based on these rules. Adding Creases Hbr supports a sharpness attribute on both edges and vertices. Sharpness is set using the SetSharpnessfloat accessors. Vertex Creases Given an index, vertices are very easy to access in the mesh. int idx vertex index float sharp the edge sharpness OpenSubdiv HbrVertex Vertex v mesh - GetVertex idx if v v - SetSharpness std max 0.0f , sharp else printf cannot find vertex for corner tag d n , idx Edge Creases Usually, edge creases are described with a vertex indices pair. Here is some sample code to locate the matching half-edge and set a crease sharpness. int v0 , v1 vertex indices float sharp the edge sharpness OpenSubdiv HbrVertex Vertex v mesh - GetVertex v0 , w mesh - GetVertex v1 OpenSubdiv HbrHalfedge Vertex e 0 if v w if e v - GetEdge w 0 e w - GetEdge v if e e - SetSharpness std max 0.0f , sharp else printf cannot find edge for crease tag d,d n , v0 , v1 Holes Hbr faces support a hole tag. int idx the face index OpenSubdiv HbrFace Vertex f mesh - GetFace idx if f f - SetHole else printf cannot find face for hole tag d n , idx Note The hole tag is hierarchical sub-faces can also be marked as holes. See Hierarchical Edits Hierarchical Edits Hbr supports the following types of hierarchical edits Type Function Corner edits Modify vertex sharpness Crease edits Modify edge sharpness FaceEdit Modify custom face data FVarEdit Modify face-varying data VertexEdit Modify vertex and varying data HoleEdit Set hole tag Modifications are one of the following 3 operations Operation Set Add Subtract Here is a simple example that creates a hierarchical vertex edit. path 655, 2, 3, 0 int faceid 655 , nsubfaces 2 , subfaces 2 2 , 3 , vertexid 0 int offset 0 , offset to the vertex or varying data numElems 3 number of elements to apply the modifier to x,y,z 3 bool isP false shortcut to identify modifications to the vertex position P OpenSubdiv HbrHierarchicalEdit Vertex Operation op OpenSubdiv HbrHierarchicalEdit T Set float values 3 1.0f , 0.5f , 0.0f edit values OpenSubdiv HbrVertexEdit T edit new OpenSubdiv HbrVertexEdit T faceid , nsubfaces , subfaces , vertexid , offset , floatwidth , isP , op , values Face-varying Data Here is a walk-through of how to store face-varying data for a u,v pair. Unlike vertex and varying data which is accessed through the templated vertex API, face-varying data is directly aggregated as vectors of float data. Instantiating the HbrMesh The HbrMesh needs to retain some knowledge about the face-varying data that it carries in order to refine it correctly. int fvarwidth 2 total width of the fvar data static int indices 1 0 , 1 offset set to 0 widths 1 2 2 floats in a u,v pair int const fvarcount fvarwidth 0 1 0 , fvarindices fvarwidth 0 indices NULL , fvarwidths fvarwidth 0 widths NULL mesh new OpenSubdiv HbrMesh T _scheme , fvarcount , fvarindices , fvarwidths , fvarwidth Setting the Face-Varying Data After the topology has been created, Hbr is ready to accept face-varying data. Here is some sample code for int i 0 , idx 0 i numFaces i OpenSubdiv HbrFace Vertex f mesh - GetFace i int nv f - GetNumVertices note this is not the fastest way OpenSubdiv HbrHalfedge Vertex e f - GetFirstEdge for int j 0 j nv j , e e - GetNext OpenSubdiv HbrFVarData Vertex fvt e - GetOrgVertex - GetFVarData f float const fvdata GetFaceVaryingData i , j if not fvt . IsInitialized if no fvar daa exists yet on the vertex fvt . SetAllData 2 , fvdata else if not fvt . CompareAll 2 , fvdata if there already is fvar data and there is a boundary add the new data OpenSubdiv HbrFVarData T nfvt e - GetOrgVertex - NewFVarData f nfvt . SetAllData 2 , fvdata Retrieving the Face-Varying Data The HbrFVarData structures are expanded during the refinement process, with every sub-face being assigned a set of interpolated face-varying data. This data can be accessed in 2 ways From a face, passing a vertex index OpenSubdivHbrFaceVertex f OpenSubdiv HbrFVarData const fv f . GetFVarData vindex const float data fv . GetData From a vertex, passing a pointer to an incident face OpenSubdivHbrFaceVertex f OpenSubdiv HbrFVarData const fv myVertex . GetFVarData f const float data fv . GetData Valence Operators When manipulating meshes, it is often necessary to iterate over neighboring faces or vertices. Rather than gather lists of pointers and return them, Hbr exposes an operator pattern that guarantees consistent mesh traversals. The following example shows how to use an operator to count the number of neighboring vertices use HbrVertexGetValence for proper valence counts OpenSubdivHbrVertexVertex v class MyOperator public OpenSubdiv HbrVertexOperator Vertex public int count MyOperator count 0 virtual void operator OpenSubdiv HbrVertex Vertex v count MyOperator op v - ApplyOperatorSurroundingVertices op Managing Singular Vertices Certain topological configurations would force vertices to share multiple half-edge cycles. Because Hbr is a half-edge representation, these singular vertices have to be duplicated as part of the HbrMeshFinish phase of the instantiation. These duplicated vertices can cause problems for client-code that tries to populate buffers of vertex or varying data. The following sample code shows how to match the vertex data to singular vertex splits Populating an OsdCpuVertexBuffer with vertex data positions,... float const vtxData inMeshFn . getRawPoints returnStatus OpenSubdiv OsdCpuVertexBuffer vertexBuffer OpenSubdiv OsdCpuVertexBuffer Create numVertexElements , numFarVerts vertexBuffer - UpdateData vtxData , 0 , numVertices Duplicate the vertex data into the split singular vertices std vector std pair int , int const splits hbrMesh - GetSplitVertices for int i 0 i int splits . size i vertexBuffer - UpdateData vtxData splits i . second numVertexElements , splits i . first , 1 Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"hbr_tutorial_0.cpp\",\n+ \"text\": \"hbr_tutorial_0.cpp hbr_tutorial_0.cpp 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialshbrtutorial_0hbr_tutorial_0.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial presents in a very succinct way the requisite steps to instantiate an Hbr mesh from simple topological data. include opensubdivhbrmesh.h include opensubdivhbrcatmark.h include cstdio ------------------------------------------------------------------------------ Vertex container implementation. The HbrMeshT class is a templated interface that expects a vertex class to perform interpolation on arbitrary vertex data. For the template specialization of the HbrMesh interface to be met, our Vertex object to implement a minimal set of constructors and member functions. Since we are not going to subdivide the mesh, the struct presented here has been left minimalistic. The only customization added to our container was to provide storage and accessors for the position of a 3D vertex. struct Vertex Hbr minimal required interface ---------------------- Vertex Vertex int i Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 void AddWithWeight Vertex const , float void AddVaryingWithWeight Vertex const , float Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 typedef OpenSubdiv HbrMesh Vertex Hmesh typedef OpenSubdiv HbrFace Vertex Hface typedef OpenSubdiv HbrVertex Vertex Hvertex typedef OpenSubdiv HbrHalfedge Vertex Hhalfedge ------------------------------------------------------------------------------ Pyramid geometry from catmark_pyramid.h static float verts 5 3 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 2.0f , 0.0f , 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 0.0f static int nverts 5 , nfaces 5 static int facenverts 5 3 , 3 , 3 , 3 , 4 static int faceverts 16 0 , 1 , 2 , 0 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 4 , 3 , 2 , 1 ------------------------------------------------------------------------------ int main int , char Create a subdivision scheme Catmull-Clark here OpenSubdiv HbrCatmarkSubdivision Vertex catmark new OpenSubdiv HbrCatmarkSubdivision Vertex Create an empty Hbr mesh Hmesh hmesh new Hmesh catmark Populate the vertices Vertex v for int i 0 i nverts i Primitive variable data must be set here in our case we set the 3D position of the vertex. v . SetPosition verts i 0 , verts i 1 , verts i 2 Add the vertex to the mesh. hmesh - NewVertex i , v Create the topology int fv faceverts for int i 0 i nfaces i int nv facenverts i hmesh - NewFace nv , fv , 0 fv nv Set subdivision options By default vertex interpolation is set to none on boundaries, which can produce un-expected results, so we change it to edge-only. hmesh - SetInterpolateBoundaryMethod Hmesh k_InterpolateBoundaryEdgeOnly Call Finish to finalize the data structures before using the mesh. hmesh - Finish printf Created a pyramid with d faces and d vertices. n , hmesh - GetNumFaces , hmesh - GetNumVertices delete hmesh delete catmark ------------------------------------------------------------------------------ Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"using_osd_hbr.html\"\n+ \"loc\": \"hbr_tutorial_0.html\"\n }, {\n \"title\": \"Vtr Overview\",\n \"text\": \"Vtr Overview Vtr Overview 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Vectorized Topology Representation Vtr VtrLevel Topological Relationships Memory Efficiency VtrRefinement Parent-child and child-parent relationships Data flexibility Vectorized Topology Representation Vtr Vtr consists of a suite of classes that collectively provide an intermediate representation of topology that supports efficient refinement. Vtr is intended for internal use only and is currently accessed through the Far layer by the FarTopologyRefiner , which assembles these Vtr classes to meet the topological and refinement needs of the Far layer. What follows is therefore more intended to provide insite into the underlying architecture than to describe particular usage. For documentation more relevant to direct usage, proceed to the Far section previously noted. Vtr is vectorized in that its topological data is stored more as a collection of vectors of primitive elements rather than as the faces, vertices and edges that make up many other topological representations. It is essentially a structure-of-arrays SOA approach to topology in contrast to the more common array-of-structures pattern found in many other topological representations. Vtrs use of vectors allows it to be fairly efficient in its use of memory and similarly efficient to refine, but the topology is fixed once defined. Vtr classes are purely topological. They are even more independent of the representation of vertices, faces, etc. than Hbr in that they are not even parameterized by an interface to such components. So the same set of Vtr objects can eventually be used to serve more than one representation of these components. The primary requirement is that a mesh be expressable as an indexable set i.e. a vector or array of vertices, edges and faces. The index of a component uniquely identifies it and properties are retrieved by referring to it by index. Its worth qualifying the term topological here and elsewhere -- we generally refer to topology as subdivision topology rather than mesh topology. A subdivision hierarchy is impacted by the presence of semi-sharp creasing, as the subdivision rules change in response to that creasing. So subdivision topology includes the sharpness values assigned to edges and vertices that affect the semi-sharp creasing. The two primary classes in Vtr consist of VtrLevel - a class representing complete vertex topology for a level VtrRefinement - a class mapping a parent VtrLevel to a child level Others exist to represent the following selection and appropriate tagging of components for sparse refinement divergence of face-varying topology from the vertex topology mapping between face-varying topology at successive levels common low-level utilities, e.g. simple array classes VtrLevel VtrLevel is a complete topological description of a subdivision level, with the topological relations, sharpness values and component tags all stored in vectors literally stdvectors, but easily changed via typedefs. There are no classes or objects for the mesh component types i.e. faces, edges and vertices but simply an integer index to identify each. It can be viewed as a structure-of-arrays representation of the topology any property related to a particular component is stored in an array and accessible using the index identifying that component. So with no classes the for the components, its difficult to say what constitutes a vertex or a face they are each the sum of all the fields scattered amongst the many vectors included. Level represents a single level of a potential hierarchy and is capable of representing the complete base mesh. There are no members that relate data in one level to any other, either below or above. As such, any Level can be used as the base level for a new subdivision hierarchy potentially more than one. All relationships between separate levels are maintained in the VtrRefinement class. Topological Relationships Level requires the definition of and associations between a fixed set of indexable components for all three component types, i.e. an explicit edge list in addition to the expected set of vertices and faces. There are no explicit component objects in the representation, only an integer index VtrIndex identifying each component within the set and data associated with that component in the various vectors. The topology is stored as six sets of incident relations between the components two each for the two other component types incident each component type, i.e. for each face, its incident vertices and incident edges for each edge, its incident vertices and incident faces for each vertex, its incident edges and incident faces The collection of incidence relations is a vectorized variation of AIF the Adjacency and Incidence Framework. The set of these six incidence relations is not minimal only four are required, but that set excludes the most desired face-vertex relation but all six are kept and maintained to facilitate faster refinement. While the sizes of several vectors are directly proportional to the number of vertices, edges or faces to which the data is associated, the sizes of some of the vectors for these relations is more cumulative and so additional vectors of offsets is required typical of the face-vertex list commonly used as the minimal definition of mesh topology. Vectors for the sharpness values associated with crease edges and corner vertices are included and so sized according to the number of edges and vertices, along with additional tags for the components that may be helpful to refinement i.e. the type of subdivision Rule associated with each vertex. A Level is really just a container for data in a subdivision level, and so its public methods are primarily to access that data. Modification of the data is protected and only made available to classes that are intended to construct Levels currently the Far factory class that is responsible for building the base level, and the VtrRefinement class that constructs subsequent levels during refinement. Memory Efficiency One of the advantages in storing data in what is essentially a structure-of-arrays, rather than the array-of-structures more typical of topological representations, is that we can be more selective about memory usage in some cases. Particularly in the case of uniform refinement, when the data in subsequent levels is typically 4x its predecessor, we can minimize what we either generate or keep around at each level. For instance, if only a face-list is required at the finest level, we only need to generate one of the six topological relations the vertices incident each face. When we do keep Levels around in memory as is the case with the FarTopologyRefiner we do have do have the opportunity to prune what is not strictly necessary after the refinement. Just as with construction, whatever classes are privileged to construct a Level are likely those that will be privileged to prune its contents when needed. The current implementation of Level is far from optimal though -- there are opportunities for improvement. After one level of subdivision, the faces in a Level will be either all quads or tris. Having specializations for these cases and using the more general case in support of N-sided faces for the base level only is one possibility. Levels also allocate dozens of vectors in which to store all data. Since these vectors are of fixed size once created, they could be aggregated by partitioning one or a smaller number of larger block of memory into the desired pieces. The desire to make some of these improvements is part of why Vtr is not directly exposed for public use and instead exposed via Far. VtrRefinement While VtrLevel contains the topology for each subdivision level, VtrRefinement is responsible for creating a new level via refinement of an existing one, and for maintaining the relationships between the components in the parent and child levels. So a simplified view of a subdivision hierarchy with Vtr is a set of Levels with a Refinement between each successive pair. Refinement is a friend of Level and will populate a child level from a parent given a set of refinement parameters. Aside from parameters related to data or depth, there are two kinds of refinement supported uniform and sparse. The latter sparse refinement requires selection of an arbitrary set of components -- any dependent or neighboring components that are required for the limit will be automatically included. So feature-adaptive refinement is just one form of this selective sparse refinement, the criteria being the topological features of interest creases and extra-ordinary vertices. The intent is to eventually provide more flexibility to facilitate the refinement of particular regions of interest or more dynamicadaptive needs. Refinement has also been subclassed according to the type of topological split being performed, i.e. splitting all faces into quads or tris via the QuadRefinement and TriRefinement subclasses. As noted with VtrLevel , there is further room for improvement in memory andor performance here by combining more optimal specializations for both Refinement and Level -- with consideration of separating the uniform and sparse cases. Parent-child and child-parent relationships While Refinement populates a new child Level as part of its refinement operation, it also accumulates the relationships between the parent and child level and as with Level , this data is stored in vectors indexable by the components. The associations between components in the two levels was initially only uni-directional child components were associated with incident components of a parent component based on the parent components topology, so we had a parent-to-child mapping one to many. Storing the reverse child-to-parent mapping was avoided to reduce memory particularly in the case of uniform refinement as it often was not necessary, but a growing need for it, particularly in the case of sparse feature-adaptive refinement, lead to it being included. Data flexibility One of the advantages of the structure-of-arrays representation in both Level and Refinement is that we can make more dynamic choices about what type of data we choose to allocate and use based on needs. For instance, we can choose between maintaining the parent-child or child-parent mapping in Refinement , or both if needed, and we can remove one if no longer necessary. An active example of this is uniform refinement if we only require the face-vertex list at the finest subdivision level, there is no need to generate a complete topological description of that level as would be required of more traditional representations, and given that level is 4x the magnitude of its parent, the savings are considerable. Currently there is nothing specific to a subdivision scheme in the refinement other than the type of topological splitting to apply. The refinement does subdivide sharpness values for creasing, but that too is independent of scheme. Tags were added to the base level that are propagated through the refinement and these too are dependent on the scheme, but are applied externally. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"vtr_overview.html\"\n }, {\n- \"title\": \"Sdc Overview\",\n- \"text\": \"Sdc Overview Sdc Overview 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Subdivision Core Sdc Types, Traits and Options Creasing support Scheme-specific support The FACE, EDGE and VERTEX interfaces The MASK interface Subdivision Core Sdc Sdc is the lowest level layer in OpenSubdiv. Its intent is to separate the core subdivision details from any particular representation of a mesh it was previously bound to Hbr to facilitate the generation of consistent results with other mesh representations, both internal and external to OpenSubdiv. The functionality can be divided roughly into three sections types, traits and options for the supported subdivision schemes computations required to support semi-sharp creasing computations for mask weights of subdivided vertices for all schemes For most common usage, familiarity with only the first of these is necessary -- primarily the use of public types and constants for the choice of subdivision scheme and its associated options. The latter two provide the basis for a more comprehensive implementation of subdivision, which requires considerably more understanding and effort. Overall, the approach was to extract the functionality at the lowest level possible. In some cases, the implementation is not far from being simple global functions. The intent was to start at a low level and build any higher level functionality as needed. What exists now is functional for ongoing development and anticipated needs within OpenSubdiv for the near future. The intent of Sdc is to provide the building blocks for OpenSubdiv and its clients to efficiently process the specific set of supported subdivision schemes. It is not intended to be a general framework for defining customized subdivision schemes. Types, Traits and Options The most basic type is the enum SdcSchemeType that identifies the fixed set of subdivision schemes supported by OpenSubdiv Bilinear , Catmark and Loop . With this alone, we intend to avoid all dynamic casting issues related to the scheme by simply adding members to the associated subclasses for inspection. In addition to the type enum itself, a class defining a fixed set of traits associated with each scheme is provided. While these traits are available as static methods in the interface of a class supporting more functionality for each scheme to be described shortly, the SchemeTypeTraits provide queries of the traits for a variable of type SdcSchemeType -- enabling parameterization of code by the value of a trait without templates or virtual inheritance a simple internal table of traits is constructed and trivially indexed. The second contribution is the collection of all variations in one place that can be applied to the subdivision schemes, i.e. the boundary interpolation rules, creasing method, edge subdivision choices, etc. The fact that these are all declared in one place alone should help clients see the full set of variations that are possible. A simple Options struct a set of bitfields aggregates all of these variations into a single object the equivalent of an integer in this case that are passed around to other Sdc classes andor methods and are expected to be used at a higher level both within OpenSubdiv and externally. By aggregating the options and passing them around as a group, it allows us to extend the set easily in future without the need to rewire a lot of interfaces to accommodate the new choice. Clients can enable new choices at the highest level and be assured that they will propagate to the lowest level where they are relevant. Unlike other options structs used elsewhere to specify variations of a particular method, SdcOptions defines all options that affect the shape of the underlying limit surface of a subdivision mesh. Other operations at higher levels in the library may have options that approximate the shape and so create a slightly different appearance, but SdcOptions is a fundamental part of the definition of the true limit surface. Creasing support Since the computations involved in the support of semi-sharp creasing are independent of the subdivision scheme, the goal in Sdc was to encapsulate all related creasing functionality in a similarly independent manner. Computations involving sharpness values are also much less dependent on topology -- there are vertices and edges with sharpness values, but knowledge of faces or boundary edges is not required, -- so the complexity of topological neighborhoods required for more scheme-specific functionality is arguably not necessary here. Creasing computations have been provided as methods defined on a Crease class that is constructed with a set of Options. Its methods typically take sharpness values as inputs and compute a corresponding set of sharpness values as a result. For the Uniform creasing method previously known as Normal , the computations may be so trivial as to question whether such an interface is worth it, but for Chaikin or other schemes in the future that are non-trivial, the benefits should be clear. Functionality is divided between both uniform and non-uniform, so clients have some control over avoiding unnecessary overhead, e.g. non-uniform computations typically require neighboring sharpness values around a vertex, while uniform does not. Also included as part of the Crease class is the Rule enum -- this indicates if a vertex is Smooth, Crease, Dart or Corner referred to as the mask in Hbr and is a function of the sharpness values at and around a vertex. Knowing the Rule for a vertex can accelerate mask queries, and the Rule can often be inferred based on the origin of a vertex e.g. it originated from the middle of a face, was the child of a Smooth vertex, etc.. Methods are defined for the Crease class to subdivide edge and vertex sharpness values determine the Rule for a vertex based on incident sharpness values determine the transitional weight between two sets of sharpness values Being all low-level and working directly on sharpness values, it is a clients responsibility to coordinate the application of any hierarchical crease edits with their computations. Similarly, in keeping with this as a low-level interface, values are passed as primitive arrays. This follows the trend in OpenSubdiv of dealing with data of various kinds e.g. weights, component indices, now sharpness values, etc. in small contiguous sets of values. In most internal cases we can refer to a set of values or gather what will typically be a small number of values on the stack for temporary use. Scheme-specific support While the SchemeTypeTraits class provides traits for each subdivision scheme supported by OpenSubdiv i.e. Bilinear , Catmark and Loop , the Scheme class provides these more directly, Additionally, the Scheme class provides methods for computing the various sets of weights used to compute new vertices resulting from subdivision. The collection of weights used to compute a single vertex at a new subdivision level is typically referred to as a mask . The primary purpose of the Scheme class is to provide such masks in a manner both general and efficient. Each subdivision scheme has its own values for its masks, and each are provided as specializations of the template class SchemeSchemeType TYPE . The intent is to minimize the amount of code specific to each scheme. The computation of mask weights for subdivided vertices is the most significant contribution of Sdc. The use of semi-sharp creasing with each non-linear subdivision scheme complicates what are otherwise simple masks determined solely by the topology, and packaging that functionality to achieve both the generality and efficiency desired has been a challenge. Mask queries are defined in the Scheme class template, which has specializations for each of the supported subdivision schemes. Mask queries are defined in terms of interfaces for two template parameters the first defining the topological neighborhood of a vertex, and a second defining a container in which to gather the individual weights template typename FACE , typename MASK void ComputeFaceVertexMask FACE const faceNeighborhood , MASK faceVertexMask , ... const Each mask query is expected to call methods defined for the FACE , EDGE or VERTEX classes to obtain the information they require typically these methods are simple queries about the topology and associated sharpness values. Clients are free to use their own mesh representations to gather the requested information as quickly as possible, or to cache some subset as member variables for immediate inline retrieval. In general, the set of weights for a subdivided vertex is dependent on the following the topology around the parent component from which the vertex originates the type of subdivision Rule applicable to the parent component the type of subdivision Rule applicable to the new child vertex a transitional weight blending the effect between differing parent and child rules This seems fairly straight-forward, until we look at some of the dependencies involved the parent Rule requires the sharpness values at and around the parent component the child Rule requires the subdivided sharpness values at and around the new child vertex though it can sometimes be trivially inferred from the parent the transitional weight between differing rules requires all parent and child sharpness values Clearly the sharpness values are inspected multiple times and so it pays to have them available for retrieval. Computing them on an as-needed basis may be simple for uniform creasing, but a non-uniform creasing method requires traversing topological neighborhoods, and that in addition to the computation itself can be costly. The point here is that it is potentially unreasonable to expect to evaluate the mask weights completely independent of any other consideration. Expecting and encouraging the client to have subdivided sharpness values first, for use in more than one place, is therefore recommended. The complexity of the general case above is also unnecessary for most vertices. Any client using Sdc typically has more information about the nature of the vertex being subdivided and much of this can be avoided -- particularly for the smooth interior case that often dominates. More on that in the details of the Scheme classes. Given that most of the complexity has been moved into the template parameters for the mask queries, the Scheme class remains fairly simple. Like the Crease class, it is instantiated with a set of Options to avoid them cluttering the interface. It is currently little more than a few methods for the limit and refinement masks for each vertex type, plus the few fixed traits of the scheme as static methods. The mask queries have been written in a way that greatly simplifies the specializations required for each scheme. The generic implementation for both the edge-vertex and vertex-vertex masks take care of all of the creasing logic, requiring only a small set of specific masks to be assigned for each Scheme smooth and crease masks for an edge-vertex, and smooth, crease and corner masks for a vertex-vertex. Other than the Bilinear case, which will specialize the mask queries to trivialize them for linear interpolation, the specializations for each Scheme should only require defining this set of masks -- and with two of them common edge-vertex crease and vertex-vertex corner the Catmark scheme only needs to define three. The FACE, EDGE and VERTEX interfaces Mask queries require an interface to a topological neighborhood, currently labeled FACE , EDGE and VERTEX . This naming potentially implies more generality than intended, as such classes are only expected to provide the methods required of the mask queries to compute its associated weights. While all methods must be defined, some may rarely be invoked, and the client has considerable flexibility in the implementation of these they can defer some evaluations lazily until required, or be pro-active and cache information in member variables for immediate access. An approach discussed in the past has alluded to iterator classes that clients would write to traverse their meshes. The mask queries would then be parameterized in terms of a more general and generic mesh component that would make use of more general traversal iterators. The advantage here is the iterators are written once, then traversal is left to the query and only what is necessary is gathered. The disadvantages are that clients are forced to write these to do anything, getting them correct and efficient may not be trivial or possible in some cases, and that the same data e.g. subdivided sharpness may be gathered or computed multiple times for different purposes. The other extreme was to gather everything possible required at once, but that is objectionable. The approach taken here provides a reasonable compromise between the two. The mask queries ask for exactly what they want, and the provided classes are expected to deliver it as efficiently as possible. In some cases the client may already be storing it in a more accessible form and general topological iteration can be avoided. The information requested of these classes in the three mask queries is as follows For FACE the number of incident vertices For EDGE the number of incident faces the sharpness value of the parent edge the sharpness values of the two child edges the number of vertices per incident face For VERTEX the number of incident faces the number of incident edges the sharpness value of the parent vertex the sharpness values for each incident parent edge the sharpness value of the child vertex the sharpness values for each incident child edge The latter should not be surprising given the dependencies noted above. There are also a few more to consider for future use, e.g. whether the EDGE or VERTEX is manifold or not. In most cases, additional information can be provided to the mask queries i.e. pre-determined Rules, and most of the child sharpness values are not necessary. The most demanding situation is a fractional crease that decays to zero -- in which case all parent and child sharpness values in the neighborhood are required to determine the proper transitional weight. The MASK interface Methods dealing with the collections of weights defining a mask are typically parameterized by a MASK template parameter that contains the weights. The set of mask weights is currently divided into vertex-weights, edge-weights and face-weights -- consistent with previous usage in OpenSubdiv and providing some useful correlation between the full set of weights and topology. The vertex-weights refer to parent vertices incident the parent component from which a vertex originated, the edge-weights the vertices opposite incident edges of the parent, and the face-weights the center of incident parent faces. Note the latter is NOT in terms of vertices of the parent but potentially vertices in the child originating from faces of the parent. This has been done historically in OpenSubdiv but is finding less use -- particularly when it comes to providing greater support for the Loop scheme -- and is a point needing attention. So the mask queries require the following capabilities assign the number of vertex, edge andor face weights retrieve the number of vertex, edge andor face weights assign individual vertex, edge andor face weights by index retrieve individual vertex, edge andor face weights by index through a set of methods required of all MASK classes. Since the maximum number of weights is typically known based on the topology, usage within Vtr, Far or Hbr is expected to simply define buffers on the stack. Another option is to utilize pre-allocated tables, partitioned into the three sets of weights on construction of a MASK , and populated by the mask queries. A potentially useful side-effect of this is that the client can define their weights to be stored in either single or double-precision. With that possibility in mind, care was taken within the mask queries to make use of a declared type in the MASK interface MASKWeight for intermediate calculations. Having support for double-precision masks in Sdc does enable it at higher levels in OpenSubdiv if later desired, and that support is made almost trivial with MASK being generic. It is important to remember here that these masks are being defined consistent with existing usage within OpenSubdiv both Hbr and the subdivision tables generated by Far . As noted above, the face weights correspond to the centers of incident faces, i.e. vertices on the same level as the vertex for which the mask is being computed, and not relative to vertices in the parent level as with the other sets of weights. It is true that the weights can be translated into a set in terms solely of parent vertices, but in the general case i.e. Catmark subdivision with non-quads in the base mesh this requires additional topological association. In general we would need N-3 weights for the N-3 vertices between the two incident edges, where N is the number of vertices of each face typically 4 even at level 0. Perhaps such a translation method could be provided on the mask class, with an optional indication of the incident face topology for the irregular cases. The Loop scheme does not have face weights , for a vertex-vertex mask, but for an edge-vertex mask it does require weights associated with the faces incident the edge -- either the vertex opposite the edge for each triangle, or its center which has no other use for Loop. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"sdc_overview.html\"\n- }, {\n- \"title\": \"3.0 - 3.5 Release Notes\",\n- \"text\": \"3.0 - 3.5 Release Notes 3.0 - 3.5 Release Notes 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Release 3.5 Release 3.5.0 - Sep 2022 Release 3.4 Release 3.4.4 - Feb 2021 Release 3.4.3 - Apr 2020 Release 3.4.0 - Jun 2019 Release 3.3 Release 3.3.3 - Jul 2018 Release 3.3.2 - Jun 2018 Release 3.3.1 - Feb 1018 Release 3.3.0 - Aug 2017 Release 3.2 Release 3.2.0 - Feb 2017 Release 3.1 Release 3.1.1 - Jan 2017 Release 3.1.0 - Oct 2016 Release 3.0 Release 3.0.5 - Mar 2016 Release 3.0.4 - Feb 2016 Release 3.0.3 - Oct 2015 Release 3.0.2 - Aug 2015 Release 3.0.1 - Aug 2015 Release 3.0.0 - Jun 2015 Release 3.0.0 RC2 Release 3.0.0 RC1 Previous 2.x Release Notes Release 3.5 Release 3.5.0 - Sep 2022 Release 3.5.0 is a significant release with new features, several configuration improvements, and a few other improvements and bug fixes. For more information on the following, see Release 3.5 Deprecation Announcements Hbr is deprecated and will be removed from subsequent releases New Features Simplified Surface Evaluation Bfr Tessellation Patterns Bfr Changes Suppression of GCC compiler warnings GitHub 1253, 1254, 1270 Additional methods for FarTopologyLevel GitHub 1227, 1255 Improved mixed partial derivative at Gregory patch corners GitHub 1252 Minor improvements to Far tutorials GitHub 1226, 1241 Added CMake config GitHub 1242 Updated CMake minimum version to 3.12 GitHub 1237, 1261 Updated documentation build scripts for Python 3 1265, 1266 Updated stringify build tool for improved cross compilation support GitHub 1267 Added NO_MACOS_FRAMEWORKS build option GitHub 1238 Updated Azure pipelines agents for Unbuntu and macOS GitHub 1247, 1256 Removed obsolete AppVeyor and Travis CI scripts GitHub 1259 Bug Fixes Cache active program for OsdGLComputeEvaluator GitHub 1244 Fixed member initialization warnings in OsdD3D11ComputeEvaluator GitHub 1239 Fixed GLSL shader source to remove storage qualifiers from struct members GitHub 1271 Fixed use of CMake variables for Apple builds GitHub 1235 Fixed build errors when using OpenGL without GLFW GitHub 1257 Fixed links to embedded videos GitHub 1231 Release 3.4 Release 3.4.4 - Feb 2021 Release 3.4.4 is a minor release including bug fixes and configuration improvements Changes The master branch on GitHub has been renamed release GitHub 1218 1219 The CMake configuration has been updated to allow use as a sub-project GitHub 1206 Removed obsolete references to hbr from examplesfarViewer GitHub 1217 Bug Fixes Fixed bug with sparse PatchTables and irregular face-varying seams GitHub 1203 Fixed loss of precision when using double precision stencil tables GitHub 1207 Fixed reset of FarTopologyRefinerGetMaxLevel after call to Unrefine GitHub 1208 Fixed linking with -ldl on unix systems GitHub 1196 Fixed naming and installation of macOS frameworks GitHub 1194 1201 Fixed GL version and extension processing and dynamic loading on macOS GitHub 1216 Fixed FindDocutils.cmake to be more robust GitHub 1213 1220 Fixed errors using build_scriptsbuild_osd.py with Python3 GitHub 1206 Release 3.4.3 - Apr 2020 Release 3.4.3 is a minor release including bug fixes and configuration improvements Changes GLEW is no longer required by default GitHub 1183 1184 Removed false Ptex link dependency from libosdCPU GitHub 1174 Removed false GLFW link dependency from DX11 and Metal examples GitHub 1178 Removed link dependency on unused TBB libraries GitHub 1064 Added option to disable building of dynamic shared libraries GitHub 1169 Added new tutorial for FarLimitStencilTable GitHub 1176 Updated use of EXT_direct_state_access to ARB_direct_state_access GitHub 1184 Fixed C strict aliasing warnings GitHub 1182 Fixed MSVC warnings in example code GitHub 1158 1172 Fixed compatibility with Visual Studio 2019 GitHub 1173 1189 Fixed CMake CMP0054 warnings GitHub 1180 Added prefix to OpenSubdiv CMake macros GitHub 1157 Moved utilities in examplescommon to regressioncommon GitHub 1167 Minor fixes to Far tutorials GitHub 1175 1177 Switched to Azure Pipelines for continuous integration testing instead of Travis-CI and AppVeyor GitHub 1168 1190 Bug Fixes Fixed selective boundary interpolation for case SdcOptionsVTX_BOUNDARY_NONE GitHub 1170 1171 Fixed static library linking to address missing symbols GitHub 1192 Additional fixes for dynamic and static linking GitHub 1193 Release 3.4.0 - Jun 2019 Release 3.4.0 is a significant release with several new features, bug fixes, and general code and configuration improvements. For more information on the following, please see Release 3.4 New Features Triangular Patches for Loop subdivision Improvements to Introductory Documentation Sparse Patch Tables and Adaptive Refinement Full Support for Double Precision in Far Changes Added new build script GitHub 1068 Added support for newer DirectX SDKs GitHub 1066 Patch arrays extended to support combined regular and irregular types GitHub 995 FarPatchTables and adaptive refinement supported for Bilinear scheme GitHub 1035 New FarPatchTableFactory method to determine adaptive refinement options GitHub 1047 New FarPatchTableFactory options to align primvar buffers of uniform tables GitHub 986 FarStencilTableUpdateValues overloaded to support separate base buffer GitHub 1011 FarLimitStencilTableFactory updated to create face-varying tables GitHub 1012 Regular patches on boundaries no longer require additional isolation GitHub 1025 Inclusion of OpenSubdiv header files in source code now consistent GitHub 767 Re-organization of and additions to Far tutorials GitHub 1083 examples now use common command-line conventions and parsing GitHub 1056 Bug Fixes Fixed FarPrimvarRefiner internal limitFVar prototype GitHub 979 Fixed FarStencilTable append when base StencilTable empty GitHub 982 Patches around non-manifold vertices now free of cracks GitHub 1013 Release 3.3 Release 3.3.3 - Jul 2018 Release 3.3.3 is bug-fix release addressing regressions from release 3.3.2 Bug Fixes Fixed a regression in PatchTable construction with varying patches GitHub 976 Fixed a regression in PatchTable construction for face-varying patches GitHub 972 Fixed a bug in the initialization of FarSourcePatch GitHub 971 Release 3.3.2 - Jun 2018 Release 3.3.2 is a minor release with potentially significant performance improvements to the patch pre-processing stages Changes Improved performance of PatchTable construction GitHub 966 The resulting improved accuracy will produce slight numerical differences in computations involving patches, e.g. StencilTable and PatchTable evaluation Bug Fixes FarPatchTableFactory now supports PatchTable construction with ENDCAP_BILINEAR_BASIS specified Release 3.3.1 - Feb 1018 Release 3.3.1 is a minor bug-fix release Bug Fixes Fixed GLSLHLSLMetal patch shader code to resolve degenerate normals GitHub 947 Fixed problems with face-varying patches in uniform PatchTables GitHub 946 Fixed integer overflow bugs for large meshes in PatchTable factories GitHub 957 Fixed computation of PatchParam for triangle refinement GitHub 962 Changes Added build options NO_GLFW and NO_GLFW_X11 Added additional shapes with infinitely sharp creases to the Metal and DX11 example viewers Disabled GL tests during CI runs on Linux Improved stability of examplesglImaging in CI runs by testing GL version Release 3.3.0 - Aug 2017 Release 3.3.0 is significant release adding an Osd implementation for Apples Metal API New Features Added an Osd implementation for Apples Metal API Added the mtlViewer example Changes Fixed several instances of local variable shadowing that could cause build warnings Updated continuous-integration build scripts and added testing on macOS Release 3.2 Release 3.2.0 - Feb 2017 Release 3.2.0 is a minor release containing API additions and bug fixes New Features Extended FarStencilTableFactory to support face-varying Extended Osd Evaluator classes to support evaluation of 1st and 2nd derivatives Added an option to disable generation of legacy sharp corner patches Changes Corrected numerous spelling errors in doxygen comments Updated glFVarViewer with improved error detection and command line parsing Added option to build using MSVC with static CRT Bug Fixes Fixed a double delete of GL program in OsdGLComputeEvaluator Release 3.1 Release 3.1.1 - Jan 2017 Release 3.1.1 is a minor bug-fix release. Bug Fixes Fixed a bug with non-manifold face-varying topology causing a crash during patch table creation Fixed GLEW compilation and linking with dynamic GLEW libraries on Windows Fixed GLFW linking with GLFW 3.2 on X11 platforms Release 3.1.0 - Oct 2016 Release 3.1.0 is a significant release with several new features, bug fixes, and general code and configuration improvements. For more information on the following, please see Release 3.1 New Features Bicubic Face-Varying Patches Varying and Face-Varying Evaluation Second Order Derivative Evaluation Separate Levels of Feature Isolation Sharp Patches for Infinitely Sharp Features Changes Enabled the use of CMakes folder feature Removed the use of iso646 alternative keywords and, or, not, etc. to improve portability Added numerical valued preprocessor directives OPENSUBDIV_VERSION_MAJOR, etc. to opensubdivversion.h Improved documentation for FarPatchParam and added Unnormalize to complement Normalize Added additional topology queries to FarTopologyLevel Updated glFVarViewer and glEvalLimit viewer to make use of bicubic face-varying patches Updated glViewer and dxViewer to add a toggle for InfSharpPatch Updated dxPtexViewer for improved feature parity with glPtexViewer Improved far_regression to exercise shapes independent of Hbr compatibility Added support for Appveyor continuous integration testing Removed cmakeFindIlmBase Removed mayaPolySmooth example Bug Fixes Fixed Ptex version parsing and compatibility issues Fixed compatibility issues with VS2015 Fixed bug interpolating face-varying data with Bilinear scheme Fixed bug with refinement using Chaikin creasing Fixed bugs with HUD sliders in the example viewers Release 3.0 Release 3.0.5 - Mar 2016 Release 3.0.5 is a minor stability release with performance and correctness bug fixes. Bug Fixes The previous release reduced transient memory use during PatchTable construction, but increased the amount of memory consumed by the resulting PatchTable itself, this regression has been fixed. The example Ptex texture sampling code has been fixed to prevent sampling beyond the texels for a face when multisample rasterization is enabled. Release 3.0.4 - Feb 2016 Release 3.0.4 is a minor stability release which includes important performance and bug fixes. New Features Added accessor methods to FarLimitStencilTable to retrieve limit stencil data including derivative weights Added support for OpenCL event control to OsdCLVertexBuffer and OsdCLEvaluator Changes Major reduction in memory use during FarPatchTable construction for topologies with large numbers of extraordinary features Improved performance for GL and D3D11 tessellation control hull shader execution when drawing BSpline patches with the single crease patch optimization enabled Bug Fixes Restored support for drawing with fractional tessellation Fixed far_tutorial_6 to refine primvar data only up to the number of levels produced by topological refinement Fixed build warnings and errors reported by Visual Studio 2015 Release 3.0.3 - Oct 2015 Release 3.0.3 is a minor stability release which includes important performance and bug fixes. New Features Smooth normal generation tutorial, far_tutorial_8 Changes Major performance improvement in PatchTable construction Improved patch approximations for non-manifold features Bug Fixes Fixed double delete in GLSL Compute controller Fixed buffer layout for GLSL Compute kernel Fixed GL buffer leak in OsdGLPatchTable Fixed out-of-bounds data access for TBB and OMP stencil evaluation Fixed WIN32_LEAN_AND_MEAN typo Fixed Loop-related shader issues glFVarViewer Release 3.0.2 - Aug 2015 Release 3.0.2 is a minor release for a specific fix. Bug Fixes Fixed drawing of single crease patches Release 3.0.1 - Aug 2015 Release 3.0.1 is a minor release focused on stability and correctness. Changes Added a references section to the documentation, please see References Removed references to AddVaryingWithWeight from examples and tutorials Added more regression test shapes Addressed general compiler warnings e.g. signed vs unsigned comparisons Addressed compiler warnings in the core libraries reported by GCCs -Wshadow Eased GCC version restriction, earlier requirement for version 4.8 or newer is no longer needed Replaced topology initialization assertions with errors Improved compatibility with ICC Improved descriptive content and formatting of Far error messages Improved build when configured to include no GPU specific code Bug Fixes Fixed handling of unconnected vertices to avoid out of bounds data access Fixed non-zero starting offsets for TbbEvalStencils and OmpEvalStencils Fixed FarStencilTableFactoryOptionsfactorizeIntermediateLevels Fixed FarPatchTablesFactoryOptionsgenerateAllLevels Fixed the behavior of VTX_BOUNDARY_NONE for meshes with bilinear scheme Fixed some template method specializations which produced duplicate definitions Disabled depth buffering when drawing the UI in the example viewers Disabled the fractional tessellation spacing option in example viewers since this mode is currently not supported Release 3.0.0 - Jun 2015 Release 3.0.0 is a major release with many significant improvements and changes. For more information on the following, please see Release 3.0 New Features Faster subdivision using less memory Support for non-manifold topology Face-Varying data specified topologically Elimination of fixed valence tables Single-crease patch for semi-sharp edges Additional irregular patch approximations Introduction of Stencil Tables Faster, simpler GPU kernels Unified adaptive shaders Updated coding style with namespaces More documentation and tutorials Bug Fixes Smooth Face-Varying interpolation around creases Release 3.0.0 RC2 New Features Documentation updates far_tutorial_3 updates for the multiple face-varying channels maya example plugin interpolates a UV channel and a vertex color channel Bug Fixes Fixed a LimitStencilTableFactory bug, which returns an invalid table PatchParam encoding changed to support refinement levels up to 10 Added Xinerama link dependency Fixed MSVC 32bit build problem Fixed minor cmake issues Fixed glViewerfarViewer stability bugs Release 3.0.0 RC1 Changes FarTopologyRefiner was split into several classes to clarify and focus the API. Interpolation of Vertex and Varying primvars in a single pass is no longer supported. The Osd layer was largely refactored. Previous 2.x Release Notes Previous releases Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"release_notes.html\"\n- }, {\n \"title\": \"Tutorials\",\n \"text\": \"Tutorials Tutorials 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Bfr Tutorials 1. Basic Evaluation and Tessellation Tutorial 1.1 Tutorial 1.2 Tutorial 1.3 Tutorial 1.4 Tutorial 1.5 2. More on Tessellation Tutorial 2.1 Tutorial 2.2 3. Additional Topics Tutorial 3.1 Tutorial 3.2 Far Tutorials 1. Basic Construction and Interpolation Tutorial 1.1 Tutorial 1.2 2. Uniform Refinement and Primvar Data Types Tutorial 2.1 Tutorial 2.2 Tutorial 2.3 3. Creating a Custom FarTopologyRefinerFactory Tutorial 3.1 4. Construction and Usage of FarStencilTables Tutorial 4.1 Tutorial 4.2 Tutorial 4.3 5. Construction and Usage of FarPatchTables Tutorial 5.1 Tutorial 5.2 Tutorial 5.3 Osd Tutorials Tutorial 0 Hbr Tutorials Tutorial 0 Tutorial 1 Tutorial 2 The tutorial source code can be found in the github.com repository or in your local repository roottutorials . Bfr Tutorials All tutorials for the Bfr interface follow a similar pattern without any command line arguments, a default mesh usually a cube is used and the results printed to standard output in Obj format. Command line arguments can be used to specify an alternate mesh for input, as well as directing the output to a specified Obj file. Some tutorials may offer additional command line options to trigger internal options relevant to the topic, e.g. those illustrating tessellation may support a -quads option to use the option to tessellate quad-bases subdivision meshes with quads. 1. Basic Evaluation and Tessellation Tutorial 1.1 This tutorial illustrates the use of BfrSurfaceFactory and BfrSurface to evaluate points on the limit of each face. The limit positions at all corners of the face are evaluated and connected to the limit position in the center of the face -- creating a simple triangular tessellation. code Tutorial 1.2 This tutorial shows the added use of BfrTessellation to identify the set of points and connectivity for a uniform tessellation. Both a Surface and Tessellation is identified for each face, with the Tessellation indicating which points are to be evaluated by the Surface. code Tessellation patterns for quad-based subdivision schemes can optionally preserve quads left or be fully triangulated center, while triangular schemes always yield triangles right Tutorial 1.3 This tutorial extends the previous tutorial on uniform Tessellation by adding face-varying Surfaces to compute corresponding UVs for each evaluated position. code Tutorial 1.4 This tutorial extends the previous tutorial on uniform tessellation of position and UV by illustrating how additional mesh data interleaved with the position and UV data is easily handled. code Tutorial 1.5 This tutorial is similar to the first tutorial showing uniform tessellation of position but makes use of limit stencils for its evaluation of points of the tessellation pattern. code 2. More on Tessellation Tutorial 2.1 This tutorial extends the use of Tessellation to illustrate the use of non-uniform tessellation rates per edge. A simple edge-length metric is used to determine the tessellation rate for each edge of a face. code The following contrasts uniform tessellation left with the resulting length-based tessellations -- preserving quads center and fully triangulated right Tutorial 2.2 This tutorial is a more complex extension of the use of Tessellation that illustrates how the separation and association of tessellation data with the boundary and interior of the face can be used. Limit points evaluated on the vertices and edges of a face the boundary of the Tessellation are computed once and shared with adjacent faces -- creating a topologically watertight tessellation of the mesh. code 3. Additional Topics Tutorial 3.1 This tutorial shows a basic example of the more advanced topic of creating a subclass of SurfaceFactory adapted to a connected mesh representation -- requiring an implementation of the SurfaceFactoryMeshAdapter interface for that mesh. A simplified version of the implementation of FarTopologyRefiner is provided. Note that the code imported here is that of the main program, not the separate header and source files of the custom subclass illustrated -- which current documentation scripts cannot import. Tutorial 3.2 This tutorial shows how to initialize and retain Surfaces for later use. The simple uniform tessellation tutorial is modified to first create and populate a simple caching structure that initializes and stores the Surfaces for all faces of the mesh. The loop for each face of the mesh then retrieves its Surface and associated patch points from the cache. code Far Tutorials 1. Basic Construction and Interpolation Tutorial 1.1 This tutorial presents the requisite steps to instantiate a mesh as a FarTopologyRefiner from simple topological data and to interpolate vertex data associated with the mesh. code Tutorial 1.2 This tutorial makes use of a different vertex data definition for use when vertex data is of arbitrary width. Uniform refinement is applied to data buffers of three types two of fixed but different sizes and the third a union of the two that is dynamically sized and constructed. code 2. Uniform Refinement and Primvar Data Types Tutorial 2.1 Building on the basic tutorial, this example shows how to instantiate a simple mesh, refine it uniformly and then interpolate both vertex and varying primvar data. code Tutorial 2.2 Building on the previous tutorial, this example shows how to instantiate a simple mesh, refine it uniformly and then interpolate both vertex and face-varying primvar data. The resulting interpolated data is output in Obj format, with the face-varying data recorded in the UV texture layout. code Tutorial 2.3 Building on previous tutorials, this example shows how to instantiate a simple mesh, refine it uniformly, interpolate both vertex and face-varying primvar data, and finally calculate approximated smooth normals. The resulting interpolated data is output in Obj format. code 3. Creating a Custom FarTopologyRefinerFactory Tutorial 3.1 Previous tutorials have instantiated topology from a simple face-vertex list via the FarTopologyDescriptor and its TopologyRefinerFactory. This tutorial shows how to more efficiently convert an existing high-level topology representation to a FarTopologyDescriptor with a custom factory class. code 4. Construction and Usage of FarStencilTables Tutorial 4.1 This tutorial shows how to create and manipulate a StencilTable. Factorized stencils are used to efficiently interpolate vertex primvar data buffers. code Tutorial 4.2 This tutorial shows how to create and manipulate StencilTables for both vertex and varying primvar data buffers vertex positions and varying colors. code Tutorial 4.3 This tutorial shows how to create and manipulate tables of cascading stencils to apply hierarchical vertex edits. code 5. Construction and Usage of FarPatchTables Tutorial 5.1 This tutorial shows how to compute points on the limit surface at arbitrary parametric locations using a FarPatchTable constructed from adaptive refinement. code Tutorial 5.2 Building on the previous tutorial, this example shows how to manage the limit surface of a potentially large mesh by creating and evaluating separate PatchTables for selected groups of faces of the mesh. code Tutorial 5.3 Building on the previous tutorials for both PatchTables and StencilTables, this example shows how to construct a LimitStencilTable to repeatedly evaluate an arbitrary collection of points on the limit surface. code Osd Tutorials Tutorial 0 This tutorial demonstrates the manipulation of Osd Evaluator and BufferDescriptor. code Hbr Tutorials Use of Hbr is no longer recommended -- these tutorials are included solely for historical reference. Tutorial 0 This tutorial presents, in a very succinct way, the requisite steps to instantiate an Hbr mesh from simple topological data. code Tutorial 1 This tutorial shows how to safely create Hbr meshes from arbitrary topology. Because Hbr is a half-edge data structure, it cannot represent non-manifold topology. Ensuring that the geometry used is manifold is a requirement to use Hbr safely. This tutorial presents some simple tests to detect inappropriate topology. code Tutorial 2 This tutorial shows how to subdivide uniformly a simple Hbr mesh. We are building upon previous tutorials and assuming a fully instantiated mesh we start with an HbrMesh pointer initialized from the same pyramid shape used in hbr_tutorial_0. We then apply the Refine function sequentially to all the faces in the mesh to generate several levels of uniform subdivision. The resulting data is then dumped to the terminal in Wavefront OBJ format for inspection. code Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"tutorials.html\"\n }, {\n+ \"title\": \"Sdc Overview\",\n+ \"text\": \"Sdc Overview Sdc Overview 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Subdivision Core Sdc Types, Traits and Options Creasing support Scheme-specific support The FACE, EDGE and VERTEX interfaces The MASK interface Subdivision Core Sdc Sdc is the lowest level layer in OpenSubdiv. Its intent is to separate the core subdivision details from any particular representation of a mesh it was previously bound to Hbr to facilitate the generation of consistent results with other mesh representations, both internal and external to OpenSubdiv. The functionality can be divided roughly into three sections types, traits and options for the supported subdivision schemes computations required to support semi-sharp creasing computations for mask weights of subdivided vertices for all schemes For most common usage, familiarity with only the first of these is necessary -- primarily the use of public types and constants for the choice of subdivision scheme and its associated options. The latter two provide the basis for a more comprehensive implementation of subdivision, which requires considerably more understanding and effort. Overall, the approach was to extract the functionality at the lowest level possible. In some cases, the implementation is not far from being simple global functions. The intent was to start at a low level and build any higher level functionality as needed. What exists now is functional for ongoing development and anticipated needs within OpenSubdiv for the near future. The intent of Sdc is to provide the building blocks for OpenSubdiv and its clients to efficiently process the specific set of supported subdivision schemes. It is not intended to be a general framework for defining customized subdivision schemes. Types, Traits and Options The most basic type is the enum SdcSchemeType that identifies the fixed set of subdivision schemes supported by OpenSubdiv Bilinear , Catmark and Loop . With this alone, we intend to avoid all dynamic casting issues related to the scheme by simply adding members to the associated subclasses for inspection. In addition to the type enum itself, a class defining a fixed set of traits associated with each scheme is provided. While these traits are available as static methods in the interface of a class supporting more functionality for each scheme to be described shortly, the SchemeTypeTraits provide queries of the traits for a variable of type SdcSchemeType -- enabling parameterization of code by the value of a trait without templates or virtual inheritance a simple internal table of traits is constructed and trivially indexed. The second contribution is the collection of all variations in one place that can be applied to the subdivision schemes, i.e. the boundary interpolation rules, creasing method, edge subdivision choices, etc. The fact that these are all declared in one place alone should help clients see the full set of variations that are possible. A simple Options struct a set of bitfields aggregates all of these variations into a single object the equivalent of an integer in this case that are passed around to other Sdc classes andor methods and are expected to be used at a higher level both within OpenSubdiv and externally. By aggregating the options and passing them around as a group, it allows us to extend the set easily in future without the need to rewire a lot of interfaces to accommodate the new choice. Clients can enable new choices at the highest level and be assured that they will propagate to the lowest level where they are relevant. Unlike other options structs used elsewhere to specify variations of a particular method, SdcOptions defines all options that affect the shape of the underlying limit surface of a subdivision mesh. Other operations at higher levels in the library may have options that approximate the shape and so create a slightly different appearance, but SdcOptions is a fundamental part of the definition of the true limit surface. Creasing support Since the computations involved in the support of semi-sharp creasing are independent of the subdivision scheme, the goal in Sdc was to encapsulate all related creasing functionality in a similarly independent manner. Computations involving sharpness values are also much less dependent on topology -- there are vertices and edges with sharpness values, but knowledge of faces or boundary edges is not required, -- so the complexity of topological neighborhoods required for more scheme-specific functionality is arguably not necessary here. Creasing computations have been provided as methods defined on a Crease class that is constructed with a set of Options. Its methods typically take sharpness values as inputs and compute a corresponding set of sharpness values as a result. For the Uniform creasing method previously known as Normal , the computations may be so trivial as to question whether such an interface is worth it, but for Chaikin or other schemes in the future that are non-trivial, the benefits should be clear. Functionality is divided between both uniform and non-uniform, so clients have some control over avoiding unnecessary overhead, e.g. non-uniform computations typically require neighboring sharpness values around a vertex, while uniform does not. Also included as part of the Crease class is the Rule enum -- this indicates if a vertex is Smooth, Crease, Dart or Corner referred to as the mask in Hbr and is a function of the sharpness values at and around a vertex. Knowing the Rule for a vertex can accelerate mask queries, and the Rule can often be inferred based on the origin of a vertex e.g. it originated from the middle of a face, was the child of a Smooth vertex, etc.. Methods are defined for the Crease class to subdivide edge and vertex sharpness values determine the Rule for a vertex based on incident sharpness values determine the transitional weight between two sets of sharpness values Being all low-level and working directly on sharpness values, it is a clients responsibility to coordinate the application of any hierarchical crease edits with their computations. Similarly, in keeping with this as a low-level interface, values are passed as primitive arrays. This follows the trend in OpenSubdiv of dealing with data of various kinds e.g. weights, component indices, now sharpness values, etc. in small contiguous sets of values. In most internal cases we can refer to a set of values or gather what will typically be a small number of values on the stack for temporary use. Scheme-specific support While the SchemeTypeTraits class provides traits for each subdivision scheme supported by OpenSubdiv i.e. Bilinear , Catmark and Loop , the Scheme class provides these more directly, Additionally, the Scheme class provides methods for computing the various sets of weights used to compute new vertices resulting from subdivision. The collection of weights used to compute a single vertex at a new subdivision level is typically referred to as a mask . The primary purpose of the Scheme class is to provide such masks in a manner both general and efficient. Each subdivision scheme has its own values for its masks, and each are provided as specializations of the template class SchemeSchemeType TYPE . The intent is to minimize the amount of code specific to each scheme. The computation of mask weights for subdivided vertices is the most significant contribution of Sdc. The use of semi-sharp creasing with each non-linear subdivision scheme complicates what are otherwise simple masks determined solely by the topology, and packaging that functionality to achieve both the generality and efficiency desired has been a challenge. Mask queries are defined in the Scheme class template, which has specializations for each of the supported subdivision schemes. Mask queries are defined in terms of interfaces for two template parameters the first defining the topological neighborhood of a vertex, and a second defining a container in which to gather the individual weights template typename FACE , typename MASK void ComputeFaceVertexMask FACE const faceNeighborhood , MASK faceVertexMask , ... const Each mask query is expected to call methods defined for the FACE , EDGE or VERTEX classes to obtain the information they require typically these methods are simple queries about the topology and associated sharpness values. Clients are free to use their own mesh representations to gather the requested information as quickly as possible, or to cache some subset as member variables for immediate inline retrieval. In general, the set of weights for a subdivided vertex is dependent on the following the topology around the parent component from which the vertex originates the type of subdivision Rule applicable to the parent component the type of subdivision Rule applicable to the new child vertex a transitional weight blending the effect between differing parent and child rules This seems fairly straight-forward, until we look at some of the dependencies involved the parent Rule requires the sharpness values at and around the parent component the child Rule requires the subdivided sharpness values at and around the new child vertex though it can sometimes be trivially inferred from the parent the transitional weight between differing rules requires all parent and child sharpness values Clearly the sharpness values are inspected multiple times and so it pays to have them available for retrieval. Computing them on an as-needed basis may be simple for uniform creasing, but a non-uniform creasing method requires traversing topological neighborhoods, and that in addition to the computation itself can be costly. The point here is that it is potentially unreasonable to expect to evaluate the mask weights completely independent of any other consideration. Expecting and encouraging the client to have subdivided sharpness values first, for use in more than one place, is therefore recommended. The complexity of the general case above is also unnecessary for most vertices. Any client using Sdc typically has more information about the nature of the vertex being subdivided and much of this can be avoided -- particularly for the smooth interior case that often dominates. More on that in the details of the Scheme classes. Given that most of the complexity has been moved into the template parameters for the mask queries, the Scheme class remains fairly simple. Like the Crease class, it is instantiated with a set of Options to avoid them cluttering the interface. It is currently little more than a few methods for the limit and refinement masks for each vertex type, plus the few fixed traits of the scheme as static methods. The mask queries have been written in a way that greatly simplifies the specializations required for each scheme. The generic implementation for both the edge-vertex and vertex-vertex masks take care of all of the creasing logic, requiring only a small set of specific masks to be assigned for each Scheme smooth and crease masks for an edge-vertex, and smooth, crease and corner masks for a vertex-vertex. Other than the Bilinear case, which will specialize the mask queries to trivialize them for linear interpolation, the specializations for each Scheme should only require defining this set of masks -- and with two of them common edge-vertex crease and vertex-vertex corner the Catmark scheme only needs to define three. The FACE, EDGE and VERTEX interfaces Mask queries require an interface to a topological neighborhood, currently labeled FACE , EDGE and VERTEX . This naming potentially implies more generality than intended, as such classes are only expected to provide the methods required of the mask queries to compute its associated weights. While all methods must be defined, some may rarely be invoked, and the client has considerable flexibility in the implementation of these they can defer some evaluations lazily until required, or be pro-active and cache information in member variables for immediate access. An approach discussed in the past has alluded to iterator classes that clients would write to traverse their meshes. The mask queries would then be parameterized in terms of a more general and generic mesh component that would make use of more general traversal iterators. The advantage here is the iterators are written once, then traversal is left to the query and only what is necessary is gathered. The disadvantages are that clients are forced to write these to do anything, getting them correct and efficient may not be trivial or possible in some cases, and that the same data e.g. subdivided sharpness may be gathered or computed multiple times for different purposes. The other extreme was to gather everything possible required at once, but that is objectionable. The approach taken here provides a reasonable compromise between the two. The mask queries ask for exactly what they want, and the provided classes are expected to deliver it as efficiently as possible. In some cases the client may already be storing it in a more accessible form and general topological iteration can be avoided. The information requested of these classes in the three mask queries is as follows For FACE the number of incident vertices For EDGE the number of incident faces the sharpness value of the parent edge the sharpness values of the two child edges the number of vertices per incident face For VERTEX the number of incident faces the number of incident edges the sharpness value of the parent vertex the sharpness values for each incident parent edge the sharpness value of the child vertex the sharpness values for each incident child edge The latter should not be surprising given the dependencies noted above. There are also a few more to consider for future use, e.g. whether the EDGE or VERTEX is manifold or not. In most cases, additional information can be provided to the mask queries i.e. pre-determined Rules, and most of the child sharpness values are not necessary. The most demanding situation is a fractional crease that decays to zero -- in which case all parent and child sharpness values in the neighborhood are required to determine the proper transitional weight. The MASK interface Methods dealing with the collections of weights defining a mask are typically parameterized by a MASK template parameter that contains the weights. The set of mask weights is currently divided into vertex-weights, edge-weights and face-weights -- consistent with previous usage in OpenSubdiv and providing some useful correlation between the full set of weights and topology. The vertex-weights refer to parent vertices incident the parent component from which a vertex originated, the edge-weights the vertices opposite incident edges of the parent, and the face-weights the center of incident parent faces. Note the latter is NOT in terms of vertices of the parent but potentially vertices in the child originating from faces of the parent. This has been done historically in OpenSubdiv but is finding less use -- particularly when it comes to providing greater support for the Loop scheme -- and is a point needing attention. So the mask queries require the following capabilities assign the number of vertex, edge andor face weights retrieve the number of vertex, edge andor face weights assign individual vertex, edge andor face weights by index retrieve individual vertex, edge andor face weights by index through a set of methods required of all MASK classes. Since the maximum number of weights is typically known based on the topology, usage within Vtr, Far or Hbr is expected to simply define buffers on the stack. Another option is to utilize pre-allocated tables, partitioned into the three sets of weights on construction of a MASK , and populated by the mask queries. A potentially useful side-effect of this is that the client can define their weights to be stored in either single or double-precision. With that possibility in mind, care was taken within the mask queries to make use of a declared type in the MASK interface MASKWeight for intermediate calculations. Having support for double-precision masks in Sdc does enable it at higher levels in OpenSubdiv if later desired, and that support is made almost trivial with MASK being generic. It is important to remember here that these masks are being defined consistent with existing usage within OpenSubdiv both Hbr and the subdivision tables generated by Far . As noted above, the face weights correspond to the centers of incident faces, i.e. vertices on the same level as the vertex for which the mask is being computed, and not relative to vertices in the parent level as with the other sets of weights. It is true that the weights can be translated into a set in terms solely of parent vertices, but in the general case i.e. Catmark subdivision with non-quads in the base mesh this requires additional topological association. In general we would need N-3 weights for the N-3 vertices between the two incident edges, where N is the number of vertices of each face typically 4 even at level 0. Perhaps such a translation method could be provided on the mask class, with an optional indication of the incident face topology for the irregular cases. The Loop scheme does not have face weights , for a vertex-vertex mask, but for an edge-vertex mask it does require weights associated with the faces incident the edge -- either the vertex opposite the edge for each triangle, or its center which has no other use for Loop. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"sdc_overview.html\"\n+ }, {\n \"title\": \"Release Notes\",\n \"text\": \"Release Notes Release Notes 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Release 2.6.0 Release 2.5.1 Release 2.5.0 Release 2.4.1 Release 2.4.0 Release 2.3.5 Release 2.3.4 Release 2.3.3 Release 2.3.2 Release 2.3.1 Release 2.3.0 Release 2.2.0 Release 2.1.0 Release 2.0.1 Release 2.0.0 Release 1.2.4 Release 1.2.3 Release 1.2.2 Release 1.2.1 Release 1.2.0 Release 1.1.0 Release 1.0.0 Release 2.6.0 New Features Add subdivision kernels for ARM NEON Add OsdUtilVertexSplit which creates a vertex-varying data table by duplicating vertices in a FarMesh Add basic functions to work with FV data via evaluator API Changes Added Catmark restricted vertex compute kernels that optimize for vertices with no semi-sharp creases Fix accessor omissions in osdmesh.h Add support for different subdivision schemes for OsdUtilMesh Bug Fixes Fix crashes when using rather low-end cards like Intel ones Fix a bug in the creation of an edge-vertex kernel batch Fix mismatch in declaration and usage of OsdCudaComputeRestrictedVertexA Fix a bug in the vertex order for restricted Catmark vertex-vertex kernel batches Fix a bug in FarCatmarkSubdivisionTablesFactory that prevented the CATMARK_QUAD_FACE_VERTEX kernel from being selected for subdivision level 2 or greater. Fix a bug in OsdUtilVertexSplit that occurs when getting the address of the end of a stdvector Fix error in createCLBuffer that occurs when the buffer size is zero Fix a bug in the CUDA computeRestrictedEdge kernel Fix duplicate variables with identical name Fix osdutil build errors Fix cmake diagnostic messsage Release 2.5.1 New Features Add CATMARK_QUAD_FACE_VERTEX and CATMARK_TRI_QUAD_FACE_VERTEX compute kernels optimization that takes advantage of all-quads or all-triange-and-quads meshes Bug Fixes Fix a compiler error in the GLSL Transform Feedback kernels on OS X Fix boundary interpolation in osdutil Fix bilinear stencil tangent computions Release 2.5.0 New Features Add ability to generate triangle patches for a uniformly subdivided mesh Add new example topologySharing Add interleaved buffer mode in glViewer Add GLSL compute kernel to glBatchViewer Add TBB compute kernel to glBatchViewer Add a PullDown widget to our HUD in examplescommon GUI updates cosmetic changes to GL example code Adding a programmable image shader to gl_hud Code cleanup for GLFrameBuffer in examplescommon Implement C-API accessor to evaluator topology osdutil Add command line option to CMakes options Add a CMake option to disable OpenCL Add a FindCLEW.cmake module in anticipation of using CLEW as a dependency Integrate CLEW into osd library and examples Changes Change interleaved buffer support in OsdCompute Removed OsdVertexDescriptor and replaced with OsdVertexBufferDescriptor Reorganize ComputeContext and ComputeController. Reorganize EvalStencilContext and EvalStencilController Moved transient states current vertex buffer etc to controller Reorganize EvalLimitContext and EvalLimitController Moved transient states current vertex buffer etc to controller Fix adaptive isolation of sharp corner vertices Fix incorrect FarMeshFactory logic for isolating multiple corner vertices in corner patches Change EvalLimit Gregory patch kernels to the large weights table to accomodate higher valences Fix calculation of screen space LOD tess factors for transition corner patches. Add a public constructor to OsdMesh Decrease compiler warning thresholds and fix outstanding warnings Make PTex support optional Add a NO_MAYA flag to CMakeLists to disable all Autodesk Maya dependencies in the build Document NO_MAYA command line option Bug Fixes Fix mistakenly deleted memory barrier in glsl OsdCompute kernel. Fix shape_utils genRIB function to use streams correctly. Temporary workaround for the synchronization bug of glsl compute kernel Fix Hud display for higher DPI MBP retina Fix Hud d3d11 Fix examples to use GL timer query to measure the GPU draw timing more precisely Fix glViewer stop updating during freeze. Fix file permissions on farPatchTablesFactory.h Fix some meory leaks in adaptive evaluator osdutil Fix OsdUtilAdaptiveEvaluator concurrency issue Fix OsdUtilRefiner incorrect Invalid size of patch array error reporting. Fix OsdUtilPatchPartitioner failure for triangle patches Fixes a bug that causes OsdUtilPatchPartitioner to fail to rebuild the face-varying data table correctly for triangle patches. Add missing third parameter to templated OsdDrawContext usage osdutilbatch.h Return success status from openSubdiv_finishEvaluatorDescr osdutil Remove debugging stdcout calls osdutil Build errors warnings Fix OSX Core Profile build GLFrameBuffer Fix ptexViewer build error on OSX Fix framebuffer shader compiling for OSX Reordering includes to address a compile error on OSXglew environment Fix compilation errors with CLEW enabled Fix icc build problems Fix compiler warnings in OsdClVertexBuffer Fix compilation error on windowsmsvc2013 Fix build warningserrors with VS2010 Pro Fix Windows build warning in FarPatchTablesFactory Fix doxygen generation errors Release 2.4.1 Changes Add correct OpenSubdiv namespace beginend blocks. Bug Fixes Compile osdutil with -fPIC for correct linking. Fix a bug of OsdUtilMeshBatch, the varying buffer isnt computed with CL kernels Fix FindGLFW.cmake to use the GLFW_LOCATION environment variable in Windows Fix Draw contexts do not fully initialize patch arrays Release 2.4.0 New Features Adding functionality to store uniform face-varying data across multiple levels of subdivision Add OsdUtilPatchPartitioner. It splits patcharray into subsets so that clients can draw partial surfaces for both adaptive and uniform. Changes Remove FarMesh dependency from OsdContext. Use DSA APIs for GL buffer update if available. Refactor Far API replace void- of all kernel applications with CONTEXT template parameter. It eliminates many static_casts from void- for both far and osd classes. move the big switch-cases of far default kernel launches out of Refine so that osd controllers can arbitrary mix default kernels and custom kernels. change FarKernelBatchkernelType from enum to int, clients can add custom kernel types. remove a back-pointer to farmesh from subdivision table. untemplate all subdivision table classes and template their compute methods instead. Those methods take a typed vertex storage. remove an unused argument FarMesh from the constructor of subdivision table factories. Refactor FarSubdivisionTables. Delete scheme specialized subdivision tables. The base class FarSubdivisionTables already has all tables, so we just need scheme enum to identify which scheme the subdivision tables belong to. This brings a lot of code cleanups around far factory classes. Move FarMultiMeshFactory to OsdUtil. Move table splicing functions of FarMultiMeshFactory into factories Change PxOsdUtil prefix to final OsdUtil prefix. Improve error reporting in osdutil refinement classes, and fix a build issue Bug Fixes Fix another multi mesh splicing bug of face varying data. Make CMake path variables more robust Fixing a crash on Marvericks wglew Update dxViewer example documentation Fix wrong logic in openSubdiv_setEvaluatorCoarsePositions Remove debug print from adaptive evaluators initialization Release 2.3.5 New Features Add the ability to read obj files to the dxViewer example Add screen-capture function to ptexViewer Update documention for Xcode builds Add documentation boundary interpolation rules and face-varying boundary interpolation rules Changes Refactoring FarPatchTables and FarPatchTablesFactory Move GL vertex buffer VBO buffer allocation out of allocate and into BindVBO Enable uvViewer on OS X now that Mavericks is released. Replacing un-necessary dynamic_cast with reinterpret_cast within FarDispatcher Minor code cleanup of FarMeshFactory Remove address space qualifiers from OpenCL kernel functions Fix OpenCL initialization to be slightly more robust Add OpenCL header include paths where necessary Add static specifiers for non-kernel CL funcs at program scope Add stddef.h to pythonosdosdshim.i Modify ptexViewer and uvViewer shaders to address some portability issues Bug Fixes Fix Gregory Boundary patch buffer overrun Fix black texels when the resolution of a ptex face is less than 4 Fix a splicing bug in FarMultiMeshFactory Fix a build error when using older versions of GLFW Fix build warnings optimized Fix FindTBB.cmake Fix FindMaya.cmake Fix glViewer support for GLSL compute Fix ptexViewer enable specular pass in both IBL and point lighting Fix Zlib include in ptexViewer Fix ptexViewer shader errors. Fix osdPolySmooth Maya plugin Fix UV merging in osdPolySmooth code example Add cleanup function to osdPolySmooth Maya plugin Fix Maya OsdPolySmooth node component output Fix GLSL array instantiation syntax for glStencilViewer Fix examples to run correctly on high DPI displays with GLFW 3 Release 2.3.4 New Features Adding CPUOMPTBB Context Controller pairs for CPU evaluation of smooth normals Added adaptiveEvaluator class inspired by Sergeys work in blender OsdUtil Changes Changed the HUD to ignore mouse clicks when not visible. Updates for blender development OsdUtil Add C compatible API to access the adaptiveEvaluator class from non-C OsdUtil Update license headers to apache OsdUtil CMake build improvement make osd a cmake object library remove compiling redundancies Improve stringification of shaders kernels in CMake build Bug Fixes Fixed iOS build Fixed VS2010 warningserrors. Fix OsdCpuEvalLimitKernel Fix maxvalence calculation in FarMeshFactory Fix FarStencilFactory control stencil caching Removing assert for high-valence vertices running off limit tangent pre-computed table. Fix degenerate stencil limit tangent code path. Fix unused variable build warnings gcc 4.8.2 - Fedora 19 Fix build warning from osdutiladaptiveEvaluator.cpp Release 2.3.3 Changes Modify Far remapping of singular vertices to point to their source vertex. Refactoring Ptex Mipmap and Analytic Displacement code Adding some documentation for Chaikin crease rule Misc. improvements to PxOsdUtilsMesh Adding recommended isolation output to OsdPolySmooth node Bug Fixes Adding an error check on version parsing of main CMakeLists Fix regex in FindMaya.cmake that breaks with recent versions of Maya Fix crashes induced by typeid Fixed VS2010 build warning Fix build break in hbr_regression Fix incorrect capitalization in GL ptexViewer shader.glsl Fix OSX build add stdlib.h include Release 2.3.2 New Features Adding control cage drawing to ptexViewer Adding Maya osdPolySmooth plugin into OpenSubdiv examples. Changes Removing some glGetError checks that are causing problems for Autodesk D3D11DrawRegistry returns the common shader config for all non-tess patcharrays. Updates to simple cpu osdutil classes Bug Fixes Fix Hbr Chaikin crease rule Fix Chaikin tag parsing Fix return value of allocate function for OsdCPUGLVertxBuffer Fixed GLSL shader portability. Fix FindGLFW.cmake for GLFW 3.03 on OSX Fixed compiler warnings. Fixed VS2010 build errors Fixed WIN32 build error when no DXSDK installed. Fix OSX build stdlib.h needs to be included in glPtexMipmapTexture.h Fix for crash in new meshrefiner code in OsdUtil Release 2.3.1 New Features Add DX11 version of ptex mipmap loader Add DX11 ptex viewer work in progress Add DX11 fractional partitioning, normal derivatives computation Add memory usage controls to Ptex loader Add face-varying boundary interpolation parsing to shape_utils Add simple HbrMesh and FarMesh wrapper classes to osdutil Changes Amend language of attribution file NOTICE.txt Optimize a bit of ptex mipmap lookup. Show ptex memory usage in GL and DX11 ptexViewers Improve ptex guttering Addding some video links to our collection of external resources Bug Fixes Fix edge-only face-varying interpolation Fix Far to handle disconnected vertices in an Hbr mesh Fixed ptex cache resource release sequence Fix build symbol conflict in Far Fix patch parambuffer generation in OsdD3D11DrawContext Fix a minor osdutil build warning seen with gcc 4.8.1 Fix VS2010 build errors Release 2.3.0 New Features Added Analytical displacement mapping Analytic Displacement Mapping using Hardware Tessellation Niessner and Loop TOG 2013 Added a new ptex mipmap loader Added face varying macros for loop subdivision Added the uvViewer example to see how face varying interpolation rule works Added a slider component and cleanup hud code. Changes Adding license attribution files, improved language of the code headers Install documentation into the Filesystem Hierarchy Standard location Set GLFW_OPENGL_FORWARD_COMPAT on Mac OS to make samples work on that platform Added surface normal mode mipmap to ptxViewer Bug Fixes Fix a bug of bad fvar splicing for loop surface. Fix incorrect bilinear limit tangents in FarStencilTablesFactory Fix boundary interpolation rules doc Added an error check on updating cuda buffer Fix face varying rendering on loop surface Fixed glBatchViewer build for GLFW 2.x Expand search paths for FindGLFW.cmake for Debian and other Linux architectures Fix CMake executable builds for ICC Fix bhr baseline regression, so reference files are real OBJs Fixed clKernelBundle.cpp to build on Android. Fix misc build warings Release 2.2.0 New Features Added subdivision stencil functionality Far OsdEval Bug Fixes Fix D3D11DrawContext to check for NULL pointers Fix cpuEvalLimitController crash bug Fixed search path suffixes for ICC libs Fixed invalid initialization of glslTransformFeedback kernel. Release 2.1.0 New Features Added TBB Compute back-end on Linux contribution from Sheng Fu Added support for ICC compiler still Beta Changes Added constructor to OsdMesh with a FarMesh as input Modify CMake to name and sym-link DSOs based on Linux ABI versioning spec Added command line input to DX11 viewer FarMultiMesh can splice uniform and adaptive meshes together. Bug Fixes Fix FarMultiMesh splicing Removed unnecessary cudaThreadSynchronize calls. Fix glViewer overlapping HUD menus Fix facevarying rendering in glBatchViewer Fix build of GLSL transform feedback kernels Fix Getting Started documentation Release 2.0.1 New Features New CLA files to reflect Apache 2.0 licensing Changes Move all public headers to includeopensubdiv... Adding Osd documentation based on Siggraph slides Bug Fixes Fix incorrect transition pattern 3 in GLSL HLSL shaders Fix CMake build to not link GPU-based libraries into libosdCPU Fix support for GLEW on OSX Fix GLFW Xrandr xf86vmode dependency paths for X11 based systems Fix HUD display overlaps in code examples Fix FindGLEW.cmake to be aware of multiarch on linux systems Fix some hard-coded include paths in CMake build Release 2.0.0 New Features New CMake build flags NO_LIB, NO_CUDA, NO_PYTHON Changes OpenSubdiv is now under Apache 2.0 license HbrHalfedge and HbrFVarData copy constructors are now private Documentation style matched to graphics.pixar.com new content Add an animation freeze button to ptexViewer Variable name changes for better readability across all example shader code Bug Fixes Fix incorrect patch generation for patches with 2 non-consecutive boundary edges Fix undefined gl_PrimitiveID shader build errors Fix for shader macro OSD_DISPLACEMENT_CALLBACK Fix out-of-bounds stdvector access in FarPatchTablesFactory Release 1.2.4 New Features Adding support for fractional tessellation of patches Adding a much needed API documention system based on Docutils RST markup Adding support for face-varying interpolation in GLSL APIs Adding varying data buffers to OsdMesh Adding accessors to the vertex buffers in OsdGlMesh Adding face-varying data to regression shapes Changes Cleanup of common bicubic patch shader code GLSL HLSL for portability ATI OSX drivers Bug Fixes Fix FarVertexEditTablesFactory to insert properly vertex edit batches fixes incorrect hierarchical hole in regression shape Fix FarPatchMap quadtree to not drop top-level non-quad faces Fix Gregory patches bug with incorrect max-valence Fix FarPatchTablesGetNumFaces and FarPatchTablesGetFaceVertices functions to return the correct values Fix face indexing GLSL code ptex works on non-quads again Fix face-varying data splicing in FarMultiMeshFactory Fix ptex face indexing in FarMultiMeshFactory Fix glew include to not break builds Fix Clang ICC build failures with FarPatchTables Fix build and example code to work with GFLW 3.0 Fix cmake to have ptex dynamically linked in OSX Release 1.2.3 New Features Adding Varying and Face-Varying data interpolation to EvalLimit Changes EvalLimit API refactor the EvalContext now has dedicated structs to track all the vertex, varying and face-varying data streams. Also renamed some buffers into tables to maintain code consistency EvalLimit optimization switch serial indexing to a quad-tree based search Bug Fixes Face-varying data bug fixes making sure the data is carried around appropriately Fixes for OpenCL use with the new batching APIs GLSL general shader code cleanup fixes for better portability GLSL Tranform Feedback initialization fix Critical fix for FarMultiMesh batching indexing was incorrect Fix osdutil CL implementation protect includes on systems with no OpenCL SDK installed Fix face-varying interpolation on adaptive patches FarPatchTables fix IsFeatureAdaptive to return the correct answer Fix Far factories to handle the absence of face-varying data correctly. Many GLSL shader code style fixes which should help with ATI OSX shader compiling Release 1.2.2 New Features Introducing the EvalLimit API the Eval module aims at providing support for computational tasks that are not related to drawing the surfaces. The EvalLimit sub-module provides an API that enables client code to evaluate primitive variables on the limit surface. OsdxxxComputeController minor optimization. Added early exit to Refine method to avoid unnecessary interop. Changes OsdGLDawContext minor API change. Protecting some member variables and adding const accessors OsdError minor API refactor, added Warning functions. Bug Fixes Fix Ptex bug prevent corner texel guttering code to from going into infinite loops Adding the ability for a FarMeshFactory to construct patchTables starting from firstLevel in uniform subdivision mode Consolidating the color coding of bicubic patch types through all our our code examples this is used mostly as a debugging tool Fixing some MSVC build warnings Update to the outdated README.md Release 1.2.1 New Features Added CUDA runtime error checking Release 1.2.0 Changes Major Far refactor around patchTables to introduce the draw batching API Renaming osd_util to osdutil Bug Fixes Fix GLSL transform feedback initialization bug in ptexViewer Minor bug typo fixes Release 1.1.0 New Features release initiated because of the switch to Git Flow Release 1.0.0 Oringal release Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_notes_2x.html\"\n }, {\n- \"title\": \"Overview of Release 3.4\",\n- \"text\": \"Overview of Release 3.4 Overview of Release 3.4 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Triangular Patches for Loop Subdivision Major Improvements to Introductory Documentation Sparse Patch Tables Support for Double Precision in Far API Additions Far extensions for triangular patches Construction and refinement of topology Construction and interface of FarPatchTable Construction and use of Far stencil tables Far class templates for double precision Far member functions converted to templates for double precision OsdMeshBits OsdPatchArray Osd extensions for patch evaluation common to all shaders Osd extensions for patch tessellation common to all shaders Other Changes Improvements Bug Fixes New Features Triangular Patches for Loop Subdivision Support for the drawing and evaluation of Loop subdivision meshes with triangular patches was added. This includes the full set of Far and Osd interfaces for both evaluation and drawing. The feature set supported for Loop subdivision now matches that of Catmark, including creases, face-varying patches, non-manifold topology, etc. The long standing requirement that Loop meshes be purely triangular remains, as Loop subdivision is not defined for non-triangular faces. And as is the case with the use of the Catmark scheme, application of Loop subdivision to dense, poorly modeled meshes may lead to unexpectedly poor performance andor surface quality. The patch representation used for Loop subdivision is intended to exactly match the underlying limit surface where regular, and so uses quartic triangular Box-splines. This is in contrast to approaches that use simpler patches to approximate the Loop limit surface everywhere. As with Catmark, Gregory patches are used to approximate irregular areas. Though other choices are available that compromise surface quality in favor of improved performance, they may be less effective with Loop than they are with Catmark. Major Improvements to Introductory Documentation A significant rewrite of the Subdivision Surfaces page is included in this release. The new documentation emphasizes the piecewise parametric surface nature of subdivision surfaces and the implications of supporting arbitary topology . As a true surface primitive, the distinction between the control points and the limit surface and the corresponding operations of subdivision and tessellation that are applied to them is made clear. Sparse Patch Tables Interfaces in Far for the construction of PatchTables and the required adaptive refinement have been extended to apply to an arbitrary subset of faces. This allows patches for either large meshes or meshes that may otherwise benefit from some kind of partioning e.g. areas of static and dynamic topology to be managed in an arbitrary number of groups. In the extreme, a PatchTable forming the tree of patches for a single base face can be constructed. Client data buffers for the base mesh do not need to be partitioned and base mesh topology can be shared by multiple instances of FarTopologyRefiner used to create corresponding instances of FarPatchTables. See the new Far tutorial 5.2 for a simple example. Support for Double Precision in Far Classes and interfaces in Far have been adapted to allow support for double precision via templates parameterized for float or double. Class templates for major classes such as FarStencilTable have been introduced and the original classes preserved for compatibility. Other classes such as FarPatchTable have had methods overloaded or replaced with template functions to support both single and double precision. Internally, all use of floating point constants and math library functions has been adapted to maximize accuracy appropriate to the precision of the template instance. Interfaces in Osd have not been extended. The extensions in Far provide the basis for extensions in Osd, but demand is limited. For those benefiting from such Osd extensions, contributions are welcomed. See the revised Far tutorial 5.1 that constructs a FarPatchTable for a simple example. API Additions See associated Doxygen for full details. Far extensions for triangular patches enum PatchDescriptorTypeGREGORY_TRIANGLE PatchParamNormalizeTriangle PatchParamUnnormalizeTriangle PatchParamIsTriangleRotated Construction and refinement of topology overloaded TopologyRefinerFactoryCreate extensions to TopologyRefinerRefineAdaptive Construction and interface of FarPatchTable overloaded PatchTableFactoryCreate PatchTableFactoryGetRefineAdaptiveOptions member PatchTableFactoryOptionsincludeBaseLevelIndices member PatchTableFactoryOptionsincludeFVarBaseLevelIndices member PatchTableFactoryOptionsgenerateVaryingTables member PatchTableFactoryOptionsgenerateVaryingLocalPoints member PatchTableFactoryOptionssetPatchPrecisionDouble member PatchTableFactoryOptionssetFVarPatchPrecisionDouble PatchTableGetFVarPatchDescriptorRegular PatchTableGetFVarPatchDescriptorIrregular PatchTableGetFVarValueStride Construction and use of Far stencil tables overloaded StencilTableUpdateValues enum LimitStencilTableFactoryMode member LimitStencilTableFactoryOptionsinterpolationMode member LimitStencilTableFactoryOptionsfvarChannel Far class templates for double precision class StencilReal class StencilTableReal class StencilTableFactoryReal class LimitStencilReal class LimitStencilTableReal class LimitStencilTableFactoryReal class PrimvarRefinerReal Far member functions converted to templates for double precision PatchParamNormalize PatchParamUnnormalize PatchTableEvaluateBasis PatchTableEvaluateBasisVarying PatchTableEvaluateBasisFaceVarying PatchTableGetLocalPointStencilTable PatchTableGetLocalPointVaryingStencilTable PatchTableGetLocalPointFaceVaryingStencilTable PatchMapFindPatch OsdMeshBits enumeration MeshEndCapBilinearBasis OsdPatchArray GetDescriptorRegular GetDescriptorIrregular GetPatchTyperRegular GetPatchTyperIrregular GetStride Osd extensions for patch evaluation common to all shaders struct OsdPatchArray and OsdPatchArrayInit struct OsdPatchCoord and OsdPatchCoordInit struct OsdPatchParam and OsdPatchParamInit OsdPatchParamGetFaceId OsdPatchParamGetU OsdPatchParamGetV OsdPatchParamGetTransition OsdPatchParamGetBoundary OsdPatchParamGetNonQuadRoot OsdPatchParamGetDepth OsdPatchParamGetParamFraction OsdPatchParamIsRegular OsdPatchParamIsTriangleRotated OsdPatchParamNormalize OsdPatchParamUnnormalize OsdPatchParamNormalizeTriangle OsdPatchParamUnnormalizeTriangle OsdEvaluatePatchBasisNormalized OsdEvaluatePatchBasis Osd extensions for patch tessellation common to all shaders OsdInterpolatePatchCoordTriangle OsdComputePerPatchVertexBoxSplineTriangle OsdEvalPatchBezierTriangle OsdEvalPatchGregoryTriangle OsdGetTessLevelsUniformTriangle OsdEvalPatchBezierTessLevels OsdEvalPatchBezierTriangleTessLevels OsdGetTessParameterizationTriangle Other Changes Improvements Added new build script GitHub 1068 Added support for newer DirectX SDKs GitHub 1066 Patch arrays extended to support combined regular and irregular types GitHub 995 FarPatchTables and adaptive refinement supported for Bilinear scheme GitHub 1035 New FarPatchTableFactory method to determine adaptive refinement options GitHub 1047 New FarPatchTableFactory options to align primvar buffers of uniform tables GitHub 986 FarStencilTableUpdateValues overloaded to support separate base buffer GitHub 1011 FarLimitStencilTableFactory updated to create face-varying tables GitHub 1012 Regular patches on boundaries no longer require additional isolation GitHub 1025 Inclusion of OpenSubdiv header files in source code now consistent GitHub 767 Re-organization of and additions to Far tutorials GitHub 1083 Examples now use common command-line conventions and parsing GitHub 1056 Bug Fixes Fixed FarPrimvarRefiner internal limitFVar prototype GitHub 979 Fixed FarStencilTable append when base StencilTable empty GitHub 982 Patches around non-manifold vertices now free of cracks GitHub 1013 Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"3.0 - 3.5 Release Notes\",\n+ \"text\": \"3.0 - 3.5 Release Notes 3.0 - 3.5 Release Notes 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Release 3.5 Release 3.5.0 - Sep 2022 Release 3.4 Release 3.4.4 - Feb 2021 Release 3.4.3 - Apr 2020 Release 3.4.0 - Jun 2019 Release 3.3 Release 3.3.3 - Jul 2018 Release 3.3.2 - Jun 2018 Release 3.3.1 - Feb 1018 Release 3.3.0 - Aug 2017 Release 3.2 Release 3.2.0 - Feb 2017 Release 3.1 Release 3.1.1 - Jan 2017 Release 3.1.0 - Oct 2016 Release 3.0 Release 3.0.5 - Mar 2016 Release 3.0.4 - Feb 2016 Release 3.0.3 - Oct 2015 Release 3.0.2 - Aug 2015 Release 3.0.1 - Aug 2015 Release 3.0.0 - Jun 2015 Release 3.0.0 RC2 Release 3.0.0 RC1 Previous 2.x Release Notes Release 3.5 Release 3.5.0 - Sep 2022 Release 3.5.0 is a significant release with new features, several configuration improvements, and a few other improvements and bug fixes. For more information on the following, see Release 3.5 Deprecation Announcements Hbr is deprecated and will be removed from subsequent releases New Features Simplified Surface Evaluation Bfr Tessellation Patterns Bfr Changes Suppression of GCC compiler warnings GitHub 1253, 1254, 1270 Additional methods for FarTopologyLevel GitHub 1227, 1255 Improved mixed partial derivative at Gregory patch corners GitHub 1252 Minor improvements to Far tutorials GitHub 1226, 1241 Added CMake config GitHub 1242 Updated CMake minimum version to 3.12 GitHub 1237, 1261 Updated documentation build scripts for Python 3 1265, 1266 Updated stringify build tool for improved cross compilation support GitHub 1267 Added NO_MACOS_FRAMEWORKS build option GitHub 1238 Updated Azure pipelines agents for Unbuntu and macOS GitHub 1247, 1256 Removed obsolete AppVeyor and Travis CI scripts GitHub 1259 Bug Fixes Cache active program for OsdGLComputeEvaluator GitHub 1244 Fixed member initialization warnings in OsdD3D11ComputeEvaluator GitHub 1239 Fixed GLSL shader source to remove storage qualifiers from struct members GitHub 1271 Fixed use of CMake variables for Apple builds GitHub 1235 Fixed build errors when using OpenGL without GLFW GitHub 1257 Fixed links to embedded videos GitHub 1231 Release 3.4 Release 3.4.4 - Feb 2021 Release 3.4.4 is a minor release including bug fixes and configuration improvements Changes The master branch on GitHub has been renamed release GitHub 1218 1219 The CMake configuration has been updated to allow use as a sub-project GitHub 1206 Removed obsolete references to hbr from examplesfarViewer GitHub 1217 Bug Fixes Fixed bug with sparse PatchTables and irregular face-varying seams GitHub 1203 Fixed loss of precision when using double precision stencil tables GitHub 1207 Fixed reset of FarTopologyRefinerGetMaxLevel after call to Unrefine GitHub 1208 Fixed linking with -ldl on unix systems GitHub 1196 Fixed naming and installation of macOS frameworks GitHub 1194 1201 Fixed GL version and extension processing and dynamic loading on macOS GitHub 1216 Fixed FindDocutils.cmake to be more robust GitHub 1213 1220 Fixed errors using build_scriptsbuild_osd.py with Python3 GitHub 1206 Release 3.4.3 - Apr 2020 Release 3.4.3 is a minor release including bug fixes and configuration improvements Changes GLEW is no longer required by default GitHub 1183 1184 Removed false Ptex link dependency from libosdCPU GitHub 1174 Removed false GLFW link dependency from DX11 and Metal examples GitHub 1178 Removed link dependency on unused TBB libraries GitHub 1064 Added option to disable building of dynamic shared libraries GitHub 1169 Added new tutorial for FarLimitStencilTable GitHub 1176 Updated use of EXT_direct_state_access to ARB_direct_state_access GitHub 1184 Fixed C strict aliasing warnings GitHub 1182 Fixed MSVC warnings in example code GitHub 1158 1172 Fixed compatibility with Visual Studio 2019 GitHub 1173 1189 Fixed CMake CMP0054 warnings GitHub 1180 Added prefix to OpenSubdiv CMake macros GitHub 1157 Moved utilities in examplescommon to regressioncommon GitHub 1167 Minor fixes to Far tutorials GitHub 1175 1177 Switched to Azure Pipelines for continuous integration testing instead of Travis-CI and AppVeyor GitHub 1168 1190 Bug Fixes Fixed selective boundary interpolation for case SdcOptionsVTX_BOUNDARY_NONE GitHub 1170 1171 Fixed static library linking to address missing symbols GitHub 1192 Additional fixes for dynamic and static linking GitHub 1193 Release 3.4.0 - Jun 2019 Release 3.4.0 is a significant release with several new features, bug fixes, and general code and configuration improvements. For more information on the following, please see Release 3.4 New Features Triangular Patches for Loop subdivision Improvements to Introductory Documentation Sparse Patch Tables and Adaptive Refinement Full Support for Double Precision in Far Changes Added new build script GitHub 1068 Added support for newer DirectX SDKs GitHub 1066 Patch arrays extended to support combined regular and irregular types GitHub 995 FarPatchTables and adaptive refinement supported for Bilinear scheme GitHub 1035 New FarPatchTableFactory method to determine adaptive refinement options GitHub 1047 New FarPatchTableFactory options to align primvar buffers of uniform tables GitHub 986 FarStencilTableUpdateValues overloaded to support separate base buffer GitHub 1011 FarLimitStencilTableFactory updated to create face-varying tables GitHub 1012 Regular patches on boundaries no longer require additional isolation GitHub 1025 Inclusion of OpenSubdiv header files in source code now consistent GitHub 767 Re-organization of and additions to Far tutorials GitHub 1083 examples now use common command-line conventions and parsing GitHub 1056 Bug Fixes Fixed FarPrimvarRefiner internal limitFVar prototype GitHub 979 Fixed FarStencilTable append when base StencilTable empty GitHub 982 Patches around non-manifold vertices now free of cracks GitHub 1013 Release 3.3 Release 3.3.3 - Jul 2018 Release 3.3.3 is bug-fix release addressing regressions from release 3.3.2 Bug Fixes Fixed a regression in PatchTable construction with varying patches GitHub 976 Fixed a regression in PatchTable construction for face-varying patches GitHub 972 Fixed a bug in the initialization of FarSourcePatch GitHub 971 Release 3.3.2 - Jun 2018 Release 3.3.2 is a minor release with potentially significant performance improvements to the patch pre-processing stages Changes Improved performance of PatchTable construction GitHub 966 The resulting improved accuracy will produce slight numerical differences in computations involving patches, e.g. StencilTable and PatchTable evaluation Bug Fixes FarPatchTableFactory now supports PatchTable construction with ENDCAP_BILINEAR_BASIS specified Release 3.3.1 - Feb 1018 Release 3.3.1 is a minor bug-fix release Bug Fixes Fixed GLSLHLSLMetal patch shader code to resolve degenerate normals GitHub 947 Fixed problems with face-varying patches in uniform PatchTables GitHub 946 Fixed integer overflow bugs for large meshes in PatchTable factories GitHub 957 Fixed computation of PatchParam for triangle refinement GitHub 962 Changes Added build options NO_GLFW and NO_GLFW_X11 Added additional shapes with infinitely sharp creases to the Metal and DX11 example viewers Disabled GL tests during CI runs on Linux Improved stability of examplesglImaging in CI runs by testing GL version Release 3.3.0 - Aug 2017 Release 3.3.0 is significant release adding an Osd implementation for Apples Metal API New Features Added an Osd implementation for Apples Metal API Added the mtlViewer example Changes Fixed several instances of local variable shadowing that could cause build warnings Updated continuous-integration build scripts and added testing on macOS Release 3.2 Release 3.2.0 - Feb 2017 Release 3.2.0 is a minor release containing API additions and bug fixes New Features Extended FarStencilTableFactory to support face-varying Extended Osd Evaluator classes to support evaluation of 1st and 2nd derivatives Added an option to disable generation of legacy sharp corner patches Changes Corrected numerous spelling errors in doxygen comments Updated glFVarViewer with improved error detection and command line parsing Added option to build using MSVC with static CRT Bug Fixes Fixed a double delete of GL program in OsdGLComputeEvaluator Release 3.1 Release 3.1.1 - Jan 2017 Release 3.1.1 is a minor bug-fix release. Bug Fixes Fixed a bug with non-manifold face-varying topology causing a crash during patch table creation Fixed GLEW compilation and linking with dynamic GLEW libraries on Windows Fixed GLFW linking with GLFW 3.2 on X11 platforms Release 3.1.0 - Oct 2016 Release 3.1.0 is a significant release with several new features, bug fixes, and general code and configuration improvements. For more information on the following, please see Release 3.1 New Features Bicubic Face-Varying Patches Varying and Face-Varying Evaluation Second Order Derivative Evaluation Separate Levels of Feature Isolation Sharp Patches for Infinitely Sharp Features Changes Enabled the use of CMakes folder feature Removed the use of iso646 alternative keywords and, or, not, etc. to improve portability Added numerical valued preprocessor directives OPENSUBDIV_VERSION_MAJOR, etc. to opensubdivversion.h Improved documentation for FarPatchParam and added Unnormalize to complement Normalize Added additional topology queries to FarTopologyLevel Updated glFVarViewer and glEvalLimit viewer to make use of bicubic face-varying patches Updated glViewer and dxViewer to add a toggle for InfSharpPatch Updated dxPtexViewer for improved feature parity with glPtexViewer Improved far_regression to exercise shapes independent of Hbr compatibility Added support for Appveyor continuous integration testing Removed cmakeFindIlmBase Removed mayaPolySmooth example Bug Fixes Fixed Ptex version parsing and compatibility issues Fixed compatibility issues with VS2015 Fixed bug interpolating face-varying data with Bilinear scheme Fixed bug with refinement using Chaikin creasing Fixed bugs with HUD sliders in the example viewers Release 3.0 Release 3.0.5 - Mar 2016 Release 3.0.5 is a minor stability release with performance and correctness bug fixes. Bug Fixes The previous release reduced transient memory use during PatchTable construction, but increased the amount of memory consumed by the resulting PatchTable itself, this regression has been fixed. The example Ptex texture sampling code has been fixed to prevent sampling beyond the texels for a face when multisample rasterization is enabled. Release 3.0.4 - Feb 2016 Release 3.0.4 is a minor stability release which includes important performance and bug fixes. New Features Added accessor methods to FarLimitStencilTable to retrieve limit stencil data including derivative weights Added support for OpenCL event control to OsdCLVertexBuffer and OsdCLEvaluator Changes Major reduction in memory use during FarPatchTable construction for topologies with large numbers of extraordinary features Improved performance for GL and D3D11 tessellation control hull shader execution when drawing BSpline patches with the single crease patch optimization enabled Bug Fixes Restored support for drawing with fractional tessellation Fixed far_tutorial_6 to refine primvar data only up to the number of levels produced by topological refinement Fixed build warnings and errors reported by Visual Studio 2015 Release 3.0.3 - Oct 2015 Release 3.0.3 is a minor stability release which includes important performance and bug fixes. New Features Smooth normal generation tutorial, far_tutorial_8 Changes Major performance improvement in PatchTable construction Improved patch approximations for non-manifold features Bug Fixes Fixed double delete in GLSL Compute controller Fixed buffer layout for GLSL Compute kernel Fixed GL buffer leak in OsdGLPatchTable Fixed out-of-bounds data access for TBB and OMP stencil evaluation Fixed WIN32_LEAN_AND_MEAN typo Fixed Loop-related shader issues glFVarViewer Release 3.0.2 - Aug 2015 Release 3.0.2 is a minor release for a specific fix. Bug Fixes Fixed drawing of single crease patches Release 3.0.1 - Aug 2015 Release 3.0.1 is a minor release focused on stability and correctness. Changes Added a references section to the documentation, please see References Removed references to AddVaryingWithWeight from examples and tutorials Added more regression test shapes Addressed general compiler warnings e.g. signed vs unsigned comparisons Addressed compiler warnings in the core libraries reported by GCCs -Wshadow Eased GCC version restriction, earlier requirement for version 4.8 or newer is no longer needed Replaced topology initialization assertions with errors Improved compatibility with ICC Improved descriptive content and formatting of Far error messages Improved build when configured to include no GPU specific code Bug Fixes Fixed handling of unconnected vertices to avoid out of bounds data access Fixed non-zero starting offsets for TbbEvalStencils and OmpEvalStencils Fixed FarStencilTableFactoryOptionsfactorizeIntermediateLevels Fixed FarPatchTablesFactoryOptionsgenerateAllLevels Fixed the behavior of VTX_BOUNDARY_NONE for meshes with bilinear scheme Fixed some template method specializations which produced duplicate definitions Disabled depth buffering when drawing the UI in the example viewers Disabled the fractional tessellation spacing option in example viewers since this mode is currently not supported Release 3.0.0 - Jun 2015 Release 3.0.0 is a major release with many significant improvements and changes. For more information on the following, please see Release 3.0 New Features Faster subdivision using less memory Support for non-manifold topology Face-Varying data specified topologically Elimination of fixed valence tables Single-crease patch for semi-sharp edges Additional irregular patch approximations Introduction of Stencil Tables Faster, simpler GPU kernels Unified adaptive shaders Updated coding style with namespaces More documentation and tutorials Bug Fixes Smooth Face-Varying interpolation around creases Release 3.0.0 RC2 New Features Documentation updates far_tutorial_3 updates for the multiple face-varying channels maya example plugin interpolates a UV channel and a vertex color channel Bug Fixes Fixed a LimitStencilTableFactory bug, which returns an invalid table PatchParam encoding changed to support refinement levels up to 10 Added Xinerama link dependency Fixed MSVC 32bit build problem Fixed minor cmake issues Fixed glViewerfarViewer stability bugs Release 3.0.0 RC1 Changes FarTopologyRefiner was split into several classes to clarify and focus the API. Interpolation of Vertex and Varying primvars in a single pass is no longer supported. The Osd layer was largely refactored. Previous 2.x Release Notes Previous releases Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"release_34.html\"\n+ \"loc\": \"release_notes.html\"\n }, {\n \"title\": \"Overview of Release 3.5\",\n \"text\": \"Overview of Release 3.5 Overview of Release 3.5 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Simplified Surface Evaluation Tessellation Patterns API Additions New classes in namespace Bfr Additions to FarTopologyLevel Additions to nested Options classes in Far Other Changes Deprecation Announcements Improvements Bug Fixes New Features Simplified Surface Evaluation The new Bfr interface provides an alternative to Far and Osd for evaluating the limit surface -- treating a subdivision mesh as a piecewise parameteric surface primitive . The Bfr interface is named for Base Face Representation as all concepts and classes relate to the individual faces of the original unrefined mesh, i.e. its base faces. Each base face has a piece of limit surface associated with it BfrSurface that is parameterized BfrParameterization and so can be evaluated and tessellated The limit surface for each face can be identified and evaluated independently of any other faces without any global pre-processing of a connected mesh. The resulting evaluation interface is much simpler, more flexible and more scalable than those assembled with the table-based class in Far -- providing a preferable alternative for many CPU-based use cases though not all. See the Bfr Overview documentation for more details. Tessellation Patterns In addition to evaluation, the Bfr interface includes a Tessellation class that provides tessellation patterns for all faces of a base mesh. A Tessellation does not encapsulate the entire tessellation process but simply provides topological patterns to assemble such a process. All faces of a mesh have a Parameterization which can be used to define a Tessellation with the specification of one or more tessellation rates. A single tessellation rate defines simple uniform tessellations while tessellation rates for each edge provide more complex non-uniform patterns A small set of options is also available to define the resulting patterns e.g. the preservation of quad faces with quad-based subdivision schemes above left and center and to generate its output in a more favorable form. Tessellation patterns do not support the full flexibility of typical hardware tessellation e.g. no fractional tessellation but do provide some useful alternatives to hardware tessellation e.g. the quad preservation previously noted, and more uniform triangles for triangular patches above right . The Tessellation class is also completely independent of evaluation in Bfr , and so can be used with any other evaluation interface. See the Tessellation subsection of the Bfr Overview for more details. API Additions See associated Doxygen for full details. New classes in namespace Bfr class Parameterization class Surface class SurfaceFactory class SurfaceFactoryCache class SurfaceFactoryMeshAdapter class RefinerSurfaceFactory class Tessellation Additions to FarTopologyLevel TopologyLevelIsVertexCorner TopologyLevelIsVertexRegular TopologyLevelIsVertexInfSharp TopologyLevelIsVertexSemiSharp TopologyLevelIsEdgeInfSharp TopologyLevelIsEdgeSemiSharp Additions to nested Options classes in Far PatchTableFactoryOptionsSetMaxIsolationLevel TopologyRefinerUniformOptionsSetRefinementLevel TopologyRefinerAdaptiveOptionsSetMaxIsolationLevel TopologyRefinerAdaptiveOptionsSetMaxSecondaryLevel Other Changes Deprecation Announcements Hbr is deprecated and will be removed from subsequent releases Improvements Suppression of GCC compiler warnings GitHub 1253, 1254, 1270 Additional methods for FarTopologyLevel GitHub 1227, 1255 Improved mixed partial derivative at Gregory patch corners GitHub 1252 Minor improvements to Far tutorials GitHub 1226, 1241 Added CMake config GitHub 1242 Updated CMake minimum version to 3.12 GitHub 1237, 1261 Updated documentation build scripts for Python 3 1265, 1266 Updated stringify build tool for improved cross compilation support GitHub 1267 Added NO_MACOS_FRAMEWORKS build option GitHub 1238 Updated Azure pipelines agents for Unbuntu and macOS GitHub 1247, 1256 Removed obsolete AppVeyor and Travis CI scripts GitHub 1259 Bug Fixes Cache active program for OsdGLComputeEvaluator GitHub 1244 Fixed member initialization warnings in OsdD3D11ComputeEvaluator GitHub 1239 Fixed GLSL shader source to remove storage qualifiers from struct members GitHub 1271 Fixed use of CMake variables for Apple builds GitHub 1235 Fixed build errors when using OpenGL without GLFW GitHub 1257 Fixed links to embedded videos GitHub 1231 Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_35.html\"\n }, {\n+ \"title\": \"Overview of Release 3.4\",\n+ \"text\": \"Overview of Release 3.4 Overview of Release 3.4 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Triangular Patches for Loop Subdivision Major Improvements to Introductory Documentation Sparse Patch Tables Support for Double Precision in Far API Additions Far extensions for triangular patches Construction and refinement of topology Construction and interface of FarPatchTable Construction and use of Far stencil tables Far class templates for double precision Far member functions converted to templates for double precision OsdMeshBits OsdPatchArray Osd extensions for patch evaluation common to all shaders Osd extensions for patch tessellation common to all shaders Other Changes Improvements Bug Fixes New Features Triangular Patches for Loop Subdivision Support for the drawing and evaluation of Loop subdivision meshes with triangular patches was added. This includes the full set of Far and Osd interfaces for both evaluation and drawing. The feature set supported for Loop subdivision now matches that of Catmark, including creases, face-varying patches, non-manifold topology, etc. The long standing requirement that Loop meshes be purely triangular remains, as Loop subdivision is not defined for non-triangular faces. And as is the case with the use of the Catmark scheme, application of Loop subdivision to dense, poorly modeled meshes may lead to unexpectedly poor performance andor surface quality. The patch representation used for Loop subdivision is intended to exactly match the underlying limit surface where regular, and so uses quartic triangular Box-splines. This is in contrast to approaches that use simpler patches to approximate the Loop limit surface everywhere. As with Catmark, Gregory patches are used to approximate irregular areas. Though other choices are available that compromise surface quality in favor of improved performance, they may be less effective with Loop than they are with Catmark. Major Improvements to Introductory Documentation A significant rewrite of the Subdivision Surfaces page is included in this release. The new documentation emphasizes the piecewise parametric surface nature of subdivision surfaces and the implications of supporting arbitary topology . As a true surface primitive, the distinction between the control points and the limit surface and the corresponding operations of subdivision and tessellation that are applied to them is made clear. Sparse Patch Tables Interfaces in Far for the construction of PatchTables and the required adaptive refinement have been extended to apply to an arbitrary subset of faces. This allows patches for either large meshes or meshes that may otherwise benefit from some kind of partioning e.g. areas of static and dynamic topology to be managed in an arbitrary number of groups. In the extreme, a PatchTable forming the tree of patches for a single base face can be constructed. Client data buffers for the base mesh do not need to be partitioned and base mesh topology can be shared by multiple instances of FarTopologyRefiner used to create corresponding instances of FarPatchTables. See the new Far tutorial 5.2 for a simple example. Support for Double Precision in Far Classes and interfaces in Far have been adapted to allow support for double precision via templates parameterized for float or double. Class templates for major classes such as FarStencilTable have been introduced and the original classes preserved for compatibility. Other classes such as FarPatchTable have had methods overloaded or replaced with template functions to support both single and double precision. Internally, all use of floating point constants and math library functions has been adapted to maximize accuracy appropriate to the precision of the template instance. Interfaces in Osd have not been extended. The extensions in Far provide the basis for extensions in Osd, but demand is limited. For those benefiting from such Osd extensions, contributions are welcomed. See the revised Far tutorial 5.1 that constructs a FarPatchTable for a simple example. API Additions See associated Doxygen for full details. Far extensions for triangular patches enum PatchDescriptorTypeGREGORY_TRIANGLE PatchParamNormalizeTriangle PatchParamUnnormalizeTriangle PatchParamIsTriangleRotated Construction and refinement of topology overloaded TopologyRefinerFactoryCreate extensions to TopologyRefinerRefineAdaptive Construction and interface of FarPatchTable overloaded PatchTableFactoryCreate PatchTableFactoryGetRefineAdaptiveOptions member PatchTableFactoryOptionsincludeBaseLevelIndices member PatchTableFactoryOptionsincludeFVarBaseLevelIndices member PatchTableFactoryOptionsgenerateVaryingTables member PatchTableFactoryOptionsgenerateVaryingLocalPoints member PatchTableFactoryOptionssetPatchPrecisionDouble member PatchTableFactoryOptionssetFVarPatchPrecisionDouble PatchTableGetFVarPatchDescriptorRegular PatchTableGetFVarPatchDescriptorIrregular PatchTableGetFVarValueStride Construction and use of Far stencil tables overloaded StencilTableUpdateValues enum LimitStencilTableFactoryMode member LimitStencilTableFactoryOptionsinterpolationMode member LimitStencilTableFactoryOptionsfvarChannel Far class templates for double precision class StencilReal class StencilTableReal class StencilTableFactoryReal class LimitStencilReal class LimitStencilTableReal class LimitStencilTableFactoryReal class PrimvarRefinerReal Far member functions converted to templates for double precision PatchParamNormalize PatchParamUnnormalize PatchTableEvaluateBasis PatchTableEvaluateBasisVarying PatchTableEvaluateBasisFaceVarying PatchTableGetLocalPointStencilTable PatchTableGetLocalPointVaryingStencilTable PatchTableGetLocalPointFaceVaryingStencilTable PatchMapFindPatch OsdMeshBits enumeration MeshEndCapBilinearBasis OsdPatchArray GetDescriptorRegular GetDescriptorIrregular GetPatchTyperRegular GetPatchTyperIrregular GetStride Osd extensions for patch evaluation common to all shaders struct OsdPatchArray and OsdPatchArrayInit struct OsdPatchCoord and OsdPatchCoordInit struct OsdPatchParam and OsdPatchParamInit OsdPatchParamGetFaceId OsdPatchParamGetU OsdPatchParamGetV OsdPatchParamGetTransition OsdPatchParamGetBoundary OsdPatchParamGetNonQuadRoot OsdPatchParamGetDepth OsdPatchParamGetParamFraction OsdPatchParamIsRegular OsdPatchParamIsTriangleRotated OsdPatchParamNormalize OsdPatchParamUnnormalize OsdPatchParamNormalizeTriangle OsdPatchParamUnnormalizeTriangle OsdEvaluatePatchBasisNormalized OsdEvaluatePatchBasis Osd extensions for patch tessellation common to all shaders OsdInterpolatePatchCoordTriangle OsdComputePerPatchVertexBoxSplineTriangle OsdEvalPatchBezierTriangle OsdEvalPatchGregoryTriangle OsdGetTessLevelsUniformTriangle OsdEvalPatchBezierTessLevels OsdEvalPatchBezierTriangleTessLevels OsdGetTessParameterizationTriangle Other Changes Improvements Added new build script GitHub 1068 Added support for newer DirectX SDKs GitHub 1066 Patch arrays extended to support combined regular and irregular types GitHub 995 FarPatchTables and adaptive refinement supported for Bilinear scheme GitHub 1035 New FarPatchTableFactory method to determine adaptive refinement options GitHub 1047 New FarPatchTableFactory options to align primvar buffers of uniform tables GitHub 986 FarStencilTableUpdateValues overloaded to support separate base buffer GitHub 1011 FarLimitStencilTableFactory updated to create face-varying tables GitHub 1012 Regular patches on boundaries no longer require additional isolation GitHub 1025 Inclusion of OpenSubdiv header files in source code now consistent GitHub 767 Re-organization of and additions to Far tutorials GitHub 1083 Examples now use common command-line conventions and parsing GitHub 1056 Bug Fixes Fixed FarPrimvarRefiner internal limitFVar prototype GitHub 979 Fixed FarStencilTable append when base StencilTable empty GitHub 982 Patches around non-manifold vertices now free of cracks GitHub 1013 Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"release_34.html\"\n+ }, {\n \"title\": \"Overview of Release 3.3\",\n \"text\": \"Overview of Release 3.3 Overview of Release 3.3 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Metal Compute and Tessellation API Additions OsdMTLContext OsdMTLComputeEvaluator OsdMTLStencilTable OsdMTLMeshInterface OsdMTLPatchTable OsdMTLLegacyGregoryPatchTable OsdPatchShaderSource OsdCPUMTLVertexBuffer Other Changes Improvements New Features Metal Compute and Tessellation Added support for drawing and evaluation using Apples Metal API for high performance and low-overhead GPU access. This includes the full set of Osd interfaces needed to draw using Metal graphics rendering including tessellation shaders and evaluate stencils and patch tables using Metal compute processing. Also includes an example mtlViewer that can be built to run on either macOS or iOS. Metal Graphics Rendering with Tessellation Metal Patch Evaluation using Compute Processing API Additions See associated Doxygen for full details. OsdMTLContext device and commandQueue member data OsdMTLComputeEvaluator Create EvalStencils EvalPatches EvalPatchesVarying EvalPatchesFaceVarying Compile Synchronize OsdMTLStencilTable Create GetSizesBuffer GetIndicesBuffer GetDuWeightsBuffer GetDvWeightsBuffer GetDuuWeightsBuffer GetDuvWeightsBuffer GetDvvWeightsBuffer GetNumStencils OsdMTLMeshInterface GetNumVertices GetMaxValence UpdateVertexBuffer UpdateVaryingBuffer Refine Synchronize GetPatchTable GetFarPatchTable BindVertexBuffer BindVaryingBuffer OsdMTLPatchTable Create GetPatchArrays GetPatchIndexBuffer GetPatchParamBuffer GetVaryingPatchArrays GetVaryingPatchIndexBuffer GetNumFVarChannels GetFVarPatchArrays GetFVarPatchIndexBuffer GetFVarPatchParamBuffer OsdMTLLegacyGregoryPatchTable UpdateVertexBuffer GetVertexBuffer GetVertexValenceBuffer GetQuadOffsetsBuffer OsdPatchShaderSource GetCommonShaderSource GetPatchBasisShaderSource GetVertexShaderSource GetHullShaderSource GetDomainShaderSource OsdCPUMTLVertexBuffer Create UpdateData GetNumElements GetNumVertices BindCpuBuffer BindMTLBuffer BindVBO Other Changes Improvements Fixed several instances of local variable shadowing that could cause build warnings Updated continuous-integration build scripts and added testing on macOS Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_33.html\"\n }, {\n- \"title\": \"Overview of Release 3.2\",\n- \"text\": \"Overview of Release 3.2 Overview of Release 3.2 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Face-Varying Stencil Evaluation 1st and 2nd Derivative Evaluation Smooth Corner Patch API Additions OsdCpuEvaluator, GLComputeEvaluator, etc OsdMesh OsdMeshBits FarPatchTableFactoryOptions FarStencilTableFactory FarStencilTableFactoryOptions Other Changes Improvements Bug Fixes New Features Face-Varying Stencil Evaluation Face-Varying primvar values may now be refined using stencil tables. The stencil table for a face-varying channel is created by specifying the desired fvarChannel and setting the FarStencilTableFactoryOption interpolationMode to INTERPOLATE_FACE_VARYING when creating the stencil table. 1st and 2nd Derivative Evaluation The Osd Evaluator API has been extended to support 1st derivative and 2nd partial derivative evaluation for stencils and patches. 1st Derivative Surface Normal 2nd Derivative Surface Curvature On the left is an example of computing a surface normal at each point using the evaluated 1st derivatives, while on the right is an example of computing surface curvature at each point using the evaluated 2nd partial derivatives. Smooth Corner Patch An option has been added to disable the legacy behavior of generating a sharp-corner patch at a smooth corner. Corners which are actually sharp will continue to generate sharp-corner patches. The differences between the two methods is most apparent at low-levels of feature isolation. This feature is controlled by the generateLegacySharpCornerPatches option added to FarPatchTableFactoryOptions. Sharp Corner Patch legacy behavior Smooth Corner Patch On the left is the legacy behavior of generating sharp corner patches at smooth corners. The image on the right shows the correct smooth corner patches generated when this legacy behavior is disabled. API Additions See associated Doxygen for full details. OsdCpuEvaluator, GLComputeEvaluator, etc Create EvalStencils EvalPatches EvalPatchesVarying EvalPatchesFaceVarying OsdMesh Create OsdMeshBits member MeshUseSmoothCornerPatch FarPatchTableFactoryOptions member generateLegacySharpCornerPatches FarStencilTableFactory enumeration ModeINTERPOLATE_FACE_VARYING AppendLocalPointStencilTableFaceVarying FarStencilTableFactoryOptions member fvarChannel Other Changes Improvements Corrected numerous spelling errors in doxygen comments Updated glFVarViewer with improved error detection and command line parsing Added option to build using MSVC with static CRT Bug Fixes Fixed a double delete of GL program in OsdGLComputeEvaluator Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"release_32.html\"\n- }, {\n \"title\": \"Overview of Release 3.1\",\n \"text\": \"Overview of Release 3.1 Overview of Release 3.1 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Bicubic Face-Varying Patches Varying and Face-Varying Evaluation Second Order Derivative Evaluation Separate Levels of Feature Isolation Sharp Patches for Infinitely Sharp Features API Additions OsdCpuEvaluator, GLComputeEvaluator, etc OsdCpuPatchTable, GLPatchTable, etc OsdMeshBits OsdPatchParam OsdGLSLPatchShaderSource, HLSLPatchShaderSource FarLimitStencil FarLimitStencilTable FarLimitStencilTableFactoryOptions FarPatchParam FarPatchTable FarPatchTableFactoryOptions FarTopologyLevel FarTopologyRefinerAdaptiveOptions Other Changes Improvements Bug Fixes New Features Bicubic Face-Varying Patches The motivation for this feature is to improve drawing and evaluation of face-varying primvar values for all face-varying interpolation options . A common use of non-linear face-varying data is to capture a UV projection on the surface. The following example shows a simple shape with the face-varying interpolation option assigned to a non-linear choice to achieve the desired projection in this case FVAR_LINEAR_NONE Linear Face-Varying Patches Bicubic Face-Varying Patches The result on the left shows the old linearly interpolated patches, which ignores any non-linear settings. The result on the right shows the new use of bicubic face-varying patches to accurately interpolate the desired projection. Generation of a full face-varying patch representation can be enabled using a new option in FarPatchTableFactoryOptions. Additionally, topological refinement can be improved to consider fvar channel topology using a new option in FarTopologyRefinerAdaptiveOptions. See the API additions below and their associated Doxygen text for more details. Evaluation of patch basis weights for all patch types as been added to the GPU shader source provided by OsdGLSLPatchShaderSource, and OsdHLSLPatchShaderSource. Use of non-linear face-varying patches increases the storage size of the patch table and may also require additional data access and computation while drawing. Varying and Face-Varying Evaluation This feature extends existing evaluation methods to support evaluation of varying and face-varying primvar data at arbitrary limit surface locations. Varying Primvar Evaluation Face-Varying Primvar Evaluation The image on the left shows evaluation of varying primvar values and the image on the right shows evaluation of face-varying primvar values. The EvaluateBasis API of FarPatchTable has been extended as well as the OSD Evaluator API. Second Order Derivative Evaluation This feature extends the FarLimitStencilTable and FarPatchTable interfaces to support evaluation of 2nd order partial derivatives. The generation of derivative values for FarLimitStencilTable is controlled by new options that can be specified when creating the stencil table. Additionally, the implementation exposes a more accurate method to compute derivatives for Gregory basis patches. This can be enabled using the CMake configuration and compile time definition OPENSUBDIV_GREGORY_EVAL_TRUE_DERIVATIVES. Separate Levels of Feature Isolation The primary motivation for this feature is to reduce the number of patches generated by adaptive refinement when they can be adequately represented at a lower level. A single level of isolation must be as high as the greatest semi-sharp feature to properly resolve the shape of that feature. That high isolation level generates many unnecessary patches for smooth extra-ordinary vertices. In the following example, a single semi-sharp vertex is refined to level 5 Single Isolation Level 5 Primary Level 5, Secondary Level 2 Single isolation to level 5 on the left results in 312 patches. The right shows the semi-sharp feature isolated to 5, but with the new secondary level set to 2, the number of patches is reduced to 123. The second specified level of adaptive refinement is used to halt isolation for features that typically do not require the specified maximum. These include interior and boundary extra-ordinary vertices and those infinitely sharp patches that correspond to boundary extra-ordinary patches. The secondary level is available as a new option in FarTopologyRefinerAdaptiveOptions. Sharp Patches for Infinitely Sharp Features The motivation for sharp patches is to accurately represent the limit surface of infinitely sharp features, which otherwise can only be approximated by very high levels of adaptive refinement, resulting in many unnecessary patches. The true limit surface for regular faces along an infinitely sharp crease is a regular B-Spline patch -- the same as regular faces along a boundary. Similarly, the limit surface for faces around an extra-ordinary vertex on an infinitely sharp crease is the same as that of faces around an extra-ordinary vertex on a boundary. So these patches are identified and isolated to the same degree -- the regular patches as soon as possible, and the irregular patches to the depth specified. Consider the following regressionshapecatmark_cube_creases2 Level 5 without Sharp Patches Level 5 with Sharp Patches Level 2 with Sharp Patches Without use of sharp patches on the left, isolating to level 5 generates 1764 patches and does still not capture the sharp edges. With sharp patches in the center, isolating to the same degree level 5 reduces the number of patches to 96 and captures the sharp edges. The sharp features can be captured at a lower degree with comparable accuracy as illustrated on the right where isolation to level 2 further reduces the number of patches to 42. The use of infinitely sharp patches can be enabled both at a high level as an new option to OsdMesh, or more directly when adaptively refining or construction the patch tables in FarTopologyRefinerAdaptiveOptions and FarPatchTableFactoryOptions. Given the improved accuracy and reduced patches by the use of simple regular patches, we would prefer that this be the default behavior, but it was made an explicit option in order to avoid disrupting existing usage. In a future major release this feature will hopefully be the norm. API Additions See associated Doxygen for full details. OsdCpuEvaluator, GLComputeEvaluator, etc EvalPatchesVarying EvalPatchesFaceVarying OsdCpuPatchTable, GLPatchTable, etc GetFVarPatchArrayBuffer GetFVarPatchIndexBuffer GetFVarPatchIndexSize GetFVarPatchParamBuffer GetFVarPatchParamSize GetNumFVarChannels GetVaryingPatchArrayBuffer GetVaryingPatchIndexBuffer GetVaryingPatchIndexSize OsdMeshBits member MeshFVarAdaptive member MeshUseInfSharpPatch OsdPatchParam IsRegular Unnormalize extensions to Set OsdGLSLPatchShaderSource, HLSLPatchShaderSource GetPatchBasisShaderSource FarLimitStencil GetDuuWeights GetDuvWeights GetDvvWeights extensions to LimitStencil FarLimitStencilTable GetDuuWeights GetDuvWeights GetDvvWeights Update2ndDerivs extensions to LimitStencilTable FarLimitStencilTableFactoryOptions member generate1stDerivatives member generate1stDerivatives extensions to LimitTableStencilFactoryCreate FarPatchParam IsRegular Unnormalize extensions to Set FarPatchTable ComputeLocalPointValuesFaceVarying ComputeLocalPointValuesVarying GetFVarPatchDescriptor GetFVarPatchParam GetNumLocalPointsFaceVarying GetNumLocalPointsVarying GetPatchArrayVaryingVertices GetPatchArrayFVarPatchParam GetPatchArrayFVarValues GetPatchFVarPatchParam GetPatchVaryingVertices GetVaryingPatchDescriptor GetVaryingVertices EvaluateBasisFaceVarying EvaluateBasisVarying extensions to EvaluateBasis FarPatchTableFactoryOptions member useInfSharpPatch member genenerateFVarLegacyLinearPatches FarTopologyLevel DoesEdgeFVarTopologyMatch DoesFaceFVarTopologyMatch DoesVertexFVarTopologyMatch IsEdgeBoundary IsEdgeNonManifold IsVertexBoundary IsVertexNonManifold FarTopologyRefinerAdaptiveOptions member secondaryLevel member useInfSharpPatch member considerFVarChannels Other Changes Improvements Enabled the use of CMakes folder feature Removed the use of iso646 alternative keywords and, or, not, etc. to improve portability Added numerical valued preprocessor directives OPENSUBDIV_VERSION_MAJOR, etc. to opensubdivversion.h Improved documentation for FarPatchParam and added Unnormalize to complement Normalize Added additional topology queries to FarTopologyLevel Updated glFVarViewer and glEvalLimit viewer to make use of bicubic face-varying patches Updated glViewer and dxViewer to add a toggle for InfSharpPatch Updated dxPtexViewer for improved feature parity with glPtexViewer Improved far_regression to exercise shapes independent of Hbr compatibility Added support for Appveyor continuous integration testing Removed cmakeFindIlmBase Removed mayaPolySmooth example Bug Fixes Fixed Ptex version parsing and compatibility issues Fixed compatibility issues with VS2015 Fixed bug interpolating face-varying data with Bilinear scheme Fixed bug with refinement using Chaikin creasing Fixed bugs with HUD sliders in the example viewers Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_31.html\"\n }, {\n- \"title\": \"Porting Guide 2.x to 3.0\",\n- \"text\": \"Porting Guide 2.x to 3.0 Porting Guide 2.x to 3.0 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Porting Guide 2.x to 3.0 Source Code Organization Hbr Layer Translation Subdivision Schemes and Options in Sdc Specifying Face Varying Topology and Options Far Layer Translation Ordering of Refined Vertices Osd Layer Translation Controller Objects ComputeContext, DrawContext EvalLimitContext OsdMesh OsdKernelBatch OsdVertex Feature Adaptive Shader Changes End Cap Strategies Changes to Subdivision Build Support for Combining 2.x and 3.0 Porting Guide 2.x to 3.0 This document is a high-level description of how to port exiting OpenSubdiv 2.x code to use OpenSubdiv 3.0. NOTE If your questions are not answered here, please contact us on the OpenSubdiv forum and we will be happy to help Source Code Organization Given the scale of functional changes that were being made to the public interface, we took the opportunity in 3.0 to update the coding style and organization -- most notably making use of namespaces for each library. Subdirectory Namespace Relevance hbr NA Historical, no longer used sdc Sdc New, low-level, public options, constants, etc. vtr Vtr New, internal use, topology representation far Far Revised, similar functionality with new API osd Osd Revised, similar functionality with new API Hbr Layer Translation Client mesh topology is now translated into an instance of FarTopologyRefiner instead of HbrMesh. OpenSubdiv 2.x OpenSubdiv 3.0 HbrMeshVTX_TYPE FarTopologyRefiner The FarTopologyRefiner is now the core representation of topology from which all other major classes in Far and Osd are constructed. It was designed to support efficient refinement uniform or sparse of a base mesh of arbitrary topology no manifold restrictions. Once constructed it can be directly refined to meet some need, or passed to other contexts that will refine it to meet their needs. In contrast to directly assembling an HbrMesh, the TopologyRefiner, like other classes in Far, requires a Factory class for its construction. One of the early goals of these factories was to allow a client to convert their existing boundary representation -- with its full topological traversal abilities -- directly into the TopologyRefiners representation. While this is now possible, this also represents the most complex construction process and is only recommended for usage where this conversion process is critical. Details on how to construct a TopologyRefiner can be found in the Far overview documentation. Additionally, documentation for FarTopologyRefinerFactoryMESH outlines the requirements, and Far tutorial 3.1 tutorialsfartutorial_3_1 provides an example of a factory for directly converting HbrMeshes to TopologyRefiners. Its worth a reminder here that FarTopologyRefiner contains only topological information which does include sharpness, since that is considered relating to subdivision topology and not the positions or other data associated with a mesh. While HbrMeshT required some definition of a vertex type T and dimensions of face-varying data, TopologyRefiner is more clearly separated from the data. So the construction of the TopologyRefiner does not involve data specification at all. Subdivision Schemes and Options in Sdc The creation of a new TopologyRefiner requires specification of a subdivision scheme and a set of options that are applicable to all schemes. With HbrMesh, the scheme was specified by declaring a static instance of a specific subclass of a subdivision object, and the options were specified with a number of methods on the different classes. Such general information about the schemes has now been encapsulated in the Sdc layer for use throughout OpenSubdiv. The subdivision scheme is now a simple enumerated type SdcSchemeType and the entire set of options that can be applied to a scheme is encapsulated in a single simple struct of flags and enumerated types SdcOptions. OpenSubdiv 2.x OpenSubdiv 3.0 HbrMeshTSetInterpolateBoundaryMethod SdcOptionsSetVtxBoundaryInterpolation HbrMeshTSetFVarInterpolateBoundaryMethod SdcOptionsSetFVarLinearInterpolation HbrSubdivisionTSetCreaseSubdivisionMethod SdcOptionsSetCreasingMethod Specifying Face Varying Topology and Options Both the way in which face varying data is associated with a mesh and the options used to control its interpolation have changed. The documentation on Compatibility with OpenSubdiv 2.x details the equivalence of interpolation options between Hbr and the new SdcOptionsFVarLinearInterpolation enum, while the section on Face Varying Interpolation illustrates their effects. Face varying data is now specified by index rather than by value, or as often stated, it is specified topologically. Just as vertices for faces are specified by indices into a potential buffer of positions, face varying values are specified by indices into a potential buffer of values. Both vertices and face varying values frequently referred to as FVarValues in the API are assigned and associated with the corners of all faces. In many cases this will simplify representation as many common geometry container formats such as Obj or Alembic specify texture coordinates the same way. For other cases, where a value per face-corner is provided with no indication of which values incident each vertex should be considered shared, it will be necessary to determine shared indices for values at each vertex if any non-linear interpolation is desired. Far Layer Translation While TopologyRefiner was introduced into Far as the new intermediate topology representation, several other changes were made to classes in Far to provide more modular building blocks for use by the Osd layer or directly. OpenSubdiv 2.x OpenSubdiv 3.0 FarMeshU NA, no longer needed FarSubdivisionTables FarStencilTable FarPatchTables FarPatchTable Ordering of Refined Vertices The FarMesh was previously responsible for refining an HbrMesh -- generating new vertices and faces in successive levels of refinement in the FarSubdivisionTables. Vertices were grouped and reordered from the native ordering of HbrMesh so that vertices requiring similar processing were consecutive. Such grouping alleviated most of the idiosyncrasies of HbrMeshs native ordering but not all. FarToplogyRefiner is inherently a collection of refinement levels, and within each refined level so excluding the base level, all components are still grouped for the same reasons. There are two issues here though the ordering of these groups has changed though an option exists to preserve it the ordering of components within these groups is not guaranteed to have been preserved Vertices in a refined level are grouped according to the type of component in the parent level from which they originated, i.e. some vertices originate from the center of a face face-vertices, some from an edge edge-vertices and some from a vertex vertex-vertices. Note that there is a conflict in terminology here -- face-vertices and edge-vertices most often refer to vertices incident a face or edge -- but for the sake of this discussion, we use them to refer to the component from which a child vertex originates. The following table shows the ordering of these groups in 2.x and the two choices available in 3.0. The option is the orderVerticesFromFacesFirst flag that can be set in the Option structs passed to the uniform and adaptive refinement methods of TopologyRefiner Version and option Vertex group ordering 2.x face-vertices, edge-vertices, vertex-vertices 3.0 default vertex-vertices, face-vertices, edge-vertices 3.0 orderVerticesFromFacesFirst true face-vertices, edge-vertices, vertex-vertices The decision to change the default ordering was based on common feedback the rationale was to allow a trivial mapping from vertices in the cage to their descendants at all refinement levels. While the grouping is fundamental to the refinement process, the ordering of the groups is internally flexible, and the full set of possible orderings can be made publicly available in future if there is demand for such flexibility. The ordering of vertices within these groups was never clearly defined given the way that HbrMesh applied its refinement. For example, for the face-vertices in a level, it was never clear which face-vertices would be first as it depended on the order in which HbrMesh traversed the parent faces and generated them. Given one face, HbrMesh would often visit neighboring faces first before moving to the next intended face. The ordering with FarTopologyRefiner is much clearer and predictable. Using the face-vertices as an example, the order of the face-vertices in level N1 is identical to the order of the parent faces in level N from which they originated. So if we have face-vertices Vi , Vj and Vk at some level, originating from faces Fi , Fj and Fk in the previous level, they will be ordered in increasing order of i , j and k . For uniform refinement the ordering of face vertices Vi will therefore exactly match the ordering of the parent faces Fi . For adaptive or otherwise sparse refinement, the subset of Vi will be ordered similarly, just with components missing from those not refined. The same is true of all vertices, i.e. edge-vertices and vertex-vertices, and also for other components in refined levels, i.e. the child faces and edges. For child faces and edges, more than one will originate from the same parent face or edge. In addition to the overall ordering based on the parent faces or edges, another ordering is imposed on multiple children originating from the same face or edge. They will be ordered based on the corner or end-vertex with which they are associated. In the case of refined faces, another way to view the ordering is to consider the way that faces are originally defined -- by specifying the set of vertices for the corners of each face, often aggregated into a single large array. The ordering of the set of refined faces for each level will correspond directly to such an array of vertices per face in the previous level. Osd Layer Translation Two big changes in the 3.0 API have allowed the Osd layer to be significantly simpler, the first is the move to stencil tables from subdivision tables and the second is shader simplification. With this refactoring, the focus has been to use more meaningful names and to make the data contained within an object more apparent. Controller Objects The API-specific ComputeController has been replaced with the Evaluator . It reflects the fact that stencil compute batches are significantly simpler than subdivision table compute batches. The name Evaluator was chosen with the hope that is more meaningful than the generic ComputeController moniker the Evaluator evaluates stencil and patch tables. In the 2.x code base, subdiv level buffers were always required to be allocated contiguously, however in 3.0 with the shift to stencil tables, this strict allocation scheme is no longer required. As a result, the EvalStencils and EvalPatches methods now accept both a source and a destination descriptor. OpenSubdiv 2.x OpenSubdiv 3.0 ComputeControllerRefine Osd...EvaluatorEvalStencils ComputeControllerSynchronize Osd...EvaluatorSynchronize EvalStencilsControllerUpdateValues Osd...EvaluatorEvalStencils EvalStencilsControllerUpdateDerivs Osd...EvaluatorEvalStencils EvalLimitControllerEvalLimitSample Osd...EvaluatorEvalPatches Also note that OsdVertexDescriptor has been renamed, however its data members and semantic purpose remains the same OpenSubdiv 2.x OpenSubdiv 3.0 OsdVertexBufferDescriptor OsdBufferDescriptor ComputeContext, DrawContext ComputeContext and DrawContext have been replaced with API-specific StencilTable and PatchTable objects, for example OsdGLStencilTableSSBO. OpenSubdiv 2.x OpenSubdiv 3.0 ComputeContext Osd...StencilTable e.g. GLStencilTableTBO EvalStencilsContext Osd...StencilTable DrawContext Osd...PatchTable e.g. GLPatchTable EvalLimitContext The data stored in EvalLimitContext has been merged into the Evaluator class as well. EvalCoords have been moved into their own type, OsdPatchCoords. The primary change here is that the PTex face ID is no longer part of the data structure, rather the client can use a FarPatchMap to convert from PTex face ID to a FarPatchTablePatchHandle. OpenSubdiv 2.x OpenSubdiv 3.0 EvalLimitContext PatchTable EvalLimitContextEvalCoords OsdPatchCoords types.h OsdMesh While not strictly required, OsdMesh is still supported in 3.0 as convenience API for allocating buffers. OsdMesh serves as a simple way to allocate all required data, in the location required by the API for example, GPU buffers for OpenGL. OsdKernelBatch No translation, it is no longer part of the API. OsdVertex No translation, it is no longer part of the API. Feature Adaptive Shader Changes In 3.0, the feature adaptive screen-space tessellation shaders have been dramatically simplified, and the client-facing API has changed dramatically as well. The primary shift is to reduce the total number of shader combinations, and as a result, some of the complexity management mechanisms are no longer necessary. In the discussion below, some key changes are highlighted, but deep integrations may require additional discussion please feel free to send follow up questions to the OpenSubdiv google group. The number of feature adaptive shaders has been reduced from N to exactly 1 or 2, depending on how end-caps are handled. Osd layer no longer compiles shaders, rather it returns shader source for the client to compile. This source is obtained via OsdGLSLHLSLPatchShaderSource. The API exposed in shaders to access patch-based data has been consolidated and formalized, see osdglslPatchCommon.glsl and osdhlslPatchCommon.hlsl for details. Patches are no longer rotated and transition patches have been eliminated, simplifying PatchDescriptor to a 4 bits. Additionally, FarPatchTablesDescriptor has been moved into its own class in the Far namespace. The following table outlines the API translation between 2.x and 3.0 OpenSubdiv 2.x OpenSubdiv 3.0 OsdDrawContextPatchDescriptor NA, no longer needed. OsdDrawContextPatchArray OSdPatchArray types.h FarPatchTablesPatchDescriptor FarPatchDescriptor patchDescriptor.h FarPatchTablesPatchArray made private. End Cap Strategies By default, OpenSubdiv uses Gregory patches to approximate the patches around extraordinary vertices at the maximum isolation level, this process is referred to as end-capping. If ENDCAP_BSPLINE_BASIS is specified to PatchTableFactoryOptions, BSpline patches are used, which gives less accuracy, but it makes possible to render an entire mesh in a single draw call. Both patches require additional control points that are not part of the mesh, we refer to these as local points. In 3.0, the local points of those patches are computed by applying a stencil table to refined vertices to construct a new stencil table for the local points. Since this new stencil table is topologically compatible with the primary stencil table for refinement, it is convenient and efficient to splice those stencil tables together. This splicing can be done in the following way FarStencilTable const refineStencils FarStencilTableFactoryCreatetopologyRefiner FarPatchTable cosnt patchTable FarPatchTableFactoryCreatetopologyRefiner FarStencilTable const localPointStencils patchTable-GetLocalPointStencilTable FarStencilTable const splicedStencils FarStencilTableFactoryAppendLocalPointStencilTablestopologyRefiner, refineStencils, localPointStencils NOTE Once the spliced stencil table is created, the refined stencils can be released, but the local point stencils are owned by patchTable, it should not be released. OpenSubdiv 3.0 also supports 2.x style Gregory patches, if ENDCAP_LEGACY_GREGORY is specified to PatchTableFactoryOptions. In this case, such an extra stencil splicing isnt needed, however clients must still bind additional buffers VertexValence buffer and QuadOffsets buffer. See OsdGLLegacyGregoryPatchTable for additional details. Changes to Subdivision The refactoring of OpenSubdiv 3.0 data representations presented a unique opportunity to revisit some corners of the subdivision specification and remove or update some legacy features -- none of which was taken lightly. More details are provided in Subdivision Compatibility , while the following offers a quick overview All face-varying interpolation options have been combined into a single enum. Vertex interpolation options have been renamed or removed The naming of the standard creasing method has changed from Normal to Uniform . Unused legacy modes of the smoothtriangle option have been removed. The averaging of Chaikin creasing with infinitely sharp edges has changed. Support for Hierarchical Edits has been removed. Build Support for Combining 2.x and 3.0 Running OpenSubdiv 2.0 and 3.0 in a single process is supported, however some special care must be taken to avoid namespace collisions, both in terms of run-time symbols avoid using OpenSubdivOsd, for example and in terms of build-time search paths. To support both OpenSubdiv 2.0 and 3.0 in your build environment, you can prefix the header install directory of OpenSubdiv 3.0. Do this using the build flag CMAKE_INCDIR_BASE when configuring cmake i.e. -DCMAKE_INCDIR_BASEincludeopensubdiv3 and then including files from opensubdiv3... in client code. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"porting.html\"\n- }, {\n \"title\": \"Overview of Release 3.0\",\n \"text\": \"Overview of Release 3.0 Overview of Release 3.0 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Release 3.0 Subdivision Core Sdc Topology and Refinement Limit Properties and Patches Faster Evaluation and Display Updated Source-Code Style Documentation and Tutorials Additional Resources Porting Guide Subdivision Compatibility Release 3.0 OpenSubdiv 3.0 represents a landmark release, with profound changes to the core algorithms, simplified APIs, and streamlined GPU execution. Providing faster, more efficient, and more flexible subdivision code remains our principal goal. To achieve this, OpenSubdiv 3.0 introduces many improvements that constitute a fairly radical departure from previous versions. This document highlights some of the major changes that have gone in to the 3.0 release. Subdivision Core Sdc In consideration of past, present and future topological representations, all low-level details fundamental to subdivision and the specific subdivision schemes have been factored into a new low-level layer called Sdc SubDivision Core. This layer encapsulates the full set of applicable options, the formulae required to support semi-sharp creasing, the formulae for the refinement masks of each subdivision scheme, etc. As initially conceived, its goal was often expressed as separating the math from the mesh. Sdc provides the low-level nuts and bolts to provide a subdivision implementation consistent with OpenSubdiv. It is used by OpenSubdivs libraries and may also be useful in providing an existing clients implementation with the details necessary to make that implementation consistent with OpenSubdiv. Topology and Refinement OpenSubdiv 3.0 introduces a new intermediate internal topological representation named Vtr Vectorized Topology Representation. Compared to the Hbr library used in previous versions, Vtr is much more efficient for the kinds of topological analysis required by Far and is more flexible. While Hbr is no longer used by OpenSubdiv, it will remain in the source distribution for legacy and regression purposes. Faster Subdivision A major focus of the 3.0 release is performance, and the improvement to the initial refinement of a mesh required for topological analysis is close to an order magnitude often much more for uniform, but less for adaptive. Supporting for Non-manifold Topology With topology conversion no longer constrained by Hbr, OpenSubdiv is no longer restricted to meshes of manifold topology. With one exception non-triangles with Loop subdivision, any set of faces and vertices that can be represented in common container formats such as Obj or Alembic can be represented and subdivided. With future efforts to bring the functionality for the Loop scheme up to par with Catmark, that last remaining topological restriction will be removed. Simpler Conversion of Topology Several entry-points are now available for client topology, rather than the single incremental assembly of an HbrMesh that previously existed. The new topological relationships can be populated using either a high-level interface where simplicity has been emphasized, or a more complex lower-level interface for enhanced efficiency. Face Varying Topology Previously, face-varying data was assigned by value to the vertex for each face, and whether or not the set of values around a vertex was continuous was determined by comparing these values later. In some cases this could result in two values that were not meant to be shared being welded together. Face-varying data is now specified topologically just as the vertex topology is defined from a set of vertices and integer references indices to these vertices for the corner of each face, face-varying topology is defined from a set of values and integer references indices to these values for the corner of each face. So if values are to be considered distinct around a vertex, they are given distinct indices and no comparison of any data is ever performed. Note that the number of vertices and values will typically differ, but since indices are assigned to the corners of all faces for both, the total number of indices assigned to all faces will be the same. This ensures that OpenSubdivs face-varying topology matches what is often specified in common geometry container formats like Obj, Alembic and USD. Multiple channels of face-varying data can be defined and each is topologically independent of the others. Limit Properties and Patches A fundamental goal of OpenSubdiv is to provide an accurate and reliable representation of the limit surface. Improvements have been made both to the properties positions and tangents at discrete points in the subdivision hierarchy, as well as to the representations of patches used for the continuous limit surface between them. Removed Fixed Valence Tables Limit properties of extra-ordinary vertices are computed for arbitrary valence and new patch types no longer rely on small table sizes. All tables that restricted the valence of a vertex to some relatively small table size have now been removed. The only restriction on valence that exists is within the new topology representation, which restricts it to the size of an unsigned 16-bit integer 65,535. This limit could also be removed, by recompiling with a certain size changed from 16- to 32-bits, but doing so would increase the memory cost for all common cases. We feel the 16-bit limit is a reasonable compromise. Single Crease Patch OpenSubdiv 3.0 newly implements efficient evaluation of semi-smooth creases using single crease patches. With this optimization, high-order edge sharpness tags can be handled very efficiently for both computation time and memory consumption. Niessner et al., Efficient Evaluation of Semi-Smooth Creases in Catmull-Clark Subdivision Surfaces. Eurographics Short Papers. 2012. httpresearch.microsoft.comen-usumpeoplecloopEG2012.pdf New Irregular Patch Approximations While legacy Gregory patch support is still available, we have introduced several new options for representing irregular patches Legacy Gregory, fast Gregory Basis stencils, and BSpline patches. Gregory basis stencils provide the same high quality approximation of Legacy Gregory patches, but execute considerably faster with a simpler GPU representation. While BSpline patches are not as close an approximation as Gregory patches, they enable an entire adaptively refined mesh to be drawn with screen space tessellation via a single global shader configuration Gregory Basis patches require one additional global shader configuration. The new implementations of the GregoryBasis and BSpline approximations relax the previous max valence limit. Legacy Gregory patch still has a limitation of max valence typically 24, depending on the hardware capability of GL_MAX_VARYING_VECTORS. Users are still encouraged to use models with vertices of low valence for both improved model quality and performance. Faster Evaluation and Display OpenSubdiv 3.0 also introduces new data structures and algorithms that greatly enhance performance for the common case of repeated evaluation both on the CPU and GPU. Introducing Stencil Tables OpenSubdiv 3.0 replaces the serialized subdivision tables with factorized stencil tables. The SubdivisionTables class of earlier releases contained a large number of data inter-dependencies, which incurred penalties from fences or force additional kernel launches. Most of these dependencies have now been factorized away in the pre-computation stage, yielding stencil tables FarStencilTable instead. Stencils remove all data dependencies and simplify all the computations into a single trivial kernel. This simplification results in a faster pre-computation stage, faster execution on GPU, with less driver overhead. The new stencil tables Compute back-end is supported on all the same platforms as previous releases except GCD. Faster, Simpler GPU Kernels On the GPU side, the replacement of subdivision tables with stencils greatly reduces bottlenecks in compute, yielding as much as a 4x interpolation speed-up. At the same time, stencils reduce the complexity of interpolation to a single kernel launch per primitive, a critical improvement for mobile platforms. As a result of these changes, compute batching is now trivial, which in turn enabled API simplifications in the Osd layer. Unified Adaptive Shaders Adaptive tessellation shader configurations have been greatly simplified. The number of shader configurations has been reduced from a combinatorial per-patch explosion down to a constant two global configurations. This massive improvement over the 2.x code base results in significantly faster load times and a reduced per-frame cost for adaptive drawing. Similar to compute kernel simplification, this shader simplification has resulted in additional simplifications in the Osd layer. Updated Source-Code Style OpenSubdiv 3.0 replaces naming prefixes with C namespaces for all API layers, bringing the source style more in line with contemporary specifications mostly inspired from the Google C Style Guide . The large-scale changes introduced in this release generally break compatibility with existing client-code. However, this gives us the opportunity to effect some much needed updates to our code-style guidelines and general conventions, throughout the entire OpenSubdiv code-base. We are hoping to drastically improve the quality, consistency and readability of the source code. Documentation and Tutorials The documentation has been reorganized and fleshed out. This release introduces a number of new tutorials . The tutorials provide an easier entry point for learning the API than do the programs provided in examples. The examples provide more fleshed out solutions and are a good next step after the tutorials are mastered. Additional Resources Porting Guide Please see the Porting Guide for help on how to port existing code written for OpenSubdiv 2.x to the new 3.0 release. Subdivision Compatibility The 3.0 release has made some minor changes to the subdivision specification and rules. See Subdivision Compatibility for a complete list. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_30.html\"\n }, {\n- \"title\": \"OSD Tessellation shader Interface\",\n- \"text\": \"OSD Tessellation shader Interface OSD Tessellation shader Interface 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Basic Tessellation Control Shader Example for B-Spline patches Tessellation Evaluation Shader Example for B-Spline patches Basis Conversion B-spline Patch Gregory Basis Patch Box-spline Triangle Patch Gregory Triangle Patch Legacy Gregory Patch 2.x compatibility Tessellation levels Tessellation levels at each tessellated vertex Tessellation levels computed at each patch Uniform Screenspace Basic Starting with 3.0, Osd tessellation shaders can be used as a set of functions from client shader code. In order to tessellate Osd patches, client shader code should perform the following steps regular B-spline patch case In a tessellation control shader fetch a PatchParam for the current patch call OsdComputePerPatchVertexBSpline to compute OsdPerPatchVertexBezier. compute tessellation level. To prevent cracks on transition patches, two vec4 parameters tessOuterHi, tessOuterLo will be needed in addition to built-in gl_TessLevelInnerOuters. In a tessellation evaluation shader call OsdGetTessParameterization to remap gl_TessCoord to a patch parameter at which to evaluate. call OsdEvalPatchBezierOsdEvalPatchGregory to evaluate the current patch. The following is a minimal example of GLSL code explaining how client shader code uses OpenSubdiv shader functions to tessellate patches of a patch table. Tessellation Control Shader Example for B-Spline patches layout vertices 16 out in vec3 position patch out vec4 tessOuterLo , tessOuterHi out OsdPerPatchVertexBezier v void main Get a patch param from texture buffer. ivec3 patchParam OsdGetPatchParam gl_PrimitiveID Compute per-patch vertices. OsdComputePerPatchVertexBSpline patchParam , gl_InvocationID , position , v Compute tessellation factors. if gl_InvocationID 0 vec4 tessLevelOuter vec4 0 vec2 tessLevelInner vec2 0 OsdGetTessLevelsUniform patchParam , tessLevelOuter , tessLevelInner , tessOuterLo , tessOuterHi gl_TessLevelOuter 0 tessLevelOuter 0 gl_TessLevelOuter 1 tessLevelOuter 1 gl_TessLevelOuter 2 tessLevelOuter 2 gl_TessLevelOuter 3 tessLevelOuter 3 gl_TessLevelInner 0 tessLevelInner 0 gl_TessLevelInner 1 tessLevelInner 1 Tessellation Evaluation Shader Example for B-Spline patches layout quads in patch in vec4 tessOuterLo , tessOuterHi in OsdPerPatchVertexBezier v uniform mat4 mvpMatrix void main Compute tesscoord. vec2 UV OsdGetTessParameterization gl_TessCoord . xy , tessOuterLo , tessOuterHi vec3 P vec3 0 , dPu vec3 0 , dPv vec3 0 vec3 N vec3 0 , dNu vec3 0 , dNv vec3 0 ivec3 patchParam inpt 0 . v . patchParam Evaluate patch at the tess coord UV OsdEvalPatchBezier patchParam , UV , v , P , dPu , dPv , N , dNu , dNv Apply model-view-projection matrix. gl_Position mvpMatrix vec4 P , 1 Basis Conversion B-spline Patch The following diagram shows how the Osd shaders process b-spline patches. While regular patches are expressed as b-spline patches in FarPatchTable, the Osd shader converts them into Bezier basis patches for simplicity and efficiency. This conversion is performed in the tessellation control stage. The boundary edge evaluation and single crease matrix evaluation are also resolved during this conversion. OsdComputePerPatchVertexBSpline can be used for this process. The resulting Bezier control vertices are stored in OsdPerPatchVertexBezier struct. void OsdComputePerPatchVertexBSpline ivec3 patchParam , int ID , vec3 cv 16 , out OsdPerPatchVertexBezier result The tessellation evaluation shader takes an array of OsdPerPatchVertexBezier struct, and then evaluates the patch using the OsdEvalPatchBezier function. void OsdEvalPatchBezier ivec3 patchParam , vec2 UV , OsdPerPatchVertexBezier cv 16 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Gregory Basis Patch In a similar way, Gregory basis patches are processed as follows OsdComputePerPatchVertexGregoryBasis can be used for the Gregory patches although no basis conversion involved for the Gregory patches and the resulting vertices are stored in a OsdPerPatchVertexGreogryBasis struct. void OsdComputePerPatchVertexGregoryBasis ivec3 patchParam , int ID , vec3 cv , out OsdPerPatchVertexGregoryBasis result The tessellation evaluation shader takes an array of OsdPerPatchVertexGregoryBasis struct, and then evaluates the patch using the OsdEvalPatchGregory function. void OsdEvalPatchGregory ivec3 patchParam , vec2 UV , vec3 cv 20 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Box-spline Triangle Patch While regular triangle patches are expressed as triangular box-spline patches in FarPatchTable, the Osd shader converts them into triangular Bezier patches for consistency. This conversion is performed in the tessellation control stage. The boundary edge evaluation is resolved during this conversion. OsdComputePerPatchVertexBoxSplineTriangle can be used for this process. The resulting Bezier control vertices are stored in OsdPerPatchVertexBezier struct. void OsdComputePerPatchVertexBoxSplineTriangle ivec3 patchParam , int ID , vec3 cv 12 , out OsdPerPatchVertexBezier result The tessellation evaluation shader takes an array of OsdPerPatchVertexBezier struct, and then evaluates the patch using the OsdEvalPatchBezierTriangle function. void OsdEvalPatchBezierTriangle ivec3 patchParam , vec2 UV , OsdPerPatchVertexBezier cv 15 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Gregory Triangle Patch OsdComputePerPatchVertexGregoryBasis can be used for the quartic triangular Gregory patches although no basis conversion involved for the Gregory triangle patches and the resulting vertices are stored in a OsdPerPatchVertexGreogryBasis struct. void OsdComputePerPatchVertexGregoryBasis ivec3 patchParam , int ID , vec3 cv , out OsdPerPatchVertexGregoryBasis result The tessellation evaluation shader takes an array of OsdPerPatchVertexGregoryBasis struct, and then evaluates the patch using the OsdEvalPatchGregoryTriangle function. void OsdEvalPatchGregoryTriangle ivec3 patchParam , vec2 UV , vec3 cv 18 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Legacy Gregory Patch 2.x compatibility OpenSubdiv 3.0 also supports 2.x style Gregory patch evaluation see far_overview. In order to evaluate a legacy Gregory patch, client needs to bind extra buffers and to perform extra steps in the vertex shader as shown in the following diagram Tessellation levels Osd provides both uniform and screen-space adaptive tessellation level computation. Because of the nature of feature adaptive subdivision , we need to pay extra attention for a patchs outer tessellation level for the screen-space adaptive case so that cracks dont appear. An edge of the patch marked as a transition edge is split into two segments Hi and Lo. The Osd shaders uses these two segments to ensure the same tessellation along the edge between different levels of subdivision. In the following example, suppose the left hand side patch has determined the tessellation level of its right edge to be 5. gl_TessLevelOuter is set to 5 for the edge, and at the same time we also pass 2 and 3 to the tessellation evaluation shader as separate levels for the two segments of the edge split at the middle. Tessellation levels at each tessellated vertex The tessellation evaluation shader takes gl_TessCoord and those two values, and remaps gl_TessCoord using OsdGetTessParameterization or OsdGetTessLevelParameterizationTriangle to ensure the parameters are consistent across adjacent patches. vec2 OsdGetTessParameterization vec2 uv , vec4 tessOuterLo , vec4 tessOuterHi vec2 OsdGetTessParameterizationTriangle vec3 uvw , vec4 tessOuterLo , vec4 tessOuterHi Tessellation levels computed at each patch These tessellation levels can be computed the corresponding method in the tesselation control shader. Note that these functions potentially requires all bezier control points, you need to call barrier to ensure the conversion is done for all invocations. See osdglslPatchBSpline.glsl for more details. Uniform void OsdGetTessLevelsUniform ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi void OsdGetTessLevelsUniformTriangle ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi Screenspace void OsdEvalPatchBezierTessLevels OsdPerPatchVertexBezier cpBezier 16 , ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi void OsdEvalPatchBezierTriangleTessLevels vec3 cv 15 , ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"Overview of Release 3.2\",\n+ \"text\": \"Overview of Release 3.2 Overview of Release 3.2 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Face-Varying Stencil Evaluation 1st and 2nd Derivative Evaluation Smooth Corner Patch API Additions OsdCpuEvaluator, GLComputeEvaluator, etc OsdMesh OsdMeshBits FarPatchTableFactoryOptions FarStencilTableFactory FarStencilTableFactoryOptions Other Changes Improvements Bug Fixes New Features Face-Varying Stencil Evaluation Face-Varying primvar values may now be refined using stencil tables. The stencil table for a face-varying channel is created by specifying the desired fvarChannel and setting the FarStencilTableFactoryOption interpolationMode to INTERPOLATE_FACE_VARYING when creating the stencil table. 1st and 2nd Derivative Evaluation The Osd Evaluator API has been extended to support 1st derivative and 2nd partial derivative evaluation for stencils and patches. 1st Derivative Surface Normal 2nd Derivative Surface Curvature On the left is an example of computing a surface normal at each point using the evaluated 1st derivatives, while on the right is an example of computing surface curvature at each point using the evaluated 2nd partial derivatives. Smooth Corner Patch An option has been added to disable the legacy behavior of generating a sharp-corner patch at a smooth corner. Corners which are actually sharp will continue to generate sharp-corner patches. The differences between the two methods is most apparent at low-levels of feature isolation. This feature is controlled by the generateLegacySharpCornerPatches option added to FarPatchTableFactoryOptions. Sharp Corner Patch legacy behavior Smooth Corner Patch On the left is the legacy behavior of generating sharp corner patches at smooth corners. The image on the right shows the correct smooth corner patches generated when this legacy behavior is disabled. API Additions See associated Doxygen for full details. OsdCpuEvaluator, GLComputeEvaluator, etc Create EvalStencils EvalPatches EvalPatchesVarying EvalPatchesFaceVarying OsdMesh Create OsdMeshBits member MeshUseSmoothCornerPatch FarPatchTableFactoryOptions member generateLegacySharpCornerPatches FarStencilTableFactory enumeration ModeINTERPOLATE_FACE_VARYING AppendLocalPointStencilTableFaceVarying FarStencilTableFactoryOptions member fvarChannel Other Changes Improvements Corrected numerous spelling errors in doxygen comments Updated glFVarViewer with improved error detection and command line parsing Added option to build using MSVC with static CRT Bug Fixes Fixed a double delete of GL program in OsdGLComputeEvaluator Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"osd_shader_interface.html\"\n+ \"loc\": \"release_32.html\"\n+ }, {\n+ \"title\": \"Porting Guide 2.x to 3.0\",\n+ \"text\": \"Porting Guide 2.x to 3.0 Porting Guide 2.x to 3.0 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Porting Guide 2.x to 3.0 Source Code Organization Hbr Layer Translation Subdivision Schemes and Options in Sdc Specifying Face Varying Topology and Options Far Layer Translation Ordering of Refined Vertices Osd Layer Translation Controller Objects ComputeContext, DrawContext EvalLimitContext OsdMesh OsdKernelBatch OsdVertex Feature Adaptive Shader Changes End Cap Strategies Changes to Subdivision Build Support for Combining 2.x and 3.0 Porting Guide 2.x to 3.0 This document is a high-level description of how to port exiting OpenSubdiv 2.x code to use OpenSubdiv 3.0. NOTE If your questions are not answered here, please contact us on the OpenSubdiv forum and we will be happy to help Source Code Organization Given the scale of functional changes that were being made to the public interface, we took the opportunity in 3.0 to update the coding style and organization -- most notably making use of namespaces for each library. Subdirectory Namespace Relevance hbr NA Historical, no longer used sdc Sdc New, low-level, public options, constants, etc. vtr Vtr New, internal use, topology representation far Far Revised, similar functionality with new API osd Osd Revised, similar functionality with new API Hbr Layer Translation Client mesh topology is now translated into an instance of FarTopologyRefiner instead of HbrMesh. OpenSubdiv 2.x OpenSubdiv 3.0 HbrMeshVTX_TYPE FarTopologyRefiner The FarTopologyRefiner is now the core representation of topology from which all other major classes in Far and Osd are constructed. It was designed to support efficient refinement uniform or sparse of a base mesh of arbitrary topology no manifold restrictions. Once constructed it can be directly refined to meet some need, or passed to other contexts that will refine it to meet their needs. In contrast to directly assembling an HbrMesh, the TopologyRefiner, like other classes in Far, requires a Factory class for its construction. One of the early goals of these factories was to allow a client to convert their existing boundary representation -- with its full topological traversal abilities -- directly into the TopologyRefiners representation. While this is now possible, this also represents the most complex construction process and is only recommended for usage where this conversion process is critical. Details on how to construct a TopologyRefiner can be found in the Far overview documentation. Additionally, documentation for FarTopologyRefinerFactoryMESH outlines the requirements, and Far tutorial 3.1 tutorialsfartutorial_3_1 provides an example of a factory for directly converting HbrMeshes to TopologyRefiners. Its worth a reminder here that FarTopologyRefiner contains only topological information which does include sharpness, since that is considered relating to subdivision topology and not the positions or other data associated with a mesh. While HbrMeshT required some definition of a vertex type T and dimensions of face-varying data, TopologyRefiner is more clearly separated from the data. So the construction of the TopologyRefiner does not involve data specification at all. Subdivision Schemes and Options in Sdc The creation of a new TopologyRefiner requires specification of a subdivision scheme and a set of options that are applicable to all schemes. With HbrMesh, the scheme was specified by declaring a static instance of a specific subclass of a subdivision object, and the options were specified with a number of methods on the different classes. Such general information about the schemes has now been encapsulated in the Sdc layer for use throughout OpenSubdiv. The subdivision scheme is now a simple enumerated type SdcSchemeType and the entire set of options that can be applied to a scheme is encapsulated in a single simple struct of flags and enumerated types SdcOptions. OpenSubdiv 2.x OpenSubdiv 3.0 HbrMeshTSetInterpolateBoundaryMethod SdcOptionsSetVtxBoundaryInterpolation HbrMeshTSetFVarInterpolateBoundaryMethod SdcOptionsSetFVarLinearInterpolation HbrSubdivisionTSetCreaseSubdivisionMethod SdcOptionsSetCreasingMethod Specifying Face Varying Topology and Options Both the way in which face varying data is associated with a mesh and the options used to control its interpolation have changed. The documentation on Compatibility with OpenSubdiv 2.x details the equivalence of interpolation options between Hbr and the new SdcOptionsFVarLinearInterpolation enum, while the section on Face Varying Interpolation illustrates their effects. Face varying data is now specified by index rather than by value, or as often stated, it is specified topologically. Just as vertices for faces are specified by indices into a potential buffer of positions, face varying values are specified by indices into a potential buffer of values. Both vertices and face varying values frequently referred to as FVarValues in the API are assigned and associated with the corners of all faces. In many cases this will simplify representation as many common geometry container formats such as Obj or Alembic specify texture coordinates the same way. For other cases, where a value per face-corner is provided with no indication of which values incident each vertex should be considered shared, it will be necessary to determine shared indices for values at each vertex if any non-linear interpolation is desired. Far Layer Translation While TopologyRefiner was introduced into Far as the new intermediate topology representation, several other changes were made to classes in Far to provide more modular building blocks for use by the Osd layer or directly. OpenSubdiv 2.x OpenSubdiv 3.0 FarMeshU NA, no longer needed FarSubdivisionTables FarStencilTable FarPatchTables FarPatchTable Ordering of Refined Vertices The FarMesh was previously responsible for refining an HbrMesh -- generating new vertices and faces in successive levels of refinement in the FarSubdivisionTables. Vertices were grouped and reordered from the native ordering of HbrMesh so that vertices requiring similar processing were consecutive. Such grouping alleviated most of the idiosyncrasies of HbrMeshs native ordering but not all. FarToplogyRefiner is inherently a collection of refinement levels, and within each refined level so excluding the base level, all components are still grouped for the same reasons. There are two issues here though the ordering of these groups has changed though an option exists to preserve it the ordering of components within these groups is not guaranteed to have been preserved Vertices in a refined level are grouped according to the type of component in the parent level from which they originated, i.e. some vertices originate from the center of a face face-vertices, some from an edge edge-vertices and some from a vertex vertex-vertices. Note that there is a conflict in terminology here -- face-vertices and edge-vertices most often refer to vertices incident a face or edge -- but for the sake of this discussion, we use them to refer to the component from which a child vertex originates. The following table shows the ordering of these groups in 2.x and the two choices available in 3.0. The option is the orderVerticesFromFacesFirst flag that can be set in the Option structs passed to the uniform and adaptive refinement methods of TopologyRefiner Version and option Vertex group ordering 2.x face-vertices, edge-vertices, vertex-vertices 3.0 default vertex-vertices, face-vertices, edge-vertices 3.0 orderVerticesFromFacesFirst true face-vertices, edge-vertices, vertex-vertices The decision to change the default ordering was based on common feedback the rationale was to allow a trivial mapping from vertices in the cage to their descendants at all refinement levels. While the grouping is fundamental to the refinement process, the ordering of the groups is internally flexible, and the full set of possible orderings can be made publicly available in future if there is demand for such flexibility. The ordering of vertices within these groups was never clearly defined given the way that HbrMesh applied its refinement. For example, for the face-vertices in a level, it was never clear which face-vertices would be first as it depended on the order in which HbrMesh traversed the parent faces and generated them. Given one face, HbrMesh would often visit neighboring faces first before moving to the next intended face. The ordering with FarTopologyRefiner is much clearer and predictable. Using the face-vertices as an example, the order of the face-vertices in level N1 is identical to the order of the parent faces in level N from which they originated. So if we have face-vertices Vi , Vj and Vk at some level, originating from faces Fi , Fj and Fk in the previous level, they will be ordered in increasing order of i , j and k . For uniform refinement the ordering of face vertices Vi will therefore exactly match the ordering of the parent faces Fi . For adaptive or otherwise sparse refinement, the subset of Vi will be ordered similarly, just with components missing from those not refined. The same is true of all vertices, i.e. edge-vertices and vertex-vertices, and also for other components in refined levels, i.e. the child faces and edges. For child faces and edges, more than one will originate from the same parent face or edge. In addition to the overall ordering based on the parent faces or edges, another ordering is imposed on multiple children originating from the same face or edge. They will be ordered based on the corner or end-vertex with which they are associated. In the case of refined faces, another way to view the ordering is to consider the way that faces are originally defined -- by specifying the set of vertices for the corners of each face, often aggregated into a single large array. The ordering of the set of refined faces for each level will correspond directly to such an array of vertices per face in the previous level. Osd Layer Translation Two big changes in the 3.0 API have allowed the Osd layer to be significantly simpler, the first is the move to stencil tables from subdivision tables and the second is shader simplification. With this refactoring, the focus has been to use more meaningful names and to make the data contained within an object more apparent. Controller Objects The API-specific ComputeController has been replaced with the Evaluator . It reflects the fact that stencil compute batches are significantly simpler than subdivision table compute batches. The name Evaluator was chosen with the hope that is more meaningful than the generic ComputeController moniker the Evaluator evaluates stencil and patch tables. In the 2.x code base, subdiv level buffers were always required to be allocated contiguously, however in 3.0 with the shift to stencil tables, this strict allocation scheme is no longer required. As a result, the EvalStencils and EvalPatches methods now accept both a source and a destination descriptor. OpenSubdiv 2.x OpenSubdiv 3.0 ComputeControllerRefine Osd...EvaluatorEvalStencils ComputeControllerSynchronize Osd...EvaluatorSynchronize EvalStencilsControllerUpdateValues Osd...EvaluatorEvalStencils EvalStencilsControllerUpdateDerivs Osd...EvaluatorEvalStencils EvalLimitControllerEvalLimitSample Osd...EvaluatorEvalPatches Also note that OsdVertexDescriptor has been renamed, however its data members and semantic purpose remains the same OpenSubdiv 2.x OpenSubdiv 3.0 OsdVertexBufferDescriptor OsdBufferDescriptor ComputeContext, DrawContext ComputeContext and DrawContext have been replaced with API-specific StencilTable and PatchTable objects, for example OsdGLStencilTableSSBO. OpenSubdiv 2.x OpenSubdiv 3.0 ComputeContext Osd...StencilTable e.g. GLStencilTableTBO EvalStencilsContext Osd...StencilTable DrawContext Osd...PatchTable e.g. GLPatchTable EvalLimitContext The data stored in EvalLimitContext has been merged into the Evaluator class as well. EvalCoords have been moved into their own type, OsdPatchCoords. The primary change here is that the PTex face ID is no longer part of the data structure, rather the client can use a FarPatchMap to convert from PTex face ID to a FarPatchTablePatchHandle. OpenSubdiv 2.x OpenSubdiv 3.0 EvalLimitContext PatchTable EvalLimitContextEvalCoords OsdPatchCoords types.h OsdMesh While not strictly required, OsdMesh is still supported in 3.0 as convenience API for allocating buffers. OsdMesh serves as a simple way to allocate all required data, in the location required by the API for example, GPU buffers for OpenGL. OsdKernelBatch No translation, it is no longer part of the API. OsdVertex No translation, it is no longer part of the API. Feature Adaptive Shader Changes In 3.0, the feature adaptive screen-space tessellation shaders have been dramatically simplified, and the client-facing API has changed dramatically as well. The primary shift is to reduce the total number of shader combinations, and as a result, some of the complexity management mechanisms are no longer necessary. In the discussion below, some key changes are highlighted, but deep integrations may require additional discussion please feel free to send follow up questions to the OpenSubdiv google group. The number of feature adaptive shaders has been reduced from N to exactly 1 or 2, depending on how end-caps are handled. Osd layer no longer compiles shaders, rather it returns shader source for the client to compile. This source is obtained via OsdGLSLHLSLPatchShaderSource. The API exposed in shaders to access patch-based data has been consolidated and formalized, see osdglslPatchCommon.glsl and osdhlslPatchCommon.hlsl for details. Patches are no longer rotated and transition patches have been eliminated, simplifying PatchDescriptor to a 4 bits. Additionally, FarPatchTablesDescriptor has been moved into its own class in the Far namespace. The following table outlines the API translation between 2.x and 3.0 OpenSubdiv 2.x OpenSubdiv 3.0 OsdDrawContextPatchDescriptor NA, no longer needed. OsdDrawContextPatchArray OSdPatchArray types.h FarPatchTablesPatchDescriptor FarPatchDescriptor patchDescriptor.h FarPatchTablesPatchArray made private. End Cap Strategies By default, OpenSubdiv uses Gregory patches to approximate the patches around extraordinary vertices at the maximum isolation level, this process is referred to as end-capping. If ENDCAP_BSPLINE_BASIS is specified to PatchTableFactoryOptions, BSpline patches are used, which gives less accuracy, but it makes possible to render an entire mesh in a single draw call. Both patches require additional control points that are not part of the mesh, we refer to these as local points. In 3.0, the local points of those patches are computed by applying a stencil table to refined vertices to construct a new stencil table for the local points. Since this new stencil table is topologically compatible with the primary stencil table for refinement, it is convenient and efficient to splice those stencil tables together. This splicing can be done in the following way FarStencilTable const refineStencils FarStencilTableFactoryCreatetopologyRefiner FarPatchTable cosnt patchTable FarPatchTableFactoryCreatetopologyRefiner FarStencilTable const localPointStencils patchTable-GetLocalPointStencilTable FarStencilTable const splicedStencils FarStencilTableFactoryAppendLocalPointStencilTablestopologyRefiner, refineStencils, localPointStencils NOTE Once the spliced stencil table is created, the refined stencils can be released, but the local point stencils are owned by patchTable, it should not be released. OpenSubdiv 3.0 also supports 2.x style Gregory patches, if ENDCAP_LEGACY_GREGORY is specified to PatchTableFactoryOptions. In this case, such an extra stencil splicing isnt needed, however clients must still bind additional buffers VertexValence buffer and QuadOffsets buffer. See OsdGLLegacyGregoryPatchTable for additional details. Changes to Subdivision The refactoring of OpenSubdiv 3.0 data representations presented a unique opportunity to revisit some corners of the subdivision specification and remove or update some legacy features -- none of which was taken lightly. More details are provided in Subdivision Compatibility , while the following offers a quick overview All face-varying interpolation options have been combined into a single enum. Vertex interpolation options have been renamed or removed The naming of the standard creasing method has changed from Normal to Uniform . Unused legacy modes of the smoothtriangle option have been removed. The averaging of Chaikin creasing with infinitely sharp edges has changed. Support for Hierarchical Edits has been removed. Build Support for Combining 2.x and 3.0 Running OpenSubdiv 2.0 and 3.0 in a single process is supported, however some special care must be taken to avoid namespace collisions, both in terms of run-time symbols avoid using OpenSubdivOsd, for example and in terms of build-time search paths. To support both OpenSubdiv 2.0 and 3.0 in your build environment, you can prefix the header install directory of OpenSubdiv 3.0. Do this using the build flag CMAKE_INCDIR_BASE when configuring cmake i.e. -DCMAKE_INCDIR_BASEincludeopensubdiv3 and then including files from opensubdiv3... in client code. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"porting.html\"\n }, {\n \"title\": \"References\",\n \"text\": \"References References 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE References References Analytic Displacement Mapping using Hardware Tessellation Matthias Niessner, Charles Loop ACM Transactions on Graphics, Vol. 32 No. 3 Article 26 June 2013 httpresearch.microsoft.comen-usumpeoplecloopTOG2013.pdf httpdoi.org10.11452487228.2487234 Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces Matthias Niessner, Charles Loop, Mark Meyer, and Tony DeRose ACM Transactions on Graphics, Vol. 31 No. 1 Article 6 January 2012 httpresearch.microsoft.comen-usumpeopleclooptog2012.pdf httpdoi.org10.11452077341.2077347 Efficient Evaluation of Semi-Smooth Creases in Catmull-Clark Subdivision Surfaces Matthias Niessner, Charles Loop, and Guenter Greiner. Eurographics Proceedings, Cagliari, 2012 httpresearch.microsoft.comen-usumpeoplecloopEG2012.pdf httpdoi.org10.2312confEG2012short041-044 Approximating Subdivision Surfaces with Gregory Patches for Hardware Tessellation Charles Loop, Scott Schaefer, Tianyun Ni, Ignacio Castano SIGGRAPH Asia Conference Proceedings 2009 httpwww.dgp.toronto.edupeoplestamrealityResearchpdfsig98.pdf httpdoi.org10.11451661412.1618497 GPU Smoothing of Quad Meshes T. L. Ni, Y. Yeo, A. Myles, V. Goel and J. Peters Proc. IEEE SMI 2008 httpwww.cise.ufl.eduresearchSurfLabpaperssmi08.pdf httpdoi.org10.1109SMI.2008.4547938 Fast Parallel Construction of Smooth Surfaces from Meshes with TriQuadPent Facets A. Myles and T. Ni and J. Peters Eurographics Symposium on Geometry Processing 2008 httpswww.cise.ufl.eduresearchSurfLabpapers08poly.pdf httpdoi.org10.1111j.1467-8659.2008.01276.x Approximating Catmull-Clark Subdivision Surfaces with Bicubic Patches Charles Loop, Scott Schaefer ACM Transactions on Graphics, Vol. 27 No. 1 Article 8 March 2008 httpresearch.microsoft.comen-usumpeoplecloopacctog.pdf httpdoi.org10.11451330511.1330519 Rapid Evaluation of Catmull-Clark Subdivision Surfaces Jeffrey Bolz and Peter Schroder Web3D Proceedings 2002 httpwww.multires.caltech.edupubsfastsubd.pdf httpdoi.org10.1145504502.504505 Piecewise Smooth Subdivision Surfaces with Normal Control Henning Biermann, Adi Levin and Denis Zorin SIGGRAPH 2000 Conference Proceedings httpmrl.nyu.edudzorinpapersbiermann2000pss.pdf httpdoi.org10.1145344779.344841 Subdivision for Modeling and Animation Denis Zorin, Peter Schroder Course Notes of SIGGRAPH 1999 httpwww.multires.caltech.edupubssig99notes.pdf Exact Evaluation of Catmull-Clark Subdivision Surfaces at Arbitrary Parameter Values Jos Stam SIGGRAPH 98 Conference Proceedings, Annual Conference Series, July 1998 httpwww.dgp.toronto.edupeoplestamrealityResearchpdfsig98.pdf httpdoi.org10.1145280814.280945 Subdivision Surfaces in Character Animation Tony DeRose, Michael Kass, Tien Truong Proceedings of SIGGRAPH 1998 httpgraphics.pixar.comlibraryGeripaper.pdf httpdoi.org10.1145280814.280826 Efficient, Fair Interpolation Using Catmull-Clark Surfaces Mark Halstead, Michael Kass, Tony DeRose SIGGRAPH 93 Conference Proceedings httpgraphics.pixar.comlibraryFairSubdivisionpaper.pdf httpdoi.org10.1145166117.166121 Recursively generated B-spline surfaces on arbitrary topological meshes Catmull, E. Clark, J. Computer-Aided Design 10 6 1978 httpdoi.org10.10160010-448528782990110-0 Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"references.html\"\n }, {\n+ \"title\": \"OSD Tessellation shader Interface\",\n+ \"text\": \"OSD Tessellation shader Interface OSD Tessellation shader Interface 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Basic Tessellation Control Shader Example for B-Spline patches Tessellation Evaluation Shader Example for B-Spline patches Basis Conversion B-spline Patch Gregory Basis Patch Box-spline Triangle Patch Gregory Triangle Patch Legacy Gregory Patch 2.x compatibility Tessellation levels Tessellation levels at each tessellated vertex Tessellation levels computed at each patch Uniform Screenspace Basic Starting with 3.0, Osd tessellation shaders can be used as a set of functions from client shader code. In order to tessellate Osd patches, client shader code should perform the following steps regular B-spline patch case In a tessellation control shader fetch a PatchParam for the current patch call OsdComputePerPatchVertexBSpline to compute OsdPerPatchVertexBezier. compute tessellation level. To prevent cracks on transition patches, two vec4 parameters tessOuterHi, tessOuterLo will be needed in addition to built-in gl_TessLevelInnerOuters. In a tessellation evaluation shader call OsdGetTessParameterization to remap gl_TessCoord to a patch parameter at which to evaluate. call OsdEvalPatchBezierOsdEvalPatchGregory to evaluate the current patch. The following is a minimal example of GLSL code explaining how client shader code uses OpenSubdiv shader functions to tessellate patches of a patch table. Tessellation Control Shader Example for B-Spline patches layout vertices 16 out in vec3 position patch out vec4 tessOuterLo , tessOuterHi out OsdPerPatchVertexBezier v void main Get a patch param from texture buffer. ivec3 patchParam OsdGetPatchParam gl_PrimitiveID Compute per-patch vertices. OsdComputePerPatchVertexBSpline patchParam , gl_InvocationID , position , v Compute tessellation factors. if gl_InvocationID 0 vec4 tessLevelOuter vec4 0 vec2 tessLevelInner vec2 0 OsdGetTessLevelsUniform patchParam , tessLevelOuter , tessLevelInner , tessOuterLo , tessOuterHi gl_TessLevelOuter 0 tessLevelOuter 0 gl_TessLevelOuter 1 tessLevelOuter 1 gl_TessLevelOuter 2 tessLevelOuter 2 gl_TessLevelOuter 3 tessLevelOuter 3 gl_TessLevelInner 0 tessLevelInner 0 gl_TessLevelInner 1 tessLevelInner 1 Tessellation Evaluation Shader Example for B-Spline patches layout quads in patch in vec4 tessOuterLo , tessOuterHi in OsdPerPatchVertexBezier v uniform mat4 mvpMatrix void main Compute tesscoord. vec2 UV OsdGetTessParameterization gl_TessCoord . xy , tessOuterLo , tessOuterHi vec3 P vec3 0 , dPu vec3 0 , dPv vec3 0 vec3 N vec3 0 , dNu vec3 0 , dNv vec3 0 ivec3 patchParam inpt 0 . v . patchParam Evaluate patch at the tess coord UV OsdEvalPatchBezier patchParam , UV , v , P , dPu , dPv , N , dNu , dNv Apply model-view-projection matrix. gl_Position mvpMatrix vec4 P , 1 Basis Conversion B-spline Patch The following diagram shows how the Osd shaders process b-spline patches. While regular patches are expressed as b-spline patches in FarPatchTable, the Osd shader converts them into Bezier basis patches for simplicity and efficiency. This conversion is performed in the tessellation control stage. The boundary edge evaluation and single crease matrix evaluation are also resolved during this conversion. OsdComputePerPatchVertexBSpline can be used for this process. The resulting Bezier control vertices are stored in OsdPerPatchVertexBezier struct. void OsdComputePerPatchVertexBSpline ivec3 patchParam , int ID , vec3 cv 16 , out OsdPerPatchVertexBezier result The tessellation evaluation shader takes an array of OsdPerPatchVertexBezier struct, and then evaluates the patch using the OsdEvalPatchBezier function. void OsdEvalPatchBezier ivec3 patchParam , vec2 UV , OsdPerPatchVertexBezier cv 16 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Gregory Basis Patch In a similar way, Gregory basis patches are processed as follows OsdComputePerPatchVertexGregoryBasis can be used for the Gregory patches although no basis conversion involved for the Gregory patches and the resulting vertices are stored in a OsdPerPatchVertexGreogryBasis struct. void OsdComputePerPatchVertexGregoryBasis ivec3 patchParam , int ID , vec3 cv , out OsdPerPatchVertexGregoryBasis result The tessellation evaluation shader takes an array of OsdPerPatchVertexGregoryBasis struct, and then evaluates the patch using the OsdEvalPatchGregory function. void OsdEvalPatchGregory ivec3 patchParam , vec2 UV , vec3 cv 20 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Box-spline Triangle Patch While regular triangle patches are expressed as triangular box-spline patches in FarPatchTable, the Osd shader converts them into triangular Bezier patches for consistency. This conversion is performed in the tessellation control stage. The boundary edge evaluation is resolved during this conversion. OsdComputePerPatchVertexBoxSplineTriangle can be used for this process. The resulting Bezier control vertices are stored in OsdPerPatchVertexBezier struct. void OsdComputePerPatchVertexBoxSplineTriangle ivec3 patchParam , int ID , vec3 cv 12 , out OsdPerPatchVertexBezier result The tessellation evaluation shader takes an array of OsdPerPatchVertexBezier struct, and then evaluates the patch using the OsdEvalPatchBezierTriangle function. void OsdEvalPatchBezierTriangle ivec3 patchParam , vec2 UV , OsdPerPatchVertexBezier cv 15 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Gregory Triangle Patch OsdComputePerPatchVertexGregoryBasis can be used for the quartic triangular Gregory patches although no basis conversion involved for the Gregory triangle patches and the resulting vertices are stored in a OsdPerPatchVertexGreogryBasis struct. void OsdComputePerPatchVertexGregoryBasis ivec3 patchParam , int ID , vec3 cv , out OsdPerPatchVertexGregoryBasis result The tessellation evaluation shader takes an array of OsdPerPatchVertexGregoryBasis struct, and then evaluates the patch using the OsdEvalPatchGregoryTriangle function. void OsdEvalPatchGregoryTriangle ivec3 patchParam , vec2 UV , vec3 cv 18 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Legacy Gregory Patch 2.x compatibility OpenSubdiv 3.0 also supports 2.x style Gregory patch evaluation see far_overview. In order to evaluate a legacy Gregory patch, client needs to bind extra buffers and to perform extra steps in the vertex shader as shown in the following diagram Tessellation levels Osd provides both uniform and screen-space adaptive tessellation level computation. Because of the nature of feature adaptive subdivision , we need to pay extra attention for a patchs outer tessellation level for the screen-space adaptive case so that cracks dont appear. An edge of the patch marked as a transition edge is split into two segments Hi and Lo. The Osd shaders uses these two segments to ensure the same tessellation along the edge between different levels of subdivision. In the following example, suppose the left hand side patch has determined the tessellation level of its right edge to be 5. gl_TessLevelOuter is set to 5 for the edge, and at the same time we also pass 2 and 3 to the tessellation evaluation shader as separate levels for the two segments of the edge split at the middle. Tessellation levels at each tessellated vertex The tessellation evaluation shader takes gl_TessCoord and those two values, and remaps gl_TessCoord using OsdGetTessParameterization or OsdGetTessLevelParameterizationTriangle to ensure the parameters are consistent across adjacent patches. vec2 OsdGetTessParameterization vec2 uv , vec4 tessOuterLo , vec4 tessOuterHi vec2 OsdGetTessParameterizationTriangle vec3 uvw , vec4 tessOuterLo , vec4 tessOuterHi Tessellation levels computed at each patch These tessellation levels can be computed the corresponding method in the tesselation control shader. Note that these functions potentially requires all bezier control points, you need to call barrier to ensure the conversion is done for all invocations. See osdglslPatchBSpline.glsl for more details. Uniform void OsdGetTessLevelsUniform ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi void OsdGetTessLevelsUniformTriangle ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi Screenspace void OsdEvalPatchBezierTessLevels OsdPerPatchVertexBezier cpBezier 16 , ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi void OsdEvalPatchBezierTriangleTessLevels vec3 cv 15 , ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"osd_shader_interface.html\"\n+ }, {\n \"title\": \"OSD Overview\",\n \"text\": \"OSD Overview OSD Overview 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE OpenSubdiv Osd Refinement Limit Stencil Evaluation Limit Evaluation with PatchTable OpenGLDX11Metal Drawing with Hardware Tessellation InterleavedBatched Buffer Configuration Cross-Platform Implementation OpenSubdiv Osd Osd contains device dependent code that makes Far structures available on various backends such as TBB, CUDA, OpenCL, GLSL, etc. The main roles of Osd are Refinement Compute stencil-based uniformadaptive subdivision on CPUGPU backends Limit Stencil Evaluation Compute limit surfaces by limit stencils on CPUGPU backends Limit Evaluation with PatchTable Compute limit surfaces by patch evaluation on CPUGPU backends OpenGLDX11Metal Drawing with hardware tessellation Provide GLSLHLSLMetal tessellation functions for patch table InterleavedBatched buffer configuration Provide consistent buffer descriptor to deal with arbitrary buffer layout. Cross-Platform Implementation Provide convenient classes to interop between compute and draw APIs These are independently used by clients. For example, a client can use only the limit stencil evaluation, or a client can refine subdivision surfaces and draw them with the PatchTable and Osd tessellation shaders. All device specific evaluation kernels are implemented in the Evaluator classes. Since Evaluators dont own vertex buffers, clients should provide their own buffers as a source and destination. There are some interop classes defined in Osd for convenience. OpenSubdiv utilizes a series of regression tests to compare and enforce identical results across different computational devices. Refinement Osd supports both uniform and feature adaptive subdivision. Once clients create a FarStencilTable for the topology, they can convert it into device-specific stencil tables if necessary. The following table shows which evaluator classes and stencil table interfaces can be used together. Note that while Osd provides these stencil table classes which can be easily constructed from FarStencilTable, clients arent required to use these table classes. Clients may have their own entities as a stencil tables as long as EvaluatorEvalStencils can access the necessary interfaces. Backend Evaluator class compatible stencil table CPU CPU single-threaded CpuEvaluator FarStencilTable TBB CPU multi-threaded TbbEvaluator FarStencilTable OpenMP CPU multi-threaded OmpEvaluator FarStencilTable CUDA GPU CudaEvaluator CudaStencilTable OpenCL CPUGPU CLEvaluator CLStencilTable GL ComputeShader GPU GLComputeEvaluator GLStencilTableSSBO GL Transform Feedback GPU GLXFBEvaluator GLStencilTableTBO DX11 ComputeShader GPU D3D11ComputeEvaluator D3D11StencilTable Metal GPU MTLComputeEvaluator MTLStencilTable Limit Stencil Evaluation Limit stencil evaluation is quite similar to refinement in Osd . At first clients create FarLimitStencilTable for the locations to evaluate the limit surfaces, then convert it into an evaluator compatible stencil table and call EvaluatorEvalStencils. Limit Evaluation with PatchTable Another way to evaluate the limit surfaces is to use the PatchTable. Once all control vertices and local points are resolved by the stencil evaluation, Osd can evaluate the limit surfaces through the PatchTable. Backend Evaluator class compatible patch table CPU CPU single-threaded CpuEvaluator CpuPatchTable TBB CPU multi-threaded TbbEvaluator CpuPatchTable OpenMP CPU multi-threaded OmpEvaluator CpuPatchTable CUDA GPU CudaEvaluator CudaPatchTable OpenCL CPUGPU CLEvaluator CLPatchTable GL ComputeShader GPU GLComputeEvaluator GLPatchTable GL Transform Feedback GPU GLXFBEvaluator GLPatchTable DX11 ComputeShader GPU D3D11ComputeEvaluator not yet supported D3D11PatchTable Metal ComputeShader GPU MTLComputeEvaluator MTLPatchTable Release Notes 3.x Osd evaluation backends EvaluatorEvalPatches do not support evaluation of single-crease or Legacy Gregory patch types. OpenGLDX11Metal Drawing with Hardware Tessellation One of the most interesting use cases of the Osd layer is realtime drawing of subdivision surfaces using hardware tessellation. This is somewhat similar to limit evaluation with PatchTable described above. Drawing differs from limit evaluation in that Osd provides shader snippets for patch evaluation and clients will inject them into their own shader source. See shader interface for a more detailed discussion of the shader interface. InterleavedBatched Buffer Configuration All Osd layer APIs assume that each primitive variables to be computed points, colors, uvs ... are contiguous arrays of 32bit floating point values. The Osd API refers to such an array as a buffer. A buffer can exist on CPU memory or GPU memory. Osd Evaluators typically take one source buffer and one destination buffer, or three destination buffers if derivatives are being computed. Osd Evaluators also take BufferDescriptors, that are used to specify the layout of the source and destination buffers. A BufferDescriptor is a struct of 3 integers which specify an offset, length and stride. For example Vertex 0 Vertex 1 ... X Y Z X Y Z ... The layout of this buffer can be described as Osd BufferDescriptor desc offset 0 , length 3 , stride 3 BufferDescriptor can be used for an interleaved buffer too. Vertex 0 Vertex 1 ... X Y Z R G B A X Y Z R G B A ... Osd BufferDescriptor xyzDesc 0 , 3 , 7 Osd BufferDescriptor rgbaDesc 3 , 4 , 7 Although the source and destination buffers dont need to be the same buffer for EvalStencils, adaptive patch tables are constructed to first index the coarse vertices and the refined vertices immediately afterward. In this case, the BufferDescriptor for the destination should include the offset as the number of coarse vertices to be skipped. Coarse vertices n Src Refined vertices Dst Vertex 0 Vertex 1 ... Vertex n Vertex n1 X Y Z X Y Z ... X Y Z X Y Z ... Osd BufferDescriptor srcDesc 0 , 3 , 3 Osd BufferDescriptor dstDesc n 3 , 3 , 3 Also note that the source descriptor doesnt have to start with offset 0. This is useful when a client has a big buffer with multiple objects batched together. Cross-Platform Implementation One of the key goals of OpenSubdiv is to achieve as much cross-platform flexibility as possible and leverage all optimized hardware paths where available. This can be very challenging as there is a very large variety of plaftorms and APIs available, with very distinct capabilities. In Osd , Evaluators dont care about interops between those APIs. All Evaluators have two kinds of APIs for both EvalStencils and EvalPatches. Explicit signatures which directly take device-specific buffer representation e.g., pointer for CpuEvaluator, GLuint buffer for GLComputeEvaluator, etc. Generic signatures which take arbitrary buffer classes. The buffer class is required to have a certain method to return the device-specific buffer representation. The later interface is useful if the client supports multiple backends at the same time. The methods that need to be implemented for the Evaluators are Evaluator class object method CpuEvaluator TbbEvaluator OmpEvaluator pointer to cpu memory BindCpuBuffer CudaEvaluator pointer to cuda memory BindCudaBuffer CLEvaluator cl_mem BindCLBuffer GLComputeEvaluator GLXFBEvaluator GL buffer object BindVBO D3D11ComputeEvaluator D3D11 UAV BindD3D11UAV MTLComputeEvaluator MTLBuffer BindMTLBuffer The buffers can use these methods as a trigger of interop. Osd provides a default implementation of interop buffer for most of the backend combinations. For example, if the client wants to use CUDA as a computation backend and use OpenGL as the drawing API, OsdCudaGLVertexBuffer fits the case since it implements BindCudaBuffer and BindVBO. Again, clients can implement their own buffer class and pass it to the Evaluators. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"osd_overview.html\"\n }, {\n \"title\": \"mtlPtexViewer\",\n \"text\": \"mtlPtexViewer mtlPtexViewer 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION KEYBOARD CONTROLS SEE ALSO SYNOPSIS open mtlPtexViewer.app --args -yup -u -a -l isolation level ptex color file ptex displacement file DESCRIPTION mtlPtexViewer is a stand-alone application demonstrating shading with color and displacement ptex maps. Multiple controls are available to experiment with the algorithms. KEYBOARD CONTROLS q quit f fit frame - increase decrease tessellation rate SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"mtlptexviewer.html\"\n }, {\n- \"title\": \"Modeling Tips\",\n- \"text\": \"Modeling Tips Modeling Tips 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Topology Use Fewer Spans Avoid High Valence vertices Edge-Loop Transitions Practical Topology Primer Triangles and N-Gons Semi-Sharp Creases Use crease sets Additional Resources The following sections describe common techniques specific to modeling with subdivision surfaces. Note The following information contains techniques specific to the Catmull-Clark subdivision scheme. Some elements need to be adjusted for Loop surfaces. Topology Well-constructed subdivision meshes have several important properties They consist primarily of regular faces quads for Catmull-Clark, tris for Loop They contain few extraordinary vertices They efficiently describe the intended shape They are topologically manifold Use Fewer Spans While polygon models need to use a large number of spans to approximate smooth curved surfaces, subdivision models require significantly fewer control points. In most situations, 6 spans are enough to create accurate circular shapes, and 4 is often enough to approximate background objects. Avoid High Valence vertices A high valence vertex is a vertex connected to more than 4 adjacent edges. High valence vertices cause several problems when subdivided The Catmull-Clark scheme can produce wavy surfaces when a revolution vertex is surrounded by triangles see here High valence vertices incur fairly large performance hits Currently, OpenSubdiv has a hard constraint imposed by GPU shaders on the maximum valence of a vertex 27 on current hardware Instead, here are some topological strategies to cap revolution shapes Note that all these cylinders use only quad faces, and all the vertices in the caps have a valence of 4 except the bottom left example Edge-Loop Transitions It is often necessary to vary the density of control vertices over the surface mesh areas around the fingers of a hand require more CVs than the comparatively simpler region around the palm. It is important to handle the topology around these transitions efficiently. One strategy is to use extraordinary vertices, such as this example, using a valence 5 vertex to expand 3 edge loops into 5. Practical Topology Primer Some real-world examples showing how to produce detailed shapes with sparse topology, few extraordinary vertices, and no high-valence revolution poles. Triangles and N-Gons Used sparsely, non-quads can be very useful to gather 3 or more diverging edge-loops. These are often encountered in highly deforming areas with curvature saddle-points ex arm-torso connection. The strategic placement of a pentagon in one of these critical spots ensures that the surface remains smooth, while allowing for complex topology to flow around. Semi-Sharp Creases Semi-sharp creases can be a very powerful tool for hard-surface modeling. Both edges and vertices can be tagged with a sharpness value. Crease sharpness values range from 0 smooth to 10 infinitely sharp It is generally cheaper to use creases whenever possible, instead of adding extra edgesedge-loops. However... Creases introduce extra computation costs that are proportional to the sharpness value. So... Sharpness values above 5 should rarely be needed. The following sections introduce some techniques to best leverage them. Use crease sets Complex hard-surface models giant robots, vehicles, buildings... are likely to tag large number of edges it is extremely useful to organize these edgesedge loops into logical sets with descriptive names. Edges or vertices in a crease set group all share the same sharpness value. If you are modeling with Maya, the CreaseSetEditor implements this type of workflow. Additionally, for debugging purposes, it is often very helpful if the name of a set contains the sharpness value ex topDeck_2. Besides authoring convenience, one of the benefits of having many edge-loops share identical sharpness values is that it enables very powerful performance optimizations within the feature adaptive algorithm faster renders less memory. Additional Resources An excellent short tutorial from the Guerrilla CG Project that illustrates many of the common pitfalls of subdivision modeling, and the strategies to overcome them Ivo Kos, Modelling Technical Director at Pixar Animation Studios, shows some of the modeling techniques he uses when modeling props and architecture sets for feature films. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"mod_notes.html\"\n- }, {\n \"title\": \"mtlViewer\",\n \"text\": \"mtlViewer mtlViewer 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION KEYBOARD CONTROLS SEE ALSO SYNOPSIS open mtlViewer.app --args -yup -u -a -l refinement level objfiles -catmark -loop -bilinear DESCRIPTION mtlViewer is a stand-alone application that showcases the application of uniform and feature adaptive subdivision schemes to a collection of geometric shapes. Multiple controls are available to experiment with the algorithms. mtlViewer running on macOS mtlViewer running on iOS KEYBOARD CONTROLS q quit f fit frame - increase decrease tessellation rate SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"mtlviewer.html\"\n }, {\n+ \"title\": \"Modeling Tips\",\n+ \"text\": \"Modeling Tips Modeling Tips 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Topology Use Fewer Spans Avoid High Valence vertices Edge-Loop Transitions Practical Topology Primer Triangles and N-Gons Semi-Sharp Creases Use crease sets Additional Resources The following sections describe common techniques specific to modeling with subdivision surfaces. Note The following information contains techniques specific to the Catmull-Clark subdivision scheme. Some elements need to be adjusted for Loop surfaces. Topology Well-constructed subdivision meshes have several important properties They consist primarily of regular faces quads for Catmull-Clark, tris for Loop They contain few extraordinary vertices They efficiently describe the intended shape They are topologically manifold Use Fewer Spans While polygon models need to use a large number of spans to approximate smooth curved surfaces, subdivision models require significantly fewer control points. In most situations, 6 spans are enough to create accurate circular shapes, and 4 is often enough to approximate background objects. Avoid High Valence vertices A high valence vertex is a vertex connected to more than 4 adjacent edges. High valence vertices cause several problems when subdivided The Catmull-Clark scheme can produce wavy surfaces when a revolution vertex is surrounded by triangles see here High valence vertices incur fairly large performance hits Currently, OpenSubdiv has a hard constraint imposed by GPU shaders on the maximum valence of a vertex 27 on current hardware Instead, here are some topological strategies to cap revolution shapes Note that all these cylinders use only quad faces, and all the vertices in the caps have a valence of 4 except the bottom left example Edge-Loop Transitions It is often necessary to vary the density of control vertices over the surface mesh areas around the fingers of a hand require more CVs than the comparatively simpler region around the palm. It is important to handle the topology around these transitions efficiently. One strategy is to use extraordinary vertices, such as this example, using a valence 5 vertex to expand 3 edge loops into 5. Practical Topology Primer Some real-world examples showing how to produce detailed shapes with sparse topology, few extraordinary vertices, and no high-valence revolution poles. Triangles and N-Gons Used sparsely, non-quads can be very useful to gather 3 or more diverging edge-loops. These are often encountered in highly deforming areas with curvature saddle-points ex arm-torso connection. The strategic placement of a pentagon in one of these critical spots ensures that the surface remains smooth, while allowing for complex topology to flow around. Semi-Sharp Creases Semi-sharp creases can be a very powerful tool for hard-surface modeling. Both edges and vertices can be tagged with a sharpness value. Crease sharpness values range from 0 smooth to 10 infinitely sharp It is generally cheaper to use creases whenever possible, instead of adding extra edgesedge-loops. However... Creases introduce extra computation costs that are proportional to the sharpness value. So... Sharpness values above 5 should rarely be needed. The following sections introduce some techniques to best leverage them. Use crease sets Complex hard-surface models giant robots, vehicles, buildings... are likely to tag large number of edges it is extremely useful to organize these edgesedge loops into logical sets with descriptive names. Edges or vertices in a crease set group all share the same sharpness value. If you are modeling with Maya, the CreaseSetEditor implements this type of workflow. Additionally, for debugging purposes, it is often very helpful if the name of a set contains the sharpness value ex topDeck_2. Besides authoring convenience, one of the benefits of having many edge-loops share identical sharpness values is that it enables very powerful performance optimizations within the feature adaptive algorithm faster renders less memory. Additional Resources An excellent short tutorial from the Guerrilla CG Project that illustrates many of the common pitfalls of subdivision modeling, and the strategies to overcome them Ivo Kos, Modelling Technical Director at Pixar Animation Studios, shows some of the modeling techniques he uses when modeling props and architecture sets for feature films. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"mod_notes.html\"\n+ }, {\n \"title\": \"License\",\n \"text\": \"License License 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Open Source License OpenSubdiv is covered by a modified Apache 2.0 license included below, and is free to use for commercial or non-commercial use. All Pixar patents in the area of subdivision surface algorithms have also been released for public use. We welcome any involvement in the development or extension of this code in fact, we would love it. Please contact us if you are interested. For information on Apache licenses, see httpwww.apache.orglicenses The following license text describes the open source policy adopted by Pixar and is included in every source file. Copyright 2013 Pixar Licensed under the Apache License, Version 2.0 the Apache License with the following modification you may not use this file except in compliance with the Apache License and the following modification to it Section 6. Trademarks. is deleted and replaced with 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor and its affiliates, except as required to comply with Section 4c of the License and to reproduce the content of the NOTICE file. You may obtain a copy of the Apache License at httpwww.apache.orglicensesLICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the Apache License with the above modification is distributed on an AS IS BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the Apache License for the specific language governing permissions and limitations under the Apache License. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"license.html\"\n }, {\n \"title\": \"Introduction\",\n \"text\": \"Introduction Introduction 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Introduction Why Fast Subdivision Research Heritage Licensing Contributing External Resources Introduction OpenSubdiv is a set of open source libraries that implement high performance subdivision surface subdiv evaluation on massively parallel CPU and GPU architectures. This code path is optimized for drawing deforming surfaces with static topology at interactive framerates. OpenSubdiv is an API ready to be integrated into 3rd party digital content creation tools. It is not an application, nor a tool that can be used directly to create digital assets. Why Fast Subdivision Subdivision surfaces are commonly used for final rendering of character shapes for a smooth and controllable limit surfaces. However, subdivision surfaces in interactive apps are typically drawn as their polygonal control hulls because of performance. The polygonal control hull is an approximation that is offset from the true limit surface. Looking at an approximation in the interactive app makes it difficult to see exact contact, like fingers touching a potion bottle or hands touching a cheek. It also makes it difficult to see poke-throughs in cloth simulation if the skin and cloth are both approximations. This problem is particularly bad when one character is much larger than another and unequal subdiv face sizes cause approximation errors to be magnified. Maya and Pixars proprietary Presto animation system can take 100ms to subdivide a character of 30,000 polygons to the second level of subdivision 500,000 polygons. Being able to perform the same operation in less than 3ms allows the user to interact with the smooth, accurate limit surface at all times. Research The new GPU technology behind OpenSubdiv is the result of a joint research effort between Pixar and Microsoft. Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces Matthias Niessner, Charles Loop, Mark Meyer, and Tony DeRose ACM Transactions on Graphics, Vol. 31 No. 1 Article 6 January 2012 httpgraphics.pixar.comlibraryGPUSubdivRenderingApaper.pdf Efficient Evaluation of Semi-Smooth Creases in Catmull-Clark Subdivision Surfaces Matthias Niessner, Charles Loop, and Guenter Greiner. Eurographics Proceedings, Cagliari, 2012 httpsniessnerlab.orgpapers20121semismoothniessner2012efficient.pdf Analytic Displacement Mapping using Hardware Tessellation Matthias Niessner, Charles Loop ACM Transactions on Graphics, Vol. 32 No. 3 Article 26 June 2013 httpsniessnerlab.orgpapers20133analyticniessner2013analytic.pdf Heritage This is the fifth-generation subdiv library in use by Pixars proprietary animation system in a lineage that started with code written by Tony DeRose and Tien Truong for Geris Game in 1996. Each generation has been a from-scratch rewrite that has built upon our experience using subdivision surfaces to make animated films. This code is live, so Pixars changes to OpenSubdiv for current and future films will be released as open source at the same time they are rolled out to Pixar animation production. Subdivision for Modeling and Animation Denis Zorin, Peter Schroder Course Notes of SIGGRAPH 1999 httpwww.multires.caltech.edupubssig99notes.pdf Subdivision Surfaces in Character Animation Tony DeRose, Michael Kass, Tien Truong Proceedings of SIGGRAPH 1998 httpgraphics.pixar.comlibraryGeripaper.pdf Recursively generated B-spline surfaces on arbitrary topological meshes Catmull, E. Clark, J. Computer-Aided Design 10 6 1978 Licensing OpenSubdiv is covered by the Apache License, and is free to use for commercial or non-commercial use. This is the same code that Pixar uses internally for animated film production. Our intent is to encourage a geometry standard for subdivision surfaces, by providing consistent i.e. yielding the same limit surface, high performance implementations on a variety of platforms. Why Apache We were looking for a commercial-friendly license that would convey our patents to the end users. This quickly narrowed the field to Microsoft Public License or Apache. Initially we chose MSPL because it handled trademarks better. But at the request of several companies we gave Apache another look, and decided to go with Apache with a very slight modification that simply says you cannot use any contributors trademarks. In other words, you can use OpenSubdiv to make a product, but you cannot use a Luxo Lamp or other character, etc. when marketing your product. License Header Contributing For details on how to contribute to OpenSubdiv, see the page on Contributing External Resources Pixar Research Pixar RD Portal Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n@@ -241,29 +241,29 @@\n \"loc\": \"hbr_overview.html\"\n }, {\n \"title\": \"Hierarchical Edits\",\n \"text\": \"Hierarchical Edits Hierarchical Edits 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Hierarchical Edits Hierarchical Edits Paths Vertex Edits Edge Edits Face Edits Hierarchical Edits To understand the hierarchical aspect of subdivision, we realize that subdivision itself leads to a natural hierarchy after the first level of subdivision, each face in a subdivision mesh subdivides to four quads in the Catmull-Clark scheme, or four triangles in the Loop scheme. This creates a parent and child relationship between the original face and the resulting four subdivided faces, which in turn leads to a hierarchy of subdivision as each child in turn subdivides. A hierarchical edit is an edit made to any one of the faces, edges, or vertices that arise anywhere during subdivision. Normally these subdivision components inherit values from their parents based on a set of subdivision rules that depend on the subdivision scheme. A hierarchical edit overrides these values. This allows for a compact specification of localized detail on a subdivision surface, without having to express information about the rest of the subdivision surface at the same level of detail. Release Notes 3.0.0 Hierarchical Edits have been marked as extended specification and support for hierarchical features has been removed from the 3.0 release. This decision allows for great simplifications of many areas of the subdivision algorithms. If we can identify legitimate use-cases for hierarchical tags, we will consider re-implementing them in future releases, as time and resources allow. Hierarchical Edits Paths In order to perform a hierarchical edit, we need to be able to name the subdivision component we are interested in, no matter where it may occur in the subdivision hierarchy. This leads us to a hierarchical path specification for faces, since once we have a face we can navigate to an incident edge or vertex by association. We note that in a subdivision mesh, a face always has incident vertices, which are labelled in relation to the face with an integer index starting at zero and in consecutive order according to the usual winding rules for subdivision surfaces. Faces also have incident edges, and these are labelled according to the origin vertex of the edge. In this diagram, the indices of the vertices of the base face are marked in red so on the left we have an extraordinary Catmull-Clark face with five vertices labeled 0-4 and on the right we have a regular Catmull-Clark face with four vertices labelled 0-3 . The indices of the child faces are blue note that in both the extraordinary and regular cases, the child faces are indexed the same way, i.e. the sub-face labeled n has one incident vertex that is the result of the subdivision of the parent vertex also labeled n in the parent face. Specifically, we note that the sub-face 1 in both the regular and extraordinary face is nearest to the vertex labelled 1 in the parent. The indices of the vertices of the child faces are labeled green , and this is where the difference lies between the extraordinary and regular case in the extraordinary case, vertex to vertex subdivision always results in a vertex labeled 0 , while in the regular case, vertex to vertex subdivision assigns the same index to the child vertex. Again, specifically, we note that the parent vertex indexed 1 in the extraordinary case has a child vertex 0 , while in the regular case the parent vertex indexed 1 actually has a child vertex that is indexed 1 . Note that this indexing scheme was chosen to maintain the property that the vertex labeled 0 always has the lowest uv parametric value on the face. By appending a vertex index to a face index, we can create a vertex path specification. For example, 655 2 3 0 specifies the 1st. vertex of the 3 rd. child face of the 2 nd. child face of the of the 655 th. face of the subdivision mesh. Vertex Edits Vertex hierarchical edits can modify the value or the sharpness of primitive variables for vertices and sub-vertices anywhere in the subdivision hierarchy. The edits are performed using either an add or a set operator. set indicates the primitive variable value or sharpness is to be set directly to the values specified. add adds a value to the normal result computed via standard subdivision rules. In other words, this operation allows value offsets to be applied to the mesh at any level of the hierarchy. Edge Edits Edge hierarchical edits can only modify the sharpness of primitive variables for edges and sub-edges anywhere in the subdivision hierarchy. Face Edits Face hierarchical edits can modify several properties of faces and sub-faces anywhere in the subdivision hierarchy. Modifiable properties include The set or add operators modify the value of primitive variables associated with faces. The hole operation introduces holes missing faces into the subdivision mesh at any level in the subdivision hierarchy. The faces will be deleted, and none of their children will appear you cannot unhole a face if any ancestor is a hole. This operation takes no float or string arguments. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"hedits.html\"\n }, {\n- \"title\": \"glStencilViewer\",\n- \"text\": \"glStencilViewer glStencilViewer 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS glStencilViewer -f -yup -u -a -l refinement level objfiles -catmark -loop -bilinear DESCRIPTION glStencilViewer is a stand-alone application that showcases the application of pre-computed stencil tables to a collection of geometric test shapes. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"glstencilviewer.html\"\n- }, {\n \"title\": \"glViewer\",\n \"text\": \"glViewer glViewer 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS glViewer -f -yup -u -a -l refinement level -c animation loops objfiles -anim -catmark -loop -bilinear DESCRIPTION glViewer is a stand-alone application that showcases the application of uniform and feature adaptive subdivision schemes to a collection of geometric shapes. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"glviewer.html\"\n }, {\n \"title\": \"glShareTopology\",\n \"text\": \"glShareTopology glShareTopology 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS glShareTopology -u -a -l refinement level DESCRIPTION glShareTopology is a stand-alone application that showcases the implementation of topology instancing across Compute contexts. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"glsharetopology.html\"\n }, {\n+ \"title\": \"glStencilViewer\",\n+ \"text\": \"glStencilViewer glStencilViewer 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS glStencilViewer -f -yup -u -a -l refinement level objfiles -catmark -loop -bilinear DESCRIPTION glStencilViewer is a stand-alone application that showcases the application of pre-computed stencil tables to a collection of geometric test shapes. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"glstencilviewer.html\"\n+ }, {\n \"title\": \"glPtexViewer\",\n \"text\": \"glPtexViewer glPtexViewer 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS KEYBOARD CONTROLS SEE ALSO SYNOPSIS glPtexViewer -f -yup -u -a -l isolation level -c animation loops -e environment map -d HDR diffuse map -s HDR specular map --disp displacement scale --bump bump scale ptex color file ptex displacement file ptex occlusion file ptex specular file objfiles DESCRIPTION glPtexViewer is a stand-alone application that showcases advanced HDR shading with color, displacement, occlusion and specular ptex maps. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. -e environment map A low dynamic range spherical environment map used as a background. Ideally, a color-normalized version of the HDR light probe. -d HDR diffuse map An HDR file containing a diffuse environment map typically they are low resolution blurry hemispherical convolutions of the environment light probe. -s environment map An HDR file containing a specular environment map. --disp displacement scale A scalar multiplier for the shader displacement values. --bump displacement scale A scalar multiplier for the shader bump values. ptex color file A ptex file containing RGB channels read as material albedo color. ptex displacement file A single-channel ptex file preferably float precision containing the displacement values. ptex occlusion file A single-channel ptex file preferably 8 bits precision containing a pre-computed ambient occlusion signal. ptex specular file A single-channel ptex file preferably 8 bits precision applied to modulate the specular reflectance of the material KEYBOARD CONTROLS q quit esc hide GUI x save screenshot f fit frame - increase decrease tessellation rate r reload and re - compile the shader files e draw normals SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"glptexviewer.html\"\n }, {\n \"title\": \"glPaintTest\",\n \"text\": \"glPaintTest glPaintTest 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS KEYBOARD CONTROLS SEE ALSO SYNOPSIS glPaintTest -f -yup -l adaptive refinement level objfiles -catmark -loop DESCRIPTION glPaintTest is a small stand-alone application showing the potential of using GPU limit tessellation for painting and sculpting applications. OPTIONS See the description of the common comand line options for the subset of common options supported here. KEYBOARD CONTROLS c use texture as color d use texture as displacement SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n@@ -276,44 +276,44 @@\n \"loc\": \"glfvarviewer.html\"\n }, {\n \"title\": \"glEvalLimit\",\n \"text\": \"glEvalLimit glEvalLimit 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS glEvalLimit -f -yup -u -a -l refinement level objfiles -catmark -loop -bilinear DESCRIPTION glEvalLimit is a stand-alone application that showcases the limit surface Eval module. On the given shape, random samples are generated in local s,t space. Vertex, varying and face-varying data is then computed on the surface limit and displayed as colors. In order to emphasize the dynamic nature of the EvalLimit API, where the locations can be arbitrarily updated before each evaluation, the glEvalLimit example treats each sample as a ST particle. ST Particles are a simplified parametric-space particle dynamics simulation each particle is assigned a location on the subdivision surface limit that is composed of a unique ptex face index, with a local s,t parametric pair. The system also generates an array of parametric velocities ds, dt for each particle. An Update function then applies the velocities to the locations and moves the points along the parametric space. Face boundaries are managed using a ptex adjacency table obtained from the FarTopologyRefiner. Every time a particle moves outside of the 0.0f, 1.0f parametric range, a warp function moves it to the neighboring face, or bounces it, if the edge happens to be a boundary. Note currently the adjacency code does not handle diagonal crossings, nor crossings between quad and non-quad faces. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"glevallimit.html\"\n }, {\n- \"title\": \"FAR Overview\",\n- \"text\": \"FAR Overview FAR Overview 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Feature Adaptive Representation Far Topology Refinement Primvar Refinement FarTopologyRefiner FarTopologyRefinerFactory FarPrimvarRefiner FarPatchTable Patch Arrays Patch Types Patch Parameterization Single-Crease Patches Local Points Legacy Gregory Patches FarStencilTable Advantages Principles Cascading Stencils Limit Stencils Sample Location On Extraordinary Faces Code example Feature Adaptive Representation Far Far is the primary API layer for processing client-supplied mesh data into subdivided surfaces. The Far interface may be used directly and also may be used to prepare mesh data for further processing by Osd . The two main aspects of the subdivision process are Topology Refinement and Primvar Refinement . Topology Refinement Topology refinement is the process of splitting the mesh topology according to the specified subdivison rules to generate new topological vertices, edges, and faces. This process is purely topological and does not depend on the speciific values of any primvar data point positions, etc. Topology refinement can be either uniform or adaptive, where extraordinary features are automatically isolated see feature adaptive subdivision . The Far topology classes present a public interface for the refinement functionality provided in Vtr , The main classes in Far related to topology refinement are TopologyRefiner A class encapsulating mesh refinement. TopologyLevel A class representing one level of refinement within a TopologyRefiner. TopologyRefinerFactoryMESH A factory class template specialized in terms of the applications mesh representation used to construct TopologyRefiner instances. Primvar Refinement Primvar refinement is the process of computing values for primvar data points, colors, normals, texture coordinates, etc by applying weights determined by the specified subdivision rules. There are many advantages gained by distinguishing between topology refinement and primvar interpolation including the ability to apply a single static topological refinement to multiple primvar instances or to different animated primvar time samples. Far supports methods to refine primvar data at the locations of topological vertices and at arbitrary locations on the subdivision limit surface. The main classes in Far related to primvar refinement are PrimvarRefiner A class implementing refinement of primvar data at the locations of topological vertices. PatchTable A representation of the refined surface topology that can be used for efficient evaluation of primvar data at arbitrary locations. StencilTable A representation of refinement weights suitable for efficient parallel processing of primvar refinement. LimitStencilTable A representation of refinement weights suitable for efficient parallel processing of primvar refinement at arbitrary limit surface locations. FarTopologyRefiner TopologyRefiner is the building block for many other useful classes in Far . It performs refinement of an arbitrary mesh and provides access to the refined mesh topology. It can be used for primvar refinement directly using PrimvarRefiner or indirectly by being used to create a stencil table , or a patch table , etc. TopologyRefiner provides the public refinement methods RefineUniform and RefineAdapative which perform refinement operations using Vtr. TopologyRefiner provides access to the refined topology via TopologyLevel instances. FarTopologyRefinerFactory Consistent with other classes in Far, instances of TopologyRefiner are created by a factory class -- in this case FarTopologyRefinerFactory. Here we outline several approaches for converting mesh topology into the required FarTopologyRefiner. Additional documentation is provided with the FarTopologyRefinerFactoryMESH class template used by all, and each has a concrete example provided in one of the tutorials or in the Far code itself. There are three ways to create TopologyRefiners use the existing TopologyRefinerFactoryTopologyDescriptor with a populated instance of TopologyDescriptor specialize TopologyRefinerFactoryclass MESH for more efficient conversion, using only face-vertex information fully specialize TopologyRefinerFactorclass MESH for most control over conversion Use the FarTopologyDescriptor FarTopologyDescriptor is a simple struct that can be initialized to refer to raw mesh topology information -- primarily a face-vertex list -- and then passed to a provided factory class to create a TopologyRefiner from each. Topologically, the minimal requirement consists of the number of vertices and faces of the mesh an array containing the number of vertices per face an array containing the vertices assigned to each face These last two define one of the six topological relations that are needed internally by Vtr, but this one relation is sufficient to construct the rest. Additional members are available to assign sharpness values per edge andor vertex, hole tags to faces, or to define multiple sets channels of face-varying data. Almost all of the Far tutorials i.e. tutorialsfartutorial_ illustrate use of the TopologyDescriptor and its factory for creating TopologyRefiners, i.e. TopologyRefinerFactoryTopologyDescriptor. For situations when users have raw mesh data and have not yet constructed a boundary representation of their own, it is hoped that this will suffice. Options have even been provided to indicate that raw topology information has been defined in a left-hand winding order and the factory will handle the conversion to right-hand counter-clockwise winding on-the-fly to avoid unnecessary data duplication. Custom Factory for Face Vertices If the nature of the TopologyDescriptors data expectations is not helpful, and so conversion to large temporary arrays would be necessary to properly make use of it, it may be worth writing a custom factory. Specialization of TopologyRefinerFactoryclass MESH should be done with care as the goal here is to maximize the performance of the conversion and so minimize overhead due to runtime validation. The template provides the high-level construction of the required topology vectors of the underlying Vtr. There are two ways to write such a factory provide only the face-vertex information for topology and let the factory infer all edges and other relationships, or provide the complete edge list and all other topological relationships directly. The latter is considerably more involved and described in a following section. The definition of TopologyRefinerFactoryTopologyDescriptor provides a clear and complete example of constructing a TopologyRefiner with minimal topology information, i.e. the face-vertex list. The class template TopologyRefinerFactoryMESH documents the needs here and the TopologyDescriptor instantiation and specialization should illustrate that. Custom Factory for Direct Conversion Fully specializing a factory for direct conversion is needed only for those requiring ultimate control and is not generally recommended. It is recommended that one of the previous two methods initially be used to convert your mesh topology into a TopologyRefiner. If the conversion performance is critical, or significant enough to warrant improvement, then it is worth writing a factory for full topological conversion. Writing a custom factory requires the specificationspecialization of two methods with the following purpose specify the sizes of topological data so that vectors can be pre-allocated assign the topological data to the newly allocated vectors As noted above, the assumption here is that the clients boundary-rep knows best how to retrieve the data that we require most efficiently. After the factory class gathers sizing information and allocates appropriate memory, the factory provides the client with locations of the appropriate tables to be populated using the same Array classes and interface used to access the tables. The client is expected to load a complete topological description along with additional optional data, i.e. the six topological relations required by Vtr, oriented when manifold sharpness values for edges andor vertices optional additional tags related to the components, e.g. holes optional values-per-face for face-varying channels optional This approach requires dealing directly with edges, unlike the other two. In order to convert edges into a TopologyRefiners representation, the edges need to be expressed as a collection of known size N -- each of which is referred to directly by indices 0,N-1. This can be awkward for representations such as half-edge or quad-edge that do not treat the instance of an edge uniquely. Particular care is also necessary when representing non-manifold features. The previous two approaches will construct non-manifold features as required from the face-vertex list -- dealing with degenerate edges and other non-manifold features as encountered. When directly translating full topology it is necessary to tag non-manifold features, and also to ensure that certain edge relationships are satisfied in their presence. More details are available with the assembly methods of the factory class template. While there is plenty of opportunity for user error here, that is no different from any other conversion process. Given that Far controls the construction process through the Factory class, we do have ample opportunity to insert runtime validation, and to vary that level of validation at any time on an instance of the Factory. The factory does provide run-time validation on the topology constructed that can be used for debugging purposes. A common base class has been created for the factory class, i.e. template class MESH class TopologyRefinerFactory public TopologyRefinerFactoryBase both to provide common code independent of MESH and also potentially to protect core code from unwanted specialization. FarPrimvarRefiner PrimvarRefiner supports refinement of arbitrary primvar data at the locations of topological vertices. A PrimvarRefiner accesses topology data directly from a TopologyRefiner. Different methods are provided to support three different classes of primvar interpolation. These methods may be used to refine primvar data to a specified refinement level. Interpolate... Interpolate using vertex weights InterpolateVarying... Interpolate using linear weights InterpolateFaceVarying... Interpolate using face-varying weights Additional methods allow primvar data to be interpolated to the final limit surface including the calculation of first derivative tangents. Limitdst Interpolate to the limit surface using vertex weights Limitdst, dstTan1, dstTan2 Interpolate including first derivatives to the limit surface using vertex weights LimitFaceVarying... Interpolate to the limit surface using face-varying weights PrimarRefiner provides a straightforward interface for refining primvar data, but depending on the application use case, it can be more efficient to create and use a StencilTable , or PatchTable , to refine primvar data. FarPatchTable PatchTable is the collection of patches derived from the refined faces of a particular mesh topology. This collection is created using FarPatchTableFactory from an instance of FarTopologyRefiner after refinement has been applied. Patch Arrays The PatchTable is organized into patch arrays. All patches in each array have the same type except for face-varying patch arrays which may have a mix of regular and irregular patch types. The PatchDescriptor provides the fundamental description of a patch, including the number of control points per patch as well as the basis for patch evaluation. Each patch in the array is associated with a PatchParam which specifies additional information about the individual patch. Patch Types The following are the different patch types that can be represented in the PatchTable Patch Type CVs Description NON_PATCH na Undefined patch type POINTS 1 Points useful for cage drawing LINES 2 Lines useful for cage drawing QUADS 4 Bi-linear quadrilaterals TRIANGLES 3 Linear triangles LOOP 12 Quartic triangular Box-spline patches REGULAR 16 Bi-cubic B-spline patches GREGORY 4 Legacy Gregory patches GREGORY_BOUNDARY 4 Legacy Gregory Boundary patches GREGORY_BASIS 20 Bi-cubic quadrilateral Gregory patches GREGORY_TRIANGLE 18 Quartic triangular Gregory patches The type of a patch dictates the number of control vertices expected in the table as well as the method used to evaluate values. Patch Parameterization Here we describe the encoding of the patch parameterization for quadrilateral patches. The encoding for triangular patches is similar, please see the API documentation of FarPatchParam for details. Each patch represents a specific portion of the parametric space of the coarse topological face identified by the PatchParam FaceId. As topological refinement progresses through successive levels, each resulting patch corresponds to a smaller and smaller subdomain of the face. The PatchParam UV origin describes the mapping from the uv domain of the patch to the uv subdomain of the topological face. We encode this uv origin using log2 integer values for compactness and efficiency. It is important to note that this uv parameterization is the intrinsic parameterization within a given patch or coarse face and is distinct from any client specified face-varying channel data. Patches which result from irregular coarse faces non-quad faces in the Catmark scheme are offset by the one additional level needed to quadrangulate the irregular face. It is the indices of these offset faces that are stored in the PatchParam and used in other classes such as the FarPatchMap. These offset indices can be identified from the coarse face using the FarPtexIndices class when needed. A patch along an interpolated boundary edge is supported by an incomplete sets of control vertices. For consistency, patches in the PatchTable always have a full set of control vertex indices and the PatchParam Boundary bitmask identifies which control vertices are incomplete the incomplete control vertex indices are assigned values which duplicate the first valid index. Each bit in the boundary bitmask corresponds to one edge of the patch starting from the edge from the first vertex and continuing around the patch. With feature adaptive refinement, regular B-spline basis patches along interpolated boundaries will fall into one of the eight cases four boundary and four corner illustrated below Transition edges occur during feature adaptive refinement where a patch at one level of refinement is adjacent to pairs of patches at the next level of refinement. These T-junctions do not pose a problem when evaluating primvar data on patches, but they must be taken into consideration when tessellating patches e.g. while drawing in order to avoid cracks. The PatchParam Transition bitmask identifies the transition edges of a patch. Each bit in the bitmask corresponds to one edge of the patch just like the encoding of boundary edges. After refining an arbitrary mesh, any of the 16 possible transition edge configurations might occur. The method of handling transition edges is delegated to patch drawing code. Single-Crease Patches Using single-crease patches allows a mesh with creases to be represented with many fewer patches than would be needed otherwise. A single-crease patch is a variation of a regular BSpline patch with one additional crease sharpness parameter. Release Notes 3.x Evaluation of single-crease patches is currently only implemented for OSD patch drawing, but we expect to implement support in all of the evaluation code paths for future releases. Local Points The control vertices represented by a PatchTable are primarily refined points, i.e. points which result from applying the subdivision scheme uniformly or adaptively to the points of the coarse mesh. However, the final patches generated from irregular faces, e.g. patches incident on an extraordinary vertex might have a representation which requires additional local points. Legacy Gregory Patches Using Gregory patches to approximate the surface at the final patches generated from irregular faces is an alternative representation which does not require any additional local points to be computed. Instead, when Legacy Gregory patches are used, the PatchTable must also have an alternative representation of the mesh topology encoded as a vertex valence table and a quad offsets table. FarStencilTable The base container for stencil data is the StencilTable class. As with most other Far entities, it has an associated StencilTableFactory that requires a TopologyRefiner Advantages Stencils are used to factorize the interpolation calculations that subdivision schema apply to vertices of smooth surfaces. If the topology being subdivided remains constant, factorizing the subdivision weights into stencils during a pre-compute pass yields substantial amortizations at run-time when re-posing the control cage. Factorizing the subdivision weights also allows to express each subdivided vertex as a weighted sum of vertices from the control cage. This step effectively removes any data inter-dependency between subdivided vertices the computations of subdivision interpolation can be applied to each vertex in parallel without any barriers or constraint. The Osd classes leverage these properties by exploiting CPU and GPU parallelism. Principles Iterative subdivision algorithms converge towards the limit surface by successively refining the vertices of the coarse control cage. Each successive iteration interpolates the new vertices by applying polynomial weights to a basis of supporting vertices . The interpolation calculations for any given vertex can be broken down into sequences of multiply-add operations applied to the supporting vertices. Stencil table encodes a factorization of these weighted sums each stencils is created by combining the list of control vertices from the 1-ring. With iterative subdivision, each refinement step is dependent upon the previous subdivision step being completed, and a substantial number of steps may be required in order approximate the limit each subdivision step incurs an O4 n growing amount of computations. Instead, once the weights of the contributing coarse control vertices for a given refined vertex have been factorized, it is possible to apply the stencil and directly obtain the interpolated vertex data without having to process the data for the intermediate refinement levels. Cascading Stencils Client-code can control the amount of factorization of the stencils the tables can be generated with contributions all the way from a basis of coarse vertices, or reduced only to contributions from vertices from the previous level of refinement. The latter mode allows client-code to access and insert modifications to the vertex data at set refinement levels -- creating what are often referred to as hierarchical edits . Once the edits have been applied by the client-code, another set of stencils can be used to smooth the vertex data to a higher level of refinement. See implementation details, see the Far cascading stencil tutorial Limit Stencils Stencil tables can be trivially extended from discrete subdivided vertices to arbitrary locations on the limit surface. Aside from extraordinary points, every location on the limit surface can be expressed as a closed-form weighted average of a set of coarse control vertices from the 1-ring surrounding the face. The weight accumulation process is similar the control cage is adaptively subdivided around extraordinary locations. A stencil is then generated for each limit location simply by factorizing the bi-cubic Bspline patch weights over those of the contributing basis of control-vertices. The use of bi-cubic patches also allows the accumulation of analytical derivatives, so limit stencils carry a set of weights for tangent vectors. Once the stencil table has been generated, limit stencils are the most direct and efficient method of evaluation of specific locations on the limit of a subdivision surface, starting from the coarse vertices of the control cage. Also just as discrete stencils, limit stencils that are factorized from coarse control vertices do not have inter-dependencies and can be evaluated in parallel. For implementation details, see the glStencilViewer code example. Sample Location On Extraordinary Faces Each stencil is associated with a singular parametric location on the coarse mesh. The parametric location is defined as face location and local 0.0 - 1.0 u,v triplet In the case of face that are not quads, a parametric sub-face quadrant needs to be identified. This can be done either explicitly or implicitly by using the unique ptex face indices for instance. Code example When the control vertices controlPoints move in space, the limit locations can be very efficiently recomputed simply by applying the blending weights to the series of coarse control vertices class StencilType public void Clear memset x , 0 , sizeof StencilType void AddWithWeight StencilType const cv , float weight x cv . x weight y cv . y weight z cv . z weight float x , y , z std vector StencilType controlPoints , points , utan , vtan Update points by applying stencils controlStencils . UpdateValues StencilType controlPoints 0 , points 0 Update tangents by applying derivative stencils controlStencils . UpdateDerivs StencilType controlPoints 0 , utan 0 , vtan 0 Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"far_overview.html\"\n- }, {\n \"title\": \"Getting Started\",\n \"text\": \"Getting Started Getting Started 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Downloading the code Branches Git Flow Checking out branches API Versions Making Changes Code Overview Downloading the code The code is hosted on a Github public repository. Download and setup information for Git tools can be found here . You can access the OpenSubdiv Git repository at httpsgithub.comPixarAnimationStudiosOpenSubdiv From there, there are several ways of downloading the OpenSubdiv source code. Zip archive downloaded from here Using a GUI client you can find a list here Please refer to the documentation of your preferred application. From the GitShell, Cygwin or the CLI assuming that you have the Git tools installed, you can clone the OpenSubdiv repository directly with the following command git clone https github.comPixarAnimationStudiosOpenSubdiv.git These methods only pull static archives, which is are not under the version control system and therefore cannot pull updates or push changes back. If you intend on contributing features or fixes to the main trunk of the code, you will need to create a free Github account and clone a fork of the OpenSubdiv repository. Submissions to the main code trunk can be sent using Gits pull-request mechanisms. Please note that we are using the git flow tools so all changes should be made to our dev branch. Before we can accept submissions however, we will need a signed Contributors License Agreement . Branches Git Flow Since version 1.1.0, OpenSubdiv has adopted the Git Flow branching model . Our active development branch is named dev all new features and bug fixes should be submitted to this branch. The changes submitted to the dev branch are periodically patched to the release branch as new versions are released. Checking out branches The Git Flow tools are not a requisite for working with the OpenSubdiv code base, but new work should always be performed in the dev branch, or dedicated feature-branches. By default, a cloned repository will be pointing to the release branch. You can switch to the dev branch using the following command git checkout dev You can check that the branch has now been switched simply with git branch Which should return dev release API Versions OpenSubdiv maintains an internal API versioning system. The version number can be read from the file .opensubdivversion.h . Following the Git-Flow pattern, our releases are indexed using Gits tagging system. List of the existing tags git tag -- list Checking out version 1.2.0 git checkout v1_2_0 Making Changes Direct push access to the OpenSubdiv repository is currently limited to a small internal development team. External code should be submitted by sending Git pull-requests from forks of our dev branch. Code Overview The OpenSubdiv code base contains the following main areas Directory Contents .opensubdiv The main subdivision APIs Sdc, Vtr, Far and Osd. .examples A small collection of standalone applications that illustrate how to deploy the various features and optimizations of the OpenSubdiv APIs. The GL-based examples rely on the cross-platform GLFW API for interactive window management, while the DirectX ones are OS-native. .tutorials Tutorials showing how to manipulate the APIs of OpenSubdiv. .documentation The reStructuredText source files along with python scripts that generate the HTML documentation site. .regression Standalone regression tests and baseline data to help maintain the integrity of our APIs. If GPU SDKs are detected, some tests will attempt to run computations on those GPUs. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"getting_started.html\"\n }, {\n+ \"title\": \"FAR Overview\",\n+ \"text\": \"FAR Overview FAR Overview 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Feature Adaptive Representation Far Topology Refinement Primvar Refinement FarTopologyRefiner FarTopologyRefinerFactory FarPrimvarRefiner FarPatchTable Patch Arrays Patch Types Patch Parameterization Single-Crease Patches Local Points Legacy Gregory Patches FarStencilTable Advantages Principles Cascading Stencils Limit Stencils Sample Location On Extraordinary Faces Code example Feature Adaptive Representation Far Far is the primary API layer for processing client-supplied mesh data into subdivided surfaces. The Far interface may be used directly and also may be used to prepare mesh data for further processing by Osd . The two main aspects of the subdivision process are Topology Refinement and Primvar Refinement . Topology Refinement Topology refinement is the process of splitting the mesh topology according to the specified subdivison rules to generate new topological vertices, edges, and faces. This process is purely topological and does not depend on the speciific values of any primvar data point positions, etc. Topology refinement can be either uniform or adaptive, where extraordinary features are automatically isolated see feature adaptive subdivision . The Far topology classes present a public interface for the refinement functionality provided in Vtr , The main classes in Far related to topology refinement are TopologyRefiner A class encapsulating mesh refinement. TopologyLevel A class representing one level of refinement within a TopologyRefiner. TopologyRefinerFactoryMESH A factory class template specialized in terms of the applications mesh representation used to construct TopologyRefiner instances. Primvar Refinement Primvar refinement is the process of computing values for primvar data points, colors, normals, texture coordinates, etc by applying weights determined by the specified subdivision rules. There are many advantages gained by distinguishing between topology refinement and primvar interpolation including the ability to apply a single static topological refinement to multiple primvar instances or to different animated primvar time samples. Far supports methods to refine primvar data at the locations of topological vertices and at arbitrary locations on the subdivision limit surface. The main classes in Far related to primvar refinement are PrimvarRefiner A class implementing refinement of primvar data at the locations of topological vertices. PatchTable A representation of the refined surface topology that can be used for efficient evaluation of primvar data at arbitrary locations. StencilTable A representation of refinement weights suitable for efficient parallel processing of primvar refinement. LimitStencilTable A representation of refinement weights suitable for efficient parallel processing of primvar refinement at arbitrary limit surface locations. FarTopologyRefiner TopologyRefiner is the building block for many other useful classes in Far . It performs refinement of an arbitrary mesh and provides access to the refined mesh topology. It can be used for primvar refinement directly using PrimvarRefiner or indirectly by being used to create a stencil table , or a patch table , etc. TopologyRefiner provides the public refinement methods RefineUniform and RefineAdapative which perform refinement operations using Vtr. TopologyRefiner provides access to the refined topology via TopologyLevel instances. FarTopologyRefinerFactory Consistent with other classes in Far, instances of TopologyRefiner are created by a factory class -- in this case FarTopologyRefinerFactory. Here we outline several approaches for converting mesh topology into the required FarTopologyRefiner. Additional documentation is provided with the FarTopologyRefinerFactoryMESH class template used by all, and each has a concrete example provided in one of the tutorials or in the Far code itself. There are three ways to create TopologyRefiners use the existing TopologyRefinerFactoryTopologyDescriptor with a populated instance of TopologyDescriptor specialize TopologyRefinerFactoryclass MESH for more efficient conversion, using only face-vertex information fully specialize TopologyRefinerFactorclass MESH for most control over conversion Use the FarTopologyDescriptor FarTopologyDescriptor is a simple struct that can be initialized to refer to raw mesh topology information -- primarily a face-vertex list -- and then passed to a provided factory class to create a TopologyRefiner from each. Topologically, the minimal requirement consists of the number of vertices and faces of the mesh an array containing the number of vertices per face an array containing the vertices assigned to each face These last two define one of the six topological relations that are needed internally by Vtr, but this one relation is sufficient to construct the rest. Additional members are available to assign sharpness values per edge andor vertex, hole tags to faces, or to define multiple sets channels of face-varying data. Almost all of the Far tutorials i.e. tutorialsfartutorial_ illustrate use of the TopologyDescriptor and its factory for creating TopologyRefiners, i.e. TopologyRefinerFactoryTopologyDescriptor. For situations when users have raw mesh data and have not yet constructed a boundary representation of their own, it is hoped that this will suffice. Options have even been provided to indicate that raw topology information has been defined in a left-hand winding order and the factory will handle the conversion to right-hand counter-clockwise winding on-the-fly to avoid unnecessary data duplication. Custom Factory for Face Vertices If the nature of the TopologyDescriptors data expectations is not helpful, and so conversion to large temporary arrays would be necessary to properly make use of it, it may be worth writing a custom factory. Specialization of TopologyRefinerFactoryclass MESH should be done with care as the goal here is to maximize the performance of the conversion and so minimize overhead due to runtime validation. The template provides the high-level construction of the required topology vectors of the underlying Vtr. There are two ways to write such a factory provide only the face-vertex information for topology and let the factory infer all edges and other relationships, or provide the complete edge list and all other topological relationships directly. The latter is considerably more involved and described in a following section. The definition of TopologyRefinerFactoryTopologyDescriptor provides a clear and complete example of constructing a TopologyRefiner with minimal topology information, i.e. the face-vertex list. The class template TopologyRefinerFactoryMESH documents the needs here and the TopologyDescriptor instantiation and specialization should illustrate that. Custom Factory for Direct Conversion Fully specializing a factory for direct conversion is needed only for those requiring ultimate control and is not generally recommended. It is recommended that one of the previous two methods initially be used to convert your mesh topology into a TopologyRefiner. If the conversion performance is critical, or significant enough to warrant improvement, then it is worth writing a factory for full topological conversion. Writing a custom factory requires the specificationspecialization of two methods with the following purpose specify the sizes of topological data so that vectors can be pre-allocated assign the topological data to the newly allocated vectors As noted above, the assumption here is that the clients boundary-rep knows best how to retrieve the data that we require most efficiently. After the factory class gathers sizing information and allocates appropriate memory, the factory provides the client with locations of the appropriate tables to be populated using the same Array classes and interface used to access the tables. The client is expected to load a complete topological description along with additional optional data, i.e. the six topological relations required by Vtr, oriented when manifold sharpness values for edges andor vertices optional additional tags related to the components, e.g. holes optional values-per-face for face-varying channels optional This approach requires dealing directly with edges, unlike the other two. In order to convert edges into a TopologyRefiners representation, the edges need to be expressed as a collection of known size N -- each of which is referred to directly by indices 0,N-1. This can be awkward for representations such as half-edge or quad-edge that do not treat the instance of an edge uniquely. Particular care is also necessary when representing non-manifold features. The previous two approaches will construct non-manifold features as required from the face-vertex list -- dealing with degenerate edges and other non-manifold features as encountered. When directly translating full topology it is necessary to tag non-manifold features, and also to ensure that certain edge relationships are satisfied in their presence. More details are available with the assembly methods of the factory class template. While there is plenty of opportunity for user error here, that is no different from any other conversion process. Given that Far controls the construction process through the Factory class, we do have ample opportunity to insert runtime validation, and to vary that level of validation at any time on an instance of the Factory. The factory does provide run-time validation on the topology constructed that can be used for debugging purposes. A common base class has been created for the factory class, i.e. template class MESH class TopologyRefinerFactory public TopologyRefinerFactoryBase both to provide common code independent of MESH and also potentially to protect core code from unwanted specialization. FarPrimvarRefiner PrimvarRefiner supports refinement of arbitrary primvar data at the locations of topological vertices. A PrimvarRefiner accesses topology data directly from a TopologyRefiner. Different methods are provided to support three different classes of primvar interpolation. These methods may be used to refine primvar data to a specified refinement level. Interpolate... Interpolate using vertex weights InterpolateVarying... Interpolate using linear weights InterpolateFaceVarying... Interpolate using face-varying weights Additional methods allow primvar data to be interpolated to the final limit surface including the calculation of first derivative tangents. Limitdst Interpolate to the limit surface using vertex weights Limitdst, dstTan1, dstTan2 Interpolate including first derivatives to the limit surface using vertex weights LimitFaceVarying... Interpolate to the limit surface using face-varying weights PrimarRefiner provides a straightforward interface for refining primvar data, but depending on the application use case, it can be more efficient to create and use a StencilTable , or PatchTable , to refine primvar data. FarPatchTable PatchTable is the collection of patches derived from the refined faces of a particular mesh topology. This collection is created using FarPatchTableFactory from an instance of FarTopologyRefiner after refinement has been applied. Patch Arrays The PatchTable is organized into patch arrays. All patches in each array have the same type except for face-varying patch arrays which may have a mix of regular and irregular patch types. The PatchDescriptor provides the fundamental description of a patch, including the number of control points per patch as well as the basis for patch evaluation. Each patch in the array is associated with a PatchParam which specifies additional information about the individual patch. Patch Types The following are the different patch types that can be represented in the PatchTable Patch Type CVs Description NON_PATCH na Undefined patch type POINTS 1 Points useful for cage drawing LINES 2 Lines useful for cage drawing QUADS 4 Bi-linear quadrilaterals TRIANGLES 3 Linear triangles LOOP 12 Quartic triangular Box-spline patches REGULAR 16 Bi-cubic B-spline patches GREGORY 4 Legacy Gregory patches GREGORY_BOUNDARY 4 Legacy Gregory Boundary patches GREGORY_BASIS 20 Bi-cubic quadrilateral Gregory patches GREGORY_TRIANGLE 18 Quartic triangular Gregory patches The type of a patch dictates the number of control vertices expected in the table as well as the method used to evaluate values. Patch Parameterization Here we describe the encoding of the patch parameterization for quadrilateral patches. The encoding for triangular patches is similar, please see the API documentation of FarPatchParam for details. Each patch represents a specific portion of the parametric space of the coarse topological face identified by the PatchParam FaceId. As topological refinement progresses through successive levels, each resulting patch corresponds to a smaller and smaller subdomain of the face. The PatchParam UV origin describes the mapping from the uv domain of the patch to the uv subdomain of the topological face. We encode this uv origin using log2 integer values for compactness and efficiency. It is important to note that this uv parameterization is the intrinsic parameterization within a given patch or coarse face and is distinct from any client specified face-varying channel data. Patches which result from irregular coarse faces non-quad faces in the Catmark scheme are offset by the one additional level needed to quadrangulate the irregular face. It is the indices of these offset faces that are stored in the PatchParam and used in other classes such as the FarPatchMap. These offset indices can be identified from the coarse face using the FarPtexIndices class when needed. A patch along an interpolated boundary edge is supported by an incomplete sets of control vertices. For consistency, patches in the PatchTable always have a full set of control vertex indices and the PatchParam Boundary bitmask identifies which control vertices are incomplete the incomplete control vertex indices are assigned values which duplicate the first valid index. Each bit in the boundary bitmask corresponds to one edge of the patch starting from the edge from the first vertex and continuing around the patch. With feature adaptive refinement, regular B-spline basis patches along interpolated boundaries will fall into one of the eight cases four boundary and four corner illustrated below Transition edges occur during feature adaptive refinement where a patch at one level of refinement is adjacent to pairs of patches at the next level of refinement. These T-junctions do not pose a problem when evaluating primvar data on patches, but they must be taken into consideration when tessellating patches e.g. while drawing in order to avoid cracks. The PatchParam Transition bitmask identifies the transition edges of a patch. Each bit in the bitmask corresponds to one edge of the patch just like the encoding of boundary edges. After refining an arbitrary mesh, any of the 16 possible transition edge configurations might occur. The method of handling transition edges is delegated to patch drawing code. Single-Crease Patches Using single-crease patches allows a mesh with creases to be represented with many fewer patches than would be needed otherwise. A single-crease patch is a variation of a regular BSpline patch with one additional crease sharpness parameter. Release Notes 3.x Evaluation of single-crease patches is currently only implemented for OSD patch drawing, but we expect to implement support in all of the evaluation code paths for future releases. Local Points The control vertices represented by a PatchTable are primarily refined points, i.e. points which result from applying the subdivision scheme uniformly or adaptively to the points of the coarse mesh. However, the final patches generated from irregular faces, e.g. patches incident on an extraordinary vertex might have a representation which requires additional local points. Legacy Gregory Patches Using Gregory patches to approximate the surface at the final patches generated from irregular faces is an alternative representation which does not require any additional local points to be computed. Instead, when Legacy Gregory patches are used, the PatchTable must also have an alternative representation of the mesh topology encoded as a vertex valence table and a quad offsets table. FarStencilTable The base container for stencil data is the StencilTable class. As with most other Far entities, it has an associated StencilTableFactory that requires a TopologyRefiner Advantages Stencils are used to factorize the interpolation calculations that subdivision schema apply to vertices of smooth surfaces. If the topology being subdivided remains constant, factorizing the subdivision weights into stencils during a pre-compute pass yields substantial amortizations at run-time when re-posing the control cage. Factorizing the subdivision weights also allows to express each subdivided vertex as a weighted sum of vertices from the control cage. This step effectively removes any data inter-dependency between subdivided vertices the computations of subdivision interpolation can be applied to each vertex in parallel without any barriers or constraint. The Osd classes leverage these properties by exploiting CPU and GPU parallelism. Principles Iterative subdivision algorithms converge towards the limit surface by successively refining the vertices of the coarse control cage. Each successive iteration interpolates the new vertices by applying polynomial weights to a basis of supporting vertices . The interpolation calculations for any given vertex can be broken down into sequences of multiply-add operations applied to the supporting vertices. Stencil table encodes a factorization of these weighted sums each stencils is created by combining the list of control vertices from the 1-ring. With iterative subdivision, each refinement step is dependent upon the previous subdivision step being completed, and a substantial number of steps may be required in order approximate the limit each subdivision step incurs an O4 n growing amount of computations. Instead, once the weights of the contributing coarse control vertices for a given refined vertex have been factorized, it is possible to apply the stencil and directly obtain the interpolated vertex data without having to process the data for the intermediate refinement levels. Cascading Stencils Client-code can control the amount of factorization of the stencils the tables can be generated with contributions all the way from a basis of coarse vertices, or reduced only to contributions from vertices from the previous level of refinement. The latter mode allows client-code to access and insert modifications to the vertex data at set refinement levels -- creating what are often referred to as hierarchical edits . Once the edits have been applied by the client-code, another set of stencils can be used to smooth the vertex data to a higher level of refinement. See implementation details, see the Far cascading stencil tutorial Limit Stencils Stencil tables can be trivially extended from discrete subdivided vertices to arbitrary locations on the limit surface. Aside from extraordinary points, every location on the limit surface can be expressed as a closed-form weighted average of a set of coarse control vertices from the 1-ring surrounding the face. The weight accumulation process is similar the control cage is adaptively subdivided around extraordinary locations. A stencil is then generated for each limit location simply by factorizing the bi-cubic Bspline patch weights over those of the contributing basis of control-vertices. The use of bi-cubic patches also allows the accumulation of analytical derivatives, so limit stencils carry a set of weights for tangent vectors. Once the stencil table has been generated, limit stencils are the most direct and efficient method of evaluation of specific locations on the limit of a subdivision surface, starting from the coarse vertices of the control cage. Also just as discrete stencils, limit stencils that are factorized from coarse control vertices do not have inter-dependencies and can be evaluated in parallel. For implementation details, see the glStencilViewer code example. Sample Location On Extraordinary Faces Each stencil is associated with a singular parametric location on the coarse mesh. The parametric location is defined as face location and local 0.0 - 1.0 u,v triplet In the case of face that are not quads, a parametric sub-face quadrant needs to be identified. This can be done either explicitly or implicitly by using the unique ptex face indices for instance. Code example When the control vertices controlPoints move in space, the limit locations can be very efficiently recomputed simply by applying the blending weights to the series of coarse control vertices class StencilType public void Clear memset x , 0 , sizeof StencilType void AddWithWeight StencilType const cv , float weight x cv . x weight y cv . y weight z cv . z weight float x , y , z std vector StencilType controlPoints , points , utan , vtan Update points by applying stencils controlStencils . UpdateValues StencilType controlPoints 0 , points 0 Update tangents by applying derivative stencils controlStencils . UpdateDerivs StencilType controlPoints 0 , utan 0 , vtan 0 Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"far_overview.html\"\n+ }, {\n \"title\": \"dxPtexViewer\",\n \"text\": \"dxPtexViewer dxPtexViewer 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS KEYBOARD CONTROLS SEE ALSO SYNOPSIS dxPtexViewer -f -yup -u -a -l isolation level -c animation loops -e environment map -d HDR diffuse map -s HDR specular map --disp displacement scale ptex color file ptex displacement file ptex occlusion file ptex specular file objfiles DESCRIPTION dxPtexViewer is a stand-alone application that showcases advanced HDR shading with color, displacement, occlusion and specular ptex maps. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. -y Swap Z-up geometry to Y-UP. -e environment map A low dynamic range spherical environment map used as a background. Ideally, a color-normalized version of the HDR light probe. -d HDR diffuse map An HDR file containing a diffuse environment map typically they are low resolution blurry hemispherical convolutions of the environment light probe. -s environment map An HDR file containing a specular environment map. --disp displacement scale A scalar multiplier for the shader displacement values. ptex color file A ptex file containing RGB channels read as material albedo color. ptex displacement file A single-channel ptex file preferrably float precision containing the displacement values. ptex occlusion file A single-channel ptex file preferrably 8 bits precision containing a pre-computed ambient occlusion signal. ptex specular file A single-channel ptex file preferrably 8 bits precision applied to modulate the specular reflectance of the material objfiles A sequence of obj files used as an animation loop the topology has to match the data contained in all the ptex files KEYBOARD CONTROLS q quit esc hide GUI f fit frame - increase decrese tessellation rate SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"dxptexviewer.html\"\n }, {\n \"title\": \"dxViewer\",\n \"text\": \"dxViewer dxViewer 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS dxViewer -f -yup -u -a -l refinement level -c animation loops objfiles -catmark -loop -bilinear DESCRIPTION dxViewer is a stand-alone application that showcases the application of uniform and feature adaptive subdivision schemes to a collection of geometric shapes. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"dxviewer.html\"\n }, {\n- \"title\": \"Contributing to OpenSubdiv\",\n- \"text\": \"Contributing to OpenSubdiv Contributing to OpenSubdiv 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Contributor License Agreement Understand Git Recommended Git Workflow Sending a Pull Request Contributor License Agreement In order for us to accept code submissions merge git pull-requests, contributors need to sign the Contributor License Agreement CLA. There are two CLAs, one for individuals and one for corporations. As for the end-user license, both are based on Apache. They are found in the code repository individual form , corporate form . Please email the signed CLA to opensubdiv-clapixar.com . Understand Git First, you should familiarize yourself with the Git data model and commands. For small changes you may not need to understand Git deeply, but for larger changes or working with the codebase over a long period of time, it becomes critical to understand more of whats going on under the hood. There are many free resources on the internet, one which weve found useful is the following e-book httpsgithub.compluralsightgit-internals-pdfreleases Recommended Git Workflow Once you have a local development tree cloned and working, you can start making changes. You will need to integrate changes from the source tree as you work the following outlines the workflow used by core OpenSubdiv engineers at Pixar and DreamWorks Fork the repository into your own local copy. This can be done via the GitHub website using the fork button. Clone your fork locally git clone your_fork_url OpenSubdiv.your_name e.g. git clone httpsgithub.comyourusernameOpenSubdiv.git OpenSubdiv.yourusername Setup two remotes, origin and upstream . Origin will be setup as a result of cloning your remote repository, but upstream must be setup manually git remote add upstream httpsgithub.comPixarAnimationStudiosOpenSubdiv.git Verify your remotes are setup correctly git remote -v Which should look something like origin httpsgithub.comyourusernameOpenSubdiv.git fetch origin httpsgithub.comyourusernameOpenSubdiv.git push upstream httpsgithub.comPixarAnimationStudiosOpenSubdiv.git fetch upstream httpsgithub.comPixarAnimationStudiosOpenSubdiv.git push Finally, fetch the upstream content this is required for the next step git fetch upstream Setup a new branch for each change. Working with branches in Git is its greatest pleasure, we strongly suggest setting up a new branch for each change which you plan to pull-request. All work is done in the dev branch, so be sure to keep your change in sync with this upstream branch. To begin, start your new branch from the dev branch git checkout -b dev-feature upstreamdev As you are working on your feature, new changes will be merged into the upstream repository, to sync these changes down and preserve your local edits, you can continually rebase your local work git pull --rebase upstream dev Notice the --rebase option here. It updates the current branch to the upstreamdev branch and rebases all edits so they are at the head of your local feature branch. Alternatively, you can rebase all your work at once when your feature is complete. Sending a Pull Request First, rebase and squash your changes appropriately to produce a clean set of changes at the head of your tree. We require changes to be grouped locally to ensure that rolling back changes can be done easily. If youve followed the steps above, your pending change should already be queued up as required. If you have not, you may need to rebase and squash changes at this point. Once the change is clean, push your changes to origin and go to the GitHub website to submit your pull request. Be sure to submit your request against the dev branch. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"contributing.html\"\n- }, {\n \"title\": \"Downloads\",\n \"text\": \"Downloads Downloads 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Coupe Car Coupe Car Note we can use javascripts buttons to trigger download see button-download or we can just paste regular ReST hyperlinks to the files here. Direct links probably more reliable though. Coupe car maya Download Coupe car obj Download EULA OpenSubdiv is covered by a modified Apache 2.0 license included below, and is free to use for commercial or non-commercial use. All Pixar patents in the area of subdivision surface algorithms have also been released for public use. We welcome any involvement in the development or extension of this code in fact, we would love it. Please contact us if you are interested. Copyright 2013 Pixar Licensed under the Apache License, Version 2.0 the Apache License with the following modification you may not use this file except in compliance with the Apache License and the following modification to it Section 6. Trademarks. is deleted and replaced with 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor and its affiliates, except as required to comply with Section 4c of the License and to reproduce the content of the NOTICE file. You may obtain a copy of the Apache License at httpwww.apache.orglicensesLICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the Apache License with the above modification is distributed on an AS IS BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the Apache License for the specific language governing permissions and limitations under the Apache License. Accept Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"downloads.html\"\n }, {\n+ \"title\": \"Contributing to OpenSubdiv\",\n+ \"text\": \"Contributing to OpenSubdiv Contributing to OpenSubdiv 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Contributor License Agreement Understand Git Recommended Git Workflow Sending a Pull Request Contributor License Agreement In order for us to accept code submissions merge git pull-requests, contributors need to sign the Contributor License Agreement CLA. There are two CLAs, one for individuals and one for corporations. As for the end-user license, both are based on Apache. They are found in the code repository individual form , corporate form . Please email the signed CLA to opensubdiv-clapixar.com . Understand Git First, you should familiarize yourself with the Git data model and commands. For small changes you may not need to understand Git deeply, but for larger changes or working with the codebase over a long period of time, it becomes critical to understand more of whats going on under the hood. There are many free resources on the internet, one which weve found useful is the following e-book httpsgithub.compluralsightgit-internals-pdfreleases Recommended Git Workflow Once you have a local development tree cloned and working, you can start making changes. You will need to integrate changes from the source tree as you work the following outlines the workflow used by core OpenSubdiv engineers at Pixar and DreamWorks Fork the repository into your own local copy. This can be done via the GitHub website using the fork button. Clone your fork locally git clone your_fork_url OpenSubdiv.your_name e.g. git clone httpsgithub.comyourusernameOpenSubdiv.git OpenSubdiv.yourusername Setup two remotes, origin and upstream . Origin will be setup as a result of cloning your remote repository, but upstream must be setup manually git remote add upstream httpsgithub.comPixarAnimationStudiosOpenSubdiv.git Verify your remotes are setup correctly git remote -v Which should look something like origin httpsgithub.comyourusernameOpenSubdiv.git fetch origin httpsgithub.comyourusernameOpenSubdiv.git push upstream httpsgithub.comPixarAnimationStudiosOpenSubdiv.git fetch upstream httpsgithub.comPixarAnimationStudiosOpenSubdiv.git push Finally, fetch the upstream content this is required for the next step git fetch upstream Setup a new branch for each change. Working with branches in Git is its greatest pleasure, we strongly suggest setting up a new branch for each change which you plan to pull-request. All work is done in the dev branch, so be sure to keep your change in sync with this upstream branch. To begin, start your new branch from the dev branch git checkout -b dev-feature upstreamdev As you are working on your feature, new changes will be merged into the upstream repository, to sync these changes down and preserve your local edits, you can continually rebase your local work git pull --rebase upstream dev Notice the --rebase option here. It updates the current branch to the upstreamdev branch and rebases all edits so they are at the head of your local feature branch. Alternatively, you can rebase all your work at once when your feature is complete. Sending a Pull Request First, rebase and squash your changes appropriately to produce a clean set of changes at the head of your tree. We require changes to be grouped locally to ensure that rolling back changes can be done easily. If youve followed the steps above, your pending change should already be queued up as required. If you have not, you may need to rebase and squash changes at this point. Once the change is clean, push your changes to origin and go to the GitHub website to submit your pull request. Be sure to submit your request against the dev branch. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"contributing.html\"\n+ }, {\n \"title\": \"Subdivision Compatibility\",\n \"text\": \"Subdivision Compatibility Subdivision Compatibility 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Subdivision Compatibility Compatibility with OpenSubdiv 2.x Compatibility with RenderMan Incompatibilities Other Differences Subdivision Compatibility This document highlights areas of compatibility with other software that makes use of subdivision surfaces, including previous versions of OpenSubdiv. The compatibility here refers to the choice of subdivision rules that define the shape of the resulting surfaces. Different subdivision rules will lead to different shapes. Choices affecting shape include the types of subdivision schemes supported e.g. Catmull-Clark, Loop, etc. the basic rules applied for these schemes any extended rules to affect sharpness or creasing rules applied separately to face-varying data Ensuring all of these rules are consistent provides the basis for consistent shapes, but further approximations to the limit surface create the potential for subtle deviations. Even within OpenSubdiv, multiple approximations are possible and vary. For now we focus on the compatibility of subdivision rules and deal with the limit approximations only when noteworthy. Compatibility with OpenSubdiv 2.x The refactoring of OpenSubdiv 3.0 data representations presented a unique opportunity to revisit some corners of the subdivision specification and remove or update some legacy features. Face-varying Interpolation Options Face-varying interpolation options have been consolidated into a single enum with one additional choice new to 3.0. No functionality from 2.x has been removed -- just re-expressed in a simpler and more comprehensible form. Face-varying interpolation was previously defined by a boundary interpolation enum with four modes and an additional boolean propagate corners option, which was little understood, i.e. void HbrMeshSetFVarInterpolateBoundarMethodInterpolateBoundaryMethod const void HbrMeshSetFVarPropagateCornersbool const The latter was only used in conjunction with one of the four modes edge and corner, so it was effectively a unique fifth choice. Closer inspection of all of these modes also revealed some unexpected and undesirable behavior in some common cases -- to an extent that could not simply be changed -- and so an additional mode was added to avoid such behavior. All choices are now provided through a single linear interpolation enum, described and illustrated in more detail in the overview of Face-Varying Interpolation . The use of boundary in the name of the enum was intentionally removed as the choice also affects interior interpolation. The new use of linear is now intended to reflect the fact that interpolation is constrained to be linear where specified by the choice applied. All five of Hbrs original modes of face-varying interpolation are supported with minor modifications where Hbr was found to be incorrect in the presence of semi-sharp creasing. An additional mode corners only has also been added to avoid some of the undesired side-effects of some existing modes illustrated below. The new values for the SdcOptionsFVarLinearInterpolation enum and its equivalents for HbrMeshs InterpolateBoundaryMethod and PropagateCorners flag are as follows ordered such that the set of linear constraints applied is always increasing -- from completely smooth to completely linear Sdc FVarLinearInterpolation Hbr FVarInterpolateBoundaryMethod Hbr FVarPropogateCorners FVAR_LINEAR_NONE k_InterpolateBoundaryEdgeOnly NA ignored FVAR_LINEAR_CORNERS_ONLY NA NA FVAR_LINEAR_CORNERS_PLUS1 k_InterpolateBoundaryEdgeAndCorner false FVAR_LINEAR_CORNERS_PLUS2 k_InterpolateBoundaryEdgeAndCorner true FVAR_LINEAR_BOUNDARIES k_InterpolateBoundaryAlwaysSharp NA ignored FVAR_LINEAR_ALL k_InterpolateBoundaryNone NA ignored Aside from the two corners plus modes that preserve Hbr behavior, all other modes are designed so that the interpolation of a disjoint face-varying region is not affected by changes to other regions that may share the same vertex. So the behavior of a disjoint region should be well understood and predictable when looking at it in isolation e.g. with corners only one would expect to see linear constraints applied where there are topological corners or infinitely sharp creasing applied within the region, and nowhere else. This is not true of the plus modes, and they are named to reflect the fact that more is taken into account where disjoint regions meet. The following example illustrates some undesired effects of the plus modes, which in part motivated the addition of the new corners only mode. The example uses the catmark_fvar_bound0 and catmark_fvar_bound1 shapes from the suite of regression shapes. Both shapes are a simple regular 4x4 grid of quads with face-varying UV data partitioned into multiple disjoint regions. The bound0 shape has two disjoint UV regions -- an upper and lower region -- while the bound1 shape further splits the lower region in two. This first figure illustrates the effect of the original plus1 mode which is also the same for plus2 Note that the effect of splitting the lower UV region in two has the undesired side effect of sharpening the boundary of the upper region. This is the result of the plus1 mode making collective decisions about the sharpness of all face-varying boundaries at the vertex rather than decisions local to each region. In both the plus1 and plus2 cases, all face-varying boundaries sharing a vertex will be sharpened if there are more than two regions meeting at that vertex. The second figure illustrates the effect of the new corners only mode As expected, the splitting of the lower region does not impact the upper region. In this case the decision to sharpen a face-varying boundary is made based on the local topology of each region. Vertex Interpolation Options Since the various options are now presented through a new API Sdc rather than Hbr, based on the history of some of these options and input from interested parties, the following changes have been implemented The naming of the standard creasing method has been changed from Normal to Uniform . Values for SdcOptionsCreasingMethod are now CREASE_UNIFORM standard integer subtraction per level default CREASE_CHAIKIN Chaikin non-uniform averaging around vertices Legacy modes of the smoothtriangle rule have been removed as they were never actually enabled in the code. Values for SdcOptionsTriangleSubdivision are now TRI_SUB_CATMARK Catmull-Clark weights default TRI_SUB_SMOOTH smooth triangle weights These should have little impact since one is a simple change in terminology as part of a new API while the other was removal of an option that was never used. Change to Chaikin creasing method In the process of re-implementing the Chaikin creasing method, observations lead to a conscious choice to change the behavior of Chaikin creasing in the presence of infinitely sharp edges most noticeable at boundaries. Previously, the inclusion of infinite sharpness values in the Chaikin methods computation of edge sharpness around a vertex would prevent a semi-sharp edge from decaying to zero. Infinitely sharp edges are now excluded from the Chaikin non-uniform averaging yielding a much more predictable and desirable result. For example, where the sharpness assignment is actually uniform at such a vertex, the result will now behave the same as the Uniform method. Since this feature has received little use only recently activated in RenderMan, now seemed the best time to make the change before more widespread adoption. Hierarchical Edits While extremely powerful, Hierarchical Edits come with additional maintenance and implementation complexity. Support for them in popular interchange formats and major DCC applications has either been dropped or was never implemented. As a result, the need for Hierarchical Edits is too limited to justify the cost and support for them, and they have therefore been removed from the 3.0 release of OpenSubdiv. Dropping support for Hierarchical Edits allows for significant simplifications of many areas of the subdivision algorithms. While the 3.0 release does not offer direct support for Hierarchical Edits, the architectural changes and direction of 3.0 still facilitate the application of the most common value edits for those wishing to use them -- though not always in the same optimized context. Of course, support for Hierarchical Edits in the future will be considered based on demand and resources. Non-Manifold Topology OpenSubdiv 2.x and earlier was limited to dealing with meshes whose topology was manifold -- a limitation imposed by the use of Hbr. With 3.0 no longer using Hbr, the manifold restriction has also been removed. OpenSubdiv 3.0, therefore, supports a superset of the meshes supported by 2.x and earlier versions with one known exception noted below. Non-manifold meshes that are acceptable to 3.0 however will likely not work with 2.x or earlier. The one known case that 3.0 will not represent the same as 2.x is ironically a case that is non-manifold, and for which Hbr did make special accommodation. That case occurs at a non-manifold vertex where two or more faces meet at a common vertex, but do not share a common edge, and when the boundary interpolation mode is set for smooth corners i.e. edge only, as illustrated below The cage is on the left and is refined to level 2 on the right. On the immediate right, boundary interpolation is set to sharp corners and the results appear the same for 2.x and 3.0. The center and far right illustrate the affects of setting boundary interpolation to smooth corners with 2.x and 3.0 respectively. Note that the 2.x result allows the refined mesh and so the limit surface to split into two while the 3.0 result keeps it connected. When Hbr encounters such vertices, regardless of the boundary mode it splits the vertex -- creating a separate instance of it for each face. So when building an HbrMesh, after finalizing the mesh, it will result in having more vertices than were originally defined termed split vertices. OpenSubdiv 2.x and earlier successfully hid the presence of these extra vertices from users. This case behaves in such a way that violates certain properties of the surface that 3.0 has attempted to emphasize. One of these relates to the nature of the limit surface and becomes more significant in the context of face varying if the cage is connected then so too is its limit surface, or similarly, if the cage consists of N connected regions then the limit surface similarly consists of N connected regions. Another undesirable property here is that the vertex V at which these faces meet must have more than one child vertex V . This makes it difficult to hide split vertices -- OpenSubdiv 2.x tables had an extra level of indirection that made it possible to do this relatively easily, but 3.0 has dispensed with such indirection where possible to streamline performance. Compatibility with RenderMan Since RenderMan and OpenSubdiv versions prior to 3.0 share a common library Hbr, most differences between RenderMan and OpenSubdiv 3.0 are covered in the preceding section of compatibility with OpenSubdiv 2.x. In addition to some features between RenderMan and OpenSubdiv that are not compatible, there are also other differences that may be present due to differences in the implementations of similar features. For most use cases, OpenSubdiv 3.0 is largely compatible with RenderMan. There are however some cases where some differences can be expected. These are highlighted below for completeness. Incompatibilities OpenSubdiv and RenderMan will be incompatible when certain features are used that are not common to both. They are fully described in the 2.x compatibility section and are listed briefly here. OpenSubdiv 3.0 Features Not Supported by RenderMan Non-manifold meshes Choice of the corners only face varying interpolation option RenderMan Features Not Supported by OpenSubdiv 3.0 Hierarchical Edits Other Differences Some differences can occur due to the differing implementations of the feature sets. Additionally, OpenSubdiv 3.0s implementation fixes some issues discovered in Hbr. Smooth Face-Varying Interpolation with Creasing There have been two discrepancies noted in the way that face-varying data is interpolated smoothly in the presence of creases. Smooth face-varying interpolation is expected to match vertex interpolation in the interior and only differ along the boundaries or discontinuities where the face-varying topology is intentionally made to differ from the vertex topology. A simple and effective way to identify discrepancies is to use the X and Y coordinates of vertex positions as the U and V of texture coordinates. If these U and V coordinates are assigned to a face-varying channel, smooth interpolation of U and V is expected to exactly match interpolation of X and Y, regardless of the presence of any sharpness and creasing. Two discrepancies can be seen with Hbr when superimposing the XY vertex interpolation with the projected UV face-varying interpolation. The first discrepancy occurs with interpolation around dart vertices This example shows a simple regular XY grid on the left with an interior sharp edge creating a dart vertex in the center. With no asymmetry in the vertices, the sharpness has no asymmetric affect and the XY vertex interpolation on the immediate right shows the regular grid expected from refinement. On the far right is the UV interpolation from Hbr, which exhibits distortion around the center dart vertex. The second discrepancy occurs with interpolation involving any fractional sharpness values. Hbr effectively ignores any fractional sharpness value in its face-varying interpolation. So edges of vertices with sharpness of say 2.5, will be treated as though their sharpness is 2.0 when face-varying values are interpolated. Similarly, any non-zero sharpness value less than 1.0 is treated as zero by truncation and so is essentially ignored. This example shows an asymmetric 2x2 grid of quads on the left with the center vertex progressively sharpened from 0.5 to 1.0. The three cases of the vertex smooth and sharpened are superimposed on the immediate right to display the three distinct interpolation results. On the far right the interpolation from Hbr displays the same three cases, but only two are visibly distinct -- the sharpness of 0.5 being treated the same as if it were 0.0. Both of these cases are corrected in OpenSubdiv 3.0. Smooth face-varying interpolation in the presence of creasing should match the expected behavior of the vertex interpolation, except where the face-varying topology is explicitly made to differ. The Chaikin Creasing Method At least two discrepancies are know to exist between the implementations of Hbr in RenderMan and OpenSubdiv 3.0 Use of Chaikin creasing with boundaries or infinitely sharp edges Subtle shape differences due to Hbrs use of predictive sharpness Fortunately, this feature was only recently added to Hbr and RenderMan and is little used, so it is expected these differences will have little impact. The first discrepancy is mentioned briefly in the previous section on compatibility between OpenSubdiv 2.x and 3.0. A conscious decision was made to change the averaging of sharpness values involving infinitely sharp edges in order to make results more predictable and favorable. The effects can be seen comparing the regression shape catmark_chaikin2. The second is more subtle and results from an oversight within Hbrs implementation that is not easily corrected. When determining what subdivision rule to apply from one level to the next, the sharpness values at the next level must be known in order to determine whether or not a transition between differing rules is required. If the rule at the next level differs from the previous, a combination of the two is applied. Such a change results from the sharpness values of one or more edges or the vertex itself decaying to zero. Rather than compute the sharpness values at the next level accurately, Hbr predicts it by simply subtracting 1.0 from it, as is done with the uniform creasing method, and it bases decisions on that predicted result. This does not work for Chaikin though. A sharpness value less than 1.0 may not decay to 0 if it is averaged with neighboring sharpness values greater than 1.0, so this sharpness prediction can result in the wrong rule being chosen for the next level. A typical case would have the subdivision rules for Chaikin creasing transition from Corner to Crease at one level, then from Crease to Smooth at the next. Hbrs predictive creasing might mistakenly detect the transition as Corner to Smooth at one level, then after properly computing the sharpness values for the next level later, from Crease to Smooth for the next. One of the regression shapes catmark_chakin1 was disabled from the regression suite because of this effect. The differences in shape that trigger its regression failure were investigated and determined to be the result of this issue. From observations thus far these differences are subtle but can be noticeable. Numerical Precision Since its inception, OpenSubdiv has sought to produce results that were numerically consistent to RenderMan. A regression suite to ensure a certain level of accuracy was provided to detect any substantial deviation. At some point in the development of OpenSubdiv, the point was made that numerical accuracy of Hbr could be improved by changing the order of operations and combining the vertex with the lowest coefficient first in one of the subdivision rules. This was applied more thoroughly in the independent implementation of 3.0 there seemed no reason not to. In most cases the relative magnitudes of the coefficients of subdivision and limit masks is clear so no overhead was necessary to detect them. At a certain point though, this greater accuracy came in conflict with the regression suite. It turned out that high-valence vertices could not be computed to within the desired tolerances set within the suite. The summation of many small coefficients for the adjacent vertices first, before the addition of the much larger coefficient for the primary vertex, allowed for the accumulation of precision that was being truncated by adding the much larger coefficient first in the Hbr implementation. With extremely high valence vertices, a difference in magnitude between the most and least significant coefficients of several orders of magnitude is likely, and that has a significant impact on the single-precision floating point computations. The improved accuracy of OpenSubdiv 3.0 can reach a magnitude that will not go undetected. Whether or not this can lead to visual artifacts is unclear. Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"compatibility.html\"\n }, {\n \"title\": \"Code Examples\",\n \"text\": \"Code Examples Code Examples 3.5.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Standalone Viewers OpenSubdiv builds a number of standalone viewers that demonstrate various aspects of the software. OpenGL examples glViewer glFVarViewer glEvalLimit glStencilViewer glPtexViewer glPaintTest glShareTopology DirectX examples dxViewer dxPtexViewer Metal examples mtlViewer mtlPtexViewer Common Command Line Options While the following command line options are common, not all examples support all -- in some cases, certain options are not applicable. -f launches the application in full-screen mode if supported -yup set initial view with Y-axis up Z-up is the default -u apply uniform subdivision to all meshes -a apply adaptive subdivision to create patches for the limit surface -l depth level of uniform or adaptive refinement to apply -c count number of repetitions of the animation loop when supported default of 0 is infinite -anim interpret a given set of Obj files as an animated sequence rather than a set of distinct meshes -catmark apply the Catmark scheme to all meshes in given Obj files default -loop apply the Loop scheme to all meshes in given Obj files -bilinear apply the Bilinear scheme to all meshes in given Obj files objfiles a set of one or more meshes in Obj format requiring a .obj extension that may be distinct meshes or animated versions of a single mesh Common Keyboard Controls Left mouse button drag orbit camera Middle mouse button drag pan camera Right mouse button dolly camera n, p nextprev model 1, 2, 3, ..., 9, 0 specify adaptive isolation or uniform refinement level , - increase decrease tessellation Tab toggle full-screen Esc turn on off the HUD w switch display mode q quit Generated on 2024-02-29 1258 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n"}]}]}, {"source1": "xz --list", "source2": "xz --list", "unified_diff": "@@ -1,14 +1,14 @@\n Streams: 1\n Blocks: 2\n- Compressed size: 30.0 MiB (31463748 B)\n+ Compressed size: 30.0 MiB (31463612 B)\n Uncompressed size: 47.8 MiB (50135040 B)\n Ratio: 0.628\n Check: CRC64\n Stream Padding: 0 B\n Streams:\n Stream Blocks CompOffset UncompOffset CompSize UncompSize Ratio Check Padding\n- 1 2 0 0 31463748 50135040 0.628 CRC64 0\n+ 1 2 0 0 31463612 50135040 0.628 CRC64 0\n Blocks:\n Stream Block CompOffset UncompOffset TotalSize UncompSize Ratio Check\n- 1 1 12 0 9141748 25165824 0.363 CRC64\n- 1 2 9141760 25165824 22321952 24969216 0.894 CRC64\n+ 1 1 12 0 9141624 25165824 0.363 CRC64\n+ 1 2 9141636 25165824 22321940 24969216 0.894 CRC64\n"}]}]}]}