| 1 | /*
|
|---|
| 2 | Unix SMB/CIFS implementation.
|
|---|
| 3 | Samba memory buffer functions
|
|---|
| 4 | Copyright (C) Andrew Tridgell 1992-1997
|
|---|
| 5 | Copyright (C) Luke Kenneth Casson Leighton 1996-1997
|
|---|
| 6 | Copyright (C) Jeremy Allison 1999
|
|---|
| 7 | Copyright (C) Andrew Bartlett 2003.
|
|---|
| 8 |
|
|---|
| 9 | This program is free software; you can redistribute it and/or modify
|
|---|
| 10 | it under the terms of the GNU General Public License as published by
|
|---|
| 11 | the Free Software Foundation; either version 3 of the License, or
|
|---|
| 12 | (at your option) any later version.
|
|---|
| 13 |
|
|---|
| 14 | This program is distributed in the hope that it will be useful,
|
|---|
| 15 | but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 17 | GNU General Public License for more details.
|
|---|
| 18 |
|
|---|
| 19 | You should have received a copy of the GNU General Public License
|
|---|
| 20 | along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|---|
| 21 | */
|
|---|
| 22 |
|
|---|
| 23 | #include "includes.h"
|
|---|
| 24 |
|
|---|
| 25 | #undef DBGC_CLASS
|
|---|
| 26 | #define DBGC_CLASS DBGC_RPC_PARSE
|
|---|
| 27 |
|
|---|
| 28 | /**
|
|---|
| 29 | * Dump a prs to a file: from the current location through to the end.
|
|---|
| 30 | **/
|
|---|
| 31 | void prs_dump(const char *name, int v, prs_struct *ps)
|
|---|
| 32 | {
|
|---|
| 33 | prs_dump_region(name, v, ps, ps->data_offset, ps->buffer_size);
|
|---|
| 34 | }
|
|---|
| 35 |
|
|---|
| 36 | /**
|
|---|
| 37 | * Dump from the start of the prs to the current location.
|
|---|
| 38 | **/
|
|---|
| 39 | void prs_dump_before(const char *name, int v, prs_struct *ps)
|
|---|
| 40 | {
|
|---|
| 41 | prs_dump_region(name, v, ps, 0, ps->data_offset);
|
|---|
| 42 | }
|
|---|
| 43 |
|
|---|
| 44 | /**
|
|---|
| 45 | * Dump everything from the start of the prs up to the current location.
|
|---|
| 46 | **/
|
|---|
| 47 | void prs_dump_region(const char *name, int v, prs_struct *ps,
|
|---|
| 48 | int from_off, int to_off)
|
|---|
| 49 | {
|
|---|
| 50 | int fd, i;
|
|---|
| 51 | char *fname = NULL;
|
|---|
| 52 | ssize_t sz;
|
|---|
| 53 | if (DEBUGLEVEL < 50) return;
|
|---|
| 54 | for (i=1;i<100;i++) {
|
|---|
| 55 | if (v != -1) {
|
|---|
| 56 | if (asprintf(&fname,"/tmp/%s_%d.%d.prs", name, v, i) < 0) {
|
|---|
| 57 | return;
|
|---|
| 58 | }
|
|---|
| 59 | } else {
|
|---|
| 60 | if (asprintf(&fname,"/tmp/%s.%d.prs", name, i) < 0) {
|
|---|
| 61 | return;
|
|---|
| 62 | }
|
|---|
| 63 | }
|
|---|
| 64 | fd = open(fname, O_WRONLY|O_CREAT|O_EXCL, 0644);
|
|---|
| 65 | if (fd != -1 || errno != EEXIST) break;
|
|---|
| 66 | }
|
|---|
| 67 | if (fd != -1) {
|
|---|
| 68 | sz = write(fd, ps->data_p + from_off, to_off - from_off);
|
|---|
| 69 | i = close(fd);
|
|---|
| 70 | if ( (sz != to_off-from_off) || (i != 0) ) {
|
|---|
| 71 | DEBUG(0,("Error writing/closing %s: %ld!=%ld %d\n", fname, (unsigned long)sz, (unsigned long)to_off-from_off, i ));
|
|---|
| 72 | } else {
|
|---|
| 73 | DEBUG(0,("created %s\n", fname));
|
|---|
| 74 | }
|
|---|
| 75 | }
|
|---|
| 76 | SAFE_FREE(fname);
|
|---|
| 77 | }
|
|---|
| 78 |
|
|---|
| 79 | /*******************************************************************
|
|---|
| 80 | Debug output for parsing info
|
|---|
| 81 |
|
|---|
| 82 | XXXX side-effect of this function is to increase the debug depth XXXX.
|
|---|
| 83 |
|
|---|
| 84 | ********************************************************************/
|
|---|
| 85 |
|
|---|
| 86 | void prs_debug(prs_struct *ps, int depth, const char *desc, const char *fn_name)
|
|---|
| 87 | {
|
|---|
| 88 | DEBUG(5+depth, ("%s%06x %s %s\n", tab_depth(5+depth,depth), ps->data_offset, fn_name, desc));
|
|---|
| 89 | }
|
|---|
| 90 |
|
|---|
| 91 | /**
|
|---|
| 92 | * Initialise an expandable parse structure.
|
|---|
| 93 | *
|
|---|
| 94 | * @param size Initial buffer size. If >0, a new buffer will be
|
|---|
| 95 | * created with malloc().
|
|---|
| 96 | *
|
|---|
| 97 | * @return False if allocation fails, otherwise True.
|
|---|
| 98 | **/
|
|---|
| 99 |
|
|---|
| 100 | bool prs_init(prs_struct *ps, uint32 size, TALLOC_CTX *ctx, bool io)
|
|---|
| 101 | {
|
|---|
| 102 | ZERO_STRUCTP(ps);
|
|---|
| 103 | ps->io = io;
|
|---|
| 104 | ps->bigendian_data = RPC_LITTLE_ENDIAN;
|
|---|
| 105 | ps->align = RPC_PARSE_ALIGN;
|
|---|
| 106 | ps->is_dynamic = False;
|
|---|
| 107 | ps->data_offset = 0;
|
|---|
| 108 | ps->buffer_size = 0;
|
|---|
| 109 | ps->data_p = NULL;
|
|---|
| 110 | ps->mem_ctx = ctx;
|
|---|
| 111 |
|
|---|
| 112 | if (size != 0) {
|
|---|
| 113 | ps->buffer_size = size;
|
|---|
| 114 | if((ps->data_p = (char *)SMB_MALLOC((size_t)size)) == NULL) {
|
|---|
| 115 | DEBUG(0,("prs_init: malloc fail for %u bytes.\n", (unsigned int)size));
|
|---|
| 116 | return False;
|
|---|
| 117 | }
|
|---|
| 118 | memset(ps->data_p, '\0', (size_t)size);
|
|---|
| 119 | ps->is_dynamic = True; /* We own this memory. */
|
|---|
| 120 | } else if (MARSHALLING(ps)) {
|
|---|
| 121 | /* If size is zero and we're marshalling we should allocate memory on demand. */
|
|---|
| 122 | ps->is_dynamic = True;
|
|---|
| 123 | }
|
|---|
| 124 |
|
|---|
| 125 | return True;
|
|---|
| 126 | }
|
|---|
| 127 |
|
|---|
| 128 | /*******************************************************************
|
|---|
| 129 | Delete the memory in a parse structure - if we own it.
|
|---|
| 130 |
|
|---|
| 131 | NOTE: Contrary to the somewhat confusing naming, this function is not
|
|---|
| 132 | intended for freeing memory allocated by prs_alloc_mem(). That memory
|
|---|
| 133 | is attached to the talloc context given by ps->mem_ctx.
|
|---|
| 134 | ********************************************************************/
|
|---|
| 135 |
|
|---|
| 136 | void prs_mem_free(prs_struct *ps)
|
|---|
| 137 | {
|
|---|
| 138 | if(ps->is_dynamic)
|
|---|
| 139 | SAFE_FREE(ps->data_p);
|
|---|
| 140 | ps->is_dynamic = False;
|
|---|
| 141 | ps->buffer_size = 0;
|
|---|
| 142 | ps->data_offset = 0;
|
|---|
| 143 | }
|
|---|
| 144 |
|
|---|
| 145 | /*******************************************************************
|
|---|
| 146 | Clear the memory in a parse structure.
|
|---|
| 147 | ********************************************************************/
|
|---|
| 148 |
|
|---|
| 149 | void prs_mem_clear(prs_struct *ps)
|
|---|
| 150 | {
|
|---|
| 151 | if (ps->buffer_size)
|
|---|
| 152 | memset(ps->data_p, '\0', (size_t)ps->buffer_size);
|
|---|
| 153 | }
|
|---|
| 154 |
|
|---|
| 155 | /*******************************************************************
|
|---|
| 156 | Allocate memory when unmarshalling... Always zero clears.
|
|---|
| 157 | ********************************************************************/
|
|---|
| 158 |
|
|---|
| 159 | #if defined(PARANOID_MALLOC_CHECKER)
|
|---|
| 160 | char *prs_alloc_mem_(prs_struct *ps, size_t size, unsigned int count)
|
|---|
| 161 | #else
|
|---|
| 162 | char *prs_alloc_mem(prs_struct *ps, size_t size, unsigned int count)
|
|---|
| 163 | #endif
|
|---|
| 164 | {
|
|---|
| 165 | char *ret = NULL;
|
|---|
| 166 |
|
|---|
| 167 | if (size && count) {
|
|---|
| 168 | /* We can't call the type-safe version here. */
|
|---|
| 169 | ret = (char *)_talloc_zero_array(ps->mem_ctx, size, count,
|
|---|
| 170 | "parse_prs");
|
|---|
| 171 | }
|
|---|
| 172 | return ret;
|
|---|
| 173 | }
|
|---|
| 174 |
|
|---|
| 175 | /*******************************************************************
|
|---|
| 176 | Return the current talloc context we're using.
|
|---|
| 177 | ********************************************************************/
|
|---|
| 178 |
|
|---|
| 179 | TALLOC_CTX *prs_get_mem_context(prs_struct *ps)
|
|---|
| 180 | {
|
|---|
| 181 | return ps->mem_ctx;
|
|---|
| 182 | }
|
|---|
| 183 |
|
|---|
| 184 | /*******************************************************************
|
|---|
| 185 | Hand some already allocated memory to a prs_struct.
|
|---|
| 186 | ********************************************************************/
|
|---|
| 187 |
|
|---|
| 188 | void prs_give_memory(prs_struct *ps, char *buf, uint32 size, bool is_dynamic)
|
|---|
| 189 | {
|
|---|
| 190 | ps->is_dynamic = is_dynamic;
|
|---|
| 191 | ps->data_p = buf;
|
|---|
| 192 | ps->buffer_size = size;
|
|---|
| 193 | }
|
|---|
| 194 |
|
|---|
| 195 | /*******************************************************************
|
|---|
| 196 | Take some memory back from a prs_struct.
|
|---|
| 197 | ********************************************************************/
|
|---|
| 198 |
|
|---|
| 199 | char *prs_take_memory(prs_struct *ps, uint32 *psize)
|
|---|
| 200 | {
|
|---|
| 201 | char *ret = ps->data_p;
|
|---|
| 202 | if(psize)
|
|---|
| 203 | *psize = ps->buffer_size;
|
|---|
| 204 | ps->is_dynamic = False;
|
|---|
| 205 | prs_mem_free(ps);
|
|---|
| 206 | return ret;
|
|---|
| 207 | }
|
|---|
| 208 |
|
|---|
| 209 | /*******************************************************************
|
|---|
| 210 | Set a prs_struct to exactly a given size. Will grow or tuncate if neccessary.
|
|---|
| 211 | ********************************************************************/
|
|---|
| 212 |
|
|---|
| 213 | bool prs_set_buffer_size(prs_struct *ps, uint32 newsize)
|
|---|
| 214 | {
|
|---|
| 215 | if (newsize > ps->buffer_size)
|
|---|
| 216 | return prs_force_grow(ps, newsize - ps->buffer_size);
|
|---|
| 217 |
|
|---|
| 218 | if (newsize < ps->buffer_size) {
|
|---|
| 219 | ps->buffer_size = newsize;
|
|---|
| 220 |
|
|---|
| 221 | /* newsize == 0 acts as a free and set pointer to NULL */
|
|---|
| 222 | if (newsize == 0) {
|
|---|
| 223 | SAFE_FREE(ps->data_p);
|
|---|
| 224 | } else {
|
|---|
| 225 | ps->data_p = (char *)SMB_REALLOC(ps->data_p, newsize);
|
|---|
| 226 |
|
|---|
| 227 | if (ps->data_p == NULL) {
|
|---|
| 228 | DEBUG(0,("prs_set_buffer_size: Realloc failure for size %u.\n",
|
|---|
| 229 | (unsigned int)newsize));
|
|---|
| 230 | DEBUG(0,("prs_set_buffer_size: Reason %s\n",strerror(errno)));
|
|---|
| 231 | return False;
|
|---|
| 232 | }
|
|---|
| 233 | }
|
|---|
| 234 | }
|
|---|
| 235 |
|
|---|
| 236 | return True;
|
|---|
| 237 | }
|
|---|
| 238 |
|
|---|
| 239 | /*******************************************************************
|
|---|
| 240 | Attempt, if needed, to grow a data buffer.
|
|---|
| 241 | Also depends on the data stream mode (io).
|
|---|
| 242 | ********************************************************************/
|
|---|
| 243 |
|
|---|
| 244 | bool prs_grow(prs_struct *ps, uint32 extra_space)
|
|---|
| 245 | {
|
|---|
| 246 | uint32 new_size;
|
|---|
| 247 |
|
|---|
| 248 | ps->grow_size = MAX(ps->grow_size, ps->data_offset + extra_space);
|
|---|
| 249 |
|
|---|
| 250 | if(ps->data_offset + extra_space <= ps->buffer_size)
|
|---|
| 251 | return True;
|
|---|
| 252 |
|
|---|
| 253 | /*
|
|---|
| 254 | * We cannot grow the buffer if we're not reading
|
|---|
| 255 | * into the prs_struct, or if we don't own the memory.
|
|---|
| 256 | */
|
|---|
| 257 |
|
|---|
| 258 | if(UNMARSHALLING(ps) || !ps->is_dynamic) {
|
|---|
| 259 | DEBUG(0,("prs_grow: Buffer overflow - unable to expand buffer by %u bytes.\n",
|
|---|
| 260 | (unsigned int)extra_space));
|
|---|
| 261 | return False;
|
|---|
| 262 | }
|
|---|
| 263 |
|
|---|
| 264 | /*
|
|---|
| 265 | * Decide how much extra space we really need.
|
|---|
| 266 | */
|
|---|
| 267 |
|
|---|
| 268 | extra_space -= (ps->buffer_size - ps->data_offset);
|
|---|
| 269 | if(ps->buffer_size == 0) {
|
|---|
| 270 | /*
|
|---|
| 271 | * Ensure we have at least a PDU's length, or extra_space, whichever
|
|---|
| 272 | * is greater.
|
|---|
| 273 | */
|
|---|
| 274 |
|
|---|
| 275 | new_size = MAX(RPC_MAX_PDU_FRAG_LEN,extra_space);
|
|---|
| 276 |
|
|---|
| 277 | if((ps->data_p = (char *)SMB_MALLOC(new_size)) == NULL) {
|
|---|
| 278 | DEBUG(0,("prs_grow: Malloc failure for size %u.\n", (unsigned int)new_size));
|
|---|
| 279 | return False;
|
|---|
| 280 | }
|
|---|
| 281 | memset(ps->data_p, '\0', (size_t)new_size );
|
|---|
| 282 | } else {
|
|---|
| 283 | /*
|
|---|
| 284 | * If the current buffer size is bigger than the space needed, just
|
|---|
| 285 | * double it, else add extra_space.
|
|---|
| 286 | */
|
|---|
| 287 | new_size = MAX(ps->buffer_size*2, ps->buffer_size + extra_space);
|
|---|
| 288 |
|
|---|
| 289 | if ((ps->data_p = (char *)SMB_REALLOC(ps->data_p, new_size)) == NULL) {
|
|---|
| 290 | DEBUG(0,("prs_grow: Realloc failure for size %u.\n",
|
|---|
| 291 | (unsigned int)new_size));
|
|---|
| 292 | return False;
|
|---|
| 293 | }
|
|---|
| 294 |
|
|---|
| 295 | memset(&ps->data_p[ps->buffer_size], '\0', (size_t)(new_size - ps->buffer_size));
|
|---|
| 296 | }
|
|---|
| 297 | ps->buffer_size = new_size;
|
|---|
| 298 |
|
|---|
| 299 | return True;
|
|---|
| 300 | }
|
|---|
| 301 |
|
|---|
| 302 | /*******************************************************************
|
|---|
| 303 | Attempt to force a data buffer to grow by len bytes.
|
|---|
| 304 | This is only used when appending more data onto a prs_struct
|
|---|
| 305 | when reading an rpc reply, before unmarshalling it.
|
|---|
| 306 | ********************************************************************/
|
|---|
| 307 |
|
|---|
| 308 | bool prs_force_grow(prs_struct *ps, uint32 extra_space)
|
|---|
| 309 | {
|
|---|
| 310 | uint32 new_size = ps->buffer_size + extra_space;
|
|---|
| 311 |
|
|---|
| 312 | if(!UNMARSHALLING(ps) || !ps->is_dynamic) {
|
|---|
| 313 | DEBUG(0,("prs_force_grow: Buffer overflow - unable to expand buffer by %u bytes.\n",
|
|---|
| 314 | (unsigned int)extra_space));
|
|---|
| 315 | return False;
|
|---|
| 316 | }
|
|---|
| 317 |
|
|---|
| 318 | if((ps->data_p = (char *)SMB_REALLOC(ps->data_p, new_size)) == NULL) {
|
|---|
| 319 | DEBUG(0,("prs_force_grow: Realloc failure for size %u.\n",
|
|---|
| 320 | (unsigned int)new_size));
|
|---|
| 321 | return False;
|
|---|
| 322 | }
|
|---|
| 323 |
|
|---|
| 324 | memset(&ps->data_p[ps->buffer_size], '\0', (size_t)(new_size - ps->buffer_size));
|
|---|
| 325 |
|
|---|
| 326 | ps->buffer_size = new_size;
|
|---|
| 327 |
|
|---|
| 328 | return True;
|
|---|
| 329 | }
|
|---|
| 330 |
|
|---|
| 331 | /*******************************************************************
|
|---|
| 332 | Get the data pointer (external interface).
|
|---|
| 333 | ********************************************************************/
|
|---|
| 334 |
|
|---|
| 335 | char *prs_data_p(prs_struct *ps)
|
|---|
| 336 | {
|
|---|
| 337 | return ps->data_p;
|
|---|
| 338 | }
|
|---|
| 339 |
|
|---|
| 340 | /*******************************************************************
|
|---|
| 341 | Get the current data size (external interface).
|
|---|
| 342 | ********************************************************************/
|
|---|
| 343 |
|
|---|
| 344 | uint32 prs_data_size(prs_struct *ps)
|
|---|
| 345 | {
|
|---|
| 346 | return ps->buffer_size;
|
|---|
| 347 | }
|
|---|
| 348 |
|
|---|
| 349 | /*******************************************************************
|
|---|
| 350 | Fetch the current offset (external interface).
|
|---|
| 351 | ********************************************************************/
|
|---|
| 352 |
|
|---|
| 353 | uint32 prs_offset(prs_struct *ps)
|
|---|
| 354 | {
|
|---|
| 355 | return ps->data_offset;
|
|---|
| 356 | }
|
|---|
| 357 |
|
|---|
| 358 | /*******************************************************************
|
|---|
| 359 | Set the current offset (external interface).
|
|---|
| 360 | ********************************************************************/
|
|---|
| 361 |
|
|---|
| 362 | bool prs_set_offset(prs_struct *ps, uint32 offset)
|
|---|
| 363 | {
|
|---|
| 364 | if(offset <= ps->data_offset) {
|
|---|
| 365 | ps->data_offset = offset;
|
|---|
| 366 | return True;
|
|---|
| 367 | }
|
|---|
| 368 |
|
|---|
| 369 | if(!prs_grow(ps, offset - ps->data_offset))
|
|---|
| 370 | return False;
|
|---|
| 371 |
|
|---|
| 372 | ps->data_offset = offset;
|
|---|
| 373 | return True;
|
|---|
| 374 | }
|
|---|
| 375 |
|
|---|
| 376 | /*******************************************************************
|
|---|
| 377 | Append the data from one parse_struct into another.
|
|---|
| 378 | ********************************************************************/
|
|---|
| 379 |
|
|---|
| 380 | bool prs_append_prs_data(prs_struct *dst, prs_struct *src)
|
|---|
| 381 | {
|
|---|
| 382 | if (prs_offset(src) == 0)
|
|---|
| 383 | return True;
|
|---|
| 384 |
|
|---|
| 385 | if(!prs_grow(dst, prs_offset(src)))
|
|---|
| 386 | return False;
|
|---|
| 387 |
|
|---|
| 388 | memcpy(&dst->data_p[dst->data_offset], src->data_p, (size_t)prs_offset(src));
|
|---|
| 389 | dst->data_offset += prs_offset(src);
|
|---|
| 390 |
|
|---|
| 391 | return True;
|
|---|
| 392 | }
|
|---|
| 393 |
|
|---|
| 394 | /*******************************************************************
|
|---|
| 395 | Append some data from one parse_struct into another.
|
|---|
| 396 | ********************************************************************/
|
|---|
| 397 |
|
|---|
| 398 | bool prs_append_some_prs_data(prs_struct *dst, prs_struct *src, int32 start, uint32 len)
|
|---|
| 399 | {
|
|---|
| 400 | if (len == 0)
|
|---|
| 401 | return True;
|
|---|
| 402 |
|
|---|
| 403 | if(!prs_grow(dst, len))
|
|---|
| 404 | return False;
|
|---|
| 405 |
|
|---|
| 406 | memcpy(&dst->data_p[dst->data_offset], src->data_p + start, (size_t)len);
|
|---|
| 407 | dst->data_offset += len;
|
|---|
| 408 |
|
|---|
| 409 | return True;
|
|---|
| 410 | }
|
|---|
| 411 |
|
|---|
| 412 | /*******************************************************************
|
|---|
| 413 | Append the data from a buffer into a parse_struct.
|
|---|
| 414 | ********************************************************************/
|
|---|
| 415 |
|
|---|
| 416 | bool prs_copy_data_in(prs_struct *dst, const char *src, uint32 len)
|
|---|
| 417 | {
|
|---|
| 418 | if (len == 0)
|
|---|
| 419 | return True;
|
|---|
| 420 |
|
|---|
| 421 | if(!prs_grow(dst, len))
|
|---|
| 422 | return False;
|
|---|
| 423 |
|
|---|
| 424 | memcpy(&dst->data_p[dst->data_offset], src, (size_t)len);
|
|---|
| 425 | dst->data_offset += len;
|
|---|
| 426 |
|
|---|
| 427 | return True;
|
|---|
| 428 | }
|
|---|
| 429 |
|
|---|
| 430 | /*******************************************************************
|
|---|
| 431 | Copy some data from a parse_struct into a buffer.
|
|---|
| 432 | ********************************************************************/
|
|---|
| 433 |
|
|---|
| 434 | bool prs_copy_data_out(char *dst, prs_struct *src, uint32 len)
|
|---|
| 435 | {
|
|---|
| 436 | if (len == 0)
|
|---|
| 437 | return True;
|
|---|
| 438 |
|
|---|
| 439 | if(!prs_mem_get(src, len))
|
|---|
| 440 | return False;
|
|---|
| 441 |
|
|---|
| 442 | memcpy(dst, &src->data_p[src->data_offset], (size_t)len);
|
|---|
| 443 | src->data_offset += len;
|
|---|
| 444 |
|
|---|
| 445 | return True;
|
|---|
| 446 | }
|
|---|
| 447 |
|
|---|
| 448 | /*******************************************************************
|
|---|
| 449 | Copy all the data from a parse_struct into a buffer.
|
|---|
| 450 | ********************************************************************/
|
|---|
| 451 |
|
|---|
| 452 | bool prs_copy_all_data_out(char *dst, prs_struct *src)
|
|---|
| 453 | {
|
|---|
| 454 | uint32 len = prs_offset(src);
|
|---|
| 455 |
|
|---|
| 456 | if (!len)
|
|---|
| 457 | return True;
|
|---|
| 458 |
|
|---|
| 459 | prs_set_offset(src, 0);
|
|---|
| 460 | return prs_copy_data_out(dst, src, len);
|
|---|
| 461 | }
|
|---|
| 462 |
|
|---|
| 463 | /*******************************************************************
|
|---|
| 464 | Set the data as X-endian (external interface).
|
|---|
| 465 | ********************************************************************/
|
|---|
| 466 |
|
|---|
| 467 | void prs_set_endian_data(prs_struct *ps, bool endian)
|
|---|
| 468 | {
|
|---|
| 469 | ps->bigendian_data = endian;
|
|---|
| 470 | }
|
|---|
| 471 |
|
|---|
| 472 | /*******************************************************************
|
|---|
| 473 | Align a the data_len to a multiple of align bytes - filling with
|
|---|
| 474 | zeros.
|
|---|
| 475 | ********************************************************************/
|
|---|
| 476 |
|
|---|
| 477 | bool prs_align(prs_struct *ps)
|
|---|
| 478 | {
|
|---|
| 479 | uint32 mod = ps->data_offset & (ps->align-1);
|
|---|
| 480 |
|
|---|
| 481 | if (ps->align != 0 && mod != 0) {
|
|---|
| 482 | uint32 extra_space = (ps->align - mod);
|
|---|
| 483 | if(!prs_grow(ps, extra_space))
|
|---|
| 484 | return False;
|
|---|
| 485 | memset(&ps->data_p[ps->data_offset], '\0', (size_t)extra_space);
|
|---|
| 486 | ps->data_offset += extra_space;
|
|---|
| 487 | }
|
|---|
| 488 |
|
|---|
| 489 | return True;
|
|---|
| 490 | }
|
|---|
| 491 |
|
|---|
| 492 | /******************************************************************
|
|---|
| 493 | Align on a 2 byte boundary
|
|---|
| 494 | *****************************************************************/
|
|---|
| 495 |
|
|---|
| 496 | bool prs_align_uint16(prs_struct *ps)
|
|---|
| 497 | {
|
|---|
| 498 | bool ret;
|
|---|
| 499 | uint8 old_align = ps->align;
|
|---|
| 500 |
|
|---|
| 501 | ps->align = 2;
|
|---|
| 502 | ret = prs_align(ps);
|
|---|
| 503 | ps->align = old_align;
|
|---|
| 504 |
|
|---|
| 505 | return ret;
|
|---|
| 506 | }
|
|---|
| 507 |
|
|---|
| 508 | /******************************************************************
|
|---|
| 509 | Align on a 8 byte boundary
|
|---|
| 510 | *****************************************************************/
|
|---|
| 511 |
|
|---|
| 512 | bool prs_align_uint64(prs_struct *ps)
|
|---|
| 513 | {
|
|---|
| 514 | bool ret;
|
|---|
| 515 | uint8 old_align = ps->align;
|
|---|
| 516 |
|
|---|
| 517 | ps->align = 8;
|
|---|
| 518 | ret = prs_align(ps);
|
|---|
| 519 | ps->align = old_align;
|
|---|
| 520 |
|
|---|
| 521 | return ret;
|
|---|
| 522 | }
|
|---|
| 523 |
|
|---|
| 524 | /******************************************************************
|
|---|
| 525 | Align on a specific byte boundary
|
|---|
| 526 | *****************************************************************/
|
|---|
| 527 |
|
|---|
| 528 | bool prs_align_custom(prs_struct *ps, uint8 boundary)
|
|---|
| 529 | {
|
|---|
| 530 | bool ret;
|
|---|
| 531 | uint8 old_align = ps->align;
|
|---|
| 532 |
|
|---|
| 533 | ps->align = boundary;
|
|---|
| 534 | ret = prs_align(ps);
|
|---|
| 535 | ps->align = old_align;
|
|---|
| 536 |
|
|---|
| 537 | return ret;
|
|---|
| 538 | }
|
|---|
| 539 |
|
|---|
| 540 |
|
|---|
| 541 |
|
|---|
| 542 | /*******************************************************************
|
|---|
| 543 | Align only if required (for the unistr2 string mainly)
|
|---|
| 544 | ********************************************************************/
|
|---|
| 545 |
|
|---|
| 546 | bool prs_align_needed(prs_struct *ps, uint32 needed)
|
|---|
| 547 | {
|
|---|
| 548 | if (needed==0)
|
|---|
| 549 | return True;
|
|---|
| 550 | else
|
|---|
| 551 | return prs_align(ps);
|
|---|
| 552 | }
|
|---|
| 553 |
|
|---|
| 554 | /*******************************************************************
|
|---|
| 555 | Ensure we can read/write to a given offset.
|
|---|
| 556 | ********************************************************************/
|
|---|
| 557 |
|
|---|
| 558 | char *prs_mem_get(prs_struct *ps, uint32 extra_size)
|
|---|
| 559 | {
|
|---|
| 560 | if(UNMARSHALLING(ps)) {
|
|---|
| 561 | /*
|
|---|
| 562 | * If reading, ensure that we can read the requested size item.
|
|---|
| 563 | */
|
|---|
| 564 | if (ps->data_offset + extra_size > ps->buffer_size) {
|
|---|
| 565 | DEBUG(0,("prs_mem_get: reading data of size %u would overrun "
|
|---|
| 566 | "buffer by %u bytes.\n",
|
|---|
| 567 | (unsigned int)extra_size,
|
|---|
| 568 | (unsigned int)(ps->data_offset + extra_size - ps->buffer_size) ));
|
|---|
| 569 | return NULL;
|
|---|
| 570 | }
|
|---|
| 571 | } else {
|
|---|
| 572 | /*
|
|---|
| 573 | * Writing - grow the buffer if needed.
|
|---|
| 574 | */
|
|---|
| 575 | if(!prs_grow(ps, extra_size))
|
|---|
| 576 | return NULL;
|
|---|
| 577 | }
|
|---|
| 578 | return &ps->data_p[ps->data_offset];
|
|---|
| 579 | }
|
|---|
| 580 |
|
|---|
| 581 | /*******************************************************************
|
|---|
| 582 | Change the struct type.
|
|---|
| 583 | ********************************************************************/
|
|---|
| 584 |
|
|---|
| 585 | void prs_switch_type(prs_struct *ps, bool io)
|
|---|
| 586 | {
|
|---|
| 587 | if ((ps->io ^ io) == True)
|
|---|
| 588 | ps->io=io;
|
|---|
| 589 | }
|
|---|
| 590 |
|
|---|
| 591 | /*******************************************************************
|
|---|
| 592 | Force a prs_struct to be dynamic even when it's size is 0.
|
|---|
| 593 | ********************************************************************/
|
|---|
| 594 |
|
|---|
| 595 | void prs_force_dynamic(prs_struct *ps)
|
|---|
| 596 | {
|
|---|
| 597 | ps->is_dynamic=True;
|
|---|
| 598 | }
|
|---|
| 599 |
|
|---|
| 600 | /*******************************************************************
|
|---|
| 601 | Associate a session key with a parse struct.
|
|---|
| 602 | ********************************************************************/
|
|---|
| 603 |
|
|---|
| 604 | void prs_set_session_key(prs_struct *ps, const char sess_key[16])
|
|---|
| 605 | {
|
|---|
| 606 | ps->sess_key = sess_key;
|
|---|
| 607 | }
|
|---|
| 608 |
|
|---|
| 609 | /*******************************************************************
|
|---|
| 610 | Stream a uint8.
|
|---|
| 611 | ********************************************************************/
|
|---|
| 612 |
|
|---|
| 613 | bool prs_uint8(const char *name, prs_struct *ps, int depth, uint8 *data8)
|
|---|
| 614 | {
|
|---|
| 615 | char *q = prs_mem_get(ps, 1);
|
|---|
| 616 | if (q == NULL)
|
|---|
| 617 | return False;
|
|---|
| 618 |
|
|---|
| 619 | if (UNMARSHALLING(ps))
|
|---|
| 620 | *data8 = CVAL(q,0);
|
|---|
| 621 | else
|
|---|
| 622 | SCVAL(q,0,*data8);
|
|---|
| 623 |
|
|---|
| 624 | DEBUG(5,("%s%04x %s: %02x\n", tab_depth(5,depth), ps->data_offset, name, *data8));
|
|---|
| 625 |
|
|---|
| 626 | ps->data_offset += 1;
|
|---|
| 627 |
|
|---|
| 628 | return True;
|
|---|
| 629 | }
|
|---|
| 630 |
|
|---|
| 631 | /*******************************************************************
|
|---|
| 632 | Stream a uint16* (allocate memory if unmarshalling)
|
|---|
| 633 | ********************************************************************/
|
|---|
| 634 |
|
|---|
| 635 | bool prs_pointer( const char *name, prs_struct *ps, int depth,
|
|---|
| 636 | void *dta, size_t data_size,
|
|---|
| 637 | bool (*prs_fn)(const char*, prs_struct*, int, void*) )
|
|---|
| 638 | {
|
|---|
| 639 | void ** data = (void **)dta;
|
|---|
| 640 | uint32 data_p;
|
|---|
| 641 |
|
|---|
| 642 | /* output f000baaa to stream if the pointer is non-zero. */
|
|---|
| 643 |
|
|---|
| 644 | data_p = *data ? 0xf000baaa : 0;
|
|---|
| 645 |
|
|---|
| 646 | if ( !prs_uint32("ptr", ps, depth, &data_p ))
|
|---|
| 647 | return False;
|
|---|
| 648 |
|
|---|
| 649 | /* we're done if there is no data */
|
|---|
| 650 |
|
|---|
| 651 | if ( !data_p )
|
|---|
| 652 | return True;
|
|---|
| 653 |
|
|---|
| 654 | if (UNMARSHALLING(ps)) {
|
|---|
| 655 | if (data_size) {
|
|---|
| 656 | if ( !(*data = PRS_ALLOC_MEM(ps, char, data_size)) )
|
|---|
| 657 | return False;
|
|---|
| 658 | } else {
|
|---|
| 659 | *data = NULL;
|
|---|
| 660 | }
|
|---|
| 661 | }
|
|---|
| 662 |
|
|---|
| 663 | return prs_fn(name, ps, depth, *data);
|
|---|
| 664 | }
|
|---|
| 665 |
|
|---|
| 666 |
|
|---|
| 667 | /*******************************************************************
|
|---|
| 668 | Stream a uint16.
|
|---|
| 669 | ********************************************************************/
|
|---|
| 670 |
|
|---|
| 671 | bool prs_uint16(const char *name, prs_struct *ps, int depth, uint16 *data16)
|
|---|
| 672 | {
|
|---|
| 673 | char *q = prs_mem_get(ps, sizeof(uint16));
|
|---|
| 674 | if (q == NULL)
|
|---|
| 675 | return False;
|
|---|
| 676 |
|
|---|
| 677 | if (UNMARSHALLING(ps)) {
|
|---|
| 678 | if (ps->bigendian_data)
|
|---|
| 679 | *data16 = RSVAL(q,0);
|
|---|
| 680 | else
|
|---|
| 681 | *data16 = SVAL(q,0);
|
|---|
| 682 | } else {
|
|---|
| 683 | if (ps->bigendian_data)
|
|---|
| 684 | RSSVAL(q,0,*data16);
|
|---|
| 685 | else
|
|---|
| 686 | SSVAL(q,0,*data16);
|
|---|
| 687 | }
|
|---|
| 688 |
|
|---|
| 689 | DEBUG(5,("%s%04x %s: %04x\n", tab_depth(5,depth), ps->data_offset, name, *data16));
|
|---|
| 690 |
|
|---|
| 691 | ps->data_offset += sizeof(uint16);
|
|---|
| 692 |
|
|---|
| 693 | return True;
|
|---|
| 694 | }
|
|---|
| 695 |
|
|---|
| 696 | /*******************************************************************
|
|---|
| 697 | Stream a uint32.
|
|---|
| 698 | ********************************************************************/
|
|---|
| 699 |
|
|---|
| 700 | bool prs_uint32(const char *name, prs_struct *ps, int depth, uint32 *data32)
|
|---|
| 701 | {
|
|---|
| 702 | char *q = prs_mem_get(ps, sizeof(uint32));
|
|---|
| 703 | if (q == NULL)
|
|---|
| 704 | return False;
|
|---|
| 705 |
|
|---|
| 706 | if (UNMARSHALLING(ps)) {
|
|---|
| 707 | if (ps->bigendian_data)
|
|---|
| 708 | *data32 = RIVAL(q,0);
|
|---|
| 709 | else
|
|---|
| 710 | *data32 = IVAL(q,0);
|
|---|
| 711 | } else {
|
|---|
| 712 | if (ps->bigendian_data)
|
|---|
| 713 | RSIVAL(q,0,*data32);
|
|---|
| 714 | else
|
|---|
| 715 | SIVAL(q,0,*data32);
|
|---|
| 716 | }
|
|---|
| 717 |
|
|---|
| 718 | DEBUG(5,("%s%04x %s: %08x\n", tab_depth(5,depth), ps->data_offset, name, *data32));
|
|---|
| 719 |
|
|---|
| 720 | ps->data_offset += sizeof(uint32);
|
|---|
| 721 |
|
|---|
| 722 | return True;
|
|---|
| 723 | }
|
|---|
| 724 |
|
|---|
| 725 | /*******************************************************************
|
|---|
| 726 | Stream an int32.
|
|---|
| 727 | ********************************************************************/
|
|---|
| 728 |
|
|---|
| 729 | bool prs_int32(const char *name, prs_struct *ps, int depth, int32 *data32)
|
|---|
| 730 | {
|
|---|
| 731 | char *q = prs_mem_get(ps, sizeof(int32));
|
|---|
| 732 | if (q == NULL)
|
|---|
| 733 | return False;
|
|---|
| 734 |
|
|---|
| 735 | if (UNMARSHALLING(ps)) {
|
|---|
| 736 | if (ps->bigendian_data)
|
|---|
| 737 | *data32 = RIVALS(q,0);
|
|---|
| 738 | else
|
|---|
| 739 | *data32 = IVALS(q,0);
|
|---|
| 740 | } else {
|
|---|
| 741 | if (ps->bigendian_data)
|
|---|
| 742 | RSIVALS(q,0,*data32);
|
|---|
| 743 | else
|
|---|
| 744 | SIVALS(q,0,*data32);
|
|---|
| 745 | }
|
|---|
| 746 |
|
|---|
| 747 | DEBUG(5,("%s%04x %s: %08x\n", tab_depth(5,depth), ps->data_offset, name, *data32));
|
|---|
| 748 |
|
|---|
| 749 | ps->data_offset += sizeof(int32);
|
|---|
| 750 |
|
|---|
| 751 | return True;
|
|---|
| 752 | }
|
|---|
| 753 |
|
|---|
| 754 | /*******************************************************************
|
|---|
| 755 | Stream a NTSTATUS
|
|---|
| 756 | ********************************************************************/
|
|---|
| 757 |
|
|---|
| 758 | bool prs_ntstatus(const char *name, prs_struct *ps, int depth, NTSTATUS *status)
|
|---|
| 759 | {
|
|---|
| 760 | char *q = prs_mem_get(ps, sizeof(uint32));
|
|---|
| 761 | if (q == NULL)
|
|---|
| 762 | return False;
|
|---|
| 763 |
|
|---|
| 764 | if (UNMARSHALLING(ps)) {
|
|---|
| 765 | if (ps->bigendian_data)
|
|---|
| 766 | *status = NT_STATUS(RIVAL(q,0));
|
|---|
| 767 | else
|
|---|
| 768 | *status = NT_STATUS(IVAL(q,0));
|
|---|
| 769 | } else {
|
|---|
| 770 | if (ps->bigendian_data)
|
|---|
| 771 | RSIVAL(q,0,NT_STATUS_V(*status));
|
|---|
| 772 | else
|
|---|
| 773 | SIVAL(q,0,NT_STATUS_V(*status));
|
|---|
| 774 | }
|
|---|
| 775 |
|
|---|
| 776 | DEBUG(5,("%s%04x %s: %s\n", tab_depth(5,depth), ps->data_offset, name,
|
|---|
| 777 | nt_errstr(*status)));
|
|---|
| 778 |
|
|---|
| 779 | ps->data_offset += sizeof(uint32);
|
|---|
| 780 |
|
|---|
| 781 | return True;
|
|---|
| 782 | }
|
|---|
| 783 |
|
|---|
| 784 | /*******************************************************************
|
|---|
| 785 | Stream a DCE error code
|
|---|
| 786 | ********************************************************************/
|
|---|
| 787 |
|
|---|
| 788 | bool prs_dcerpc_status(const char *name, prs_struct *ps, int depth, NTSTATUS *status)
|
|---|
| 789 | {
|
|---|
| 790 | char *q = prs_mem_get(ps, sizeof(uint32));
|
|---|
| 791 | if (q == NULL)
|
|---|
| 792 | return False;
|
|---|
| 793 |
|
|---|
| 794 | if (UNMARSHALLING(ps)) {
|
|---|
| 795 | if (ps->bigendian_data)
|
|---|
| 796 | *status = NT_STATUS(RIVAL(q,0));
|
|---|
| 797 | else
|
|---|
| 798 | *status = NT_STATUS(IVAL(q,0));
|
|---|
| 799 | } else {
|
|---|
| 800 | if (ps->bigendian_data)
|
|---|
| 801 | RSIVAL(q,0,NT_STATUS_V(*status));
|
|---|
| 802 | else
|
|---|
| 803 | SIVAL(q,0,NT_STATUS_V(*status));
|
|---|
| 804 | }
|
|---|
| 805 |
|
|---|
| 806 | DEBUG(5,("%s%04x %s: %s\n", tab_depth(5,depth), ps->data_offset, name,
|
|---|
| 807 | dcerpc_errstr(NT_STATUS_V(*status))));
|
|---|
| 808 |
|
|---|
| 809 | ps->data_offset += sizeof(uint32);
|
|---|
| 810 |
|
|---|
| 811 | return True;
|
|---|
| 812 | }
|
|---|
| 813 |
|
|---|
| 814 |
|
|---|
| 815 | /*******************************************************************
|
|---|
| 816 | Stream a WERROR
|
|---|
| 817 | ********************************************************************/
|
|---|
| 818 |
|
|---|
| 819 | bool prs_werror(const char *name, prs_struct *ps, int depth, WERROR *status)
|
|---|
| 820 | {
|
|---|
| 821 | char *q = prs_mem_get(ps, sizeof(uint32));
|
|---|
| 822 | if (q == NULL)
|
|---|
| 823 | return False;
|
|---|
| 824 |
|
|---|
| 825 | if (UNMARSHALLING(ps)) {
|
|---|
| 826 | if (ps->bigendian_data)
|
|---|
| 827 | *status = W_ERROR(RIVAL(q,0));
|
|---|
| 828 | else
|
|---|
| 829 | *status = W_ERROR(IVAL(q,0));
|
|---|
| 830 | } else {
|
|---|
| 831 | if (ps->bigendian_data)
|
|---|
| 832 | RSIVAL(q,0,W_ERROR_V(*status));
|
|---|
| 833 | else
|
|---|
| 834 | SIVAL(q,0,W_ERROR_V(*status));
|
|---|
| 835 | }
|
|---|
| 836 |
|
|---|
| 837 | DEBUG(5,("%s%04x %s: %s\n", tab_depth(5,depth), ps->data_offset, name,
|
|---|
| 838 | dos_errstr(*status)));
|
|---|
| 839 |
|
|---|
| 840 | ps->data_offset += sizeof(uint32);
|
|---|
| 841 |
|
|---|
| 842 | return True;
|
|---|
| 843 | }
|
|---|
| 844 |
|
|---|
| 845 |
|
|---|
| 846 | /******************************************************************
|
|---|
| 847 | Stream an array of uint8s. Length is number of uint8s.
|
|---|
| 848 | ********************************************************************/
|
|---|
| 849 |
|
|---|
| 850 | bool prs_uint8s(bool charmode, const char *name, prs_struct *ps, int depth, uint8 *data8s, int len)
|
|---|
| 851 | {
|
|---|
| 852 | int i;
|
|---|
| 853 | char *q = prs_mem_get(ps, len);
|
|---|
| 854 | if (q == NULL)
|
|---|
| 855 | return False;
|
|---|
| 856 |
|
|---|
| 857 | if (UNMARSHALLING(ps)) {
|
|---|
| 858 | for (i = 0; i < len; i++)
|
|---|
| 859 | data8s[i] = CVAL(q,i);
|
|---|
| 860 | } else {
|
|---|
| 861 | for (i = 0; i < len; i++)
|
|---|
| 862 | SCVAL(q, i, data8s[i]);
|
|---|
| 863 | }
|
|---|
| 864 |
|
|---|
| 865 | DEBUG(5,("%s%04x %s: ", tab_depth(5,depth), ps->data_offset ,name));
|
|---|
| 866 | if (charmode)
|
|---|
| 867 | print_asc(5, (unsigned char*)data8s, len);
|
|---|
| 868 | else {
|
|---|
| 869 | for (i = 0; i < len; i++)
|
|---|
| 870 | DEBUG(5,("%02x ", data8s[i]));
|
|---|
| 871 | }
|
|---|
| 872 | DEBUG(5,("\n"));
|
|---|
| 873 |
|
|---|
| 874 | ps->data_offset += len;
|
|---|
| 875 |
|
|---|
| 876 | return True;
|
|---|
| 877 | }
|
|---|
| 878 |
|
|---|
| 879 | /******************************************************************
|
|---|
| 880 | Stream an array of uint16s. Length is number of uint16s.
|
|---|
| 881 | ********************************************************************/
|
|---|
| 882 |
|
|---|
| 883 | bool prs_uint16s(bool charmode, const char *name, prs_struct *ps, int depth, uint16 *data16s, int len)
|
|---|
| 884 | {
|
|---|
| 885 | int i;
|
|---|
| 886 | char *q = prs_mem_get(ps, len * sizeof(uint16));
|
|---|
| 887 | if (q == NULL)
|
|---|
| 888 | return False;
|
|---|
| 889 |
|
|---|
| 890 | if (UNMARSHALLING(ps)) {
|
|---|
| 891 | if (ps->bigendian_data) {
|
|---|
| 892 | for (i = 0; i < len; i++)
|
|---|
| 893 | data16s[i] = RSVAL(q, 2*i);
|
|---|
| 894 | } else {
|
|---|
| 895 | for (i = 0; i < len; i++)
|
|---|
| 896 | data16s[i] = SVAL(q, 2*i);
|
|---|
| 897 | }
|
|---|
| 898 | } else {
|
|---|
| 899 | if (ps->bigendian_data) {
|
|---|
| 900 | for (i = 0; i < len; i++)
|
|---|
| 901 | RSSVAL(q, 2*i, data16s[i]);
|
|---|
| 902 | } else {
|
|---|
| 903 | for (i = 0; i < len; i++)
|
|---|
| 904 | SSVAL(q, 2*i, data16s[i]);
|
|---|
| 905 | }
|
|---|
| 906 | }
|
|---|
| 907 |
|
|---|
| 908 | DEBUG(5,("%s%04x %s: ", tab_depth(5,depth), ps->data_offset, name));
|
|---|
| 909 | if (charmode)
|
|---|
| 910 | print_asc(5, (unsigned char*)data16s, 2*len);
|
|---|
| 911 | else {
|
|---|
| 912 | for (i = 0; i < len; i++)
|
|---|
| 913 | DEBUG(5,("%04x ", data16s[i]));
|
|---|
| 914 | }
|
|---|
| 915 | DEBUG(5,("\n"));
|
|---|
| 916 |
|
|---|
| 917 | ps->data_offset += (len * sizeof(uint16));
|
|---|
| 918 |
|
|---|
| 919 | return True;
|
|---|
| 920 | }
|
|---|
| 921 |
|
|---|
| 922 | /******************************************************************
|
|---|
| 923 | Start using a function for streaming unicode chars. If unmarshalling,
|
|---|
| 924 | output must be little-endian, if marshalling, input must be little-endian.
|
|---|
| 925 | ********************************************************************/
|
|---|
| 926 |
|
|---|
| 927 | static void dbg_rw_punival(bool charmode, const char *name, int depth, prs_struct *ps,
|
|---|
| 928 | char *in_buf, char *out_buf, int len)
|
|---|
| 929 | {
|
|---|
| 930 | int i;
|
|---|
| 931 |
|
|---|
| 932 | if (UNMARSHALLING(ps)) {
|
|---|
| 933 | if (ps->bigendian_data) {
|
|---|
| 934 | for (i = 0; i < len; i++)
|
|---|
| 935 | SSVAL(out_buf,2*i,RSVAL(in_buf, 2*i));
|
|---|
| 936 | } else {
|
|---|
| 937 | for (i = 0; i < len; i++)
|
|---|
| 938 | SSVAL(out_buf, 2*i, SVAL(in_buf, 2*i));
|
|---|
| 939 | }
|
|---|
| 940 | } else {
|
|---|
| 941 | if (ps->bigendian_data) {
|
|---|
| 942 | for (i = 0; i < len; i++)
|
|---|
| 943 | RSSVAL(in_buf, 2*i, SVAL(out_buf,2*i));
|
|---|
| 944 | } else {
|
|---|
| 945 | for (i = 0; i < len; i++)
|
|---|
| 946 | SSVAL(in_buf, 2*i, SVAL(out_buf,2*i));
|
|---|
| 947 | }
|
|---|
| 948 | }
|
|---|
| 949 |
|
|---|
| 950 | DEBUG(5,("%s%04x %s: ", tab_depth(5,depth), ps->data_offset, name));
|
|---|
| 951 | if (charmode)
|
|---|
| 952 | print_asc(5, (unsigned char*)out_buf, 2*len);
|
|---|
| 953 | else {
|
|---|
| 954 | for (i = 0; i < len; i++)
|
|---|
| 955 | DEBUG(5,("%04x ", out_buf[i]));
|
|---|
| 956 | }
|
|---|
| 957 | DEBUG(5,("\n"));
|
|---|
| 958 | }
|
|---|
| 959 |
|
|---|
| 960 | /******************************************************************
|
|---|
| 961 | Stream a unistr. Always little endian.
|
|---|
| 962 | ********************************************************************/
|
|---|
| 963 |
|
|---|
| 964 | bool prs_uint16uni(bool charmode, const char *name, prs_struct *ps, int depth, uint16 *data16s, int len)
|
|---|
| 965 | {
|
|---|
| 966 | char *q = prs_mem_get(ps, len * sizeof(uint16));
|
|---|
| 967 | if (q == NULL)
|
|---|
| 968 | return False;
|
|---|
| 969 |
|
|---|
| 970 | dbg_rw_punival(charmode, name, depth, ps, q, (char *)data16s, len);
|
|---|
| 971 | ps->data_offset += (len * sizeof(uint16));
|
|---|
| 972 |
|
|---|
| 973 | return True;
|
|---|
| 974 | }
|
|---|
| 975 |
|
|---|
| 976 | /******************************************************************
|
|---|
| 977 | Stream an array of uint32s. Length is number of uint32s.
|
|---|
| 978 | ********************************************************************/
|
|---|
| 979 |
|
|---|
| 980 | bool prs_uint32s(bool charmode, const char *name, prs_struct *ps, int depth, uint32 *data32s, int len)
|
|---|
| 981 | {
|
|---|
| 982 | int i;
|
|---|
| 983 | char *q = prs_mem_get(ps, len * sizeof(uint32));
|
|---|
| 984 | if (q == NULL)
|
|---|
| 985 | return False;
|
|---|
| 986 |
|
|---|
| 987 | if (UNMARSHALLING(ps)) {
|
|---|
| 988 | if (ps->bigendian_data) {
|
|---|
| 989 | for (i = 0; i < len; i++)
|
|---|
| 990 | data32s[i] = RIVAL(q, 4*i);
|
|---|
| 991 | } else {
|
|---|
| 992 | for (i = 0; i < len; i++)
|
|---|
| 993 | data32s[i] = IVAL(q, 4*i);
|
|---|
| 994 | }
|
|---|
| 995 | } else {
|
|---|
| 996 | if (ps->bigendian_data) {
|
|---|
| 997 | for (i = 0; i < len; i++)
|
|---|
| 998 | RSIVAL(q, 4*i, data32s[i]);
|
|---|
| 999 | } else {
|
|---|
| 1000 | for (i = 0; i < len; i++)
|
|---|
| 1001 | SIVAL(q, 4*i, data32s[i]);
|
|---|
| 1002 | }
|
|---|
| 1003 | }
|
|---|
| 1004 |
|
|---|
| 1005 | DEBUG(5,("%s%04x %s: ", tab_depth(5,depth), ps->data_offset, name));
|
|---|
| 1006 | if (charmode)
|
|---|
| 1007 | print_asc(5, (unsigned char*)data32s, 4*len);
|
|---|
| 1008 | else {
|
|---|
| 1009 | for (i = 0; i < len; i++)
|
|---|
| 1010 | DEBUG(5,("%08x ", data32s[i]));
|
|---|
| 1011 | }
|
|---|
| 1012 | DEBUG(5,("\n"));
|
|---|
| 1013 |
|
|---|
| 1014 | ps->data_offset += (len * sizeof(uint32));
|
|---|
| 1015 |
|
|---|
| 1016 | return True;
|
|---|
| 1017 | }
|
|---|
| 1018 |
|
|---|
| 1019 | /******************************************************************
|
|---|
| 1020 | Stream an array of unicode string, length/buffer specified separately,
|
|---|
| 1021 | in uint16 chars. The unicode string is already in little-endian format.
|
|---|
| 1022 | ********************************************************************/
|
|---|
| 1023 |
|
|---|
| 1024 | bool prs_buffer5(bool charmode, const char *name, prs_struct *ps, int depth, BUFFER5 *str)
|
|---|
| 1025 | {
|
|---|
| 1026 | char *p;
|
|---|
| 1027 | char *q = prs_mem_get(ps, str->buf_len * sizeof(uint16));
|
|---|
| 1028 | if (q == NULL)
|
|---|
| 1029 | return False;
|
|---|
| 1030 |
|
|---|
| 1031 | /* If the string is empty, we don't have anything to stream */
|
|---|
| 1032 | if (str->buf_len==0)
|
|---|
| 1033 | return True;
|
|---|
| 1034 |
|
|---|
| 1035 | if (UNMARSHALLING(ps)) {
|
|---|
| 1036 | str->buffer = PRS_ALLOC_MEM(ps,uint16,str->buf_len);
|
|---|
| 1037 | if (str->buffer == NULL)
|
|---|
| 1038 | return False;
|
|---|
| 1039 | }
|
|---|
| 1040 |
|
|---|
| 1041 | p = (char *)str->buffer;
|
|---|
| 1042 |
|
|---|
| 1043 | dbg_rw_punival(charmode, name, depth, ps, q, p, str->buf_len);
|
|---|
| 1044 |
|
|---|
| 1045 | ps->data_offset += (str->buf_len * sizeof(uint16));
|
|---|
| 1046 |
|
|---|
| 1047 | return True;
|
|---|
| 1048 | }
|
|---|
| 1049 |
|
|---|
| 1050 | /******************************************************************
|
|---|
| 1051 | Stream a "not" unicode string, length/buffer specified separately,
|
|---|
| 1052 | in byte chars. String is in little-endian format.
|
|---|
| 1053 | ********************************************************************/
|
|---|
| 1054 |
|
|---|
| 1055 | bool prs_regval_buffer(bool charmode, const char *name, prs_struct *ps, int depth, REGVAL_BUFFER *buf)
|
|---|
| 1056 | {
|
|---|
| 1057 | char *p;
|
|---|
| 1058 | char *q = prs_mem_get(ps, buf->buf_len);
|
|---|
| 1059 | if (q == NULL)
|
|---|
| 1060 | return False;
|
|---|
| 1061 |
|
|---|
| 1062 | if (UNMARSHALLING(ps)) {
|
|---|
| 1063 | if (buf->buf_len > buf->buf_max_len) {
|
|---|
| 1064 | return False;
|
|---|
| 1065 | }
|
|---|
| 1066 | if ( buf->buf_max_len ) {
|
|---|
| 1067 | buf->buffer = PRS_ALLOC_MEM(ps, uint16, buf->buf_max_len);
|
|---|
| 1068 | if ( buf->buffer == NULL )
|
|---|
| 1069 | return False;
|
|---|
| 1070 | } else {
|
|---|
| 1071 | buf->buffer = NULL;
|
|---|
| 1072 | }
|
|---|
| 1073 | }
|
|---|
| 1074 |
|
|---|
| 1075 | p = (char *)buf->buffer;
|
|---|
| 1076 |
|
|---|
| 1077 | dbg_rw_punival(charmode, name, depth, ps, q, p, buf->buf_len/2);
|
|---|
| 1078 | ps->data_offset += buf->buf_len;
|
|---|
| 1079 |
|
|---|
| 1080 | return True;
|
|---|
| 1081 | }
|
|---|
| 1082 |
|
|---|
| 1083 | /******************************************************************
|
|---|
| 1084 | Stream a string, length/buffer specified separately,
|
|---|
| 1085 | in uint8 chars.
|
|---|
| 1086 | ********************************************************************/
|
|---|
| 1087 |
|
|---|
| 1088 | bool prs_string2(bool charmode, const char *name, prs_struct *ps, int depth, STRING2 *str)
|
|---|
| 1089 | {
|
|---|
| 1090 | unsigned int i;
|
|---|
| 1091 | char *q = prs_mem_get(ps, str->str_str_len);
|
|---|
| 1092 | if (q == NULL)
|
|---|
| 1093 | return False;
|
|---|
| 1094 |
|
|---|
| 1095 | if (UNMARSHALLING(ps)) {
|
|---|
| 1096 | if (str->str_str_len > str->str_max_len) {
|
|---|
| 1097 | return False;
|
|---|
| 1098 | }
|
|---|
| 1099 | if (str->str_max_len) {
|
|---|
| 1100 | str->buffer = PRS_ALLOC_MEM(ps,unsigned char, str->str_max_len);
|
|---|
| 1101 | if (str->buffer == NULL)
|
|---|
| 1102 | return False;
|
|---|
| 1103 | } else {
|
|---|
| 1104 | str->buffer = NULL;
|
|---|
| 1105 | /* Return early to ensure Coverity isn't confused. */
|
|---|
| 1106 | DEBUG(5,("%s%04x %s: \n", tab_depth(5,depth), ps->data_offset, name));
|
|---|
| 1107 | return True;
|
|---|
| 1108 | }
|
|---|
| 1109 | }
|
|---|
| 1110 |
|
|---|
| 1111 | if (UNMARSHALLING(ps)) {
|
|---|
| 1112 | for (i = 0; i < str->str_str_len; i++)
|
|---|
| 1113 | str->buffer[i] = CVAL(q,i);
|
|---|
| 1114 | } else {
|
|---|
| 1115 | for (i = 0; i < str->str_str_len; i++)
|
|---|
| 1116 | SCVAL(q, i, str->buffer[i]);
|
|---|
| 1117 | }
|
|---|
| 1118 |
|
|---|
| 1119 | DEBUG(5,("%s%04x %s: ", tab_depth(5,depth), ps->data_offset, name));
|
|---|
| 1120 | if (charmode)
|
|---|
| 1121 | print_asc(5, (unsigned char*)str->buffer, str->str_str_len);
|
|---|
| 1122 | else {
|
|---|
| 1123 | for (i = 0; i < str->str_str_len; i++)
|
|---|
| 1124 | DEBUG(5,("%02x ", str->buffer[i]));
|
|---|
| 1125 | }
|
|---|
| 1126 | DEBUG(5,("\n"));
|
|---|
| 1127 |
|
|---|
| 1128 | ps->data_offset += str->str_str_len;
|
|---|
| 1129 |
|
|---|
| 1130 | return True;
|
|---|
| 1131 | }
|
|---|
| 1132 |
|
|---|
| 1133 | /******************************************************************
|
|---|
| 1134 | Stream a unicode string, length/buffer specified separately,
|
|---|
| 1135 | in uint16 chars. The unicode string is already in little-endian format.
|
|---|
| 1136 | ********************************************************************/
|
|---|
| 1137 |
|
|---|
| 1138 | bool prs_unistr2(bool charmode, const char *name, prs_struct *ps, int depth, UNISTR2 *str)
|
|---|
| 1139 | {
|
|---|
| 1140 | char *p;
|
|---|
| 1141 | char *q = prs_mem_get(ps, str->uni_str_len * sizeof(uint16));
|
|---|
| 1142 | if (q == NULL)
|
|---|
| 1143 | return False;
|
|---|
| 1144 |
|
|---|
| 1145 | /* If the string is empty, we don't have anything to stream */
|
|---|
| 1146 | if (str->uni_str_len==0)
|
|---|
| 1147 | return True;
|
|---|
| 1148 |
|
|---|
| 1149 | if (UNMARSHALLING(ps)) {
|
|---|
| 1150 | if (str->uni_str_len > str->uni_max_len) {
|
|---|
| 1151 | return False;
|
|---|
| 1152 | }
|
|---|
| 1153 | if (str->uni_max_len) {
|
|---|
| 1154 | str->buffer = PRS_ALLOC_MEM(ps,uint16,str->uni_max_len);
|
|---|
| 1155 | if (str->buffer == NULL)
|
|---|
| 1156 | return False;
|
|---|
| 1157 | } else {
|
|---|
| 1158 | str->buffer = NULL;
|
|---|
| 1159 | }
|
|---|
| 1160 | }
|
|---|
| 1161 |
|
|---|
| 1162 | p = (char *)str->buffer;
|
|---|
| 1163 |
|
|---|
| 1164 | dbg_rw_punival(charmode, name, depth, ps, q, p, str->uni_str_len);
|
|---|
| 1165 |
|
|---|
| 1166 | ps->data_offset += (str->uni_str_len * sizeof(uint16));
|
|---|
| 1167 |
|
|---|
| 1168 | return True;
|
|---|
| 1169 | }
|
|---|
| 1170 |
|
|---|
| 1171 | /******************************************************************
|
|---|
| 1172 | Stream a unicode string, length/buffer specified separately,
|
|---|
| 1173 | in uint16 chars. The unicode string is already in little-endian format.
|
|---|
| 1174 | ********************************************************************/
|
|---|
| 1175 |
|
|---|
| 1176 | bool prs_unistr3(bool charmode, const char *name, UNISTR3 *str, prs_struct *ps, int depth)
|
|---|
| 1177 | {
|
|---|
| 1178 | char *p;
|
|---|
| 1179 | char *q = prs_mem_get(ps, str->uni_str_len * sizeof(uint16));
|
|---|
| 1180 | if (q == NULL)
|
|---|
| 1181 | return False;
|
|---|
| 1182 |
|
|---|
| 1183 | if (UNMARSHALLING(ps)) {
|
|---|
| 1184 | if (str->uni_str_len) {
|
|---|
| 1185 | str->str.buffer = PRS_ALLOC_MEM(ps,uint16,str->uni_str_len);
|
|---|
| 1186 | if (str->str.buffer == NULL)
|
|---|
| 1187 | return False;
|
|---|
| 1188 | } else {
|
|---|
| 1189 | str->str.buffer = NULL;
|
|---|
| 1190 | }
|
|---|
| 1191 | }
|
|---|
| 1192 |
|
|---|
| 1193 | p = (char *)str->str.buffer;
|
|---|
| 1194 |
|
|---|
| 1195 | dbg_rw_punival(charmode, name, depth, ps, q, p, str->uni_str_len);
|
|---|
| 1196 | ps->data_offset += (str->uni_str_len * sizeof(uint16));
|
|---|
| 1197 |
|
|---|
| 1198 | return True;
|
|---|
| 1199 | }
|
|---|
| 1200 |
|
|---|
| 1201 | /*******************************************************************
|
|---|
| 1202 | Stream a unicode null-terminated string. As the string is already
|
|---|
| 1203 | in little-endian format then do it as a stream of bytes.
|
|---|
| 1204 | ********************************************************************/
|
|---|
| 1205 |
|
|---|
| 1206 | bool prs_unistr(const char *name, prs_struct *ps, int depth, UNISTR *str)
|
|---|
| 1207 | {
|
|---|
| 1208 | unsigned int len = 0;
|
|---|
| 1209 | unsigned char *p = (unsigned char *)str->buffer;
|
|---|
| 1210 | uint8 *start;
|
|---|
| 1211 | char *q;
|
|---|
| 1212 | uint32 max_len;
|
|---|
| 1213 | uint16* ptr;
|
|---|
| 1214 |
|
|---|
| 1215 | if (MARSHALLING(ps)) {
|
|---|
| 1216 |
|
|---|
| 1217 | for(len = 0; str->buffer[len] != 0; len++)
|
|---|
| 1218 | ;
|
|---|
| 1219 |
|
|---|
| 1220 | q = prs_mem_get(ps, (len+1)*2);
|
|---|
| 1221 | if (q == NULL)
|
|---|
| 1222 | return False;
|
|---|
| 1223 |
|
|---|
| 1224 | start = (uint8*)q;
|
|---|
| 1225 |
|
|---|
| 1226 | for(len = 0; str->buffer[len] != 0; len++) {
|
|---|
| 1227 | if(ps->bigendian_data) {
|
|---|
| 1228 | /* swap bytes - p is little endian, q is big endian. */
|
|---|
| 1229 | q[0] = (char)p[1];
|
|---|
| 1230 | q[1] = (char)p[0];
|
|---|
| 1231 | p += 2;
|
|---|
| 1232 | q += 2;
|
|---|
| 1233 | }
|
|---|
| 1234 | else
|
|---|
| 1235 | {
|
|---|
| 1236 | q[0] = (char)p[0];
|
|---|
| 1237 | q[1] = (char)p[1];
|
|---|
| 1238 | p += 2;
|
|---|
| 1239 | q += 2;
|
|---|
| 1240 | }
|
|---|
| 1241 | }
|
|---|
| 1242 |
|
|---|
| 1243 | /*
|
|---|
| 1244 | * even if the string is 'empty' (only an \0 char)
|
|---|
| 1245 | * at this point the leading \0 hasn't been parsed.
|
|---|
| 1246 | * so parse it now
|
|---|
| 1247 | */
|
|---|
| 1248 |
|
|---|
| 1249 | q[0] = 0;
|
|---|
| 1250 | q[1] = 0;
|
|---|
| 1251 | q += 2;
|
|---|
| 1252 |
|
|---|
| 1253 | len++;
|
|---|
| 1254 |
|
|---|
| 1255 | DEBUG(5,("%s%04x %s: ", tab_depth(5,depth), ps->data_offset, name));
|
|---|
| 1256 | print_asc(5, (unsigned char*)start, 2*len);
|
|---|
| 1257 | DEBUG(5, ("\n"));
|
|---|
| 1258 | }
|
|---|
| 1259 | else { /* unmarshalling */
|
|---|
| 1260 |
|
|---|
| 1261 | uint32 alloc_len = 0;
|
|---|
| 1262 | q = ps->data_p + prs_offset(ps);
|
|---|
| 1263 |
|
|---|
| 1264 | /*
|
|---|
| 1265 | * Work out how much space we need and talloc it.
|
|---|
| 1266 | */
|
|---|
| 1267 | max_len = (ps->buffer_size - ps->data_offset)/sizeof(uint16);
|
|---|
| 1268 |
|
|---|
| 1269 | /* the test of the value of *ptr helps to catch the circumstance
|
|---|
| 1270 | where we have an emtpty (non-existent) string in the buffer */
|
|---|
| 1271 | for ( ptr = (uint16 *)q; *ptr++ && (alloc_len <= max_len); alloc_len++)
|
|---|
| 1272 | /* do nothing */
|
|---|
| 1273 | ;
|
|---|
| 1274 |
|
|---|
| 1275 | if (alloc_len < max_len)
|
|---|
| 1276 | alloc_len += 1;
|
|---|
| 1277 |
|
|---|
| 1278 | /* should we allocate anything at all? */
|
|---|
| 1279 | str->buffer = PRS_ALLOC_MEM(ps,uint16,alloc_len);
|
|---|
| 1280 | if ((str->buffer == NULL) && (alloc_len > 0))
|
|---|
| 1281 | return False;
|
|---|
| 1282 |
|
|---|
| 1283 | p = (unsigned char *)str->buffer;
|
|---|
| 1284 |
|
|---|
| 1285 | len = 0;
|
|---|
| 1286 | /* the (len < alloc_len) test is to prevent us from overwriting
|
|---|
| 1287 | memory that is not ours...if we get that far, we have a non-null
|
|---|
| 1288 | terminated string in the buffer and have messed up somewhere */
|
|---|
| 1289 | while ((len < alloc_len) && (*(uint16 *)q != 0)) {
|
|---|
| 1290 | if(ps->bigendian_data)
|
|---|
| 1291 | {
|
|---|
| 1292 | /* swap bytes - q is big endian, p is little endian. */
|
|---|
| 1293 | p[0] = (unsigned char)q[1];
|
|---|
| 1294 | p[1] = (unsigned char)q[0];
|
|---|
| 1295 | p += 2;
|
|---|
| 1296 | q += 2;
|
|---|
| 1297 | } else {
|
|---|
| 1298 |
|
|---|
| 1299 | p[0] = (unsigned char)q[0];
|
|---|
| 1300 | p[1] = (unsigned char)q[1];
|
|---|
| 1301 | p += 2;
|
|---|
| 1302 | q += 2;
|
|---|
| 1303 | }
|
|---|
| 1304 |
|
|---|
| 1305 | len++;
|
|---|
| 1306 | }
|
|---|
| 1307 | if (len < alloc_len) {
|
|---|
| 1308 | /* NULL terminate the UNISTR */
|
|---|
| 1309 | str->buffer[len++] = '\0';
|
|---|
| 1310 | }
|
|---|
| 1311 |
|
|---|
| 1312 | DEBUG(5,("%s%04x %s: ", tab_depth(5,depth), ps->data_offset, name));
|
|---|
| 1313 | print_asc(5, (unsigned char*)str->buffer, 2*len);
|
|---|
| 1314 | DEBUG(5, ("\n"));
|
|---|
| 1315 | }
|
|---|
| 1316 |
|
|---|
| 1317 | /* set the offset in the prs_struct; 'len' points to the
|
|---|
| 1318 | terminiating NULL in the UNISTR so we need to go one more
|
|---|
| 1319 | uint16 */
|
|---|
| 1320 | ps->data_offset += (len)*2;
|
|---|
| 1321 |
|
|---|
| 1322 | return True;
|
|---|
| 1323 | }
|
|---|
| 1324 |
|
|---|
| 1325 |
|
|---|
| 1326 | /*******************************************************************
|
|---|
| 1327 | Stream a null-terminated string. len is strlen, and therefore does
|
|---|
| 1328 | not include the null-termination character.
|
|---|
| 1329 | ********************************************************************/
|
|---|
| 1330 |
|
|---|
| 1331 | bool prs_string(const char *name, prs_struct *ps, int depth, char *str, int max_buf_size)
|
|---|
| 1332 | {
|
|---|
| 1333 | char *q;
|
|---|
| 1334 | int i;
|
|---|
| 1335 | int len;
|
|---|
| 1336 |
|
|---|
| 1337 | if (UNMARSHALLING(ps))
|
|---|
| 1338 | len = strlen(&ps->data_p[ps->data_offset]);
|
|---|
| 1339 | else
|
|---|
| 1340 | len = strlen(str);
|
|---|
| 1341 |
|
|---|
| 1342 | len = MIN(len, (max_buf_size-1));
|
|---|
| 1343 |
|
|---|
| 1344 | q = prs_mem_get(ps, len+1);
|
|---|
| 1345 | if (q == NULL)
|
|---|
| 1346 | return False;
|
|---|
| 1347 |
|
|---|
| 1348 | for(i = 0; i < len; i++) {
|
|---|
| 1349 | if (UNMARSHALLING(ps))
|
|---|
| 1350 | str[i] = q[i];
|
|---|
| 1351 | else
|
|---|
| 1352 | q[i] = str[i];
|
|---|
| 1353 | }
|
|---|
| 1354 |
|
|---|
| 1355 | /* The terminating null. */
|
|---|
| 1356 | str[i] = '\0';
|
|---|
| 1357 |
|
|---|
| 1358 | if (MARSHALLING(ps)) {
|
|---|
| 1359 | q[i] = '\0';
|
|---|
| 1360 | }
|
|---|
| 1361 |
|
|---|
| 1362 | ps->data_offset += len+1;
|
|---|
| 1363 |
|
|---|
| 1364 | dump_data(5+depth, (uint8 *)q, len);
|
|---|
| 1365 |
|
|---|
| 1366 | return True;
|
|---|
| 1367 | }
|
|---|
| 1368 |
|
|---|
| 1369 | bool prs_string_alloc(const char *name, prs_struct *ps, int depth, const char **str)
|
|---|
| 1370 | {
|
|---|
| 1371 | size_t len;
|
|---|
| 1372 | char *tmp_str;
|
|---|
| 1373 |
|
|---|
| 1374 | if (UNMARSHALLING(ps)) {
|
|---|
| 1375 | len = strlen(&ps->data_p[ps->data_offset]);
|
|---|
| 1376 | } else {
|
|---|
| 1377 | len = strlen(*str);
|
|---|
| 1378 | }
|
|---|
| 1379 |
|
|---|
| 1380 | tmp_str = PRS_ALLOC_MEM(ps, char, len+1);
|
|---|
| 1381 |
|
|---|
| 1382 | if (tmp_str == NULL) {
|
|---|
| 1383 | return False;
|
|---|
| 1384 | }
|
|---|
| 1385 |
|
|---|
| 1386 | if (MARSHALLING(ps)) {
|
|---|
| 1387 | strncpy(tmp_str, *str, len);
|
|---|
| 1388 | }
|
|---|
| 1389 |
|
|---|
| 1390 | if (!prs_string(name, ps, depth, tmp_str, len+1)) {
|
|---|
| 1391 | return False;
|
|---|
| 1392 | }
|
|---|
| 1393 |
|
|---|
| 1394 | *str = tmp_str;
|
|---|
| 1395 | return True;
|
|---|
| 1396 | }
|
|---|
| 1397 |
|
|---|
| 1398 | /*******************************************************************
|
|---|
| 1399 | prs_uint16 wrapper. Call this and it sets up a pointer to where the
|
|---|
| 1400 | uint16 should be stored, or gets the size if reading.
|
|---|
| 1401 | ********************************************************************/
|
|---|
| 1402 |
|
|---|
| 1403 | bool prs_uint16_pre(const char *name, prs_struct *ps, int depth, uint16 *data16, uint32 *offset)
|
|---|
| 1404 | {
|
|---|
| 1405 | *offset = ps->data_offset;
|
|---|
| 1406 | if (UNMARSHALLING(ps)) {
|
|---|
| 1407 | /* reading. */
|
|---|
| 1408 | return prs_uint16(name, ps, depth, data16);
|
|---|
| 1409 | } else {
|
|---|
| 1410 | char *q = prs_mem_get(ps, sizeof(uint16));
|
|---|
| 1411 | if(q ==NULL)
|
|---|
| 1412 | return False;
|
|---|
| 1413 | ps->data_offset += sizeof(uint16);
|
|---|
| 1414 | }
|
|---|
| 1415 | return True;
|
|---|
| 1416 | }
|
|---|
| 1417 |
|
|---|
| 1418 | /*******************************************************************
|
|---|
| 1419 | prs_uint16 wrapper. call this and it retrospectively stores the size.
|
|---|
| 1420 | does nothing on reading, as that is already handled by ...._pre()
|
|---|
| 1421 | ********************************************************************/
|
|---|
| 1422 |
|
|---|
| 1423 | bool prs_uint16_post(const char *name, prs_struct *ps, int depth, uint16 *data16,
|
|---|
| 1424 | uint32 ptr_uint16, uint32 start_offset)
|
|---|
| 1425 | {
|
|---|
| 1426 | if (MARSHALLING(ps)) {
|
|---|
| 1427 | /*
|
|---|
| 1428 | * Writing - temporarily move the offset pointer.
|
|---|
| 1429 | */
|
|---|
| 1430 | uint16 data_size = ps->data_offset - start_offset;
|
|---|
| 1431 | uint32 old_offset = ps->data_offset;
|
|---|
| 1432 |
|
|---|
| 1433 | ps->data_offset = ptr_uint16;
|
|---|
| 1434 | if(!prs_uint16(name, ps, depth, &data_size)) {
|
|---|
| 1435 | ps->data_offset = old_offset;
|
|---|
| 1436 | return False;
|
|---|
| 1437 | }
|
|---|
| 1438 | ps->data_offset = old_offset;
|
|---|
| 1439 | } else {
|
|---|
| 1440 | ps->data_offset = start_offset + (uint32)(*data16);
|
|---|
| 1441 | }
|
|---|
| 1442 | return True;
|
|---|
| 1443 | }
|
|---|
| 1444 |
|
|---|
| 1445 | /*******************************************************************
|
|---|
| 1446 | prs_uint32 wrapper. Call this and it sets up a pointer to where the
|
|---|
| 1447 | uint32 should be stored, or gets the size if reading.
|
|---|
| 1448 | ********************************************************************/
|
|---|
| 1449 |
|
|---|
| 1450 | bool prs_uint32_pre(const char *name, prs_struct *ps, int depth, uint32 *data32, uint32 *offset)
|
|---|
| 1451 | {
|
|---|
| 1452 | *offset = ps->data_offset;
|
|---|
| 1453 | if (UNMARSHALLING(ps) && (data32 != NULL)) {
|
|---|
| 1454 | /* reading. */
|
|---|
| 1455 | return prs_uint32(name, ps, depth, data32);
|
|---|
| 1456 | } else {
|
|---|
| 1457 | ps->data_offset += sizeof(uint32);
|
|---|
| 1458 | }
|
|---|
| 1459 | return True;
|
|---|
| 1460 | }
|
|---|
| 1461 |
|
|---|
| 1462 | /*******************************************************************
|
|---|
| 1463 | prs_uint32 wrapper. call this and it retrospectively stores the size.
|
|---|
| 1464 | does nothing on reading, as that is already handled by ...._pre()
|
|---|
| 1465 | ********************************************************************/
|
|---|
| 1466 |
|
|---|
| 1467 | bool prs_uint32_post(const char *name, prs_struct *ps, int depth, uint32 *data32,
|
|---|
| 1468 | uint32 ptr_uint32, uint32 data_size)
|
|---|
| 1469 | {
|
|---|
| 1470 | if (MARSHALLING(ps)) {
|
|---|
| 1471 | /*
|
|---|
| 1472 | * Writing - temporarily move the offset pointer.
|
|---|
| 1473 | */
|
|---|
| 1474 | uint32 old_offset = ps->data_offset;
|
|---|
| 1475 | ps->data_offset = ptr_uint32;
|
|---|
| 1476 | if(!prs_uint32(name, ps, depth, &data_size)) {
|
|---|
| 1477 | ps->data_offset = old_offset;
|
|---|
| 1478 | return False;
|
|---|
| 1479 | }
|
|---|
| 1480 | ps->data_offset = old_offset;
|
|---|
| 1481 | }
|
|---|
| 1482 | return True;
|
|---|
| 1483 | }
|
|---|
| 1484 |
|
|---|
| 1485 | /* useful function to store a structure in rpc wire format */
|
|---|
| 1486 | int tdb_prs_store(TDB_CONTEXT *tdb, TDB_DATA kbuf, prs_struct *ps)
|
|---|
| 1487 | {
|
|---|
| 1488 | TDB_DATA dbuf;
|
|---|
| 1489 | dbuf.dptr = (uint8 *)ps->data_p;
|
|---|
| 1490 | dbuf.dsize = prs_offset(ps);
|
|---|
| 1491 | return tdb_trans_store(tdb, kbuf, dbuf, TDB_REPLACE);
|
|---|
| 1492 | }
|
|---|
| 1493 |
|
|---|
| 1494 | /* useful function to fetch a structure into rpc wire format */
|
|---|
| 1495 | int tdb_prs_fetch(TDB_CONTEXT *tdb, TDB_DATA kbuf, prs_struct *ps, TALLOC_CTX *mem_ctx)
|
|---|
| 1496 | {
|
|---|
| 1497 | TDB_DATA dbuf;
|
|---|
| 1498 |
|
|---|
| 1499 | prs_init_empty(ps, mem_ctx, UNMARSHALL);
|
|---|
| 1500 |
|
|---|
| 1501 | dbuf = tdb_fetch(tdb, kbuf);
|
|---|
| 1502 | if (!dbuf.dptr)
|
|---|
| 1503 | return -1;
|
|---|
| 1504 |
|
|---|
| 1505 | prs_give_memory(ps, (char *)dbuf.dptr, dbuf.dsize, True);
|
|---|
| 1506 |
|
|---|
| 1507 | return 0;
|
|---|
| 1508 | }
|
|---|
| 1509 |
|
|---|
| 1510 | /*******************************************************************
|
|---|
| 1511 | hash a stream.
|
|---|
| 1512 | ********************************************************************/
|
|---|
| 1513 |
|
|---|
| 1514 | bool prs_hash1(prs_struct *ps, uint32 offset, int len)
|
|---|
| 1515 | {
|
|---|
| 1516 | char *q;
|
|---|
| 1517 |
|
|---|
| 1518 | q = ps->data_p;
|
|---|
| 1519 | q = &q[offset];
|
|---|
| 1520 |
|
|---|
| 1521 | #ifdef DEBUG_PASSWORD
|
|---|
| 1522 | DEBUG(100, ("prs_hash1\n"));
|
|---|
| 1523 | dump_data(100, (uint8 *)ps->sess_key, 16);
|
|---|
| 1524 | dump_data(100, (uint8 *)q, len);
|
|---|
| 1525 | #endif
|
|---|
| 1526 | SamOEMhash((uchar *) q, (const unsigned char *)ps->sess_key, len);
|
|---|
| 1527 |
|
|---|
| 1528 | #ifdef DEBUG_PASSWORD
|
|---|
| 1529 | dump_data(100, (uint8 *)q, len);
|
|---|
| 1530 | #endif
|
|---|
| 1531 |
|
|---|
| 1532 | return True;
|
|---|
| 1533 | }
|
|---|
| 1534 |
|
|---|
| 1535 | /*******************************************************************
|
|---|
| 1536 | Create a digest over the entire packet (including the data), and
|
|---|
| 1537 | MD5 it with the session key.
|
|---|
| 1538 | ********************************************************************/
|
|---|
| 1539 |
|
|---|
| 1540 | static void schannel_digest(struct schannel_auth_struct *a,
|
|---|
| 1541 | enum pipe_auth_level auth_level,
|
|---|
| 1542 | RPC_AUTH_SCHANNEL_CHK * verf,
|
|---|
| 1543 | char *data, size_t data_len,
|
|---|
| 1544 | uchar digest_final[16])
|
|---|
| 1545 | {
|
|---|
| 1546 | uchar whole_packet_digest[16];
|
|---|
| 1547 | uchar zeros[4];
|
|---|
| 1548 | struct MD5Context ctx3;
|
|---|
| 1549 |
|
|---|
| 1550 | ZERO_STRUCT(zeros);
|
|---|
| 1551 |
|
|---|
| 1552 | /* verfiy the signature on the packet by MD5 over various bits */
|
|---|
| 1553 | MD5Init(&ctx3);
|
|---|
| 1554 | /* use our sequence number, which ensures the packet is not
|
|---|
| 1555 | out of order */
|
|---|
| 1556 | MD5Update(&ctx3, zeros, sizeof(zeros));
|
|---|
| 1557 | MD5Update(&ctx3, verf->sig, sizeof(verf->sig));
|
|---|
| 1558 | if (auth_level == PIPE_AUTH_LEVEL_PRIVACY) {
|
|---|
| 1559 | MD5Update(&ctx3, verf->confounder, sizeof(verf->confounder));
|
|---|
| 1560 | }
|
|---|
| 1561 | MD5Update(&ctx3, (const unsigned char *)data, data_len);
|
|---|
| 1562 | MD5Final(whole_packet_digest, &ctx3);
|
|---|
| 1563 | dump_data_pw("whole_packet_digest:\n", whole_packet_digest, sizeof(whole_packet_digest));
|
|---|
| 1564 |
|
|---|
| 1565 | /* MD5 this result and the session key, to prove that
|
|---|
| 1566 | only a valid client could had produced this */
|
|---|
| 1567 | hmac_md5(a->sess_key, whole_packet_digest, sizeof(whole_packet_digest), digest_final);
|
|---|
| 1568 | }
|
|---|
| 1569 |
|
|---|
| 1570 | /*******************************************************************
|
|---|
| 1571 | Calculate the key with which to encode the data payload
|
|---|
| 1572 | ********************************************************************/
|
|---|
| 1573 |
|
|---|
| 1574 | static void schannel_get_sealing_key(struct schannel_auth_struct *a,
|
|---|
| 1575 | RPC_AUTH_SCHANNEL_CHK *verf,
|
|---|
| 1576 | uchar sealing_key[16])
|
|---|
| 1577 | {
|
|---|
| 1578 | uchar zeros[4];
|
|---|
| 1579 | uchar digest2[16];
|
|---|
| 1580 | uchar sess_kf0[16];
|
|---|
| 1581 | int i;
|
|---|
| 1582 |
|
|---|
| 1583 | ZERO_STRUCT(zeros);
|
|---|
| 1584 |
|
|---|
| 1585 | for (i = 0; i < sizeof(sess_kf0); i++) {
|
|---|
| 1586 | sess_kf0[i] = a->sess_key[i] ^ 0xf0;
|
|---|
| 1587 | }
|
|---|
| 1588 |
|
|---|
| 1589 | dump_data_pw("sess_kf0:\n", sess_kf0, sizeof(sess_kf0));
|
|---|
| 1590 |
|
|---|
| 1591 | /* MD5 of sess_kf0 and 4 zero bytes */
|
|---|
| 1592 | hmac_md5(sess_kf0, zeros, 0x4, digest2);
|
|---|
| 1593 | dump_data_pw("digest2:\n", digest2, sizeof(digest2));
|
|---|
| 1594 |
|
|---|
| 1595 | /* MD5 of the above result, plus 8 bytes of sequence number */
|
|---|
| 1596 | hmac_md5(digest2, verf->seq_num, sizeof(verf->seq_num), sealing_key);
|
|---|
| 1597 | dump_data_pw("sealing_key:\n", sealing_key, 16);
|
|---|
| 1598 | }
|
|---|
| 1599 |
|
|---|
| 1600 | /*******************************************************************
|
|---|
| 1601 | Encode or Decode the sequence number (which is symmetric)
|
|---|
| 1602 | ********************************************************************/
|
|---|
| 1603 |
|
|---|
| 1604 | static void schannel_deal_with_seq_num(struct schannel_auth_struct *a,
|
|---|
| 1605 | RPC_AUTH_SCHANNEL_CHK *verf)
|
|---|
| 1606 | {
|
|---|
| 1607 | uchar zeros[4];
|
|---|
| 1608 | uchar sequence_key[16];
|
|---|
| 1609 | uchar digest1[16];
|
|---|
| 1610 |
|
|---|
| 1611 | ZERO_STRUCT(zeros);
|
|---|
| 1612 |
|
|---|
| 1613 | hmac_md5(a->sess_key, zeros, sizeof(zeros), digest1);
|
|---|
| 1614 | dump_data_pw("(sequence key) digest1:\n", digest1, sizeof(digest1));
|
|---|
| 1615 |
|
|---|
| 1616 | hmac_md5(digest1, verf->packet_digest, 8, sequence_key);
|
|---|
| 1617 |
|
|---|
| 1618 | dump_data_pw("sequence_key:\n", sequence_key, sizeof(sequence_key));
|
|---|
| 1619 |
|
|---|
| 1620 | dump_data_pw("seq_num (before):\n", verf->seq_num, sizeof(verf->seq_num));
|
|---|
| 1621 | SamOEMhash(verf->seq_num, sequence_key, 8);
|
|---|
| 1622 | dump_data_pw("seq_num (after):\n", verf->seq_num, sizeof(verf->seq_num));
|
|---|
| 1623 | }
|
|---|
| 1624 |
|
|---|
| 1625 | /*******************************************************************
|
|---|
| 1626 | creates an RPC_AUTH_SCHANNEL_CHK structure.
|
|---|
| 1627 | ********************************************************************/
|
|---|
| 1628 |
|
|---|
| 1629 | static bool init_rpc_auth_schannel_chk(RPC_AUTH_SCHANNEL_CHK * chk,
|
|---|
| 1630 | const uchar sig[8],
|
|---|
| 1631 | const uchar packet_digest[8],
|
|---|
| 1632 | const uchar seq_num[8], const uchar confounder[8])
|
|---|
| 1633 | {
|
|---|
| 1634 | if (chk == NULL)
|
|---|
| 1635 | return False;
|
|---|
| 1636 |
|
|---|
| 1637 | memcpy(chk->sig, sig, sizeof(chk->sig));
|
|---|
| 1638 | memcpy(chk->packet_digest, packet_digest, sizeof(chk->packet_digest));
|
|---|
| 1639 | memcpy(chk->seq_num, seq_num, sizeof(chk->seq_num));
|
|---|
| 1640 | memcpy(chk->confounder, confounder, sizeof(chk->confounder));
|
|---|
| 1641 |
|
|---|
| 1642 | return True;
|
|---|
| 1643 | }
|
|---|
| 1644 |
|
|---|
| 1645 | /*******************************************************************
|
|---|
| 1646 | Encode a blob of data using the schannel alogrithm, also produceing
|
|---|
| 1647 | a checksum over the original data. We currently only support
|
|---|
| 1648 | signing and sealing togeather - the signing-only code is close, but not
|
|---|
| 1649 | quite compatible with what MS does.
|
|---|
| 1650 | ********************************************************************/
|
|---|
| 1651 |
|
|---|
| 1652 | void schannel_encode(struct schannel_auth_struct *a, enum pipe_auth_level auth_level,
|
|---|
| 1653 | enum schannel_direction direction,
|
|---|
| 1654 | RPC_AUTH_SCHANNEL_CHK * verf,
|
|---|
| 1655 | char *data, size_t data_len)
|
|---|
| 1656 | {
|
|---|
| 1657 | uchar digest_final[16];
|
|---|
| 1658 | uchar confounder[8];
|
|---|
| 1659 | uchar seq_num[8];
|
|---|
| 1660 | static const uchar nullbytes[8] = { 0, };
|
|---|
| 1661 |
|
|---|
| 1662 | static const uchar schannel_seal_sig[8] = SCHANNEL_SEAL_SIGNATURE;
|
|---|
| 1663 | static const uchar schannel_sign_sig[8] = SCHANNEL_SIGN_SIGNATURE;
|
|---|
| 1664 | const uchar *schannel_sig = NULL;
|
|---|
| 1665 |
|
|---|
| 1666 | DEBUG(10,("SCHANNEL: schannel_encode seq_num=%d data_len=%lu\n", a->seq_num, (unsigned long)data_len));
|
|---|
| 1667 |
|
|---|
| 1668 | if (auth_level == PIPE_AUTH_LEVEL_PRIVACY) {
|
|---|
| 1669 | schannel_sig = schannel_seal_sig;
|
|---|
| 1670 | } else {
|
|---|
| 1671 | schannel_sig = schannel_sign_sig;
|
|---|
| 1672 | }
|
|---|
| 1673 |
|
|---|
| 1674 | /* fill the 'confounder' with random data */
|
|---|
| 1675 | generate_random_buffer(confounder, sizeof(confounder));
|
|---|
| 1676 |
|
|---|
| 1677 | dump_data_pw("a->sess_key:\n", a->sess_key, sizeof(a->sess_key));
|
|---|
| 1678 |
|
|---|
| 1679 | RSIVAL(seq_num, 0, a->seq_num);
|
|---|
| 1680 |
|
|---|
| 1681 | switch (direction) {
|
|---|
| 1682 | case SENDER_IS_INITIATOR:
|
|---|
| 1683 | SIVAL(seq_num, 4, 0x80);
|
|---|
| 1684 | break;
|
|---|
| 1685 | case SENDER_IS_ACCEPTOR:
|
|---|
| 1686 | SIVAL(seq_num, 4, 0x0);
|
|---|
| 1687 | break;
|
|---|
| 1688 | }
|
|---|
| 1689 |
|
|---|
| 1690 | dump_data_pw("verf->seq_num:\n", seq_num, sizeof(verf->seq_num));
|
|---|
| 1691 |
|
|---|
| 1692 | init_rpc_auth_schannel_chk(verf, schannel_sig, nullbytes,
|
|---|
| 1693 | seq_num, confounder);
|
|---|
| 1694 |
|
|---|
| 1695 | /* produce a digest of the packet to prove it's legit (before we seal it) */
|
|---|
| 1696 | schannel_digest(a, auth_level, verf, data, data_len, digest_final);
|
|---|
| 1697 | memcpy(verf->packet_digest, digest_final, sizeof(verf->packet_digest));
|
|---|
| 1698 |
|
|---|
| 1699 | if (auth_level == PIPE_AUTH_LEVEL_PRIVACY) {
|
|---|
| 1700 | uchar sealing_key[16];
|
|---|
| 1701 |
|
|---|
| 1702 | /* get the key to encode the data with */
|
|---|
| 1703 | schannel_get_sealing_key(a, verf, sealing_key);
|
|---|
| 1704 |
|
|---|
| 1705 | /* encode the verification data */
|
|---|
| 1706 | dump_data_pw("verf->confounder:\n", verf->confounder, sizeof(verf->confounder));
|
|---|
| 1707 | SamOEMhash(verf->confounder, sealing_key, 8);
|
|---|
| 1708 |
|
|---|
| 1709 | dump_data_pw("verf->confounder_enc:\n", verf->confounder, sizeof(verf->confounder));
|
|---|
| 1710 |
|
|---|
| 1711 | /* encode the packet payload */
|
|---|
| 1712 | dump_data_pw("data:\n", (const unsigned char *)data, data_len);
|
|---|
| 1713 | SamOEMhash((unsigned char *)data, sealing_key, data_len);
|
|---|
| 1714 | dump_data_pw("data_enc:\n", (const unsigned char *)data, data_len);
|
|---|
| 1715 | }
|
|---|
| 1716 |
|
|---|
| 1717 | /* encode the sequence number (key based on packet digest) */
|
|---|
| 1718 | /* needs to be done after the sealing, as the original version
|
|---|
| 1719 | is used in the sealing stuff... */
|
|---|
| 1720 | schannel_deal_with_seq_num(a, verf);
|
|---|
| 1721 |
|
|---|
| 1722 | return;
|
|---|
| 1723 | }
|
|---|
| 1724 |
|
|---|
| 1725 | /*******************************************************************
|
|---|
| 1726 | Decode a blob of data using the schannel alogrithm, also verifiying
|
|---|
| 1727 | a checksum over the original data. We currently can verify signed messages,
|
|---|
| 1728 | as well as decode sealed messages
|
|---|
| 1729 | ********************************************************************/
|
|---|
| 1730 |
|
|---|
| 1731 | bool schannel_decode(struct schannel_auth_struct *a, enum pipe_auth_level auth_level,
|
|---|
| 1732 | enum schannel_direction direction,
|
|---|
| 1733 | RPC_AUTH_SCHANNEL_CHK * verf, char *data, size_t data_len)
|
|---|
| 1734 | {
|
|---|
| 1735 | uchar digest_final[16];
|
|---|
| 1736 |
|
|---|
| 1737 | static const uchar schannel_seal_sig[8] = SCHANNEL_SEAL_SIGNATURE;
|
|---|
| 1738 | static const uchar schannel_sign_sig[8] = SCHANNEL_SIGN_SIGNATURE;
|
|---|
| 1739 | const uchar *schannel_sig = NULL;
|
|---|
| 1740 |
|
|---|
| 1741 | uchar seq_num[8];
|
|---|
| 1742 |
|
|---|
| 1743 | DEBUG(10,("SCHANNEL: schannel_decode seq_num=%d data_len=%lu\n", a->seq_num, (unsigned long)data_len));
|
|---|
| 1744 |
|
|---|
| 1745 | if (auth_level == PIPE_AUTH_LEVEL_PRIVACY) {
|
|---|
| 1746 | schannel_sig = schannel_seal_sig;
|
|---|
| 1747 | } else {
|
|---|
| 1748 | schannel_sig = schannel_sign_sig;
|
|---|
| 1749 | }
|
|---|
| 1750 |
|
|---|
| 1751 | /* Create the expected sequence number for comparison */
|
|---|
| 1752 | RSIVAL(seq_num, 0, a->seq_num);
|
|---|
| 1753 |
|
|---|
| 1754 | switch (direction) {
|
|---|
| 1755 | case SENDER_IS_INITIATOR:
|
|---|
| 1756 | SIVAL(seq_num, 4, 0x80);
|
|---|
| 1757 | break;
|
|---|
| 1758 | case SENDER_IS_ACCEPTOR:
|
|---|
| 1759 | SIVAL(seq_num, 4, 0x0);
|
|---|
| 1760 | break;
|
|---|
| 1761 | }
|
|---|
| 1762 |
|
|---|
| 1763 | DEBUG(10,("SCHANNEL: schannel_decode seq_num=%d data_len=%lu\n", a->seq_num, (unsigned long)data_len));
|
|---|
| 1764 | dump_data_pw("a->sess_key:\n", a->sess_key, sizeof(a->sess_key));
|
|---|
| 1765 |
|
|---|
| 1766 | dump_data_pw("seq_num:\n", seq_num, sizeof(seq_num));
|
|---|
| 1767 |
|
|---|
| 1768 | /* extract the sequence number (key based on supplied packet digest) */
|
|---|
| 1769 | /* needs to be done before the sealing, as the original version
|
|---|
| 1770 | is used in the sealing stuff... */
|
|---|
| 1771 | schannel_deal_with_seq_num(a, verf);
|
|---|
| 1772 |
|
|---|
| 1773 | if (memcmp(verf->seq_num, seq_num, sizeof(seq_num))) {
|
|---|
| 1774 | /* don't even bother with the below if the sequence number is out */
|
|---|
| 1775 | /* The sequence number is MD5'ed with a key based on the whole-packet
|
|---|
| 1776 | digest, as supplied by the client. We check that it's a valid
|
|---|
| 1777 | checksum after the decode, below
|
|---|
| 1778 | */
|
|---|
| 1779 | DEBUG(2, ("schannel_decode: FAILED: packet sequence number:\n"));
|
|---|
| 1780 | dump_data(2, verf->seq_num, sizeof(verf->seq_num));
|
|---|
| 1781 | DEBUG(2, ("should be:\n"));
|
|---|
| 1782 | dump_data(2, seq_num, sizeof(seq_num));
|
|---|
| 1783 |
|
|---|
| 1784 | return False;
|
|---|
| 1785 | }
|
|---|
| 1786 |
|
|---|
| 1787 | if (memcmp(verf->sig, schannel_sig, sizeof(verf->sig))) {
|
|---|
| 1788 | /* Validate that the other end sent the expected header */
|
|---|
| 1789 | DEBUG(2, ("schannel_decode: FAILED: packet header:\n"));
|
|---|
| 1790 | dump_data(2, verf->sig, sizeof(verf->sig));
|
|---|
| 1791 | DEBUG(2, ("should be:\n"));
|
|---|
| 1792 | dump_data(2, schannel_sig, sizeof(schannel_sig));
|
|---|
| 1793 | return False;
|
|---|
| 1794 | }
|
|---|
| 1795 |
|
|---|
| 1796 | if (auth_level == PIPE_AUTH_LEVEL_PRIVACY) {
|
|---|
| 1797 | uchar sealing_key[16];
|
|---|
| 1798 |
|
|---|
| 1799 | /* get the key to extract the data with */
|
|---|
| 1800 | schannel_get_sealing_key(a, verf, sealing_key);
|
|---|
| 1801 |
|
|---|
| 1802 | /* extract the verification data */
|
|---|
| 1803 | dump_data_pw("verf->confounder:\n", verf->confounder,
|
|---|
| 1804 | sizeof(verf->confounder));
|
|---|
| 1805 | SamOEMhash(verf->confounder, sealing_key, 8);
|
|---|
| 1806 |
|
|---|
| 1807 | dump_data_pw("verf->confounder_dec:\n", verf->confounder,
|
|---|
| 1808 | sizeof(verf->confounder));
|
|---|
| 1809 |
|
|---|
| 1810 | /* extract the packet payload */
|
|---|
| 1811 | dump_data_pw("data :\n", (const unsigned char *)data, data_len);
|
|---|
| 1812 | SamOEMhash((unsigned char *)data, sealing_key, data_len);
|
|---|
| 1813 | dump_data_pw("datadec:\n", (const unsigned char *)data, data_len);
|
|---|
| 1814 | }
|
|---|
| 1815 |
|
|---|
| 1816 | /* digest includes 'data' after unsealing */
|
|---|
| 1817 | schannel_digest(a, auth_level, verf, data, data_len, digest_final);
|
|---|
| 1818 |
|
|---|
| 1819 | dump_data_pw("Calculated digest:\n", digest_final,
|
|---|
| 1820 | sizeof(digest_final));
|
|---|
| 1821 | dump_data_pw("verf->packet_digest:\n", verf->packet_digest,
|
|---|
| 1822 | sizeof(verf->packet_digest));
|
|---|
| 1823 |
|
|---|
| 1824 | /* compare - if the client got the same result as us, then
|
|---|
| 1825 | it must know the session key */
|
|---|
| 1826 | return (memcmp(digest_final, verf->packet_digest,
|
|---|
| 1827 | sizeof(verf->packet_digest)) == 0);
|
|---|
| 1828 | }
|
|---|
| 1829 |
|
|---|
| 1830 | /*******************************************************************
|
|---|
| 1831 | creates a new prs_struct containing a DATA_BLOB
|
|---|
| 1832 | ********************************************************************/
|
|---|
| 1833 | bool prs_init_data_blob(prs_struct *prs, DATA_BLOB *blob, TALLOC_CTX *mem_ctx)
|
|---|
| 1834 | {
|
|---|
| 1835 | if (!prs_init( prs, RPC_MAX_PDU_FRAG_LEN, mem_ctx, MARSHALL ))
|
|---|
| 1836 | return False;
|
|---|
| 1837 |
|
|---|
| 1838 |
|
|---|
| 1839 | if (!prs_copy_data_in(prs, (char *)blob->data, blob->length))
|
|---|
| 1840 | return False;
|
|---|
| 1841 |
|
|---|
| 1842 | return True;
|
|---|
| 1843 | }
|
|---|
| 1844 |
|
|---|
| 1845 | /*******************************************************************
|
|---|
| 1846 | return the contents of a prs_struct in a DATA_BLOB
|
|---|
| 1847 | ********************************************************************/
|
|---|
| 1848 | bool prs_data_blob(prs_struct *prs, DATA_BLOB *blob, TALLOC_CTX *mem_ctx)
|
|---|
| 1849 | {
|
|---|
| 1850 | blob->length = prs_data_size(prs);
|
|---|
| 1851 | blob->data = (uint8 *)TALLOC_ZERO_SIZE(mem_ctx, blob->length);
|
|---|
| 1852 |
|
|---|
| 1853 | /* set the pointer at the end of the buffer */
|
|---|
| 1854 | prs_set_offset( prs, prs_data_size(prs) );
|
|---|
| 1855 |
|
|---|
| 1856 | if (!prs_copy_all_data_out((char *)blob->data, prs))
|
|---|
| 1857 | return False;
|
|---|
| 1858 |
|
|---|
| 1859 | return True;
|
|---|
| 1860 | }
|
|---|