前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >使用loadrunner进行压力测试之----post请求

使用loadrunner进行压力测试之----post请求

作者头像
流柯
发布2018-08-30 17:18:38
1.9K0
发布2018-08-30 17:18:38
举报
文章被收录于专栏:流柯技术学院

1. 发送post请求时使用web_submit_data 

如:

代码语言:javascript
复制
 1 web_submit_data("create",//事务名 
 2           "Action=http://bizhi.sogou.com/diy/", //请求域名
 3           "Method=POST", //请求类型为post
 4           "RecContentType=application/json", //返回格式为json
 5           "Referer=http://bizhi.sogou.com/diy?wp_id=8743",
 6           "Snapshot=t4.inf",
 7           "Mode=HTML",
 8           ITEMDATA, //下面编辑post请求的数据
 9           "Name=img", "Value=http://dl.bizhi.sogou.com/images/2012/05/3/8743.jpg", ENDITEM, //数据的name、value及结束符
10           "Name=left", "Value=60", ENDITEM, //第二条数据的name、value及结束符
11           "Name=top", "Value=30", ENDITEM,
12           "Name=width", "Value=720", ENDITEM,
13           "Name=height", "Value=450", ENDITEM,
14           "Name=model", "Value=5/5s", ENDITEM,
15           "Name=x", "Value=1", ENDITEM,
16           "Name=y", "Value=1", ENDITEM,
17           "Name=ofc", "Value=1", ENDITEM,
18           "Name=wp_id", "Value=8743", ENDITEM,
19           "Name=mat", "Value=ms", ENDITEM,
20           "Name=curMode", "Value=normal", ENDITEM,
21           LAST);

2. 如果要发送的请求的数据值需要变化,那么需要将请求中的值参数化,,如果是根据上一条请求的返回值来确定请求中的数据值,那么需要对上一条请求的返回值进行解析

如:

代码语言:javascript
复制
 1 web_submit_data("create",
 2           "Action=http://bizhi.sogou.com/diy/",
 3           "Method=POST",
 4           "RecContentType=application/json",
 5           "Referer=http://bizhi.sogou.com/diy?wp_id=8743",
 6           "Snapshot=t4.inf",
 7           "Mode=HTML",
 8           ITEMDATA,
 9           "Name=img", "Value=http://dl.bizhi.sogou.com/images/2012/05/3/8743.jpg", ENDITEM,
10           "Name=left", "Value=60", ENDITEM,
11           "Name=top", "Value=30", ENDITEM,
12           "Name=width", "Value=720", ENDITEM,
13           "Name=height", "Value=450", ENDITEM,
14           "Name=model", "Value=5/5s", ENDITEM,
15           "Name=x", "Value=1", ENDITEM,
16           "Name=y", "Value=1", ENDITEM,
17           "Name=ofc", "Value=1", ENDITEM,
18           "Name=wp_id", "Value=8743", ENDITEM,
19           "Name=mat", "Value=ms", ENDITEM,
20           "Name=curMode", "Value=normal", ENDITEM,
21           LAST);//请求1
22 
23      lr_set_debug_message( 16 | 2,0 );
24      lr_save_string((char*)strtok(lr_eval_string("{Output}"),","),"temp");//获得请求1的返回数据
25      //lr_output_message("bian:%s",lr_eval_string("{temp}"));
26      lr_save_string((char*)strtok(NULL,","),"diyid_temp");//解析返回数据
27      //lr_output_message("bian2:%s",lr_eval_string("{diyid_temp}"));
28      lr_save_string((char*)strtok(lr_eval_string("{diyid_temp}"),":"),"temp");//解析返回数据
29      //lr_output_message("bian:%s",lr_eval_string("{temp}"));
30      lr_save_string((char*)strtok(NULL,":"),"diyid_temp");//解析返回数据
31      //lr_output_message("bian2:%s",lr_eval_string("{diyid_temp}"));
32      diyid_str=(char*)strtok(lr_eval_string("{diyid_temp}"),"}");
33      lr_save_string((char*)strtok(lr_eval_string("{diyid_temp}"),"}"),"diyid");//解析返回数据
34      //lr_output_message("bian:%s",lr_eval_string("{diyid}"));
35 
36      strcat(test, diyid_str);
37      //lr_output_message("%s",test);
38      lr_save_string(CMd5(test),"md5");//计算md5
39      //lr_output_message("bianmd5:%s",lr_eval_string("{md5}"));
40 
41 
42      web_submit_data("postname",
43                 "Action=http://bizhi.sogou.com/orderpay/",
44                 "Method=POST",
45                 "RecContentType=textml",
46                 "Mode=HTML",
47                 ITEMDATA,
48                 "Name=goods_action","Value=goods_detail",ENDITEM,
49                     "Name=goods_addr","Value=656",ENDITEM,
50                     "Name=md5str","Value={md5}",ENDITEM,//根据参数构造请求
51                     "Name=diy_id","Value={diyid}",ENDITEM,//根据参数构造请求
52                     "Name=goods_info","Value=448_1",ENDITEM,
53                     "Name=from","Value=diy",ENDITEM,
54                     "Name=Accept","Value=text/plain",ENDITEM,
55                 LAST); 

