Mercurial > hg > nginx

comparison src/core/ngx_file.c @ 194:2357fa41738a

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
nginx-0.0.1-2003-11-21-09:30:49 import
author Igor Sysoev <igor@sysoev.ru>
date Fri, 21 Nov 2003 06:30:49 +0000
parents 02a715e85df1
children 8dee38ea9117
comparison
equal deleted inserted replaced
193:dd66383796a5 194:2357fa41738a
103 } 103 }
104 104
105 105
106 void ngx_create_hashed_filename(ngx_file_t *file, ngx_path_t *path) 106 void ngx_create_hashed_filename(ngx_file_t *file, ngx_path_t *path)
107 { 107 {
108 int i, name, pos, level; 108 int i, name, pos;
109 size_t level;
109 110
110 name = file->name.len; 111 name = file->name.len;
111 pos = path->name.len + 1; 112 pos = path->name.len + 1;
112 113
113 file->name.data[path->name.len + path->len] = '/'; 114 file->name.data[path->name.len + path->len] = '/';
190 191
191 char *ngx_conf_set_path_slot(ngx_conf_t *cf, ngx_command_t *cmd, void *conf) 192 char *ngx_conf_set_path_slot(ngx_conf_t *cf, ngx_command_t *cmd, void *conf)
192 { 193 {
193 char *p = conf; 194 char *p = conf;
194 195
195 int i, n; 196 int i, n, level;
196 ngx_str_t *value; 197 ngx_str_t *value;
197 ngx_path_t *path, **pp; 198 ngx_path_t *path, **pp;
198 199
199 pp = (ngx_path_t **) (p + cmd->offset); 200 pp = (ngx_path_t **) (p + cmd->offset);
200 201
217 path->name = value[1]; 218 path->name = value[1];
218 219
219 path->len = 0; 220 path->len = 0;
220 221
221 for (i = 0, n = 2; n < cf->args->nelts; i++, n++) { 222 for (i = 0, n = 2; n < cf->args->nelts; i++, n++) {
222 path->level[i] = ngx_atoi(value[n].data, value[n].len); 223 level = ngx_atoi(value[n].data, value[n].len);
223 if (path->level[i] == NGX_ERROR || path->level[i] == 0) { 224 if (level == NGX_ERROR || level == 0) {
224 return "invalid value"; 225 return "invalid value";
225 } 226 }
226 227
227 path->len += path->level[i] + 1; 228 path->len += path->level[i] + level + 1;
228 } 229 }
229 230
230 while (i < 3) { 231 while (i < 3) {
231 path->level[i++] = 0; 232 path->level[i++] = 0;
232 } 233 }