1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495
// // DO NOT EDIT. THIS FILE IS GENERATED FROM ../../../dist/idl/nsIUrlClassifierHashCompleter.idl // /// `interface nsIFullHashMatch : nsISupports` /// /// ```text /// /** /// * This interface contains feilds in Matches object of FullHashResponse(V4). /// * Reference from: /// * https://developers.google.com/safe-browsing/v4/update-api#http-post-response_2 /// */ /// ``` /// // The actual type definition for the interface. This struct has methods // declared on it which will call through its vtable. You never want to pass // this type around by value, always pass it behind a reference. #[repr(C)] pub struct nsIFullHashMatch { vtable: *const nsIFullHashMatchVTable, /// This field is a phantomdata to ensure that the VTable type and any /// struct containing it is not safe to send across threads, as XPCOM is /// generally not threadsafe. /// /// XPCOM interfaces in general are not safe to send across threads. __nosync: ::std::marker::PhantomData<::std::rc::Rc<u8>>, } // Implementing XpCom for an interface exposes its IID, which allows for easy // use of the `.query_interface<T>` helper method. This also defines that // method for nsIFullHashMatch. unsafe impl XpCom for nsIFullHashMatch { const IID: nsIID = nsID(0xaabeb50e, 0xd9f7, 0x418e, [0x94, 0x69, 0x2c, 0xd9, 0x60, 0x89, 0x58, 0xc0]); } // We need to implement the RefCounted trait so we can be used with `RefPtr`. // This trait teaches `RefPtr` how to manage our memory. unsafe impl RefCounted for nsIFullHashMatch { #[inline] unsafe fn addref(&self) { self.AddRef(); } #[inline] unsafe fn release(&self) { self.Release(); } } // This trait is implemented on all types which can be coerced to from nsIFullHashMatch. // It is used in the implementation of `fn coerce<T>`. We hide it from the // documentation, because it clutters it up a lot. #[doc(hidden)] pub trait nsIFullHashMatchCoerce { /// Cheaply cast a value of this type from a `nsIFullHashMatch`. fn coerce_from(v: &nsIFullHashMatch) -> &Self; } // The trivial implementation: We can obviously coerce ourselves to ourselves. impl nsIFullHashMatchCoerce for nsIFullHashMatch { #[inline] fn coerce_from(v: &nsIFullHashMatch) -> &Self { v } } impl nsIFullHashMatch { /// Cast this `nsIFullHashMatch` to one of its base interfaces. #[inline] pub fn coerce<T: nsIFullHashMatchCoerce>(&self) -> &T { T::coerce_from(self) } } // Every interface struct type implements `Deref` to its base interface. This // causes methods on the base interfaces to be directly avaliable on the // object. For example, you can call `.AddRef` or `.QueryInterface` directly // on any interface which inherits from `nsISupports`. impl ::std::ops::Deref for nsIFullHashMatch { type Target = nsISupports; #[inline] fn deref(&self) -> &nsISupports { unsafe { ::std::mem::transmute(self) } } } // Ensure we can use .coerce() to cast to our base types as well. Any type which // our base interface can coerce from should be coercable from us as well. impl<T: nsISupportsCoerce> nsIFullHashMatchCoerce for T { #[inline] fn coerce_from(v: &nsIFullHashMatch) -> &Self { T::coerce_from(v) } } // This struct represents the interface's VTable. A pointer to a statically // allocated version of this struct is at the beginning of every nsIFullHashMatch // object. It contains one pointer field for each method in the interface. In // the case where we can't generate a binding for a method, we include a void // pointer. #[doc(hidden)] #[repr(C)] pub struct nsIFullHashMatchVTable { /// We need to include the members from the base interface's vtable at the start /// of the VTable definition. pub __base: nsISupportsVTable, /* readonly attribute ACString tableName; */ pub GetTableName: unsafe extern "system" fn (this: *const nsIFullHashMatch, aTableName: &mut ::nsstring::nsACString) -> nsresult, /* readonly attribute ACString fullHash; */ pub GetFullHash: unsafe extern "system" fn (this: *const nsIFullHashMatch, aFullHash: &mut ::nsstring::nsACString) -> nsresult, /* readonly attribute uint32_t cacheDuration; */ pub GetCacheDuration: unsafe extern "system" fn (this: *const nsIFullHashMatch, aCacheDuration: *mut uint32_t) -> nsresult, } // The implementations of the function wrappers which are exposed to rust code. // Call these methods rather than manually calling through the VTable struct. impl nsIFullHashMatch { /// `readonly attribute ACString tableName;` #[inline] pub unsafe fn GetTableName(&self, aTableName: &mut ::nsstring::nsACString) -> nsresult { ((*self.vtable).GetTableName)(self, aTableName) } /// `readonly attribute ACString fullHash;` #[inline] pub unsafe fn GetFullHash(&self, aFullHash: &mut ::nsstring::nsACString) -> nsresult { ((*self.vtable).GetFullHash)(self, aFullHash) } /// `readonly attribute uint32_t cacheDuration;` #[inline] pub unsafe fn GetCacheDuration(&self, aCacheDuration: *mut uint32_t) -> nsresult { ((*self.vtable).GetCacheDuration)(self, aCacheDuration) } } /// `interface nsIUrlClassifierHashCompleterCallback : nsISupports` /// /// ```text /// /** /// * This interface is implemented by nsIUrlClassifierHashCompleter clients. /// */ /// ``` /// // The actual type definition for the interface. This struct has methods // declared on it which will call through its vtable. You never want to pass // this type around by value, always pass it behind a reference. #[repr(C)] pub struct nsIUrlClassifierHashCompleterCallback { vtable: *const nsIUrlClassifierHashCompleterCallbackVTable, /// This field is a phantomdata to ensure that the VTable type and any /// struct containing it is not safe to send across threads, as XPCOM is /// generally not threadsafe. /// /// XPCOM interfaces in general are not safe to send across threads. __nosync: ::std::marker::PhantomData<::std::rc::Rc<u8>>, } // Implementing XpCom for an interface exposes its IID, which allows for easy // use of the `.query_interface<T>` helper method. This also defines that // method for nsIUrlClassifierHashCompleterCallback. unsafe impl XpCom for nsIUrlClassifierHashCompleterCallback { const IID: nsIID = nsID(0xda16de40, 0xdf26, 0x414d, [0xbd, 0xe7, 0xc4, 0xfa, 0xf4, 0x50, 0x48, 0x68]); } // We need to implement the RefCounted trait so we can be used with `RefPtr`. // This trait teaches `RefPtr` how to manage our memory. unsafe impl RefCounted for nsIUrlClassifierHashCompleterCallback { #[inline] unsafe fn addref(&self) { self.AddRef(); } #[inline] unsafe fn release(&self) { self.Release(); } } // This trait is implemented on all types which can be coerced to from nsIUrlClassifierHashCompleterCallback. // It is used in the implementation of `fn coerce<T>`. We hide it from the // documentation, because it clutters it up a lot. #[doc(hidden)] pub trait nsIUrlClassifierHashCompleterCallbackCoerce { /// Cheaply cast a value of this type from a `nsIUrlClassifierHashCompleterCallback`. fn coerce_from(v: &nsIUrlClassifierHashCompleterCallback) -> &Self; } // The trivial implementation: We can obviously coerce ourselves to ourselves. impl nsIUrlClassifierHashCompleterCallbackCoerce for nsIUrlClassifierHashCompleterCallback { #[inline] fn coerce_from(v: &nsIUrlClassifierHashCompleterCallback) -> &Self { v } } impl nsIUrlClassifierHashCompleterCallback { /// Cast this `nsIUrlClassifierHashCompleterCallback` to one of its base interfaces. #[inline] pub fn coerce<T: nsIUrlClassifierHashCompleterCallbackCoerce>(&self) -> &T { T::coerce_from(self) } } // Every interface struct type implements `Deref` to its base interface. This // causes methods on the base interfaces to be directly avaliable on the // object. For example, you can call `.AddRef` or `.QueryInterface` directly // on any interface which inherits from `nsISupports`. impl ::std::ops::Deref for nsIUrlClassifierHashCompleterCallback { type Target = nsISupports; #[inline] fn deref(&self) -> &nsISupports { unsafe { ::std::mem::transmute(self) } } } // Ensure we can use .coerce() to cast to our base types as well. Any type which // our base interface can coerce from should be coercable from us as well. impl<T: nsISupportsCoerce> nsIUrlClassifierHashCompleterCallbackCoerce for T { #[inline] fn coerce_from(v: &nsIUrlClassifierHashCompleterCallback) -> &Self { T::coerce_from(v) } } // This struct represents the interface's VTable. A pointer to a statically // allocated version of this struct is at the beginning of every nsIUrlClassifierHashCompleterCallback // object. It contains one pointer field for each method in the interface. In // the case where we can't generate a binding for a method, we include a void // pointer. #[doc(hidden)] #[repr(C)] pub struct nsIUrlClassifierHashCompleterCallbackVTable { /// We need to include the members from the base interface's vtable at the start /// of the VTable definition. pub __base: nsISupportsVTable, /* void completionV2 (in ACString hash, in ACString table, in uint32_t chunkId); */ pub CompletionV2: unsafe extern "system" fn (this: *const nsIUrlClassifierHashCompleterCallback, hash: &::nsstring::nsACString, table: &::nsstring::nsACString, chunkId: uint32_t) -> nsresult, /* void completionV4 (in ACString partialHash, in ACString table, in uint32_t negativeCacheDuration, in nsIArray fullHashes); */ pub CompletionV4: unsafe extern "system" fn (this: *const nsIUrlClassifierHashCompleterCallback, partialHash: &::nsstring::nsACString, table: &::nsstring::nsACString, negativeCacheDuration: uint32_t, fullHashes: *const nsIArray) -> nsresult, /* void completionFinished (in nsresult status); */ pub CompletionFinished: unsafe extern "system" fn (this: *const nsIUrlClassifierHashCompleterCallback, status: nsresult) -> nsresult, } // The implementations of the function wrappers which are exposed to rust code. // Call these methods rather than manually calling through the VTable struct. impl nsIUrlClassifierHashCompleterCallback { /// ```text /// /** /// * A complete hash has been found that matches the partial hash. /// * This method may be called 0-n times for a given /// * nsIUrlClassifierCompleter::complete() call. /// * /// * @param hash /// * The 256-bit hash that was discovered. /// * @param table /// * The name of the table that this hash belongs to. /// * @param chunkId /// * The database chunk that this hash belongs to. /// */ /// ``` /// /// `void completionV2 (in ACString hash, in ACString table, in uint32_t chunkId);` #[inline] pub unsafe fn CompletionV2(&self, hash: &::nsstring::nsACString, table: &::nsstring::nsACString, chunkId: uint32_t) -> nsresult { ((*self.vtable).CompletionV2)(self, hash, table, chunkId) } /// ```text /// /** /// * This will be called when a fullhash response is received and parsed /// * no matter if any full hash has been found. /// * /// * @param partialHash /// * The hash that was sent for completion. /// * @param table /// * The name of the table that this hash belongs to. /// * @param negativeCacheDuration /// * The negative cache duration in millisecond. /// * @param fullHashes /// * Array of fullhashes that match the prefix. /// */ /// ``` /// /// `void completionV4 (in ACString partialHash, in ACString table, in uint32_t negativeCacheDuration, in nsIArray fullHashes);` #[inline] pub unsafe fn CompletionV4(&self, partialHash: &::nsstring::nsACString, table: &::nsstring::nsACString, negativeCacheDuration: uint32_t, fullHashes: *const nsIArray) -> nsresult { ((*self.vtable).CompletionV4)(self, partialHash, table, negativeCacheDuration, fullHashes) } /// ```text /// /** /// * The completion is complete. This method is called once per /// * nsIUrlClassifierCompleter::complete() call, after all completion() /// * calls are finished. /// * /// * @param status /// * NS_OK if the request completed successfully, or an error code. /// */ /// ``` /// /// `void completionFinished (in nsresult status);` #[inline] pub unsafe fn CompletionFinished(&self, status: nsresult) -> nsresult { ((*self.vtable).CompletionFinished)(self, status) } } /// `interface nsIUrlClassifierHashCompleter : nsISupports` /// /// ```text /// /** /// * Clients updating the url-classifier database have the option of sending /// * partial (32-bit) hashes of URL fragments to be blacklisted. If the /// * url-classifier encounters one of these truncated hashes, it will ask an /// * nsIUrlClassifierCompleter instance to asynchronously provide the complete /// * hash, along with some associated metadata. /// * This is only ever used for testing and should absolutely be deleted (I /// * think). /// */ /// ``` /// // The actual type definition for the interface. This struct has methods // declared on it which will call through its vtable. You never want to pass // this type around by value, always pass it behind a reference. #[repr(C)] pub struct nsIUrlClassifierHashCompleter { vtable: *const nsIUrlClassifierHashCompleterVTable, /// This field is a phantomdata to ensure that the VTable type and any /// struct containing it is not safe to send across threads, as XPCOM is /// generally not threadsafe. /// /// XPCOM interfaces in general are not safe to send across threads. __nosync: ::std::marker::PhantomData<::std::rc::Rc<u8>>, } // Implementing XpCom for an interface exposes its IID, which allows for easy // use of the `.query_interface<T>` helper method. This also defines that // method for nsIUrlClassifierHashCompleter. unsafe impl XpCom for nsIUrlClassifierHashCompleter { const IID: nsIID = nsID(0x231fb2ad, 0xea8a, 0x4e63, [0xa3, 0x31, 0xea, 0xfc, 0x3b, 0x43, 0x48, 0x11]); } // We need to implement the RefCounted trait so we can be used with `RefPtr`. // This trait teaches `RefPtr` how to manage our memory. unsafe impl RefCounted for nsIUrlClassifierHashCompleter { #[inline] unsafe fn addref(&self) { self.AddRef(); } #[inline] unsafe fn release(&self) { self.Release(); } } // This trait is implemented on all types which can be coerced to from nsIUrlClassifierHashCompleter. // It is used in the implementation of `fn coerce<T>`. We hide it from the // documentation, because it clutters it up a lot. #[doc(hidden)] pub trait nsIUrlClassifierHashCompleterCoerce { /// Cheaply cast a value of this type from a `nsIUrlClassifierHashCompleter`. fn coerce_from(v: &nsIUrlClassifierHashCompleter) -> &Self; } // The trivial implementation: We can obviously coerce ourselves to ourselves. impl nsIUrlClassifierHashCompleterCoerce for nsIUrlClassifierHashCompleter { #[inline] fn coerce_from(v: &nsIUrlClassifierHashCompleter) -> &Self { v } } impl nsIUrlClassifierHashCompleter { /// Cast this `nsIUrlClassifierHashCompleter` to one of its base interfaces. #[inline] pub fn coerce<T: nsIUrlClassifierHashCompleterCoerce>(&self) -> &T { T::coerce_from(self) } } // Every interface struct type implements `Deref` to its base interface. This // causes methods on the base interfaces to be directly avaliable on the // object. For example, you can call `.AddRef` or `.QueryInterface` directly // on any interface which inherits from `nsISupports`. impl ::std::ops::Deref for nsIUrlClassifierHashCompleter { type Target = nsISupports; #[inline] fn deref(&self) -> &nsISupports { unsafe { ::std::mem::transmute(self) } } } // Ensure we can use .coerce() to cast to our base types as well. Any type which // our base interface can coerce from should be coercable from us as well. impl<T: nsISupportsCoerce> nsIUrlClassifierHashCompleterCoerce for T { #[inline] fn coerce_from(v: &nsIUrlClassifierHashCompleter) -> &Self { T::coerce_from(v) } } // This struct represents the interface's VTable. A pointer to a statically // allocated version of this struct is at the beginning of every nsIUrlClassifierHashCompleter // object. It contains one pointer field for each method in the interface. In // the case where we can't generate a binding for a method, we include a void // pointer. #[doc(hidden)] #[repr(C)] pub struct nsIUrlClassifierHashCompleterVTable { /// We need to include the members from the base interface's vtable at the start /// of the VTable definition. pub __base: nsISupportsVTable, /* void complete (in ACString partialHash, in ACString gethashUrl, in ACString tableName, in nsIUrlClassifierHashCompleterCallback callback); */ pub Complete: unsafe extern "system" fn (this: *const nsIUrlClassifierHashCompleter, partialHash: &::nsstring::nsACString, gethashUrl: &::nsstring::nsACString, tableName: &::nsstring::nsACString, callback: *const nsIUrlClassifierHashCompleterCallback) -> nsresult, } // The implementations of the function wrappers which are exposed to rust code. // Call these methods rather than manually calling through the VTable struct. impl nsIUrlClassifierHashCompleter { /// ```text /// /** /// * Request a completed hash from the given gethash url. /// * /// * @param partialHash /// * The 32-bit hash encountered by the url-classifier. /// * @param gethashUrl /// * The gethash url to use. /// * @param tableName /// * The table where we matched the partial hash. /// * @param callback /// * An nsIUrlClassifierCompleterCallback instance. /// */ /// ``` /// /// `void complete (in ACString partialHash, in ACString gethashUrl, in ACString tableName, in nsIUrlClassifierHashCompleterCallback callback);` #[inline] pub unsafe fn Complete(&self, partialHash: &::nsstring::nsACString, gethashUrl: &::nsstring::nsACString, tableName: &::nsstring::nsACString, callback: *const nsIUrlClassifierHashCompleterCallback) -> nsresult { ((*self.vtable).Complete)(self, partialHash, gethashUrl, tableName, callback) } }