3.  另附,计算md5,需要添加md5的头文件,并别忘了在gloab.h中include md5.h

代码语言:javascript
复制
  1 #ifndef MD5_H
  2 #define MD5_H
  3 #ifdef __alpha
  4 typedef unsigned int uint32;
  5 #else
  6 typedef unsigned long uint32;
  7 #endif
  8 struct MD5Context {
  9         uint32 buf[4];
 10         uint32 bits[2];
 11         unsigned char in[64];
 12 };
 13 extern void MD5Init();
 14 extern void MD5Update();
 15 extern void MD5Final();
 16 extern void MD5Transform();
 17 typedef struct MD5Context MD5_CTX;
 18 #endif
 19 #ifdef sgi
 20 #define HIGHFIRST
 21 #endif
 22 #ifdef sun
 23 #define HIGHFIRST
 24 #endif
 25 #ifndef HIGHFIRST
 26 #define byteReverse(buf, len)    /* Nothing */
 27 #else
 28 void byteReverse(buf, longs)unsigned char *buf; unsigned longs;
 29 {
 30     uint32 t;
 31     do {
 32     t = (uint32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |((unsigned) buf[1] << 8 | buf[0]);
 33     *(uint32 *) buf = t;
 34     buf += 4;
 35     } while (--longs);
 36 }
 37 #endif
 38 void MD5Init(ctx)struct MD5Context *ctx;
 39 {
 40     ctx->buf[0] = 0x67452301;
 41     ctx->buf[1] = 0xefcdab89;
 42     ctx->buf[2] = 0x98badcfe;
 43     ctx->buf[3] = 0x10325476;
 44     ctx->bits[0] = 0;
 45     ctx->bits[1] = 0;
 46 }
 47 void MD5Update(ctx, buf, len) struct MD5Context *ctx; unsigned char *buf; unsigned len;
 48 {
 49     uint32 t;
 50     t = ctx->bits[0];
 51     if ((ctx->bits[0] = t + ((uint32) len << 3)) < t)
 52     ctx->bits[1]++;
 53     ctx->bits[1] += len >> 29;
 54     t = (t >> 3) & 0x3f;
 55     if (t) {
 56     unsigned char *p = (unsigned char *) ctx->in + t;
 57     t = 64 - t;
 58     if (len < t) {
 59         memcpy(p, buf, len);
 60         return;
 61     }
 62     memcpy(p, buf, t);
 63     byteReverse(ctx->in, 16);
 64     MD5Transform(ctx->buf, (uint32 *) ctx->in);
 65     buf += t;
 66     len -= t;
 67     }
 68     while (len >= 64) {
 69     memcpy(ctx->in, buf, 64);
 70     byteReverse(ctx->in, 16);
 71     MD5Transform(ctx->buf, (uint32 *) ctx->in);
 72     buf += 64;
 73     len -= 64;
 74     }
 75     memcpy(ctx->in, buf, len);
 76 }
 77 void MD5Final(digest, ctx)
 78     unsigned char digest[16]; struct MD5Context *ctx;
 79 {
 80     unsigned count;
 81     unsigned char *p;
 82     count = (ctx->bits[0] >> 3) & 0x3F;
 83     p = ctx->in + count;
 84     *p++ = 0x80;
 85     count = 64 - 1 - count;
 86     if (count < 8) {
 87     memset(p, 0, count);
 88     byteReverse(ctx->in, 16);
 89     MD5Transform(ctx->buf, (uint32 *) ctx->in);
 90     memset(ctx->in, 0, 56);
 91     } else {
 92     memset(p, 0, count - 8);
 93     }
 94     byteReverse(ctx->in, 14);
 95     ((uint32 *) ctx->in)[14] = ctx->bits[0];
 96     ((uint32 *) ctx->in)[15] = ctx->bits[1];
 97     MD5Transform(ctx->buf, (uint32 *) ctx->in);
 98     byteReverse((unsigned char *) ctx->buf, 4);
 99     memcpy(digest, ctx->buf, 16);
100     memset(ctx, 0, sizeof(ctx));
101 }
102 #define F1(x, y, z) (z ^ (x & (y ^ z)))
103 #define F2(x, y, z) F1(z, x, y)
104 #define F3(x, y, z) (x ^ y ^ z)
105 #define F4(x, y, z) (y ^ (x | ~z))
106 #define MD5STEP(f, w, x, y, z, data, s) ( w += f(x, y, z) + data,  w = w<<s | w>>(32-s),  w += x )
107 void MD5Transform(buf, in)
108     uint32 buf[4]; uint32 in[16];
109 {
110     register uint32 a, b, c, d;
111     a = buf[0];
112     b = buf[1];
113     c = buf[2];
114     d = buf[3];
115     MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
116     MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
117     MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
118     MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
119     MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
120     MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
121     MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
122     MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
123     MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
124     MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
125     MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
126     MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
127     MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
128     MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
129     MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
130     MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
131     MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
132     MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
133     MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
134     MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
135     MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
136     MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
137     MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
138     MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
139     MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
140     MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
141     MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
142     MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
143     MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
144     MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
145     MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
146     MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
147     MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
148     MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
149     MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
150     MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
151     MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
152     MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
153     MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
154     MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
155     MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
156     MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
157     MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
158     MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
159     MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
160     MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
161     MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
162     MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
163     MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
164     MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
165     MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
166     MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
167     MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
168     MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
169     MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
170     MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
171     MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
172     MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
173     MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
174     MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
175     MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
176     MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
177     MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
178     MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
179     buf[0] += a;
180     buf[1] += b;
181     buf[2] += c;
182     buf[3] += d;
183 }
184 char* CMd5(const char* s)
185 {
186      struct MD5Context md5c;
187      unsigned char ss[16];
188      char subStr[3],resStr[33];
189      int i;
190      MD5Init( &md5c );
191      MD5Update( &md5c, s, strlen(s) );
192      MD5Final( ss, &md5c );
193      strcpy(resStr,"");
194      for( i=0; i<16; i++ )
195      {
196          sprintf(subStr, "%02x", ss[i] );
197          itoa(ss[i],subStr,16);
198          if (strlen(subStr)==1) {
199              strcat(resStr,"0");
200          }
201          strcat(resStr,subStr);
202      }
203      strcat(resStr,"\0");
204      return resStr;
205 }

4. 如果一个action中有两个请求,那么压测是看到的响应时间曲线是两个请求综合的响应时间,如果要区分每个请求的响应时间,可加入请求开始/结束标记

代码语言:javascript
复制
1 lr_start_transaction(“create”);//插入结束标记,从此结束计时
2 lr_end_transaction(“create”, LR_AUTO);//插入结束标记,从此结束计时

转自:51testing论坛

本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2015-06-28 ,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档