Linux ns1.utparral.edu.mx 6.8.0-79-generic #79~22.04.1-Ubuntu SMP PREEMPT_DYNAMIC Fri Aug 15 16:54:53 UTC 2 x86_64
Apache/2.4.58 (Unix) OpenSSL/1.1.1w PHP/8.2.12 mod_perl/2.0.12 Perl/v5.34.1
: 10.10.1.9 | : 10.10.1.254
Cant Read [ /etc/named.conf ]
daemon
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
README
+ Create Folder
+ Create File
/
opt /
lampp /
share /
doc /
freetds-0.91 /
reference /
[ HOME SHELL ]
Name
Size
Permission
Action
a00001.html
5.09
KB
-rw-r--r--
a00002.html
5.12
KB
-rw-r--r--
a00003.html
7.5
KB
-rw-r--r--
a00004.html
11.21
KB
-rw-r--r--
a00005.html
5.16
KB
-rw-r--r--
a00006.html
4.77
KB
-rw-r--r--
a00007.html
7.99
KB
-rw-r--r--
a00008.html
9.54
KB
-rw-r--r--
a00009.html
7.7
KB
-rw-r--r--
a00010.html
7.39
KB
-rw-r--r--
a00011.html
5.04
KB
-rw-r--r--
a00012.html
5.05
KB
-rw-r--r--
a00013.html
5.7
KB
-rw-r--r--
a00014.html
8.35
KB
-rw-r--r--
a00015.html
5.61
KB
-rw-r--r--
a00016.html
5.03
KB
-rw-r--r--
a00017.html
4.74
KB
-rw-r--r--
a00018.html
5.38
KB
-rw-r--r--
a00019.html
6.01
KB
-rw-r--r--
a00020.html
7.43
KB
-rw-r--r--
a00021.html
8.25
KB
-rw-r--r--
a00022.html
8.35
KB
-rw-r--r--
a00023.html
5.06
KB
-rw-r--r--
a00024.html
5.04
KB
-rw-r--r--
a00025.html
5.4
KB
-rw-r--r--
a00026.html
4.76
KB
-rw-r--r--
a00027.html
5.73
KB
-rw-r--r--
a00028.html
5.74
KB
-rw-r--r--
a00029.html
6.59
KB
-rw-r--r--
a00030.html
6.67
KB
-rw-r--r--
a00031.html
15.43
KB
-rw-r--r--
a00032.html
9.3
KB
-rw-r--r--
a00033.html
5.06
KB
-rw-r--r--
a00034.html
9.57
KB
-rw-r--r--
a00035.html
6.28
KB
-rw-r--r--
a00036.html
5.65
KB
-rw-r--r--
a00037.html
5.7
KB
-rw-r--r--
a00038.html
9.53
KB
-rw-r--r--
a00039.html
16.2
KB
-rw-r--r--
a00040.html
5.08
KB
-rw-r--r--
a00041.html
8.6
KB
-rw-r--r--
a00042.html
5
KB
-rw-r--r--
a00043.html
6.47
KB
-rw-r--r--
a00044.html
5.66
KB
-rw-r--r--
a00045.html
7.19
KB
-rw-r--r--
a00046.html
7.21
KB
-rw-r--r--
a00047.html
5.18
KB
-rw-r--r--
a00048.html
5.18
KB
-rw-r--r--
a00049.html
9.66
KB
-rw-r--r--
a00050.html
5.12
KB
-rw-r--r--
a00051.html
5.17
KB
-rw-r--r--
a00052.html
5.16
KB
-rw-r--r--
a00053.html
5.23
KB
-rw-r--r--
a00054.html
8.51
KB
-rw-r--r--
a00055.html
5.03
KB
-rw-r--r--
a00056.html
5.04
KB
-rw-r--r--
a00057.html
6.35
KB
-rw-r--r--
a00058.html
8.61
KB
-rw-r--r--
a00059.html
5.04
KB
-rw-r--r--
a00060.html
4.73
KB
-rw-r--r--
a00061.html
5.34
KB
-rw-r--r--
a00062.html
5.36
KB
-rw-r--r--
a00063.html
5.36
KB
-rw-r--r--
a00064.html
5.03
KB
-rw-r--r--
a00065.html
5.04
KB
-rw-r--r--
a00066.html
5.03
KB
-rw-r--r--
a00067.html
5.66
KB
-rw-r--r--
a00068.html
5.86
KB
-rw-r--r--
a00069.html
5.57
KB
-rw-r--r--
a00070.html
6.18
KB
-rw-r--r--
a00071.html
5.33
KB
-rw-r--r--
a00072.html
5.33
KB
-rw-r--r--
a00073.html
7.31
KB
-rw-r--r--
a00074.html
5.1
KB
-rw-r--r--
a00075.html
6.99
KB
-rw-r--r--
a00076.html
4.98
KB
-rw-r--r--
a00077.html
20.31
KB
-rw-r--r--
a00078.html
5.29
KB
-rw-r--r--
a00079.html
5.86
KB
-rw-r--r--
a00080.html
5.73
KB
-rw-r--r--
a00081.html
5
KB
-rw-r--r--
a00082.html
4.98
KB
-rw-r--r--
a00083.html
5.08
KB
-rw-r--r--
a00084.html
6.27
KB
-rw-r--r--
a00085.html
5.62
KB
-rw-r--r--
a00086.html
5.03
KB
-rw-r--r--
a00087.html
5.1
KB
-rw-r--r--
a00088.html
6.03
KB
-rw-r--r--
a00089.html
5.34
KB
-rw-r--r--
a00090.html
7.45
KB
-rw-r--r--
a00091.html
5.65
KB
-rw-r--r--
a00092.html
21.3
KB
-rw-r--r--
a00093.html
7.92
KB
-rw-r--r--
a00094.html
15.52
KB
-rw-r--r--
a00095.html
6.38
KB
-rw-r--r--
a00096.html
11.71
KB
-rw-r--r--
a00097.html
6.29
KB
-rw-r--r--
a00098.html
13.98
KB
-rw-r--r--
a00099.html
4.82
KB
-rw-r--r--
a00100.html
5.03
KB
-rw-r--r--
a00101.html
9.82
KB
-rw-r--r--
a00102.html
6.02
KB
-rw-r--r--
a00103.html
5.88
KB
-rw-r--r--
a00104.html
5.42
KB
-rw-r--r--
a00105.html
5.32
KB
-rw-r--r--
a00106.html
5.34
KB
-rw-r--r--
a00107.html
10.46
KB
-rw-r--r--
a00108.html
7.39
KB
-rw-r--r--
a00109.html
8.06
KB
-rw-r--r--
a00110.html
5.05
KB
-rw-r--r--
a00111.html
4.84
KB
-rw-r--r--
a00112.html
5.32
KB
-rw-r--r--
a00113.html
5.05
KB
-rw-r--r--
a00114.html
5.27
KB
-rw-r--r--
a00115.html
8.27
KB
-rw-r--r--
a00116.html
6.65
KB
-rw-r--r--
a00117.html
5.45
KB
-rw-r--r--
a00118.html
8.51
KB
-rw-r--r--
a00119.html
6.04
KB
-rw-r--r--
a00120.html
5.28
KB
-rw-r--r--
a00121.html
5.03
KB
-rw-r--r--
a00122.html
23.85
KB
-rw-r--r--
a00123.html
8.08
KB
-rw-r--r--
a00124.html
7.49
KB
-rw-r--r--
a00125.html
5.39
KB
-rw-r--r--
a00126.html
6.16
KB
-rw-r--r--
a00127.html
9.79
KB
-rw-r--r--
a00128.html
5.04
KB
-rw-r--r--
a00129.html
5.05
KB
-rw-r--r--
a00130.html
6.97
KB
-rw-r--r--
a00131.html
5.07
KB
-rw-r--r--
a00132.html
4.74
KB
-rw-r--r--
a00133.html
5.35
KB
-rw-r--r--
a00134.html
5.04
KB
-rw-r--r--
a00135.html
5.61
KB
-rw-r--r--
a00136.html
5.05
KB
-rw-r--r--
a00137.html
5.04
KB
-rw-r--r--
a00138.html
5.07
KB
-rw-r--r--
a00139_source.html
11.43
KB
-rw-r--r--
a00140_source.html
80.94
KB
-rw-r--r--
a00141_source.html
22.01
KB
-rw-r--r--
a00142_source.html
29.78
KB
-rw-r--r--
a00143_source.html
22.17
KB
-rw-r--r--
a00144_source.html
22.68
KB
-rw-r--r--
a00145_source.html
7.38
KB
-rw-r--r--
a00146_source.html
11.99
KB
-rw-r--r--
a00147_source.html
7.82
KB
-rw-r--r--
a00148_source.html
7.08
KB
-rw-r--r--
a00149_source.html
7.28
KB
-rw-r--r--
a00150_source.html
6.43
KB
-rw-r--r--
a00151_source.html
17.88
KB
-rw-r--r--
a00152_source.html
10.36
KB
-rw-r--r--
a00153_source.html
25.08
KB
-rw-r--r--
a00154_source.html
10.19
KB
-rw-r--r--
a00155_source.html
7.84
KB
-rw-r--r--
a00156.html
272.91
KB
-rw-r--r--
a00156_source.html
184.55
KB
-rw-r--r--
a00157_source.html
9.36
KB
-rw-r--r--
a00158_source.html
8.23
KB
-rw-r--r--
a00159.html
261.4
KB
-rw-r--r--
a00159_source.html
204.45
KB
-rw-r--r--
a00160_source.html
8.71
KB
-rw-r--r--
a00161_source.html
30.54
KB
-rw-r--r--
a00162_source.html
25.37
KB
-rw-r--r--
a00163_source.html
15.5
KB
-rw-r--r--
a00164_source.html
18.94
KB
-rw-r--r--
a00165_source.html
71.63
KB
-rw-r--r--
a00166_source.html
14.86
KB
-rw-r--r--
a00167_source.html
12.51
KB
-rw-r--r--
a00168_source.html
11.83
KB
-rw-r--r--
a00175_source.html
6.25
KB
-rw-r--r--
a00178_source.html
7.03
KB
-rw-r--r--
a00180_source.html
6.83
KB
-rw-r--r--
a00182_source.html
6.38
KB
-rw-r--r--
a00184_source.html
9.44
KB
-rw-r--r--
a00190.html
20.94
KB
-rw-r--r--
a00191_source.html
47.93
KB
-rw-r--r--
a00192.html
90.18
KB
-rw-r--r--
a00195_source.html
55.99
KB
-rw-r--r--
a00209_source.html
15.62
KB
-rw-r--r--
a00214_source.html
15.98
KB
-rw-r--r--
a00238_source.html
73.42
KB
-rw-r--r--
a00241_source.html
18.27
KB
-rw-r--r--
a00245_source.html
15.45
KB
-rw-r--r--
a00261_source.html
19.73
KB
-rw-r--r--
a00264_source.html
11.21
KB
-rw-r--r--
a00272_source.html
11.11
KB
-rw-r--r--
a00277_source.html
27.6
KB
-rw-r--r--
a00278_source.html
4.27
KB
-rw-r--r--
a00281_source.html
7.24
KB
-rw-r--r--
a00282_source.html
9.89
KB
-rw-r--r--
a00285.html
12.8
KB
-rw-r--r--
a00286.html
285.63
KB
-rw-r--r--
a00287.html
34.7
KB
-rw-r--r--
a00288.html
63.13
KB
-rw-r--r--
a00289.html
38.17
KB
-rw-r--r--
a00290.html
46.19
KB
-rw-r--r--
a00291.html
10.64
KB
-rw-r--r--
a00292.html
58.3
KB
-rw-r--r--
a00293.html
4.94
KB
-rw-r--r--
a00294.html
4.45
KB
-rw-r--r--
a00295.html
24.44
KB
-rw-r--r--
a00296.html
18.52
KB
-rw-r--r--
a00297.html
31.72
KB
-rw-r--r--
a00298.html
41.55
KB
-rw-r--r--
a00299.html
41.1
KB
-rw-r--r--
a00300.html
32.41
KB
-rw-r--r--
a00301.html
78.43
KB
-rw-r--r--
a00302.html
34.37
KB
-rw-r--r--
a00303.html
17.36
KB
-rw-r--r--
a00304.html
53.65
KB
-rw-r--r--
a00305.html
7.01
KB
-rw-r--r--
a00306.html
9.88
KB
-rw-r--r--
a00307.html
4.19
KB
-rw-r--r--
a00309.html
4.59
KB
-rw-r--r--
a00310.html
4.53
KB
-rw-r--r--
a00311.html
6.01
KB
-rw-r--r--
a00312.html
8.16
KB
-rw-r--r--
a00313.html
4.56
KB
-rw-r--r--
a00314.html
4.37
KB
-rw-r--r--
a00315.html
6.22
KB
-rw-r--r--
a00316.html
7.11
KB
-rw-r--r--
a00317.html
6.13
KB
-rw-r--r--
a00318.html
5.97
KB
-rw-r--r--
a00319.html
4.54
KB
-rw-r--r--
a00320.html
4.55
KB
-rw-r--r--
a00321.html
4.88
KB
-rw-r--r--
a00322.html
6.47
KB
-rw-r--r--
a00323.html
4.88
KB
-rw-r--r--
a00324.html
4.53
KB
-rw-r--r--
a00325.html
4.35
KB
-rw-r--r--
a00326.html
4.71
KB
-rw-r--r--
a00327.html
5.08
KB
-rw-r--r--
a00328.html
5.96
KB
-rw-r--r--
a00329.html
6.44
KB
-rw-r--r--
a00330.html
6.53
KB
-rw-r--r--
a00331.html
4.54
KB
-rw-r--r--
a00332.html
4.53
KB
-rw-r--r--
a00333.html
4.74
KB
-rw-r--r--
a00334.html
4.36
KB
-rw-r--r--
a00335.html
4.78
KB
-rw-r--r--
a00336.html
4.92
KB
-rw-r--r--
a00337.html
5.55
KB
-rw-r--r--
a00338.html
5.47
KB
-rw-r--r--
a00339.html
10.44
KB
-rw-r--r--
a00340.html
6.96
KB
-rw-r--r--
a00341.html
4.5
KB
-rw-r--r--
a00342.html
6.19
KB
-rw-r--r--
a00343.html
5.17
KB
-rw-r--r--
a00344.html
4.87
KB
-rw-r--r--
a00345.html
4.83
KB
-rw-r--r--
a00346.html
7.14
KB
-rw-r--r--
a00347.html
9.79
KB
-rw-r--r--
a00348.html
4.59
KB
-rw-r--r--
a00349.html
6.6
KB
-rw-r--r--
a00350.html
4.53
KB
-rw-r--r--
a00351.html
5.4
KB
-rw-r--r--
a00352.html
4.89
KB
-rw-r--r--
a00353.html
5.88
KB
-rw-r--r--
a00354.html
5.89
KB
-rw-r--r--
a00355.html
6.93
KB
-rw-r--r--
a00356.html
4.56
KB
-rw-r--r--
a00357.html
4.56
KB
-rw-r--r--
a00358.html
4.53
KB
-rw-r--r--
a00359.html
4.58
KB
-rw-r--r--
a00360.html
4.56
KB
-rw-r--r--
a00361.html
4.65
KB
-rw-r--r--
a00362.html
6.5
KB
-rw-r--r--
a00363.html
4.53
KB
-rw-r--r--
a00364.html
4.54
KB
-rw-r--r--
a00365.html
4.92
KB
-rw-r--r--
a00366.html
6.07
KB
-rw-r--r--
a00367.html
4.51
KB
-rw-r--r--
a00368.html
4.35
KB
-rw-r--r--
a00369.html
4.7
KB
-rw-r--r--
a00370.html
4.69
KB
-rw-r--r--
a00371.html
4.69
KB
-rw-r--r--
a00372.html
4.53
KB
-rw-r--r--
a00373.html
4.52
KB
-rw-r--r--
a00374.html
4.52
KB
-rw-r--r--
a00375.html
4.84
KB
-rw-r--r--
a00376.html
4.69
KB
-rw-r--r--
a00377.html
4.87
KB
-rw-r--r--
a00378.html
5.23
KB
-rw-r--r--
a00379.html
4.7
KB
-rw-r--r--
a00380.html
4.7
KB
-rw-r--r--
a00381.html
5.87
KB
-rw-r--r--
a00382.html
4.51
KB
-rw-r--r--
a00383.html
5.77
KB
-rw-r--r--
a00384.html
4.53
KB
-rw-r--r--
a00385.html
13.22
KB
-rw-r--r--
a00386.html
4.67
KB
-rw-r--r--
a00387.html
5.08
KB
-rw-r--r--
a00388.html
4.95
KB
-rw-r--r--
a00389.html
4.54
KB
-rw-r--r--
a00390.html
4.52
KB
-rw-r--r--
a00391.html
4.57
KB
-rw-r--r--
a00392.html
5.32
KB
-rw-r--r--
a00393.html
4.74
KB
-rw-r--r--
a00394.html
4.56
KB
-rw-r--r--
a00395.html
4.53
KB
-rw-r--r--
a00396.html
4.96
KB
-rw-r--r--
a00397.html
4.74
KB
-rw-r--r--
a00398.html
5.97
KB
-rw-r--r--
a00399.html
4.7
KB
-rw-r--r--
a00400.html
11.46
KB
-rw-r--r--
a00402.html
6.25
KB
-rw-r--r--
a00403.html
9.98
KB
-rw-r--r--
a00404.html
5.08
KB
-rw-r--r--
a00405.html
6.84
KB
-rw-r--r--
a00406.html
5.32
KB
-rw-r--r--
a00407.html
9.82
KB
-rw-r--r--
a00408.html
4.39
KB
-rw-r--r--
a00409.html
4.52
KB
-rw-r--r--
a00410.html
5.41
KB
-rw-r--r--
a00411.html
4.92
KB
-rw-r--r--
a00412.html
4.86
KB
-rw-r--r--
a00413.html
4.8
KB
-rw-r--r--
a00414.html
4.76
KB
-rw-r--r--
a00415.html
4.72
KB
-rw-r--r--
a00416.html
7.54
KB
-rw-r--r--
a00417.html
5.96
KB
-rw-r--r--
a00418.html
6.6
KB
-rw-r--r--
a00419.html
4.54
KB
-rw-r--r--
a00420.html
4.37
KB
-rw-r--r--
a00421.html
4.72
KB
-rw-r--r--
a00422.html
4.56
KB
-rw-r--r--
a00423.html
4.69
KB
-rw-r--r--
a00424.html
6.42
KB
-rw-r--r--
a00425.html
5.5
KB
-rw-r--r--
a00426.html
4.74
KB
-rw-r--r--
a00427.html
6.43
KB
-rw-r--r--
a00428.html
5.12
KB
-rw-r--r--
a00429.html
4.72
KB
-rw-r--r--
a00430.html
4.54
KB
-rw-r--r--
a00431.html
12.55
KB
-rw-r--r--
a00432.html
6.55
KB
-rw-r--r--
a00433.html
5.39
KB
-rw-r--r--
a00434.html
4.72
KB
-rw-r--r--
a00435.html
5.06
KB
-rw-r--r--
a00436.html
6.28
KB
-rw-r--r--
a00437.html
4.54
KB
-rw-r--r--
a00438.html
4.54
KB
-rw-r--r--
a00439.html
5.63
KB
-rw-r--r--
a00440.html
4.52
KB
-rw-r--r--
a00441.html
4.35
KB
-rw-r--r--
a00442.html
4.71
KB
-rw-r--r--
a00443.html
4.54
KB
-rw-r--r--
a00444.html
4.86
KB
-rw-r--r--
a00445.html
4.54
KB
-rw-r--r--
a00446.html
4.53
KB
-rw-r--r--
a00447.html
4.56
KB
-rw-r--r--
all_5f.html
18.52
KB
-rw-r--r--
all_62.html
18.29
KB
-rw-r--r--
all_63.html
10.46
KB
-rw-r--r--
all_64.html
153.11
KB
-rw-r--r--
all_65.html
1.16
KB
-rw-r--r--
all_66.html
1.09
KB
-rw-r--r--
all_68.html
1.89
KB
-rw-r--r--
all_69.html
3.73
KB
-rw-r--r--
all_6c.html
1.47
KB
-rw-r--r--
all_6d.html
3.15
KB
-rw-r--r--
all_6e.html
3.63
KB
-rw-r--r--
all_6f.html
2.63
KB
-rw-r--r--
all_70.html
5.48
KB
-rw-r--r--
all_71.html
3.1
KB
-rw-r--r--
all_72.html
5.05
KB
-rw-r--r--
all_73.html
4.98
KB
-rw-r--r--
all_74.html
64.33
KB
-rw-r--r--
all_75.html
1.52
KB
-rw-r--r--
all_77.html
1.52
KB
-rw-r--r--
all_79.html
1.15
KB
-rw-r--r--
annotated.html
20.04
KB
-rw-r--r--
classes_5f.html
14.23
KB
-rw-r--r--
classes_62.html
1.41
KB
-rw-r--r--
classes_63.html
2.69
KB
-rw-r--r--
classes_64.html
5.54
KB
-rw-r--r--
classes_66.html
1.09
KB
-rw-r--r--
classes_6c.html
1.09
KB
-rw-r--r--
classes_6d.html
1.68
KB
-rw-r--r--
classes_6e.html
1.71
KB
-rw-r--r--
classes_70.html
1.98
KB
-rw-r--r--
classes_73.html
1.71
KB
-rw-r--r--
classes_74.html
17.73
KB
-rw-r--r--
classes.html
17.43
KB
-rw-r--r--
close.png
273
B
-rw-r--r--
defines_62.html
1.16
KB
-rw-r--r--
defines_64.html
11.61
KB
-rw-r--r--
defines_74.html
2.67
KB
-rw-r--r--
doxygen.css
7.73
KB
-rw-r--r--
doxygen.png
1.25
KB
-rw-r--r--
enums_5f.html
1.17
KB
-rw-r--r--
enums_74.html
1.92
KB
-rw-r--r--
enumvalues_74.html
6.12
KB
-rw-r--r--
files_62.html
1.08
KB
-rw-r--r--
files_64.html
1.09
KB
-rw-r--r--
files_73.html
1.09
KB
-rw-r--r--
files_74.html
1.08
KB
-rw-r--r--
files.html
12.78
KB
-rw-r--r--
functions_5f.html
4.67
KB
-rw-r--r--
functions_62.html
16.6
KB
-rw-r--r--
functions_64.html
135.7
KB
-rw-r--r--
functions_72.html
1.15
KB
-rw-r--r--
functions_74.html
29.48
KB
-rw-r--r--
functions.html
16.38
KB
-rw-r--r--
functions_vars.html
16.3
KB
-rw-r--r--
globals_0x62.html
7.9
KB
-rw-r--r--
globals_0x64.html
32.68
KB
-rw-r--r--
globals_0x72.html
5.19
KB
-rw-r--r--
globals_0x74.html
16.61
KB
-rw-r--r--
globals_defs.html
8.37
KB
-rw-r--r--
globals_enum.html
4.98
KB
-rw-r--r--
globals_eval.html
6.31
KB
-rw-r--r--
globals_func_0x62.html
7.76
KB
-rw-r--r--
globals_func_0x64.html
29.59
KB
-rw-r--r--
globals_func_0x72.html
5.15
KB
-rw-r--r--
globals_func_0x74.html
12.83
KB
-rw-r--r--
globals_func.html
6.13
KB
-rw-r--r--
globals.html
6.27
KB
-rw-r--r--
globals_type.html
5.87
KB
-rw-r--r--
globals_vars.html
4.69
KB
-rw-r--r--
index.html
5.46
KB
-rw-r--r--
installdox
2.52
KB
-rw-r--r--
modules.html
5.2
KB
-rw-r--r--
nomatches.html
461
B
-rw-r--r--
pages.html
4.01
KB
-rw-r--r--
search.css
3.75
KB
-rw-r--r--
search.js
21.65
KB
-rw-r--r--
search.png
527
B
-rw-r--r--
tab_b.gif
35
B
-rw-r--r--
tab_l.gif
706
B
-rw-r--r--
tab_r.gif
2.52
KB
-rw-r--r--
tabs.css
1.8
KB
-rw-r--r--
typedefs_64.html
1.56
KB
-rw-r--r--
typedefs_74.html
4.85
KB
-rw-r--r--
variables_62.html
1.18
KB
-rw-r--r--
variables_63.html
8.54
KB
-rw-r--r--
variables_64.html
2.24
KB
-rw-r--r--
variables_65.html
1.16
KB
-rw-r--r--
variables_68.html
1.89
KB
-rw-r--r--
variables_69.html
3.73
KB
-rw-r--r--
variables_6c.html
1.18
KB
-rw-r--r--
variables_6d.html
2.27
KB
-rw-r--r--
variables_6e.html
2.72
KB
-rw-r--r--
variables_6f.html
2.63
KB
-rw-r--r--
variables_70.html
4.29
KB
-rw-r--r--
variables_71.html
3.1
KB
-rw-r--r--
variables_72.html
4.69
KB
-rw-r--r--
variables_73.html
3.76
KB
-rw-r--r--
variables_74.html
4.88
KB
-rw-r--r--
variables_75.html
1.52
KB
-rw-r--r--
variables_77.html
1.52
KB
-rw-r--r--
variables_79.html
1.15
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : a00191_source.html
<!-- This comment will put IE 6, 7 and 8 in quirks mode --> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> <title>FreeTDS API: /home/jklowden/releases/freetds-0.91/src/dblib/buffering.h Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <link href="search/search.css" rel="stylesheet" type="text/css"/> <script type="text/javaScript" src="search/search.js"></script> <link href="doxygen.css" rel="stylesheet" type="text/css"/> </head> <body onload='searchBox.OnSelectItem(0);'> <!-- Generated by Doxygen 1.6.3 --> <script type="text/javascript"><!-- var searchBox = new SearchBox("searchBox", "search",false,'Search'); --></script> <div class="navigation" id="top"> <div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="pages.html"><span>Related Pages</span></a></li> <li><a href="modules.html"><span>Modules</span></a></li> <li><a href="annotated.html"><span>Classes</span></a></li> <li class="current"><a href="files.html"><span>Files</span></a></li> <li> <div id="MSearchBox" class="MSearchBoxInactive"> <img id="MSearchSelect" src="search/search.png" onmouseover="return searchBox.OnSearchSelectShow()" onmouseout="return searchBox.OnSearchSelectHide()" alt=""/> <input type="text" id="MSearchField" value="Search" accesskey="S" onfocus="searchBox.OnSearchFieldFocus(true)" onblur="searchBox.OnSearchFieldFocus(false)" onkeyup="searchBox.OnSearchFieldChange(event)"/> <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> </div> </li> </ul> </div> <div class="tabs"> <ul> <li><a href="files.html"><span>File List</span></a></li> <li><a href="globals.html"><span>File Members</span></a></li> </ul> </div> <h1>/home/jklowden/releases/freetds-0.91/src/dblib/buffering.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a><a class="code" href="a00057.html">00001</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="a00057.html">dblib_buffer_row</a> { <a name="l00003"></a><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293">00003</a> <a class="code" href="a00118.html" title="Hold information for any results.">TDSRESULTINFO</a> *<a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>; <a name="l00005"></a><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0">00005</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *<a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a>; <a name="l00007"></a><a class="code" href="a00057.html#a015599345b266045d8bd3fac731e4675">00007</a> DBINT <a class="code" href="a00057.html#a015599345b266045d8bd3fac731e4675" title="row number">row</a>; <a name="l00009"></a><a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a">00009</a> TDS_INT *<a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a>; <a name="l00010"></a>00010 } <a class="code" href="a00057.html">DBLIB_BUFFER_ROW</a>; <a name="l00011"></a>00011 <a name="l00012"></a>00012 <span class="keyword">static</span> <span class="keywordtype">void</span> buffer_struct_print(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf); <a name="l00013"></a>00013 <span class="keyword">static</span> <span class="keywordtype">int</span> buffer_save_row(<a class="code" href="a00098.html">DBPROCESS</a> *dbproc); <a name="l00014"></a>00014 <span class="keyword">static</span> <a class="code" href="a00057.html">DBLIB_BUFFER_ROW</a>* buffer_row_address(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> * buf, <span class="keywordtype">int</span> idx); <a name="l00015"></a>00015 <a name="l00016"></a>00016 <span class="preprocessor">#if ENABLE_EXTRA_CHECKS</span> <a name="l00017"></a>00017 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">void</span> buffer_check(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf) <a name="l00018"></a>00018 { <a name="l00019"></a>00019 <span class="keywordtype">int</span> i; <a name="l00020"></a>00020 <a name="l00021"></a>00021 <span class="comment">/* no buffering */</span> <a name="l00022"></a>00022 <span class="keywordflow">if</span> (buf->capacity == 0 || buf->capacity == 1) { <a name="l00023"></a>00023 assert(buf->head == 0); <a name="l00024"></a>00024 assert(buf->tail == 0 || buf->tail == 1); <a name="l00025"></a>00025 assert(buf->capacity == 1 || buf->rows == NULL); <a name="l00026"></a>00026 <span class="keywordflow">return</span>; <a name="l00027"></a>00027 } <a name="l00028"></a>00028 <a name="l00029"></a>00029 assert(buf->capacity > 0); <a name="l00030"></a>00030 assert(buf->head >= 0); <a name="l00031"></a>00031 assert(buf->tail >= 0); <a name="l00032"></a>00032 assert(buf->head < buf->capacity); <a name="l00033"></a>00033 assert(buf->tail <= buf->capacity); <a name="l00034"></a>00034 <a name="l00035"></a>00035 <span class="comment">/* check empty */</span> <a name="l00036"></a>00036 <span class="keywordflow">if</span> (buf->tail == buf->capacity) { <a name="l00037"></a>00037 assert(buf->head == 0); <a name="l00038"></a>00038 <span class="keywordflow">for</span> (i = 0; buf->rows && i < buf->capacity; ++i) { <a name="l00039"></a>00039 assert(buf->rows[i].<a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a> == NULL); <a name="l00040"></a>00040 assert(buf->rows[i].<a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a> == NULL); <a name="l00041"></a>00041 assert(buf->rows[i].<a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a> == NULL); <a name="l00042"></a>00042 assert(buf->rows[i].<a class="code" href="a00057.html#a015599345b266045d8bd3fac731e4675" title="row number">row</a> == 0); <a name="l00043"></a>00043 } <a name="l00044"></a>00044 <span class="keywordflow">return</span>; <a name="l00045"></a>00045 } <a name="l00046"></a>00046 <a name="l00047"></a>00047 <span class="keywordflow">if</span> (buf->rows == NULL) <a name="l00048"></a>00048 <span class="keywordflow">return</span>; <a name="l00049"></a>00049 <a name="l00050"></a>00050 <span class="comment">/* check filled part */</span> <a name="l00051"></a>00051 i = buf->tail; <a name="l00052"></a>00052 <span class="keywordflow">do</span> { <a name="l00053"></a>00053 assert(i >= 0 && i < buf->capacity); <a name="l00054"></a>00054 assert(buf->rows[i].<a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a> != NULL); <a name="l00055"></a>00055 assert(buf->rows[i].<a class="code" href="a00057.html#a015599345b266045d8bd3fac731e4675" title="row number">row</a> > 0); <a name="l00056"></a>00056 assert(buf->rows[i].<a class="code" href="a00057.html#a015599345b266045d8bd3fac731e4675" title="row number">row</a> <= buf->received); <a name="l00057"></a>00057 ++i; <a name="l00058"></a>00058 <span class="keywordflow">if</span> (i == buf->capacity) <a name="l00059"></a>00059 i = 0; <a name="l00060"></a>00060 } <span class="keywordflow">while</span> (i != buf->head); <a name="l00061"></a>00061 <a name="l00062"></a>00062 <span class="comment">/* check empty part */</span> <a name="l00063"></a>00063 <span class="keywordflow">if</span> (buf->head != buf->tail) { <a name="l00064"></a>00064 i = buf->head; <a name="l00065"></a>00065 <span class="keywordflow">do</span> { <a name="l00066"></a>00066 assert(i >= 0 && i < buf->capacity); <a name="l00067"></a>00067 assert(buf->rows[i].<a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a> == NULL); <a name="l00068"></a>00068 assert(buf->rows[i].<a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a> == NULL); <a name="l00069"></a>00069 assert(buf->rows[i].<a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a> == NULL); <a name="l00070"></a>00070 assert(buf->rows[i].<a class="code" href="a00057.html#a015599345b266045d8bd3fac731e4675" title="row number">row</a> == 0); <a name="l00071"></a>00071 ++i; <a name="l00072"></a>00072 <span class="keywordflow">if</span> (i == buf->capacity) <a name="l00073"></a>00073 i = 0; <a name="l00074"></a>00074 } <span class="keywordflow">while</span> (i != buf->tail); <a name="l00075"></a>00075 } <a name="l00076"></a>00076 } <a name="l00077"></a>00077 <span class="preprocessor">#define BUFFER_CHECK(buf) buffer_check(buf)</span> <a name="l00078"></a>00078 <span class="preprocessor"></span><span class="preprocessor">#else</span> <a name="l00079"></a>00079 <span class="preprocessor"></span><span class="preprocessor">#define BUFFER_CHECK(buf) do {} while(0)</span> <a name="l00080"></a>00080 <span class="preprocessor"></span><span class="preprocessor">#endif</span> <a name="l00081"></a>00081 <span class="preprocessor"></span> <a name="l00110"></a>00110 <span class="keyword">static</span> <span class="keywordtype">int</span> <a name="l00111"></a>00111 buffer_count(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf) <a name="l00112"></a>00112 { <a name="l00113"></a>00113 BUFFER_CHECK(buf); <a name="l00114"></a>00114 <span class="keywordflow">return</span> (buf->head > buf->tail) ? <a name="l00115"></a>00115 buf->head - buf->tail : <span class="comment">/* |...TddddH....| */</span> <a name="l00116"></a>00116 buf->capacity - (buf->tail - buf->head); <span class="comment">/* |ddddH....Tddd| */</span> <a name="l00117"></a>00117 } <a name="l00118"></a>00118 <a name="l00122"></a>00122 <span class="keyword">static</span> <span class="keywordtype">int</span> <a name="l00123"></a>00123 buffer_is_full(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf) <a name="l00124"></a>00124 { <a name="l00125"></a>00125 BUFFER_CHECK(buf); <a name="l00126"></a>00126 <span class="keywordflow">return</span> buf->capacity == buffer_count(buf) && buf->capacity > 1; <a name="l00127"></a>00127 } <a name="l00128"></a>00128 <a name="l00129"></a>00129 <span class="preprocessor">#ifndef NDEBUG</span> <a name="l00130"></a>00130 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">int</span> <a name="l00131"></a>00131 buffer_index_valid(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf, <span class="keywordtype">int</span> idx) <a name="l00132"></a>00132 { <a name="l00133"></a>00133 BUFFER_CHECK(buf); <a name="l00134"></a>00134 <span class="keywordflow">if</span> (buf->tail <= buf->head) <a name="l00135"></a>00135 <span class="keywordflow">if</span> (buf->head <= idx && idx <= buf->tail) <a name="l00136"></a>00136 <span class="keywordflow">return</span> 1; <a name="l00137"></a>00137 <a name="l00138"></a>00138 <span class="keywordflow">if</span> (0 <= idx && idx <= buf->head) <a name="l00139"></a>00139 <span class="keywordflow">return</span> 1; <a name="l00140"></a>00140 <a name="l00141"></a>00141 <span class="keywordflow">if</span> (buf->tail <= idx && idx < buf->capacity) <a name="l00142"></a>00142 <span class="keywordflow">return</span> 1; <a name="l00143"></a>00143 <span class="preprocessor">#if 0 </span> <a name="l00144"></a>00144 <span class="preprocessor"></span> printf(<span class="stringliteral">"buffer_index_valid: idx = %d\n"</span>, idx); <a name="l00145"></a>00145 buffer_struct_print(buf); <a name="l00146"></a>00146 <span class="preprocessor">#endif</span> <a name="l00147"></a>00147 <span class="preprocessor"></span> <span class="keywordflow">return</span> 0; <a name="l00148"></a>00148 } <a name="l00149"></a>00149 <span class="preprocessor">#endif</span> <a name="l00150"></a>00150 <span class="preprocessor"></span> <a name="l00151"></a>00151 <span class="keyword">static</span> <span class="keywordtype">void</span> <a name="l00152"></a>00152 buffer_free_row(<a class="code" href="a00057.html">DBLIB_BUFFER_ROW</a> *row) <a name="l00153"></a>00153 { <a name="l00154"></a>00154 <span class="keywordflow">if</span> (row-><a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a>) <a name="l00155"></a>00155 TDS_ZERO_FREE(row-><a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a>); <a name="l00156"></a>00156 <span class="keywordflow">if</span> (row-><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a>) { <a name="l00157"></a>00157 tds_free_row(row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>, row-><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a>); <a name="l00158"></a>00158 row-><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a> = NULL; <a name="l00159"></a>00159 } <a name="l00160"></a>00160 tds_free_results(row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>); <a name="l00161"></a>00161 row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a> = NULL; <a name="l00162"></a>00162 row-><a class="code" href="a00057.html#a015599345b266045d8bd3fac731e4675" title="row number">row</a> = 0; <a name="l00163"></a>00163 } <a name="l00164"></a>00164 <a name="l00165"></a>00165 <span class="comment">/*</span> <a name="l00166"></a>00166 <span class="comment"> * Buffer is freed at slightly odd points, whenever</span> <a name="l00167"></a>00167 <span class="comment"> * capacity changes: </span> <a name="l00168"></a>00168 <span class="comment"> * </span> <a name="l00169"></a>00169 <span class="comment"> * 1. When setting capacity, to release prior buffer. </span> <a name="l00170"></a>00170 <span class="comment"> * 2. By dbresults. When called the second time, it has to </span> <a name="l00171"></a>00171 <span class="comment"> * release prior storage because the new resultset will have</span> <a name="l00172"></a>00172 <span class="comment"> * a different width. </span> <a name="l00173"></a>00173 <span class="comment"> * 3. By dbclose(), else open/close/open would leak. </span> <a name="l00174"></a>00174 <span class="comment"> */</span> <a name="l00175"></a>00175 <span class="keyword">static</span> <span class="keywordtype">void</span> <a name="l00176"></a>00176 buffer_free(<a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf) <a name="l00177"></a>00177 { <a name="l00178"></a>00178 BUFFER_CHECK(buf); <a name="l00179"></a>00179 <span class="keywordflow">if</span> (buf->rows != NULL) { <a name="l00180"></a>00180 <span class="keywordtype">int</span> i; <a name="l00181"></a>00181 <span class="keywordflow">for</span> (i = 0; i < buf->capacity; ++i) <a name="l00182"></a>00182 buffer_free_row(&buf->rows[i]); <a name="l00183"></a>00183 TDS_ZERO_FREE(buf->rows); <a name="l00184"></a>00184 } <a name="l00185"></a>00185 BUFFER_CHECK(buf); <a name="l00186"></a>00186 } <a name="l00187"></a>00187 <a name="l00188"></a>00188 <span class="comment">/*</span> <a name="l00189"></a>00189 <span class="comment"> * When no rows are currently buffered (and the buffer is allocated)</span> <a name="l00190"></a>00190 <span class="comment"> * set the indices to their initial positions.</span> <a name="l00191"></a>00191 <span class="comment"> */</span> <a name="l00192"></a>00192 <span class="keyword">static</span> <span class="keywordtype">void</span> <a name="l00193"></a>00193 buffer_reset(<a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf) <a name="l00194"></a>00194 { <a name="l00195"></a>00195 buf->head = 0; <a name="l00196"></a>00196 buf->current = buf->tail = buf->capacity; <a name="l00197"></a>00197 BUFFER_CHECK(buf); <a name="l00198"></a>00198 } <a name="l00199"></a>00199 <a name="l00200"></a>00200 <span class="keyword">static</span> <span class="keywordtype">int</span> <a name="l00201"></a>00201 buffer_idx_increment(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf, <span class="keywordtype">int</span> idx) <a name="l00202"></a>00202 { <a name="l00203"></a>00203 <span class="keywordflow">if</span> (++idx >= buf->capacity) { <a name="l00204"></a>00204 idx = 0; <a name="l00205"></a>00205 } <a name="l00206"></a>00206 <span class="keywordflow">return</span> idx; <a name="l00207"></a>00207 } <a name="l00208"></a>00208 <a name="l00213"></a>00213 <span class="keyword">static</span> <a class="code" href="a00057.html">DBLIB_BUFFER_ROW</a>* <a name="l00214"></a>00214 buffer_row_address(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> * buf, <span class="keywordtype">int</span> idx) <a name="l00215"></a>00215 { <a name="l00216"></a>00216 BUFFER_CHECK(buf); <a name="l00217"></a>00217 <span class="keywordflow">if</span> (idx < 0 || idx >= buf->capacity) { <a name="l00218"></a>00218 printf(<span class="stringliteral">"idx is %d:\n"</span>, idx); <a name="l00219"></a>00219 buffer_struct_print(buf); <a name="l00220"></a>00220 <span class="keywordflow">return</span> NULL; <a name="l00221"></a>00221 } <a name="l00222"></a>00222 <a name="l00223"></a>00223 <span class="keywordflow">return</span> &(buf->rows[idx]); <a name="l00224"></a>00224 } <a name="l00225"></a>00225 <a name="l00229"></a>00229 <span class="keyword">static</span> DBINT <a name="l00230"></a>00230 buffer_idx2row(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf, <span class="keywordtype">int</span> idx) <a name="l00231"></a>00231 { <a name="l00232"></a>00232 BUFFER_CHECK(buf); <a name="l00233"></a>00233 <span class="keywordflow">return</span> buffer_row_address(buf, idx)-><a class="code" href="a00057.html#a015599345b266045d8bd3fac731e4675" title="row number">row</a>; <a name="l00234"></a>00234 } <a name="l00235"></a>00235 <a name="l00239"></a>00239 <span class="keyword">static</span> <span class="keywordtype">int</span> <a name="l00240"></a>00240 buffer_row2idx(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf, <span class="keywordtype">int</span> row_number) <a name="l00241"></a>00241 { <a name="l00242"></a>00242 <span class="keywordtype">int</span> i, ii, idx = -1; <a name="l00243"></a>00243 <a name="l00244"></a>00244 BUFFER_CHECK(buf); <a name="l00245"></a>00245 <span class="keywordflow">if</span> (buf->tail == buf->capacity) { <a name="l00246"></a>00246 assert (buf->head == 0); <a name="l00247"></a>00247 <span class="keywordflow">return</span> -1; <span class="comment">/* no rows buffered */</span> <a name="l00248"></a>00248 } <a name="l00249"></a>00249 <a name="l00250"></a>00250 <span class="comment">/* </span> <a name="l00251"></a>00251 <span class="comment"> * March through the buffers from tail to head, stop if we find our row. </span> <a name="l00252"></a>00252 <span class="comment"> * A full queue is indicated by tail == head (which means we can't write).</span> <a name="l00253"></a>00253 <span class="comment"> */</span> <a name="l00254"></a>00254 <span class="keywordflow">for</span> (ii=0, i = buf->tail; i != buf->head || ii == 0; i = buffer_idx_increment(buf, i)) { <a name="l00255"></a>00255 <span class="keywordflow">if</span>( buffer_idx2row(buf, i) == row_number) { <a name="l00256"></a>00256 idx = i; <a name="l00257"></a>00257 <span class="keywordflow">break</span>; <a name="l00258"></a>00258 } <a name="l00259"></a>00259 assert(ii++ < buf->capacity); <span class="comment">/* prevent infinite loop */</span> <a name="l00260"></a>00260 } <a name="l00261"></a>00261 <a name="l00262"></a>00262 <span class="keywordflow">return</span> idx; <a name="l00263"></a>00263 } <a name="l00264"></a>00264 <a name="l00269"></a>00269 <span class="keyword">static</span> <span class="keywordtype">void</span> <a name="l00270"></a>00270 buffer_delete_rows(<a class="code" href="a00084.html">DBPROC_ROWBUF</a> * buf, <span class="keywordtype">int</span> count) <a name="l00271"></a>00271 { <a name="l00272"></a>00272 <span class="keywordtype">int</span> i; <a name="l00273"></a>00273 <a name="l00274"></a>00274 BUFFER_CHECK(buf); <a name="l00275"></a>00275 <span class="keywordflow">if</span> (count < 0 || count > buffer_count(buf)) { <a name="l00276"></a>00276 count = buffer_count(buf); <a name="l00277"></a>00277 } <a name="l00278"></a>00278 <a name="l00279"></a>00279 <span class="keywordflow">for</span> (i=0; i < count; i++) { <a name="l00280"></a>00280 <span class="keywordflow">if</span> (buf->tail < buf->capacity) <a name="l00281"></a>00281 buffer_free_row(&buf->rows[buf->tail]); <a name="l00282"></a>00282 buf->tail = buffer_idx_increment(buf, buf->tail); <a name="l00283"></a>00283 <span class="comment">/* </span> <a name="l00284"></a>00284 <span class="comment"> * If deleting rows from the buffer catches the tail to the head, </span> <a name="l00285"></a>00285 <span class="comment"> * return to the initial position. Otherwise, it will look full.</span> <a name="l00286"></a>00286 <span class="comment"> */</span> <a name="l00287"></a>00287 <span class="keywordflow">if</span> (buf->tail == buf->head) { <a name="l00288"></a>00288 buffer_reset(buf); <a name="l00289"></a>00289 <span class="keywordflow">break</span>; <a name="l00290"></a>00290 } <a name="l00291"></a>00291 } <a name="l00292"></a>00292 <span class="preprocessor">#if 0</span> <a name="l00293"></a>00293 <span class="preprocessor"></span> buffer_struct_print(buf); <a name="l00294"></a>00294 <span class="preprocessor">#endif</span> <a name="l00295"></a>00295 <span class="preprocessor"></span> BUFFER_CHECK(buf); <a name="l00296"></a>00296 } <a name="l00297"></a>00297 <a name="l00298"></a>00298 <span class="keyword">static</span> <span class="keywordtype">void</span> <a name="l00299"></a>00299 buffer_transfer_bound_data(<a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf, TDS_INT res_type, TDS_INT compute_id, <a class="code" href="a00098.html">DBPROCESS</a> * dbproc, <span class="keywordtype">int</span> idx) <a name="l00300"></a>00300 { <a name="l00301"></a>00301 <span class="keywordtype">int</span> i; <a name="l00302"></a>00302 <span class="keywordtype">int</span> srctype, desttype; <a name="l00303"></a>00303 BYTE *src; <a name="l00304"></a>00304 <span class="keyword">const</span> <a class="code" href="a00057.html">DBLIB_BUFFER_ROW</a> *row; <a name="l00305"></a>00305 <a name="l00306"></a>00306 tdsdump_log(TDS_DBG_FUNC, <span class="stringliteral">"buffer_transfer_bound_data(%p %d %d %p %d)\n"</span>, buf, res_type, compute_id, dbproc, idx); <a name="l00307"></a>00307 BUFFER_CHECK(buf); <a name="l00308"></a>00308 assert(buffer_index_valid(buf, idx)); <a name="l00309"></a>00309 <a name="l00310"></a>00310 row = buffer_row_address(buf, idx); <a name="l00311"></a>00311 assert(row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>); <a name="l00312"></a>00312 <a name="l00313"></a>00313 <span class="keywordflow">for</span> (i = 0; i < row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>->num_cols; i++) { <a name="l00314"></a>00314 DBINT srclen; <a name="l00315"></a>00315 <a class="code" href="a00092.html" title="Metadata about columns in regular and compute rows.">TDSCOLUMN</a> *curcol = row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>->columns[i]; <a name="l00316"></a>00316 <a name="l00317"></a>00317 <span class="keywordflow">if</span> (row-><a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a>) <a name="l00318"></a>00318 curcol-><a class="code" href="a00092.html#ada14ba479a67762fc1bef78910ef4beb" title="size written in variable (ie: char, text, binary).">column_cur_size</a> = row-><a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a>[i]; <a name="l00319"></a>00319 <a name="l00320"></a>00320 <span class="keywordflow">if</span> (curcol->column_nullbind) { <a name="l00321"></a>00321 <span class="keywordflow">if</span> (curcol-><a class="code" href="a00092.html#ada14ba479a67762fc1bef78910ef4beb" title="size written in variable (ie: char, text, binary).">column_cur_size</a> < 0) { <a name="l00322"></a>00322 *(DBINT *)(curcol->column_nullbind) = -1; <a name="l00323"></a>00323 } <span class="keywordflow">else</span> { <a name="l00324"></a>00324 *(DBINT *)(curcol->column_nullbind) = 0; <a name="l00325"></a>00325 } <a name="l00326"></a>00326 } <a name="l00327"></a>00327 <span class="keywordflow">if</span> (!curcol->column_varaddr) <a name="l00328"></a>00328 <span class="keywordflow">continue</span>; <a name="l00329"></a>00329 <a name="l00330"></a>00330 <span class="keywordflow">if</span> (row-><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a>) <a name="l00331"></a>00331 src = &row-><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a>[curcol->column_data - row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>->current_row]; <a name="l00332"></a>00332 <span class="keywordflow">else</span> <a name="l00333"></a>00333 src = curcol->column_data; <a name="l00334"></a>00334 srclen = curcol-><a class="code" href="a00092.html#ada14ba479a67762fc1bef78910ef4beb" title="size written in variable (ie: char, text, binary).">column_cur_size</a>; <a name="l00335"></a>00335 <span class="keywordflow">if</span> (is_blob_col(curcol)) <a name="l00336"></a>00336 src = (BYTE *) ((<a class="code" href="a00091.html" title="Information about blobs (e.g.">TDSBLOB</a> *) src)->textvalue; <a name="l00337"></a>00337 desttype = _db_get_server_type(curcol->column_bindtype); <a name="l00338"></a>00338 srctype = tds_get_conversion_type(curcol-><a class="code" href="a00092.html#af6d0def414a911f259e907860736b506" title="This type can be different from wire type because conversion (e.g.">column_type</a>, curcol-><a class="code" href="a00092.html#a2c2756c00a1099c82d4cfa4da2894672" title="maximun size of data.">column_size</a>); <a name="l00339"></a>00339 <a name="l00340"></a>00340 <span class="keywordflow">if</span> (srclen <= 0) { <a name="l00341"></a>00341 <span class="keywordflow">if</span> (srclen == 0 || !curcol->column_nullbind) <a name="l00342"></a>00342 <a class="code" href="a00192.html#abf1b326d4b2838b34a5d006876bd08ef">dbgetnull</a>(dbproc, curcol->column_bindtype, curcol->column_bindlen, <a name="l00343"></a>00343 (BYTE *) curcol->column_varaddr); <a name="l00344"></a>00344 } <span class="keywordflow">else</span> { <a name="l00345"></a>00345 copy_data_to_host_var(dbproc, srctype, src, srclen, desttype, <a name="l00346"></a>00346 (BYTE *) curcol->column_varaddr, curcol->column_bindlen, <a name="l00347"></a>00347 curcol->column_bindtype, (DBINT*) curcol->column_nullbind); <a name="l00348"></a>00348 } <a name="l00349"></a>00349 } <a name="l00350"></a>00350 <a name="l00351"></a>00351 <span class="comment">/*</span> <a name="l00352"></a>00352 <span class="comment"> * This function always bumps current. Usually, it's called </span> <a name="l00353"></a>00353 <span class="comment"> * by dbnextrow(), so bumping current is a pretty obvious choice. </span> <a name="l00354"></a>00354 <span class="comment"> * It can also be called by dbgetrow(), but that function also </span> <a name="l00355"></a>00355 <span class="comment"> * causes the bump. If you call dbgetrow() for row N, a subsequent</span> <a name="l00356"></a>00356 <span class="comment"> * call to dbnextrow() yields N+1. </span> <a name="l00357"></a>00357 <span class="comment"> */</span> <a name="l00358"></a>00358 buf->current = buffer_idx_increment(buf, buf->current); <a name="l00359"></a>00359 <a name="l00360"></a>00360 } <span class="comment">/* end buffer_transfer_bound_data() */</span> <a name="l00361"></a>00361 <a name="l00362"></a>00362 <span class="keyword">static</span> <span class="keywordtype">void</span> <a name="l00363"></a>00363 buffer_struct_print(<span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf) <a name="l00364"></a>00364 { <a name="l00365"></a>00365 assert(buf); <a name="l00366"></a>00366 <a name="l00367"></a>00367 printf(<span class="stringliteral">"\t%d rows in buffer\n"</span>, buffer_count(buf)); <a name="l00368"></a>00368 <a name="l00369"></a>00369 printf(<span class="stringliteral">"\thead = %d\t"</span>, buf->head); <a name="l00370"></a>00370 printf(<span class="stringliteral">"\ttail = %d\t"</span>, buf->tail); <a name="l00371"></a>00371 printf(<span class="stringliteral">"\tcurrent = %d\n"</span>, buf->current); <a name="l00372"></a>00372 printf(<span class="stringliteral">"\tcapacity = %d\t"</span>, buf->capacity); <a name="l00373"></a>00373 printf(<span class="stringliteral">"\thead row number = %d\n"</span>, buf->received); <a name="l00374"></a>00374 } <a name="l00375"></a>00375 <a name="l00376"></a>00376 <span class="comment">/* * * Functions called only by public db-lib API take DBPROCESS* * */</span> <a name="l00377"></a>00377 <a name="l00394"></a>00394 <span class="keyword">static</span> <span class="keywordtype">int</span> <a name="l00395"></a>00395 buffer_current_index(<span class="keyword">const</span> <a class="code" href="a00098.html">DBPROCESS</a> *dbproc) <a name="l00396"></a>00396 { <a name="l00397"></a>00397 <span class="keyword">const</span> <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf = &dbproc->row_buf; <a name="l00398"></a>00398 <span class="preprocessor">#if 0</span> <a name="l00399"></a>00399 <span class="preprocessor"></span> buffer_struct_print(buf); <a name="l00400"></a>00400 <span class="preprocessor">#endif</span> <a name="l00401"></a>00401 <span class="preprocessor"></span> <span class="keywordflow">if</span> (buf->capacity <= 1) <span class="comment">/* no buffering */</span> <a name="l00402"></a>00402 <span class="keywordflow">return</span> -1; <a name="l00403"></a>00403 <span class="keywordflow">if</span> (buf->current == buf->head || buf->current == buf->capacity) <a name="l00404"></a>00404 <span class="keywordflow">return</span> -1; <a name="l00405"></a>00405 <a name="l00406"></a>00406 assert(buf->current >= 0); <a name="l00407"></a>00407 assert(buf->current < buf->capacity); <a name="l00408"></a>00408 <a name="l00409"></a>00409 <span class="keywordflow">if</span>( buf->tail < buf->head) { <a name="l00410"></a>00410 assert(buf->tail < buf->current); <a name="l00411"></a>00411 assert(buf->current < buf->head); <a name="l00412"></a>00412 } <span class="keywordflow">else</span> { <a name="l00413"></a>00413 <span class="keywordflow">if</span> (buf->current > buf->head) <a name="l00414"></a>00414 assert(buf->current > buf->tail); <a name="l00415"></a>00415 } <a name="l00416"></a>00416 <span class="keywordflow">return</span> buf->current; <a name="l00417"></a>00417 } <a name="l00418"></a>00418 <a name="l00419"></a>00419 <span class="comment">/*</span> <a name="l00420"></a>00420 <span class="comment"> * Normally called by dbsetopt() to prepare for buffering</span> <a name="l00421"></a>00421 <span class="comment"> * Called with nrows == 0 by dbopen to safely set buf->rows to NULL. </span> <a name="l00422"></a>00422 <span class="comment"> */</span> <a name="l00423"></a>00423 <span class="keyword">static</span> <span class="keywordtype">void</span> <a name="l00424"></a>00424 buffer_set_capacity(<a class="code" href="a00098.html">DBPROCESS</a> *dbproc, <span class="keywordtype">int</span> nrows) <a name="l00425"></a>00425 { <a name="l00426"></a>00426 <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf = &dbproc->row_buf; <a name="l00427"></a>00427 <a name="l00428"></a>00428 buffer_free(buf); <a name="l00429"></a>00429 <a name="l00430"></a>00430 memset(buf, 0, <span class="keyword">sizeof</span>(<a class="code" href="a00084.html">DBPROC_ROWBUF</a>)); <a name="l00431"></a>00431 <a name="l00432"></a>00432 <span class="keywordflow">if</span> (0 == nrows) { <a name="l00433"></a>00433 buf->capacity = 1; <a name="l00434"></a>00434 BUFFER_CHECK(buf); <a name="l00435"></a>00435 <span class="keywordflow">return</span>; <a name="l00436"></a>00436 } <a name="l00437"></a>00437 <a name="l00438"></a>00438 assert(0 < nrows); <a name="l00439"></a>00439 <a name="l00440"></a>00440 buf->capacity = nrows; <a name="l00441"></a>00441 BUFFER_CHECK(buf); <a name="l00442"></a>00442 } <a name="l00443"></a>00443 <a name="l00444"></a>00444 <span class="comment">/*</span> <a name="l00445"></a>00445 <span class="comment"> * Called only by dbresults(); capacity must be >= 1. </span> <a name="l00446"></a>00446 <span class="comment"> * Sybase's documents say dbresults() cannot return FAIL if the prior calls worked, </span> <a name="l00447"></a>00447 <span class="comment"> * which is a little strange, because (for FreeTDS, at least), dbresults</span> <a name="l00448"></a>00448 <span class="comment"> * is when we learn about the result set's width. Without that information, we</span> <a name="l00449"></a>00449 <span class="comment"> * can't allocate memory for the buffer. But if we *fail* to allocate memory, </span> <a name="l00450"></a>00450 <span class="comment"> * we're not to communicate it back to the caller? </span> <a name="l00451"></a>00451 <span class="comment"> */</span> <a name="l00452"></a>00452 <span class="keyword">static</span> <span class="keywordtype">void</span> <a name="l00453"></a>00453 buffer_alloc(<a class="code" href="a00098.html">DBPROCESS</a> *dbproc) <a name="l00454"></a>00454 { <a name="l00455"></a>00455 <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf = &dbproc->row_buf; <a name="l00456"></a>00456 <a name="l00457"></a>00457 <span class="comment">/* Call this function only after setting capacity. */</span> <a name="l00458"></a>00458 <a name="l00459"></a>00459 assert(buf); <a name="l00460"></a>00460 assert(buf->capacity > 0); <a name="l00461"></a>00461 assert(buf->rows == NULL); <a name="l00462"></a>00462 <a name="l00463"></a>00463 buf->rows = (<a class="code" href="a00057.html">DBLIB_BUFFER_ROW</a> *) calloc(buf->capacity, <span class="keyword">sizeof</span>(<a class="code" href="a00057.html">DBLIB_BUFFER_ROW</a>)); <a name="l00464"></a>00464 <a name="l00465"></a>00465 assert(buf->rows); <a name="l00466"></a>00466 <a name="l00467"></a>00467 buffer_reset(buf); <a name="l00468"></a>00468 <a name="l00469"></a>00469 buf->received = 0; <a name="l00470"></a>00470 } <a name="l00471"></a>00471 <a name="l00476"></a>00476 <span class="keyword">static</span> <span class="keywordtype">int</span> <a name="l00477"></a>00477 buffer_add_row(<a class="code" href="a00098.html">DBPROCESS</a> *dbproc, <a class="code" href="a00118.html" title="Hold information for any results.">TDSRESULTINFO</a> *resinfo) <a name="l00478"></a>00478 { <a name="l00479"></a>00479 <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf = &dbproc->row_buf; <a name="l00480"></a>00480 <a class="code" href="a00057.html">DBLIB_BUFFER_ROW</a> *row; <a name="l00481"></a>00481 <span class="keywordtype">int</span> i; <a name="l00482"></a>00482 <a name="l00483"></a>00483 assert(buf->capacity >= 0); <a name="l00484"></a>00484 <a name="l00485"></a>00485 <span class="keywordflow">if</span> (buffer_is_full(buf)) <a name="l00486"></a>00486 <span class="keywordflow">return</span> -1; <a name="l00487"></a>00487 <a name="l00488"></a>00488 row = buffer_row_address(buf, buf->head); <a name="l00489"></a>00489 <a name="l00490"></a>00490 <span class="comment">/* bump the row number, write it, and move the data to head */</span> <a name="l00491"></a>00491 <span class="keywordflow">if</span> (row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>) { <a name="l00492"></a>00492 tds_free_row(row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>, row-><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a>); <a name="l00493"></a>00493 tds_free_results(row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>); <a name="l00494"></a>00494 } <a name="l00495"></a>00495 row-><a class="code" href="a00057.html#a015599345b266045d8bd3fac731e4675" title="row number">row</a> = ++buf->received; <a name="l00496"></a>00496 ++resinfo->ref_count; <a name="l00497"></a>00497 row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a> = resinfo; <a name="l00498"></a>00498 row-><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a> = NULL; <a name="l00499"></a>00499 <span class="keywordflow">if</span> (row-><a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a>) <a name="l00500"></a>00500 free(row-><a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a>); <a name="l00501"></a>00501 row-><a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a> = (TDS_INT *) calloc(resinfo->num_cols, <span class="keyword">sizeof</span>(TDS_INT)); <a name="l00502"></a>00502 <span class="keywordflow">for</span> (i = 0; i < resinfo->num_cols; ++i) <a name="l00503"></a>00503 row-><a class="code" href="a00057.html#abe1aa9f8ea96dda1400654813e68130a" title="save old sizes">sizes</a>[i] = resinfo->columns[i]-><a class="code" href="a00092.html#ada14ba479a67762fc1bef78910ef4beb" title="size written in variable (ie: char, text, binary).">column_cur_size</a>; <a name="l00504"></a>00504 <a name="l00505"></a>00505 <span class="comment">/* initial condition is head == 0 and tail == capacity */</span> <a name="l00506"></a>00506 if (buf->tail == buf->capacity) { <a name="l00507"></a>00507 <span class="comment">/* bumping this tail will set it to zero */</span> <a name="l00508"></a>00508 assert(buf->head == 0); <a name="l00509"></a>00509 buf->tail = 0; <a name="l00510"></a>00510 } <a name="l00511"></a>00511 <a name="l00512"></a>00512 <span class="comment">/* update current, bump the head */</span> <a name="l00513"></a>00513 buf->current = buf->head; <a name="l00514"></a>00514 buf->head = buffer_idx_increment(buf, buf->head); <a name="l00515"></a>00515 <a name="l00516"></a>00516 <span class="keywordflow">return</span> buf->current; <a name="l00517"></a>00517 } <a name="l00518"></a>00518 <a name="l00519"></a>00519 <span class="keyword">static</span> <span class="keywordtype">int</span> <a name="l00520"></a>00520 buffer_save_row(<a class="code" href="a00098.html">DBPROCESS</a> *dbproc) <a name="l00521"></a>00521 { <a name="l00522"></a>00522 <a class="code" href="a00084.html">DBPROC_ROWBUF</a> *buf = &dbproc->row_buf; <a name="l00523"></a>00523 <a class="code" href="a00057.html">DBLIB_BUFFER_ROW</a> *row; <a name="l00524"></a>00524 <span class="keywordtype">int</span> idx = buf->head - 1; <a name="l00525"></a>00525 <a name="l00526"></a>00526 <span class="keywordflow">if</span> (buf->capacity <= 1) <a name="l00527"></a>00527 <span class="keywordflow">return</span> SUCCEED; <a name="l00528"></a>00528 <a name="l00529"></a>00529 <span class="keywordflow">if</span> (idx < 0) <a name="l00530"></a>00530 idx = buf->capacity - 1; <a name="l00531"></a>00531 <span class="keywordflow">if</span> (idx >= 0 && idx < buf->capacity) { <a name="l00532"></a>00532 row = &buf->rows[idx]; <a name="l00533"></a>00533 <a name="l00534"></a>00534 <span class="keywordflow">if</span> (row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a> && !row-><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a>) { <a name="l00535"></a>00535 row-><a class="code" href="a00057.html#a5a057d6bbecfac1a85a9fbcd09eaf3a0" title="row data, NULL for resinfo-&gt;current_row">row_data</a> = row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>->current_row; <a name="l00536"></a>00536 <a class="code" href="a00300.html#ga2593825c7b2d819c32043e3130724d83" title="Allocate space for row store return NULL on out of memory.">tds_alloc_row</a>(row-><a class="code" href="a00057.html#ad49b82677ae277e5d5b0038f522da293" title="pointer to result informations">resinfo</a>); <a name="l00537"></a>00537 } <a name="l00538"></a>00538 } <a name="l00539"></a>00539 <a name="l00540"></a>00540 <span class="keywordflow">return</span> SUCCEED; <a name="l00541"></a>00541 } <a name="l00542"></a>00542 </pre></div></div> <!--- window showing the filter options --> <div id="MSearchSelectWindow" onmouseover="return searchBox.OnSearchSelectShow()" onmouseout="return searchBox.OnSearchSelectHide()" onkeydown="return searchBox.OnSearchSelectKey(event)"> <a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Defines</a></div> <!-- iframe showing the search results (closed by default) --> <div id="MSearchResultsWindow"> <iframe src="" frameborder="0" name="MSearchResults" id="MSearchResults"> </iframe> </div> <hr class="footer"/><address style="text-align: right;"><small>Generated on Wed Aug 17 22:22:31 2011 for FreeTDS API by <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.3 </small></address> </body> </html>
Close